We investigate the applicability of a triple quantum dot (TQD) device for memory operation, in which information is coded by the magnetization of a ferromagnetic (FM) electrode. In the presence of Rashba spin-orbit co...
详细信息
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.
LS 2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system....
详细信息
LS 2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system. With the support of changed LS 2 , we model three types of isolation. Moreover, we formally analyze the integrity measurement property of TrustVisor proposed recently which provides the isolated execution environment for security-sensitive code.
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.
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.
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.
An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that ...
详细信息
An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.
暂无评论