Identification of catalytic bases in the active site of Escherichia coli methylglyoxal synthase: cloning, expression, and functional characterization of conserved aspartic acid residues

Methylglyoxal synthase provides bacteria with an alternative to triosephosphate isomerase for metabolizing dihydroxyacetone phosphate (DHAP). In the present studies, the methylglyoxal synthase gene in Escherichia coli has been cloned and sequenced. The identified open reading frame (ORF) codes for a polypeptide of 152 amino acids, consistent with the 17 kDa purified protein. The sequence of this protein is not similar to any other protein of known function, including the functionally similar protein triosephosphate isomerase. The methylglyoxal synthase gene was amplified by PCR, subcloned into the pET16B expression vector, and expressed in the host E. coli BL21(DE3). Sequence comparison of the methylglyoxal protein and related ORFs from four different bacterial species revealed that four aspartic acid and no glutamic acid residues are absolutely conserved. The function of the four aspartic acid residues was tested by mutating them to either asparagine or glutamic acid. Thermal denaturation, CD spectroscopy, and gel filtration experiments showed that the mutant enzymes had the same secondary and quaternary structure as the wild-type enzyme. Kinetic characterization of both Asp 71 and Asp 101 mutant proteins shows reduced kcat/Km by 10(3)- and 10(4)-fold respectively, suggesting that they are both intimately involved in catalysis. A time-dependent inhibition of both Asp 20 and Asp 91 asparagine mutants by DHAP suggests that these two residues are involved with protecting the enzyme from DHAP or reactive intermediates along the catalytic pathway. In combination with the results of 2-phosphoglycolate binding studies, a catalytic mechanism is proposed.     

Equivalent primal and dual differentiable reformulations of the Euclidean multifacility location problem

In this paper, we consider two equivalent differentiable reformulations of the nondifferentiable Euclidean multifacility location problem (EMFLP). The first of these is derived via a Lagrangian dual approach based on the optimum of a linear function over a unit ball (circle). The resulting formulation turns out to be identical to the known dual problem proposed by Francis and Cabot [1]. Hence, besides providing an easy direct derivation of the dual problem, this approach lends insights into its connections with classical Lagrangian duality and related results. In particular, it characterizes a straightforward recovery of primal location decisions. The second equivalent differentiable formulation is constructed directly in the primal space. Although the individual constraints of the resulting problem are generally nonconvex, we show that their intersection represents a convex feasible region. We then establish the relationship between the Karush-Kuhn-Tucker (KKT) conditions for this problem and the necessary and sufficient optimality conditions for EMFLP. This lends insights into the possible performance of standard differentiable nonlinear programming algorithms when applied to solve this reformulated problem. Some computational results on test problems from the literature, and other randomly generated problems, are also provided.     

Sargassum swartzii extracts ameliorate memory functions by neurochemical modulation in a rat model

Food Science and Biotechnology - Recently, considerable attention has been paid to drug exploration from natural sources for treating memory loss, a major manifestation of various neurodegenerative...     

Minimizing conditional-value-at-risk for stochastic scheduling problems

This paper introduces the use of conditional-value-at-risk (CVaR) as a criterion for stochastic scheduling problems. This criterion has the tendency of simultaneously reducing both the expectation and variance of a performance measure, while retaining linearity whenever the expectation can be represented by a linear expression. In this regard, it offers an added advantage over traditional nonlinear expectation-variance-based approaches. We begin by formulating a scenario-based mixed-integer program formulation for minimizing CVaR for general scheduling problems. We then demonstrate its application for the single machine total weighted tardiness problem, for which we present both a specialized l-shaped algorithm and a dynamic programming-based heuristic procedure. Our numerical experimental results reveal the benefits and effectiveness of using the CVaR criterion. Likewise, we also exhibit the use and effectiveness of minimizing CVaR in the context of the parallel machine total weighted tardiness problem. We believe that minimizing CVaR is an effective approach and holds great promise for achieving risk-averse solutions for stochastic scheduling problems that arise in diverse practical applications.     

Emission Studies of Silicon Plasma Produced by a Nd: YAG Laser

Silicon - In the present experimental work emission studies of silicon (Si) plasma produced by the fundamental (1064 nm) and second (532 nm) harmonics of a Nd: YAG laser are studied. The electron...     

Leak Detection in Pipes by Frequency Response Method

The frequency response method is used to determine the location and rate of leakage in open loop piping systems. A steady-oscillatory flow, produced by the periodic opening and closing of a valve, is analyzed in the frequency domain by using the transfer matrix method, and a frequency response diagram at the valve is developed. For a system with leaks, this diagram has additional resonant pressure amplitude peaks (herein referred to as the secondary pressure amplitude peaks) that are lower than the resonant pressure amplitude peaks (herein called primary amplitude peaks) for the system with no leaks. Several piping systems are successfully analyzed for all practical values of the friction factor to detect and locate individual leaks of up to 0.5% of the mean discharge. The method, requiring the measurement of pressure and discharge fluctuations at only one location, has the potential to detect leaks in real-life pipe systems conveying different types of fluids, such as water, petroleum, and so on.     

An efficient grayscale image encryption scheme based on variable length row-column swapping operations

Multimedia Tools and Applications - Swapping a row with a row, a column with a column or row with a column are usual operations carried out to scramble the given input plain image. To introduce...     

Reliability Improved Stochastic Dynamic Programming for Reservoir Operation Optimization

Stochastic Dynamic Programming (SDP) is widely used in reservoir operation problems. Besides its advantages, a few drawbacks have leaded many studies to improve its structure. Handling the infeasible conditions and curse of dimensionality are two major challenges in this method. The main goal of this paper is proposing a new method to avoid infeasible conditions and enhance the solution efficiency with new discretization procedure. For this purpose, an optimization module is incorporated into regular SDP structure, so that, near optimal values of state variables are determined based on the available constraints. The new method (RISDP) employs reliability concept to maximize the reservoir releases to satisfy the downstream demands. Applying the proposed technique improves the reservoir operating policies compared to regular SDP policies with the same assumptions of discretization. Simulation of reservoir operation in a real case study indicates about 15% improvement in objective function value and elimination of infeasible conditions by using RISDP operating policies.