Twisted aromatics, 9-anthryl and 1-pyrenyl terpyridines organize into novel multi-directional 'ladder-like' motifs in the solid state

9-Anthryl and 1-pyrenyl terpyridines (1 and 2, respectively), key precursors for the design of novel fluorescent sensors have been synthesized and characterized by H-1 NMR, mass spectroscopy and X-ray crystallography. Twisted molecular conformations for each 1 and 2 were observed in their single crystal structures. Energy minimization calculations for the 1 and 2 using the semi-empirical AM1 method show that the 'twisted' conformation is intrinsic to these systems. We observe interconnected networks of edge-to-face CH...pi interactions, which appear to be cooperative in nature, in each of the crystal structures. The two twisted molecules, although having differently shaped polyaromatic hydrocarbon substituents, show similar patterns of edge-to-face CH...pi interactions.The presently described systems comprise of two aromatic surfaces that are almost orthogonal to each other. This twisted or orthogonal nature of the molecules leads to the formation of interesting multi-directional ladder like supramolecular organizations. A combination of edge-to-face and face-to-face packing modes helps to stabilize these motifs. The ladder like architecture in 1 is helical in nature. (C) 2002 Published by Elsevier Science B.V.

Trends in consanguineous marriage in Karnataka, South India, 1980–89

Analysis of data on 106,848 marriages in the cities of Bangalore and Mysore, South India, between 1980 and 1989 showed that levels of consanguineous marriage varied between cities through time and by religion. The average coefficient of inbreeding was higher in Bangalore (F = 0·0339) than in Mysore (F = 0·0203), principally reflecting large-scale, post-Independence rural migration into Bangalore. Although there was some evidence of a decline in consanguineous marriages in Mysore, there was no convincing support in either city for earlier projections of a rapid reduction in the popularity of unions between close biological relatives.

Interfaces In Quasicrystalline Systems

Structural relations between quasicrystalline and related crystalline rational approximant phases have been of interest for some time now. Such relations are now being used to understand interface structures. Interfaces between structural motif - wise related, but dissimilarly periodic phases are expected to show a degree of lattice match in certain directions. Our earlier studies in the Al-Cu-Fe system using the HREM technique has shown this to be true. The structural difference leads to well defined structural ledges in the interface between the icosahedral Al-Cu-Fe phase and the monoclinic Al13Fe4 type phase. In the present paper we report our results on the HREM study of interfaces in Al-Cu-Fe and Al-Pd-Mn systems. The emphasis will be on heterophase interfaces between quasiperiodic and periodic phases, where the two are structurally related. An attempt will be made to correlate the results with calculated lattice projections of the two structures on the grain boundary plane.

Interfaces In Quasicrystalline Systems

Structural relations between quasicrystalline and related crystalline rational approximant phases have been of interest for some time now. Such relations are now being used to understand interface structures. Interfaces between structural motif - wise related, but dissimilarly periodic phases are expected to show a degree of lattice match in certain directions. Our earlier studies in the Al-Cu-Fe system using the HREM technique has shown this to be true. The structural difference leads to well defined structural ledges in the interface between the icosahedral Al-Cu-Fe phase and the monoclinic Al13Fe4 type phase. In the present paper we report our results on the HREM study of interfaces in Al-Cu-Fe and Al-Pd-Mn systems. The emphasis will be on heterophase interfaces between quasiperiodic and periodic phases, where the two are structurally related. An attempt will be made to correlate the results with calculated lattice projections of the two structures on the grain boundary plane.

Climate change and Indian forests

An assessment of the impact of projected climate change on forest ecosystems in India based on climate projections of the Regional Climate Model of the Hadley Centre (HadRM3) and the global dynamic vegetation model IBIS for A1B scenario is conducted for short-term (2021-2050) and long-term (2071-2100) periods. Based on the dynamic global vegetation modelling, vulnerable forested regions of India have been identified to assist in planning adaptation interventions. The assessment of climate impacts showed that at the national level, about 45% of the forested grids is projected to undergo change. Vulnerability assessment showed that such vulnerable forested grids are spread across India. However, their concentration is higher in the upper Himalayan stretches, parts of Central India, northern Western Ghats and the Eastern Ghats. In contrast, the northeastern forests, southern Western Ghats and the forested regions of eastern India are estimated to be the least vulnerable. Low tree density, low biodiversity status as well as higher levels of fragmentation, in addition to climate change, contribute to the vulnerability of these forests. The mountainous forests (sub-alpine and alpine forest, the Himalayan dry temperate forest and the Himalayan moist temperate forest) are susceptible to the adverse effects of climate change. This is because climate change is predicted to be larger for regions that have greater elevations.

Soft classification based Sub-pixel allocation model

Land cover (LC) refers to what is actually present on the ground and provide insights into the underlying solution for improving the conditions of many issues, from water pollution to sustainable economic development. One of the greatest challenges of modeling LC changes using remotely sensed (RS) data is of scale-resolution mismatch: that the spatial resolution of detail is less than what is required, and that this sub-pixel level heterogeneity is important but not readily knowable. However, many pixels consist of a mixture of multiple classes. The solution to mixed pixel problem typically centers on soft classification techniques that are used to estimate the proportion of a certain class within each pixel. However, the spatial distribution of these class components within the pixel remains unknown. This study investigates Orthogonal Subspace Projection - an unmixing technique and uses pixel-swapping algorithm for predicting the spatial distribution of LC at sub-pixel resolution. Both the algorithms are applied on many simulated and actual satellite images for validation. The accuracy on the simulated images is ~100%, while IRS LISS-III and MODIS data show accuracy of 76.6% and 73.02% respectively. This demonstrates the relevance of these techniques for applications such as urban-nonurban, forest-nonforest classification studies etc.

Displacement Amplifying Compliant Mechanisms for Two-axis High-resolution Monolithic Inertial Sensors

Novel designs for two-axis, high-resolution, monolithic inertial sensors are presented in this paper. Monolithic, i.e., joint-less single-piece compliant designs are already common in micromachined inertial sensors such as accelerometers and gyroscopes. Here, compliant mechanisms are used not only to achieve de-coupling between motions along two orthogonal axes but also to amplify the displacements of the proof-mass. Sensitivity and resolution capabilities are enhanced because the amplified motion is used for sensing the measurand. A particular symmetric arrangement of displacement-amplifying compliant mechanisms (DaCMs) leads to de-coupled and amplified motion. An existing DaCM and a new topology-optimized DaCM are presented as a building block in the new arrangement. A spring-mass-lever model is presented as a lumped abstraction of the new arrangement. This model is useful for arriving at the optimal parameters of the DaCM and for performing system-level simulation. The new designs improved the performance by a factor of two or more.

A Distributed Approach to Interference Cancellation

In this paper, we propose and analyze a novel idea of performing interference cancellation (IC) in a distributed/cooperative manner, with a motivation to provide multiuser detection (MUD) benefit to nodes that have only a single user detection capability. In the proposed distributed interference cancellation (DIC) scheme, during phase-1 of transmission, an MUD capable cooperating relay node estimates all the sender nodes' bits through multistage interference cancellation. These estimated bits are then sent by the relay node on orthogonal tones in phase-2 of transmission. The destination nodes receive these bit estimates and use them for interference estimation/cancellation, thus achieving IC benefit in a distributed manner. For this DIC scheme, we analytically derive an exact expression for the bit error rate (BER) in a basic five-node network (two source-destination node pairs and a cooperating relay node) on AWGN channels. Analytical BER results are shown to match with simulation results. For more general system scenarios, including more than two source-destination pairs and fading channels without and with space-time coding, we present simulation results to establish the potential for improved performance in the proposed distributed approach to interference cancellation. We also present a linear version of the proposed DIC.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

A Randomized Algorithm for Large Scale Support Vector Learning

We propose a randomized algorithm for large scale SVM learning which solves the problem by iterating over random subsets of the data. Crucial to the algorithm for scalability is the size of the subsets chosen. In the context of text classification we show that, by using ideas from random projections, a sample size of O(log n) can be used to obtain a solution which is close to the optimal with a high probability. Experiments done on synthetic and real life data sets demonstrate that the algorithm scales up SVM learners, without loss in accuracy. 1

A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features

In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network.

Estimation of missing data using windowed linear prediction in laterally truncated projection & in cone beam CT

In this paper, we address the reconstruction problem from laterally truncated helical cone-beam projections. The reconstruction problem from lateral truncation, though similar to that of interior radon problem, is slightly different from it as well as the local (lambda) tomography and pseudo-local tomography in the sense that we aim to reconstruct the entire object being scanned from a region-of-interest (ROI) scan data. The method proposed in this paper is a projection data completion approach followed by the use of any standard accurate FBP type reconstruction algorithm. In particular, we explore a windowed linear prediction (WLP) approach for data completion and compare the quality of reconstruction with the linear prediction (LP) technique proposed earlier.

A near-singular, flexure jointed, moment sensitive Stewart platform based fore-torque sensor

A force-torque sensor capable of accurate measurement of the three components of externally applied forces and moments is required for force control in robotic applications involving assembly operations. The goal in this paper is to design a Stewart platform based force torque sensor at a near-singular configuration sensitive to externally applied moments. In such a configuration, we show an enhanced mechanical amplification of leg forces and thereby higher sensitivity for the applied external moments. In other directions, the sensitivity will be that of a normal load sensor determined by the sensitivity of the sensing element and the associated electronic amplification, and all the six components of the force and torque can be sensed. In a sensor application, the friction, backlash and other non-linearities at the passive spherical joints of the Stewart platform will affect the measurements in unpredictable ways. In this sensor, we use flexural hinges at the leg interfaces of the base and platform of the sensor. The design dimensions of the flexure joints in the sensor have been arrived at using FEA. The sensor has been fabricated, assembled and instrumented. It has been calibrated for low level loads and is found to show linearity and marked sensitivity to moments about the three orthogonal X, Y and Z axes. This sensor is compatible for usage as a wrist sensor for a robot under development at ISRO Satellite Centre.

Stochastic Algorithms for Discrete Parameter Simulation Optimization

We present two efficient discrete parameter simulation optimization (DPSO) algorithms for the long-run average cost objective. One of these algorithms uses the smoothed functional approximation (SFA) procedure, while the other is based on simultaneous perturbation stochastic approximation (SPSA). The use of SFA for DPSO had not been proposed previously in the literature. Further, both algorithms adopt an interesting technique of random projections that we present here for the first time. We give a proof of convergence of our algorithms. Next, we present detailed numerical experiments on a problem of admission control with dependent service times. We consider two different settings involving parameter sets that have moderate and large sizes, respectively. On the first setting, we also show performance comparisons with the well-studied optimal computing budget allocation (OCBA) algorithm and also the equal allocation algorithm. Note to Practitioners-Even though SPSA and SFA have been devised in the literature for continuous optimization problems, our results indicate that they can be powerful techniques even when they are adapted to discrete optimization settings. OCBA is widely recognized as one of the most powerful methods for discrete optimization when the parameter sets are of small or moderate size. On a setting involving a parameter set of size 100, we observe that when the computing budget is small, both SPSA and OCBA show similar performance and are better in comparison to SFA, however, as the computing budget is increased, SPSA and SFA show better performance than OCBA. Both our algorithms also show good performance when the parameter set has a size of 10(8). SFA is seen to show the best overall performance. Unlike most other DPSO algorithms in the literature, an advantage with our algorithms is that they are easily implementable regardless of the size of the parameter sets and show good performance in both scenarios.