Analysis of grid connected induction generators driven by hydro/wind turbines under realistic system constraints

Results of an investigation dealing with the behaviour of grid-connected induction generators (GCIGs) driven by typical prime movers such as mini-hydro/wind turbines are presented. Certain practical operational problems of such systems are identified. Analytical techniques are developed to study the behavior of such systems. The system consists of the induction generator (IG) feeding a 11 kV grid through a step-up transformer and a transmission line. Terminal capacitors to compensate for the lagging VAr are included in the study. Computer simulation was carried out to predict the system performance at the given input power from the turbine. Effects of variations in grid voltage, frequency, input power, and terminal capacitance on the machine and system performance are studied. An analysis of self-excitation conditions on disconnection of supply was carried out. The behavior of a 220 kW hydel system and 55/11 kW and 22 kW wind driven system corresponding to actual field conditions is discussed

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

New results on systems with second-class constraints

We show how, for large classes of systems with purely second-class constraints, further information can be obtained about the constraint algebra. In particular, a subset consisting of half the full set of constraints is shown to have vanishing mutual brackets. Some other constraint brackets are also shown to be zero. The class of systems for which our results hold includes examples from non-relativistic particle mechanics as well as relativistic field theory. The results are derived at the classical level for Poisson brackets, but in the absence of commutator anomalies the same results will hold for the commutators of the constraint operators in the corresponding quantised theories.

Gauge-invariant reformulation of theories with second-class constraints

Given a classical dynamical theory with second-class constraints, it is sometimes possible to construct another theory with first-class constraints, i.e., a gauge-invariant one, which is physically equivalent to the first theory. We identify some conditions under which this may be done, explaining the general principles and working out several examples. Field theoretic applications include the chiral Schwinger model and the non-linear sigma model. An interesting connection with the work of Faddeev and Shatashvili is pointed out.

Controlled Diffusions with Constraints, II

We consider the ergodic control for a controlled nondegenerate diffusion when m other (m finite) ergodic costs are required to satisfy prescribed bounds. Under a condition on the cost functions that penalizes instability, the existence of an optimal stable Markov control is established by convex analytic arguments.

Effect of constraints by threonine on proline containing αa-helix—A molecular dynamics approach

Proline plays an important role in the secondary structure of proteins. In the pursuit of understanding its structural role, Proline containing helices with constraints have been studied by employing molecular dynamics (MD) technique. In the present study, the constraint introduced is a threonine residue, whose sidechain has intramolecular hydrogen bond interaction with the backbone oxygen atom. The three systems that have been chosen for characterization are: (1) Ace-(Ala)12−Thr-Pro-(Ala)10−NHMe, (2) Ace-(Ala)13-Pro-Ala-Thr- (Ala)8-NHMe and (3) Ace-(Ala)13-Pro-(Ala)3-Thr-(Ala)6-NHMe. The equilibrium structures and structural transitions have been identified by monitoring the backbone dihedral angles, bend related parameters and the hydrogen bond interactions. The MD averages and root mean square (r.m.s.) fluctuations are compared and discussed. Energy minimization has been carried out on selected MD simulated points in order to analyze the characteristics of different conformations.

Binding of active site directed ligands to phospholipase A2: Implications on the molecular constraints and catalytic mechanism

Molecular constraints for the localization of active site directed ligands (competitive inhibitors and substrates) in the active site of phospholipase A2 (PLA2) are characterized. Structure activity relationships with known inhibitors suggest that the head : group interactions dominate the selectivity as well as a substantial part of the affinity. The ab initio fitting of the amide ligands in the active site was carried out to characterize the head group interactions. Based on a systematic coordinate space search, formamide is docked with known experimental constraints such as coordination of the carbonyl group to Ca2+ and hydrogen bond between amide nitrogen and ND1 of His48. An optimal position for a bound water molecule is identified and its significance for the catalytic mechanism is postulated. Unlike the traditional ''pseudo-triad'' mechanism, the ''Ca-coordinatedoxyanion'' mechanism proposed here invokes activation of the catalytic water to form the oxyanion in the coordination sphere of calcium. As it attacks the carbonyl carbon of the ester, a near-tetrahedral intermediate is formed. As the second proton of the catalytic water is abstracted by the ester oxygen, its reorientation and simultaneous cleavage form hydrogen bond with ND1 of His48. In this mechanism of esterolysis, a catalytic role for the water co-ordinated to Ca2+ is recognised.

Variable Elimination in Linear Constraints

Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.

Kinematic analysis and design of articulated manipulators with joint motion constraints

For an articulated manipulator with joint rotation constraints, we show that the maximum workspace is not necessarily obtained for equal link lengths but is also determined by the range and mean positions of the joint motions. We present expressions for sectional area, workspace volume, overlap volume and work area in terms of link ratios, mean positions and ranges of joint motion. We present a numerical procedure to obtain the maximum rectangular area that can be embedded in the workspace of an articulated manipulator with joint motion constraints. We demonstrate the use of analytical expressions and the numerical plots in the kinematic design of an articulated manipulator with joint rotation constraints.

Thermodynamic constraints along isograms in ternary systems: application to three-phase equilibria

Thermodynamic constraints on component chemical potentials in three-phase fields introduced by the various isograms suggested in the literature are derived for a ternary system containing compounds. When compositions of two compounds lie on an isogram, it is associated with specific characteristics which can be used to obtain further understanding of the interplay of thermodynamic factors that determine phase equilibria. When two compounds are shared by adjacent three-phase fields, the constraints are dictated by binary compositions generated by the intersection of a line passing through the shared compounds with the sides of the ternary triangle. Generalized expressions for an arbitrary line through the triangle are presented. These are consistent with special relations obtained along Kohler, Colinet and Jacob isograms. Five axioms are introduced and proved. They provide valuable tools for checking consistency of thermodynamic measurements and for deriving thermodynamic properties from phase diagrams. (C) 1997 Elsevier Science S.A.

Probing the limits of steric constraints in the oligomerization of copper(I) complexes: structures of two sterically congested oligomers

Oligomeric copper(I) clusters are formed by the insertion reaction of copper(I) aryloxides into heterocumulenes. The effect of varying the steric demands of the heterocumulene and the aryloxy group on the nuclearity of the oligomers formed has been probed. Reactions with copper(I)2-methoxyphenoxide and copper(I)2-methylphenoxide with PhNCS result in the formation of hexameric complexes hexakis[N-phenylimino(aryloxy)methanethiolato copper(I)] 3 and 4 respectively. Single crystal X-ray data confirmed the structure of 3. Similar insertion reactions of CS2 with the copper(I) aryloxides formed by 2,6-di-tert-butyl-4-methylphenol and 2,6-dimethylphenol result in oligomeric copper(I) complexes 7 and 8 having the (aryloxy)thioxanthate ligand. Complex 7 was confirmed to be a tetramer from single crystal X-ray crystallography. Reactions carried out with 2-mercaptopyrimidine, which has ligating properties similar to N-alkylimino(aryloxy)methanethiolate, result in the formation of an insoluble polymeric complex 11. The fluorescence spectra of oligomeric complexes are helpful in determining their nuclearity. Ir has been shown that a decrease in the steric requirements of either the heterocumulene or aryloxy parts of the ligand can compensate for steric constraints acid facilitate oligomerization. (C) 1999 Elsevier Science Ltd. All rights reserved.

Constraints on the solar internal magnetic field from a buoyancy driven solar dynamo

We report here results from a dynamo model developed on the lines of the Babcock-Leighton idea that the poloidal field is generated at the surface of the Sun from the decay of active regions. In this model magnetic buoyancy is handled with a realistic recipe - wherein toroidal flux is made to erupt from the overshoot layer wherever it exceeds a specified critical field B-C (10(5) G). The erupted toroidal field is then acted upon by the alpha-effect near the surface to give rise to the poloidal field. In this paper we study the effect of buoyancy on the dynamo generated magnetic fields. Specifically, we show that the mechanism of buoyant eruption and the subsequent depletion of the toroidal field inside the overshoot layer, is capable of constraining the magnitude and distribution of the magnetic field there. We also believe that a critical study of this mechanism may give us new information regarding the solar interior and end with an example, where we propose a method for estimating an upper limit of the difusivity within the overshoot layer.

Qualitative theorem proving in linear constraints

We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.

Precoder Designs for MIMO Broadcast Channels with Imperfect CSI

[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.Cambridge University Press, 2006. [2] H. Bolcskei, D. Gesbert, C. B. Papadias, and A.-J. van der Veen, Spacetime Wireless Systems: From Array Processing to MIMO Communications.Cambridge University Press, 2006. [3] Q. H. Spencer, C. B. Peel, A. L. Swindlehurst, and M. Haardt, “An introduction to the multiuser MIMO downlink,” IEEE Commun. Mag.,vol. 42, pp. 60–67, Oct. 2004. [4] K. Kusume, M. Joham,W. Utschick, and G. Bauch, “Efficient tomlinsonharashima precoding for spatial multiplexing on flat MIMO channel,”in Proc. IEEE ICC’2005, May 2005, pp. 2021–2025. [5] R. Fischer, C. Windpassinger, A. Lampe, and J. Huber, “MIMO precoding for decentralized receivers,” in Proc. IEEE ISIT’2002, 2002, p.496. [6] M. Schubert and H. Boche, “Iterative multiuser uplink and downlink beamforming under SINR constraints,” IEEE Trans. Signal Process.,vol. 53, pp. 2324–2334, Jul. 2005. [7] ——, “Solution of multiuser downlink beamforming problem with individual SINR constraints,” IEEE Trans. Veh. Technol., vol. 53, pp.18–28, Jan. 2004. [8] A. Wiesel, Y. C. Eldar, and Shamai, “Linear precoder via conic optimization for fixed MIMO receivers,” IEEE Trans. Signal Process., vol. 52,pp. 161–176, Jan. 2006. [9] N. Jindal, “MIMO broadcast channels with finite rate feed-back,” in Proc. IEEE GLOBECOM’2005, Nov. 2005. [10] R. Hunger, F. Dietrich, M. Joham, and W. Utschick, “Robust transmit zero-forcing filters,” in Proc. ITG Workshop on Smart Antennas, Munich,Mar. 2004, pp. 130–137. [11] M. B. Shenouda and T. N. Davidson, “Linear matrix inequality formulations of robust QoS precoding for broadcast channels,” in Proc.CCECE’2007, Apr. 2007, pp. 324–328. [12] M. Payaro, A. Pascual-Iserte, and M. A. Lagunas, “Robust power allocation designs for multiuser and multiantenna downlink communication systems through convex optimization,” IEEE J. Sel. Areas Commun.,vol. 25, pp. 1392–1401, Sep. 2007. [13] M. Biguesh, S. Shahbazpanahi, and A. B. Gershman, “Robust downlink power control in wireless cellular systems,” EURASIP Jl. Wireless Commun. Networking, vol. 2, pp. 261–272, 2004. [14] B. Bandemer, M. Haardt, and S. Visuri, “Liner MMSE multi-user MIMO downlink precoding for users with multple antennas,” in Proc.PIMRC’06, Sep. 2006, pp. 1–5. [15] J. Zhang, Y. Wu, S. Zhou, and J. Wang, “Joint linear transmitter and receiver design for the downlink of multiuser MIMO systems,” IEEE Commun. Lett., vol. 9, pp. 991–993, Nov. 2005. [16] S. Shi, M. Schubert, and H. Boche, “Downlink MMSE transceiver optimization for multiuser MIMO systems: Duality and sum-mse minimization,”IEEE Trans. Signal Process., vol. 55, pp. 5436–5446, Nov.2007. [17] A. Mezghani, M. Joham, R. Hunger, and W. Utschick, “Transceiver design for multi-user MIMO systems,” in Proc. WSA 2006, Mar. 2006. [18] R. Doostnejad, T. J. Lim, and E. Sousa, “Joint precoding and beamforming design for the downlink in a multiuser MIMO system,” in Proc.WiMob’2005, Aug. 2005, pp. 153–159. [19] N. Vucic, H. Boche, and S. Shi, “Robust transceiver optimization in downlink multiuser MIMO systems with channel uncertainty,” in Proc.IEEE ICC’2008, Beijing, China, May 2008. [20] A. Ben-Tal and A. Nemirovsky, “Selected topics in robust optimization,”Math. Program., vol. 112, pp. 125–158, Feb. 2007. [21] D. Bertsimas and M. Sim, “Tractable approximations to robust conic optimization problems,” Math. Program., vol. 107, pp. 5–36, Jun. 2006. [22] P. Ubaidulla and A. Chockalingam, “Robust Transceiver Design for Multiuser MIMO Downlink,” in Proc. IEEE Globecom’2008, New Orleans, USA, Dec. 2008, to appear. [23] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004. [24] G. H. Golub and C. F. V. Loan, Matrix Computations. The John Hopkins University Press, 1996.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.