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-Science-and-Technology

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

Results per page:

72 Total, 8 Pages | << First < Previous 3 4 5 6 7 8 Next > Last >>

Select Subject

All (8831)

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)

Second-level Subject

Artificial Intelligence(287)
Basic Subject of Computer...(134)
Computer Applications(231)
Computer Architecture(136)
Computer Engineering(7)
Computer Software(104)
Other Subjects of Compute...(25)

Rank

Results per page:

72 Total, 8 Pages | << First < Previous 3 4 5 6 7 8 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. Implementation and Performance Evaluation of MFlood protocol for Mobile Ad Hoc Networks
	AL-Gabri Malek,LI Chunlin ,Wang Bo
	Computer Science and Technology 13 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we adding MFlood protocol to NS2 and analyze the features and models of wireless network in details; discuss the simulation process and implementation of wireless network on the basis of NS2, also MFlood protocol and AODV protocol self-defined in wireless network. Nam is used to display the process of simulation. Gnuplot and Gawk Tools are used to produce plot data files and icons to clarify the communication process. NS2 is a simulation tool designed specifically for communication networks. The main functionalities of NS2 are to set up a network of connecting nodes and to pass packets from one node to another. A detailed introduction to the design, implementation, and use of network simulation tools are presented. The requirements and issues faced in the design of simulators for wired and wireless networks are discussed. Abstractions such as packet- and fluid-level network models are covered.
	TO cite this article:AL-Gabri Malek,LI Chunlin ,Wang Bo . Implementation and Performance Evaluation of MFlood protocol for Mobile Ad Hoc Networks[OL].[13 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38845


	2. A complete algorithm to find exact minimal polynomial by approximations
	Xiaolin Qin,Yong Feng,Jingwei Chen,Jingzhong Zhang
	Computer Science and Technology 11 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the rational approximation representation to the minimal polynomial representation, and devise a simple algorithm to factor multivariate polynomials with rational coefficients. Compared with the subsistent methods, our method combines advantage of high efficiency in numerical computation, and exact, stable results in symbolic computation. we also discuss some applications to some transcendental numbers by approximations. Moreover, the \\emph{Digits} of our algorithm is far less than the LLL-lattice basis reduction technique in theory. In this paper, we completely implement how to obtain exact results by numerical approximate computations.
	TO cite this article:Xiaolin Qin,Yong Feng,Jingwei Chen, et al. A complete algorithm to find exact minimal polynomial by approximations[OL].[11 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38727

Saved Papers

Saved Papers


	3. Agent-based Interopration Model（AIM）For Agent-Web Services Combination （AWSC）In Bioinformatics Web Application
	Li Wei,Lv Zhongdogn
	Computer Science and Technology 11 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As a new developing technology model，Agent attracts more attention in Internet，which benefits more the distributed application and integration, especially in the area of Web Service Collaboration(WSC) and Web Service Interoperation (WSI).An Agent-based Interoperation Model (AIM) proposed in this paper achieves the Agent-Web Services combination（AWSC）. The AIM mainly depending on ACL specifications to complete the Agent communication for Web Service composition and excution. Then a bioinformatics Web Service application has been introduced as Agent-Web Services combination case. It demonstrates how the proposed Agent-Web Services combination（AWSC）framework can be used to establish a collaborative environment that provides dynamic Web services integration and interopration.
	TO cite this article:Li Wei,Lv Zhongdogn . Agent-based Interopration Model（AIM）For Agent-Web Services Combination （AWSC）In Bioinformatics Web Application[OL].[11 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38715


	4. Security of Ad Hoc Networks
	AL-Gabri Malek,Chun-Lin LI,Bo Wang,Zhi-Yong Shen
	Computer Science and Technology 25 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The wireless ad hoc nature of Mobile Ad hoc Network brought a new security challenges to the network design. Vulnerability of channels and nodes, absence of infrastructure, and dynamically changing topology make ad hoc networks’ security a difficult undertaking. Broadcast wireless channels allow message to be eavesdropping and injection. Wireless networks were generally more vulnerable to information and physical security threats than fixed wired networks. The absence of infrastructure makes the classic security solutions based on certification authorities and online servers inapplicable. This paper on ad hoc networking illustrates that many of the new generation ad hoc networking proposals are not yet able to address the unique security problems of this specialized system. Environment-specific implications on the required approaches in implementing security in such dynamically changing networks have not yet been fully realized. There are many ongoing ad-hoc programming attempts to address the problem. Include Optimized Link State Routing, Ad-hoc On-demand Distance Vector, and Hazy Sighted Link State .We attempt to analyze the demands of Ad-hoc environment. We focus on three routing of Ad-hoc networks attempts to address the problem.
	TO cite this article:AL-Gabri Malek,Chun-Lin LI,Bo Wang, et al. Security of Ad Hoc Networks[OL].[25 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38083


	5. Large-scale Data Analysis based on Hadoop
	Liu Yijun
	Computer Science and Technology 15 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the development of complex network and the increase of data scale, the performance of data analysis becomes more and more important. In this paper, we present a new approach for network analysis about the flight data based on Hadoop which is an implementation of the MapReduce parallel framework: Firstly, we identity and group the information of passengers and flights. Secondly, we extract graph nodes, which represent the passengers, and graph edges, which represent the relationship between the passengers. Finally we visualize the passenger’s egocentric network to help network analysis.
	TO cite this article:Liu Yijun. Large-scale Data Analysis based on Hadoop[OL].[15 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37600


	6. Rapid License Plate Location Using a Boosted Cascade of Haar-like Features
	Guo Tianqing,Lu Wenting,Zhang Honggang,Guo Jun
	Computer Science and Technology 10 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, authors represent location method for vehicle license plate by using a boosted cascade of Haar-like features and it’s capable of locating the license plate extremely rapid while achieving high detection rate. After coarse location by the cascade classifier, the candidates can be checked by binary image projection method according the prior knowledge. This method is of faster speed and higher accuracy than most of the existing methods used in license plate location. Experimental results demonstrate the method is applicable and robust in the real-time location system.
	TO cite this article:Guo Tianqing,Lu Wenting,Zhang Honggang, et al. Rapid License Plate Location Using a Boosted Cascade of Haar-like Features[OL].[10 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37439


	7. Secure multi-party computations of geometric intersections
	Cui Hui
	Computer Science and Technology 18 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Secure multi-party computation is a research focusing in international crypto graphic community. This paper focuses on geometric intersection problems. We use Cantor Encoding method to solve the secure multi-party computation geometry, and propose a new scheme to solve geometry intersection problem. In order to keep secret, we make use of convertible encryption algorithm. This paper gives the solutions to the segment intersection problem and polygon intersection problem, and then demonstrate their security through simulation example. Compared to mostly existing schemes, this scheme can solve any polygon intersection problem, and sometimes its complexity of computation maybe smaller, especially when dealing with the polygon having more vertexes and smaller area. Although it will generate some errors, but this will not affect its application.
	TO cite this article:Cui Hui. Secure multi-party computations of geometric intersections[OL].[18 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35310


	8. A Fault Diagnosis Modeling Method Combined RBF Neural Network with Rough Set Theory
	Zhou Liuyang,Shi Yuwen,Zhang Yunlong
	Computer Science and Technology 25 June 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In order to improve diagnosis precision and decreasing misinformation diagnosis, according to the intelligence complementary strategy, a new complex intelligent fault diagnosis method based on rough sets theory and RBF neural network is presented. Firstly, basis on data pretreatment, the fault diagnosis decision table is formed, and continuous datum are discretized by using hybrid clustering method. Rough sets theory as a new mat hematical tool is used to deal with inexact and uncertain knowledge for pattern recognition. The target is mainly to remove redundant information and seek for reduced decision tables which to obtain the minimum fault feature subset. The neural networks adopted were of the feed-forward variety with one hidden layer. They were trained using back-propagation. The method can reduce the false alarm rate and missing alarm rate of the fault diagnosis system effectively, and can detect the composed faults while keep good robustness.
	TO cite this article:Zhou Liuyang,Shi Yuwen,Zhang Yunlong. A Fault Diagnosis Modeling Method Combined RBF Neural Network with Rough Set Theory[OL].[25 June 2009] http://en.paper.edu.cn/en_releasepaper/content/33405


	9. Design and Implementation of Web Application Framework based on SOA
	Xiaoyun Chen,Baojun Gao,Yu Zhou
	Computer Science and Technology 10 June 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As the dominant approach to enterprise integration, SOA (Service-Oriented Architecture) has a profound impact on the enterprise-level software architecture. By analyzing and researching SOA and Web Services platform, with the help of advanced software development platform J2EE and Web Services engine XFire we complete the Web application framework based on SOA.
	TO cite this article:Xiaoyun Chen,Baojun Gao,Yu Zhou. Design and Implementation of Web Application Framework based on SOA[OL].[10 June 2009] http://en.paper.edu.cn/en_releasepaper/content/33031


	10. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm
	CHEN Xiaoyun,HE Yanshan,CHEN Pengfei,MIAO Shengfa,YUE Min,SONG Weiguo
	Computer Science and Technology 08 April 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Frequent itemset mining is a fundamental and essential issue in data mining field and can be used in many data mining tasks. Most of these mining tasks require multiple passes over the database and if the database size is large, which is usually the case, scalable high performance solutions involving multiple processors are required. In this paper, we present a novel parallel frequent itemset mining algorithm which is called HPFP-Miner. The proposed algorithm is based on FP-Growth and introduces little communication overheads by efficiently partitioning the list of frequent elements list over processors. The results of experiment show that HPFP-Miner has good scalability and performance.
	TO cite this article:CHEN Xiaoyun,HE Yanshan,CHEN Pengfei, et al. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm[OL].[ 8 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31153

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