Basic Needs and Much More With One Kilowatt Per Capita

Conventional thinkin g holds that increased energy consumption is a prerequisite for economic and social development. This belief, together With the prospect of dwindling global petroleum supplies and the high costs of expanding energy supply generally, lead many to believe that it is not feasible to improve living standards substantially in the developing countries. But by shifting to high-quality energy carriers and by exploiting cost-effective opportunities for more efficient energy use, it would be possible to satisfy basic human needs and to provide considerable further improvements in living standards without significantly increasing per-capita energy use above the present level.

Simulation of wavelength/time multiple-pulses-per-row fiber-optic CDMA network

Passive wavelength/time fiber-optic code division multiple access (WIT FO-CDMA) network is a viable option for highspeed access networks. Constructions of 2-D codes, suitable for incoherent WIT FO-CDMA, have been proposed to reduce the time spread of the 1-D sequences. The 2-D constructions can be broadly classified as 1) hybrid codes and 2) matrix codes. In our earlier work [141, we had proposed a new family of wavelength/time multiple-pulses-per-row (W/T MPR) matrix codes which have good cardinality, spectral efficiency and at the same time have the lowest off-peak autocorrelation and cross-correlation values equal to unity. In this paper we propose an architecture for a WIT MPR FO-CDAM network designed using the presently available devices and technology. A complete FO-CDMA network of ten users is simulated, for various number of simultaneous users and shown that 0 --> 1 errors can occur only when the number of interfering users is at least equal to the threshold value.

Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions

CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.

Wavelength/Time Multiple-Pulses-per-Row codes: Construction and verification

Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.

Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

Relative roles of instruction count and cycles per instruction in WCET estimation

Most of the existing WCET estimation methods directly estimate execution time, ET, in cycles. We propose to study ET as a product of two factors, ET = IC * CPI, where IC is instruction count and CPI is cycles per instruction. Considering directly the estimation of ET may lead to a highly pessimistic estimate since implicitly these methods may be using worst case IC and worst case CPI. We hypothesize that there exists a functional relationship between CPI and IC such that CPI=f(IC). This is ascertained by computing the covariance matrix and studying the scatter plots of CPI versus IC. IC and CPI values are obtained by running benchmarks with a large number of inputs using the cycle accurate architectural simulator, Simplescalar on two different architectures. It is shown that the benchmarks can be grouped into different classes based on the CPI versus IC relationship. For some benchmarks like FFT, FIR etc., both IC and CPI are almost a constant irrespective of the input. There are other benchmarks that exhibit a direct or an inverse relationship between CPI and IC. In such a case, one can predict CPI for a given IC as CPI=f(IC). We derive the theoretical worst case IC for a program, denoted as SWIC, using integer linear programming(ILP) and estimate WCET as SWIC*f(SWIC). However, if CPI decreases sharply with IC then measured maximum cycles is observed to be a better estimate. For certain other benchmarks, it is observed that the CPI versus IC relationship is either random or CPI remains constant with varying IC. In such cases, WCET is estimated as the product of SWIC and measured maximum CPI. It is observed that use of the proposed method results in tighter WCET estimates than Chronos, a static WCET analyzer, for most benchmarks for the two architectures considered in this paper.

Ratiometric, reversible, and parts per billion level detection of multiple toxic transition metal ions using a single probe in micellar media

We present the selective sensing of multiple transition metal ions in water using a synthetic single probe. The probe is made up of pyrene and pyridine as signaling and interacting moiety, respectively. The sensor showed different responses toward metal ions just by varying the medium of detection. In organic solvent (acetonitrile), the probe showed selective detection of Hg2+ ion. In water, the fluorescence quenching was observed with three metal ions, Cu2+, Hg2+, and Ni2+. Further, just by varying the surface charge on the micellar aggregates, the probe could detect and discriminate the above-mentioned three different toxic metal ions appropriately. In neutral micelles (Brij 58), the probe showed a selective interaction with Hg2+ ion as observed in acetonitrile medium. However, in anionic micellar medium (sodium dodecyl sulfate, SDS), the probe showed changes with both Cu2+ and Ni2+. under UV-vis absorption spectroscopy. The discrimination between these two ions was achieved by recording their emission spectra, where it showed selective quenching with Cu2+.

An Efficient Probe for Rapid Detection of Cyanide in Water at Parts per Billion Levels and Naked-Eye Detection of Endogenous Cyanide

A new molecular probe based on an oxidized bis-indolyl skeleton has been developed for rapid and sensitive visual detection of cyanide ions in water and also for the detection of endogenously bound cyanide. The probe allows the naked-eye detection of cyanide ions in water with a visual color change from red to yellow ((max)=80nm) with the immediate addition of the probe. It shows high selectivity towards the cyanide ion without any interference from other anions. The detection of cyanide by the probe is ratiometric, thus making the detection quantitative. A Michael-type addition reaction of the probe with the cyanide ion takes place during this chemodosimetric process. In water, the detection limit was found to be at the parts per million level, which improved drastically when a neutral micellar medium was employed, and it showed a parts-per-billion-level detection, which is even 25-fold lower than the permitted limits of cyanide in water. The probe could also efficiently detect the endogenously bound cyanide in cassava (a staple food) with a clear visual color change without requiring any sample pretreatment and/or any special reaction conditions such as pH or temperature. Thus the probe could serve as a practical naked-eye probe for in-field experiments without requiring any sophisticated instruments.

A Probe for the Selective and Parts-per-Billion-Level Detection of Copper(II) and Mercury(II) using a Micellar Medium and Its Utility in Cell Imaging

A novel colorimetric probe 1 based on the picolyl moiety has been designed and synthesized. Probe 1 is composed of a pyrene and a bispicolyl amine (BPA) unit, in which the BPA moiety acts as a binding unit and the binding phenomenon is sensed from the changes in the signaling subunit. The probe detects Cu2+ specifically in water and both Cu2+ and Hg2+ efficiently in neutral Brij-58 micellar media. The probe shows a color change visible to the naked eye upon addition of metal ions. Notably, in a micellar medium, probe 1 can detect both the Cu2+ and Hg2+ ions even at parts-per-billion levels. Furthermore, the probe shows ratiometric detection of both the metal ions making the sensing quantitative. The two metal ions could be discriminated both visibly under a UV lamp and with the use of fluorescence spectroscopy. The probe could be also used in biological cell lines for the detection of both Hg2+ and Cu2+ ions.

A critical review of the definition of FRA resonance frequency of transformers as per IEEE Std C57.149-2012

The explanation of resonance given in IEEE Std C57.149-2012 to define resonance during frequency response analysis (FRA) measurements on transformers implicitly uses the conditions prevalent during resonance in a series R-L-C circuit. This dependence is evident from the two assertions made in the definition, viz., resulting in zero net reactive impedance, and, accompanied by a zero value appearing in the phase angle of the frequency response function. These two conditions are satisfied (at resonance) only in a series R-L-C circuit and certainly not in a transformer, as has been assumed in the Standard. This can be proved by considering a ladder-network model. Circuit analysis of this ladder network reveals the origin of this fallacy and proves that, at resonance, neither is the ladder network purely resistive and nor is the phase angle (between input voltage and input current) always zero. Also, during FRA measurements, it is often seen that phase angle does not traverse the conventional cyclic path from +90 degrees to -90 degrees (or vice versa) at all resonant frequencies. This peculiar feature can also be explained using pole-zero maps. Simple derivations, simulations and experimental results on an actual winding are presented. In summary, authors believe that this study dispels existing misconceptions about definition of FRA resonance and provides material for its correction in IEEE Std C57.149-2012. (C) 2014 Elsevier B.V. All rights reserved.

An Implementation of Partitioned Scheduling Scheme for Hard Real-Time Tasks in Multicore Linux with Fair Share for Linux Tasks

The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.

Training-Based Antenna Selection for PER Minimization: A POMDP Approach

This paper considers the problem of receive antenna selection (AS) in a multiple-antenna communication system having a single radio-frequency (RF) chain. The AS decisions are based on noisy channel estimates obtained using known pilot symbols embedded in the data packets. The goal here is to minimize the average packet error rate (PER) by exploiting the known temporal correlation of the channel. As the underlying channels are only partially observed using the pilot symbols, the problem of AS for PER minimization is cast into a partially observable Markov decision process (POMDP) framework. Under mild assumptions, the optimality of a myopic policy is established for the two-state channel case. Moreover, two heuristic AS schemes are proposed based on a weighted combination of the estimated channel states on the different antennas. These schemes utilize the continuous valued received pilot symbols to make the AS decisions, and are shown to offer performance comparable to the POMDP approach, which requires one to quantize the channel and observations to a finite set of states. The performance improvement offered by the POMDP solution and the proposed heuristic solutions relative to existing AS training-based approaches is illustrated using Monte Carlo simulations.