12 resultados para Currency exchanges (Domestic)
em Indian Institute of Science - Bangalore - Índia
Resumo:
Improving access to safe drinking water can result in multi-dimensional impacts on people's livelihood. This has been aptly reflected in the Millennium Development Goals (MDG) as one of the major objectives. Despite the availability of diverse and complex set of technologies for water purification, pragmatic and cost-effective use of the same is impeding the use of available sources of water. Hence, in country like India simple low-energy technologies such as solar still are likely to succeed. Solar stills would suffice the basic minimum drinking water requirements of man. Solar stills use sunlight, to kill or inactivate many, if not all, of the pathogens found in water. This paper provides an integrated assessment of the suitability of domestic solar still as a viable safe water technology for India. Also an attempt has been made to critically assess the operational feasibility and costs incurred for using this technology in rural India.
Resumo:
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.
Resumo:
In a modernising world, building and construction trends in recent urban centres such as Bangalore, set precedence for developments in other urban centres of the country. Under such conditions, evaluating the current state of building practices could prove useful for identifying the likely nature of nationwide building trends. This paper comprises a study to evaluate the current state of domestic concealed wiring practices in the context of a modern urban centre area in India. Presently, concealed wiring is the predominant wiring method adopted for residences, both bungalows and apartments. A modern residential block in the city of Bangalore (India) was chosen as the study area. The study included extensive interaction and surveys amongst residents, professionals (architects and engineers) and site personnel (contractors and electricians). In addition, the study also included site verification on the state of wiring practices in the residential block. The study indicates that while aesthetics was the prime reason that dictated the choice of concealed wiring, its effectiveness as an appropriate and safe wiring method is severely compromised. Details of the study, results and recommendations are presented in this paper.
Resumo:
Electronic Exchanges are double-sided marketplaces that allows multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the revenue in the market. In this paper, we propose a new design approach for an one-shot exchange that collects bids from buyers and sellers and clears the market at the end of the bidding period. The main principle of the approach is to decouple the allocation from pricing. It is well known that it is impossible for an exchange with voluntary participation to be efficient and budget-balanced. Budget-balance is a mandatory requirement for an exchange to operate in profit. Our approach is to allocate the trade to maximize the reported values of the agents. The pricing is posed as payoff determination problem that distributes the total payoff fairly to all agents with budget-balance imposed as a constraint. We devise an arbitration scheme by axiomatic approach to solve the payoff determination problem using the added-value concept of game theory.
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:
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. It has been shown that the problems of surplus maximization or volume maximization in combinatorial exchanges are inapproximable even with free disposal. In this paper, the surplus maximization problem is formulated as an integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. We develop computationally efficient tâtonnement mechanisms for clearing combinatorial exchanges where the Lagrangian multipliers can be interpreted as the prices of the items set by the exchange in each iteration. Our mechanisms satisfy Individual-rationality and Budget-nonnegativity properties. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.
Resumo:
Electronic exchanges are double-sided marketplaces that allow multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the revenue in the market. Two important issues in the design of exchanges are (1) trade determination (determining the number of goods traded between any buyer-seller pair) and (2) pricing. In this paper we address the trade determination issue for one-shot, multi-attribute exchanges that trade multiple units of the same good. The bids are configurable with separable additive price functions over the attributes and each function is continuous and piecewise linear. We model trade determination as mixed integer programming problems for different possible bid structures and show that even in two-attribute exchanges, trade determination is NP-hard for certain bid structures. We also make some observations on the pricing issues that are closely related to the mixed integer formulations.
Resumo:
The following paper presents a Powerline Communication (PLC) Method for Single Phase interfaced inverters in domestic microgrids. The PLC method is based on the injection of a repeating sequence of a specific harmonic, which is then modulated on the fundamental component of the grid current supplied by the inverters to the microgrid. The power flow and information exchange are simultaneously accomplished by the grid interacting inverters based on current programmed vector control, hence there is no need for dedicated hardware. Simulation results have been shown for inter-inverter communication under different operating conditions to propose the viability. These simulations have been experimentally validated and the corresponding results have also been presented in the paper.
Resumo:
We study Heisenberg spin-1/2 and spin-1 chains with alternating ferromagnetic (J(1)(F)) and antiferromagnetic (J(1)(A)) nearest-neighbor interactions and a ferromagnetic next-nearest-neighbor interaction (J(2)(F)). In this model frustration is present due to the non-zero J(2)(F). The model with site spin s behaves like a Haldane spin chain, with site spin 2s in the limit of vanishing J(2)(F) and large J(1)(F)/J(1)(A). We show that the exact ground state of the model can be found along a line in the parameter space. For fixed J(1)(F), the phase diagram in the space of J(1)(A)-J(2)(F) is determined using numerical techniques complemented by analytical calculations. A number of quantities, including the structure factor, energy gap, entanglement entropy and zero temperature magnetization, are studied to understand the complete phase diagram. An interesting and potentially important feature of this model is that it can exhibit a macroscopic magnetization jump in the presence of a magnetic field; we study this using an effective Hamiltonian.
Resumo:
As populations of the world's largest animal species decline, it is unclear how ecosystems will react to their local extirpation. Due to the unique ecological characteristics of megaherbivores such as elephants, seed dispersal is one ecosystem process that may be affected as populations of large animals are decimated. In typically disturbed South Asian ecosystems, domestic bovids (cattle, Bos primigenius, and buffalo, Bubalus bubalis) may often be the species most available to replace Asian elephants (Elephas maximus) as endozoochorous dispersers of large-fruited mammal-dispersed species. We use feeding trials, germination trials, and movement data from the tropical moist forests of Buxa Tiger Reserve (India) to examine whether domestic bovids are viable replacements for elephants in the dispersal of three largefruited species: Dillenia indica, Artocarpus chaplasha, and Careya arborea. We find that (1) once consumed, seeds are between 2.5 (C. arborea) and 26.5 (D. indica) times more likely to pass undigested into elephant dung than domestic bovid dung; and (2) seeds from elephant dung germinated as well as or better than seeds taken from bovid dung for all plant species, with D. indica seeds from elephant dung 1.5 times more likely to germinate. Furthermore, since wild elephants have less constrained movements than even free-roaming domestic bovids, we calculate that maximum dispersal by elephants is between 9.5 and 11.2 times farther than that of domestic bovids, with about 20% of elephant-dispersed seeds being moved farther than the maximum distance seeds are moved by bovids. Our findings suggest that, while bovids are able to disperse substantial numbers of seeds over moderate distances for two of the three study species, domestic bovids will be unable to routinely emulate the reliable, long-distance dispersal of seeds executed by elephants in this tropical moist forest. Thus while domestic bovids can attenuate the effects of losing elephants as dispersers, they may not be able to prevent the decline of various mammal-dispersed fruiting species in the face of overhunting, habitat fragmentation, and climate change.
Resumo:
Low-power electronic devices used in digital telecom exchanges are vulnerable to surge voltages and currents primarily originating from natural lightning or due to the direct interactions between electric power and telecommunication lines, etc., causing the earth/ground potential rise, neutral potential rise, and faults in the system. The fault currents may flow directly to telecom lines or through the equipment to the customer's premises, causing adequate damage to the equipment and personnel safety. In wireline applications, analog or digital, central office, exchanges, and subscriber sides have to be protected. Decisive protection and protective methods have to be employed for proper functioning of the equipment under overvoltage/overcurrent conditions. Current investigation reports some interesting results obtained on the recently developed high-voltage high-current protection cards used in digital telecom exchanges. The performances of protection cards both for the ring wave and hybrid wave surges are evaluated and presented. The surge generators required for the investigation are developed and fabricated in house as per the relevant telecom standards.