1494369
Incorporating Gesture and Gaze into Multimodal Models of Human-to-Human Communication
Structural information in language is important for obtaining a better understanding of a human communication (e.g., sentence segmentation, speaker turns, and topic segmentation). Human communication involves a variety of multimodal behaviors that signal both propositional content and structure, e.g., gesture, gaze, and body posture. These non-verbal signals have tight temporal and semantic links to spoken content. In my thesis, I am working on incorporating non-verbal cues into a multimodal model to better predict the structural events to further improve the understanding of human communication. Some research results are summarized in this document and my future research plan is described.
12758296
A Concise Representation of Range Queries
With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PDAs. Range queries, as one of the most commonly used tools, are often posed by the users to retrieve needful information from a spatial database. However, due to the limits of communication bandwidth and hardware power of handheld devices, displaying all the results of a range query on a handheld device is neither communication efficient nor informative to the users. This is simply because that there are often too many results returned from a range query. In view of this problem, we present a novel idea that a concise representation of a specified size for the range query results, while incurring minimal information loss, shall be computed and returned to the user. Such a concise range query not only reduces communication costs, but also offers better usability to the users, providing an opportunity for interactive exploration. The usefulness of the concise range queries is confirmed by comparing it with other possible alternatives, such as sampling and clustering. Then we propose algorithms to find a good concise representation.
8704395
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph search is a key problem, which is defined as given a query Q, retrieving all graphs containing Q as a sub-graph in the graph database. Most existing sub-graph search methods try to filter out false positives (graphs that are not possible in the results) as many as possible by indexing some frequent sub-structures in graph database, such as [20, 22, 4, 23]. However, due to ignoring the relationships between sub-structures, these methods still admit a high percentage of false positives. In this paper, we propose a novel concept, Summarization Graph, which is a complete graph and captures most topology information of the original graph, such as sub-structures and their relationships. Based on Summarization Graphs, we convert the filtering problem into retrieving objects with set-valued attributes. Moreover, we build an efficient signature file-based index to improve the filtering process. We prove theoretically that the pruning power of our method is larger than existing structure-based approaches. Finally, we show by extensive experimental study on real and synthetic data sets that the size of candidate set generated by Summarization Graph-based approach is only about 50% of that left by existing graph indexing methods, and the total response time of our method is reduced 2-10 times.
7517195
Spotting Significant Changing Subgraphs in Evolving Graphs
Graphs are popularly used to model structural relationships between objects. In many application domains such as social networks, sensor networks and telecommunication, graphs evolve over time. In this paper, we study a new problem of discovering the subgraphs that exhibit significant changes in evolving graphs. This problem is challenging since it is hard to define changing regions that are closely related to the actual changes (i.e., additions/deletions of edges/nodes) in graphs. We formalize the problem, and design an efficient algorithm that is able to identify the changing subgraphs incrementally. Our experimental results on real datasets show that our solution is very efficient and the resultant subgraphs are of high quality.
8186389
Optimal proactive caching in peer-to-peer network: analysis and application
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-to-Peer (P2P) technology is used as the underlying network to build new Internet-scale applications. However, one of the well known issues in such an application (for example WWW) is that the distribution of data popularities is heavily tailed with a Zipf-like distribution. With consideration of the skewed popularity we adopt a proactive caching approach to handle the challenge, and focus on two key problems: where (i.e. the placement strategy: where to place the replicas) and how (i.e. the degree problem: how many replicas are assigned to one specific content)? For the where problem, we propose a novel approach which can be generally applied to structured P2P networks. Next, we solve two optimization objectives related to the how problem: MAX_PERF and MIN_COST. Our solution is called <B>PoPCache</B>, and we discover two interesting properties: (1) the number of replicas assigned to each content is proportional to its popularity; (2) the derived optimal solutions are related to the entropy of popularity. To our knowledge, none of the previous works has mentioned such results. Finally, we apply the results of PoPCache to propose a P2P base web caching, called as Web-PoPCache. By means of web cache trace driven simulation, our extensive evaluation results demonstrate the advantages of PoPCache and Web-PoPCache.
119545784
The EDAM project: Mining atmospheric aerosol datasets: Research Articles
There is a great need to better understand the sources, dynamics, and compositions of atmospheric aerosols. The traditional approach for particle measurement, collecting bulk samples of particulates on filters, is not adequate for studying particle dynamics and real-time correlations. This has led to the development of a new generation of real-time instruments that provide continuous or semicontinuous streams of data about certain aerosol properties. However, these instruments have added a significant level of complexity to atmospheric aerosol data and dramatically increased the amounts of data to be collected, managed, and analyzed. Our ability to integrate the data from all of these new and complex instruments now lags far behind our data-collection capabilities, and severely limits our ability to understand the data and act upon it in a timely manner. In this article, we present an overview of EDAM (Exploratory Data Analysis and Management), a joint project between researchers in Atmospheric Chemistry and Computer Science. Important objectives include environmental monitoring and data quality assurance, and real-time data mining offers great potential. While atmospheric aerosol analysis is an important and challenging domain, our objective is to develop techniques that have broader applicability. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 759–787, 2005.
33211849
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Let G=(V,E) be a simple graph without isolated vertices. A vertex set S@?V is a paired-dominating set if every vertex in V-S has a neighbor in S and the induced subgraph G[S] has a perfect matching. In this paper, we investigate the approximation hardness of paired-domination in graphs. For weighted paired-domination, an approximation algorithm in general graphs and an exact dynamic programming style algorithm in trees are also given.
36479792
A Dependable Communication Network for e-Textiles
Due to high frequent wear and tear or other faults in use, it is important to implement a fault-tolerant communicating network for e-textiles that can be easily woven into a fabric. In this paper, we introduce token buses to connect the nodes, instead of the single rings in the original e-textile token grid. The topology of the new network is described. And we also discuss the media access control protocols and the reliable operations. Simulation results show that the new e-textile communication network can improve the ability of e-textile applications to tolerate faults and provide the communicating services of less delay.
18449881
Tracking Articulated Hand Underlying Graphical Model with Depth Cue
Visual tracking of articulated objects in real 3D space is challenging with applications in advanced human–computer interfaces and gesture semantic understanding. In this paper, graphical model, constructing articulated human hand, and NBP algorithm embedded with CAMSHIFT, inferencing hand configuration in 3D space, are applied for visual hand tracking. We also introduce image depth cue captured by two calibrated cameras together with color and edge as observation model. Depth cue allows our method to track human hand incomparatively accurate distance from cameras, especially in cluttered scenes with objects of similar color or edge. All those image cues are converted necessarily to probability distribution applied for the graphical model frame. The proposed method promotes the tracking efficiency and robustness proved by experiments and theory analysis.
17691520
Design of an Intelligent Controller for a Model Helicopter Using Neuro-Predictive Method with Fuzzy Compensation
In this paper, a Neuro-Predictive (NP) controller is designed and implemented on a highly non-linear system, a model helicopter in a constrained situation. It is observed that the closed loop system with the NP controller has a significant overshoot and a long settling time in comparison to the same system with an existing fuzzy controller. In order to improve the undesired system performance, a Sugeno-type fuzzy compensator, having only two rules, is added to the control loop to adjust control input. The newly designed Neuro-Predictive control with Fuzzy Compensator (NPFC) improves the system performance in both overshoot and settling time. Furthermore, it is shown that the NPFC controlled system is robust to disturbance and parameter changes.
18482512
Remote equipment monitoring system based on ARM9 and CAN bus
In this paper, the remote monitoring system based on ARM9 and CAN bus is studied. It focuses on the ARM9 and Ethernet interface methods, CAN / Ethernet protocol conversion methods, and the construction of the network database. Adopting the technology, which is embedded Network interface device in the network environment of self-identification, self-description and interoperability, it will make the network sensor dynamic configuration and reconfiguration. Test results show that the system meets the requirements of automation equipment maintenance, real-time monitoring and reliability, so that it makes the effective realization of the remote monitoring equipment come true.