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.

Ordered Ports – a Language Concept for High-level Distributed Programming

A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.

Solution concepts in continuous-kernel multicriteria games

This paper considers nonzero-sum multicriteria games with continuous kernels. Solution concepts based on the notions of Pareto optimality, equilibrium, and security are extended to these games. Separate necessary and sufficient conditions and existence results are presented for equilibrium, Pareto-optimal response, and Pareto-optimal security strategies of the players.

Study Of Fluid-Flow And Residence-Time Distribution In A Continuous Slab Casting Mold

The fluid-flow pattern and residence-time distribution (r.t.d.) of the fluid in a continuous casting mould have been studied using a water model. The two recirculating zones below the discharge ports have been found to be asymmetric. The effect of casting speed, discharge port diameter, shroud well depth and the immersion depth on r.t.d. have been investigated. The r.t.d. curve has been well represented by a model of two backmix cells of equal volume in series. The exist of the fluid has been found to be non-uniform across the cross-section of the mould. The fluid-flow pattern has been observed to change with time in a random fashion. Dead volume of upto 31.8% has been found with smaller discharge ports.

Performance comparison of batch and continuous flow surface aeration systems

The oxygen transfer rate and the corresponding power requirement to operate the rotor are vital for design and scale-up of surface aerators. The aeration process can be analyzed in two ways such as batch and continuous systems. The process behaviors of batch and continuous flow systems are different from each other. The experimental and numerical results obtained through the batch systems cannot be relied on and applied for the designing of the continuous aeration tank. Based on the experimentation on batch and continuous type systems, the present work compares the performance of both the batch and continuous surface aeration systems in terms of their oxygen transfer capacity and power consumption. A simulation equation developed through experimentation has shown that continuous flow surface aeration systems are taking more energy than the batch systems. It has been found that batch systems are economical and better for the field application but not feasible where large quantity of wastewater is produced.

A Deterministic Optimization Approach to Protein Sequence Design Using Continuous Models

Determining the sequence of amino acid residues in a heteropolymer chain of a protein with a given conformation is a discrete combinatorial problem that is not generally amenable for gradient-based continuous optimization algorithms. In this paper we present a new approach to this problem using continuous models. In this modeling, continuous "state functions" are proposed to designate the type of each residue in the chain. Such a continuous model helps define a continuous sequence space in which a chosen criterion is optimized to find the most appropriate sequence. Searching a continuous sequence space using a deterministic optimization algorithm makes it possible to find the optimal sequences with much less computation than many other approaches. The computational efficiency of this method is further improved by combining it with a graph spectral method, which explicitly takes into account the topology of the desired conformation and also helps make the combined method more robust. The continuous modeling used here appears to have additional advantages in mimicking the folding pathways and in creating the energy landscapes that help find sequences with high stability and kinetic accessibility. To illustrate the new approach, a widely used simplifying assumption is made by considering only two types of residues: hydrophobic (H) and polar (P). Self-avoiding compact lattice models are used to validate the method with known results in the literature and data that can be practically obtained by exhaustive enumeration on a desktop computer. We also present examples of sequence design for the HP models of some real proteins, which are solved in less than five minutes on a single-processor desktop computer Some open issues and future extensions are noted.

Tuning and stability of a singly resonant continuous-wave optical parametric oscillator close to degeneracy

Wavelength tuning and stability characteristics of a singly resonant continuous-wave optical parametric oscillator (cw OPO) in the proximity of signal-idler degeneracy have been studied. The OPO is made singly resonant by using a Bragg grating as a spectral filter in the OPO cavity. The signal-idler frequency difference can be tuned from 0.5 to 7 THz, which makes the OPO suitable for cw THz generation by optical heterodyning. The operation of the OPO within this singly-resonant regime is characterized by a strong self-stabilization effect. A gradual transition to an unstable, doubly-resonant regime is observed for a signal-idler detuning smaller than ~ 0.5 THz.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

An efficient algorithm for linear programming

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

Continuous ordering below the tricritical point: A critical test for the kinetic pathway in Fe-12at.% Si alloy

A critical test has been presented to establish the nature of the kinetic pathways for the decomposition of Fe-12 at.% Si alloy below the metastable tricritical point. The results, based on the measurements of saturation magnetization, establish that a congruent ordering from B2 --> D0(3) precedes the development of a B2 + D0(3) two-phase field, consistent with the predictions in 1976 of Allen and Cahn.

Missile battery placement for air defense: A dynamic programming approach

A procedure to evaluate surface-to-air missile battery placement patterns for air defense is presented. A measure of defense effectiveness is defined as a function of kill probability of the defense missiles and the nature of the surrounding terrain features. The concept of cumulative danger index is used to select the best path for a penetrating hostile aircraft for any given pattern of placement. The aircraft is assumed to be intelligent and well-informed. The path is generated using a dynamic programming methodology. The software package so developed can be used off-line to choose the best among a number of possible battery placement patterns.

Supermacroporous Polymer-Based Cryogel Bioreactor for Monoclonal Antibody Production in Continuous Culture Using Hybridoma Cells

Cryogel matrices composed of different polymeric blends were synthesized, yielding a unique combination of hydrophilicity and hydrophobicity with the presence or absence of charged surface. Four such cryogel matrices composed of polyacrylamide-chitosan (PAAC), poly(N-isopropylacrylamide)-chitosan, polyacrylonitrile (PAN), and poly(N-isopropylacrylamide) were tested for growth of different hybridoma cell lines and production of antibody in static culture. All the matrices were capable for the adherence of hybridoma cell lines 6A4D7, B7B10, and H9E10 to the polymeric surfaces as well as for the efficient monoclonal antibody (mAb) production. PAAC proved to be relatively better in terms of both mAb production and cell growth. Further, PAAC cryogel was designed into three different formats, monolith, disks, and beads, and used as packing material for packed-bed bioreactor. Longterm cultivation of 6A4D7 cell line on PAAC cryogel scaffold in all the three formats could be successfully done for a period of 6 weeks under static conditions. Continuous packed-bed bioreactor was setup using 6A4D7 hybridoma cell line in the three reactor formats. The reactors ran continuously for a period of 60 days during which mAb production and metabolism of cells in the bioreactors were monitored periodically. The monolith bioreactor performed most efficiently over a period of 60 days and produced a total of 57.5 mg of antibody in the first 30 days (in 500 mL) with a highest concentration of 115 mu g mL(-1), which is fourfold higher than t-flask culture. The results demonstrate that appropriate chemistry and geometry of the bioreactor matrix for cell growth and immobilization can enhance the reactor productivity. (C) 2010 American Institute of Chemical Engineers Biotechnol. Prog., 27: 170-180, 2011