871 resultados para auction aggregation protocols
Resumo:
Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trading with the help of combinatorial bids. The allocation and other associated problems in such exchanges are known to be among the hardest to solve among all economic mechanisms. In this paper, we develop computationally efficient iterative auction mechanisms for solving combinatorial exchanges. Our mechanisms satisfy Individual-rationality (IR) and budget-nonnegativity (BN) properties. We also show that our method is bounded and convergent. Our numerical experiments show that our algorithm produces good quality solutions and is computationally efficient.
Resumo:
Novel cationic and neutral analogues of bile acids (1-6) were synthesized and their aggregation properties studied. Cations 1 and 2 formed thermoreversible gels in aqueous salt solutions, whereas neutral 4 formed gels in water in the presence of organic solvents such as ethanol, methanol, DMSO, and DMF. The gels derived from 1 and 4 have been investigated by SEM and with pyrene as a fluorescent probe.
Resumo:
Diatoms have become important organisms for monitoring freshwaters and their value has been recognised in Europe, American and African continents. If India is to include diatoms in the current suite of bioindicators, then thorough testing of diatom-based techniques is required. This paper provides guidance on methods through all stages of diatom collection from different habitats from streams and lakes, preparation and examination for the purposes of water quality assessment that can be adapted to most aquatic ecosystems in India.
Resumo:
Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.
Resumo:
A new structured discretization of 2D space, named X-discretization, is proposed to solve bivariate population balance equations using the framework of minimal internal consistency of discretization of Chakraborty and Kumar [2007, A new framework for solution of multidimensional population balance equations. Chem. Eng. Sci. 62, 4112-4125] for breakup and aggregation of particles. The 2D space of particle constituents (internal attributes) is discretized into bins by using arbitrarily spaced constant composition radial lines and constant mass lines of slope -1. The quadrilaterals are triangulated by using straight lines pointing towards the mean composition line. The monotonicity of the new discretization makes is quite easy to implement, like a rectangular grid but with significantly reduced numerical dispersion. We use the new discretization of space to automate the expansion and contraction of the computational domain for the aggregation process, corresponding to the formation of larger particles and the disappearance of smaller particles by adding and removing the constant mass lines at the boundaries. The results show that the predictions of particle size distribution on fixed X-grid are in better agreement with the analytical solution than those obtained with the earlier techniques. The simulations carried out with expansion and/or contraction of the computational domain as population evolves show that the proposed strategy of evolving the computational domain with the aggregation process brings down the computational effort quite substantially; larger the extent of evolution, greater is the reduction in computational effort. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
The novel three-component chiral derivatization protocols have been derived for (1)H and (19)F NMR spectroscopic discrimination of a series of chiral hydroxy acids by their coordination and self-assembly with optically active a-methylbenzylamine and 2-formylphenylboronic acid. In addition, the optically pure (S)-mandelic acid in combination with 2-formylphenylboronic acid permits visualization of enantiomers of primary amines. These protocols have been demonstrated on enantiodiscrimination of chiral amines and hydroxy acids.
Resumo:
Aggregation in hydroxyacetone (HA) is studied using low-temperature FTIR, supersonic jet expansion, and X-ray crystallographic (in situ cryocrystallization) techniques. Along with quantum chemical methods (MP2 and DFT), the experiments unravel the conformational preferences of HA upon aggregation to dinners and oligomers. The O-H center dot center dot center dot O=C intramolecular hydrogen bond present in the gas-phase monomer partially opens upon aggregation in supersonic expansions, giving rise to intermolecular cooperatively enhanced O-H center dot center dot center dot O-H hydrogen bonds in competition with isolated O-H center dot center dot center dot O=C hydrogen bonds. On the other hand, low-temperature IR studies on the neat solid and X-ray crystallographic data reveal that HA undergoes profound conformational changes upon crystallization, with the HOCC dihedral angle changing from similar to 0 degrees in the gas phase to similar to 180 degrees in the crystalline phase, hence giving rise to a completely new conformation. These conclusions are supported by theoretical calculations performed on the geometry derived from the crystalline phase.
Resumo:
A novel salicylideneaniline type fluorescent organogelator based on a 3,4,5-(tri-dodecyloxy)benzoyl group immobilizes aromatic solvents. The resulting gels show enhancement in emission and thermochromic/non-photochromic behaviour during sol-to-gel transition.
Resumo:
Sugar-based amphiphiles, consisting of two sugar head groups and an alkylene chain within the molecules, are synthesized and their aggregation and mesomorphic properties are evaluated. The hydrophilic sugar head groups, constituted with β-D-glucopyranoside units, and the lyophilic alkylene units, are coupled to a glycerol backbone to afford the ‘double-headed’ sugar amphiphiles. Aggregation studies in aqueous solutions provided their critical micellar concentrations and the aggregation numbers. Mesophase characterizations by polarizing optical microscopy and differential scanning calorimetry (DSC) revealed the phase-transition behaviour of these new ‘double-headed’ glycolipids.
Resumo:
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an optimizing compiler, they do not succeed many a time due to limited knowledge of run-time data. In this paper we examine instruction reuse of integer ALU and load instructions in network processing applications. Specifically, this paper attempts to answer the following questions: (1) How much of instruction reuse is inherent in network processing applications?, (2) Can reuse be improved by reducing interference in the reuse buffer?, (3) What characteristics of network applications can be exploited to improve reuse?, and (4) What is the effect of reuse on resource contention and memory accesses? We propose an aggregation scheme that combines the high-level concept of network traffic i.e. "flows" with a low level microarchitectural feature of programs i.e. repetition of instructions and data along with an architecture that exploits temporal locality in incoming packet data to improve reuse. We find that for the benchmarks considered, 1% to 50% of instructions are reused while the speedup achieved varies between 1% and 24%. As a side effect, instruction reuse reduces memory traffic and can therefore be considered as a scheme for low power.
Resumo:
The solution of a bivariate population balance equation (PBE) for aggregation of particles necessitates a large 2-d domain to be covered. A correspondingly large number of discretized equations for particle populations on pivots (representative sizes for bins) are solved, although at the end only a relatively small number of pivots are found to participate in the evolution process. In the present work, we initiate solution of the governing PBE on a small set of pivots that can represent the initial size distribution. New pivots are added to expand the computational domain in directions in which the evolving size distribution advances. A self-sufficient set of rules is developed to automate the addition of pivots, taken from an underlying X-grid formed by intersection of the lines of constant composition and constant particle mass. In order to test the robustness of the rule-set, simulations carried out with pivotwise expansion of X-grid are compared with those obtained using sufficiently large fixed X-grids for a number of composition independent and composition dependent aggregation kernels and initial conditions. The two techniques lead to identical predictions, with the former requiring only a fraction of the computational effort. The rule-set automatically reduces aggregation of particles of same composition to a 1-d problem. A midway change in the direction of expansion of domain, effected by the addition of particles of different mean composition, is captured correctly by the rule-set. The evolving shape of a computational domain carries with it the signature of the aggregation process, which can be insightful in complex and time dependent aggregation conditions. (c) 2012 Elsevier Ltd. All rights reserved.
Resumo:
This paper presents studies on the use of carbon nanotubes dispersed in an insulating fluid to serve as an automaton for healing open-circuit interconnect faults in integrated circuits. The physics behind the repair mechanism is the electric-field-induced diffusion limited aggregation. On the occurrence of an open fault, the repair is automatically triggered due to the presence of an electric field across the gap. We perform studies on the repair time as a function of the electric field and dispersion concentrations with the above application in mind.
Resumo:
Taurine conjugates of two cholic acid derived oligomers with different spacers between the cholic acid units were synthesized. These molecules self-assemble in aqueous media. The critical micelle concentration (CMC) values were measured by using fluorescence spectroscopic analysis and the aggregates were characterized by dynamic light scattering and electron microscopy. The cooperativity of the cholic acid units in these tetramers to solubilize cholesterol was investigated. The ability of these molecules to act as nanocarriers for liphophilic dyes was also studied.