Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation re...
详细信息
Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation requirement frequently, the massive delay is inevitable. Without the modification to TPM, we propose Batch Integrity Report Protocol (BIRP) to overcome the performance bottleneck. B-IRP bundles these requirements in interval as a batch requirement, and creates the response messages for these requirements with one expensive TPM operation. Discussion shows that B-IRP has improved the performance without loss of security.
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthet...
详细信息
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.
In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the m...
详细信息
In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the monotonously increasing threshold. By using the nested structure of reductions, we could design algorithms to quickly find different reductions when a reduction is required. Here `different' means the reductions obtained using different thresholds.
in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial an...
详细信息
in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.
Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning st...
详细信息
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected ...
详细信息
ISBN:
(纸本)9781424499199
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.
A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the...
详细信息
A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem:Given locations of sensors along with a base station,a subset of all sensors,and parameters r,α and β,to find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts,such that the latency is *** designe an algorithm based on maximal independent sets,which has a latency bound of(a+19b)R + Δb-a + 5 time slots,where a and b are two constant integers relying on α and β,Δ is the maximum degree of network topology,and R is the trivial lower bound of *** Δ contributes to an additive factor instead of a multiplicative one,thus our algorithm is nearly a constant(a+19b)-ratio.
Video has become popular in our daily life for both professional and consumer applications. Both low level video processing and high level semantic video analysis are critically computational tasks in application doma...
详细信息
In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queri...
详细信息
In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queries are issued by mobile units(laptop,cell phone,etc.)which access the data objects of database servers by wireless *** inherent properties of mobile computing environment such as mobility,limited wireless bandwidth,frequent disconnection,make skyline queries more *** show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach,called efficient distributed skyline based on mobile computing(EDS-MC).In EDS-MC,a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication,network delay and query response *** conduct extensive experiments in a simulated mobile database system,and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.
暂无评论