Mining Land Cover Information Using Multilayer Perceptron and Decision Tree from MODIS Data

Land cover (LC) changes play a major role in global as well as at regional scale patterns of the climate and biogeochemistry of the Earth system. LC information presents critical insights in understanding of Earth surface phenomena, particularly useful when obtained synoptically from remote sensing data. However, for developing countries and those with large geographical extent, regular LC mapping is prohibitive with data from commercial sensors (high cost factor) of limited spatial coverage (low temporal resolution and band swath). In this context, free MODIS data with good spectro-temporal resolution meet the purpose. LC mapping from these data has continuously evolved with advances in classification algorithms. This paper presents a comparative study of two robust data mining techniques, the multilayer perceptron (MLP) and decision tree (DT) on different products of MODIS data corresponding to Kolar district, Karnataka, India. The MODIS classified images when compared at three different spatial scales (at district level, taluk level and pixel level) shows that MLP based classification on minimum noise fraction components on MODIS 36 bands provide the most accurate LC mapping with 86% accuracy, while DT on MODIS 36 bands principal components leads to less accurate classification (69%).

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Microwave assisted synthesis and UV-Vis spectroscopic studies of silver nanoparticles synthesized using vanillin as a reducing agent

The present investigation explores the adaptability of a microwave assisted route to obtain silver nanoparticles by the reduction of AgNO3 with vanillin, an environmentally benign material. Anionic surfactants such as AOT and SDS were used separately for encapsulating AgNPs and their role was compared. The UV-Visible absorption spectra present a broad SPR band consisting of two peaks suggesting the formation of silver nanoparticle with bimodal size distribution. The TEM image shows particles with spherical and hexagonal morphologies which confirms the results of UV-Vis studies. The anisotropy in the particle morphology can be attributed to the surface oxidation which in turn produces Ag@Ag2O core-shell nanostructures. Thus an intriguing feature of this system is that the obtained colloid is a mixture of AgNPs with and without Ag2O layers. Studies on the influence of pH on the stability of the synthesized nanoparticles revealed that the presence of excess Ag2O layers has a profound influence on it. Ag2O layers can be removed from AgNPs' surface by changing the solution pH to the acidic regime. The present study attests the enhanced ability of AOT in stabilizing the AgNPs in aqueous media. (C) 2011 Elsevier B.V. All rights reserved.

Automated Multi-Agent Search Using Centroidal Voronoi Configuration

This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Phenology of tree species of tropical moist forest of Uttara Kannada district, Karnataka, India

Phenological observations on tree species in tropical moist forest of Uttara Kannada district (13ℴ55′ to 15ℴ31′ N lat; 74ℴ9′ to 75ℴ10′ E long) during the years 1983–1985 revealed that there exists a strong seasonality for leaf flush, leaf drop and reproduction. Young leaves were produced in the pre-monsoon dry period with a peak in February, followed by the expansion of leaves which was completed in March. Abscission of leaves occurred in the post-monsoon winter period with a peak in December. There were two peaks for flowering (December and March), while fruit ripening had a single peak in May–June, preceding the monsoon rainfall. The duration of maturation of leaves was the shortest, while that of full ripening of fruits was the longest. Mature flowers of evergreen species lasted longer than those of deciduous species; in contrast the phenophase of ripe fruits of deciduous species was longer than that of evergreen species.

Synthesis of epoxy-terminated polymers by radical polymerization using alpha-(t-butylperoxymethyl)styrene as chain transfer agent

Epoxy-terminated polystyrene has been synthesized by radical polymerization using alpha-(t-butylperoxymethyl) styrene (TPMS) as the chain transfer agent. The chain transfer constants were found to be 0.66 and 0.80 at 60 and 70 degrees C, respectively. The presence of epoxy end groups was confirmed by functional group modification of epoxide to aldehyde by treatment with BF3.Et(2)O. Thermal stability of TPMS was followed by differential scanning calorimetry and iodimetry. Thermal decomposition of TPMS in toluene follows first order kinetics with an activation energy of 23 kcal/mol. (C) 1996 John Wiley & Sons, Inc.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.

A natural compound, methyl angolensate, induces mitochondrial pathway of apoptosis in Daudi cells

Natural products discovered from medicinal plants have played an important role in the treatment of cancer. In an effort to identify novel small molecules which can affect the proliferation of lymphoma cells, we tested methyl angolensate (MA), a plant derived tetranortriterpenoid, purified from the crude extract of the root callus of Soymida febrifuga commonly known as Indian red wood tree. We have tested MA for its cytotoxic properties on Burkitt's lymphoma cell lines, using various cellular assays. We observed that MA induces cytotoxicity in Daudi cells in a dose-dependent manner using trypan blue, MTT and LDH assays. We find that the treatment with MA led to activation of DNA double-strand break repair proteins including KU70 and KU80, suggesting the activation of nonhomologous DNA end joining pathway in surviving cells. Further, we find that methyl angolensate could induce apoptosis by cell cycle analysis, annexin V-FITC staining, DNA fragmentation and PARP cleavage. Besides, MA treatment led to reactive oxygen species generation and loss of mitochondrial transmembrane potential. These results suggest the activation of mitochondrial pathway of apoptosis. Hence, we identify MA as a potential chemotherapeutic agent against Daudi cells.

Electrical treeing in polyethylene: effect of nano fillers on tree inception and growth

Treeing in polyethylene based nanocomposite samples as well as unfilled polyethylene samples were studied using 50Hz ac voltage. The tree inception voltage was observed for different types of samples. The tree initiation time as well as the tree growth patterns at a fixed ac voltage have also been studied. The results show that there is an improvement in tree inception voltage with nano filler loading in polyethylene. Different tree growth patterns for both the unfilled polyethylene and the polyethylene nanocomposites have been observed. A slower tree growth was observed in polyethylene nanocomposites. The partial discharge characteristics of unfilled and nano filled polyethylene samples during the electrical tree growth period was also studied. Decrease in PD magnitude as well as in the number of pd pulses with electrical tree growth duration in polyethylene nanocomposites has also been observed. The possible reasons for the improvement in electrical tree growth and PD resistance with the addition of nano fillers are discussed.

Propargyloxycarbonyl (Poc) amino acid chlorides as efficient coupling reagents for the synthesis of 100% diastereopure peptides and resin bound tetrathiomolybdate as an effective deblocking agent for the Poc group

Synthesis of short peptides using propargyloxycarbonyl amino acid chlorides as effective coupling reagents and polymer supported tetrathiomolybdate as an efficient deblocking agent are reported.

Matching sender and receiver: poikilothermy and frequency tuning in a tree cricket

Animals communicate in non-ideal and noisy conditions. The primary method they use to improve communication efficiency is sender-receiver matching: the receiver's sensory mechanism filters the impinging signal based on the expected signal. In the context of acoustic communication in crickets, such a match is made in the frequency domain. The males broadcast a mate attraction signal, the calling song, in a narrow frequency band centred on the carrier frequency (CF), and the females are most sensitive to sound close to this frequency. In tree crickets, however, the CF changes with temperature. The mechanisms used by female tree crickets to accommodate this change in CF were investigated at the behavioural and biomechanical level. At the behavioural level, female tree crickets were broadly tuned and responded equally to CFs produced within the naturally occurring range of temperatures (18 to 27 degrees C). To allow such a broad response, however, the transduction mechanisms that convert sound into mechanical and then neural signals must also have a broad response. The tympana of the female tree crickets exhibited a frequency response that was even broader than suggested by the behaviour. Their tympana vibrate with equal amplitude to frequencies spanning nearly an order of magnitude. Such a flat frequency response is unusual in biological systems and cannot be modelled as a simple mechanical system. This feature of the tree cricket auditory system not only has interesting implications for mate choice and species isolation but may also prove exciting for bio-mimetic applications such as the design of miniature low frequency microphones.

Efficient statistical modeling for the compression of tree structured intermediate code

We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.