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.
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.
1165057
An Extensible Three-tier XML Dialogue System Architecture for Multimodal Interaction and Automated Agent Services
8017889
An architecture of wireless Web and dialogue system convergence for multimodal service interaction over converged networks
This paper presents the software architecture for a new paradigm of wireless Web and dialogue system convergence and its corresponding approach to deliver multimodal multimedia enterprise communication services in the wireless environment. It uses an event-triggered service delivery method that separates service interaction and wireless web-based service delivery. A customized content presentation approach is adopted to transform the content of the service into a format suitable for presentation on the target devices. The system also contains a service delivery monitoring and backup mechanism, which is capable of sending the service content using other communication channels according to the user's preference and the channel conditions. A prototype system was implemented based on the proposed approach, which demonstrates the performance advantage of our method in the enterprise service application.
6044006
Making assumptions in the automated derivation
This paper proposes a mechanism to integrate conditional proof, which is an important proof technique in deductive logic, into logic programming to enhance the power of deduction. Concentrating on two existing resolution strategies--SLD-resolution and PT-resolution, it analyses the necessity and feasibility of the integration, and formulates the procedure.
598798
(k, m)-Catalan numbers and hook length polynomials for plane trees
Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is C"k","m(n)=1mn+1(mn+1)kn, which we call the (k,m)-Catalan number. For proving the hook length formulas, we also introduce a combinatorial family, (k,m)-ary trees, which are counted by the (k,m)-Catalan numbers.
7227804
Personalized web search by mapping user queries to categories
Current web search engines are built to serve all users, independent of the needs of any individual user. Personalization of web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to map a user query to a set of categories, which represent the user's search intention. This set of categories can serve as a context to disambiguate the words in the user's query. A user profile and a general profile are learned from the user's search history and a category hierarchy respectively. These two profiles are combined to map a user query into a set of categories. Several learning and combining algorithms are evaluated and found to be effective. Among the algorithms to learn a user profile, we choose the Rocchio-based method for its simplicity, efficiency and its ability to be adaptive. Experimental results indicate that our technique to personalize web search is both effective and efficient.