Paraxial-wave optics and relativistic front description .1. The scalar theory

With the extension of the work of the preceding paper, the relativistic front form for Maxwell's equations for electromagnetism is developed and shown to be particularly suited to the description of paraxial waves. The generators of the Poincaré group in a form applicable directly to the electric and magnetic field vectors are derived. It is shown that the effect of a thin lens on a paraxial electromagnetic wave is given by a six-dimensional transformation matrix, constructed out of certain special generators of the Poincaré group. The method of construction guarantees that the free propagation of such waves as well as their transmission through ideal optical systems can be described in terms of the metaplectic group, exactly as found for scalar waves by Bacry and Cadilhac. An alternative formulation in terms of a vector potential is also constructed. It is chosen in a gauge suggested by the front form and by the requirement that the lens transformation matrix act locally in space. Pencils of light with accompanying polarization are defined for statistical states in terms of the two-point correlation function of the vector potential. Their propagation and transmission through lenses are briefly considered in the paraxial limit. This paper extends Fourier optics and completes it by formulating it for the Maxwell field. We stress that the derivations depend explicitly on the "henochromatic" idealization as well as the identification of the ideal lens with a quadratic phase shift and are heuristic to this extent.

Note on the locally product and almost locally product structures

This paper is concerned with a study of some of the properties of locally product and almost locally product structures on a differentiable manifold X n of class C k . Every locally product space has certain almost locally product structures which transform the local tangent space to X n at an arbitrary point P in a set fashion: this is studied in Theorem (2.2). Theorem (2.3) considers the nature of transformations that exist between two co-ordinate systems at a point whenever an almost locally product structure has the same local representation in each of these co-ordinate systems. A necessary and sufficient condition for X n to be a locally product manifold is obtained in terms of the pseudo-group of co-ordinate transformations on X n and the subpseudo-groups [cf., Theoren (2.1)]. Section 3 is entirely devoted to the study of integrable almost locally product structures.

Tunable Locally-Optimal Geographical Forwarding in Wireless Sensor Networks with Sleep-Wake Cycling Nodes

We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. 1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.

Variants of Miyachi�s Theorem for Nilpotent lie Groups

We formulate and prove two versions of Miyachi�s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi�s theorem for the group Fourier transform.

Variants Of Miyachi’S Theorem For Nilpotent Lie Groups

We formulate and prove two versions of Miyachi’s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi’s theorem for the group Fourier transform.

Hardness results for computing optimal locally Gabriel graphs

Delaunay and Gabriel graphs are widely studied geo-metric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Lo-cally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Gener-alized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily in-cluded or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge max-imum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G= (V, E) is a valid LGG.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

In situ transmission electron microscopy study of deformation of an aluminum alloy tribolayer

Nanoscale deformation in the tribolayer of an Al–Mg alloy is studied using an in situ mechanical probe in a transmission electron microscope. The sample is strained locally at room temperature and the deformation is observed in real time. It is observed that when the tungsten probe comes into contact with the tribolayer, the material exhibits further hardening followed by material removal.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Remarkable Capacity Retention of Nanostructured Manganese Oxide upon Cycling as an Electrode Material for Supercapacitor

Electrochemical capacity retention of nearly X-ray amorphous nanostructured manganese oxide (nanoMnO2) synthesized by mixing directly KMnO4 with ethylene glycol under ambient conditions for supercapacitor studies is enhanced significantly. Although X-ray diffraction (XRD) pattern of nanoMnO2 shows poor crystallinity, it is found that by Mn K-edge X-ray absorption near edge structure (XANES) measurement that the nanoMnO2 obtained is locally arranged in a δ-MnO2-type layered structure composed of edge-shared network of MnO6 octahedra. Field emission scanning electron microscopy and XANES measurements show that nanoMnO2 contains nearly spherical shaped morphology with δ-MnO2 structure, and 1D nanorods of α-MnO2 type structure (powder XRD) in the annealed (600 °C) sample. Volumetric nitrogen adsorption−desorption isotherms, inductively coupled plasma analysis, and thermal analysis are carried out to obtain physicochemical properties such as surface area (230 m2 g−1), porosity of nanoMnO2 (secondary mesopores of diameter 14.5 nm), water content, composition, etc., which lead to the promising electrochemical properties as an electrode for supercapacitor. The nanoMnO2 shows a very high stability even after 1200 cycles with capacity retention of about 250 F g−1.

Computation of Diffuse Solar Radiation

A technique for computing the spectral and angular (both the zenith and azimuthal) distribution of the solar energy reaching the surface of earth and any other plane in the atmosphere has been developed. Here the computer code LOWTRAN is used for getting the atmospheric transmittances in conjunction with two approximate procedures: one based on the Eddington method and the other on van de Hulst's adding method, for solving the equation of radiative transfer to obtain the diffuse radiation in the cloud-free situation. The aerosol scattering phase functions are approximated by the Hyeney-Greenstein functions. When the equation of radiative transfer is solved using the adding method, the azimuthal and zenith angle dependence of the scattered radiation is evaluated, whereas when the Eddington technique is utilized only the total downward flux of scattered solar radiation is obtained. Results of the diffuse and beam components of solar radiation received on surface of earth compare very well with those computed by other methods such as the more exact calculations using spherical harmonics and when atmospheric conditions corresponding to that prevailing locally in a tropical location (as in India) are used as inputs the computed values agree closely with the measured values.

Unsteady flow with attenuation in a fluid filled elastic tube with a stenosis

An equation governing the excess pressure has been derived, for an axially tethered and stenosed elastic tube filled with viscous liquid, by introducing the elasticity of the tube through pressure-area relation. This equation is solved numerically for large Womersley parameter and the results are presented for different types of pressure-radius relations and geometries by prescribing an outgoing wave suffering attenuation at some axial point of the tube. For a locally constricted tube it is observed that the pressure oscillates more and generates sound on the down stream side of the constriction.

WISENOM. A formal organic chemical nomenclature system

A formal chemical nomenclature system WISENOM based on a context-free grammar and graph coding is described. The system is unique, unambiguous, easily pronounceable, encodable, and decodable for organic compounds. Being a formal system, every name is provable as a theorem or derivable as a terminal sentence by using the basic axioms and rewrite rules. The syntax in Backus-Naur form, examples of name derivations, and the corresponding derivation trees are provided. Encoding procedures to convert connectivity tables to WISENOM, parsing, and decoding are described.

Tree-ring based hydroclimate reconstruction over northern Vietnam from Fokienia hodginsii: eighteenth century mega-drought and tropical Pacific influence

We present here the first statistically calibrated and verified tree-ring reconstruction of climate from continental Southeast Asia.The reconstructed variable is March-May (MAM) Palmer Drought Severity Index (PDSI) based on ring widths from 22 trees (42 radial cores) of rare and long-lived conifer, Fokienia hodginsii (Po Mu as locally called) from northern Vietnam. This is the first published tree ring chronology from Vietnam as well as the first for this species. Spanning 535 years, this is the longest cross-dated tree-ring series yet produced from continental Southeast Asia. Response analysis revealed that the annual growth of Fokienia at this site was mostly governed by soil moisture in the pre-monsoon season. The reconstruction passed the calibration-verification tests commonly used in dendroclimatology, and revealed two prominent periods of drought in the mid-eighteenth and late-nineteenth enturies. The former lasted nearly 30 years and was concurrent with a similar drought over northwestern Thailand inferred from teak rings, suggesting a ``mega-drought'' extending across Indochina in the eighteenth century. Both of our reconstructed droughts are consistent with the periods of warm sea surface temperature (SST)anomalies in the tropical Pacific. Spatial correlation analyses with global SST indicated that ENSO-like anomalies might play a role in modulating droughts over the region, with El Nio (warm) phases resulting in reduced rainfall. However, significant correlation was also seen with SST over the Indian Ocean and the north Pacific,suggesting that ENSO is not the only factor affecting the climate of the area. Spectral analyses revealed significant peaks in the range of 53.9-78.8 years as well as in the ENSO-variability range of 2.0 to 3.2 years.