Utilization bounds for RM scheduling on uniform multiprocessors

Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.

Multiple Spectral Peak Tracking for Heart Rate Monitoring from Photoplethysmography Signal During Intensive Physical Exercise

We propose a multiple initialization based spectral peak tracking (MISPT) technique for heart rate monitoring from photoplethysmography (PPG) signal. MISPT is applied on the PPG signal after removing the motion artifact using an adaptive noise cancellation filter. MISPT yields several estimates of the heart rate trajectory from the spectrogram of the denoised PPG signal which are finally combined using a novel measure called trajectory strength. Multiple initializations help in correcting erroneous heart rate trajectories unlike the typical SPT which uses only single initialization. Experiments on the PPG data from 12 subjects recorded during intensive physical exercise show that the MISPT based heart rate monitoring indeed yields a better heart rate estimate compared to the SPT with single initialization. On the 12 datasets MISPT results in an average absolute error of 1.11 BPM which is lower than 1.28 BPM obtained by the state-of-the-art online heart rate monitoring algorithm.

Micro-satellite angular rate estimation using second-order sliding mode observer

Development of computationally efficient and accurate attitude rate estimation algorithm using low-cost commercially available star sensor arrays and processing unit for micro-satellite mission is presented. Our design reduces the computational load of least square (LS)-based rate estimation method while maintaining the same accuracy compared to other rate estimation approaches. Furthermore, rate estimation accuracy is improved by using recently developed fast and accurate second-order sliding mode observer (SOSMO) scheme. It also gives robust estimation in the presence of modeling uncertainties, unknown disturbances, and measurement noise. Simulation study shows that rate estimation accuracy achieved by our LS-based method is comparable with other methods for a typical commercially available star sensor array. The robustness analysis of SOSMO with respect to measurement noise is also presented in this paper. Simulation test bench for a practical scenario of satellite rate estimation uses moment-of-inertia variation and environmental disturbances affecting a typical micro-satellite at 500km circular orbit. Comparison studies of SOSMO with 1-SMO and pseudo-linear Kalman filter show that satisfactory estimation accuracy is achieved by SOSMO.

STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH in UMTS Networks

In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuously- backlogged model. Each connection specifies a required service rate over an interval of time, k, called the "control horizon". In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.

An automatic algorithm for mixed mode crack growth rate based on drop potential method

A new automatic algorithm for the assessment of mixed mode crack growth rate characteristics is presented based on the concept of an equivalent crack. The residual ligament size approach is introduced to implementation this algorithm for identifying the crack tip position on a curved path with respect to the drop potential signal. The automatic algorithm accounting for the curvilinear crack trajectory and employing an electrical potential difference was calibrated with respect to the optical measurements for the growing crack under cyclic mixed mode loading conditions. The effectiveness of the proposed algorithm is confirmed by fatigue tests performed on ST3 steel compact tension-shear specimens in the full range of mode mixities from pure mode Ito pure mode II. (C) 2015 Elsevier Ltd. All rights reserved.

Effects of Isothermal and Adiabatic Thermal Loadings on Size and Strain Rate Dependence of Copper Nanowire

In the present paper, the size and strain rate effects on ultra-thin < 100 >/{100} Cu nanowires at an initial temperature of 10 K have been discussed. Extensive molecular dynamics (MD) simulations have been performed using Embedded atom method (EAM) to investigate the structural behaviours and properties under high strain rate. Velocity-Verlet algorithm has been used to solve the equation of motions. Two different thermal loading cases have been considered: (i) Isothermal loading, in which Nose-Hoover thermostat is used to maintain the constant system temperature, and (ii) Adiabatic loading, i.e., without any thermostat. Five different wire cross-sections were considered ranging from 0.723 x 0.723 nm(2) to 2.169 x 2.169 nm(2) The strain rates used in the present study were 1 x 10(9) s(-1), 1 x 10(8) s(-1), and 1 x 10(7) s(-1). The effect of strain rate on the mechanical properties of copper nanowires was analysed, which shows that elastic properties are independent of thermal loading for a given strain rate and cross-sectional dimension of nanowire. It showed a decreasing yield stress and yield strain with decreasing strain rate for a given cross- section. Also, a decreasing yield stress and increasing yield strain were observed for a given strain rate with increasing cross-sectional area. Elastic modulus was found to be similar to 100 GPa, which was independent of processing temperature, strain rate, and size for a given initial temperature. Reorientation of < 100 >/{100} square cross-sectional copper nanowire into a series of stable ultra-thin Pentagon copper nanobridge structures with dia of similar to 1 nm at 10 K was observed under high strain rate tensile loading. The effect of isothermal and adiabatic loading on the formation of such pentagonal nanobridge structure has been discussed.

A Reactive Inverse PN Algorithm for Collision Avoidance among Multiple Unmanned Aerial Vehicles

While performing a mission, multiple Unmanned Aerial Vehicles (UAVs) need to avoid each other to prevent collisions among them. In this paper, we design a collision avoidance algorithm to resolve the conflict among UAVs that are on a collision course while flying to heir respective destinations. The collision avoidance algorithm consist of each UAV that is on a collision course reactively executing a maneuver that will, as in `inverse' Proportional Navigation (PN), increase Line of Sight (LOS) rate between them, resulting in a `pulling out' of collision course. The algorithm is tested for high density traffic scenarios as well as for robustness in the presence of noise.

Rate of ribonucleic acid chain growth in Mycobacterium tuberculosis H37Rv.

Two methods were employed to measure the rate of ribonucleic acid (RNA) chain growth in vivo in Mycobacterium tuberculosis H37Rv cultures growing in Sauton medium at 37 degrees C, with a generation time of 10 h. In the first, the bacteria were allowed to assimilate [3H]uracil or [3H]guanine into their RNA for short time periods. The RNA was then extracted and hydrolyzed with alkali, and the radioactivity in the resulting nucleotides and nucleosides was measured. The data obtained by this method allowed the calculation of the individual nucleotide step times during the growth of RNA chains, from which the average rate of RNA chain elongation was estimated to be about 4 nucleotides per s. The second method employed the antibiotic rifampin, which specifically inhibits the initiation of RNA synthesis without interfering with the elongation and completion of nascent RNA chains. Usint this method, the transcription time of the 16S, 23S, and 5S ribosomal RNA genes was estimated to be 7.6 min, which corresponds to a ribosomal RNA chain growth rate of 10 nucleotides per s.

trans gene regulation in adaptive evolution: A genetic algorithm model

This is a continuation of earlier studies on the evolution of infinite populations of haploid genotypes within a genetic algorithm framework. We had previously explored the evolutionary consequences of the existence of indeterminate—“plastic”—loci, where a plastic locus had a finite probability in each generation of functioning (being switched “on”) or not functioning (being switched “off”). The relative probabilities of the two outcomes were assigned on a stochastic basis. The present paper examines what happens when the transition probabilities are biased by the presence of regulatory genes. We find that under certain conditions regulatory genes can improve the adaptation of the population and speed up the rate of evolution (on occasion at the cost of lowering the degree of adaptation). Also, the existence of regulatory loci potentiates selection in favour of plasticity. There is a synergistic effect of regulatory genes on plastic alleles: the frequency of such alleles increases when regulatory loci are present. Thus, phenotypic selection alone can be a potentiating factor in a favour of better adaptation.

The Consequences of Phenotypic Plasticity in Cyclically Varying Environments: A Genetic Algorithm Study

By “phenotypic plasticity” we refer to the capacity of a genotype to exhibit different phenotypes, whether in the same or in different environments. We have previously demonstrated that phenotypic plasticity can improve the degree of adaptation achieved via natural selection (Behera & Nanjundiah, 1995). That result was obtained from a genetic algorithm model of haploid genotypes (idealized as one-dimensional strings of genes) evolving in a fixed environment. Here, the dynamics of evolution is examined under conditions of a cyclically varying environment. We find that the rate of evolution, as well as the extent of adaptation (as measured by mean population fitness) is lowered because of environmental cycling. The decrease is adaptation caused by a varying environment can, however, be partly or wholly compensated by an increase in the degree of plasticity that a genotype is capable of. Also, the reduction of population fitness caused by a variable environment can be partially offset by decreasing the total number of genetic loci. We conjecture that an increase in genome size may have been among the factors responsible for the evolution of phenotypic plasticity.

High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.

A Low-Complexity Near-ML Performance Achieving Algorithm for Large MIMO Detection

In this paper, we present a low-complexity, near maximum-likelihood (ML) performance achieving detector for large MIMO systems having tens of transmit and receive antennas. Such large MIMO systems are of interest because of the high spectral efficiencies possible in such systems. The proposed detection algorithm, termed as multistage likelihood-ascent search (M-LAS) algorithm, is rooted in Hopfield neural networks, and is shown to possess excellent performance as well as complexity attributes. In terms of performance, in a 64 x 64 V-BLAST system with 4-QAM, the proposed algorithm achieves an uncoded BER of 10(-3) at an SNR of just about 1 dB away from AWGN-only SISO performance given by Q(root SNR). In terms of coded BER, with a rate-3/4 turbo code at a spectral efficiency of 96 bps/Hz the algorithm performs close to within about 4.5 dB from theoretical capacity, which is remarkable in terms of both high spectral efficiency as well as nearness to theoretical capacity. Our simulation results show that the above performance is achieved with a complexity of just O(NtNt) per symbol, where N-t and N-tau denote the number of transmit and receive antennas.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.