17825087
Feature Matrix Models for Information Extraction
To extract useful information which really contribute to the target issue from huge amounts of data or text description is an important task towards a number of research fields (e.g., genomics study and text mining). In this paper, a general feature matrix model (FMM) is proposed aiming to provide partial answer to this task. Specifically, one instantiation of FMM is used for identifying feature genes based on microarray data, and the other for extracting information according to case description.
11279692
TPSS: A Time-Based Positioning Scheme for Sensor Networks with Short Range Beacons
Location discovery is a challenging problem in sensor networks. However, many sensor network applications require the availability of the physical sensor positions. In this paper, we present TPSS, a time-based positioning scheme for sensor networks when a number of short-range beacons are randomly and uniformly deployed. By measuring the Time Difference of Arrivals (TDoAs) of signals from nearby beacons, nodes can use TPSS to effectively estimate their locations based on the range differences through trilateration. TPSS requires no long-range beacons to cover the entire network, an essential difference compared to TPS [2] and iTPS [15]. Features of TPSS include high scalability, low communication and computation overheads, no requirement for time synchronization, etc. Simulation results indicate that TPSS is an effective and efficient self-positioning scheme for sensor networks with short range beacons.
285048
Location-centric storage for safety warning based on roadway sensor networks
We propose a novel vision for roadway safety warning based on sensor networks, aiming at providing user-friendly zero-delay safety warnings to motorists. Our idea leverages the advanced sensing, networking and storage technologies. Roadway sensors detect events and store event records at multiple designated locations along the against traffic direction, such that the passing-by drivers can be alerted to potential dangers or traffic delays through the wireless communication between roadway sensors and the vehicle. We design a location-centric storage (LCS) protocol, which manages the propagation and storage of event records based on the time needed to clear the road. In LCS, the density of the sensors storing an event record decreases logarithmically with respect to the distance to the event location. Thus, the closer to the event position, the more number of warnings a driver may obtain. LCS is further tailored for the case of ''highway'' sensor networks when all sensors are deployed along a straight line mimicking a highway, and the more complex case when two roads intersect at some place. We conduct both theoretic analysis and simulation study to verify the performance of LCS when applied to roadway sensor networks for safety warning. The results indicate that LCS is fair to all sensors. We conclude that roadway safety warning based on sensor networks is a promising idea for realizing ITS's ''Zero Fatality, Zero Delay'' roadway safety philosophy.
33837332
An object-oriented approach on Web information representation and derivation
A framework on Web information representation, extraction and derivation utilising the object-oriented approach is proposed. We define a structure which is similar to a class in object-oriented design and programming, and name it as an extended class (eclass). An eclass contains data attributes, member functions/methods, inference rules and presentations, and therefore, facilities information derivation and Web presentation. As an object-oriented approach, the framework also supports encapsulation, polymorphism, composition and inheritance. It can be implemented as an extension of an existing object-oriented programming language. An eclass can be extremely effective in content-dependent entity description. It describes a value under its context, consequently, the search engine not only searches the value, but also understands the meaning of the value in the context. We argue that information in any form or complexity can always be represented by instances of eclasses.
11582687
Web service enablement of communication services
In this paper, we introduce Web service application session services, WS-session, for Web service based application session management in communication. A two-way Web service framework is described. It supports the use of Web service in the situation of telecommunication where the communication endpoint can be both a client and a peer-to-peer server. We describe the interface design in two-way Web service interaction based on the concept of tightly coupled interface and loosely coupled interface solutions. The proposed approach provides full support of asynchronous outbound operations and event notifications in communication services. It is implemented in a research prototype system that provides both standard based (ECMA-348) services and Avaya service extensions. In addition, we investigated the integration of our proposed approach with BPEL4WS. It allows the user to create new services through a drag-n-drop based service creation environment (ECLIPSE/BPEL4WS). It leads to a paradigm of service creation through Web service composition. More sophisticated telecommunication services are created from composing the basic services.
1291381
Multiobjective Optimization Based on Coevolutionary Algorithm
With the intrinsic properties of multiobjective optimization problems in mind, multiobjective coevolutionary algorithm (MOCEA) is proposed. In MOCEA, a Pareto crossover operator, and 3 coevolutionary operators are designed for maintaining the population diversity and increasing the convergence rate. Moreover, a crowding distance is designed to reduce the size of the nondominated set. Experimental results demonstrate that MOCEA can find better solutions at a low computational cost. At the same time, the solutions found by MOCEA scatter uniformly over the entire Pareto front.
18981738
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solutions assume an open space environment, which are either not applicable to spatial network environment or require non-trivial extensions. In this paper, we consider a new class of query called Dynamic Range Query. A dynamic range query is a moving range query in a network environment, which retrieves the moving objects within a specified network distance of the moving query point. As this query point moves in the network, the footprint (or shape) of the query range changes accordingly to reflect the new relevant query area. Our execution strategy leverages computing power of the moving objects to reduce server load and communication costs. This scheme is particularly desirable for many practical applications such as vehicles in a street environment, where mobile energy is not an issue. We describe the design details and present our simulation study. The performance results indicate that our solution is almost two magnitudes better than a query index method in terms of server load, and requires similar number of messages when compared to a query-blind optimal scheme.
43661392
Web Service for Communication Service Management