Energy efficient asymmetric binary search switching technique for SAR ADC

An asymmetric binary search switching technique for a successive approximation register (SAR) ADC is presented, and trade-off between switching energy and conversion cycles is discussed. Without using any additional switches, the proposed technique consumes 46% less switching energy, for a small input swing (0.5 V-ref (P-P)), as compared to the last reported efficient switching technique in literature for an 8-bit SAR ADC. For a full input swing (2 V-ref (P-P)), the proposed technique consumes 16.5% less switching energy.

Mykorritsa fosforin kierrättäjänä

Suomen maatalousmaihin kertynyttä fosforia hyödynnetään tehottomasti, ja samalla muokkauskerroksen suuri fosforimäärä on alttiina huuhtoutumiselle. Arbuskelimykorritsaa (AM) hyödyntämällä on mahdollista tehostaa viljelykasvin fosforinottoa ja kasvua, ja siten vähentää fosforin huuhtoutumista. Tämän tutkielman tavoitteena oli selvittää mykorritsan vaikutus kasvin kasvuun ja fosforinottoon karjanlantalannoituksella mineraalilannoitukseen verrattuna sekä näiden lannoitusten pitkäaikaisvaikutusta AM-sieniyhteisöihin. Jotta lannoituskäytäntöjen vaikutus mykorritsaan voitiin suhteuttaa muihin maan laatutekijöihin, näiden käytäntöjen vaikutus myös satomääriin sekä muihin maan laatumittareihin arvioitiin. Pitkäaikainen kenttäkoe perustettiin kolmelle paikkakunnalle Pohjois-Ruotsissa vuosina 1965–66. Kuusivuotinen viljelykierto koostui joko viisivuotisesta nurmesta ja ohrasta tai ohramonokulttuurista. Lannoituskäsittelyt 32-vuoden ajan olivat suositusten mukainen (NPK) ja edelliseen nähden kaksinkertainen (2NPK) mineraalilannoitus sekä karjanlantalannoitus (KL), jonka ravinnemäärä vastasi NPK -käsittelyä. Kolmen lannoituskäsittelyn vaikutusta mykorritsan tehokkuuteen kasvin kasvun ja fosforiravitsemuksen näkökulmasta tutkittiin astiakokeissa. Mykorritsasieniyhteisöjen toiminnallisten erojen selvittämiseksi tehtiin takaisin- ja ristiinsiirrostuskoe. (5 v-%) steriloitua maanäytettä NPK- ja KL -käsittelyistä siirrostettiin käsittelemättömiin maanäytteisiin, jotka olivat samoista lannoituskäsittelyistä. Mykorritsan positiivinen vaikutus kasvin kasvuun ja fosforiravitsemukseen oli suurin kun käytettiin karjanlantaa. NPK ja 2NPK -käsittelyiden välillä ei havaittu eroja. Takaisin- ja ristiinsiirrostuskokeessa ei ollut tilastollisesti merkitseviä eroja. Nurmi- ja ohrasadot olivat suurimmat kun mineraalilannoitetta annettiin suosituksiin nähden kaksinkertainen määrä. Satomäärät olivat yhtä suuret tai suuremmat kun käytettiin karjanlantaa NPK –lannoituksen sijaan. Karjanlantakäsittely lisäsi maaperän kokonaishiili- ja kokonaistyppipitoisuutta verrattuna NPK -käsittelyyn, joka sisälsi saman määrän ravinteita. Samalla huuhtoutumiselle altis liukoisen fosforin pitoisuus säilyi alhaisella tasolla. Karjanlanta edisti mykorritsan toimintaedellytyksiä, ja siksi mykorritsasta saatua hyötyä fosforinotossa ja kasvuvaikutuksena mineraalilannoitteisiin verrattuna, mutta se ei vaikuttanut mykorritsasieniyhteisön toiminnallisiin ominaisuuksiin. Karjanlantalannoitus paransi mitattuja maan ominaisuuksia kokonaisuudessaan, eikä se vähentänyt satoja.

Dimorphism and structural modulation in quinoxaline

The Z' = 1 and Z' = 5 structures of quinoxaline are compared. The nature of the intermolecular interactions in the Z' = 5 structure is studied by means of variable-temperature single-crystal X-ray diffraction. The C-H center dot center dot center dot N and pi ... pi it interactions in these structures are of a stabilizing nature. The high Z' structure has the better interactions, whereas the low Z' structure has the better stability. This trade-off is a recurrent theme in molecular crystals and is a manifestation of the distinction between thermodynamically and kinetically favoured crystal forms.

Tunable Locally-Optimal Geographical Forwarding in Wireless Sensor Networks with Sleep-Wake Cycling Nodes

We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. 1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.

Wavelength/Time orthogonal codes with FEC offer dual advantage

To meet the growing demands of the high data rate applications, suitable asynchronous schemes such as Fiber-Optic Code Division Multiple Access (FO-CDMA) are required in the last mile. FO-CDMA scheme offers potential benefits and at the same time it faces many challenges. Wavelength/Time (W/T) 2-D codes for use in FO-CDMA, can be classified mainly into two types: 1) hybrid codes and 2) matrix codes, to reduce the 'time' like property, have been proposed. W/T single-pulse-per-row (SPR) are energy efficient codes as this family of codes have autocorrelation sidelobes of '0', which is unique to this family and the important feature of the W/T multiple-pulses-per-row (MPR) codes is that the aspect ratio can be varied by trade off between wavelength and temporal lengths. These W/T codes have improved cardinality and spectral efficiency over other W/T codes and at the same time have lowest crosscorrelation values. In this paper, we analyze the performances of the FO-CDMA networks using W/T SPR codes and W/T MPR codes, with and without forward error correction (FEC) coding and show that with FEC there is dual advantage of error correction and reduced spread sequence length.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.

NETGEM: Network Embedded Temporal GEnerative Model for gene expression data

Background: Temporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation. Results: We present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks. Conclusions: NETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological systems. The source code for NETGEM is available from https://github.com/vjethava/NETGEM

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a specially designed multi-dimensional bloom filter to store the points-to information. Two key observations motivate our proposal: (i) points-to information (between pointer-object and between pointer-pointer) is sparse, and (ii) moving from an exact to an approximate representation of points-to information only leads to reduced precision without affecting correctness of the (may-points-to) analysis. By using an approximate representation a multi-dimensional bloom filter can significantly reduce the memory requirements with a probabilistic bound on loss in precision. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that with an average storage requirement of 4MB, our approach achieves almost the same precision (98.6%) as the exact implementation. By increasing the average memory to 27MB, it achieves precision upto 99.7% for these benchmarks. Using Mod/Ref analysis as the client, we find that the client analysis is not affected that often even when there is some loss of precision in the points-to representation. We find that the NoModRef percentage is within 2% of the exact analysis while requiring 4MB (maximum 15MB) memory and less than 4 minutes on average for the points-to analysis. Another major advantage of our technique is that it allows to trade off precision for memory usage of the analysis.

A mostly-digital analog scan-out chain for low bandwidth voltage measurement for analog IP test

A method of precise measurement of on-chip analog voltages in a mostly-digital manner, with minimal overhead, is presented. A pair of clock signals is routed to the node of an analog voltage. This analog voltage controls the delay between this pair of clock signals, which is then measured in an all-digital manner using the technique of sub-sampling. This sub-sampling technique, having measurement time and accuracy trade-off, is well suited for low bandwidth signals. This concept is validated by designing delay cells, using current starved inverters in UMC 130nm CMOS process. Sub-mV accuracy is demonstrated for a measurement time of few seconds.

Model projections for household energy use in India

Energy use in developing countries is heterogeneous across households. Present day global energy models are mostly too aggregate to account for this heterogeneity. Here, a bottom-up model for residential energy use that starts from key dynamic concepts on energy use in developing countries is presented and applied to India. Energy use and fuel choice is determined for five end-use functions (cooking, water heating, space heating, lighting and appliances) and for five different income quintiles in rural and urban areas. The paper specifically explores the consequences of different assumptions for income distribution and rural electrification on residential sector energy use and CO(2) emissions, finding that results are clearly sensitive to variations in these parameters. As a result of population and economic growth, total Indian residential energy use is expected to increase by around 65-75% in 2050 compared to 2005, but residential carbon emissions may increase by up to 9-10 times the 2005 level. While a more equal income distribution and rural electrification enhance the transition to commercial fuels and reduce poverty, there is a trade-off in terms of higher CO(2) emissions via increased electricity use. (C) 2011 Elsevier Ltd. All rights reserved.

An Accurate Fractional Period Delay Generation System

An all-digital technique is proposed for generating an accurate delay irrespective of the inaccuracies of a controllable delay line. A subsampling technique-based delay measurement unit (DMU) capable of measuring delays accurately for the full period range is used as the feedback element to build accurate fractional period delays based on input digital control bits. The proposed delay generation system periodically measures and corrects the error and maintains it at the minimum value without requiring any special calibration phase. Up to 40x improvement in accuracy is demonstrated for a commercial programmable delay generator chip. The time-precision trade-off feature of the DMU is utilized to reduce the locking time. Loop dynamics are adjusted to stabilize the delay after the minimum error is achieved, thus avoiding additional jitter. Measurement results from a high-end oscilloscope also validate the effectiveness of the proposed system in improving accuracy.

Meso-Structured Silica-Nafion Hybrid Membranes for Direct Methanol Fuel Cells

A series of novel organic-inorganic hybrid membranes have been prepared employing Nafion and acid-functionalized meso-structured molecular sieves (MMS) with varying structures and surface area. Acid-functionalized silica nanopowder of surface area 60 m(2)/g, silica meso-structured cellular foam (MSU-F) of surface area 470 m(2)/g and silica meso-structured hexagonal frame network (MCM-41) of surface area 900 m(2)/g have been employed as potential filler materials to form hybrid membranes with Nafion framework. The structural behavior, water uptake, proton conductivity and methanol permeability of these hybrid membranes have been investigated. DMFCs employing Nafion-silica MSU-F and Nafion-silica MCM-41 hybrid membranes deliver peak-power densities of 127 mW/cm(2) and 100 mW/cm(2), respectively; while a peak-power density of only 48 mW/cm(2) is obtained with the DMFC employing pristine recast Nafion membrane under identical operating conditions. The aforesaid characteristics of the hybrid membranes could be exclusively attributed to the presence of pendant sulfonic acid groups in the filler, which provide fairly continuous proton-conducting pathways between filler and matrix in the hybrid membranes facilitating proton transport without any trade-off between its proton conductivity and methanol crossover. (C) 2012 The Electrochemical Society. DOI: 10.1149/2.036211jes] All rights reserved.

Urea-based constructs readily amplify and attenuate nonlinear optical activity in response to H-bonding and anion recognition

Urea-based molecular constructs are shown for the first time to be nonlinear optically (NLO) active in solution. We demonstrate self-assembly triggered large amplification and specific anion recognition driven attenuation of the NLO activity. This orthogonal modulation along with an excellent nonlinearity-transparency trade-off makes them attractive NLO probes for studies related to weak self-assembly and anion transportation by second harmonic microscopy.

Optimal forwarding in delay tolerant networks with multiple destinations

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.