Continuous Recording of Retardation and Intensity of Echoes from the Ionosphere

Pulse retardation method of Breit and Tuve has been modified to record continuously the equivalent height as well as the intensity of reflections from the ionosphere. Synchronized pulses are transmitted, and the received ground pulse and the reflected pulses, after amplification and suitable distortion, are applied to the focusing cylinder of a cathode ray tube the horizontal deflecting plates of which are connected to a synchronized linear time base circuit. The pattern on the screen is composed of a bright straight line corresponding to the time base with dark gaps corresponding to the received pulses. The distance between the initial points of the gaps represents retardation while the widths of the gaps correspond to the intensity of the pulses. The pattern is photographed on a vertically moving film. One of the first few records taken at Bangalore on 4 megacycles is reproduced. It shows, among other things, that the less retarded component of magneto-ionic splitting from the F layer is present most of the time. Whenever the longer retardation component does occur, it has stronger intensity than the former. Towards the late evening hours, just before disappearing, when the F layer rises and exhibits magnetoionic splitting, the intensity of the less retarded component is extremely low compared with the other component.

Electron paramagnetic resonance study of porous silicon

Electron paramagnetic resonance studies under ambient conditions of boron‐doped porous silicon show anisotropic Zeeman (g) and hyperfine (A) tensors, signaling localization of the charge carriers due to quantum confinement.

Constructing a wire-frame from views on arbitrary view planes for objects with conic sections inclined to all view planes

A new and efficient approach to construct a 3D wire-frame of an object from its orthographic projections is described. The input projections can be two or more and can include regular and complete auxiliary views. Each view may contain linear, circular and other conic sections. The output is a 3D wire-frame that is consistent with the input views. The approach can handle auxiliary views containing curved edges. This generality derives from a new technique to construct 3D vertices from the input 2D vertices (as opposed to matching coordinates that is prevalent in current art). 3D vertices are constructed by projecting the 2D vertices in a pair of views on the common line of the two views. The construction of 3D edges also does not require the addition of silhouette and tangential vertices and subsequently splitting edges in the views. The concepts of complete edges and n-tuples are introduced to obviate this need. Entities corresponding to the 3D edge in each view are first identified and the 3D edges are then constructed from the information available with the matching 2D edges. This allows the algorithm to handle conic sections that are not parallel to any of the viewing directions. The localization of effort in constructing 3D edges is the source of efficiency of the construction algorithm as it does not process all potential 3D edges. Working of the algorithm on typical drawings is illustrated. (C) 2011 Elsevier Ltd. All rights reserved.

Synthesis, Reactivity Studies, Structural Aspects, and Solution Behavior of Half Sandwich Ruthenium(II) N,N `,N `'-Triarylguanidinate Complexes

[(eta(6)-C(10)H(14))RuCl(mu-Cl)](2) (eta(6)-C(10)H(14) = eta(6)-p-cymene) was subjected to a bridge-splitting reaction with N,N',N `'-triarylguanidines, (ArNH)(2)C=NAr, in toluene at ambient temperature to afford [(eta(6)-C(10)H(14))RuCl{kappa(2)(N,N')((ArN)(2)C-N(H)Ar)}] (Ar = C(6)H(4)Me-4 (1), C(6)H(4)(OMe)-2 (2), C(6)H(4)Me-2 (3), and C(6)H(3)Me(2)-2,4 (4)) in high yield with a view aimed at understanding the influence of substituent(s) on the aryl rings of the guanidine upon the solid-state structure, solution behavior, and reactivity pattern of the products. Complexes 1-3 upon reaction with NaN(3) in ethanol at ambient temperature afforded [(eta(6)-C(10)H(14))RuN(3){kappa(2)(N,N')((ArN)(2)C-N(H)Ar)}] (Ar = C(6)H(4)Me-4 (5), C(6)H(4)(OMe)-2 (6), and C(6)H(4)Me-2 (7)) in high yield. [3 + 2] cycloaddition reaction of 5-7 with RO(O)C-C C-C(O)OR (R = Et (DEAD) and Me (DMAD)) (diethylacetylenedicarboxylate, DEAD; dimethylacetylenedicarboxylate, DMAD) in CH(2)Cl(2) at ambient temperature afforded [(eta(6)-C(10)H(14))Ru{N(3)C(2)(C(O)OR)(2)}{kappa(2)(N,N')((ArN)(2) C-N(H)Ar)}center dot xH(2)O (x = 1, R = Et, Ar = C(6)H(4)Me-4 (8 center dot H(2)O); x = 0, R = Me, Ar = C(6)H(4)(OMe)-2 (9), and C(6)H(4)Me-2 (10)) in moderate yield. The molecular structures of 1-6, 8 center dot H(2)O, and 10 were determined by single crystal X-ray diffraction data. The ruthenium atom in the aforementioned complexes revealed pseudo octahedral ``three legged piano stool'' geometry. The guanidinate ligand in 2, 3, and 6 revealed syn-syn conformation and that in 4, and 10 revealed syn-anti conformation, and the conformational difference was rationalized on the basis of subtle differences in the stereochemistry of the coordinated nitrogen atoms caused by the aryl moiety in 3 and 4 or steric overload caused by the substituents around the ruthenium atom in 10. The bonding pattern of the CN(3) unit of the guanidinate ligand in the new complexes was explained by invoking n-pi conjugation involving the interaction of the NHAr/N(coord)Ar lone pair with C=N pi* orbital of the imine unit. Complexes 1, 2, 5, 6, 8 center dot H(2)O, and 9 were shown to exist as a single isomer in solution as revealed by NMR data, and this was ascribed to a fast C-N(H)Ar bond rotation caused by a less bulky aryl moiety in these complexes. In contrast, 3 and 10 were shown to exist as a mixture of three and five isomers in about 1:1:1 and 1.0:1.2:2:7:3.5:6.9 ratios, respectively in solution as revealed by a VT (1)H NMR, (1)H-(1)H COSY in conjunction with DEPT-90 (13)C NMR data measured at 233 K in the case of 3. The multiple number of isomers in solution was ascribed to the restricted C-N(H)(o-tolyl) bond rotation caused by the bulky o-tolyl substituent in 3 or the aforementioned restricted C-NH(o-tolyl) bond rotation as well as the restricted ruthenium-arene(centroid) bond rotation caused by the substituents around the ruthenium atom in 10.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Hierarchical Clustering Algorithm for Land Cover Mapping Using Satellite Images

This paper presents hierarchical clustering algorithms for land cover mapping problem using multi-spectral satellite images. In unsupervised techniques, the automatic generation of number of clusters and its centers for a huge database is not exploited to their full potential. Hence, a hierarchical clustering algorithm that uses splitting and merging techniques is proposed. Initially, the splitting method is used to search for the best possible number of clusters and its centers using Mean Shift Clustering (MSC), Niche Particle Swarm Optimization (NPSO) and Glowworm Swarm Optimization (GSO). Using these clusters and its centers, the merging method is used to group the data points based on a parametric method (k-means algorithm). A performance comparison of the proposed hierarchical clustering algorithms (MSC, NPSO and GSO) is presented using two typical multi-spectral satellite images - Landsat 7 thematic mapper and QuickBird. From the results obtained, we conclude that the proposed GSO based hierarchical clustering algorithm is more accurate and robust.

General-sum stochastic games: Verifiability conditions for Nash equilibria

Unlike zero-sum stochastic games, a difficult problem in general-sum stochastic games is to obtain verifiable conditions for Nash equilibria. We show in this paper that by splitting an associated non-linear optimization problem into several sub-problems, characterization of Nash equilibria in a general-sum discounted stochastic games is possible. Using the aforementioned sub-problems, we in fact derive a set of necessary and sufficient verifiable conditions (termed KKT-SP conditions) for a strategy-pair to result in Nash equilibrium. Also, we show that any algorithm which tracks the zero of the gradient of the Lagrangian of every sub-problem provides a Nash strategy-pair. (c) 2012 Elsevier Ltd. All rights reserved.

Models for the estimation of life of stator insulation in large rotating machines

Epoxy resin bonded mica splitting is the insulation of choice for machine stators. However, this system is seen to be relatively weak under time varying mechanical stress, in particular the vibration causing delamination of mica and deboning of mica from the resin matrix. The situation is accentuated under the combined action of electrical, thermal and mechanical stress. Physical and probabilistic models for failure of such systems have been proposed by one of the authors of this paper earlier. This paper presents a pragmatic accelerated failure data acquisition and analytical paradigm under multi factor coupled stress, Electrical, Thermal. The parameters of the phenomenological model so developed are estimated based on sound statistical treatment of failure data.

Directional Diffusion Regulator (DDR) for some numerical solvers of hyperbolic conservation laws

A computational tool called ``Directional Diffusion Regulator (DDR)'' is proposed to bring forth real multidimensional physics into the upwind discretization in some numerical schemes of hyperbolic conservation laws. The direction based regulator when used with dimension splitting solvers, is set to moderate the excess multidimensional diffusion and hence cause genuine multidimensional upwinding like effect. The basic idea of this regulator driven method is to retain a full upwind scheme across local discontinuities, with the upwind bias decreasing smoothly to a minimum in the farthest direction. The discontinuous solutions are quantified as gradients and the regulator parameter across a typical finite volume interface or a finite difference interpolation point is formulated based on fractional local maximum gradient in any of the weak solution flow variables (say density, pressure, temperature, Mach number or even wave velocity etc.). DDR is applied to both the non-convective as well as whole unsplit dissipative flux terms of some numerical schemes, mainly of Local Lax-Friedrichs, to solve some benchmark problems describing inviscid compressible flow, shallow water dynamics and magneto-hydrodynamics. The first order solutions consistently improved depending on the extent of grid non-alignment to discontinuities, with the major influence due to regulation of non-convective diffusion. The application is also experimented on schemes such as Roe, Jameson-Schmidt-Turkel and some second order accurate methods. The consistent improvement in accuracy either at moderate or marked levels, for a variety of problems and with increasing grid size, reasonably indicate a scope for DDR as a regular tool to impart genuine multidimensional upwinding effect in a simpler framework. (C) 2012 Elsevier Inc. All rights reserved.

Feedback Overhead-Aware, Distributed, Fast, and Reliable Selection

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme.

Raman scattering, microstructural and dielectric studies on Ba1-xCaxBi4Ti4O15 ceramics

Polycrystalline powders of Ba1-xCaxBi4Ti4O15 (where x = 0, 0.25, 0.50, 0.75 and 1) were prepared via the conventional solid-state reaction route. X-ray diffraction (XRD) and Raman scattering techniques have been employed to probe into the structural changes on changing x. XRD analyses confirmed the formation of monophasic bismuth layered structure of all the above compositions with an increase in orthorhombic distortion with increase in x. Raman spectra revealed a redshift in A(1g) peak and an increase in the B-2g/B-3g splitting with increasing Ca content. The average grain size was found to increase with increasing x. The temperature of the maximum dielectric constant (T-m) increased linearly with increasing Ca-content whereas the diffuseness of the phase transition was found to decrease with the end member CaBi4Ti4O15 showing a frequency independent sharp phase transition around 1048 K. Ca doping resulted in a decrease in the remnant polarization and an increase in the coercive field. Ba0.75Ca0.25Bi4Ti4O15 ceramics showed an enhanced piezoelectric coefficient d(33) of 15 pC N-1 at room temperature. Low values of dielectric losses and tunability of temperature coefficient of dielectric constant (tau(epsilon)) in the present solid-solution suggest that these compounds can be of potential use in microwave dielectrics at high temperatures. (C) 2012 Elsevier B.V. All rights reserved.

Feedback overhead-aware fast distributed selection scheme for multi-node wireless systems

Opportunistic selection is a practically appealing technique that is used in multi-node wireless systems to maximize throughput, implement proportional fairness, etc. However, selection is challenging since the information about a node's channel gains is often available only locally at each node and not centrally. We propose a novel multiple access-based distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not always guarantee successful selection, and the fast splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme's design explicitly accounts for feedback time overheads unlike the conventional splitting scheme and guarantees selection of the user with the highest metric unlike the timer scheme. We analyze and minimize the average time including feedback required by the scheme to select. With feedback overheads, the proposed scheme is scalable and considerably faster than several schemes proposed in the literature. Furthermore, the gains increase as the feedback overhead increases.

Quasi-based hierarchical clustering for land cover mapping using satellite images

This paper presents an improved hierarchical clustering algorithm for land cover mapping problem using quasi-random distribution. Initially, Niche Particle Swarm Optimization (NPSO) with pseudo/quasi-random distribution is used for splitting the data into number of cluster centers by satisfying Bayesian Information Criteria (BIC). Themain objective is to search and locate the best possible number of cluster and its centers. NPSO which highly depends on the initial distribution of particles in search space is not been exploited to its full potential. In this study, we have compared more uniformly distributed quasi-random with pseudo-random distribution with NPSO for splitting data set. Here to generate quasi-random distribution, Faure method has been used. Performance of previously proposed methods namely K-means, Mean Shift Clustering (MSC) and NPSO with pseudo-random is compared with the proposed approach - NPSO with quasi distribution(Faure). These algorithms are used on synthetic data set and multi-spectral satellite image (Landsat 7 thematic mapper). From the result obtained we conclude that use of quasi-random sequence with NPSO for hierarchical clustering algorithm results in a more accurate data classification.

A channel-aware, fast sub-channel to user assignment algorithm in OFDMA systems

Channel-aware assignment of sub-channels to users in the downlink of an OFDMA system demands extensive feedback of channel state information (CSI) to the base station. Since the feedback bandwidth is often very scarce, schemes that limit feedback are necessary. We develop a novel, low feedback splitting-based algorithm for assigning each sub-channel to its best user, i.e., the user with the highest gain for that sub-channel among all users. The key idea behind the algorithm is that, at any time, each user contends for the sub-channel on which it has the largest channel gain among the unallocated sub-channels. Unlike other existing schemes, the algorithm explicitly handles multiple access control aspects associated with the feedback of CSI. A tractable asymptotic analysis of a system with a large number of users helps design the algorithm. It yields 50% to 65% throughput gains compared to an asymptotically optimal one-bit feedback scheme, when the number of users is as small as 10 or as large as 1000. The algorithm is fast and distributed, and scales with the number of users.

Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors

MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typical MATLAB programs have abundant data parallelism. These programs also have control flow dominated scalar regions that have an impact on the program's execution time. Today's computer systems have tremendous computing power in the form of traditional CPU cores and throughput oriented accelerators such as graphics processing units(GPUs). Thus, an approach that maps the control flow dominated regions to the CPU and the data parallel regions to the GPU can significantly improve program performance. In this paper, we present the design and implementation of MEGHA, a compiler that automatically compiles MATLAB programs to enable synergistic execution on heterogeneous processors. Our solution is fully automated and does not require programmer input for identifying data parallel regions. We propose a set of compiler optimizations tailored for MATLAB. Our compiler identifies data parallel regions of the program and composes them into kernels. The problem of combining statements into kernels is formulated as a constrained graph clustering problem. Heuristics are presented to map identified kernels to either the CPU or GPU so that kernel execution on the CPU and the GPU happens synergistically and the amount of data transfer needed is minimized. In order to ensure required data movement for dependencies across basic blocks, we propose a data flow analysis and edge splitting strategy. Thus our compiler automatically handles composition of kernels, mapping of kernels to CPU and GPU, scheduling and insertion of required data transfer. The proposed compiler was implemented and experimental evaluation using a set of MATLAB benchmarks shows that our approach achieves a geometric mean speedup of 19.8X for data parallel benchmarks over native execution of MATLAB.