A Bayesian incentive compatible mechanism for decentralized supply chain formation

In this paper we consider a decentralized supply chain formation problem for linear multi-echelon supply chains when the managers of the individual echelons are autonomous, rational, and intelligent. At each echelon, there is a choice of service providers and the specific problem we solve is that of determining a cost-optimal mix of service providers so as to achieve a desired level of end-to-end delivery performance. The problem can be broken up into two sub-problems following a mechanism design approach: (1) Design of an incentive compatible mechanism to elicit the true cost functions from the echelon managers; (2) Formulation and solution of an appropriate optimization problem using the true cost information. In this paper we propose a novel Bayesian incentive compatible mechanism for eliciting the true cost functions. This improves upon existing solutions in the literature which are all based on the classical Vickrey-Clarke-Groves mechanisms, requiring significant incentives to be paid to the echelon managers for achieving dominant strategy incentive compatibility. The proposed solution, which we call SCF-BIC (Supply Chain Formation with Bayesian Incentive Compatibility), significantly reduces the cost of supply chain formation. We illustrate the efficacy of the proposed methodology using the example of a three echelon manufacturing supply chain.

Guessing based on length functions

Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

Novel window functions for digital filters

Window technique is one of the simplest methods to design Finite Impulse Response (FIR) filters. It uses special functions to truncate an infinite sequence to a finite one. In this paper, we propose window techniques based on integer sequences. The striking feature of the proposed work is that it overcomes all the problems posed by floating point numbers and inaccuracy, as the sequences are made of only integers. Some of these integer window sequences, yield sharp transition, while some of them result in zero ripple in passband and stopband.

Stiff-String Basis Functions for Vibration Analysis of High Speed Rotating Beams

A new rotating beam finite element is developed in which the basis functions are obtained by the exact solution of the governing static homogenous differential equation of a stiff string, which results from an approximation in the rotating beam equation. These shape functions depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. Using this new element and the Hermite cubic finite element, a convergence study of natural frequencies is performed, and it is found that the new element converges much more rapidly than the conventional Hermite cubic element for the first two modes at higher rotation speeds. The new element is also applied for uniform and tapered rotating beams to determine the natural frequencies, and the results compare very well with the published results given in the literature.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Three-dimensional structure of heat shock protein 90 from Plasmodium falciparum: molecular modelling approach to rational drug design against malaria

We have recently implicated heat shock protein 90 from Plasmodium falciparum (PfHsp90) as a potential drug target against malaria. Using inhibitors specific to the nucleotide binding domain of Hsp90, we have shown potent growth inhibitory effects on development of malarial parasite in human erythrocytes. To gain better understanding of the vital role played by PfHsp90 in parasite growth, we have modeled its three dimensional structure using recently described full length structure of yeast Hsp90. Sequence similarity found between PfHsp90 and yeast Hsp90 allowed us to model the core structure with high confidence. The superimposition of the predicted structure with that of the template yeast Hsp90 structure reveals an RMSD of 3.31 angstrom. The N-terminal and middle domains showed the least RMSD (1.76 angstrom) while the more divergent C-terminus showed a greater RMSD (2.84 angstrom) with respect to the template. The structure shows overall conservation of domains involved in nucleotide binding, ATPase activity, co-chaperone binding as well as inter-subunit interactions. Important co-chaperones known to modulate Hsp90 function in other eukaryotes are conserved in malarial parasite as well. An acidic stretch of amino acids found in the linker region, which is uniquely extended in PfHsp90 could not be modeled in this structure suggesting a flexible conformation. Our results provide a basis to compare the overall structure and functional pathways dependent on PfHsp90 in malarial parasite. Further analysis of differences found between human and parasite Hsp90 may make it possible to design inhibitors targeted specifically against malaria.

Force constants and thermodynamic functions of iodine heptafluoride

Normal coordinate analysis of a molecule of the type XY7 (point group D5h) has been carried out using Wilson's FG, matrix method and the results have been utilized to calculate the force constants of IF7 from the available Raman and infrared data. Some of the assignments made previously by Lord and others have been revised and with the revised assignments the thermodynamic quantities of IF7 have been computed from 300°K to 1000°K under rigid rotator and harmonic oscillator approximation.

Potential functions for hydrogen bond interactions - III. Empirical Potential Function for the Peptide N-H...O=C Hydrogen Bond

A careful comparison of the distribution in the (R, θ)-plane of all NH ... O hydrogen bonds with that for bonds between neutral NH and neutral C=O groups indicated that the latter has a larger mean R and a wider range of θ and that the distribution was also broader than for the average case. Therefore, the potential function developed earlier for an average NH ... O hydrogen bond was modified to suit the peptide case. A three-parameter expression of the form {Mathematical expression}, with △ = R - Rmin, was found to be satisfactory. By comparing the theoretically expected distribution in R and θ with observed data (although limited), the best values were found to be p1 = 25, p3 = - 2 and q1 = 1 × 10-3, with Rmin = 2·95 Å and Vmin = - 4·5 kcal/mole. The procedure for obtaining a smooth transition from Vhb to the non-bonded potential Vnb for large R and θ is described, along with a flow chart useful for programming the formulae. Calculated values of ΔH, the enthalpy of formation of the hydrogen bond, using this function are in reasonable agreement with observation. When the atoms involved in the hydrogen bond occur in a five-membered ring as in the sequence[Figure not available: see fulltext.] a different formula for the potential function is needed, which is of the form Vhb = Vmin +p1△2 +q1x2 where x = θ - 50° for θ ≥ 50°, with p1 = 15, q1 = 0·002, Rmin = 2· Å and Vmin = - 2·5 kcal/mole. © 1971 Indian Academy of Sciences.

Potential functions for hydrogen bond interactions - IV. Minimum Energy Conformation of the α-Helical Structure of PoIy-L-Alanine

Making use of the empirical potential functions for peptide NH .. O bonds, developed in this laboratory, the relative stabilities of the rightand left-handed α-helical structures of poly-L-alanine have been investigated, by calculating their conformational energies (V). The value of Vmin of the right-handed helix (αP) is about - 10.4 kcal/mole, and that of the left-handed helix (αM) is about - 9.6 kcal/mole, showing that the former is lower in energy by 0.8 kcal/mole. The helical parameters of the stable conformation of αP are n ∼ 3.6 and h ∼ 1.5 Å. The hydrogen bond of length 2.85 Å and nonlinearity of about 10° adds about 4.0 kcal/ mole to the stabilising energy of the helix in the minimum enregy region. The energy minimum is not sharply defined, but occurs over a long valley, suggesting that a distribution of conformations (φ{symbol}, ψ) of nearly the same energy may occur for the individual residues in a helix. The experimental data of a-helical fibres of poly-L-alanine are in good agreement with the theoretical results for αP. In the case of proteins, the mean values of (φ{symbol}, ψ) for different helices are distributed, but they invariably occur within the contour for V = Vmin + 2 kcal/mole for αP.

On some integral properties of hypergeometric functions

In this note certain integrals involving hypergeometric functions have been evaluated in convenient and elegant forms. © 1971 Indian Academy of Sciences.

Synthesis of plane linkages to generate functions of two variables using point-position reduction—Part 1. Rotary inputs and output

The paper presents simple graphical procedures for position synthesis of plane linkage mechanisms to generate functions of two independent variables. The procedures are based on point-position reduction and permit synthesis of the linkage to satisfy up to six arbitrarily selected precision positions.

Synthesis of plane linkages to generate functions of two variables using point position reduction—II. Sliding inputs and outputs

The paper presents simple graphical procedures for the position synthesis of plane linkage mechanisms with sliding inputs and output to generate functions of two independent variables. The procedures are based on point position reduction and permit synthesis of the linkage to satisfy up to five arbitrarily selected precision positions.