Chemical approaches to penicillin allergy—V. Nature of reaction between rabbit antigen (CRP-penicillin conjugate) and rabbit antipenicillin antibody

The availability of an electrophoretically homogeneous rabbit penicillin carrier receptor protein (CRP) and rabbit antipenicillin antibody afforded an idealin vitro system to calculate the thermodynamic parameters of the binding of14C benzyl penicillin CRP conjugate (antigen) to the purified rabbit antipenicillin antibody. The thermodynamic parameters of this antigen-antibody reaction has been studied by radio-active assay method by using millipore filter. Equilibrium constant (K) of this reaction has been found to be 2·853×109M−2 and corresponding free energy (ΔG) at 4°C and 37°C has been calculated to be −12·02 and −13·5 kcal/mole, enthalpy (ΔH) and entropy (ΔS) has been found to be 361 kcal/mole and +30 eu/mole respectively. Competitive binding studies of CRP-analogue conjugates with the divalent rabbit antibody has been carried out in the presence of14C-penicilloyl CRP. It was found that 7-deoxy penicillin-CRP complex and 6-amino penicilloyl CRP conjugate binds to the antibody with energies stronger than that with the14C-penicilloyl CRP. All the other analogue conjugates are much weaker in interfering with the binding of the penicilloyl CRP with the antibody. The conjugate of methicillin,o-nitro benzyl penicillin and ticarcillin with CRP do not materially interfere in the process.

Hydrologic drought prediction under climate change: Uncertainty modeling with Dempster-Shafer and Bayesian approaches

Representation and quantification of uncertainty in climate change impact studies are a difficult task. Several sources of uncertainty arise in studies of hydrologic impacts of climate change, such as those due to choice of general circulation models (GCMs), scenarios and downscaling methods. Recently, much work has focused on uncertainty quantification and modeling in regional climate change impacts. In this paper, an uncertainty modeling framework is evaluated, which uses a generalized uncertainty measure to combine GCM, scenario and downscaling uncertainties. The Dempster-Shafer (D-S) evidence theory is used for representing and combining uncertainty from various sources. A significant advantage of the D-S framework over the traditional probabilistic approach is that it allows for the allocation of a probability mass to sets or intervals, and can hence handle both aleatory or stochastic uncertainty, and epistemic or subjective uncertainty. This paper shows how the D-S theory can be used to represent beliefs in some hypotheses such as hydrologic drought or wet conditions, describe uncertainty and ignorance in the system, and give a quantitative measurement of belief and plausibility in results. The D-S approach has been used in this work for information synthesis using various evidence combination rules having different conflict modeling approaches. A case study is presented for hydrologic drought prediction using downscaled streamflow in the Mahanadi River at Hirakud in Orissa, India. Projections of n most likely monsoon streamflow sequences are obtained from a conditional random field (CRF) downscaling model, using an ensemble of three GCMs for three scenarios, which are converted to monsoon standardized streamflow index (SSFI-4) series. This range is used to specify the basic probability assignment (bpa) for a Dempster-Shafer structure, which represents uncertainty associated with each of the SSFI-4 classifications. These uncertainties are then combined across GCMs and scenarios using various evidence combination rules given by the D-S theory. A Bayesian approach is also presented for this case study, which models the uncertainty in projected frequencies of SSFI-4 classifications by deriving a posterior distribution for the frequency of each classification, using an ensemble of GCMs and scenarios. Results from the D-S and Bayesian approaches are compared, and relative merits of each approach are discussed. Both approaches show an increasing probability of extreme, severe and moderate droughts and decreasing probability of normal and wet conditions in Orissa as a result of climate change. (C) 2010 Elsevier Ltd. All rights reserved.

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

Integrated modelling approaches to analysis of climate change impacts on forests and forest management

This paper reviews integrated economic and ecological models that address impacts and adaptation to climate change in the forest sector. Early economic model studies considered forests as one out of many possible impacts of climate change, while ecological model studies tended to limit the economic impacts to fixed price-assumptions. More recent studies include broader representations of both systems, but there are still few studies which can be regarded fully integrated. Full integration of ecological and economic models is needed to address forest management under climate change appropriately. The conclusion so far is that there are vast uncertainties about how climate change affects forests. This is partly due to the limited knowledge about the global implications of the social and economical adaptation to the effects of climate change on forests.

Chemical Approaches to the Design of Oxide Materials.

Chemical methods of synthesis play a crucial role in designing and discovering new and novel materials and in providing less cumbersome methods for preparing known materials. Chemical methods also enable the synthesis of metastable materials which are otherwise difficult to prepare. In this presentation, the various innovative chemical methods of synthesising oxide materials will be briefly reviewed with emphasis on soft-chemical routes. Electrochemical synthesis, ion-exchange method, alkali-flux method and some of the interaction reactions will be highlighted, besides topochemical aspects of solid state synthesis. Cuprate superconductors as well as intergrowth structures will also be examined.

Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing

In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with `estimated optimal solution' for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.

Frontier Based Multiple Goal Search in Unknown Environments

We present a frontier based algorithm for searching multiple goals in a fully unknown environment, with only information about the regions where the goals are most likely to be located. Our algorithm chooses an ``active goal'' from the ``active goal list'' generated by running a Traveling Salesman Problem (Tsp) routine with the given centroid locations of the goal regions. We use the concept of ``goal switching'' which helps not only in reaching more number of goals in given time, but also prevents unnecessary search around the goals that are not accessible (surrounded by walls). The simulation study shows that our algorithm outperforms Multi-Heuristic LRTA* (MELRTA*) which is a significant representative of multiple goal search approaches in an unknown environment, especially in environments with wall like obstacles.

Some results and approaches for reconstruction conjectures

Tutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed from its vertex deck. This result is used to prove that if we can reconstruct a set of connected graphs from the shuffled edge deck (SED) then the vertex reconstruction conjecture is true. It is proved that a set of connected graphs can be reconstructed from the SED when all the graphs in the set are claw-free or all are P-4-free. Such a problem is also solved for a large subclass of the class of chordal graphs. This subclass contains maximal outerplanar graphs. Finally, two new conjectures, which imply the edge reconstruction conjecture, are presented. Conjecture 1 demands a construction of a stronger k-edge hypomorphism (to be defined later) from the edge hypomorphism. It is well known that the Nash-Williams' theorem applies to a variety of structures. To prove Conjecture 2, we need to incorporate more graph theoretic information in the Nash-Williams' theorem.

Synthetic approaches to homogynolides A and B

A four step, efficient and general methodology for the conversion of a cyclic ketone into the corresponding alpha-spiro-beta-methylene-gamma-butyrolactone, the key structural feature present in tricyclic sesquiterpenes bakkanes, has been developed employing a regiospecific 5-exo dig radical cyclisation reaction as the key step. The methodology has been extended to the total synthesis of bakkanes including homogynolide-B and chiral homogynolide-A.

Artificial intelligence approaches to network management: recent advances and a survey

With increased number of new services and users being added to the communication network, management of such networks becomes crucial to provide assured quality of service. Finding skilled managers is often a problem. To alleviate this problem and also to provide assistance to the available network managers, network management has to be automated. Many attempts have been made in this direction and it is a promising area of interest to researchers in both academia and industry. In this paper, a review of the management complexities in present day networks and artificial intelligence approaches to network management are presented. Published by Elsevier Science B.V.

Rearrangement approaches to sesquiterpenes containing multiple contiguous quaternary carbon atoms. Total synthesis of (+/-)-myltayl-8(12)-ene and (+/-)-6-epijunicedranol

Details of the first total syntheses of the sesquiterpenes myltayl-8(12)-ene and 6-epijunicedran-8-ol are described. The aldehyde 13, obtained by Claisen rearrangement of cyclogeraniol, was transformed into the dienones 12 and 18. Boron trifluoride-diethyl ether mediated cyclization and rearrangement transformed the dienones 12 and 18 into the tricyclic ketones 16 and 17, efficiently creating three and four contiguous quaternary carbon atoms, respectively. Wittig methylenation of 16 furnished (+/-)-myltayl-8(12)-ene (11), whereas reduction of the ketone 17 furnished (+/-)-6-epijunicedranol (23).

Comparative Analysis of Pilot-Assisted Distributed Cophasing Approaches in Wireless Sensor Networks

This paper compares and analyzes the performance of distributed cophasing techniques for uplink transmission over wireless sensor networks. We focus on a time-division duplexing approach, and exploit the channel reciprocity to reduce the channel feedback requirement. We consider periodic broadcast of known pilot symbols by the fusion center (FC), and maximum likelihood estimation of the channel by the sensor nodes for the subsequent uplink cophasing transmission. We assume carrier and phase synchronization across the participating nodes for analytical tractability. We study binary signaling over frequency-flat fading channels, and quantify the system performance such as the expected gains in the received signal-to-noise ratio (SNR) and the average probability of error at the FC, as a function of the number of sensor nodes and the pilot overhead. Our results show that a modest amount of accumulated pilot SNR is sufficient to realize a large fraction of the maximum possible beamforming gain. We also investigate the performance gains obtained by censoring transmission at the sensors based on the estimated channel state, and the benefits obtained by using maximum ratio transmission (MRT) and truncated channel inversion (TCI) at the sensors in addition to cophasing transmission. Simulation results corroborate the theoretical expressions and show the relative performance benefits offered by the various schemes.