Simulation of ENSO-Related Surface Winds in the Tropical Pacific by an Atmospheric General Circulation Model Forced by Observed Sea Surface Temperatures

The authors present the simulation of the tropical Pacific surface wind variability by a low-resolution (R15 horizontal resolution and 18 vertical levels) version of the Center for Ocean-Land-Atmosphere Interactions, Maryland, general circulation model (GCM) when forced by observed global sea surface temperature. The authors have examined the monthly mean surface winds acid precipitation simulated by the model that was integrated from January 1979 to March 1992. Analyses of the climatological annual cycle and interannual variability over the Pacific are presented. The annual means of the simulated zonal and meridional winds agree well with observations. The only appreciable difference is in the region of strong trade winds where the simulated zonal winds are about 15%-20% weaker than observed, The amplitude of the annual harmonics are weaker than observed over the intertropical convergence zone and the South Pacific convergence zone regions. The amplitudes of the interannual variation of the simulated zonal and meridional winds are close to those of the observed variation. The first few dominant empirical orthogonal functions (EOF) of the simulated, as well as the observed, monthly mean winds are found to contain a targe amount of high-frequency intraseasonal variations, While the statistical properties of the high-frequency modes, such as their amplitude and geographical locations, agree with observations, their detailed time evolution does not. When the data are subjected to a 5-month running-mean filter, the first two dominant EOFs of the simulated winds representing the low-frequency EI Nino-Southern Oscillation fluctuations compare quite well with observations. However, the location of the center of the westerly anomalies associated with the warm episodes is simulated about 15 degrees west of the observed locations. The model simulates well the progress of the westerly anomalies toward the eastern Pacific during the evolution of a warm event. The simulated equatorial wind anomalies are comparable in magnitude to the observed anomalies. An intercomparison of the simulation of the interannual variability by a few other GCMs with comparable resolution is also presented. The success in simulation of the large-scale low-frequency part of the tropical surface winds by the atmospheric GCM seems to be related to the model's ability to simulate the large-scale low-frequency part of the precipitation. Good correspondence between the simulated precipitation and the highly reflective cloud anomalies is seen in the first two EOFs of the 5-month running means. Moreover, the strong correlation found between the simulated precipitation and the simulated winds in the first two principal components indicates the primary role of model precipitation in driving the surface winds. The surface winds simulated by a linear model forced by the GCM-simulated precipitation show good resemblance to the GCM-simulated winds in the equatorial region. This result supports the recent findings that the large-scale part of the tropical surface winds is primarily linear.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Indian Ocean dipole mode events in an ocean general circulation model

The evolution of the dipole mode (DM) events in the Indian Ocean is examined using an ocean model that is driven by the NCEP fluxes for the period 1975-1998. The positive DM events during 1997, 1994 and 1982 and negative DM events during 1996 and 1984-1985 are captured by the model and it reproduces both the surface and subsurface features associated with these events. In its positive phase, the DM is characterized by warmer than normal SST in the western Indian Ocean and cooler than normal SST in the eastern Indian Ocean. The DM events are accompanied by easterly wind anomalies along the equatorial Indian Ocean and upwelling-favorable alongshore wind anomalies along the coast of Sumatra. The Wyrtki jets are weak during positive DM events, and the thermocline is shallower than normal in the eastern Indian Ocean and deeper in the west. This anomaly pattern reverses during negative DM events. During the positive phase of the DM easterly wind anomalies excite an upwelling equatorial Kelvin wave. This Kelvin wave reflects from the eastern boundary as an upwelling Rossby wave which propagates westward across the equatorial Indian Ocean. The anomalies in the eastern Indian Ocean weaken after the Rossby wave passes. A similar process excites a downwelling Rossby wave during the negative phase. This Rossby wave is much weaker but wind forcing in the central equatorial Indian Ocean amplifies the downwelling and increases its westward phase speed. This Rossby wave initiates the deepening of the thermocline in the western Indian Ocean during the following positive phase of the DM. Rossby wave generated in the southern tropical Indian Ocean by Ekman pumping contributes to this warming. Concurrently, the temperature equation of the model shows upwelling and downwelling to be the most important mechanism during both positive events of 1994 and 1997. (C) 2002 Elsevier Science Ltd. All rights reserved.

General theories for the electrical transport properties of carbon nanotubes

We have shown that the general theories of metals and semiconductors can be employed to understand the diameter and voltage dependency of current through metallic and semiconducting carbon nanotubes, respectively. The current through a semiconducting multiwalled carbon nanotube (MWCNT) is associated with the energy gap that is different for different shells. The contribution of the outermost shell is larger as compared to the inner shells. The general theories can also explain the diameter dependency of maximum current through nanotubes. We have also compared the current carrying ability of a MWCNT and an array of the same diameter of single wall carbon nanotubes (SWCNTs) and found that MWCNTs are better suited and deserve further investigation for possible applications as interconnects.

Temperature profiles of accretion discs around rapidly rotating strange stars in general relativity: A comparison with neutron stars

We compute the temperature profiles of accretion discs around rapidly rotating strange stars, using constant gravitational mass equilibrium sequences of these objects, considering the full effect of general relativity. Beyond a certain critical value of stellar angular momentum (J), we observe the radius ( $r_{\rm orb}$) of the innermost stable circular orbit (ISCO) to increase with J (a property seen neither in rotating black holes nor in rotating neutron stars). The reason for this is traced to the crucial dependence of ${\rm d}r_{\rm orb}/{\rm d}J$ on the rate of change of the radial gradient of the Keplerian angular velocity at $r_{\rm orb}$ with respect to J. The structure parameters and temperature profiles obtained are compared with those of neutron stars, as an attempt to provide signatures for distinguishing between the two. We show that when the full gamut of strange star equation of state models, with varying degrees of stiffness are considered, there exists a substantial overlap in properties of both neutron stars and strange stars. However, applying accretion disc model constraints to rule out stiff strange star equation of state models, we notice that neutron stars and strange stars exclusively occupy certain parameter spaces. This result implies the possibility of distinguishing these objects from each other by sensitive observations through future X-ray detectors.

A General Route to Nanoparticle Thin Films and Coatings

Nanoparticles thin films have wide range of applications such as nanoelectronics, magnetic storage devices, SERS substrate fabrication, optical grating and antireflective coating. Present work describes a method to prepare large area nanoparticles thin film of the order of few square centimeters. Thin film deposition has been done successfully on a wide range of conducting as well as non conducting substrates such as carbon-coated copper grid, silicon, m-plane of alumina, glass and (100) plane of NaCl single crystal. SEM, TEM and AFM studies have been done for microstructural characterization of the thin films. A basic mechanism has been proposed towards the understanding of the deposition process.

Fault-Tolerant Average Execution Time Optimization for General Purpose Multi-Processor System-on Chips

Fault-tolerance is due to the semiconductor technology development important, not only for safety-critical systems but also for general-purpose (non-safety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for general-purpose systems important to minimize the average execution time (AET) while ensuring fault-tolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollback-recovery with checkpointing (RRC). And, for a given multi-processor system-on-chip (MPSoC), we define integer linear programming (ILP) models that minimize AET including bus communication overhead when: (1) selecting the number of checkpoints when using RRC, (2) finding the number of processors and job-to-processor assignment when using voting, and (3) defining fault-tolerance scheme (voting or RRC) per job and defining its usage for each job. Experiments demonstrate significant savings in AET.

Topological analysis of general linear networks

A new method of network analysis, a generalization in several different senses of existing methods and applicable to all networks for which a branch-admittance (or impedance) matrix can be formed, is presented. The treatment of network determinants is very general and essentially four terminal rather than three terminal, and leads to simple expressions based on trees of a simple graph associated with the network and matrix, and involving products of low-order, usually(2 times 2)determinants of tree-branch admittances, in addition to tree-branch products as in existing methods. By comparison with existing methods, the total number of trees and of tree pairs is usually considerably reduced, and this fact, together with an easy method of tree-pair sign determination which is also presented, makes the new method simpler in general. The method can be very easily adapted, by the use of infinite parameters, to accommodate ideal transformers, operational amplifiers, and other forms of network constraint; in fact, is thought to be applicable to all linear networks.

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that space-time trellis codes (STTC) can be used to achieve these objectives. In particular, we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of construction does not exist. Delay diversity code (rate-1) is known to achieve full-diversity, for any number of transmit antennas and any signal set, but does not give a good coding gain. A product distance code based delay diversity scheme (Tarokh, V. et al., IEEE Trans. Inform. Theory, vol.44, p.744-65, 1998) enables one to improve the coding gain and construct STTCs for any given number of states using coding in conjunction with delay diversity; it was stated as an open problem. We achieve such a construction. We assume a shift register based model to construct an STTC for any state complexity. We derive a sufficient condition for this STTC to achieve full-diversity, based on the delay diversity scheme. This condition provides a framework to do coding in conjunction with delay diversity for any signal constellation. Using this condition, we provide a formal rate-1 STTC construction scheme for PSK signal sets, for any number of transmit antennas and any given number of states, which achieves full-diversity and gives a good coding gain.

Formulas for algorithmic computation of impedance matrix using general circuit constants

A set of formulas is derived from general circuit constants which facilitates formation of the impedance matrix of a power system by the bus-impedance method. The errors associated with the lumpedparameter representation of a transmission line are thereby eliminated. The formulas are valid for short lines also, if the relevant general circuit constants are employed. The mutual impedance between the added line and the existing system is not considered, but the approach suggested can well be extended to it.

Association rule mining activity : A general formalism

Mining association rules from a large collection of databases is based on two main tasks. One is generation of large itemsets; and the other is finding associations between the discovered large itemsets. Existing formalism for association rules are based on a single transaction database which is not sufficient to describe the association rules based on multiple database environment. In this paper, we give a general characterization of association rules and also give a framework for knowledge-based mining of multiple databases for association rules.