Multiscale data sampling and function extension

We introduce a multiscale scheme for sampling scattered data and extending functions defined on the sampled data points, which overcomes some limitations of the Nyström interpolation method. The multiscale extension (MSE) method is based on mutual distances between data points. It uses a coarse-to-fine hierarchy of the multiscale decomposition of a Gaussian kernel. It generates a sequence of subsamples, which we refer to as adaptive grids, and a sequence of approximations to a given empirical function on the data, as well as their extensions to any newly-arrived data point. The subsampling is done by a special decomposition of the associated Gaussian kernel matrix in each scale in the hierarchical procedure.     

Hydrogenation of Pd-capped Mg thin films prepared by DC magnetron sputtering

Structural and optical properties of pure Mg thin film coated with Pd have been investigated. Pd-capped Mg thin films had been prepared by DC magnetron sputtering. This work presents an ex situ study on hydrogenation and dehydrogenation kinetics of Pd/Mg films at different conditions using XRD, AFM and optical spectrophotometer. We have succeeded to load thin films of Mg to MgH₂ at normal temperature and normal pressure of hydrogen gas. In hydrogenation, α-MgH₂ phase of magnesium hydride was observed in hydrogenated films at 200 °C and γ-MgH₂ at 250 °C respectively. The desorption kinetics in vacuum also revealed the phase transformation α-MgH₂ to γ-MgH₂. A reflectance change was observed in hydrogenated films in comparison of as deposited thin film. Hydrogenated (H loaded) samples were observed partially transparent in comparison of as deposited.     

Performance analysis of an integrated scheme in optical burst switching high-speed networks

A new integrated scheme based on resource-reservation and adaptive network flow routing to alleviate contention in optical burst switching networks is proposed. The objective of the proposed scheme is to reduce the overall burst loss in the network and at the same time to avoid the packet out-of-sequence arrival problem. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution schemes based on conventional routing. Through extensive simulations, it is shown that the proposed scheme not only provides significantly better burst loss performance than the basic equal proportion and hop-length based traffic routing algorithms, but also is void of any packet re-orderings.     

A novel optical burst switching architecture for high speed networks

A novel optical burst switching （OBS） high speed network architecture has been proposed. To verify its feasibility and evaluate its performance, just-enough-time （JET） signaling has been considered as a high performance protocol. In the proposed architecture, to avoid burst losses, firstly, a short-prior- confirmation-packet （SPCP） is sent over the control channel that simulates the events that the actual packet will experience. Once SPCP detects a drop at any of the intermediate nodes, the actual packet is not sent but the process repeats. In order to increase network utilization, cost effectiveness and to overcome some limitations of conventional OBS, inherent codes （e.g., orthogonal optical codes （OOC））, which are codified only in intensity, has been used. Through simulations, it shows that a decrease in burst loss probability, cost effectiveness and a gain in processing time are obtained when optical label processing is used as compared with electronic processing.     

Facile formation of molybdenum(VI) monooxo aryloxides MoO(OAr)4-nCln from molybdenum dioxo dichloride

Molybdenum monooxo compoundsMoO(OAr)4-nCln (n=0-2, Ar=2,6-Me2C6H3 or 2,6-i-Pr2C6H3) have been synthesized starting from the dioxo precursor MoO2Cl2. The complexes are characterized spectroscopically and by X-ray diffraction. The formation mechanism likely involves phenol precoordination followed by addition across the Mo=O bond.     

Synthesis and reactivity of enediynyl amino acids and peptides: a novel concept in lowering the activation energy of Bergman cyclisation by H-bonding and electrostatic interactions

Novel enediynyl amino acids and peptides 3 and 5-8 were synthesized and their thermal reactivity towards Bergman cyclization studied and compared with the earlier reported amino acid 4, which demonstrated, for the first time, the effect of H-bonding and electrostatic interactions in lowering the activation energy of Bergman cyclization.     

Flexible software reliability growth model with testing effort dependent learning process

A lot of importance has been attached to the testing phase of the Software Development Life Cycle (SDLC). It is during this phase it is checked whether the software product meets user requirements or not. Any discrepancies that are identified are removed. But testing needs to be monitored to increase its effectiveness. Software Reliability Growth Models (SRGMs) that specify mathematical relationships between the failure phenomenon and time have proved useful. SRGMs that include factors that affect failure process are more realistic and useful. Software fault detection and removal during the testing phase of SDLC depend on how testing resources (test cases, manpower and time) are used and also on previously identified faults. With this motivation a Non-Homogeneous Poisson Process (NHPP) based SRGM is proposed in this paper which is flexible enough to describe various software failure/reliability curves. Both testing efforts and time dependent fault detection rate (FDR) are considered for software reliability modeling. The time lag between fault identification and removal has also been depicted. The applicability of our model is shown by validating it on software failure data sets obtained from different real software development projects. The comparisons with established models in terms of goodness of fit, the Akaike Information Criterion (AIC), Mean of Squared Errors (MSE), etc. have been presented.     

Synthesis and biological evaluation of novel triazole-biscoumarin conjugates as potential antitubercular and anti-oxidant agents

Research on Chemical Intermediates - The synthesis of a new series of triazole-biscoumarin conjugates by using a molecular hybridization approach is described. The newly synthesized compounds...     

Lower bounds for adaptive locally decodable codes

An error‐correcting code is said to be locally decodable if a randomized algorithm can recover any single bit of a message by reading only a small number of symbols of a possibly corrupted encoding of the message. Katz and Trevisan 12 showed that any such code C : {0, 1}ⁿ → Σ^m with a decoding algorithm that makes at most q probes must satisfy m = Ω((n/log |Σ|)^q/(q?1)). They assumed that the decoding algorithm is non‐adaptive, and left open the question of proving similar bounds for adaptive decoders. We show m = Ω((n/log |Σ|)^q/(q?1)) without assuming that the decoder is nonadaptive. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005