407 research outputs found
Exploiting Data Mining Techniques for Broadcasting Data in Mobile Computing Environments
Cataloged from PDF version of article.Mobile computers can be equipped with wireless communication devices that enable users to access data services from any location. In wireless communication, the server-to-client (downlink) communication bandwidth is much higher than the client-to-server (uplink) communication bandwidth. This asymmetry makes the dissemination of data to client machines a desirable approach. However, dissemination of data by broadcasting may induce high access latency in case the number of broadcast data items is large. In this paper, we propose two methods aiming to reduce client access latency of broadcast data. Our methods are based on analyzing the broadcast history (i.e., the chronological sequence of items that have been requested by clients) using data mining techniques. With the first method, the data items in the broadcast disk are organized in such a way that the items requested subsequently are placed close to each other. The second method focuses on improving the cache hit ratio to be able to decrease the access latency. It enables clients to prefetch the data from the broadcast disk based on the rules extracted from previous data request patterns. The proposed methods are implemented on a Web log to estimate their effectiveness. It is shown through performance experiments that the proposed rule-based methods are effective in improving the system performance in terms of the average latency as well as the cache hit ratio of mobile clients
Determination of Mechanical Properties of Concrete by Destructive and Non-Destructive Experimental Methods
This paper examines the mechanical quality differences of concrete by destructive and non destructive methods according to shape, dimension relationship and cure conditions. Within destructive methods, (compression, tension, bending) different shaped-sized concretes and 28-days-old concrete shear wall samples tested along to find modulus of elasticity. Non destructive methods (ultrasonic pulse velocity test, rebound hammer test) applied same samples along to determine compressive strength and longitudinal wave velocity to obtain result of modulus of elasticity. The aim was to achieve data from applied laboratory test results and cross-checking, all values to enhance concretes compressive strength for potential possibilities
Adaptive schemes for location update generation in execution location-dependent continuous queries
Cataloged from PDF version of article.An important feature that is expected to be owned by today's mobile computing systems is the ability of processing location-dependent continuous queries on moving objects. The result of a location-dependent query depends on the current location of the mobile client which has generated the query as well as the locations of the moving objects on which the query has been issued. When a location-dependent query is specified to be continuous, the result of the query can continuously change. In order to provide accurate and timely query results to a client, the location of the client as well as the locations of moving objects in the system has to be closely monitored. Most of the location generation methods proposed in the literature aim to optimize utilization of the limited wireless bandwidth. The issues of correctness and timeliness of query results reported to clients have been largely ignored. In this paper, we propose an adaptive monitoring method (AMM) and a deadline-driven method (DDM) for managing the locations of moving objects. The aim of our methods is to generate location updates with the consideration of maintaining the correctness of query evaluation results without increasing location update workload. Extensive simulation experiments have been conducted to investigate the performance of the proposed methods as compared to a well-known location update generation method, the plain dead-reckoning (pdr). © 2005 Elsevier Inc. All rights reserved
Processing count queries over event streams at multiple time granularities
Cataloged from PDF version of article.Management and analysis of streaming data has become crucial with its applications to web, sensor data, network traffic data, and stock market. Data streams consist of mostly numeric data but what is more interesting are the events derived from the numerical data that need to be monitored. The events obtained from streaming data form event streams. Event streams have similar properties to data streams, i.e., they are seen only once in a fixed order as a continuous stream. Events appearing in the event stream have time stamps associated with them at a certain time granularity, such as second, minute, or hour. One type of frequently asked queries over event streams are count queries, i.e., the frequency of an event occurrence over time. Count queries can be answered over event streams easily, however, users may ask queries over different time granularities as well. For example, a broker may ask how many times a stock increased in the same time frame, where the time frames specified could be an hour, day, or both. Such types of queries are challenging especially in the case of event streams where only a window of an event stream is available at a certain time instead of the whole stream. In this paper, we propose a technique for predicting the frequencies of event occurrences in event streams at multiple time granularities. The proposed approximation method efficiently estimates the count of events with a high accuracy in an event stream at any time granularity by examining the distance distributions of event occurrences. The proposed method has been implemented and tested on different real data sets including daily price changes in two different stock exchange markets. The obtained results show its effectiveness. (C) 2005 Elsevier Inc. All rights reserved
Concurrent rule execution in active databases
Cataloged from PDF version of article.An active DBMS is expected to support concurrent as well as sequential rule execution
in an efficient manner. Nested transaction model is a suitable tool to implement rule execution as it can
handle nested rule firing and concurrent rule execution well. In this paper, we describe a concurrent
rule execution model based on parallel nested transactions. We discuss implementation details of how
the flat transaction model of OpenOODB has been extended by using Solaris threads in order to
SUppOrt COnCUrrent eXeCUtiOU of rUkS.
A framework for use of wireless sensor networks in forest fire detection and monitoring
Cataloged from PDF version of article.Forest fires are one of the main causes of environmental degradation nowadays. Current surveillance systems for forest fires lack in supporting real-time monitoring of every point of a region at all times and early detection of fire threats. Solutions using wireless sensor networks, on the other hand, can gather sensory data values, such as temperature and humidity, from all points of a field continuously, day and night, and, provide fresh and accurate data to the fire-fighting center quickly. However, sensor networks face serious obstacles like limited energy resources and high vulnerability to harsh environmental conditions, that have to be considered carefully. In this paper, we propose a comprehensive framework for the use of wireless sensor networks for forest fire detection and monitoring. Our framework includes proposals for the wireless sensor network architecture, sensor deployment scheme, and clustering and communication protocols. The aim of the framework is to detect a fire threat as early as possible and yet consider the energy consumption of the sensor nodes and the environmental conditions that may affect the required activity level of the network. We implemented a simulator to validate and evaluate our proposed framework. Through extensive simulation experiments, we show that our framework can provide fast reaction to forest fires while also consuming energy efficiently. (C) 2012 Elsevier Ltd. All rights reserved
A data mining approach for location prediction in mobile environments
Cataloged from PDF version of article.Mobility prediction is one of the most essential issues that need to be explored for mobility management
in mobile computing systems. In this paper, we propose a new algorithm for predicting the next inter-cell
movement of a mobile user in a Personal Communication Systems network. In the first phase of our threephase
algorithm, user mobility patterns are mined from the history of mobile user trajectories. In the second
phase, mobility rules are extracted from these patterns, and in the last phase, mobility predictions are
accomplished by using these rules. The performance of the proposed algorithm is evaluated through simulation
as compared to two other prediction methods. The performance results obtained in terms of Precision
and Recall indicate that our method can make more accurate predictions than the other methods.
2004 Elsevier B.V. All rights reserved
Automated construction of fuzzy event sets and its application to active databases
Fuzzy sets and fuzzy logic research aims to bridge the gap between the crisp world of math and the real world. Fuzzy set theory was applied to many different areas, from control to databases. Sometimes the number of events in an event-driven system may become very high and unmanageable. Therefore, it is very useful to organize the events into fuzzy event sets also introducing the benefits of the fuzzy set theory. All the events that have occurred in a system can be stored in event histories which contain precious hidden information. In this paper, we propose a method for automated construction of fuzzy event sets out of event histories via data mining techniques. The useful information hidden in the event history is extracted into a matrix called sequential proximity matrix. This matrix shows the proximities of events and it is used for fuzzy rule execution via similarity based event detection and construction of fuzzy event sets. Our application platform is active databases. We describe how fuzzy event sets can be exploited for similarity based event detection and fuzzy rule execution in active database systems
Distributed k-core view materialization and maintenance for large dynamic graphs
Cataloged from PDF version of article.In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’
regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get richer and the
topologies change dynamically, we are challenged not only to materialize k-core subgraphs for one time but also to maintain
them in order to keep up with continuous updates. Adding to the challenge is that real world data sets are outgrowing the
capacity of a single server and its main memory. These challenges inspired us to propose a new set of distributed algorithms
for k-core view construction and maintenance on a horizontally scaling storage and computing platform. Our algorithms execute
against the partitioned graph data in parallel and take advantage of k-core properties to aggressively prune unnecessary
computation. Experimental evaluation results demonstrated orders of magnitude speedup and advantages of maintaining k-core
incrementally and in batch windows over complete reconstruction. Our algorithms thus enable practitioners to create and
maintain many k-core views on different topics in rich social network content simultaneously
Dealing with fuzziness in active mobile database systems
Current needs of industry required the development of advanced database models like active mobile database systems. An active mobile database system can be designed by incorporation of triggering rules into a mobile computing environment in which the users are able to access a collection of database services using mobile and non-mobile computers at any location. Fuzzy concepts are adapted to the field of databases in order to deal with ambiguous, uncertain data. Fuzziness comes into picture in active mobile databases especially with spatial queries on moving objects. Incorporating fuzziness into rules would also improve the effectiveness of active mobile databases as it provides much flexibility in defining rules for the supported application. In this paper we present some methods to adapt the concepts developed for fuzzy systems to active mobile databases
- …