A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

Modified linear prediction method for directions of arrival estimation of narrow-band plane waves

A modified linear prediction (MLP) method is proposed in which the reference sensor is optimally located on the extended line of the array. The criterion of optimality is the minimization of the prediction error power, where the prediction error is defined as the difference between the reference sensor and the weighted array outputs. It is shown that the L2-norm of the least-squares array weights attains a minimum value for the optimum spacing of the reference sensor, subject to some soft constraint on signal-to-noise ratio (SNR). How this minimum norm property can be used for finding the optimum spacing of the reference sensor is described. The performance of the MLP method is studied and compared with that of the linear prediction (LP) method using resolution, detection bias, and variance as the performance measures. The study reveals that the MLP method performs much better than the LP technique.

Simultaneous effect of lead and cadmium on granulosa cells: A cellular model for ovarian toxicity

Lead (Pb) and cadmium (Cd) are known reproductive toxicants, which accumulate in granulosa cells of the ovary. Female Charles foster rats were treated with sodium acetate (control), lead acetate and cadmium acetate either alone or in combination at a dose 0.05 mg/kg body weight intra-peritoneally for 15 days daily. Animals were killed at proestrous stage and granulosa cells were isolated from the ovaries. Binding of I-125-luteinizing hormone (I-125-LH), I-125-follicle stimulating hormone (I-125-FSH) and 17 beta-hydroxysteroid dehydrogenase activity were measured. As these receptors are localized on the surface of the cell membrane, we also estimated the membrane parameters of these cells. Our results demonstrated that both lead and cadmium caused a significant reduction in gonadotropin binding, which altered steroidogenic enzyme activity of granulosa cells. These changes exhibited a positive correlation with membrane changes of the granulosa cells.

Sequence specificity of Z-DNA formation in oligonucleotides

The sequence specific requirement for B----Z transition in solution was examined in d(CGTGCGCACG), d(CGTACGTACG), d(ACGTACGT) in presence of various Z-inducing factors. Conformational studies show that inspite of the alternating nature of purines and pyrimidines, the aforementioned sequences do not undergo B----Z transition under the influence of NaCl, hexamine cobalt chloride and ethanol. A comparison with the crystal structures of an assorted array of purine and pyrimidine sequences show that the sequence requirement for B----Z transition is much more stringent in solution as compared to the solid state. The disruptive influence of AT base pairs in B to Z transition is discussed.

Artificial neural networks and multicriterion analysis for sustainable irrigation planning

The objective of the present paper is to select the best compromise irrigation planning strategy for the case study of Jayakwadi irrigation project, Maharashtra, India. Four-phase methodology is employed. In phase 1, separate linear programming (LP) models are formulated for the three objectives, namely. net economic benefits, agricultural production and labour employment. In phase 2, nondominated (compromise) irrigation planning strategies are generated using the constraint method of multiobjective optimisation. In phase 3, Kohonen neural networks (KNN) based classification algorithm is employed to sort nondominated irrigation planning strategies into smaller groups. In phase 4, multicriterion analysis (MCA) technique, namely, Compromise Programming is applied to rank strategies obtained from phase 3. It is concluded that the above integrated methodology is effective for modeling multiobjective irrigation planning problems and the present approach can be extended to situations where number of irrigation planning strategies are even large in number. (c) 2004 Elsevier Ltd. All rights reserved.

Epoch extraction from linear prediction residual for identification of closed glottis interval

In voiced speech analysis epochal information is useful in accurate estimation of pitch periods and the frequency response of the vocal tract system. Ideally, linear prediction (LP) residual should give impulses at epochs. However, there are often ambiguities in the direct use of LP residual since samples of either polarity occur around epochs. Further, since the digital inverse filter does not compensate the phase response of the vocal tract system exactly, there is an uncertainty in the estimated epoch position. In this paper we present an interpretation of LP residual by considering the effect of the following factors: 1) the shape of glottal pulses, 2) inaccurate estimation of formants and bandwidths, 3) phase angles of formants at the instants of excitation, and 4) zeros in the vocal tract system. A method for the unambiguous identification of epochs from LP residual is then presented. The accuracy of the method is tested by comparing the results with the epochs obtained from the estimated glottal pulse shapes for several vowel segments. The method is used to identify the closed glottis interval for the estimation of the true frequency response of the vocal tract system.

A novel property of an Auto-Correlation Sequence and some Applications

In this article, we use some spectral properties of polynomials presented in 1] and map an auto-correlation sequence to a set of Line Spectral Frequencies(LSFs) and reflection coefficients. This novel characterization of an auto-correlation sequence is used to obtain a lattice structure of a Linear-Phase(LP) FIR filter.

Data compression by linear prediction for storage and transmission of EEG signals

The EEG time series has been subjected to various formalisms of analysis to extract meaningful information regarding the underlying neural events. In this paper the linear prediction (LP) method has been used for analysis and presentation of spectral array data for the better visualisation of background EEG activity. It has also been used for signal generation, efficient data storage and transmission of EEG. The LP method is compared with the standard Fourier method of compressed spectral array (CSA) of the multichannel EEG data. The autocorrelation autoregressive (AR) technique is used for obtaining the LP coefficients with a model order of 15. While the Fourier method reduces the data only by half, the LP method just requires the storage of signal variance and LP coefficients. The signal generated using white Gaussian noise as the input to the LP filter has a high correlation coefficient of 0.97 with that of original signal, thus making LP as a useful tool for storage and transmission of EEG. The biological significance of Fourier method and the LP method in respect to the microstructure of neuronal events in the generation of EEG is discussed.

Mechanistic studies on the effect of ferrocene bonding agents in composite solid propellents

Five compounds, viz. 1,1'-ferrocenediyldiethylidene bis(thiocarbonohydrazide) (DAFT), 1,1-diacetylferrocene disemicarbazone (DAFS), 1,1-diacetylferrocenebenzoyl hydrazone (FDBAH), 1,1-diacetylferrocene-p-nitrobenzoyl hydrazone (FDNBAH), and p-toluenesulfonic acid 1,1'-ferrocenediyldiethylidene dihydrazide (TFDD) were found to be bonding agents as well as burning-rate modifiers for the ammonium perchlorate + hydroxy-terminated polybutadiene system. The tensile strength and percentage elongation significantly increased in the presence of these bonding agents (except FDBAH). The bonding agents generally did not adversely affect the slurry viscosity during processing. The bonding sites were located by infrared spectroscopy, supported by determination of the dissolution kinetics of the bonding agents and scanning electron microscopy. The bonding agents did not undergo any side-reactions with the curing agents.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Mechanistic studies on the effect of ferrocene bonding agents in composite solid propellents

Five compounds, viz. 1,1'-ferrocenediyldiethylidene bis(thiocarbonohydrazide) (DAFT), 1,1-diacetylferrocene disemicarbazone (DAFS), 1,1-diacetylferrocenebenzoyl hydrazone (FDBAH), 1,1-diacetylferrocene-p-nitrobenzoyl hydrazone (FDNBAH), and p-tolenesulfonic acid, 1,1'-ferrocenediyldiethylidene dihydrazide (TFDD) were found to be bonding agents as well as burning-rate modifiers for the ammonium perchlorate + hydroxy-terminated polybutadiene system. The tensile strength and percentage elongation significantly increased in the presence of these bonding agents (except FDBAH). The bonding agents generally did not adversely affect the slurry viscosity during processing. The bonding sites were located by infrared spectroscopy, supported by determination of the dissolution kinetics of the bonding agents and scanning electron microscopy. The bonding agents did not undergo any side-reactions with the curing agents.

An integrated model for optimal reservoir operation for irrigation of multiple crops

An integrated model is developed, based on seasonal inputs of reservoir inflow and rainfall in the irrigated area, to determine the optimal reservoir release policies and irrigation allocations to multiple crops. The model is conceptually made up of two modules, Module 1 is an intraseasonal allocation model to maximize the sum of relative yields of all crops, for a given state of the system, using linear programming (LP). The module takes into account reservoir storage continuity, soil moisture balance, and crop root growth with time. Module 2 is a seasonal allocation model to derive the steady state reservoir operating policy using stochastic dynamic programming (SDP). Reservoir storage, seasonal inflow, and seasonal rainfall are the state variables in the SDP. The objective in SDP is to maximize the expected sum of relative yields of all crops in a year. The results of module 1 and the transition probabilities of seasonal inflow and rainfall form the input for module 2. The use of seasonal inputs coupled with the LP-SDP solution strategy in the present formulation facilitates in relaxing the limitations of an earlier study, while affecting additional improvements. The model is applied to an existing reservoir in Karnataka State, India.

Primary pyrolysis products of thiokol liquid polysulfide

An analysis of the primary degradation products of the widely used commercial polysulfide polymer Thiokol LP-33 by direct pyrolysis-mass spectrometry (DP-MS) is reported. The mechanism of degradation is through a radical process involving the random cleavage of a formal C-O bond followed by backbiting to form the cyclic products.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.