Hybrid Paper–Plastic Microchip for Flexible and High‐Performance Point‐of‐Care Diagnostics

A low‐cost and easy‐to‐fabricate microchip remains a key challenge for the development of true point‐of‐care (POC) diagnostics. Cellulose paper and plastic are thin, light, flexible, and abundant raw materials, which make them excellent substrates for mass production of POC devices. Herein, a hybrid paper–plastic microchip (PPMC) is developed, which can be used for both single and multiplexed detection of different targets, providing flexibility in the design and fabrication of the microchip. The developed PPMC with printed electronics is evaluated for sensitive and reliable detection of a broad range of targets, such as liver and colon cancer protein biomarkers, intact Zika virus, and human papillomavirus nucleic acid amplicons. The presented approach allows a highly specific detection of the tested targets with detection limits as low as 10² ng mL^?1 for protein biomarkers, 10³ particle per milliliter for virus particles, and 10² copies per microliter for a target nucleic acid. This approach can potentially be considered for the development of inexpensive and stable POC microchip diagnostics and is suitable for the detection of a wide range of microbial infections and cancer biomarkers.     

Computer viruses

Computer viruses have been around since the mid 1980s. Over 40,000 different viruses have been cataloged so far and the number of viruses is increasing dramatically. The damage they cause is estimated to be several billions of U.S. dollars per year. Most often, the origin of the virus is difficult to trace. Various kinds of anti-virus software have been developed which detect viruses and take corrective actions. The anti-virus software needs to be continually updated to cope with newer types of viruses. The proliferation of the Internet and Web, have enabled viruses to spread quickly on a massive scale, by taking advantage of several security loopholes. The continual challenge is to have quick and effective responses to these virus attacks     

The fate and intermediary metabolism of stearic acid

Coming from the Greek for “hard fat”, stearic acid represents one of the most abundant FA in the Western diet. Otherwise known as n-octadecanoic acid (18∶0), stearate is either obtained in the diet or synthesized by the elongation of palmitate, the principal product of the FA synthase system in animal cells. Stearic acid has been shown to be a very poor substrate for TG synthesis, even as compared with other saturated fats such as myristate and palmitate, and in human studies stearic acid has been shown to generate a lower lipemic response than medium-chain saturated FA. Although it has been proposed that this may be due to less efficient absorption of stearic acid in the gut, such findings have not been consistent. Along with palmitate, stearate is the major substrate for the enzyme stearoyl-CoA desaturase, which catalyzes the conversion of stearate to oleate, the preferred substrate for the synthesis of TG and other complex lipids. In mice, targeted disruption of the stearoyl-CoA desaturase-1 (SCD1) gene results in the generation of a lean mouse that is resistant to diet-induced obesity and insulin resistance. SCD1 also has been shown to be a key target of the anorexigenic hormone leptin, thus underscoring the importance of this enzyme, and consequently the cellular stearate-to-oleate ratio, in lipid metabolism and potentially in the treatment of obesity and related disorders.     

Multi-state-choice automata model for expedient learning in random environment

A new automata model M_r,k, with a conceptually significant innovation in the form of multi-state alternatives at each instance, is proposed in this study. Computer simulations of the M_r,k, model in the context of feature selection in an unsupervised environment has demonstrated the superiority of the model over similar models without this multi-state-choice innovation.     

SPMD programming in Java

We consider the suitability of the Java concurrent constructs for writing high-performance SPMD code for parallel machines. More specifically, we investigate implementing a financial application in Java on a distributed-memory parallel machine. Despite the fact that Java was not expressly targeted to such applications and architectures per se, we conclude that efficient implementations are feasible. Finally, we propose a library of Java methods to facilitate SPMD programming. © 1997 John Wiley & Sons, Ltd.     

A single active site mutation inverts stereoselectivity of 16-hydroxylation of testosterone catalyzed by engineered cytochrome P450 BM3

Inversion of stereoselectivity: screening of a minimal mutant library revealed a cytochrome P450?BM3 variant M01?A82W?S72I capable of producing 16?α-OH-testosterone. Remarkably, a single active site mutation S72I in M01?A82W inverted the stereoselectivity of hydroxylation from 16?β to 16?α. Introduction of S72I mutation in another 16?β-OH-selective variant M11?V87I, also resulted in similar inversion of stereoselectivity.     

Impedance spectroscopic studies on NiFe2O4 with different morphologies: Microstructure vs. dielectric properties

NiFe₂O₄ powders were prepared by combustion synthesis, polyol-mediated and sol–gel methods. Morphological characterization of sintered disks was carried out using scanning electron microscopy (SEM). Dielectric properties of NiFe₂O₄ synthesized by different routes were investigated over the frequency range of 100 Hz–5 MHz at room temperature. A difference in dielectric constant (ε_r) and dissipation factor (tan δ) of NiFe₂O₄ samples obtained by different synthesis methods has been observed. The observed dissimilarity in the behavior originates from the variation in the microstructure of the samples that is evident in the Cole–Cole plot results.     

A Framework for Functional Specification and Transformation of Hidden Surface Elimination Algorithms

This paper deals with the theory of hidden surface elimination algorithms in Computer Graphics. A set of functions and abstract data types are defined to help concisely specify a class of hidden surface elimination algorithms in a purely functional language. A formal study of these algorithms is presented here along with theorems of equivalence between some of the specifications. It is shown here that such proofs of equivalence will help in the construction of existing as well as new algorithms. We bring in the importance of such a study to exploit alternative parallel architectures for implementation of these algorithms. The other benefits of formal specification and analysis are due to its use as a teaching aid and effective method for rapid prototyping of these algorithms.