Impact of Grazing, Fire and Extraction on the Bamboo (Dendrocalamus-Strictus and Bambusa-Arundinacea) Populations of Karnataka

Dendrocalamus strictus and Bambusa arundinacea are monocarpic, gregariously flowering species of bamboo, common in the deciduous forests of the State of Karnataka in India. Their populations have significantly declined, especially since the last flowering. This decline parelleis increasing incidence of grazing, fire and extraction in recent decades. Results of an experiment in which the intensities of grazing and fire were varied, indicate that while grazing significantly depresses the survival of seedlings and the recruitment of new eulms of bamboo clumps, fire appeared to enhance seedling survival, presumably by reducing competition of lass fire-resistant species. New shoots of bamboo are destroyed by insects and a variety of herbivorous mammals. In areas of intense herbivore pressure, a bamboo clump initiates the production of a much larger number of new culrm, but results in many fewer and shorter intact culms. Extraction renders the new shoots more susceptible to herbivore pressure by removal of the protective covering of branches at the base of a bamboo clump. Hence, regular and extensive extraction by the paper mills in conjuction with intense grazing pressure strongly depresses the addition of new culms to bamboo clumps. Regulation of grazing in the forest by domestic livestock along with maintenance of the cover at the base of the clumps by extracting the culms at a higher level should reduce the rate of decline of the bamboo stocks.

Mechanistic studies on the action of ammonium phosphate on polymer fire retardancy

The mechanism of fire retardant action of mono- and diammonium phosphates on polystyrene has been investigated. Ignition delay and mass burning rate studies reveal that the phosphates bring down both parameters considerably though to different extents. This has been adequately explained on the basis of the existing combustion models and physicochemical behavior of the material. Similar to their action on cellulosic materials, phosphates bring about fire retardancy in polystyrene via char formation. This is suggested to occur through a series of processes consisting of initial peroxide formation, decomposition to alcohols and aldehydes, formation of alkyl-phosphate esters, dehydration and subsequent char formation. Infrared and mass spectral studies support this mechanism.

A study on the variations of optical and physical properties of aerosols over a tropical semi-arid station during grassland fire

The present paper records the results of a case study on the impact of an extensive grassland fire on the physical and optical properties of aerosols at a semi-arid station in southern India for the first time from ground based measurements using a MICROTOPS-II sunphotometer, an aethalometer and a quartz crystal microbalance impactor (QCM). Observations revealed a substantial increase in aerosol optical depth (AOD) at all wavelengths during burning days compared to normal days. High AOD values observed at shorter wavelengths suggest the dominance of accumulation mode particle loading over the study area. Daily mean aerosol size spectra shows, most of the time, power-law distribution. To characterize AOD, the Angstrom parameters (i.e., alpha and beta) were used. Wavelength exponent (1.38) and turbidity coefficient (0.21) are high during burning days compared to normal days, thereby suggesting an increase in accumulation mode particle loading. Aerosol size distribution suggested dominance of accumulation mode particle loading during burning days compared to normal days. A significant positive correlation was observed between AOD at 500 mn and water vapour and negative correlation between AOD at 500 nm and wind speed for burning and non-burning days. Diurnal variations of black carbon (BC) aerosol mass concentrations increased by a factor of similar to 2 in the morning and afternoon hours during burning period compared to normal days.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Locant: A nature inspired location service for ad hoc networks

An efficient location service is a prerequisite to any robust, effective and precise location information aided Mobile Ad Hoc Network (MANET) routing protocol. Locant, presented in this paper is a nature inspired location service which derives inspiration from the insect colony framework, and it is designed to work with a host of location information aided MANET routing protocols. Using an extensive set of simulation experiments, we have compared the performance of Locant with RLS, SLS and DLS, and found that it has comparable or better performance compared to the above three location services on most metrics and has the least overhead in terms of number of bytes transmitted per location query answered.

Synthesis, characterization, and fire retardancy of ferrocene containing polyphosphate esters

Polyphosphate esters containing ferrocene structures were synthesized from 1,1′-bis (p-hydroxyphenylamido) ferrocene and 1,1′-bis (p-hydroxyphenoxycarbonyl) ferrocene with aryl phosphorodichloridates by interfacial polycondensation using a phase transfer catalyst. The polymers were characterized by infrared, 1H-, 13C-, and 31-NMR spectroscopy. The molecular weights were determined by end group analysis using 31P-NMR spectral data. The thermal stability and fire retardancy were respectively determined by thermogravimetry and limiting oxygen index (LOI) measurements. The polyamide-phosphate esters showed better thermal stability and higher LOI values than the polyester-phosphate esters.

A Case Study in Matching Service Descriptions to Implementations in an Existing System

A number of companies are trying to migrate large monolithic software systems to Service Oriented Architectures. A common approach to do this is to first identify and describe desired services (i.e., create a model), and then to locate portions of code within the existing system that implement the described services. In this paper we describe a detailed case study we undertook to match a model to an open-source business application. We describe the systematic methodology we used, the results of the exercise, as well as several observations that throw light on the nature of this problem. We also suggest and validate heuristics that are likely to be useful in partially automating the process of matching service descriptions to implementations.

On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers

Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.

Context based service discovery for ubiquitous applications

Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Multipath routing to provide quality of service in mobile ad hoc networks

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths.

Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition

Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.