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 952 papers published in subject: since this site started.

Results per page:

952 Total, 96 Pages | << First < Previous 89 90 91 92 93 94 95 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)

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:

952 Total, 96 Pages | << First < Previous 89 90 91 92 93 94 95 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. The Design and Implementation of Smart Client-based Water Resource Management Architecture
	Shi Hong
	Computer Science and Technology 16 October 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the design of a special domain of water resources and flood control as the study background, by the combination of Distributed Computing Technology and the idea of Component-Based software Development, an open offline application software architecture which based on Smart Client is presented in this paper. Smart Clients that leverage local processing power and distributed computing create compelling, composite applications far superior to those from past DCOM and CORBA implementations. This paper reveals the architecture of flood prevention and control system and illustrates some important technology in Smart Client system design.
	TO cite this article:Shi Hong . The Design and Implementation of Smart Client-based Water Resource Management Architecture[OL].[16 October 2006] http://en.paper.edu.cn/en_releasepaper/content/8747


	2. Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering
	He Zengyou
	Computer Science and Technology 10 October 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based initialization method to k-modes clustering to improve its performance. Experiments show that new initialization method leads to better clustering accuracy than random selection initialization method for k-modes clustering.
	TO cite this article:He Zengyou . Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering[OL].[10 October 2006] http://en.paper.edu.cn/en_releasepaper/content/8660

Saved Papers

Saved Papers


	3. A Wireless Mutilmedia Service Design Based on nRF2401
	Chen Chen
	Computer Science and Technology 27 September 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a wireless multi-node multimedia service based on simplified IP protocol is designed, and the realization scheme and main module design method are discussed. The system based on video compression with TMS3C6211 (DSP) is centrally controlled through S3C4210 (ARM), and has a wireless communication on the public frequency 2.4 GHz by means of nRF2401 wireless chip. The system could be applied widely in safety insurance, storage, education and other fields.
	TO cite this article:Chen Chen. A Wireless Mutilmedia Service Design Based on nRF2401[OL].[27 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8520


	4. Similarity Measures of Vague Sets Based on the Set-theoretic Approach
	Faxin Zhao,Zongmin Ma
	Computer Science and Technology 18 September 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Vague set, as a generalized fuzzy set, has more powerful ability to process fuzzy information than fuzzy set. In this paper, we propose a new similarity measure between vague sets based on the set-theoretic approach. The proposed measure can provide a useful way for measuring the degree of similarity between vague sets.
	TO cite this article:Faxin Zhao,Zongmin Ma. Similarity Measures of Vague Sets Based on the Set-theoretic Approach[OL].[18 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8391


	5. Fuzzy Clustering Based on Vague Relations
	Faxin Zhao,Zongmin Ma,Li Yan
	Computer Science and Technology 01 September 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A vague relation, as well as an intuitionistic fuzzy relation, is a further generalization of a fuzzy relation. In fact there are situations where vague relations are more appropriate. In this paper, fuzzy clustering based on vague relations is investigate. On the basis of max-t & min-s compositions, we make a further extension of n-step procedure. With the proposed n-step procedure, a similarity vague relation matrix is obtained by beginning with a proximity vague relation matrix. Then a clustering algorithm is proposed for the similarity vague relation matrix.
	TO cite this article:Faxin Zhao,Zongmin Ma,Li Yan. Fuzzy Clustering Based on Vague Relations[OL].[ 1 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8153


	6. Research of BPM and its System Based on Dynamic Process Framework
	CHEN Jian-Rong,CHEN Jian-Wu,CHEN Wei-Xin
	Computer Science and Technology 15 August 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The intrinsic defects of traditional BPM technologies resulted in many companies’ failure in process management as enterprises trapped in a complex and changeful market environment. Through a thorough research of BPM, a new software architecture with the name of Dynamic Process Framework (DPF) is brought forward. After an analysis of its architecture and core components, a discussion about how to build a BPMS based on DPF is carried on. Results show that DPF surpasses many others in BPM because of its characteristics of fine descriptiveness, abstract, flexibility etc.
	TO cite this article:CHEN Jian-Rong,CHEN Jian-Wu,CHEN Wei-Xin. Research of BPM and its System Based on Dynamic Process Framework[OL].[15 August 2006] http://en.paper.edu.cn/en_releasepaper/content/7921


	7. The Minimum Spanning Flow Model of the Hamiltonian Path Problem in a Digraph and its Polynomial Algorithm*
	Xuanxi Ning,Angelika Ning
	Computer Science and Technology 08 August 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: Recently in the research work on the blocking flow theory the concept of minimum flow was put forward and the model of the minimum spanning flow was established. In this paper it is proved that the problem of constructing a Hamiltonian path in a digraph (DHP) can be polynomially reduced to the problem of constructing a non-circuit minimum spanning flow in an extended network with arcs to which the unit capacity of l is assigned. Based on the principle of self-organization of a non-circuit minimum spanning flow in a network[1][2], we developed an algorithm for constructing a Hamiltonian path in a digraph, if at least one Hamiltonian path exists. Theory and practice show that constructing such a minimum spanning flow in one step is indeed as difficult as the DHP problem. Fortunately, the construction of a non-circuit minimum spanning flow can be completed in two steps: (1) constructing a minimum spanning flow (with or without circular flows) in the extended network by searching adjusting close chains. (2) constructing the non-circuit minimum spanning flow (without circular flows) by searching alternate close chains in the distribution of a minimum spanning flow with circular flows[1]. In this paper, we’ll prove that these two steps can be completed in polynomial time respectively, so the algorithm is of polynomial complexity O(n3m). The method of extending the algorithm for constructing Hamiltonian circuits in general graphs will also be introduced. About 9600 examples of different scales (n=10~4000, m=20~8000) were tested in the last eight years to test the effectiveness of the algorithm and some typical examples are presented in this paper.
	TO cite this article:Xuanxi Ning,Angelika Ning. The Minimum Spanning Flow Model of the Hamiltonian Path Problem in a Digraph and its Polynomial Algorithm*[OL].[ 8 August 2006] http://en.paper.edu.cn/en_releasepaper/content/7851


	8. Study on Multi-UAV Coordination Model Based on Agent Organization
	Yang Shanlin ,Luo He ,Hu Xiaojian
	Computer Science and Technology 24 April 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In the UAV (Unmanned Air Vehicle) systems, Coordination is the key problem to fulfill the combat missions. Agent organization is a set of agents which are autonomous, reactive, social and active, it is an important technology to solve the coordination problems among multi entities. The paper studies the multi-UAV coordination problems in the agent technology, builds the agent structure model and the agent organization model. It suggests a multi-UAV coordination model and its formalized description based on agent organizaion as well. Further, the paper suggests to divide the coordination into three steps such as task coordination, role coordination and behaviour coordination, which reduce the complexity of coordination problem solving.
	TO cite this article:Yang Shanlin ,Luo He ,Hu Xiaojian . Study on Multi-UAV Coordination Model Based on Agent Organization[J].


	9. An Epidemic Model of Mobile Phone Virus
	Zheng Hui,Li Dong,Gao Zhuo
	Computer Science and Technology 11 April 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Considering the characteristics of mobile network, we import three important parameters: distribution density of mobile phone, coverage radius of Bluetooth signal and moving velocity of mobile phone to build an epidemic model of mobile phone virus which is different from the epidemic model of computer worm. Then analyzing different properties of this model with the change of parameters; discussing the epidemic threshold of mobile phone virus; presenting suggestions of quarantining the spreading of mobile phone virus.
	TO cite this article:Zheng Hui,Li Dong,Gao Zhuo. An Epidemic Model of Mobile Phone Virus[OL].[11 April 2006] http://en.paper.edu.cn/en_releasepaper/content/6178


	10. Knowledge, Knowledge Granulation in Information System
	Jiye Liang,Yuhua Qian
	Computer Science and Technology 10 April 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Granular computing is potentially used in knowledge discovery and data mining etc. Based on information system, the extent of closeness and difference between knowledge is measured by introducing the concepts of knowledge closeness and knowledge distance, the axiom definition of knowledge granulation is given, and several knowledge granulations are all special form under the definition. These results will be very helpful for understanding the essence of the granulation, and have important instructive significance for establishing granular computing in information system.
	TO cite this article:Jiye Liang,Yuhua Qian. Knowledge, Knowledge Granulation in Information System[OL].[10 April 2006] http://en.paper.edu.cn/en_releasepaper/content/6154

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