Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 36 papers published in subject: > since this site started. |
Results per page: | 36 Total, 4 Pages | << First < Previous 1 2 3 4 |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. An Efficient Hardware-based PIR Scheme | |||
Lan Tian,Qin Zhiguang | |||
Computer Science and Technology 09 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An hwPIR (hardware-based Private Information Retrieval) protocol allows a user to retrieve one of N records from a database without revealing the identity of the record to the database server using a server-side trusted hardware. In this paper, we present a new hwPIR protocol which achieves computation complexity while keeping the same communication overhead. Two N-length memory buffers are used to avoid the most time-consuming process, periodic reshuffle. Although this scheme is not fully secured, we believe it’s secure enough in practice and easy to implement. | |||
TO cite this article:Lan Tian,Qin Zhiguang. An Efficient Hardware-based PIR Scheme[OL].[ 9 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27584 |
2. Binary-Price Proxy Auction Protocol | |||
Lan Tian,Qin Zhiguang | |||
Computer Science and Technology 07 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The paper presents a distributed 2nd-price proxy auction protocol that doesn’t require bidders to be constantly online after submitting their bid-chains in P2P network. That is, bidders can be offline other than submitting their bid-chains, and other peers in the P2P network conduct the auction process instead. During the whole protocol, bid-chains containing lower prices will be discarded remaining encrypted forms, and only the one containing highest price is left. Compared with other auction protocols, our protocol has properties of sealed-bid along with distributed bid auction, and it allows the bidders to submit their bids asynchronously meanwhile keeps all the losing bids unrevealed even after the auction is resolved. | |||
TO cite this article:Lan Tian,Qin Zhiguang. Binary-Price Proxy Auction Protocol[OL].[ 7 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27412 |
3. Ontology-based QoS-Aware Support for Semantic Web Services | |||
Lin Lin,Shuang Kai,Su Sen | |||
Computer Science and Technology 26 December 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper describes an approach to add QoS-awareness for Web service with semantics. A QoS ontology is proposed and expressed in Web Ontology Language (OWL) . Composition of this ontology includes upper-level profile ontology and lower-level property ontology. Meanwhile, a set of rules defined by Semantic Web Rule Language (SWRL) are also described and designed for reasoning with information expressed using QoS ontology and targets at acquiring more advanced knowledge based on simple ones. The corresponding knowledge base (QoS ontology and individuals) and rule repository have been implemented as part of PISOMWare project, which provides semantic enabled service discovery, service selection, service composition and service monitoring with QoS-aware support. Typical experiment results listed in final section shows that more semantics have been brought to Web Service. | |||
TO cite this article:Lin Lin,Shuang Kai,Su Sen. Ontology-based QoS-Aware Support for Semantic Web Services[OL].[26 December 2008] http://en.paper.edu.cn/en_releasepaper/content/27011 |
4. Improved Taboo Search Algorithm for Designing DNA Words | |||
Kai Zhang,Jin Xu,Xiutang Geng,Jianhua Xiao,Linqiang Pan | |||
Computer Science and Technology 27 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improved the method for the systematic design of equal-length DNA sequences, which could satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can find greatest DNA sequences sets which satisfy required constraints. | |||
TO cite this article:Kai Zhang,Jin Xu,Xiutang Geng, et al. Improved Taboo Search Algorithm for Designing DNA Words[OL].[27 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19759 |
5. Software Reliability Models Based on Markov Renewal Process | |||
Ning Ning,Bo Yang | |||
Computer Science and Technology 29 September 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Many existing software reliability models are based on the assumption of statistical independence among successive software failures. In reality, this assumption could be easily violated. In recent years, efforts have been made to relax this unrealistic assumption and a software reliability modeling framework considering failure correlation was developed by Goseva-Popstojanova and Trivedi. However, some important issues that are crucial for the proposed models to be used in practice remain unstudied, such as the method of estimation of model parameters. In this paper, we study the parameter estimation problem for this software reliability modeling framework. We propose a relationship function among model parameters which could be essential to the reduction of the number of parameters to be estimated as well as to the reliability prediction using the proposed modeling framework. Two parameter estimation methods have been developed based on deferent types of data available, using Maximum Likelihood Estimation (MLE) method. Simulation results preliminarily show that the accuracy of both proposed estimation methods are satisfactory. | |||
TO cite this article:Ning Ning,Bo Yang. Software Reliability Models Based on Markov Renewal Process[OL].[29 September 2007] http://en.paper.edu.cn/en_releasepaper/content/15436 |
6. A Novel Mechanism in MPLS Network under Adversarial Uncertainty | |||
Ying Zheng,Hu Hanping | |||
Computer Science and Technology 04 April 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:the advantage of multi-protocol label switching (MPLS) is its capability to route the packets through explicit paths. But the nodes in the paths may be possibly attacked by the adversarial uncertainty . Aiming at this problem in MPLS Network, in this paper, we propose a novel mechanism in MPLS network under adversarial uncertainty, making use of the theory of artificial intelligence, at first, we find the initialized label switching paths(LSPs) using the A* arithmetic, and secondly, during the process of data transmission, we switch the transmission path duly by taking advantage of the non-monotone reasoning mechanism. Compared to the traditional route mechanism ,the experimental results show that it improves the security if data transmission remarkably under our novel mechanism in MPLS network. | |||
TO cite this article:Ying Zheng,Hu Hanping. A Novel Mechanism in MPLS Network under Adversarial Uncertainty[OL].[ 4 April 2007] http://en.paper.edu.cn/en_releasepaper/content/11928 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
Results per page: | 36 Total, 4 Pages | << First < Previous 1 2 3 4 |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated