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 946 papers published in subject: since this site started. |
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. Measuring the Impact of Web Features in Peer-to-Peer File Sharing Systems | |||
Sirui Yang,Hai Jin,Xiaofei Liao | |||
Computer Science and Technology 28 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In some P2P file sharing systems like BitTorrent, portal web pages with different web features are often adopted to guide resource selection. We believe the features on these pages will directly affect the users’ decisions of selecting resources, which further influence the following process of content delivery. We conducted an in-depth measurement of “5QZone”, the largest BitTorrent website in CERNET. Our crawler has worked for 31 days, and collected 168,610 records which contain 11,228 distinct publications. The results show that (1) with the highlight feature on popular items, the aggregate completion times of downloading resources yield to a long-tail distribution however deviating from the Zipf Law; (2) publications with attracting titles tend to spread much faster than others. It is indicated that the users’ selection of resources is strongly influenced by the portal web features in BitTorrent. An implication of the results is that the attackers can leverage these features and deteriorate the attack consequence significantly. | |||
TO cite this article:Sirui Yang,Hai Jin,Xiaofei Liao. Measuring the Impact of Web Features in Peer-to-Peer File Sharing Systems[OL].[28 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19814 |
2. 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 |
3. An Implementation Method of Tree Structure Based on Multilevel Marking Coding Theory | |||
Wu Shengyuan | |||
Computer Science and Technology 24 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Based on multilevel marking coding theory,this paper presents a new tree implementation method, called as matrix-based implementation method, which can be used to implement binary tree, general tree, and any kinds of trees. Comparing to the existent implementation methods, matrix-based implementation method is simpler, the operations of tree are simplified and more efficient, and storage space can be saved | |||
TO cite this article:Wu Shengyuan. An Implementation Method of Tree Structure Based on Multilevel Marking Coding Theory[OL].[24 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19618 |
4. Provably Secure Multi-Proxy Multi-Signature Scheme Without Random Oracles | |||
Zecheng Wang,Zhibin Li | |||
Computer Science and Technology 21 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Proxy signatures can combine other special感signatures to obtain some new types of proxy signatures. Based on the variant Waters\\\\\\\ | |||
TO cite this article:Zecheng Wang,Zhibin Li. Provably Secure Multi-Proxy Multi-Signature Scheme Without Random Oracles[OL].[21 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19593 |
5. A new measure of uncertainty based on knowledge granulation for rough sets | |||
Liang Jiye,Wang Junhong,Qian Yuhua | |||
Computer Science and Technology 07 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Rough set theory is a relatively new mathematical tool for computer applications in circumstances characterized by gueness and uncertainty. In this paper, we address certainty of rough sets for information systems. An axiom definition of knowledge granulation for information systems is btained, under which a measure of uncertainty of a rough set is proposed. This measure has some nice properties such as equivalence, maximum and minimum. Furthermore, we prove that the uncertainty measure is effective and suitable for easuring roughness and accuracy of rough sets for information systems with a more simple and comprehensive form than the measure defined in [15]. | |||
TO cite this article:Liang Jiye,Wang Junhong,Qian Yuhua. A new measure of uncertainty based on knowledge granulation for rough sets[OL].[ 7 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19141 |
6. Classification of EU project descriptions using Support Vector Machines | |||
Yang Zhao,Lu Yinghua,Ma Lijia | |||
Computer Science and Technology 06 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this project, we need to develop a system to classify project descriptions in classes defined by the user. The classification method will be based on Support Vector Machines technology. | |||
TO cite this article:Yang Zhao,Lu Yinghua,Ma Lijia. Classification of EU project descriptions using Support Vector Machines[OL].[ 6 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19093 |
7. The UPnP-based Algorithm of Resource Scheduling in Pervasive Computing Environment | |||
Tian Tian,Jian Kuang,JiaLi Bian | |||
Computer Science and Technology 04 March 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, an algorithm of resource schedule based on UPnP is proposed for pervasive computing. A user could access any resource he or she wants in anywhere at anytime without thinking about more. And the system can schedule the resources exiting in the network by this algorithm. The resource mentioned above can also be understood for service that users may need. A strategy is also presented in this algorithm, which is optimization method of choosing the best one from the devices that provide the services or resources. This research for RS algorithm is supported by Microsoft Research Asia, and by the Embedded Systems and Network Communications Laboratory at Beijing University of Posts and Telecommunications. | |||
TO cite this article:Tian Tian,Jian Kuang,JiaLi Bian. The UPnP-based Algorithm of Resource Scheduling in Pervasive Computing Environment[OL].[ 4 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19008 |
8. A second proof of the conjecture that the class P is a proper subset of the class NP | |||
Xu Wandong | |||
Computer Science and Technology 12 February 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The problem of deciding whether an arbitrary undirected planar graph $G$ is a Hamiltonian (HC) is one of six best important {bf NP}-complete problems. In current paper, by the necessary and sufficient condition of HC, one turned the problem HC into the one of determining whether there does not have any one of forbidden subgraphs in each of spanning subgraphs of $G$. It can be completed in the polynomial time for determining whether there does not have any one of forbidden subgraphs in a spanning subgraph, but it never be completed in the polynomial time for determining whether there exists at least a spanning subgraph in which there never have any forbidden subgraph in infinite many of spanning subgraphs. Such that one can deduced that the time complexity of algorithm for solving the problem HC is $mathcal{O}(n^2 2^{1.5n+Delta})$, here $n$ is the order of $G$ and $Delta$ is $>0$, that is, it is extra exponential of $n$. So one can conclude that HC $NOTIN$ {bf P} and {bf P} $subset$ {bf NP}. | |||
TO cite this article:Xu Wandong . A second proof of the conjecture that the class P is a proper subset of the class NP[OL].[12 February 2008] http://en.paper.edu.cn/en_releasepaper/content/18638 |
9. An Improved Key Distribution Scheme with Self-healing and Revocation Property for Wireless Sensor Network | |||
Yanfei Zheng,Mi Wen,Kefei Chen | |||
Computer Science and Technology 03 February 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Secure group communication is one of the important secure services for the applications of wireless sensor networks because they are widely used in military as well as civilian operations. It is not very practical to assume the secure communication channels existing between group manager and each of its members just after the deployment, since most pair-wise key pre-distribution schemes in wireless sensor networks are connected with little probability. It means that it is probabilistically success for group manager and each of its members to build a secure communication channel using the pre-distributed pair-wise key at the initialization of wireless sensor networks. In this paper we propose the improved self-healing key distribution scheme which could add a strange node with coalition of t+1 group members. A so-called strange node is the node which has no secure communication channel with the group manager. We prove in an appropriate security framework that our scheme is self-healing with revocation property and extendable property under t+1 coalition. Finally, we provide a comparison in performance between our results and other existing solutions. | |||
TO cite this article:Yanfei Zheng,Mi Wen,Kefei Chen. An Improved Key Distribution Scheme with Self-healing and Revocation Property for Wireless Sensor Network[OL].[ 3 February 2008] http://en.paper.edu.cn/en_releasepaper/content/18593 |
10. Using Flow Label to Provide Higher QoS | |||
Zhang Shengliang | |||
Computer Science and Technology 03 February 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Now, the Internet of IPv4 only provides “best-effort” service. But the real-time applications have developed widely such as voice over IP(VoIP) and video-on-demand(VoD), and they need higher QoS(Quality of Service). The core of any QoS scheme will be how to monitor and manage traffic flows that have guaranteed QoS. The two QoS approaches used in the literature are Int-Serv(Integrated service) and Diff-Serv(Differentiated service). Int-Serv uses the resource reservation protocol(RSVP)for signaling the path. Decisions on QoS requests are taken by each router independently. Diff-Serv uses bandwidth brokers as a QoS Management model to negotiate request, communicate with edge nodes and track reservations. To support QoS, Flow Label field has been proposed in the IPv6 header, which can be used to specify the QoS requirements. In this paper, we propose a QoS scheme using a modified Flow Label. We discuss how to process the Flow Label field in the Int-Serv and Diff-Serv models respectively and we give a detail specification of the 20 bits of the Flow Label field. | |||
TO cite this article:Zhang Shengliang. Using Flow Label to Provide Higher QoS[OL].[ 3 February 2008] http://en.paper.edu.cn/en_releasepaper/content/18586 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated