Design of multiunit electronic exchanges through decomposition

In this paper, we exploit the idea of decomposition to match buyers and sellers in an electronic exchange for trading large volumes of homogeneous goods, where the buyers and sellers specify marginal-decreasing piecewise constant price curves to capture volume discounts. Such exchanges are relevant for automated trading in many e-business applications. The problem of determining winners and Vickrey prices in such exchanges is known to have a worst-case complexity equal to that of as many as (1 + m + n) NP-hard problems, where m is the number of buyers and n is the number of sellers. Our method proposes the overall exchange problem to be solved as two separate and simpler problems: 1) forward auction and 2) reverse auction, which turns out to be generalized knapsack problems. In the proposed approach, we first determine the quantity of units to be traded between the sellers and the buyers using fast heuristics developed by us. Next, we solve a forward auction and a reverse auction using fully polynomial time approximation schemes available in the literature. The proposed approach has worst-case polynomial time complexity. and our experimentation shows that the approach produces good quality solutions to the problem. Note to Practitioners- In recent times, electronic marketplaces have provided an efficient way for businesses and consumers to trade goods and services. The use of innovative mechanisms and algorithms has made it possible to improve the efficiency of electronic marketplaces by enabling optimization of revenues for the marketplace and of utilities for the buyers and sellers. In this paper, we look at single-item, multiunit electronic exchanges. These are electronic marketplaces where buyers submit bids and sellers ask for multiple units of a single item. We allow buyers and sellers to specify volume discounts using suitable functions. Such exchanges are relevant for high-volume business-to-business trading of standard products, such as silicon wafers, very large-scale integrated chips, desktops, telecommunications equipment, commoditized goods, etc. The problem of determining winners and prices in such exchanges is known to involve solving many NP-hard problems. Our paper exploits the familiar idea of decomposition, uses certain algorithms from the literature, and develops two fast heuristics to solve the problem in a near optimal way in worst-case polynomial time.

Optimal allocation of carbon credits to emitting agents in a carbon economy

Reduction of carbon emissions is of paramount importance in the context of global warming. Countries and global companies are now engaged in understanding systematic ways of achieving well defined emission targets. In fact, carbon credits have become significant and strategic instruments of finance for countries and global companies. In this paper, we formulate and suggest a solution to the carbon allocation problem, which involves determining a cost minimizing allocation of carbon credits among different emitting agents. We address this challenge in the context of a global company which is faced with the challenge of determining an allocation of carbon credit caps among its divisions in a cost effective way. The problem is formulated as a reverse auction problem where the company plays the role of a buyer or carbon planning authority and the different divisions within the company are the emitting agents that specify cost curves for carbon credit reductions. Two natural variants of the problem: (a) with unlimited budget and (b) with limited budget are considered. Suitable assumptions are made on the cost curves and in each of the two cases we show that the resulting problem formulation is a knapsack problem that can be solved optimally using a greedy heuristic. The solution of the allocation problem provides critical decision support to global companies engaged seriously in green programs.

An auction algorithm for procuring wireless channel in a heterogenous wireless network

In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user. The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Inhibition of avian myeloblastosis virus reverse transcriptase and virus inactivation by metal complexes of isonicotinic acid hydrazide

The cupric and ferric complexes of isonicotinic acid hydrazide (INH) inhibit the DNA synthesis catalysed by avian myeloblastosis virus (AMV) reverse transcriptase. The inhibition was to the extent of 95% by 50 μM of cupric-INH complex and 55% by 100 μM of ferric-INH complex. These complexes have been found to bind preferentially to the enzyme than to the template-primer. Kinetic analysis showed that the cupric-INH complex is a non-competitive inhibitor with respect to dTTP. The time course of inhibition has revealed that the complexes are inhibitory even after the initiation of polynucleotide synthesis. In vivo toxicity studies in 1-day-old chicks have shown that the complexes are not toxic up to a concentration of 500 μg per chick. Infection of the 1-day-old chicks with AMV pretreated with 150 μg of either of the complexes prevented symptoms of leukemia due to virus inactivation.

Effect of human telomerase reverse transcriptase transfection on differentiation in BeWo choriocarcinoma cells

Arrest of proliferation is one of the prerequisites for differentiation of cytotrophoblasts into syncytiotrophoblasts, and thus during differentiation telomerase activity, as well as human telomerase reverse transcriptase (hTERT) expression, is down-regulated. Considering this, it is of interest to investigate whether syncytium formation can be delayed by prolonging the expression of telomerase in cytotrophoblasts. BeWo cells were transfected with pLPC-hTERT retroviral vector and the reverse transcription-polymerase chain reaction analysis for hTERT mRNA concentrations in the transfected cells revealed a several-fold increase in hTERT mRNA compared with the cells transfected with empty vector, and this confirmed that the transfection was successful. An increase in the proliferation, as assessed by bromodeoxyuridine incorporation assay, as well as an increase in mRNA and protein concentration of various cyclins and proliferating cell nuclear antigen, was noticed. The effect of hTERT transfection was also assessed after the addition of forskolin to induce differentiation and it was observed that cell–cell fusion was delayed and differentiation did not occur in hTERT-transfected cells. However, the effects seen were only transient as stable transfection was not possible and the cells were undergoing apoptosis after 72 h, which suggested that apart from hTERT other factors might be important for immortalization of BeWo cells.

Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

Effect of cupric-isonicotinic acid hydrazide complex on avian myeloblastosis virus reverse transcriptase and its associated enzyme activities

Cupric complex of isonicotinic acid hydrazide inhibits DNA synthesis by avian myloblastosis virus reverse transcriptase. This inhibition occurs in the presence of either ribonucleotide or deoxyribonucleotide templates. The inhibition of reverse transcriptase by cupric-INH complex is considerably reduced when stored or proteolytically cleaved enzyme was used in the reaction. The complex also inhibits the reverse transciptase-associated RNase H activity. The cupric-isonicotinic acid hydrazide complex cleaves pBR 322 from I DNA into smaller molecules in the presence or absence of reverse transcriptase-associated endonuclease. However, in the presence of the enzyme the DNA is cleaved to a greater extent.

Molecular mechanism for the specific inhibition of reverse transcriptase of rous sarcoma virus by the copper complexes of isonicotinic acid hydrazide

Isonicotinic acid hydrazide (isoniazid), one of the most potent antitubercular drugs, was recently shown, in our laboratory, to form two different complexes with copper, depending upon the oxidation state of the metal ion. Both the complexes have been shown to possess antiviral activity against Rous sarcoma virus, an RNA tumor virus. The antiviral activity of the complexes has been attributed to their ability to inhibit the endogenous reverse transcriptase activity of RSV. More recent studies in our laboratory indicate that both these complexes inhibit both endogenous and exogenous reactions. As low a final concentration as 50 μM of the cupric and the cuprous complexes inhibits the endogenous reaction to the extent of 93 and 75 per cent respectively. Inhibition of the exogenous reaction varies with the templates. The inhibition can be reversed by either β-mercaptoethanol or ethylene-diamine-tetra-acetic acid. The specificity of this inhibition has been ascertained by using a synthetic primer-template, −(dG)not, vert, similar15−(rCm)n, which is highly specific for reverse transcriptases. The inhibition is found to be template specific. The studies carried out, using various synthetic primer-templates, show the inhibition of both the steps of reverse transcription by the copper complexes of isoniazid.

A combinatorial procurement auction for QoS-aware web services

Business processes and application functionality are becoming available as internal web services inside enterprise boundaries as well as becoming available as commercial web services from enterprise solution vendors and web services marketplaces. Typically there are multiple web service providers offering services capable of fulfilling a particular functionality, although with different Quality of Service (QoS). Dynamic creation of business processes requires composing an appropriate set of web services that best suit the current need. This paper presents a novel combinatorial auction approach to QoS aware dynamic web services composition. Such an approach would enable not only stand-alone web services but also composite web services to be a part of a business process. The combinatorial auction leads to an integer programming formulation for the web services composition problem. An important feature of the model is the incorporation of service level agreements. We describe a software tool QWESC for QoS-aware web services composition based on the proposed approach.

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.

Highly regio-, chemo- and diastereoselective synthesis of oxa-bridged spirocycles: A novel observation of reverse selectivity

The reverse regio- and diastereoselectivities are observed between the reactions involving 5- and 6-membered-ring cyclic carbonyl ylide dipoles with alpha-methylene ketones. A mild catalytic route to synthesize spirocyclic systems with high regio-, chemo- and diastereoselectivities is described.

Reverse bias capacitance measurements on copper-doped germanium p-n junctions in the breakdown region

Results of measurements at a high frequency on reverse bias capacitance of copper-doped germanium junctions are reported. Phenomenal increase in capacitance is found in the breakdown region, particularly at low temperatures.