1951107
CCSMOMS:A Composite Communication Scheme for Mobile Object Management System
In this paper, we discuss the design and implementation of a mobile object management system that makes use of the existing GSM (Global System for Mobile Communication) networks and it's extension-GPRS (general packet radio service) for data communication. We use a novel composite communication scheme (CCS), which uses SMS (short message service) and GPRS to achieve reliable and economical communication between mobile objects and the control center. We also use unified data management (UDM) for control center management, which significantly reduces the cost of maintaining separate data centers. We have deployed our services in two medium-sized cities with real users. The cost evaluation shows the high performance, usability and cost-effectiveness of this service in real production environment
2239051
Detecting large-scale system problems by mining console logs
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many software components written by independent developers. We propose a general methodology to mine this rich source of information to automatically detect system runtime problems. We first parse console logs by combining source code analysis with information retrieval to create composite features. We then analyze these features using machine learning to detect operational problems. We show that our method enables analyses that are impossible with previous methods because of its superior ability to create sophisticated features. We also show how to distill the results of our analysis to an operator-friendly one-page decision tree showing the critical messages associated with the detected problems. We validate our approach using the Darkstar online game server and the Hadoop File System, where we detect numerous real problems with high accuracy and few false positives. In the Hadoop case, we are able to analyze 24 million lines of console logs in 3 minutes. Our methodology works on textual console logs of any size and requires no changes to the service software, no human input, and no knowledge of the software's internals.
7346557
Predictive Control for Dynamic Resource Allocation in Enterprise Data Centers
It is challenging to reduce resource over-provisioning for enterprise applications while maintaining service level objectives (SLOs) due to their time-varying and stochastic workloads. In this paper, we study the effect of prediction on dynamic resource allocation to virtualized servers running enterprise applications. We present predictive controllers using three different prediction algorithms based on a standard auto-regressive (AR) model, a combined ANOVA-AR model, as well as a multi-pulse (MP) model. We compare the properties of the predictive controllers with an adaptive integral (I) controller designed in our earlier work on controlling relative utilization of resource containers. The controllers are evaluated in a hypothetical virtual server environment where we use the CPU utilization traces collected on 36 servers in an enterprise data center. Since these traces were collected in an open-loop environment, we use a simple queuing algorithm to simulate the closed-loop CPU usage under dynamic control of CPU allocation. We also study the controllers by emulating the utilization traces on a test bed where a Web server was hosted inside a Xen virtual machine. We compare the results of these controllers from all the servers and find that the MP-based predictive controller performed slightly better statistically than the other two predictive controllers. The ANOVA-AR-based approach is highly sensitive to the existence of periodic patterns in the trace, while the other three methods are not. In addition, all the three predictive schemes performed significantly better when the prediction error was accounted for using a feedback mechanism. The MP-based method also demonstrated an interesting self-learning behavior
8176507
Research and Application of Spatio-temporal Data Mining Based on Ontology
In this paper, the spatio-temporal data mining is studied by adopting the ontology theory. The method of spatio-temporal data mining based on ontology is presented and a new spatio-temporal forecasting model based on ontology is designed. The model uses two measures of spatio-temporal autocorrelation: spatio-temporal adjacency matrix and spatio-temporal contiguity measure. We use this model in the forecast about medium and long term coarse granularity in the railway passenger flow, and the results show that using the method of spatio-temporal forecasting based on ontology can obtain a good forecasting precision
9372724
Provably Correct Runtime Enforcement of Non-interference Properties
Non-interference has become the standard criterion for ensuring confidentiality of sensitive data in the information flow literature. However, application of non-interference to practical software systems has been limited. This is partly due to the imprecision that is inherent in static analyses that have formed the basis of previous non-interference based techniques. Runtime approaches can be significantly more accurate than static analysis, and have often been more successful in practice. However, they can only reason about explicit information flows that take place via assignments in a program. Implicit flows that take place without involving assignments, and can be inferred from the structure and/or semantics of the program, are missed by runtime techniques. This paper seeks to bridge the gap between the accuracy provided by runtime techniques and the completeness provided by static analysis techniques. In particular, we develop a hybrid technique that relies primarily on runtime information-flow tracking, but augments it with static analysis to reason about implicit flows that arise due to unexecuted paths in a program. We prove that the resulting technique preserves non-interference, while providing some of the traditional benefits of dynamic analysis such as improved accuracy.
9167227
A hierarchical naive Bayes mixture model for name disambiguation in author citations
Because of name variations, an author may have multiple names and multiple authors may share the same name. Such name ambiguity affects the performance of document retrieval, web search, database integration, and may cause improper attribution to authors. This paper presents a hierarchical naive Bayes mixture model, an unsupervised learning approach, for name disambiguation in author citations. This method partitions a collection of citations1 into clusters, with each cluster containing only citations authored by the same author, thus disambiguating authorship in citations to induce author name identities. Three types of citation features are used: co-author names, paper title words, and journal or proceeding title words. The approach is illustrated with 16 name datasets that are constructed based on the publication lists collected from author homepages and DBLP computer science bibliography.
7928906
Augmenting Exercise Systems with Virtual Exercise Environment
Adhering to an exercise program is a challenge for everybody who wants to build a healthier body and lifestyle through physical exercise. We have developed an Virtual Exercise Environment (VEE) that augments stationary exercise equipment with virtual reality techniques to make exercising more enjoyable. Our VEE system consists of a recording system to capture video, distance and incline data about real trails, and a playback system which "displays" both video and terrain data in the form of video speed and resistance. Trails are played back according to the speed the user generates on the stationary exercise equipment. The system uses commodity capture and display devices and supports standard interfaces for existing exercise equipment. User studies have shown that users enjoy the ability to guage their progress and performance via their progress through trail playback in the VEE.
20174343
An operator splitting method for variational inequalities with partially unknown mappings
In this paper, we propose a new operator splitting method for solving a class of variational inequality problems in which part of the underlying mappings are unknown. This class of problems arises frequently from engineering, economics and transportation equilibrium problems. At each iteration, by using the information observed from the system, the method solves a system of nonlinear equations, which is well-defined. Under mild assumptions, the global convergence of the method is proved, and its efficiency is demonstrated with numerical examples.