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.

An optimal weighted-average congestion based pricing scheme for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

DNA looping and translocation provide an optimal cleavage mechanism for the type III restriction enzymes

EcoP15I is a type III restriction enzyme that requires two recognition sites in a defined orientation separated by up to 3.5 kbp to efficiently cleave DNA. The mechanism through which site- bound EcoP15I enzymes communicate between the two sites is unclear. Here, we use atomic force microscopy to study EcoP15I-DNA pre-cleavage complexes. From the number and size distribution of loops formed, we conclude that the loops observed do not result from translocation, but are instead formed by a contact between site- bound EcoP15I and a nonspecific region of DNA. This conclusion is confirmed by a theoretical polymer model. It is further shown that translocation must play some role, because when translocation is blocked by a Lac repressor protein, DNA cleavage is similarly blocked. On the basis of these results, we present a model for restriction by type III restriction enzymes and highlight the similarities between this and other classes of restriction enzymes.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Induced swelling of kaolinitic soil in alkali solution

Unexpected swelling induced in foundation soils can cause distress to structures founded on them. In this paper, the swelling of kaolinitic soils due to interaction with alkali solution has been reported. The induced swelling is attributed to the formation of new minerals, which has been confirmed by X-ray diffraction patters and SEM studies. To understand the effect of alkali concentration and duration of interaction, two series of consolidation experiments have been carried out. In series 1, the specimen were remoulded with water and inundated with alkali solutions and in series 2, the specimen were remoulded and inundated with same alkali solutions. A steep compression during loading cycle and no abnormal swelling during unloading cycle has been noticed for the specimen remoulded with water and inundated with 1 N NaOH solutions. The steep compression is due to the segregation or break down of clay minerals due to alkali interactions. In case of specimen inundated with 4 N NaOH solutions, abnormal swelling has been observed during unloading cycle of the consolidation test. New minerals are formed on interaction of soil with 4 N solution as confirmed by X-ray diffraction patterns. These minerals are known to have very fine pores and possess high water holding capacity. The differences in the amount of swelling of samples remoulded with water and remoulded with alkali solution are due to variations in the concentration of alkali and duration of interaction.

Cloning, overexpression, folding and purification of a biosynthetically derived three disulfide scorpion toxin (BTK-2) from Mesobuthus tamulus

BTK-2, a 32 residue scorpion toxin initially identified in the venom of red Indian scorpion Mesobuthus tamulus was cloned, overexpressed and purified using Cytochrome 155 fusion protein system developed in our laboratory. The synthetic gene coding for the peptide was designed taking into account optimal codon usage by Escherichia coli. High expression levels of the fusion protein enabled facile purification of this peptide. The presence of disulfide bonded isomers, occurring as distinctly populated states even in the fusion protein, were separated by gel filtration chromatography. The target peptide was liberated from the host protein by Tev protease cleavage and subsequent purification was achieved using RP-HPLC methods. Reverse phase HPLC clearly showed the presence of at least two isomeric forms of the peptide that were significantly populated. The oxidative folding of BTK-2 was achieved under ambient conditions during the course of purification. Structural characterization of the two forms, by solution homonuclear and heteronuclear NMR methods, has shown that these two forms exhibit significantly different structural properties, and represent the natively folded and a "misfolded" form of the peptide. The formation of properly folded BTK-2 as a major fraction without the use of in vitro oxidative refolding methods clearly indicate the versatility of the Cytochrome b(5) fusion protein system for the efficient production of peptides for high resolution NMR studies.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Gelatin hydrogel electrolytes and their application to electrochemical supercapacitors

Gelatin hydrogel electrolytes (GHEs) with varying NaCl concentrations have been prepared by cross-linking an aqueous solution of gelatin with aqueous glutaraldehyde and characterized by scanning electron microscopy, differential scanning calorimetry, cyclic voltammetry, electrochemical impedance spectroscopy, and galvanostatic chronopotentiometry. Glass transition temperatures for GHEs range between 339.6 and 376.9 K depending on the dopant concentration. Ionic conductivity behavior of GHEs was studied with varying concentrations of gelatin, glutaraldehyde, and NaCl, and found to vary between 10(-3) and 10(-1) S cm(-1). GHEs have a potential window of about 1 V. Undoped and 0.25 N NaCl-doped GHEs follow Arrhenius equations with activation energy values of 1.94 and 1.88 x 10(-4) eV, respectively. Electrochemical supercapacitors (ESs) employing these GHEs in conjunction with Black Pearl Carbon electrodes are assembled and studied. Optimal values for capacitance, phase angle, and relaxation time constant of 81 F g(-1), 75 degrees, and 0.03 s are obtained for 3 N NaCl-doped GHE, respectively. ES with pristine GHE exhibits a cycle life of 4.3 h vs 4.7 h for the ES with 3 N NaCl-doped GHE. (c) 2007 The Electrochemical Society.

Design of an optimal auction for sponsored search auctions

In this paper we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we design a novel auction which we call the OPT (optimal) auction. The OPT mechanism maximizes the search engine's expected revenue while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We show that the OPT mechanism is superior to two of the most commonly used mechanisms for sponsored search namely (1) GSP (Generalized Second Price) and (2) VCG (Vickrey-Clarke-Groves). We then show an important revenue equivalence result that the expected revenue earned by the search engine is the same for all the three mechanisms provided the advertisers are symmetric and the number of sponsored slots is strictly less than the number of advertisers.

Optimal Nonlinear Control and Estimation for a Reusable Launch Vehicle During Reentry Phase

In this paper a nonlinear optimal controller has been designed for aerodynamic control during the reentry phase of the Reusable Launch Vehicle (RLV). The controller has been designed based on a recently developed technique Optimal Dynamic Inversion (ODI). For full state feedback the controller has required full information about the system states. In this work an Extended Kalman filter (EKF) is developed to estimate the states. The vehicle (RLV) has been has been consider as a nonlinear Six-Degree-Of-Freedom (6-DOF) model. The simulation results shows that EKF gives a very good estimation of the states and it is working well with ODI. The resultant trajectories are very similar to those obtained by perfect state feedback using ODI only.

Optimal resource allocation in conflicts with the Lanchester linear law (2,1) model

This paper presents a detailed analysis of a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts in an area fire situation. Lanchester linear law attrition model is used to develop the dynamical equations governing the variation in force strength. Here we address a static resource allocation problem namely, Time-Zero-Allocation (TZA) where the resource allocation is done only at the initial time. Numerical examples are given to support the analytical results.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Quadratic Nonlinearity of One- and Two-Electron Oxidized Metalloporphyrins and Their Switching in Solution

We report the quadratic nonlinearity of one- and two-electron oxidation products of the first series of transition metal complexes of meso-tetraphenylporphyrin (TPP). Among many MTPP complexes, only CuTPP and ZnTPP show reversible oxidation/reduction cycles as seen from cyclic voltammetry experiments. While centrosymmetric neutral metalloporphyrins have zero first hyperpolarizability, β, as expected, the cation radicals and dications of CuTPP and ZnTPP have very high β values. The one- and two-electron oxidation of the MTPPs leads to symmetry-breaking of the metal−porphyrin core, resulting in a large β value that is perhaps aided in part by contributions from the two-photon resonance enhancement. The calculated static first hyperpolarizabilities, β0, which are evaluated in the framework of density functional theory by a coupled perturbed Hartree−Fock method, support the experimental trend. The switching of optical nonlinearity has been achieved between the neutral and the one-electron oxidation products but not between the one- and the two-electron oxidation products since dications that are electrochemically reversible are unstable due to the formation of stable isoporphyrins in the presence of nucleophiles such as halides.

Real-coded genetic algorithm for machining condition optimization

In this paper, we consider the machining condition optimization models presented in earlier studies. Finding the optimal combination of machining conditions within the constraints is a difficult task. Hence, in earlier studies standard optimization methods are used. The non-linear nature of the objective function, and the constraints that need to be satisfied makes it difficult to use the standard optimization methods for the solution. In this paper, we present a real coded genetic algorithm (RCGA), to find the optimal combination of machining conditions. We present various issues related to real coded genetic algorithm such as solution representation, crossover operators, and repair algorithm in detail. We also present the results obtained for these models using real coded genetic algorithm and discuss the advantages of using real coded genetic algorithm for these problems. From the results obtained, we conclude that real coded genetic algorithm is reliable and accurate for solving the machining condition optimization models.