Pristine, adherent ultrathin gold nanowires on substrates and between pre-defined contacts via a wet chemical route

We demonstrate a simple strategy of obtaining clean, ultrathin single crystal Au nanowires on substrates and interconnecting pre-defined contacts with an insight into the growth mechanism. The pristine nature enables electron transport measurement through such ultrathin wires and opens up possibilities of exploring its properties for a wide range of applications.

On pattern oriented software architecture for the grid

Precision, sophistication and economic factors in many areas of scientific research that demand very high magnitude of compute power is the order of the day. Thus advance research in the area of high performance computing is getting inevitable. The basic principle of sharing and collaborative work by geographically separated computers is known by several names such as metacomputing, scalable computing, cluster computing, internet computing and this has today metamorphosed into a new term known as grid computing. This paper gives an overview of grid computing and compares various grid architectures. We show the role that patterns can play in architecting complex systems, and provide a very pragmatic reference to a set of well-engineered patterns that the practicing developer can apply to crafting his or her own specific applications. We are not aware of pattern-oriented approach being applied to develop and deploy a grid. There are many grid frameworks that are built or are in the process of being functional. All these grids differ in some functionality or the other, though the basic principle over which the grids are built is the same. Despite this there are no standard requirements listed for building a grid. The grid being a very complex system, it is mandatory to have a standard Software Architecture Specification (SAS). We attempt to develop the same for use by any grid user or developer. Specifically, we analyze the grid using an object oriented approach and presenting the architecture using UML. This paper will propose the usage of patterns at all levels (analysis. design and architectural) of the grid development.

On the role of cloud adjustment time scale in simulating precipitation with Relaxed Arakawa-Schubert convection scheme

The precipitation by Relaxed Arakawa-Schubert cumulus parameterization in a General Circulation Model (GCM) is sensitive to the choice of relaxation parameter or specified cloud adjustment time scale. In the present study, we examine sensitivity of simulated precipitation to the choice of cloud adjustment time scale (tau(adj)) over different parts of the tropics using National Center for Environmental Prediction (NCEP) Seasonal Forecast Model (SFM) during June-September. The results show that a single specified value of tau(adj) performs best only over a particular region and different values are preferred over different parts of the world. To find a relation between tau(adj) and cloud depth (convective activity) we choose six regions over the tropics. Based on the observed relation between outgoing long-wave radiation and tau(adj), we propose a linear cloud-type dependent relaxation parameter to be used in the model. The simulations over most parts of the tropics show improved results due to this newly formulated cloud-type dependent relaxation parameter.

Transport through an electrostatically defined quantum dot lattice in a two-dimensional electron gas

Quantum dot lattices (QDLs) have the potential to allow for the tailoring of optical, magnetic, and electronic properties of a user-defined artificial solid. We use a dual gated device structure to controllably tune the potential landscape in a GaAs/AlGaAs two-dimensional electron gas, thereby enabling the formation of a periodic QDL. The current-voltage characteristics, I (V), follow a power law, as expected for a QDL. In addition, a systematic study of the scaling behavior of I (V) allows us to probe the effects of background disorder on transport through the QDL. Our results are particularly important for semiconductor-based QDL architectures which aim to probe collective phenomena.

Extracting Three Dimensional Surface Model of Human Kidney from the Visible Human Data Set using Free Software

Three dimensional digital model of a representative human kidney is needed for a surgical simulator that is capable of simulating a laparoscopic surgery involving kidney. Buying a three dimensional computer model of a representative human kidney, or reconstructing a human kidney from an image sequence using commercial software, both involve (sometimes significant amount of) money. In this paper, author has shown that one can obtain a three dimensional surface model of human kidney by making use of images from the Visible Human Data Set and a few free software packages (ImageJ, ITK-SNAP, and MeshLab in particular). Images from the Visible Human Data Set, and the software packages used here, both do not cost anything. Hence, the practice of extracting the geometry of a representative human kidney for free, as illustrated in the present work, could be a free alternative to the use of expensive commercial software or to the purchase of a digital model.

Interplay of software bloat, hardware energy proportionality and system bottlenecks

In large flexible software systems, bloat occurs in many forms, causing excess resource utilization and resource bottlenecks. This results in lost throughput and wasted joules. However, mitigating bloat is not easy; efforts are best applied where savings would be substantial. To aid this we develop an analytical model establishing the relation between bottleneck in resources, bloat, performance and power. Analyses with the model places into perspective results from the first experimental study of the power-performance implications of bloat. In the experiments we find that while bloat reduction can provide as much as 40% energy savings, the degree of impact depends on hardware and software characteristics. We confirm predictions from our model with selected results from our experimental study. Our findings show that a software-only view is inadequate when assessing the effects of bloat. The impact of bloat on physical resource usage and power should be understood for a full systems perspective to properly deploy bloat reduction solutions and reap their power-performance benefits.

A study of vertical cloud structure of the Indian summer monsoon using CloudSat data

Precise specification of the vertical distribution of cloud optical properties is important to reduce the uncertainty in quantifying the radiative impacts of clouds. The new global observations of vertical profiles of clouds from the CloudSat mission provide opportunities to describe cloud structures and to improve parameterization of clouds in the weather and climate prediction models. In this study, four years (2007-2010) of observations of vertical structure of clouds from the CloudSat cloud profiling radar have been used to document the mean vertical structure of clouds associated with the Indian summer monsoon (ISM) and its intra-seasonal variability. Active and break monsoon spells associated with the intra-seasonal variability of ISM have been identified by an objective criterion. For the present analysis, we considered CloudSat derived column integrated cloud liquid and ice water, and vertically profiles of cloud liquid and ice water content. Over the South Asian monsoon region, deep convective clouds with large vertical extent (up to 14 km) and large values of cloud water and ice content are observed over the north Bay of Bengal. Deep clouds with large ice water content are also observed over north Arabian Sea and adjoining northwest India, along the west coast of India and the south equatorial Indian Ocean. The active monsoon spells are characterized by enhanced deep convection over the Bay of Bengal, west coast of India and northeast Arabian Sea and suppressed convection over the equatorial Indian Ocean. Over the Bay of Bengal, cloud liquid water content and ice water content is enhanced by similar to 90 and similar to 200 % respectively during the active spells. An interesting feature associated with the active spell is the vertical tilting structure of positive CLWC and CIWC anomalies over the Arabian Sea and the Bay of Bengal, which suggests a pre-conditioning process for the northward propagation of the boreal summer intra-seasonal variability. It is also observed that during the break spells, clouds are not completely suppressed over central India. Instead, clouds with smaller vertical extent (3-5 km) are observed due to the presence of a heat low type of circulation. The present results will be useful for validating the vertical structure of clouds in weather and climate prediction models.

Reuse, recycle to de-bloat software

Most Java programmers would agree that Java is a language that promotes a philosophy of “create and go forth”. By design, temporary objects are meant to be created on the heap, possibly used and then abandoned to be collected by the garbage collector. Excessive generation of temporary objects is termed “object churn” and is a form of software bloat that often leads to performance and memory problems. To mitigate this problem, many compiler optimizations aim at identifying objects that may be allocated on the stack. However, most such optimizations miss large opportunities for memory reuse when dealing with objects inside loops or when dealing with container objects. In this paper, we describe a novel algorithm that detects bloat caused by the creation of temporary container and String objects within a loop. Our analysis determines which objects created within a loop can be reused. Then we describe a source-to-source transformation that efficiently reuses such objects. Empirical evaluation indicates that our solution can reduce upto 40% of temporary object allocations in large programs, resulting in a performance improvement that can be as high as a 20% reduction in the run time, specifically when a program has a high churn rate or when the program is memory intensive and needs to run the GC often.

Cubicity, degeneracy, and crossing number

A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes. Similarly, the cubicity of $G$, denoted as $\cubi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-cubes. It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/ 0607092, 2006.] that, for a graph $G$ with maximum degree $\Delta$, $\cubi(G)\leq \lceil 4(\Delta +1)\log n\rceil$. In this paper, we show that, for a $k$-degenerate graph $G$, $\cubi(G) \leq (k+2) \lceil 2e \log n \rceil$. Since $k$ is at most $\Delta$ and can be much lower, this clearly is a stronger result. This bound is tight. We also give an efficient deterministic algorithm that runs in $O(n^2k)$ time to output a $8k(\lceil 2.42 \log n\rceil + 1)$ dimensional cube representation for $G$. An important consequence of the above result is that if the crossing number of a graph $G$ is $t$, then $\boxi(G)$ is $O(t^{1/4}{\lceil\log t\rceil}^{3/4})$ . This bound is tight up to a factor of $O((\log t)^{1/4})$. We also show that, if $G$ has $n$ vertices, then $\cubi(G)$ is $O(\log n + t^{1/4}\log t)$. Using our bound for the cubicity of $k$-degenerate graphs we show that cubicity of almost all graphs in $\mathcal{G}(n,m)$ model is $O(d_{av}\log n)$, where $d_{av}$ denotes the average degree of the graph under consideration. model is O(davlogn).

An inquisitive analysis on the temporal variation of return stroke current essential for producing observed remote electro-magnetic fields

The gross characteristics of spatio-temporal current evolution in the return stroke phase of a cloud-to-ground lightning are rather well defined. However, they by themselves do not ensure the salient features for the resulting remote Electro- Magnetic Fields (EMFs). In spite of significant efforts in the engineering models wherein, the spatio-temporal current distribution all along the channel is specified by the design, all the salient features of remote EMFs could not be achieved. Only the current evolution that ensures the basic characteristics along with its ability to reproduce all the salient features of remote EMFs ranging from 50 m – 200 km from the lightning channel, can be considered as a realistic return stroke channel current. In view of this, the present work intends to investigate on the required fine features of the return stroke current evolution that yields all the desired features. To ensure that the current evolution is not arbitrary but obeys the involved basic physical processes, a recently developed physical model will be employed for the analysis.

USHA: unified software and hardware architecture for video decoding

Video decoders used in emerging applications need to be flexible to handle a large variety of video formats and deliver scalable performance to handle wide variations in workloads. In this paper we propose a unified software and hardware architecture for video decoding to achieve scalable performance with flexibility. The light weight processor tiles and the reconfigurable hardware tiles in our architecture enable software and hardware implementations to co-exist, while a programmable interconnect enables dynamic interconnection of the tiles. Our process network oriented compilation flow achieves realization agnostic application partitioning and enables seamless migration across uniprocessor, multi-processor, semi hardware and full hardware implementations of a video decoder. An application quality of service aware scheduler monitors and controls the operation of the entire system. We prove the concept through a prototype of the architecture on an off-the-shelf FPGA. The FPGA prototype shows a scaling in performance from QCIF to 1080p resolutions in four discrete steps. We also demonstrate that the reconfiguration time is short enough to allow migration from one configuration to the other without any frame loss.

Differential cellular recognition pattern to M. tuberculosis targets defined by IFN-gamma and IL-17 production in blood from TB plus patients from Honduras as compared to health care workers: TB and immune responses in patients from Honduras

Background: A better understanding of the quality of cellular immune responses directed against molecularly defined targets will guide the development of TB diagnostics and identification of molecularly defined, clinically relevant M.tb vaccine candidates. Methods: Recombinant proteins (n = 8) and peptide pools (n = 14) from M. tuberculosis (M.tb) targets were used to compare cellular immune responses defined by IFN-gamma and IL-17 production using a Whole Blood Assay (WBA) in a cohort of 148 individuals, i.e. patients with TB + (n = 38), TB- individuals with other pulmonary diseases (n = 81) and individuals exposed to TB without evidence of clinical TB (health care workers, n = 29). Results: M.tb antigens Rv2958c (glycosyltransferase), Rv2962c (mycolyltransferase), Rv1886c (Ag85B), Rv3804c (Ag85A), and the PPE family member Rv3347c were frequently recognized, defined by IFN-gamma production, in blood from healthy individuals exposed to M.tb (health care workers). A different recognition pattern was found for IL-17 production in blood from M.tb exposed individuals responding to TB10.4 (Rv0288), Ag85B (Rv1886c) and the PPE family members Rv0978c and Rv1917c. Conclusions: The pattern of immune target recognition is different in regard to IFN-gamma and IL-17 production to defined molecular M.tb targets in PBMCs from individuals frequently exposed to M.tb. The data represent the first mapping of cellular immune responses against M.tb targets in TB patients from Honduras.

Membership models and the design of authentication protocols for MANETs

Authentication protocols are very much essential for secure communication in mobile ad hoc networks (MANETs). A number of authentication protocols for MANETs have been proposed in the literature which provide the basic authentication service while trying to optimize their performance and resource consumption parameters. A problem with most of these protocols is that the underlying networking environment on which they are applicable have been left unspecified. As a result, lack of specifications about the networking environments applicable to an authentication protocol for MANETs can mislead about the performance and the applicability of the protocol. In this paper, we first characterize networking environment for a MANET as its 'Membership Model' which is defined as a set of specifications related to the 'Membership Granting Server' (MGS) and the 'Membership Set Pattern' (MSP) of the MANET. We then identify various types of possible membership models for a MANET. In order to illustrate that while designing an authentication protocol for a MANET, it is very much necessary to consider the underlying membership model of the MANET, we study a set of six representative authentication protocols, and analyze their applicability for the membership models as enumerated in this paper. The analysis shows that the same protocol may not perform equally well in all membership models. In addition, there may be membership models which are important from the point of view of users, but for which no authentication protocol is available.