228 resultados para Unit Commitment Problem
em Indian Institute of Science - Bangalore - Índia
Resumo:
Four hybrid algorithms has been developed for the solution of the unit commitment problem. They use simulated annealing as one of the constituent techniques, and produce lower cost schedules; two of them have less overhead than other soft computing techniques. They are also more robust to the choice of parameters. A special technique avoids the generating of infeasible schedules, and thus reduces computation time.
Resumo:
We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.
Resumo:
Compulsators are power sources of choice for use in electromagnetic launchers and railguns. These devices hold the promise of reducing unit costs of payload to orbit. In an earlier work, the author had calculated the current distribution in compulsator wires by considering the wire to be split into a finite number of separate wires. The present work develops an integral formulation of the problem of current distribution in compulsator wires which leads to an integrodifferential equation. Analytical solutions, including those for the integration constants, are obtained in closed form. The analytical solutions present a much clearer picture of the effect of various input parameters on the cross-sectional current distribution and point to ways in which the desired current density distribution can be achieved. Results are graphically presented and discussed, with particular reference to a 50-kJ compulsator in Bangalore. Finite-element analysis supports the results.
Resumo:
Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.
Resumo:
Let X be a convex curve in the plane (say, the unit circle), and let be a family of planar convex bodies such that every two of them meet at a point of X. Then has a transversal of size at most . Suppose instead that only satisfies the following ``(p, 2)-condition'': Among every p elements of , there are two that meet at a common point of X. Then has a transversal of size . For comparison, the best known bound for the Hadwiger-Debrunner (p, q)-problem in the plane, with , is . Our result generalizes appropriately for if is, for example, the moment curve.
Resumo:
A new theory of shock dynamics has been developed in the form of a finite number of compatibility conditions along shock rays. It has been used to study the growth or decay of shock strength for accelerating or decelerating piston starting with a nonzero piston velocity. The results show good agreement with those obtained by Harten's high resolution TVD scheme.
Resumo:
In this paper, we first recast the generalized symmetric eigenvalue problem, where the underlying matrix pencil consists of symmetric positive definite matrices, into an unconstrained minimization problem by constructing an appropriate cost function, We then extend it to the case of multiple eigenvectors using an inflation technique, Based on this asymptotic formulation, we derive a quasi-Newton-based adaptive algorithm for estimating the required generalized eigenvectors in the data case. The resulting algorithm is modular and parallel, and it is globally convergent with probability one, We also analyze the effect of inexact inflation on the convergence of this algorithm and that of inexact knowledge of one of the matrices (in the pencil) on the resulting eigenstructure. Simulation results demonstrate that the performance of this algorithm is almost identical to that of the rank-one updating algorithm of Karasalo. Further, the performance of the proposed algorithm has been found to remain stable even over 1 million updates without suffering from any error accumulation problems.
Resumo:
A general method for the preparation of novel disulfide-tethered macrocyclic diacylglycerols (DAGs) has been described. Overall synthesis involved stepwise protection, acylation, and deprotection to yield the bis(omega-bromoacyl) glycerols. In the crucial macrocyclization step, a unique reagent, benzyltriethylammonium tetrathiomolybdate (BTAT), has been used to convert individual bis(omega-bromoacyl) glycerols to their respective macrocyclic disulfides. DAG 6, which had ether linkages between hydrocarbon chains and the glycerol backbone, was also synthesized from an appropriate precursor using a similar protocol. One of the DAGs (DAG 5) had a carbon-carbon tether instead of a disulfide one and was synthesized using modified Glaser coupling. Preparation of alpha-disulfide-tethered DAG (DAG 4) required an alternative method, as treatment of the bisbromo precursor with BTAT gave a mixture of several compounds from which separation of the target molecule was cumbersome. To avoid this problem, the bisbromide was converted to its corresponding dithiocyanate, which on further treatment with BTAT yielded the desired DAG (DAG 4) in good yield. Upon treatment with the reducing agent dithiothreitol (DTT), the DAGs that contain a disulfide tether could be quantitatively converted to their "open-chain" thiol analogues. These macrocyclic DAGs and their reduced "open-chain" analogues have been incorporated in DPPC vesicles to study their effect on model membranes. Upon incorporation of DAG 1 in DPPC vesicles, formation of new isotropic phases was observed by P-31 NMR, These isotropic phases disappeared completely on opening the macrocyclic ring by a reducing agent. The thermotropic properties of DPPC bilayers having DAGs (1-6) incorporated at various concentrations were studied by differential scanning calorimetry. Incorporation of DAGs in general reduced the cooperativity unit (CU) of the vesicles. Similar experiments with reduced "open-chain" DAGs incorporated in a DPPC bilayer indicated a recovery of CU with respect to their macrocyclic "disulfide" counterparts. The effect of inclusion of these DAGs on the activity of phospholipase A(2) (PLA(2)) was studied in vitro. Incorporation of DAC 1 in DPPC membranes potentiated both bee venom and cobra venom PLA(2) activities.
Resumo:
Transition-metal oxides at the metal-insulator boundary, especially those belonging to the perovskite family, exhibit fascinating phenomena such as insulator-metal transitions controlled by composition, high-temperature superconductivity and giant magnetoresistance (GMR), Interestingly, many of these marginally metallic oxides obey the established criteria for metallicity and have a finite density of states at the Fermi;level. The perovskite manganates exhibiting GMR, on the other hand, are unusual in that they possess very high resistivities in the 'metallic' state and show no significant density of states at the Fermi level, Marginal metallicity in oxide systems is a problem of great complexity and contemporary interest and its understanding is of crucial significance to the diverse phenomena exhibited by these materials.
Resumo:
An understanding of the effect of specific solute-solvent interactions on the diffusion of a solute probe is a long standing problem of physical chemistry. In this paper a microscopic treatment of this effect is presented. The theory takes into account the modification of the solvent structure around the solute due to this specific interaction between them. It is found that for strong, attractive interaction, there is an enhanced coupling between the solute and the solvent dynamic modes (in particular, the density mode), which leads to a significant increase in the friction on the solute. The diffusion coefficient of the solute is found to depend strongly and nonlinearly on the magnitude of the attractive interaction. An interesting observation is that specific solute-solvent interaction can induce a crossover from a sliplike to a sticklike diffusion. In the limit of strong attractive interaction, we recover a dynamic version of the solvent-berg picture. On the other hand, for repulsive interaction, the diffusion coefficient of the solute increases. These results are in qualitative agreement with recent experimental observations.
Resumo:
A beam-column resting on continuous Winkler foundation and discrete elastic supports is considered. The beam-column is of variable cross-section and the variation of sectional properties along the axis of the beam-column is deterministic. Young's modulus, mass per unit length and distributed axial loadings of the beam-column have a stochastic distribution. The foundation stiffness coefficient of the Winkler model, the stiffnesses of discrete elastic supports, stiffnesses of end springs and the end thrust, are all considered as random parameters. The material property fluctuations and distributed axial loadings are considered to constitute independent, one-dimension uni-variate homogeneous real stochastic fields in space. The foundation stiffness coefficient, stiffnesses of the discrete elastic supports, stiffnesses of end springs and the end thrust are considered to constitute independent random variables. Static response, free vibration and stability behaviour of the beam-column are studied. Hamilton's principle is used to formulate the problem using stochastic FEM. Sensitivity vectors of the response and stability parameters are evaluated. Using these statistics of free vibration frequencies, mode shapes, buckling parameters, etc., are evaluated. A numerical example is given.
Resumo:
Sr2FeMoO6 oxides exhibit a half-metallic ferromagnetic (HM-FM) ground state and peculiar magnetic and magnetotransport properties, which are interesting for applications in the emerging field of spintronics and attractive for fundamental research in the field of heavily correlated electron systems. Sr2FeWO6 is an insulator with an antiferromagnetic (I-AFM) ground state. The solid solutions Sr2FeMoxW1-xO6 also have peculiar properties-W doping enhances chemical order which allows stabilization of the HM-FM state; as the W content exceeds a certain value a metal to insulator transition (MIT) occurs. The role of W in determining the physical properties of Sr2FeMoxW1-xO6 systems has been a matter of intense investigation. This work deals with the problem of the structural and electronic changes related to the MIT from a local perspective by means of x-ray absorption spectroscopy (XAS). This technique allows one to probe in detail the local structure and electronic modifications around selected absorber ions (W, Mo, Fe and Sr in our case). The results of XAS analysis in the whole composition range (0 <= x <= 1), in the near edge (XANES) and extended (EXAFS) regions, demonstrate an abrupt change of the local structure around the Fe and Mo sites at the critical composition, x(c). This change represents the microstructural counterpart associated with the MIT. Conversely, the local structure and electronic configuration of W ions remain unaltered in the whole composition range, suggesting indirect participation of W in the MIT.
Resumo:
Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.