Switching characteristics of an optically controlled GaAs-MESFET

The switching characteristics of an optically controlled Metal Semiconductor Field Effect Transistor (MESFET), popularly known as Optical Field Effect Transistor (OPFET), have been derived analytically. The limitations of the existing model have been overcome in the present model. Calculations are being carried out to examine the effect of illumination on the current-voltage characteristics, drain-to-source capacitance (C_dc), internal gate-to-source capacitance (C_gs), drain-to-source resistance (R_ds), the transconductance (g_m), the input RC time constant and the cutoff frequency (f_T) of a GaAs-MESFET. The variations of these parameters with gate length L_g and the doping concentration N_d have also been studied in dark and illuminated conditions. The results of numerical calculations show that there is an overall decrease in the input RC time constant of the device in the illuminated condition arising from the internal gate-to-source capacitance and the transconductance. The results obtained on the basis of the model show a close agreement with the reported experimental findings. The simple model presented here is fairly accurate and can be used as a basic tool for circuit simulation purposes     

Exploring the main building blocks of SOA method: SOA maturity model perspective

The most successful enterprises plan its SOA adoption process as a series of maturity stages, where each stage acts as a foundation for the next. Various SOA maturity models (SOAMMs) are available to judge the current level of SOA adoption maturity of an enterprise. However, only a very few models review the formal use of SOA methods in the maturity assessment process. In this work, the SOAMMs are evaluated in terms of how they assess the methodological aspects of SOA adoption at each level of maturity. Based on methodical features, we introduce a set of building blocks for different maturity levels to assist the method engineers in SOA method definition. Welke’s SOAMM is selected as a base model to derive maturity guidelines for SOA methods. This work establishes the role of SOAMM in realizing the true potential of SOA and discusses why CMMI models are inapplicable to assess SOA adoption maturity. The main intention of this work is to develop a conceptual framework that describes the building block of SOA methods at different levels of maturity, including their processes, tools and technologies, and sourcing mechanisms. We adopt a real case study to determine the maturity level of SOA methodology dimension and to demonstrate how SOA adoption maturity can be improved by focusing on the methodical building blocks identified.     

Label-free microelectronic PCR quantification

We present a robust and simple method for direct, label-free PCR product quantification using an integrated microelectronic sensor. The field-effect sensor can sequentially detect the intrinsic charge of multiple unprocessed PCR products and does not require sample processing or additional reagents in the PCR mixture. The sensor measures nucleic acid concentration in the PCR relevant range and specifically detects the PCR products over reagents such as Taq polymerase and nucleotide monomers. The sensor can monitor the product concentration at various stages of PCR and can generate a readout that resembles that of a real-time fluorescent measurement using an intercalating dye but without its potential inhibition artifacts. The device is mass-produced using standard semiconductor processes, can be reused for months, and integrates all sensing components directly on-chip. As such, our approach establishes a foundation for the direct integration of PCR-based in vitro biotechnologies with microelectronics.     

A Branching Time Temporal Framework for Quantitative Reasoning

Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.     

In vivo cytogenetic studies on mice exposed to acesulfame-K--a non-nutritive sweetener

Acesulfame-K, a sweetening agent, was evaluated in vivo for its genotoxic and clastogenic potentials. Swiss albino male mice were exposed to the compound by gavage. Bone marrow cells isolated from femora were analysed for chromosome aberrations. Doses of 15, 30, 60, 450, 1500 and 2250 mg of acesulfame-K/kg body weight induced a positive dose-dependent significant clastogenicity (trend test alpha < 0.05). These doses were within the no-toxic-effect levels (1.5-3 g/kg body weight in rats) reported by the Joint Expert Committee for Food Additives of the World Health Organization and the Food and Agriculture Organization of the United Nations. In view of the present significant in vivo mammalian genotoxicity data, acesulfame-K should be used with caution.     

Quantified Computation Tree Logic

Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking. In this paper, we observe that while CTL can be verified in time polynomial in the size of the state space times the length of the formula, there is a large set of reachability properties which cannot be expressed in CTL, but can still be verified in polynomial time. We present a powerful extension of CTL with first-order quantification over sets of reachable states. The extended logic, QCTL, preserves the syntactic elegance of CTL while enhancing its expressive power significantly. We show that QCTL model checking is PSPACE-complete in general, but has a rich fragment (containing CTL) which can be checked in polynomial time. We show that this fragment is significantly more expressive than CTL while preserving the syntactic beauty of CTL.