Long range interactions between some charged solitons

A procedure is offered for evaluating the forces between classical, charged solitons at large distances. This is employed for the solitons of a complex, scalar two-dimensional field theory with a U(1) symmetry, that leads to a conserved chargeQ. These forces are the analogues of the strong interaction forces. The potential,U(Q, R), is found to be attractive, of long range, and strong when the coupling constants in the theory are small. The dependence ofU(Q, R) onQ, the sum of the charges of the two interacting solitons (Q will refer to isospin in the SU(2) generalisation of the U(1) symmetric theory) is of importance in the theory of strong interactions; group theoretical considerations do not give such information. The interaction obtained here will be the leading term in the corresponding quantum field theory when the coupling-constants are small.

A Direct Approach to the Problem of Diffraction by a Half-Plane under Mixed Boundary Conditions

A general direct technique of solving a mixed boundary value problem in the theory of diffraction by a semi-infinite plane is presented. Taking account of the correct edge-conditions, the unique solution of the problem is derived, by means of Jones' method in the theory of Wiener-Hopf technique, in the case of incident plane wave. The solution of the half-plane problem is found out in exact form. (The far-field is derived by the method of steepest descent.) It is observed that it is not the Wiener-Hopf technique which really needs any modification but a new technique is certainly required to handle the peculiar type of coupled integral equations which the Wiener-Hopf technique leads to. Eine allgemeine direkte Technik zur Lösung eines gemischten Randwertproblems in der Theorie der Beugung an einer halbunendlichen Ebene wird vorgestellt. Unter Berücksichtigung der korrekten Eckbedingungen wird mit der Methode von Jones aus der Theorie der Wiener-Hopf-Technik die eindeutige Lösung für den Fall der einfallenden ebenen Welle hergeleitet. Die Lösung des Halbebenenproblems wird in exakter Form angegeben. (Das Fernfeld wurde mit der Methode des steilsten Abstiegs bestimmt.) Es wurde bemerkt, daß es nicht die Wiener-Hopf-Technik ist, die wirklich irgend welcher Modifikationen bedurfte. Gewiß aber wird eine neue Technik zur Behandlung des besonderen Typs gekoppelter Integralgleichungen benötigt, auf die die Wiener-Hopf-Technik führt.

Thermodynamics of Phosphorus and Sulphur Removal during Basic Oxygen Steelmaking

Removal of impurity elements from hot metal is essential in basic oxygen steelmaking. Oxidation of phosphorus from hot metal has been studied by several authors since the early days of steelmaking. Influence of different parameters on the distribution of phosphorus, seen during the recent work of the authors, differs somewhat from that reported earlier. On the other hand, removal of sulphur during steelmaking has drawn much less attention. This may be due to the magnitude of desulphurisation in oxygen steelmaking being relatively low and desulphurisation during hot metal pre-treatment or in the ladle furnace offering better commercial viability Further, it is normally accepted that sulphur is removed to steelmaking slag in the form of sulphide only However, recent investigations have indicated that a significant amount of sulphur removed during basic oxygen steelmaking can exist in the form of sulphate in the slag under oxidising conditions. The distribution of sulphur during steelmaking becomes more important in the event of carry-over of sulphur-rich blast-furnace slag, which increases sulphur load in the BOF. The chemical nature of sulphur in this slag undergoes a gradual transition from sulphide to sulphate as the oxidative refining progresses.

Genetic algorithms: a survey

Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception

Optimal management of beaver population using a reduced-order distributed parameter model and single network adaptive critics

Beavers are often found to be in conflict with human interests by creating nuisances like building dams on flowing water (leading to flooding), blocking irrigation canals, cutting down timbers, etc. At the same time they contribute to raising water tables, increased vegetation, etc. Consequently, maintaining an optimal beaver population is beneficial. Because of their diffusion externality (due to migratory nature), strategies based on lumped parameter models are often ineffective. Using a distributed parameter model for beaver population that accounts for their spatial and temporal behavior, an optimal control (trapping) strategy is presented in this paper that leads to a desired distribution of the animal density in a region in the long run. The optimal control solution presented, imbeds the solution for a large number of initial conditions (i.e., it has a feedback form), which is otherwise nontrivial to obtain. The solution obtained can be used in real-time by a nonexpert in control theory since it involves only using the neural networks trained offline. Proper orthogonal decomposition-based basis function design followed by their use in a Galerkin projection has been incorporated in the solution process as a model reduction technique. Optimal solutions are obtained through a "single network adaptive critic" (SNAC) neural-network architecture.

Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays

A symmetrizer of a nonsymmetric matrix A is the symmetric matrix X that satisfies the equation XA = A(t)X, where t indicates the transpose. A symmetrizer is useful in converting a nonsymmetric eigenvalue problem into a symmetric one which is relatively easy to solve and finds applications in stability problems in control theory and in the study of general matrices. Three designs based on VLSI parallel processor arrays are presented to compute a symmetrizer of a lower Hessenberg matrix. Their scope is discussed. The first one is the Leiserson systolic design while the remaining two, viz., the double pipe design and the fitted diagonal design are the derived versions of the first design with improved performance.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Improved large-MIMO detection based on damped belief propagation

In this paper, we consider the application of belief propagation (BP) to achieve near-optimal signal detection in large multiple-input multiple-output (MIMO) systems at low complexities. Large-MIMO architectures based on spatial multiplexing (V-BLAST) as well as non-orthogonal space-time block codes(STBC) from cyclic division algebra (CDA) are considered. We adopt graphical models based on Markov random fields (MRF) and factor graphs (FG). In the MRF based approach, we use pairwise compatibility functions although the graphical models of MIMO systems are fully/densely connected. In the FG approach, we employ a Gaussian approximation (GA) of the multi-antenna interference, which significantly reduces the complexity while achieving very good performance for large dimensions. We show that i) both MRF and FG based BP approaches exhibit large-system behavior, where increasingly closer to optimal performance is achieved with increasing number of dimensions, and ii) damping of messages/beliefs significantly improves the bit error performance.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

An EDC-based turbulent premixed combustion model

In the present study, a new turbulent premixed combustion model is proposed by integrating the Coherent Flame Model with the modified eddy dissipation concept, and relating the fine structure mass fraction to the flame surface density. First, experimental results of turbulent flame speed available from literature are compared with the predicted results at different turbulence intensities to validate the flame surface density model. It is observed that the model is able to predict the turbulent burning speeds accurately. Then, a comprehensive validation is carried out utilizing data on a turbulent lifted methane flame issuing into a vitiated co-flow. Detailed comparison of temperature and species concentrations between experiment and simulation is performed at different heights of the flame. Overall, the model is found to predict both the spatial variation and peak values of the scalars at various heights satisfactorily.

SOLVING VOLUME INTEGRAL EQUATION USING ScaLAPACK

In this article, we investigate the performance of a volume integral equation code on BlueGene/L system. Volume integral equation (VIE) is solved for homogeneous and inhomogeneous dielectric objects for radar cross section (RCS) calculation in a highly parallel environment. Pulse basis functions and point matching technique is used to convert the volume integral equation into a set of simultaneous linear equations and is solved using parallel numerical library ScaLAPACK on IBM's distributed-memory supercomputer BlueGene/L by different number of processors to compare the speed-up and test the scalability of the code.

RCS ENHANCEMENT DUE TO BRAGG SCATTERING

With the advances of techniques for RCS reduction, it has become practical to develop aircraft which are invisible to modern day radars. In order to detect such low visible targets it is necessary to explore other phenomenon that contributes to the scattering of incident electromagnetic wave. It is well known from the developments from the clear air scattering using RASS induced acoustic wave could be used to create dielectric constant fluctuation. The scattering from these fluctuations rather than from the aircraft have been observed to enhance the RCS of clear air, under the condition when the incident EM wave is half of the acoustic wave, the condition of Bragg scattering would be met and RCS would be enhanced. For detecting low visibility targets which are at significant distance away from the main radar, inducement of EM fluctuation from acoustic source collocated with the acoustic source is infeasible. However the flow past aircraft produces acoustic disturbances around the aircraft can be exploited to detect low visibility targets. In this paper numerical simulation for RCS enhancement due to acoustic disturbances is presented. In effect, this requires the solution of scattering from 3D inhomogeneous complex shaped bodies. In this volume surface integral equation (VSIE) is used to compute the RCS from fluctuation introduced through the acoustic disturbances. Though the technique developed can be used to study the scattering from radars of any shape and acoustic disturbances of any shape. For illustrative condition, enhancement due to the Bragg scattering are shown to improve the RCS by nearly 30dB, for air synthetic sinusoidal acoustic variation profile for a spherical scattering volume