Nonlinear programming solutions for controlling the vibration pattern of stretched strings

The problem of controlling the vibration pattern of a driven string is considered. The basic question dealt with here is to find the control forces which reduce the energy of vibration of a driven string over a prescribed portion of its length while maintaining the energy outside that length above a desired value. The criterion of keeping the response outside the region of energy reduction as close to the original response as possible is introduced as an additional constraint. The slack unconstrained minimization technique (SLUMT) has been successfully applied to solve the above problem. The effect of varying the phase of the control forces (which results in a six-variable control problem) is then studied. The nonlinear programming techniques which have been effectively used to handle problems involving many variables and constraints therefore offer a powerful tool for the solution of vibration control problems.

Outward spherical solidification of a superheated melt with time dependent boundary flux

Short-time analytical solutions of solid and liquid temperatures and freezing front have been obtained for the outward radially symmetric spherical solidification of a superheated melt. Although results are presented here only for time dependent boundary flux, the method of solution can be used for other kinds of boundary conditions also. Later, the analytical solution has been compared with the numerical solution obtained with the help of a finite difference numerical scheme in which the grid points change with the freezing front position. An efficient method of execution of the numerical scheme has been discussed in details. Graphs have been drawn for the total solidification times and temperature distributions in the solid.

Joint Power Control, Scheduling and Routing for Multihop Energy Harvesting Sensor Networks

We study wireless multihop energy harvesting sensor networks employed for random field estimation. The sensors sense the random field and generate data that is to be sent to a fusion node for estimation. Each sensor has an energy harvesting source and can operate in two modes: Wake and Sleep. We consider the problem of obtaining jointly optimal power control, routing and scheduling policies that ensure a fair utilization of network resources. This problem has a high computational complexity. Therefore, we develop a computationally efficient suboptimal approach to obtain good solutions to this problem. We study the optimal solution and performance of the suboptimal approach through some numerical examples.

Integration-free algorithms for fixed end-point regulator problems

A new formulation is suggested for the fixed end-point regulator problem, which, in conjunction with the recently developed integration-free algorithms, provides an efficient means of obtaining numerical solutions to such problems.

Theoretical Treatment of Interaction Parameters in Multicomponent Metallic Solutions

A new theoretical equation for interaction parameter in multicomponent metallic solutions is developed using the pseudopotential formalism coupled with the free energy of the hard sphere system. The approximate expression for the pseudopotential term is given in terms of the heat of solution at infinite dilution, to allow easy evaluation of the interaction parameter in various multicomponent systems. This theory has been applied to 23 non-ferrous alloys based on Pb, Sn, Bi and indium. Comparison with the results of previous theoretical calculations using only the hard sphere model suggests that the inclusion of the pseudopotential term yields a quantitatively more correct prediction of interaction parameters in multicomponent metallic solutions. Numerical calculations were also made for 320 Fe-base solutions relevant to steelmaking and the agreement between calculation and experimental data appears reasonable, with 90% reliability in predicting the correct sign.

Thermodynamic measurements of b.c.c. Cr-Mn solid solutions at 1373 K

Thermodynamics of Cr-Mn alloys have been studied by Eremenko et al (l) using a fused salt e.m.f.technique. Their results indicate positive deviations from ideality at 1023 K. Kaufman (2) has independently estimated negative enthaipy and excess entropy for the b.c.c. Cr-Mn alloys, such that at high temperatures, the entropy term predominates over the enthalpy term giving positive deviations from ideality. Recently the thermodynamic properties of the alloys have been measured by 3acob (3) using a Knudsen cell technique in the temperature range of 1200 to 1500 K. The results indicate mild negative deviations from ideality over the entire composition range. Because of the differences in the reported results and Mn being a volatile component in the alloys which leads to surface depletion under a dynamic set up, an isopiestic technique is used to measure the properties of the alloys.

Representation of Thermodynamic Properties of Dilute Multi-Component Solutions--Options and Constraints

The different formalisms for the representation of thermodynamic data on dilute multicomponent solutions are critically reviewed. The thermodynamic consistency of the formalisms are examined and the interrelations between them are highlighted. The options are constraints in the use of the interaction parameter and Darken's quadratic formalisms for multicomponent solutions are discussed in the light of the available experimental data. Truncatred Maclaurin series expansion is thermodynamically inconsistent unless special relations between interaction parameters are invoked. However, the lack of strict mathematical consistency does not affect the practical use of the formalism. Expressions for excess partial properties can be integrated along defined composition paths without significant loss of accuracy. Although thermodynamically consistent, the applicability of Darken's quadratic formalism to strongly interacting systems remains to be established by experiment.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

A Computationally Efficient PWM Algorithm for Multilevel Inverters

Centred space vector PWM (CSVPWM) technique is popularly used for three level voltage source inverters. The reference voltage vector is synthesized by time-averaging of the three nearest voltage vectors produced by the inverter. Identifying the three voltage vectors, and calculation of the dwelling time for each vector are both computationally intensive. This paper analyses the process of PWM generation in CSVPWM. This analysis breaks up a three-level inverter into six different conceptual two level inverters in different regions of the fundamental cycle. Control of 3-level inverter is viewed as the control of the appropriate 2-level inverter. The analysis leads to a systematic simplification of the computations involved, finally resulting in a computationally efficient PWM algorithm. This algorithm exploits the equivalence between triangle comparison and space vector approaches to PWM generation. This algorithm does not involve any 3-phase/2-phase or 2-phase/3-phase transformation. This also does not involve any transformation from rectangular to polar coordinates, and vice versa. Further no evaluation of trigonometric functions is necessary. This algorithm also provides for the mitigation of DC neutral point unbalance, and is well suited to digital implementation. Simulation and experimental results are presented.

Thermal reactivity of ammonium perchlorate crystallised from solutions having different pH

The thermal reactivity of ammonium perchlorate was found to be dependent on the pH of the solution from which it had been crystallised. A nitric acid-crystallised sample reacted faster than an ammonium hydroxide-crystallised one.

Pd Supported on Titanium Nitride for Efficient Ethanol Oxidation

The excellent metal support interaction between palladium (Pd) and titanium nitride (TiN) is exploited in designing an efficient anode material. Pd-TN, that could be useful for direct ethanol fuel cell in alkaline media. The physicochemical and electrochemical characterization of the Pd-TiN/electrolyte interface reveals an efficient oxidation of ethanol coupled with excellent stability of the catalyst under electrochemical conditions. Characterization of the interface using in situ Fourier transform infrared spectroscopy (in situ FITR) shows the production CO2 at low overvoltages revealing an efficient cleaving of the C-C bond. The performance comparison of Pd supported on TiN (Pd-TiN) with that supported on carbon (Pd-C) clearly demonstrates the advantages of TiN support over carbon. A positive chemical shift of Pd (3d) binding energy confirms the existence of metal support interaction between pd and TiN, which in turn helps weaken the Pd-CO synergetic bonding interaction. The remarkable ability of TiN to accumulate -OH species on its surface coupled with the strong adhesion of Pd makes TiN an active support material for electrocatalysts.

Extended colored Petri net: An efficient tool for analyzing concurrent systems

This paper proposes a novel and simple definition of general colored Petri nets. This definition is coherent with that of (uncolored) Petri nets, preserves the reflexivity of the original net and is extended to represent inhibitors. Also suggested are systematic and formal merging rules to obtain a well-formed structure of the extended colored Petri net by folding a given uncolored net. Finally, we present a technique to compute colored invariants by selecting colored RP-subnets. On the average, the proposed technique performs better than the existing ones. The analysis procedure is explained through an illustrative example of a three-level interrupt-priority-handler scheme.