A MICROMACHINED WIDE-BAND IN-PLANE SINGLE-AXIS CAPACITIVE ACCELEROMETER WITH A DISPLACEMENT-AMPLIFYING COMPLIANT MECHANISM

With the premise that electronic noise dominates mechanical noise in micromachined accelerometers, we present here a method to enhance the sensitivity and resolution at kHz bandwidth using mechanical amplification. This is achieved by means of a Displacement-amplifying Compliant Mechanism (DaCM) that is appended to the usual sensing element comprising a proof-mass and a suspension. Differential comb-drive arrangement is used for capacitive-sensing. The DaCM is designed to match the stiffness of the suspension so that there is substantial net amplification without compromising the bandwidth. A spring-mass-lever model is used to estimate the lumped parameters of the system. A DaCM-aided accelerometer and another without a DaCM-both occupying the same footprint-are compared to show that the former gives enhanced sensitivity: 8.7 nm/g vs. 1.4 nm/g displacement at the sensing-combs under static conditions. A prototype of the DaCM-aided micromachined acclerometer was fabricated using bulk-micromachining. It was tested at the die-level and then packaged on a printed circuit board with an off-the-shelf integrated chip for measuring change in capacitance. Under dynamic conditions, the measured amplification factor at the output of the DaCM was observed to be about 11 times larger than the displacement of the proof-mass and thus validating the concept of enhancing the sensitivity of accelerometers using mechanical amplifiers. The measured first in-plane natural frequency of the fabricated accelerometer was 6.25 kHz. The packaged accelerometer with the DaCM was measured to have 26.7 mV/g sensitivity at 40 Hz.

Harvesting Excitons Via Two Parallel Channels for Efficient White Organic LEDs with Nearly 100% Internal Quantum Efficiency: Fabrication and Emission-Mechanism Analysis

By incorporating two phosphorescent dyes, namely, iridium(III)[bis(4,6-difluorophenyl)-pyridinato-N,C-2']picolinate (Flrpic) for blue emission and bis(2-(9,9-diethyl-9H-fluoren-2-yl)-1-phenyl-1 H-benzoimidazol-N,C-3) iridium(acetylacetonate) ((fbi)(2)Ir(acac)) for orange emission, into a single-energy well-like emissive layer, an extremely high-efficiency white organic light-emitting diode (WOLED) with excellent color stability is demonstrated. This device can achieve a peak forward-viewing power efficiency of 42.5 lm W-1, corresponding to an external quantum efficiency (EQE) of 19.3% and a current efficiency of 52.8 cd A(-1). Systematic studies of the dopants, host and dopant-doped host films in terms of photophysical properties (including absorption, photoluminescence, and excitation spectra), transient photoluminescence, current density-voltage characteristics, and temperature-dependent electroluminescence spectra are subsequently performed, from which it is concluded that the emission natures of Flrpic and (fbi)(2)Ir(acac) are, respectively, host-guest energy transfer and a direct exciton formation process. These two parallel pathways serve to channel the overall excitons to both dopants, greatly reducing unfavorable energy losses.

Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection

Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms.

On the specific filtration mechanism of a mesoporous silica membrane, prepared with non-connecting parallel pores

We report the singular filtration properties of an ultrafiltration membrane made with mesoporous silica that exhibits cylindrical pores aligned mostly normal to the support. This membrane supported on tubular commercial macroporous alumina supports was prepared by the interfacial growth mechanism between stable silica-surfactant hybrid micelles made of the association of silica oligomers with polyethyleneoxide-based (PEO) surfactants and sodium fluoride, a well-known silica condensation catalyst [Boissière et al., An ultrafiltration membrane made with mesoporous MSU-X silica, Chem. Mater. 15 (2003) 460-463]. It appears that the combined effect of the silica nature of the membrane, whose surface charge can be easily adjusted by changing the pH and the non-connected cylindrical shape of the pores provides a new behavior in the retention properties, as proved by the filtration of polyoxyethylene polymers (PEO) with different molecular weights. Depending on the filtration conditions, a rejection rate of 80% and a steep cut-off at 2000 Da can be obtained or, on the reverse, polymers three times bigger than the pore diameter can diffuse through the membrane. This new filtration mechanism, which opens up new modes of separation modes, is explained in the light of both topology of the porous network and pH-dependent interactions between PEO polymers and silica porous media. © 2004 Elsevier B.V. All rights reserved.

Compliant cryptologic protocols

Literally, the word compliance suggests conformity in fulfilling official requirements. The thesis presents the results of the analysis and design of a class of protocols called compliant cryptologic protocols (CCP). The thesis presents a notion for compliance in cryptosystems that is conducive as a cryptologic goal. CCP are employed in security systems used by at least two mutually mistrusting sets of entities. The individuals in the sets of entities only trust the design of the security system and any trusted third party the security system may include. Such a security system can be thought of as a broker between the mistrusting sets of entities. In order to provide confidence in operation for the mistrusting sets of entities, CCP must provide compliance verification mechanisms. These mechanisms are employed either by all the entities or a set of authorised entities in the system to verify the compliance of the behaviour of various participating entities with the rules of the system. It is often stated that confidentiality, integrity and authentication are the primary interests of cryptology. It is evident from the literature that authentication mechanisms employ confidentiality and integrity services to achieve their goal. Therefore, the fundamental services that any cryptographic algorithm may provide are confidentiality and integrity only. Since controlling the behaviour of the entities is not a feasible cryptologic goal,the verification of the confidentiality of any data is a futile cryptologic exercise. For example, there exists no cryptologic mechanism that would prevent an entity from willingly or unwillingly exposing its private key corresponding to a certified public key. The confidentiality of the data can only be assumed. Therefore, any verification in cryptologic protocols must take the form of integrity verification mechanisms. Thus, compliance verification must take the form of integrity verification in cryptologic protocols. A definition of compliance that is conducive as a cryptologic goal is presented as a guarantee on the confidentiality and integrity services. The definitions are employed to provide a classification mechanism for various message formats in a cryptologic protocol. The classification assists in the characterisation of protocols, which assists in providing a focus for the goals of the research. The resulting concrete goal of the research is the study of those protocols that employ message formats to provide restricted confidentiality and universal integrity services to selected data. The thesis proposes an informal technique to understand, analyse and synthesise the integrity goals of a protocol system. The thesis contains a study of key recovery,electronic cash, peer-review, electronic auction, and electronic voting protocols. All these protocols contain message format that provide restricted confidentiality and universal integrity services to selected data. The study of key recovery systems aims to achieve robust key recovery relying only on the certification procedure and without the need for tamper-resistant system modules. The result of this study is a new technique for the design of key recovery systems called hybrid key escrow. The thesis identifies a class of compliant cryptologic protocols called secure selection protocols (SSP). The uniqueness of this class of protocols is the similarity in the goals of the member protocols, namely peer-review, electronic auction and electronic voting. The problem statement describing the goals of these protocols contain a tuple,(I, D), where I usually refers to an identity of a participant and D usually refers to the data selected by the participant. SSP are interested in providing confidentiality service to the tuple for hiding the relationship between I and D, and integrity service to the tuple after its formation to prevent the modification of the tuple. The thesis provides a schema to solve the instances of SSP by employing the electronic cash technology. The thesis makes a distinction between electronic cash technology and electronic payment technology. It will treat electronic cash technology to be a certification mechanism that allows the participants to obtain a certificate on their public key, without revealing the certificate or the public key to the certifier. The thesis abstracts the certificate and the public key as the data structure called anonymous token. It proposes design schemes for the peer-review, e-auction and e-voting protocols by employing the schema with the anonymous token abstraction. The thesis concludes by providing a variety of problem statements for future research that would further enrich the literature.

A Global Constraint On Relative Rotation To Avoid Lumped Compliant Mechanisms In Topology Optimization

Some of the well known formulations for topology optimization of compliant mechanisms could lead to lumped compliant mechanisms. In lumped compliance, most of the elastic deformation in a mechanism occurs at few points, while rest of the mechanism remains more or less rigid. Such points are referred to as point-flexures. It has been noted in literature that high relative rotation is associated with point-flexures. In literature we also find a formulation of local constraint on relative rotations to avoid lumped compliance. However it is well known that a global constraint is easier to handle than a local constraint, by a numerical optimization algorithm. The current work presents a way of putting global constraint on relative rotations. This constraint is also simpler to implement since it uses linearized rotation at the center of finite-elements, to compute relative rotations. I show the results obtained by using this constraint oil the following benchmark problems - displacement inverter and gripper.

Topochemical dimerization of non-parallel double bonds: 7-methoxycoumarin

X-ray crystal structure analysis of 7-methoxycoumarin reveals that the reactive double bonds are rotated by about 65° with respect to each other, the centre-to-centre distance between the double bonds being 3.83 Å. In spite of this unfavourable arrangement, photodimerization occurs in the crystalline state yielding the syn-head-tail dimer as the only product. Lattice energy calculations on ground-state molecules in crystals throw light on the mechanism of the reaction.

Mechanism of adsorption effects on electrode kinetics: Part I: Selection rules in the case of low coverage by molecular surfactants

It is shown that the effect of adsorption of inert molecules on electrode reaction rates is completely accounted for, by introducing into the rate equation, adsorption-induced changes in both the effective electrode area as well as in the electrostatic potential at the reaction site with an additional term for the noncoulombic interaction between the reactant and the adsorbate. The electrostatic potential at the reaction site due to the adsorbed layer is calculated using a model of discretely-distributed molecules in parallel orientation when adsorbed on the electrode with an allowance for thermal agitation. The resulting expression, which is valid for the limiting case of low coverages, is used to predict the types of molecular surfactants that are most likely to be useful for acceleration and inhibition of electrode reactions.

Purification and kinetic mechanism of 5,10-metliyienetetrahydrofolate reductase from sheep liver

5,10-Methylenetetrahydrofolate reductase (EC 1.1.1.68) was purified from the cytosolic fraction of sheep liver by (NH4)2 SO4 fractionation, acid precipitation, DEAE-Sephacel chromatography and Blue Sepharose affinity chromatography. The homogeneity of the enzyme was established by sodium dodecyl sulphate-polyacrylamide gel electrophoresis, ultracentrifugation and Ouchterlony immunodiffusion test. The enzyme was a dimer of molecular weight 1,66,000 ± 5,000 with a subunit molecular weight of 87,000 ±5,000. The enzyme showed hyperbolic saturation pattern with 5-methyltetrahydrofolate.K 0.5 values for 5-methyltetrahydrofolate menadione and NADPH were determined to be 132 ΜM, 2.45 ΜM and 16 ΜM. The parallel set of lines in the Lineweaver-Burk plot, when either NADPH or menadione was varied at different fixed concentrations of the other substrate; non-competitive inhibition, when NADPH was varied at different fixed concentrations of NADP; competitive inhibition, when menadione was varied at different fixed concentrations of NADP and the absence of inhibition by NADP at saturating concentration of menadione, clearly established that the kinetic mechanism of the reaction catalyzed by this enzyme was ping-pong.

Mechanism of action of selenious acid in the electrodeposition of manganese

The effect of selenious acid as an addition agent in the electrodeposition of manganese was studied by analysing the current-potential curves for manganese deposition. The mechanism of action of this addition agent was found to be essentially similar to that proposed for sulphur dioxide, namely to affect the manganese deposition indirectly by influencing the hydrogen evolution reaction which is a parallel reaction at the electrode surface.

Singularity and controllability analysis of parallel manipulators and closed-loop mechanisms

This paper presents a study of kinematic and force singularities in parallel manipulators and closed-loop mechanisms and their relationship to accessibility and controllability of such manipulators and closed-loop mechanisms, Parallel manipulators and closed-loop mechanisms are classified according to their degrees of freedom, number of output Cartesian variables used to describe their motion and the number of actuated joint inputs. The singularities in the workspace are obtained by considering the force transformation matrix which maps the forces and torques in joint space to output forces and torques ill Cartesian space. The regions in the workspace which violate the small time local controllability (STLC) and small time local accessibility (STLA) condition are obtained by deriving the equations of motion in terms of Cartesian variables and by using techniques from Lie algebra.We show that for fully actuated manipulators when the number ofactuated joint inputs is equal to the number of output Cartesian variables, and the force transformation matrix loses rank, the parallel manipulator does not meet the STLC requirement. For the case where the number of joint inputs is less than the number of output Cartesian variables, if the constraint forces and torques (represented by the Lagrange multipliers) become infinite, the force transformation matrix loses rank. Finally, we show that the singular and non-STLC regions in the workspace of a parallel manipulator and closed-loop mechanism can be reduced by adding redundant joint actuators and links. The results are illustrated with the help of numerical examples where we plot the singular and non-STLC/non-STLA regions of parallel manipulators and closed-loop mechanisms belonging to the above mentioned classes. (C) 2000 Elsevier Science Ltd. All rights reserved.

Miniature Compliant Grippers With Vision-Based Force Sensing

This paper is concerned with grasping biological cells in aqueous medium with miniature grippers that can also help estimate forces using vision-based displacement measurement and computation. We present the design, fabrication, and testing of three single-piece, compliant miniature grippers with parallel and angular jaw motions. Two grippers were designed using experience and intuition, while the third one was designed using topology optimization with implicit manufacturing constraints. These grippers were fabricated using different manufacturing techniques using spring steel and polydimethylsiloxane ( PDMS). The grippers also serve the purpose of a force sensor. Toward this, we present a vision-based force-sensing technique by solving Cauchy's problem in elasticity using an improved algorithm. We validated this technique at the macroscale, where there was an independent method to estimate the force. In this study, the gripper was used to hold a yeast ball and a zebrafish egg cell of less than 1 mm in diameter. The forces involved were estimated to be about 30 and 10 mN for the yeast ball and the zebrafish egg cell, respectively.

Ligand-modulated Parallel Mechanical Unfolding Pathways of Maltose-binding Proteins

Protein folding and unfolding are complex phenomena, and it is accepted that multidomain proteins generally follow multiple pathways. Maltose-binding protein (MBP) is a large (a two-domain, 370-amino acid residue) bacterial periplasmic protein involved in maltose uptake. Despite the large size, it has been shown to exhibit an apparent two-state equilibrium unfolding in bulk experiments. Single-molecule studies can uncover rare events that are masked by averaging in bulk studies. Here, we use single-molecule force spectroscopy to study the mechanical unfolding pathways of MBP and its precursor protein (preMBP) in the presence and absence of ligands. Our results show that MBP exhibits kinetic partitioning on mechanical stretching and unfolds via two parallel pathways: one of them involves a mechanically stable intermediate (path I) whereas the other is devoid of it (path II). The apoMBP unfolds via path I in 62% of the mechanical unfolding events, and the remaining 38% follow path II. In the case of maltose-bound MBP, the protein unfolds via the intermediate in 79% of the cases, the remaining 21% via path II. Similarly, on binding to maltotriose, a ligand whose binding strength with the polyprotein is similar to that of maltose, the occurrence of the intermediate is comparable (82% via path I) with that of maltose. The precursor protein preMBP also shows a similar behavior upon mechanical unfolding. The percentages of molecules unfolding via path I are 53% in the apo form and 68% and 72% upon binding to maltose and maltotriose, respectively, for preMBP. These observations demonstrate that ligand binding can modulate the mechanical unfolding pathways of proteins by a kinetic partitioning mechanism. This could be a general mechanism in the unfolding of other large two-domain ligand-binding proteins of the bacterial periplasmic space.