Biotechnological storage and utilization of entrapped solar energy

Our laboratory has recently developed a device employing immobilized F₀F₁ adenosine triphosphatase (ATPase) that allows synthesis of adenosine triphosphate (ATP) from adenosine 5′-diphosphate and inorganic phosphate using solar energy. We present estimates of total solar energy received by Earth’s land area and demonstrate that its efficient capture may allow conversion of solar energy and storage into bonds of biochemicals using devices harboring either immobilized ATPase or NADH dehydrogenase. Capture and storage of solar energy into biochemicals may also enable fixation of CO₂ emanating from polluting units. The cofactors ATP and NADH synthesized using solar energy could be used for regeneration of acceptor d-ribulose-1,5-bisphosphate from 3-phosphoglycerate formed during CO₂ fixation.     

Stereoselective syntheses of (−)-chloramphenicol and (+)-thiamphenicol

Chloramphenicol and thiamphenicol have been enantioselectively synthesized using an asymmetric halohydrin reaction as a key step. In particular, halomethoxylation reaction was used, where O-methyl functions as a hydroxyl protecting group and eliminates an additional protection step.     

Syntheses of substituted pyrazolo[3,4-b]quinolines, 3,4-dihydro-4-oxopyrimido[4′,5′:4,5]theino[2,3-b]quinoline and pyrido[1′,2′:1,2]pyrimido[4,5-b]quinoline

Syntheses of substituted pyrazolo[3,4-b]quinolines, 3,4-dihydro-4-oxopyriraido[4′,5′:4,5]theino[2,3-b]quinoline and 12-phenylpyrido[1′,2′:1,2[pyrimido[4,5-b]quinoline are described.     

Optical solitons for the resonant nonlinear Schrödinger equation with competing weakly nonlocal nonlinearity and fractional temporal evolution

Nonlinear Dynamics - This paper is devoted in the study of the resonant nonlinear Schrödinger equation with competing weakly nonlocal nonlinearity and fractional temporal evolution which...     

A selective location update strategy for PCS users

A new location update strategy for personal communication services (PCS) networks and its implementation using a genetic algorithm are proposed. Most of the practical cellular mobile systems partition a geographical region into location areas (LAs) and users are made to update on entering a new LA. The main drawback of this scheme is that it does not consider the individual user mobility and call arrival patterns. Combining these factors with the LAbased approach, we propose an optimal update strategy which determines whether or not a user should update in each LA, and minimizes the average location management cost derived from a userspecific mobility model and call generation pattern. The location management cost optimization problem is also elegantly solved using a genetic algorithm. Detailed simulation experiments are conducted to capture the effects of mobility and callarrival patterns on the location update strategy. The conclusion from this work is that skipping location updates in certain LAs leads to the minimization of the overall location management cost for a user with a specific mobility pattern and even with moderately high call arrival rate.     

Mortar element methods for parabolic problems

In this article a standard mortar finite element method and a mortar element method with Lagrange multiplier are used for spatial discretization of a class of parabolic initial‐boundary value problems. Optimal error estimates in L^∞(L²) and L^∞(H¹)‐norms for semidiscrete methods for both the cases are established. The key feature that we have adopted here is to introduce a modified elliptic projection. In the standard mortar element method, a completely discrete scheme using backward Euler scheme is discussed and optimal error estimates are derived. The results of numerical experiments support the theoretical results obtained in this article. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links

Characterization of catastrophic fault patterns (CFPs) and their enumeration have been studied by several authors. Given a linear array with a set of bypass links, an important problem is how to count the number of CFPs. Enumeration of CFPs for two link redundancy G={1,g} has been solved for both unidirectional and bidirectional link cases. In this paper, we consider the more general case of link redundancy G={1,2,…,k,g}, 2k<g. Using random walk as a tool, we enumerate CFPs for both unidirectional and bidirectional cases.     

An axiomatic approach to equivariant cohomology theories

This paper presents a translation of a theorem of Cartan into an equivariant setting. This work is largely based on the study of the homotopical algebra in the sense of Quillen of the category of simplicial objects over the category of rationalO _g-vector spaces. The application is a solution to the equivariant commutative cochain problem. This solution is slightly better than the solution obtained earlier by Triantafillou in that the transformation groupG need not be finite.