Revisiting the Mechanism of the Triosephosphate Isomerase Reaction: The Role of the Fully Conserved Glutamic Acid 97 Residue

An analysis of 503 available triosephosphate isomerase sequences revealed nine fully conserved residues. Of these, four residues-K12, H95, E97 and E165-are capable of proton transfer and are all arrayed around the dihydroxyacetone phosphate substrate in the three-dimensional structure. Specific roles have been assigned to the residues K12, H95 and E165, but the nature of the involvement of E97 has not been established. Kinetic and structural characterization is reported for the E97Q and E97D mutants of Plasmodium falciparum triosephosphate isomerase (Pf TIM). A 4000-fold reduction in k(cat) is observed for E97Q, whereas the E97D mutant shows a 100-fold reduction. The control mutant, E165A, which lacks the key catalytic base, shows an approximately 9000-fold drop in activity. The integrity of the overall fold and stability of the dimeric structure have been demonstrated by biophysical studies. Crystal structures of E97Q and E97D mutants have been determined at 2.0 angstrom resolution. In the case of the isosteric replacement of glutamic acid by glutamine in the E97Q mutant a large conformational change for the critical K12 side chain is observed, corresponding to a trans-to-gauche transition about the C gamma-C delta (chi(3)) bond. In the E97D mutant, the K12 side chain maintains the wild-type orientation, but the hydrogen bond between K12 and D97 is lost. The results are interpreted as a direct role for E97 in the catalytic proton transfer cycle. The proposed mechanism eliminates the need to invoke the formation of the energetically unfavourable imidazolate anion at H95, a key feature of the classical mechanism.

Displacement Amplifying Compliant Mechanisms for Two-axis High-resolution Monolithic Inertial Sensors

Novel designs for two-axis, high-resolution, monolithic inertial sensors are presented in this paper. Monolithic, i.e., joint-less single-piece compliant designs are already common in micromachined inertial sensors such as accelerometers and gyroscopes. Here, compliant mechanisms are used not only to achieve de-coupling between motions along two orthogonal axes but also to amplify the displacements of the proof-mass. Sensitivity and resolution capabilities are enhanced because the amplified motion is used for sensing the measurand. A particular symmetric arrangement of displacement-amplifying compliant mechanisms (DaCMs) leads to de-coupled and amplified motion. An existing DaCM and a new topology-optimized DaCM are presented as a building block in the new arrangement. A spring-mass-lever model is presented as a lumped abstraction of the new arrangement. This model is useful for arriving at the optimal parameters of the DaCM and for performing system-level simulation. The new designs improved the performance by a factor of two or more.

A Comparative Study of the Formulations for Topology Optimization of Compliant Mechanisms

The topology optimization problem for the synthesis of compliant mechanisms has been formulated in many different ways in the last 15 years, but there is not yet a definitive formulation that is universally accepted. Furthermore, there are two unresolved issues in this problem. In this paper, we present a comparative study of five distinctly different formulations that are reported in the literature. Three benchmark examples are solved with these formulations using the same input and output specifications and the same numerical optimization algorithm. A total of 35 different synthesis examples are implemented. The examples are limited to desired instantaneous output direction for prescribed input force direction. Hence, this study is limited to linear elastic modeling with small deformations. Two design parameterizations, namely, the frame element based ground structure and the density approach using continuum elements, are used. The obtained designs are evaluated with all other objective functions and are compared with each other. The checkerboard patterns, point flexures, the ability to converge from an unbiased uniform initial guess, and the computation time are analyzed. Some observations are noted based on the extensive implementation done in this study. Complete details of the benchmark problems and the results are included. The computer codes related to this study are made available on the internet for ready access.

An algebraic formulation of exact force-, moment-isotropy in spatial parallel manipulators

In this paper, we present an algebraic method to study and design spatial parallel manipulators that demonstrate isotropy in the force and moment distributions.We use the force and moment transformation matrices separately,and derive conditions for their isotropy individually as well as in combination. The isotropy conditions are derived in closed-form in terms of the invariants of the quadratic forms associated with these matrices. The formulation has been applied to a class of Stewart platform manipulators. We obtain multi-parameter families of isotropic manipulator analytically. In addition to computing the isotropic configurations of an existing manipulator,we demonstrate a procedure for designing the manipulator for isotropy at a given configuration.

Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters

Workstation clusters equipped with high performance interconnect having programmable network processors facilitate interesting opportunities to enhance the performance of parallel application run on them. In this paper, we propose schemes where certain application level processing in parallel database query execution is performed on the network processor. We evaluate the performance of TPC-H queries executing on a high end cluster where all tuple processing is done on the host processor, using a timed Petri net model, and find that tuple processing costs on the host processor dominate the execution time. These results are validated using a small cluster. We therefore propose 4 schemes where certain tuple processing activity is offloaded to the network processor. The first 2 schemes offload the tuple splitting activity - computation to identify the node on which to process the tuples, resulting in an execution time speedup of 1.09 relative to the base scheme, but with I/O bus becoming the bottleneck resource. In the 3rd scheme in addition to offloading tuple processing activity, the disk and network interface are combined to avoid the I/O bus bottleneck, which results in speedups up to 1.16, but with high host processor utilization. Our 4th scheme where the network processor also performs apart of join operation along with the host processor, gives a speedup of 1.47 along with balanced system resource utilizations. Further we observe that the proposed schemes perform equally well even in a scaled architecture i.e., when the number of processors is increased from 2 to 64