Coordination driven self-assembly of metallamacrocycles using ambidentate linkers and self-selection of single linkage isomer

Nicotinate-N-oxide and isonicotinate-N-oxide have been employed to synthesize four heterometallic metallamacrocycles (dppf)(2)Pd-2(nicotinate-N-oxide)(2)](OTf)(2) (1), (dppf)(2)Pt-2(nicotinate-N-oxide)(2)](OTf)(2) (2), (dppf) 2Pd2(isonicotinate-N-oxide)(2)](OTf)(2) (3) and (dppf)(2)Pt-2(isonicotinate-N-oxide)(2)](OTf)(2) (4). The complexes represent the first examples of metallamacrocycles driven by solely Pd(II)/Pt(II)-O coordination using carboxylate-N-oxide donor. All the complexes 1-4 are characterized by IR, UV-Vis, multinuclear NMR spectroscopic and ESI-MS studies. The molecular structures of the complexes 1 and 3 are unambiguously determined by single crystal X-ray diffraction analysis. Despite the possibility of formation of several linkage isomers due to ambidentate nature of the donors, exclusive formation of 2 + 2] self-assembled single isomeric metallamacrocycle in each case is interesting observation. (C) 2011 Elsevier B.V. All rights reserved.

Reverse flotation of silica from Kudremukh iron ore .1. Selection of cationic reagents

Four types of cationic collectors were tested and evaluated for their performance in the reverse flotation of silica from the spiral preconcentrate of Kudremukh iron ore. A stagewise flotation was conducted by adding the reagent in three stages. Starch was used to depress hematite. Silica flotation was found to be very sensitive to the amount of cationic reagent added. The performance of the reagents was evaluated based on the percentage of silica and iron in the concentrate and percent recovery of iron obtained in the concentrate. Tests of significance, namely, t-test and F-test were performed to select the best two reagents for further investigations.

Susceptibility of sperm chromatin to acid denaturation in situ: A study in endogenous FSH-deprived adult male bonnet monkeys (Macaca radiata)

Acid denaturation of calf thymus DNA in vitro followed by acridine orange (AO) binding induced a 112% increase in the emission of red, a 58% decrease in green, and a consequential decrease in the ratio of green:red fluorescences from 1.7 to 0.9. This metachromatic property of AO on binding to DNA following acid denaturation was utilized to study the susceptibility of normal and ovine follicle-stimulating hormone (oFSH) actively immunized bonnet monkey spermatozoa voided throughout the year. For analyses, the scattergram generated by the emission of red and green fluorescences by 10,000 AO-bound sperm from each semen sample was divided into 4 quadrant zones representing percentage cells fluorescing high green-low red (Q1), high green-high red (Q2), low green-low red (Q3) and low green-high red. (Q4). Normal monkey sperm obtained during the months of July-December exhibited 76, 13, and 11% cells in Q2, Q3, and Q4 quadrants, respectively. However, during January-June, when the females of the species are markedly subfertile, noncycling, and amenorrhoeic, the spermatozoa ejaculated by the male monkeys exhibited 38, 39, and 23% sperm in Q2, Q3, and Q4, respectively, the differences being highly significant (p < .01-.001). FSH deprivation induced significant shifts in fluorescence emissions, from respective controls, with 39, 33, and 28% cells in Q2, Q3, and Q4, respectively, during July-December, and 15, 48, and 37% sperm in Q2, Q3, and Q4 quadrants, respectively, during January-June. It is postulated that the altered kinetics of germ cell transformations and the deficient spermiogenesis observed earlier following FSH deprivation in these monkeys may have induced the enhanced susceptibility to acid denaturation in sperm.

On Training and Training Voids for Receive Antenna Subset Selection in Time-Varying Channels

Antenna selection (AS) provides most of the benefits of multiple-antenna systems at drastically reduced hardware costs. In receive AS, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. The "best" subset to be used for data reception is determined by means of channel estimates acquired using training sequences. Due to the nature of AS, the channel estimates at different antennas are obtained from different transmissions of the pilot sequence, and are, thus, outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N, we highlight a new issue of "training voids", in which the last pilot transmission is not fully exploited by the receiver. We present a "void-filling" method for fully exploiting these voids, which essentially provides more accurate training for some antennas, and derive the optimal subset selection rule for any void-filling method. We also derive new closed-form equations for the performance of receive AS with optimal subset selection.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Training and Voids in Receive Antenna Subset Selection in Time-Varying Channels

Receive antenna selection (AS) provides many benefits of multiple-antenna systems at drastically reduced hardware costs. In it, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. Due to the nature of AS, the channel estimates at different antennas, which are required to determine the best subset for data reception, are obtained from different transmissions of the pilot sequence. Consequently, they are outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is necessary and optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N , we highlight a new issue of ``training voids'', in which the last pilot transmission is not fully exploited by the receiver. We then present new ``void-filling'' methods that exploit these voids and greatly improve the performance of AS. The optimal subset selection rules with void-filling, in which different antennas turn out to have different numbers of estimates, are also explicitly characterized. Closed-form equations for the symbol error probability with and without void-filling are also developed.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Performance analysis of TCM with generalized selection combining on Rayleigh fading channels

We derive the computational cutoff rate, R-o, for coherent trellis-coded modulation (TCM) schemes on independent indentically distributed (i.i.d.) Rayleigh fading channels with (K, L) generalized selection combining (GSC) diversity, which combines the K paths with the largest instantaneous signal-to-noise ratios (SNRs) among the L available diversity paths. The cutoff rate is shown to be a simple function of the moment generating function (MGF) of the SNR at the output of the (K, L) GSC receiver. We also derive the union bound on the bit error probability of TCM schemes with (K, L) GSC in the form of a simple, finite integral. The effectiveness of this bound is verified through simulations.

Research bed for unit selection based text to speech synthesis

The paper describes a modular, unit selection based TTS framework, which can be used as a research bed for developing TTS in any new language, as well as studying the effect of changing any parameter during synthesis. Using this framework, TTS has been developed for Tamil. Synthesis database consists of 1027 phonetically rich prerecorded sentences. This framework has already been tested for Kannada. Our TTS synthesizes intelligible and acceptably natural speech, as supported by high mean opinion scores. The framework is further optimized to suit embedded applications like mobiles and PDAs. We compressed the synthesis speech database with standard speech compression algorithms used in commercial GSM phones and evaluated the quality of the resultant synthesized sentences. Even with a highly compressed database, the synthesized output is perceptually close to that with uncompressed database. Through experiments, we explored the ambiguities in human perception when listening to Tamil phones and syllables uttered in isolation,thus proposing to exploit the misperception to substitute for missing phone contexts in the database. Listening experiments have been conducted on sentences synthesized by deliberately replacing phones with their confused ones.

Best Node Selection Through Distributed Fast Variable Power Multiple Access

In many wireless applications, it is highly desirable to have a fast mechanism to resolve or select the packet from the user with the highest priority. Furthermore, individual priorities are often known only locally at the users. In this paper we introduce an extremely fast, local-information-based multiple access algorithm that selects the best node in 1.8 to 2.1 slots,which is much lower than the 2.43 slot average achieved by the best algorithm known to date. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities into the receive power.It is inherently distributed and scales well with the number of users. We show that mapping onto a discrete set of receive power levels is optimal, and provide a complete characterization for it. The power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture,idle channel, or collision.