People spend a significant amount of time in indoor spaces (e.g., office buildings, subway systems, etc.) in their daily lives. Therefore, it is important to develop efficient indoor spatial query algorithms for suppo...
详细信息
Large scale distributed agent-based simulations run on several computing units (e.g., virtual machines in the Cloud, nodes in a supercomputer). Classically, these systems try to (re-)load-balance the nodes as overload...
详细信息
With the recent technical advances and popularization of smartphones, which are able to store, display, and transmit various types of media content, message forwarding in opportunistic mobile social networks has becom...
详细信息
ISBN:
(纸本)9781479960378
With the recent technical advances and popularization of smartphones, which are able to store, display, and transmit various types of media content, message forwarding in opportunistic mobile social networks has become a hot topic. In this paper, we propose a social-aware single-copy routing approach, which leverages the internal social feature information to resolve the social distance between the source and destination step-by-step. We introduce an optimal social feature forwarding set selection scheme for routing guidance, which is proven to achieve small message forwarding delay. We convert the routing process into an iterative 2-hop routing scheme, with a novel transition probability to measure the delivery delay of each hop. The transition probability is according to the community structure in each social feature space. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing state-of-art approaches.
Network security can be analysed using attack representation models (ARMs) (e.g., Attack Graphs (AGs) and Attack Trees (ATs)). One can analyse the network security by computing all possible attack scenarios, but it su...
详细信息
Context. Development of safety-critical systems is mostly governed by process-heavy paradigms, while increasing demands on flexibility and agility also reach this domain. Objectives. We wanted to explore in more detai...
详细信息
PEP-side caching is used in request-response access control mechanisms to increase the availability and reduce the processing overhead on PDP. Nonetheless, this paper shows that using this approach may open an insider...
详细信息
An increasing number of spatial keyword query techniques that return qualified objects based on a comprehensive consideration of spatial and keyword constraints have been presented in the literature. Due to the comple...
详细信息
This project explores the design of a tool to facilitate a common task that software engineers find difficult - the identification and management of dependencies between the many heterogeneous entities created in the ...
详细信息
Charging of large-scale electric vehicles will have a significant impact on the grid so that their charging schedule needs to be optimized. The traditional centralized scheduling method requires high performance in in...
详细信息
ISBN:
(纸本)9781479920327
Charging of large-scale electric vehicles will have a significant impact on the grid so that their charging schedule needs to be optimized. The traditional centralized scheduling method requires high performance in information exchange and computing. Based on the analysis of the features of electric vehicle charging load and the research of cloud computing, we propose a cloud computing based schedule platform for optimal charging of electric vehicles. In addition, the function and implementation of the three basic modules of the platform (the data collection module, the cloud computing center and the control center) are exposed. The platform performs well in optimal scheduling for electric vehicles. In addition, the platform can also make full use of the computing resource and reduce the communication congestion.
The state-of-the-art mobile visual search approaches are based on the bag-of-visual-word (BoW). As BoW representation ignores geometric relationship among the local features, a full geometric constraint like RANSAC is...
详细信息
暂无评论