Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Computer-Architecture

There are 135 papers published in subject: > since this site started.

Results per page:

135 Total, 14 Pages | << First < Previous 10 11 12 13 14 Next > Last >>

Select Subject

All (8828)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Third-level Subject

Computer Network(89)
Computer System Design(5)
Distributed Processing Sy...(9)
Other Subjects of Compute...(3)
Parallel Processing(11)
Run Test and Performance ...(2)

Rank

Results per page:

135 Total, 14 Pages | << First < Previous 10 11 12 13 14 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Influence of Propagation models in Ad Hoc Networks Routing Protocols
	Sixte Martial Itoua
	Computer Science and Technology 15 April 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A mobile Ad Hoc Network is (MANET) is a network consisting of a group of wireless mobile nodes that communicate with each others without centralized control or established infrastructure. In recent years, a lot of new routing protocols have been developed in order to increase the performance of ad hoc networks. Like all wireless based system, MANET suffers for the performance limitations of a wireless channel, like the obstacle between the transmitter and the receiver. Hence the necessity of an effective mobility model which represents the moving behavior of each mobile node (MN). In this paper the performance of some of the well known ad hoc protocols is studied under different propagation models. The analysis shown that the propagation model has a deep impact on the performance of ad hoc routing protocols.
	TO cite this article:Sixte Martial Itoua. Influence of Propagation models in Ad Hoc Networks Routing Protocols[OL].[15 April 2008] http://en.paper.edu.cn/en_releasepaper/content/20477


	2. Modeling Non-Internet Epidemics Based on Social Networks: A Case Study of Rose
	Sirui Yang,Hai Jin,Xiaofei Liao
	Computer Science and Technology 29 March 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Internet epidemics have been long discovered and studied. However, few have noticed that non-Internet epidemics which take advantage of Social Networks are also destructive to information systems. In this paper, we think of the non-Internet viruses which transfer through portable devices, especially flash drives. We take Rose epidemic as a case study and build a model with a system of differential equations and closed-form solutions, for three propagation scenes of Rose correspondingly. With both theoretical and numerical analysis, we find out that (1) Rose is able to infect hosts as exponentially as the Internet-based worms do;(2) In the Internet Bar scene, it is difficult to contain Rose even with reactive recovery measures; (3) the most influential factors for Rose’s propagation are the amount of hosts and portable devices and the lifetime of Internet Bar machines, while the arrival rate of clients and the proportion of immune machines only affect in the Print Service Office scene.
	TO cite this article:Sirui Yang,Hai Jin,Xiaofei Liao. Modeling Non-Internet Epidemics Based on Social Networks: A Case Study of Rose[OL].[29 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19870

Saved Papers

Saved Papers


	3. The Content Pollution in Peer-to-Peer Live Streaming Systems: Analysis and Implications
	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:There has been significant progress in the development of Peer-to-Peer (P2P) based live video streaming systems in recent years due to its inherent scalability and easy deployment. Such P2P live streaming systems, however, are largely vulnerable to intermediate attacks, in which the content pollution is a common attack that can significantly reduce the video content availability and disrupt the video playback quality. In this paper, we carry out a formal analysis of the content pollution and discuss its implications in the P2P video streaming system. Specifically, we establish a probabilistic model to capture the progress of content pollution. We evaluate the effect of content pollution based on the proposed model through extensive simulations. We demonstrate that (1) the number of polluted peers can be exponentially increased, similar to random scanning worms. This is potentially vital that with 1% polluters, the overall system can be compromised within 60 seconds. Meanwhile, the bandwidth utilization is decreased by 11.8%; (2) Augmenting the number of polluters does not imply a faster progress of content pollution, in which the most influential factors are the peer degree and access bandwidth. We further discuss the various known techniques and show that a hash-based signature scheme can be effective against the content pollution, in particular when used in the initial phase.
	TO cite this article:Sirui Yang,Hai Jin,Xiaofei Liao. The Content Pollution in Peer-to-Peer Live Streaming Systems: Analysis and Implications[OL].[28 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19830


	4. 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


	5. 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


	6. 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


	7. Quantum Particle swarm optimization based network Intrusion feature selection and Detection
	Zhang Hongmei,Gao Haihua,Wang Xingyu
	Computer Science and Technology 14 December 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Considering the relevance among features, which filter-based feature selection method fails to deal with, a kind of hybrid quantum particle swarm optimization and support vector machines based network intrusion feature selection wrapper algorithm is put forward. The subset of features is represented using quantum superposition characteristic and probability representation, among which superposition characteristic can make a single particle represent several states, thus potentially increases population diversity. Every particle in the quantum particle swarm stands for a selected subset of features. A probabilistic mutation is adopted to avoid local optimal and a taboo search table is used to enlarge particle swarm’s search space and avoid repeated computation. The fitness of particle is defined as the correct classification percentage by SVM using a training set whose patterns are represented using only the selected subset of features. The results of experiments demonstrate that the proposed method can be an effective and efficient way for feature selection and detection via using the data sets of KDD cup 99.
	TO cite this article:Zhang Hongmei,Gao Haihua,Wang Xingyu. Quantum Particle swarm optimization based network Intrusion feature selection and Detection[OL].[14 December 2007] http://en.paper.edu.cn/en_releasepaper/content/16964


	8. NAT/Firewall Traversal in NSIS
	Li Xin
	Computer Science and Technology 09 November 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, at first, we analyze the necessity of NAT and firewall. Meanwhile we should notice that NAT and firewall are some impeditive to an end-to-end session, in other words, we need to traverse them under some circumstances. In the following sections, we enumerate several kinds of solutions for NAT and firewall traversal. Unfortunately, all of current solutions have respective defects, so that we could not traverse NAT and firewall thoroughly. To resolve these problems, we introduce Next Steps in Signaling (NSIS) in this paper. NSIS can not be only applied in traditional network, but also can be used for mobile scenarios. It can deal with problems caused by the mobility.
	TO cite this article:Li Xin. NAT/Firewall Traversal in NSIS[OL].[ 9 November 2007] http://en.paper.edu.cn/en_releasepaper/content/16263


	9. TVe e-an Easier implemented and Faster encoded/decoded Format of Encoding Rules than TLV of BER for ASN.1
	LiChi Zhang,JiangTao Yin,XuDong Yang
	Computer Science and Technology 11 October 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:TVe -a new triplet improved from TLV format representing of Type ,Value ,and end-of-contents -is an encoding format established aiming at building an easier realized and faster encoder/decoders. In this article we examine ASN.1 and the owner of TLV BER; and turn to TVe, fully describing its structure and main principles, comparing it with TLV format and seeing how it fix the problems that TLV occurs with flawless proves; then the corresponding encoding rules ERa -Encoding Rules adding end-of-content mark-will be briefly introduced on implementation, with final conclusion to discuss TVe’s application areas, and researches that still has to be done, the parts which remain needs to be improved.
	TO cite this article:LiChi Zhang,JiangTao Yin,XuDong Yang. TVe e-an Easier implemented and Faster encoded/decoded Format of Encoding Rules than TLV of BER for ASN.1[OL].[11 October 2007] http://en.paper.edu.cn/en_releasepaper/content/15599


	10. TDOA-based Sybil Attack Detection Scheme for Wireless Sensor Networks
	wen mi,Li hui,Zheng Yanfei,Chen Kefei
	Computer Science and Technology 27 March 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As wireless sensor network are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node with multiple non-existent identities (ID), will cause harmful effects on the decision making or resource allocation in these applications. In this paper, we present an efficient and lightweight solution for Sybil attack detection based on the Time Difference of Arrival (TDOA) between the source node and beacon nodes. Our solution can not only detect the existence of Sybil attacks but also locate the Sybil nodes. And we demonstrate the efficiency of our solution through experiments. The experiments show that our solution can detect Sybil attack cases with 100% completeness.
	TO cite this article:wen mi,Li hui,Zheng Yanfei, et al. TDOA-based Sybil Attack Detection Scheme for Wireless Sensor Networks[OL].[27 March 2007] http://en.paper.edu.cn/en_releasepaper/content/11725

	Check out RSS, or use RSS reader to subscribe this item