A class of one-dimensional steady-state flows in radiation-gas-dynamics

The study of steady-state flows in radiation-gas-dynamics, when radiation pressure is negligible in comparison with gas pressure, can be reduced to the study of a single first-order ordinary differential equation in particle velocity and radiation pressure. The class of steady flows, determined by the fact that the velocities in two uniform states are real, i.e. the Rankine-Hugoniot points are real, has been discussed in detail in a previous paper by one of us, when the Mach number M of the flow in one of the uniform states (at x=+∞) is greater than one and the flow direction is in the negative direction of the x-axis. In this paper we have discussed the case when M is less than or equal to one and the flow direction is still in the negative direction of the x-axis. We have drawn the various phase planes and the integral curves in each phase plane give various steady flows. We have also discussed the appearance of discontinuities in these flows.

Dipole patterns in the structures of some ferroelectrics and antiferroelectrics

The dipole patterns in the ferroelectric and antiferroelectric structures are drawn according to experimentally determined symmetry changes in the ferroelectrics and antiferroelectrics. For the ferroelectrics the dipoles of the unit cells for one domain are oriented in parallel and the directions of the polarisation in the adjacent domains are at definite angles to each other. It is assumed for the antiferroelectrics, that the superstructural unit cell is formed by the adjacent cells of the paraelectrical modification; the subcells having the antiparallel directions of the polarisation. It is these superstructural cells of the antiferroelectrics that are determined during the experimental investigations of the antiferroelectrics. The superstructural cells of the adjacent domains are different. In one case, the difference is that in the adjacent domains, the directions of the polarisation in the subcells form an angle (e.g., in PbZrO3). In other cases the superstructural cells have not only different directions of the polarisation in the subcells but different signs of the enantiomorphism (e.g., NH4H2PO4). In the third case, the only difference is that the superstructural unit cells in the adjacent domains are turned by an angle to each other round the direction of the subcell polarisation [e.g., (NH4)2H3IO6], etc.

Strong shock with radiation near the surface of a star

The propagation of a shock wave, originating in a stellar interior, is considered when it approaches the surface of the star and assumes a self-similar character, "forgetting" its initial conditions. The flow behind the shock is assumed to be spatially isothermal rather than adiabatic to simulate the conditions of large radiative transfer near the stellar surface. The adiabatic and isothermal flows behind such a shock are compared. The exact shock-propagation laws, obtained by solving the equations in similarity variables, for different values of the parameter δ in the undisturbed density law, ρ0 ∝ xδ, and γ, the ratio of specific heats, are compared with the approximate values calculated by Whitham's characteristic rule and the two show a generally good agreement.

Possible use of self-calibration to reduce systematic uncertainties in determining distance-redshift relation via gravitational radiation from merging binaries

By observing mergers of compact objects, future gravity wave experiments would measure the luminosity distance to a large number of sources to a high precision but not their redshifts. Given the directional sensitivity of an experiment, a fraction of such sources (gold plated) can be identified optically as single objects in the direction of the source. We show that if an approximate distance-redshift relation is known then it is possible to statistically resolve those sources that have multiple galaxies in the beam. We study the feasibility of using gold plated sources to iteratively resolve the unresolved sources, obtain the self-calibrated best possible distance-redshift relation and provide an analytical expression for the accuracy achievable. We derive the lower limit on the total number of sources that is needed to achieve this accuracy through self-calibration. We show that this limit depends exponentially on the beam width and give estimates for various experimental parameters representative of future gravitational wave experiments DECIGO and BBO.

Electron diffraction patterns from the Al-Mn decagonal phase

The variety of electron diffraction patterns arising from the decagonal phase has been explored using a stereographic analysis for generating the important zone axes as intersection points corresponding to important relvectors. An indexing scheme employing a set of five vectors and an orthogonal vector has been followed. A systematic tilting from the decagonal axis to one of the twofold axes has been adopted to generate a set of experimental diffraction patterns corresponding to the expected patterns from the stereographic analysis with excellent agreement.

Glowworm-inspired robot swarm for simultaneous taxis towards multiple radiation sources

This paper presents a glowworm metaphor based distributed algorithm that enables a collection of minimalist mobile robots to split into subgroups, exhibit simultaneous taxis-behavior towards, and rendezvous at multiple radiation sources such as nuclear/hazardous chemical spills and fire-origins in a fire calamity. The algorithm is based on a glowworm swarm optimization (GSO) technique that finds multiple optima of multimodal functions. The algorithm is in the same spirit as the ant-colony optimization (ACO) algorithms, but with several significant differences. The agents in the glowworm algorithm carry a luminescence quantity called luciferin along with them. Agents are thought of as glowworms that emit a light whose intensity is proportional to the associated luciferin. The key feature that is responsible for the working of the algorithm is the use of an adaptive local-decision domain, which we use effectively to detect the multiple source locations of interest. The glowworms have a finite sensor range which defines a hard limit on the local-decision domain used to compute their movements. Extensive simulations validate the feasibility of applying the glowworm algorithm to the problem of multiple source localization. We build four wheeled robots called glowworms to conduct our experiments. We use a preliminary experiment to demonstrate the basic behavioral primitives that enable each glowworm to exhibit taxis behavior towards source locations and later demonstrate a sound localization task using a set of four glowworms.

Analysis of solar radiation pressure induced coupled liberations of a gravity stabilized axisymmetric satellite

This paper presents an analysis of solar radiation pressure induced coupled librations of gravity stabilized cylindrical spacecraft with a special reference to geostationary communication satellites. The Lagrangian approach is used to obtain the corresponding equations of motion. The solar induced torques are assumed to be free of librational angles and are represented by their Fourier expansion. The response and periodic solutions are obtained through linear and nonlinear analyses, using the method of harmonic balance in the latter case. The stability conditions are obtained using Routh-Hurwitz criteria. To establish the ranges of validity the analytic response is compared with the numerical solution. Finally, values of the system parameters are suggested to make the satellite behave as desired. Among these is a possible approach to subdue the solar induced roll resonance. It is felt that the approximate analysis presented here should significantly reduce the computational efforts involved in the design and stability analysis of the systems.

Phylogenetics and biogeography of a spectacular Old World radiation of butterflies: the subtribe Mycalesina (Lepidoptera: Nymphalidae: Satyrini)

Background: Butterflies of the subtribe Mycalesina (Nymphalidae: Satyrinae) are important model organisms in ecology and evolution. This group has radiated spectacularly in the Old World tropics and presents an exciting opportunity to better understand processes of invertebrate rapid radiations. However, the generic-level taxonomy of the subtribe has been in a constant state of flux, and relationships among genera are unknown. There are six currently recognized genera in the group. Mycalesis, Lohora and Nirvanopsis are found in the Oriental region, the first of which is the most speciose genus among mycalesines, and extends into the Australasian region. Hallelesis and Bicyclus are found in mainland Africa, while Heteropsis is primarily Madagascan, with a few species in Africa. We infer the phylogeny of the group with data from three genes (total of 3139 bp) and use these data to reconstruct events in the biogeographic history of the group.,Results: The results indicate that the group Mycalesina radiated rapidly around the Oligocene-Miocene boundary. Basal relationships are unresolved, but we recover six well-supported clades. Some species of Mycalesis are nested within a primarily Madagascan clade of Heteropsis,while Nirvanopsis is nested within Lohora. The phylogeny suggests that the group had its origin either in Asia or Africa, and diversified through dispersals between the two regions, during the late Oligocene and early Miocene. The current dataset tentatively suggests that the Madagascan fauna comprises two independent radiations. The Australasian radiation shares a common ancestor derived from Asia. We discuss factors that are likely to have played a key role in the diversification of the group. Conclusions: We propose a significantly revised classification scheme for Mycalesina. We conclude that the group originated and radiated from an ancestor that was found either in Asia or Africa, with dispersals between the two regions and to Australasia. Our phylogeny paves the way for further comparative studies on this group that will help us understand the processes underlying diversification in rapid radiations of invertebrates.

Ecology of the Asian Elephant in Southern India. I. Movement and Habitat Utilization Patterns

The movement and habitat utilization patterns were studied in an Asian elephant population during 1981-83 within a 1130 km2 area in southern India (110 30' N to 120 0' N and 760 50' E to 770 15' E). The study area encompasses a diversity of vegetation types from dry thorn forest (250-400 m) through deciduous forest (400-1400 m) to stunted evergreen shola forest and grassland (1400-1800 m). Home range sizes of some identified elephants were between 105 and 320 km2. Based on the dry season distribution, five different elephant clans, each consisting of between 50 and 200 individuals and having overlapping home ranges, could be defined within the study area. Seaso- nal habitat preferences were related to the availability of water and the palatability of food plants. During the dry months (January-April) elephants congregated at high densities of up to five individuals kM-2 in river valleys where browse plants had a much higher protein content than the coarse tall grasses on hill slopes. With the onset of rains of the first wet season (May- August) they dispersed over a wider area at lower densities, largely into the tall grass forests, to feed on the fresh grasses, which then had a high protein value. During the second wet season (September-December), when the tall grasses became fibrous, they moved into lower elevation short grass open forests. The normal movement pattern could be upset during years of adverse environmental con- ditions. However, the movement pattern of elephants in this region has not basically changed for over a century, as inferred from descriptions recorded during the nineteenth century.

Multi-Pattern Viterbi Algorithm for joint decoding of multiple speech patterns

Joint decoding of multiple speech patterns so as to improve speech recognition performance is important, especially in the presence of noise. In this paper, we propose a Multi-Pattern Viterbi algorithm (MPVA) to jointly decode and recognize multiple speech patterns for automatic speech recognition (ASR). The MPVA is a generalization of the Viterbi Algorithm to jointly decode multiple patterns given a Hidden Markov Model (HMM). Unlike the previously proposed two stage Constrained Multi-Pattern Viterbi Algorithm (CMPVA),the MPVA is a single stage algorithm. MPVA has the advantage that it cart be extended to connected word recognition (CWR) and continuous speech recognition (CSR) problems. MPVA is shown to provide better speech recognition performance than the earlier techniques: using only two repetitions of noisy speech patterns (-5 dB SNR, 10% burst noise), the word error rate using MPVA decreased by 28.5%, when compared to using individual decoding. (C) 2010 Elsevier B.V. All rights reserved.

Optimal Weighted Antenna Selection For Imperfect Channel Knowledge From Training

Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio frequency (RF) chain. Due to the hardware constraints, the channels at various antenna elements have to be sounded sequentially to obtain estimates that are required for selecting the ``best'' antenna and for coherently demodulating data. Consequently, the channel state information at different antennas is outdated by different amounts. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, the channel estimates of different antennas should be weighted differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then derive an explicit formula for the optimal selection weights that minimize the SEP. We find that when selection weights are not used, the SEP need not improve as the number of antenna elements increases, which is in contrast to the ideal channel estimation case. However, the optimal selection weights remedy this situation and significantly improve performance.

Direct Writing of Copper Film Patterns by Laser-Induced Decomposition of Copper Acetate

Direct writing of patterns is being widely attempted in the field of microelectronic circuit/device manufacture. Use of this technique eliminates the need for employing photolithographic process. Laser induced direct writing can be achieved by (i) Photochemical reaction [i] , (ii) Evaporation from target material [2], and (iii) decomposition.Micron size features of palladium and copper through decomposition of palladium acetate and copper formate respectively on quartz and silicon using Argon ion laser have been reported [3,4] .In this commuication we report a technique for both single line and large area depositon of copper through decomposition of copper acetate,(CH3COO)2Cu, on alumina substrates.Nd:YAG laser known for its reliability and low maintenance cost as compared to excimer and other gas lasers is used. This technique offers an attractive and economical alternative for manufacture of thin film microcircuits.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.