13 resultados para Pollution episodes
em Indian Institute of Science - Bangalore - Índia
Resumo:
The conveying zone and the filter bag zone of a Filter Bag Reactor have been analysed as individual reactors. The gas and solid particles flow almost in plug flow through the pneumatic conveying section. In the filter bag the height of the packed column varies with time, a cell model has been used to calculate the concentration of outgoing stream. The total conversion obtained is the sum of conversions in each section of the reactor.
Resumo:
Salt-fog tests as per International Electrotechnical Commission (IEC) recommendations were conducted on stationtype insulators with large leakage lengths. Later, tests were conducted to simulate natural conditions. From these tests, it was understood that the pollution flashover would occur because of nonuniform pollution layers causing nonuniform voltage distribution during a natural drying-up period. The leakage current during test conditions was very small and the evidence was that the leakage current did not play any significant role in causing flashovers. In the light of the experimental results, some modification of the test procedure is suggested.
Resumo:
In this paper an attempt is made to study accurately, the field distribution for various types of porcelain/ceramic insulators used forhigh voltage transmission. The surface charge Simulation method is employed for the field computation. Novel field reduction electrodes are developed to reduce the maximum field around the pin region. In order to experimentally scrutinize the performance of discs with field reduction electrodes, special artificial pollution test facility was built and utilized. The experimental results show better improvement in the pollution flashover performance of string insulators.
Resumo:
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently,we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of spaceand time complexities for the task of frequent episode discovery.
Resumo:
This book introduces the major agricultural activities in India and their impact on soil and groundwater. It lists the basic aspects of agricultural activities and introduces soil properties, classification and processes, and groundwater characteristics, movement, and recharge aspects. It further discusses soil and groundwater pollution from various sources, impacts of irrigation, drainage, fertilizer, and pesticide. Finally, the book dwells upon conservation and management of groundwater and soil.
Resumo:
The air we breathe is being polluted by activities such as vehicles; burning coal, oil, and other fossil fuels; and manufacturing chemicals. Air pollution can even come from smaller, everyday activities such as cooking, space heating, and degreasing and painting operations. These activities add gases and particles to the air we breathe. When these gases and particles accumulate in the air in high enough concentrations, they can harm us and our environment. The module on Air Pollution deals with the various sources of air pollution and the associated environmental and health impacts. It also discusses the appropriate measures to control/prevent the same.
Resumo:
Carbon monoxide, a major pollutant from the cupola, is poisonous and flammable. It can vary from 12 to 25% in cupola emissions. Carbon monoxide content in cupola emissions can be reduced by the post-combustion air input at the appropriate level into the stack. Scientific support to this has been provided by simulation of the combustion process in the cupola. Location and the extent of input of air for post combustion into the stack have been determined.
Resumo:
Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.
Resumo:
Discovering patterns in temporal data is an important task in Data Mining. A successful method for this was proposed by Mannila et al. [1] in 1997. In their framework, mining for temporal patterns in a database of sequences of events is done by discovering the so called frequent episodes. These episodes characterize interesting collections of events occurring relatively close to each other in some partial order. However, in this framework(and in many others for finding patterns in event sequences), the ordering of events in an event sequence is the only allowed temporal information. But there are many applications where the events are not instantaneous; they have time durations. Interesting episodesthat we want to discover may need to contain information regarding event durations etc. In this paper we extend Mannila et al.’s framework to tackle such issues. In our generalized formulation, episodes are defined so that much more temporal information about events can be incorporated into the structure of an episode. This significantly enhances the expressive capability of the rules that can be discovered in the frequent episode framework. We also present algorithms for discovering such generalized frequent episodes.
Resumo:
Frequent episode discovery is one of the methods used for temporal pattern discovery in sequential data. An episode is a partially ordered set of nodes with each node associated with an event type. For more than a decade, algorithms existed for episode discovery only when the associated partial order is total (serial episode) or trivial (parallel episode). Recently, the literature has seen algorithms for discovering episodes with general partial orders. In frequent pattern mining, the threshold beyond which a pattern is inferred to be interesting is typically user-defined and arbitrary. One way of addressing this issue in the pattern mining literature has been based on the framework of statistical hypothesis testing. This paper presents a method of assessing statistical significance of episode patterns with general partial orders. A method is proposed to calculate thresholds, on the non-overlapped frequency, beyond which an episode pattern would be inferred to be statistically significant. The method is first explained for the case of injective episodes with general partial orders. An injective episode is one where event-types are not allowed to repeat. Later it is pointed out how the method can be extended to the class of all episodes. The significance threshold calculations for general partial order episodes proposed here also generalize the existing significance results for serial episodes. Through simulations studies, the usefulness of these statistical thresholds in pruning uninteresting patterns is illustrated. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
The Bangalore Metropolitan Transport Corporation (BMTC) took an initiative to check the overall benefits of introducing electric buses as a suitable replacement for the diesel buses to tackle the burgeoning pollution in the city of Bengaluru, India. For a trial run of three months, an electric bus was procured from a Chinese company `Build Your Dreams' (BYD). Data were collected by BMTC on the operation and maintenance of the bus. This new initiative, if rightly guided, could have a direct impact on the lives of those in the city. An economic analysis of the running as well as maintenance of the electric buses within the city limits was performed. For comparison, the same analysis was performed for the data from the existing diesel bus operating on the same route. On the basis of the study, it can be concluded that the introduction of electric buses as a means of public transport in the city would be beneficial both economically as well as environmentally. The electric bus also makes much less noise, thereby helping reduce noise pollution and makes less vibration when compared to the diesel bus. This results in a more comfortable journey for the passengers.
Resumo:
Most pattern mining methods yield a large number of frequent patterns, and isolating a small relevant subset of patterns is a challenging problem of current interest. In this paper, we address this problem in the context of discovering frequent episodes from symbolic time-series data. Motivated by the Minimum Description Length principle, we formulate the problem of selecting relevant subset of patterns as one of searching for a subset of patterns that achieves best data compression. We present algorithms for discovering small sets of relevant non-redundant episodes that achieve good data compression. The algorithms employ a novel encoding scheme and use serial episodes with inter-event constraints as the patterns. We present extensive simulation studies with both synthetic and real data, comparing our method with the existing schemes such as GoKrimp and SQS. We also demonstrate the effectiveness of these algorithms on event sequences from a composable conveyor system; this system represents a new application area where use of frequent patterns for compressing the event sequence is likely to be important for decision support and control.