An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

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.

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.

Spherical aberration and its correction using Lie algebraic methods

We discuss three methods to correct spherical aberration for a point to point imaging system. First, results obtained using Fermat's principle and the ray tracing method are described briefly. Next, we obtain solutions using Lie algebraic techniques. Even though one cannot always obtain analytical results using this method, it is often more powerful than the first method. The result obtained with this approach is compared and found to agree with the exact result of the first method.

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.

Hybrid approaches for clustering

Applications in various domains often lead to very large and frequently high-dimensional data. Successful algorithms must avoid the curse of dimensionality but at the same time should be computationally efficient. Finding useful patterns in large datasets has attracted considerable interest recently. The primary goal of the paper is to implement an efficient Hybrid Tree based clustering method based on CF-Tree and KD-Tree, and combine the clustering methods with KNN-Classification. The implementation of the algorithm involves many issues like good accuracy, less space and less time. We will evaluate the time and space efficiency, data input order sensitivity, and clustering quality through several experiments.