This paper designs and develops an emergency rescue service for electric vehicles (EVs), which may suffer from the battery depletion during their trips. After building relevant data models on both chargers and EVs, ou...
详细信息
This paper designs and develops an emergency rescue service for electric vehicles (EVs), which may suffer from the battery depletion during their trips. After building relevant data models on both chargers and EVs, our design defines the interaction among three parties of EV drivers, the rescue server, and rescue vehicles to responsively process the dispatch request and systematically meet the user requirement. Particularly, a comprehensive mobile application is developed on the Android operating system to help users to promptly send a rescue request to the server and monitor the request processing status. This user interface allows EV drivers to automatically specify their locations and necessary personal information as well as to view the distribution of emergency vehicles through user-friendly maps. Our design is scalable for a large number of emergency vehicles and rescue requests, accelerating the wide deployment of EVs in our daily lives. Moreover, the rescue system design can collaborate with an EV tracking system and charge reservation agents to create a more sophisticated EV information service.
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the random...
详细信息
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.
Sentiment analysis is several methods, techniques, and tools that are used to determine the polarity of the text (positive, negative, or neutral). The most popular approaches to address this problem, is the machine le...
详细信息
Real-time access to complex knowledge is a business driver in the contact centre environment. In this paper we outline for the domain of telecom technical product support a knowledge sharing paradigm in which a deskto...
详细信息
Real-time access to complex knowledge is a business driver in the contact centre environment. In this paper we outline for the domain of telecom technical product support a knowledge sharing paradigm in which a desktop client annotates named entities in technical documents with canonical names, class names or relevant class axioms, derived from an ontology by means of a web services framework. We described the system and its core components;OWL-DL telecom hardware ontology, ontological-natural language processing pipeline, an ontology axiom-extractor;and the semantic assistant framework.
Suppose we are given a complete graph on n vertices in which the lenghts of the edges are independent identically distributed non-negative random variables. Suppose that their common distribution function F is differe...
详细信息
Suppose we are given a complete graph on n vertices in which the lenghts of the edges are independent identically distributed non-negative random variables. Suppose that their common distribution function F is differentiable at zero and D = F ′ (0) > 0 and each edge length has a finite mean and variance. Let L n be the random variable whose value is the length of the minimum spanning tree in such a graph. Then we will prove the following: lim n → ∞ E ( L n ) = ζ (3)/ D where ζ (3) = Σ k = 1 ∞ 1/ k 3 = 1.202… and for any ε > 0 lim n → ∞ Pr(| L n − ζ (3)/ D |) > ε ) = 0.
Measures extracted from software repositories tend to be collected on a regular basis (often daily), forming time series of data. In this context, it is normal to assume that some of the measures collected are having ...
详细信息
ISBN:
(纸本)1891706373
Measures extracted from software repositories tend to be collected on a regular basis (often daily), forming time series of data. In this context, it is normal to assume that some of the measures collected are having an effect on other measures, potentially with some delay (or "lag") in the effect. Such delay in the effect may even vary over time, making the identification of the effect difficult. In this paper, we present our initial ideas on a simple analysis method for such situation, in which peaks from the two time series in question are analyzed, and similar ones are matched.
The process of a supply chain involves a series of activities that distribute, assemble, and manage products, transferring them from the supplier to the end consumer. It operates as a complex, interconnected network r...
详细信息
We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, r...
详细信息
The twig join, which is used to find all occurrences of a twig pattern in an XML database, is a core operation for XML query processing. A great many strategies for handling this problem have been proposed and can be ...
详细信息
The twig join, which is used to find all occurrences of a twig pattern in an XML database, is a core operation for XML query processing. A great many strategies for handling this problem have been proposed and can be roughly classified into two groups. The first group decomposes a twig pattern (a small tree) into a set of binary relationships between pairs of nodes, such as parent-child and ancestor-descendant relations;and transforms a tree matching problem into a series of simple relation look-ups. The second group decomposes a twig pattern into a set of paths. Among all this kind of methods, the approach based on the so-called stack encoding [N. Bruno, N. Koudas, and D. Srivastava, Holistic Twig Hoins: Optimal XML Pattern Matching, in Proc. SIGMOD Int. Conf. on Management of Data, Madison, Wisconsin, June 2002, pp. 310-321] is very interesting, which can represent in linear space a potentially exponential (in the number of query nodes) number of matching paths. However, the available processes for generating such compressed paths suffer some redundancy and can be significantly improved. In this paper, we analyze this method and show that the time complexities of path generation in its two main procedures: TwigStack and TwigStackXB can be reduced from 0(m2-n) to O(m-n), where m and n are the sizes of the query tree and document tree, respectively. Experiments have been done to compare TwigStackXB and ours, which shows that using our method much less time is needed to generate matching paths.
Approaches to visual object recognition can be divided into model-based and non modeLbased schemes. In this paper we establish some limitations on non model-based recognition schemes. We show that a consistent non mod...
详细信息
暂无评论