A general thermodynamic framework for understanding the behaviour of absorption chillers

In this article, a general definition of the process average temperature has been developed, and the impact of the various dissipative mechanisms on 1/COP of the chiller evaluated. The present component-by-component black box analysis removes the assumptions regarding the generator outlet temperature(s) and the component effective thermal conductances. Mass transfer resistance is also incorporated into the absorber analysis to arrive at a more realistic upper limit to the cooling capacity. Finally, the theoretical foundation for the absorption chiller T-s diagram is derived. This diagrammatic approach only requires the inlet and outlet conditions of the chiller components and can be employed as a practical tool for system analysis and comparison. (C) 2000 Elsevier Science Ltd and IIR. All rights reserved.

A general procedure for generation of curved DNA molecules.

A general method for generation of base-pairs in a curved DNA structure, for any prescribed values of helical parameters--unit rise (h), unit twist (theta), wedge roll (theta R) and wedge tilt (theta T), propeller twist (theta p) and displacement (D) is described. Its application for generation of uniform as well curved structures is also illustrated with some representative examples. An interesting relationship is observed between helical twist (theta), base-pair parameters theta x, theta y and the wedge parameters theta R, theta T, which has important consequences for the description and estimation of DNA curvature.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.

Strong spin-two interaction and general relativity

The concept of short range strong spin-two (f) field (mediated by massive f-mesons) and interacting directly with hadrons was introduced along with the infinite range (g) field in early seventies. In the present review of this growing area (often referred to as strong gravity) we give a general relativistic treatment in terms of Einstein-type (non-abelian gauge) field equations with a coupling constant Gf reverse similar, equals 1038 GN (GN being the Newtonian constant) and a cosmological term λf ƒ;μν (ƒ;μν is strong gravity metric and λf not, vert, similar 1028 cm− is related to the f-meson mass). The solutions of field equations linearized over de Sitter (uniformly curves) background are capable of having connections with internal symmetries of hadrons and yielding mass formulae of SU(3) or SU(6) type. The hadrons emerge as de Sitter “microuniverses” intensely curved within (radius of curvature not, vert, similar10−14 cm).The study of spinor fields in the context of strong gravity has led to Heisenberg's non-linear spinor equation with a fundamental length not, vert, similar2 × 10−14 cm. Furthermore, one finds repulsive spin-spin interaction when two identical spin-Image particles are in parallel configuration and a connection between weak interaction and strong gravity.Various other consequences of strong gravity embrace black hole (solitonic) solutions representing hadronic bags with possible quark confinement, Regge-like relations between spins and masses, connection with monopoles and dyons, quantum geons and friedmons, hadronic temperature, prevention of gravitational singularities, providing a physical basis for Dirac's two metric and large numbers hypothesis and projected unification with other basic interactions through extended supergravity.

A new general method for the introduction of the aldehyde function in aromatic compounds

Side chain bromination of aromatic amidomethylated compounds yields aldehydes.

Composite MR image reconstruction and unaliasing for general trajectories using neural networks

In rapid parallel magnetic resonance imaging, the problem of image reconstruction is challenging. Here, a novel image reconstruction technique for data acquired along any general trajectory in neural network framework, called ``Composite Reconstruction And Unaliasing using Neural Networks'' (CRAUNN), is proposed. CRAUNN is based on the observation that the nature of aliasing remains unchanged whether the undersampled acquisition contains only low frequencies or includes high frequencies too. Here, the transformation needed to reconstruct the alias-free image from the aliased coil images is learnt, using acquisitions consisting of densely sampled low frequencies. Neural networks are made use of as machine learning tools to learn the transformation, in order to obtain the desired alias-free image for actual acquisitions containing sparsely sampled low as well as high frequencies. CRAUNN operates in the image domain and does not require explicit coil sensitivity estimation. It is also independent of the sampling trajectory used, and could be applied to arbitrary trajectories as well. As a pilot trial, the technique is first applied to Cartesian trajectory-sampled data. Experiments performed using radial and spiral trajectories on real and synthetic data, illustrate the performance of the method. The reconstruction errors depend on the acceleration factor as well as the sampling trajectory. It is found that higher acceleration factors can be obtained when radial trajectories are used. Comparisons against existing techniques are presented. CRAUNN has been found to perform on par with the state-of-the-art techniques. Acceleration factors of up to 4, 6 and 4 are achieved in Cartesian, radial and spiral cases, respectively. (C) 2010 Elsevier Inc. All rights reserved.

A geodesic constant method for computing high-frequency mutual coupling between antennas on general quadric cylinders

A Geodesic Constant Method (GCM) is outlined which provides a common approach to ray tracing on quadric cylinders in general, and yields all the surface ray-geometric parameters required in the UTD mutual coupling analysis of conformal antenna arrays in the closed form. The approach permits the incorporation of a shaping parameter which permits the modeling of quadric cylindrical surfaces of desired sharpness/flatness with a common set of equations. The mutual admittance between the slots on a general parabolic cylinder is obtained as an illustration of the applicability of the GCM.

General model of a foam bed reactor

A general model of a foam bed reactor has been developed which rigorously accounts for the extent of gas absorption with chemical reaction occurring in both the storage and foam sections. Its applicability extends to a wide spectrum of reaction velocities. The possibilities of the predominance of the bulk-liquid reaction in the storage section or the absorption with reaction in the foam section can be handled as merely special cases of the general analysis. The importance of foam for carrying out a particular gas-liquid reaction is characterised by a criterion in terms of the fractional rate of reaction in the foam section. Trends of variations in the concentrations of dissolved free A, solute B, and gas-phase A with time of operation of the reactor are presented. The nature of the variation in the fractional rate of reaction in the foam section with time, at different reaction velocities, and the effect of the liquid flow rate (across the storage section) on the transience are also illustrated. Finally, the predictions of the general model have been validated using the available experimental data on the oxidation of sodium sulphide in a foam bed reactor. The agreement between the experimental and the present theoretical information is fairly good, apart from being more insightful than all the previous models of this reactor.

Stereospecific construction of multiple contiguous quaternary carbons. Total synthesis of (±)-cis,anti,cis-1,8,12,12-tetramethyl-4-oxatricyclo[6.4.0.02,6]dodecan-3-ol, a thapsane isolated from Thapsia villosa var minor

The details of the first total synthesis of a natural thapsane lg containing three contiguous quaternary carbon atoms, starting from cyclogeraniol (9) '5 described. The Claisen rearrangement of 9 with methoxypropene in the presence of a catalytic amount of propionic acid produced ketone 10. Rhodium acetate-catalyzed intramolecular cyclopropanation of a-diazo-&keto ester 12, obtained from 10 via 8-keto ester 8, furnished cyclopropyl keto ester 7. Lithium in liquid ammonia reductive cleavage of cyclopropyl compound 7 gave a 1:l mixture of hydrindanone 6 and keto1 13. Wittig methylenation of 6 furnished ester 21. Epoxidation of 21, followed by BF3-OEt2-catalyzed rearrangement of epoxide 23 afforded hemiacetal 25. Treatment of hemiacetal 25 with triethylsilane in trifluoroacetic acid furnished lactone 22, a degradation product of various thapsanes. Finally, DIBAH reduction of lactone 22 generated the thapsane

Bearing capacity factors of circular foundations for a general c-phi soil using lower bound finite elements limit analysis

By using the lower bound limit analysis in conjunction with finite elements and linear programming, the bearing capacity factors due to cohesion, surcharge and unit weight, respectively, have been computed for a circular footing with different values of phi. The recent axisymmetric formulation proposed by the authors under phi = 0 condition, which is based on the concept that the magnitude of the hoop stress (sigma(theta)) remains closer to the least compressive normal stress (sigma(3)), is extended for a general c-phi soil. The computational results are found to compare quite well with the available numerical results from literature. It is expected that the study will be useful for solving various axisymmetric geotechnical stability problems. Copyright (C) 2010 John Wiley & Sons, Ltd.

A canonical formulation of the direct position kinematics problem for a general 6-6 stewart platform

This paper deals with the direct position kinematics problem of a general 6-6 Stewart platform, the complete solution of which is not reported in the literature until now and even establishing the number of possible solutions for the general case has remained an unsolved problem for a long period. Here a canonical formulation of the direct position kinematics problem for a general 6-6 Stewart platform is presented. The kinematic equations are expressed as a system of six quadratic and three linear equations in nine unknowns, which has a maximum of 64 solutions. Thus, it is established that the mechanism, in general, can have up to 64 closures. Further reduction of the system is shown arriving at a set of three quartic equations in three unknowns, the solution of which will yield the assembly configurations of the general Stewart platform with far less computational effort compared to earlier models.