336 resultados para Efficient Solutions


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Optimal allocation of water resources for various stakeholders often involves considerable complexity with several conflicting goals, which often leads to multi-objective optimization. In aid of effective decision-making to the water managers, apart from developing effective multi-objective mathematical models, there is a greater necessity of providing efficient Pareto optimal solutions to the real world problems. This study proposes a swarm-intelligence-based multi-objective technique, namely the elitist-mutated multi-objective particle swarm optimization technique (EM-MOPSO), for arriving at efficient Pareto optimal solutions to the multi-objective water resource management problems. The EM-MOPSO technique is applied to a case study of the multi-objective reservoir operation problem. The model performance is evaluated by comparing with results of a non-dominated sorting genetic algorithm (NSGA-II) model, and it is found that the EM-MOPSO method results in better performance. The developed method can be used as an effective aid for multi-objective decision-making in integrated water resource management.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper presents a novel slicing based method for computation of volume fractions in multi-material solids given as a B-rep whose faces are triangulated and shared by either one or two materials. Such objects occur naturally in geoscience applications and the said computation is necessary for property estimation problems and iterative forward modeling. Each facet in the model is cut by the planes delineating the given grid structure or grid cells. The method, instead of classifying the points or cells with respect to the solid, exploits the convexity of triangles and the simple axis-oriented disposition of the cutting surfaces to construct a novel intermediate space enumeration representation called slice-representation, from which both the cell containment test and the volume-fraction computation are done easily. Cartesian and cylindrical grids with uniform and non-uniform spacings have been dealt with in this paper. After slicing, each triangle contributes polygonal facets, with potential elliptical edges, to the grid cells through which it passes. The volume fractions of different materials in a grid cell that is in interaction with the material interfaces are obtained by accumulating the volume contributions computed from each facet in the grid cell. The method is fast, accurate, robust and memory efficient. Examples illustrating the method and performance are included in the paper.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a simple and energy efficient distributed change detection scheme for sensor networks based on Page's parametric CUSUM algorithm. The sensor observations are IID over time and across the sensors conditioned on the change variable. Each sensor runs CUSUM and transmits only when the CUSUM is above some threshold. The transmissions from the sensors are fused at the physical layer. The channel is modeled as a multiple access channel (MAC) corrupted with IID noise. The fusion center which is the global decision maker, performs another CUSUM to detect the change. We provide the analysis and simulation results for our scheme and compare the performance with an existing scheme which ensures energy efficiency via optimal power selection.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a new weighting function which is computationally simple and an approximation to the theoretically derived optimum weighting function shown in the literature. The proposed weighting function is perceptually motivated and provides improved vector quantization performance compared to several weighting functions proposed so far, for line spectrum frequency (LSF) parameter quantization of both clean and noisy speech data.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we are concerned with energy efficient area monitoring using information coverage in wireless sensor networks, where collaboration among multiple sensors can enable accurate sensing of a point in a given area-to-monitor even if that point falls outside the physical coverage of all the sensors. We refer to any set of sensors that can collectively sense all points in the entire area-to-monitor as a full area information cover. We first propose a low-complexity heuristic algorithm to obtain full area information covers. Using these covers, we then obtain the optimum schedule for activating the sensing activity of various sensors that maximizes the sensing lifetime. The scheduling of sensor activity using the optimum schedules obtained using the proposed algorithm is shown to achieve significantly longer sensing lifetimes compared to those achieved using physical coverage. Relaxing the full area coverage requirement to a partial area coverage (e.g., 95% of area coverage as adequate instead of 100% area coverage) further enhances the lifetime.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The linear saturated stearic acid and the bent mono-unsaturated oleic acid do not mix and form solid solutions. However, the zinc salts of these acids can. From X-ray diffraction and DSC measurements we show that the layered zinc stearate and zinc oleate salts form a homogeneous solid solution at all composition ratios. The solid solutions exhibit a single melting endotherm, with the melting temperature varying linearly with composition but with the enthalpy change showing a minimum. By monitoring features in the infrared spectra that are characteristic of the global conformation of the hydrocarbon chain, and hence can distinguish between stearate and oleate chains, it is shown that solid solution formation is realized by the introduction of gauche defects in a fraction of the stearate chains that are then no longer linear. This fraction increases with oleate concentration. It has also been possible from the spectroscopic measurements to establish a quantitative relation between molecular conformational order and the thermodynamic enthalpy of melting of the solid solutions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The commercial acrylic fibre "Cashmilon" was partially hydrolyzed to convert a fraction of its nitrile (-CN) groups to carboxylic acid (-COOH) groups and then coated with polyethylenimine (PEI) resin and cross-linked with glutaraldehyde to produce a novel gel-coated fibrous sorbent with multiple functionalities of cationic, anionic and chelating types, and significantly faster sorption kinetics than bead-form sorbents. The sorption properties of the fibrous sorbent were measured using Zn(II) in aqueous solution as the sorbate to determine the effects of pH and the presence of common ions in the solution on the sorption capacity. The rate of sorption on the gel-coated fibre was measured in comparison with that on Amberlite IRA-68 weak-base resin beads, to demonstrate the marked difference between fibre and bead-form sorbents in their kinetic behaviour.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we shall study a fractional order functional integral equation. In the first part of the paper, we proved the existence and uniqueness of mile and global solutions in a Banach space. In the second part of the paper, we used the analytic semigroups theory oflinear operators and the fixed point method to establish the existence, uniqueness and convergence of approximate solutions of the given problem in a separable Hilbert space. We also proved the existence and convergence of Faedo-Galerkin approximate solution to the given problem. Finally, we give an example.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let Ohm be a bounded domain in IRN, N greater than or equal to 2, lambda > 0, q is an element of (0, N - 1) and alpha is an element of (1, N/N-1 In this article we show the existence of at least two positive solutions for the following quasilinear elliptic problem with an exponential type nonlinearity:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We have characterized the phase behavior of mixtures of the cationic surfactant cetyltrimethylammonium bromide (CTAB) and the organic salt 3-sodium-2-hydroxy naphthoate (SHN) over a wide range of surfactant concentrations using polarizing optical microscopy and X-ray diffraction. A variety of liquid crystalline phases, such as hexagonal, lamellar with and without curvature defects, and nematic, are observed in these mixtures. At high temperatures the curvature defects in the lamellar phase are annealed gradually on decreasing the water content. However, at lower temperatures these two lamellar structures are separated by an intermediate phase, where the bilayer defects appear to order into a lattice. The ternary phase diagram shows a high degree of symmetry about the line corresponding to equimolar CTAB/SHN composition, as in the case of mixtures of cationic and anionic surfactants.