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 > Algorithm-Theory

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

Results per page:

22 Total, 3 Pages | << First < Previous 1 2 3 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)

Rank

Results per page:

22 Total, 3 Pages | << First < Previous 1 2 3 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 Algorithm for the Special Case of Two-sided SF-MNSA Problem
	LIU Nan,ZHU Da-Ming
	Computer Science and Technology 16 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Scaffold filling is a new combinatorial optimization problem in genome sequencing and can improve the integrity of the sequencing results.The two-sided Scaffold Filling to Maximize the Number of String Adjacencies(SF-MNSA) problem can be described as: given two incomplete gene sequences $A$ and $B$, respectively fill the missing genes into $A$ and $B$ such that the number of adjacencies between the resulting sequences $A'$ and $B'$ is maximized.The two-sided scaffold filling problem is NP-complete for genomes with duplicated genes and there is no effective approximation algorithm.In this paper, a new version problem is proposed that symbol # is added to each endpoint of each input sequence for any instance of two-sided SF-MNSA problem and a polynomial algorithm for the special instance of this new version problem is designed and proved.
	TO cite this article:LIU Nan,ZHU Da-Ming. The Algorithm for the Special Case of Two-sided SF-MNSA Problem[OL].[16 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4512994


	2. A Constructive Algorithm to Prove P=NP
	Duan Wenqi
	Computer Science and Technology 01 August 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:After reducing the undirected Hamiltonian cycle problem into the TSP problem with cost 0 or 1, we developed an effective algorithm to compute the optimal tour of the transformed TSP. Our algorithm is described as a growth process: initially, constructing 4-vertexes optimal tour; next, one new vertex being added into the optimal tour in such a way to obtain the new optimal tour; then, repeating the previous step until all vertexes are included into the optimal tour. This paper has shown that our constructive algorithm can solve the undirected Hamiltonian cycle problem in polynomial time. According to Cook-Levin theorem, we argue that we have provided a constructive proof of P=NP.
	TO cite this article:Duan Wenqi. A Constructive Algorithm to Prove P=NP[OL].[ 1 August 2012] http://en.paper.edu.cn/en_releasepaper/content/4485654

Saved Papers

Saved Papers


	3. Probabilistic Connection Game on Planar Graph
	Yuan Chen,Yang Yi,Li Yuan,Kan Haibin
	Computer Science and Technology 24 May 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A connection game is a type of abstract strategy game in whichplayers attempt to complete a specific type of connection with theirpieces, such as Gonnect, Hex, Shannon switching game, tic-tac-toeand so on. In this paper, we propose a new connection game on a concave-polygon-freeplanar graph, where one player is based on edge connectivity and theother is based on vertex connectivity. Instead of playing in turn,they begin their turns according by tossing a biased coin. We prove that the new connection game are well defined i.e., the game cannot end in a tie. To oursurprise, we show that the fair probability is closely connectedwith percolation threshold, a mathematical term related to percolation theory which is the formation of long-range connectivity in random systems. Furthermore, a dynamic programming algorithm is presented to compute the fair probability of an arbitrary planar graph .
	TO cite this article:Yuan Chen,Yang Yi,Li Yuan, et al. Probabilistic Connection Game on Planar Graph[OL].[24 May 2012] http://en.paper.edu.cn/en_releasepaper/content/4478889


	4. Towards the Construction Problem of ISTs on M?bius Cubes
	Cheng Baolei ,Fan Jianxi
	Computer Science and Technology 01 April 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Multiple independent spanning trees (ISTs) can be used in broadcasting schemes and distribution protocals to provide high levels of fault-tolerance and security, respectively. Some results have been found on Qn,LTQn,TQn, etc, but so far no work has been reported on 0-Mn . In this paper, we study the exitence and construction of ISTs on Möbius cubes. We give a proof of the existence of ISTs rooted at vertex 0 on the n-dimentional Möbius cube 0-Mn and propose an O(NlogN) recursive algorithm, where n≥2 and N=2n is the number of vertices in 0-Mn.
	TO cite this article:Cheng Baolei ,Fan Jianxi . Towards the Construction Problem of ISTs on M?bius Cubes[OL].[ 1 April 2011] http://en.paper.edu.cn/en_releasepaper/content/4419721


	5. Reserch On An Efficient RSS Localization Algorithm Based On WIFI
	Wang He
	Computer Science and Technology 12 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The localization accuracy and calculating time is the key fact in the WIFI localization system for indoor environment. In this paper, a new method is proposed to improve the performance of WIFI localization system by design TDOA in RSS-map. This method simplifies the process of estimating the coordinate of the object in RSS-map; meanwhile it utilizes all measured values to improve the localization accuracy by chan algorithm. The better performance of the method is shown by the data collected in simulations with various conditions of communication.
	TO cite this article:Wang He. Reserch On An Efficient RSS Localization Algorithm Based On WIFI[OL].[12 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4397164


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


	7. A Novel Hybrid Particle Swarm Optimization Algorithm
	Yalan Zhou,Jiahai Wang,Jian Yin
	Computer Science and Technology 28 May 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a framework of hybrid particle swarm optimization algorithm, called HQGPSO, is proposed by reasonably combining the Q-bit evolutionary search of quantum particle swarm optimization (QPSO) algorithm and binary bit evolutionary search of genetic particle swarm optimization (GPSO) in order to achieve better optimization performances. The proposed HQGPSO also can be viewed as a kind of hybridization of micro-space based search and macro-space based search, which enriches the searching behavior to enhance and balance the exploration and exploitation abilities in the whole searching space. To demonstrate its performance, experiments are carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that the proposed algorithm has superior performance to other discrete particle swarm algorithms.
	TO cite this article:Yalan Zhou,Jiahai Wang,Jian Yin. A Novel Hybrid Particle Swarm Optimization Algorithm[OL].[28 May 2007] http://en.paper.edu.cn/en_releasepaper/content/13087


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


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


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

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