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 > Basic-Subject-of-Computer-science-and-technology

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

Results per page:

133 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

Algorithm Theory(22)
Automata Theory(1)
Computability Theory(4)
Computer Reliability Theory(4)
Data Security and Compute...(76)
Data Structure(0)
Other Subjects of Basic S...(13)

Rank

Results per page:

133 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. Decision Procedure for Propositional Projection Temporal Logic with Infinite Models
	Duan Zhenhua,Tian Cong
	Computer Science and Technology 16 November 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper investigates the satisfiability of Propositional Projection Temporal Logic (PPTL) with infinite models. A decision procedure for PPTL formulas is formalized. To this end, Normal Form (NF) and Normal Form Graph (NFG) for PPTL formulas are defined and an algorithm constructing NFGs for PPTL formulas is presented. In addition, examples are also given to illustrate how the decision algorithm works.
	TO cite this article:Duan Zhenhua,Tian Cong. Decision Procedure for Propositional Projection Temporal Logic with Infinite Models[OL].[16 November 2006] http://en.paper.edu.cn/en_releasepaper/content/9625


	2. Satisfiablity of Propositional Projection Temporal Logic
	Duan Zhenhua,Zhang Li
	Computer Science and Technology 16 November 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper investigates the decision procedure for checking the satisfiability of Propositional Projection Temporal Logic (PPTL). The syntax, semantics and logic laws of PPTL are presented. Within this logic, besides the usual logic connectives, two basic temporal operators, O and prj are introduced. A normal form of PPTL is formalized and a proof for transforming a formula of PPTL into the normal form is given by induction on the structure of formulas in details. An algorithm transforming a formula into the normal form is presented. To find out a model for a given formula, the notation of Normal Form Graph (NFG) and an algorithm constructing NFG for the formula are introduced. A decision procedure for checking the satisfiability of PPTL formulas with finite models is demonstrated and some examples are given to illustrate how the algorithms work.
	TO cite this article:Duan Zhenhua,Zhang Li. Satisfiablity of Propositional Projection Temporal Logic[OL].[16 November 2006] http://en.paper.edu.cn/en_releasepaper/content/9608

Saved Papers

Saved Papers


	3. The crossing numbers of generalized Petersen graphs with
	Lin Xiaohui,Yang Yuansheng,陆维明
	Computer Science and Technology 29 October 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The generalized Petersen graph $P(n,k)$ is an undirected graph on $2n$ vertices with $V(P(n,k)) =\{a_{i},b_{i}:0 \leq i \leq n-1\} $ and $ E(P(n,k))=\{a_{i}b_{i},a_{i}a_{i+1},b_{i}b_{i+k}:0 \leq i \leq n-1,$ subscripts module $n \}$. Fiorini claimed to have determined the crossing numbers of $P(n,3)$ and showed all the values of $cr(P(n,k))$ for $n$ up to 14, except 12 values unknown. M. Lovre\v{c}i\v{c} Sara\v{z}in proved $cr(P(10,4))=cr(P(10,6))=4$. Richter and Salazar found a gap in Fiorini
	TO cite this article:Lin Xiaohui,Yang Yuansheng,陆维明. The crossing numbers of generalized Petersen graphs with[OL].[29 October 2006] http://en.paper.edu.cn/en_releasepaper/content/9093


	4. On harmonious labelings of the double triangular snake
	Xi Yue,Yang Yuansheng,Xu Xirong,Mu Ming
	Computer Science and Technology 27 October 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A triangular snake has been defined as a connected graph in which all blocks are triangles and the block-cut point graph is a path. David Moulton proved that triangular snakes with p triangles are graceful if p is congruent to 0 or 1 modulo 4. Xu proved that they are harmonious if and only if p is congruent to 0, 1 or 3 modulo 4. A double triangular snake is a graph formed by two triangular snakes have a common path. In this paper, we prove that all double triangular snakes are harmonious.
	TO cite this article:Xi Yue,Yang Yuansheng,Xu Xirong, et al. On harmonious labelings of the double triangular snake[OL].[27 October 2006] http://en.paper.edu.cn/en_releasepaper/content/9052


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


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


	7. A Fast Attack on the MD5 Hash Function
	Wang Zhangyi,Zhang Huanguo,Qin Zhongping ,Meng Qingshu
	Computer Science and Technology 29 March 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:MD5 is a hash function proposed by Rivest in 1992 [2]. In 2004, two-block collisions of MD5 were presented by Wang et al [8]. This paper builds on the work presented in Ref [8-10]. In this paper, firstly we discuss the sufficient conditions for keeping desired differential path. By analyzing the expanding of subtraction difference, differential characters of Boolean functions, and the differential characters of shift rotation, the sufficient conditions for keeping desired differential path could be obtained. From the differential characters of shift rotation, we find the lacked sufficient conditions in Ref [10]. Then we present an algorithm that reduces the number of trials for finding collisions.
	TO cite this article:Wang Zhangyi,Zhang Huanguo,Qin Zhongping , et al. A Fast Attack on the MD5 Hash Function[OL].[29 March 2006] http://en.paper.edu.cn/en_releasepaper/content/5977


	8. The Security Analysis and Improvement on Remote Dial-In Access System
	Zhao Yuting,Dai Guanzhong ,Yang Deming,Chen Wu,Mu Dejun
	Computer Science and Technology 22 March 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The large computation of RADIUS (Remote Access Dial-In User Service) implementation results in a high misappropriation risk of user accounts from RADIUS administrators and the low efficiency of user authentication. The analysis and improvement of RADIUS are proposed and implemented to reduce the complexity of authentication program, enhance the efficiency of system and avoid the misappropriation risk from RADIUS administrators.
	TO cite this article:Zhao Yuting,Dai Guanzhong ,Yang Deming, et al. The Security Analysis and Improvement on Remote Dial-In Access System[OL].[22 March 2006] http://en.paper.edu.cn/en_releasepaper/content/5855


	9. A Modified Shifting Bottleneck Procedure for Job Shop Scheduling
	Zhi Huang
	Computer Science and Technology 12 December 2005
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, the job shop scheduling problem with the objective to minimize the makespan is discussed. The theorem, which guarantees the shifting bottleneck procedure (SB) with Schrage one-machine sequencing algorithm always obtains the feasible solution for any instance, is concisely proven. A counterexample is given to show that SB with Carlier’s one-machine sequencing algorithm could get the infeasible solution. By the way, we also point out a mistake made in the Carlier’s theorem which Carlier’s algorithm is based on, and complete it by some modifications. In order to overcome the infeasibility weakness of SB and expect better performance, a modified shifting bottleneck procedure (MSB) for job shop scheduling is proposed. The theorem, which ensures MSB get the feasible solution for any instance of the problem, is testified. MSB is tested on a group of benchmark instances. The computational experiment shows that MSB get better solutions than SB.
	TO cite this article:Zhi Huang. A Modified Shifting Bottleneck Procedure for Job Shop Scheduling[OL].[12 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4260


	10. A Robust (k, n) Treshold Key Escrow Scheme
	Zhenfu Cao,Yu Long
	Computer Science and Technology 30 November 2005
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:By means of an improved RSA cryptosystem, a new robust threshold key escrow scheme is proposed with a trusted key management center. In this scheme, the problem of "once monitor, monitor forever" and the problem of "user
	TO cite this article:Zhenfu Cao,Yu Long. A Robust (k, n) Treshold Key Escrow Scheme[OL].[30 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3963

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