Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data. (C) 2011 Optical Society of America

MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences these parameters. Hence the embedded system designer performs a complete memory architecture exploration. This problem is a multi-objective optimization problem and can be tackled as a two-level optimization problem. The outer level explores various memory architecture while the inner level explores placement of data sections (data layout problem) to minimize memory stalls. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of Multi-objective Genetic Algorithm (Memory Architecture exploration) and an efficient heuristic data placement algorithm. At the outer level the memory architecture exploration is done by picking memory modules directly from a ASIC memory Library. This helps in performing the memory architecture exploration in a integrated framework, where the memory allocation, memory exploration and data layout works in a tightly coupled way to yield optimal design points with respect to area, power and performance. We experimented our approach for 3 embedded applications and our approach explores several thousand memory architecture for each application, yielding a few hundred optimal design points in a few hours of computation time on a standard desktop.

Stability of control systems with time delay

To find the approximate stability limit on the forward gain in control systems with small time delay, this note suggests approximating the exponential in the characteristic equation by the first few terms of its series and using the Routh–Hurwitz criterion. This approximation avoids all the time-consuming graphical work and gives a somewhat pessimistic maximum bound for the gain constant.

Exact entanglement studies of strongly correlated systems: role of long-range interactions and symmetries of the system

We study the bipartite entanglement of strongly correlated systems using exact diagonalization techniques. In particular, we examine how the entanglement changes in the presence of long-range interactions by studying the Pariser-Parr-Pople model with long-range interactions. We compare the results for this model with those obtained for the Hubbard and Heisenberg models with short-range interactions. This study helps us to understand why the density matrix renormalization group (DMRG) technique is so successful even in the presence of long-range interactions. To better understand the behavior of long-range interactions and why the DMRG works well with it, we study the entanglement spectrum of the ground state and a few excited states of finite chains. We also investigate if the symmetry properties of a state vector have any significance in relation to its entanglement. Finally, we make an interesting observation on the entanglement profiles of different states (across the energy spectrum) in comparison with the corresponding profile of the density of states. We use isotropic chains and a molecule with non-Abelian symmetry for these numerical investigations.

Quenching across quantum critical points in periodic systems: Dependence of scaling laws on periodicity

We study the quenching dynamics of a many-body system in one dimension described by a Hamiltonian that has spatial periodicity. Specifically, we consider a spin-1/2 chain with equal xx and yy couplings and subject to a periodically varying magnetic field in the (z) over cap direction or, equivalently, a tight-binding model of spinless fermions with a periodic local chemical potential, having period 2q, where q is a positive integer. For a linear quench of the strength of the magnetic field (or chemical potential) at a rate 1/tau across a quantum critical point, we find that the density of defects thereby produced scales as 1/tau(q/(q+1)), deviating from the 1/root tau scaling that is ubiquitous in a range of systems. We analyze this behavior by mapping the low-energy physics of the system to a set of fermionic two-level systems labeled by the lattice momentum k undergoing a nonlinear quench as well as by performing numerical simulations. We also show that if the magnetic field is a superposition of different periods, the power law depends only on the smallest period for very large values of tau, although it may exhibit a crossover at intermediate values of tau. Finally, for the case where a zz coupling is also present in the spin chain, or equivalently, where interactions are present in the fermionic system, we argue that the power associated with the scaling law depends on a combination of q and the interaction strength.

An invariant subspace-based approach to the random eigenvalue problem of systems with clustered spectrum

The repeated or closely spaced eigenvalues and corresponding eigenvectors of a matrix are usually very sensitive to a perturbation of the matrix, which makes capturing the behavior of these eigenpairs very difficult. Similar difficulty is encountered in solving the random eigenvalue problem when a matrix with random elements has a set of clustered eigenvalues in its mean. In addition, the methods to solve the random eigenvalue problem often differ in characterizing the problem, which leads to different interpretations of the solution. Thus, the solutions obtained from different methods become mathematically incomparable. These two issues, the difficulty of solving and the non-unique characterization, are addressed here. A different approach is used where instead of tracking a few individual eigenpairs, the corresponding invariant subspace is tracked. The spectral stochastic finite element method is used for analysis, where the polynomial chaos expansion is used to represent the random eigenvalues and eigenvectors. However, the main concept of tracking the invariant subspace remains mostly independent of any such representation. The approach is successfully implemented in response prediction of a system with repeated natural frequencies. It is found that tracking only an invariant subspace could be sufficient to build a modal-based reduced-order model of the system. Copyright (C) 2012 John Wiley & Sons, Ltd.

Inclusion of body doping in compact models for fully-depleted common double gate MOSFET adapted to gate-oxide thickness asymmetry

Since it is difficult to find the analytical solution of the governing Poisson equation for double gate MOSFETs with the body doping term included, the majority of the compact models are developed for undoped-body devices for which the analytical solution is available. Proposed is a simple technique to included a body doping term in such surface potential based common double gate MOSFET models also by taking into account any differences between the gate oxide thickness. The proposed technique is validated against TCAD simulation and found to be accurate as long as the channel is fully depleted.

Wheeler-Feynman absorber revisited: a useful technique to calculate decay rates and lifetimes in small scale optical systems

The Wheeler-Feynman (WF) absorber theory of radiation though no more of interest in explaining self interaction of an electron, can be very useful in today's research in small scale optical systems. The significance of the WF absorber is the use of time-symmetrical solution of Maxwell's equations as opposed to only the retarded solution. The radiative coupling of emitters to nano wires in the near field and change in their lifetimes due to small mode volume enclosures have been elucidated with the retarded solutions before. These solutions have also been shown to agree with quantum electrodynamics, thus allowing for classical electromagnetic approaches in such problems. It is here assumed that the radiative coupling of the emitter with a body is in proportion to its contribution to the classical force of radiative reaction as derived in the WF absorber theory. Representing such nano structures as a partial WF absorber acting on the emitter makes the computations considerably easier than conventional electromagnetic solutions for full boundary conditions.

A pseudobinary approach to study interdiffusion and the Kirkendall effect in multicomponent systems

Interdiffusion studies become increasingly difficult to perform with the increasing number of elements in a system. It is rather easy to calculate the interdiffusion coefficients for all the compositions in the interdiffusion zone in a binary system. The intrinsic diffusion coefficients can be calculated for the composition of Kirkendall marker plane in a binary system. In a ternary system, however, the interdiffusion coefficients can only be calculated for the composition where composition profiles from two different diffusion couples intersect. Intrinsic diffusion coefficients are possible to calculate when the Kirkendall markers are also present at that composition, which is a condition that is generally difficult to satisfy. In a quaternary system, the composition profiles for three different diffusion couples must intersect at one particular composition to calculate the diffusion parameters, which is a condition that is almost impossible to satisfy. To avoid these complications in a multicomponent system, the average interdiffusion coefficients are calculated. I propose a method of calculating the intrinsic diffusion coefficients and the variation in the interdiffusion coefficients for multicomponent systems. This method can be used for a single diffusion couple in a multicomponent pseudobinary system. The compositions of the end members of a diffusion couple should be selected such that only two elements diffuse into the interdiffusion zone. A few hypothetical diffusion couples are considered in order to validate and explain our method. Various sources of error in the calculations are also discussed.

Enhanced DMT-optimality criterion for STBC schemes for asymmetric MIMO systems

For any n(t) transmit, n(r) receive antenna (n(t) x n(r)) multiple-input multiple-output (MIMO) system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code schemes (LSTBC schemes) that have the nonvanishing determinant (NVD) property are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of n(r) if they have a code rate of n(t) complex dimensions per channel use. However, for asymmetric MIMO systems (where n(r) < n(t)), with the exception of a few LSTBC schemes, it is unknown whether general LSTBC schemes with NVD and a code rate of n(r) complex dimensions per channel use are DMT optimal. In this paper, an enhanced sufficient criterion for any STBC scheme to be DMT optimal is obtained, and using this criterion, it is established that any LSTBC scheme with NVD and a code rate of min {n(t), n(r)} complex dimensions per channel use is DMT optimal. This result settles the DMT optimality of several well-known, low-ML-decoding-complexity LSTBC schemes for certain asymmetric MIMO systems.

Emergency Handling in MICS based Body Area Network

Body Area Network, a new wireless networking paradigm, promises to revolutionize the healthcare applications. A number of tiny sensor nodes are strategically placed in and around the human body to obtain physiological information. The sensor nodes are connected to a coordinator or a data collector to form a Body Area Network. The tiny devices may sense physiological parameters of emergency in nature (e.g. abnormality in heart bit rate, increase of glucose level above the threshold etc.) that needs immediate attention of a physician. Due to ultra low power requirement of wireless body area network, most of the time, the coordinator and devices are expected to be in the dormant mode, categorically when network is not operational. This leads to an open question, how to handle and meet the QoS requirement of emergency data when network is not operational? Emergency handling becomes more challenging at the MAC layer, if the channel access related information is unknown to the device with emergency message. The aforementioned scenarios are very likely scenarios in a MICS (Medical Implant Communication Service, 402-405 MHz) based healthcare systems. This paper proposes a mechanism for timely and reliable transfer of emergency data in a MICS based Body Area Network. We validate our protocol design with simulation in a C++ framework. Our simulation results show that more than 99 p ercentage of the time emergency messages are reached at the coordinator with a delay of 400ms.

A Time-based Low Voltage Body Temperature Monitoring Unit

A neonatal temperature monitoring system operating in subthreshold regime that utilizes time mode signal processing is presented. Resistance deviations in a thermistor due to temperature variations are converted to delay variations that are subsequently quantized by a Delay measurement unit (DMU). The DMU does away with the need for any analog circuitry and is synthesizable entirely from digital logic. An FPGA implementation of the system demonstrates the viability of employing time mode signal processing, and measured results show that temperature resolution better than 0.1 degrees C can be achieved using this approach.

Spatio-temporal correlations in aqueous systems: computational studies of static and dynamic heterogeneity by 2D-IR spectroscopy

Local heterogeneity is ubiquitous in natural aqueous systems. It can be caused locally by external biomolecular subsystems like proteins, DNA, micelles and reverse micelles, nanoscopic materials etc., but can also be intrinsic to the thermodynamic nature of the aqueous solution itself (like binary mixtures or at the gas-liquid interface). The altered dynamics of water in the presence of such diverse surfaces has attracted considerable attention in recent years. As these interfaces are quite narrow, only a few molecular layers thick, they are hard to study by conventional methods. The recent development of two dimensional infra-red (2D-IR) spectroscopy allows us to estimate length and time scales of such dynamics fairly accurately. In this work, we present a series of interesting studies employing two dimensional infra-red spectroscopy (2D-IR) to investigate (i) the heterogeneous dynamics of water inside reverse micelles of varying sizes, (ii) supercritical water near the Widom line that is known to exhibit pronounced density fluctuations and also study (iii) the collective and local polarization fluctuation of water molecules in the presence of several different proteins. The spatio-temporal correlation of confined water molecules inside reverse micelles of varying sizes is well captured through the spectral diffusion of corresponding 2D-IR spectra. In the case of supercritical water also, we observe a strong signature of dynamic heterogeneity from the elongated nature of the 2D-IR spectra. In this case the relaxation is ultrafast. We find remarkable agreement between the different tools employed to study the relaxation of density heterogeneity. For aqueous protein solutions, we find that the calculated dielectric constant of the respective systems unanimously shows a noticeable increment compared to that of neat water. However, the `effective' dielectric constant for successive layers shows significant variation, with the layer adjacent to the protein having a much lower value. Relaxation is also slowest at the surface. We find that the dielectric constant achieves the bulk value at distances more than 3 nm from the surface of the protein.

Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.