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

Results per page:

49 Total, 5 Pages | << First < Previous 1 2 3 4 5 Next > Last >>

Select Subject

All (8830)

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:

49 Total, 5 Pages | << First < Previous 1 2 3 4 5 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. A Destination-Oriented Multicast Trees Optimization Algorithm for Controlling P2P Traffic
	An Yuyan,LI Yue,Zhao Yuhui
	Computer Science and Technology 20 January 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:It is necessary to control the P2P traffic among ASs (Autonomous Systems) while the P2P applications occupy the most bandwidth of the backbone network. Instead of only restricting the P2P applications, the paper suggests an intelligent relay method based on P2P communities model. The Proxy of Content Caching (PCC) nodes is proposed which are used to manage the local content cache in the P2P communities. The problems of building the Core Overlay Multicast Tree (COMT) among the PCC nodes can be reduced to the Minimal Steiner Tree Problem (MSTP). For optimizing the multicast trees, the off-line genetic algorithm (GA) is adopted, which uses the destination-oriented method for represent chromosomes and genetic operators. Simulation experimental results show that our model can obtain a near optimal solution for COMT, which has the feathers of low bandwidth cost and high scalability.
	TO cite this article:An Yuyan,LI Yue,Zhao Yuhui. A Destination-Oriented Multicast Trees Optimization Algorithm for Controlling P2P Traffic[OL].[20 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4462349


	2. An Improved Infrared and Visible Images Registration Based on SURF Algorithm
	DENG Jixuan,CHENG Yongqiang,GUO Feng,XU Fengliang
	Computer Science and Technology 16 December 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: Image registration is the basis of image processing. As the Harris algorithm is depend on scale and the SIFT(Scale Invariant Feature Transform) Algorithm is depend on the hardware, an image registration based on SURF(Speeded Up Robust Features) algorithm is proposed. First, the correspondences are found by SURF algorithm. Second the descriptor is made by computing the sum of Haar wavelet responses. Then matching points are using Euclidean distance. To improve the matching speed, the features which have the same type of contrast are only compared. The effectiveness of the method is also verified by the experiment.
	TO cite this article:DENG Jixuan,CHENG Yongqiang,GUO Feng, et al. An Improved Infrared and Visible Images Registration Based on SURF Algorithm[OL].[16 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4456157

Saved Papers

Saved Papers


	3. Possibilistic Kripke Structure Decision Processes
	XUE Yan,LEI Hongxuan,LI Yongming
	Computer Science and Technology 14 November 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:We propose the concept of possibilistic Kripke structure decision process (PKSDP), PKSDP is a generalization of possibilistic Kripke structure (PKS), useful for modeling and quantifying the possible outcomes of random actions. We define the path in a PKSDP, scheduler, PKS of a PKSDP induced by a scheduler, memoryless scheduler, present the theory of reachability possibilities. We also address some examples of PKSDPs, Finally, we discuss the existence of optimal memoryless schedulers and value iteration for step-bounded reachability properties.
	TO cite this article:XUE Yan,LEI Hongxuan,LI Yongming. Possibilistic Kripke Structure Decision Processes[OL].[14 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4449954


	4. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm
	JIN Yu,HOU Wenjun,YANG Fuxing
	Computer Science and Technology 09 October 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:According to the characteristics and needs of complicated products, a method for handing assembly sequence based on improved Slope One algorithm was proposed. On the basis of that the network graph of assembly relationship was constructed, and a method for simplifying it was proposed by expressing elliptically same parts, identifying and hiding fasteners. In this paper, Slope One algorithm was initially introduced into the assembly sequence planning, and it was improved according to the problems to be resolved. In the meantime, particle swarm optimization algorithm was introduced into the feedback of the recommendation result. The method has been proved that it was not only used to obtain a good recommendation of assembly sequence but also sensitive to the individuation of designers.
	TO cite this article:JIN Yu,HOU Wenjun,YANG Fuxing. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm[OL].[ 9 October 2011] http://en.paper.edu.cn/en_releasepaper/content/4445176


	5. A Hybrid Ant Colony Optimization for Continuous Domains
	XIAO Jing,LI LiangPing
	Computer Science and Technology 11 July 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Research on optimization in continuous domains gains much of focus in swarm computation recently. A hybrid ant colony optimization approach which combines with the continuous population-based incremental learning and the differential evolution for continuous domains is proposed in this paper. It utilizes the ant population distribution and combines the continuous population-based incremental learning to dynamically generate the Gaussian probability density functions during evolution. To alleviate the less diversity problem in traditional population-based ant colony algorithms, differential evolution is employed to calculate Gaussian mean values for the next generation in the proposed method. Experimental results on a large set of test functions show that the new approach is promising and performs better than most of the state-of-the-art ACO algorithms do in continuous domains.
	TO cite this article:XIAO Jing,LI LiangPing. A Hybrid Ant Colony Optimization for Continuous Domains[J].


	6. An Overview of Mobile Information Presentation Techniques
	FENG Ling,QIAO Lin
	Computer Science and Technology 04 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The popularity of hand-held mobile devices is growing. Compared with traditional desktop computers, these mobile devices have distinct limitations, including tiny display, low resolution, scarce computing resources, bandwidth fluctuation, ad-hoc communication, voluntary disconnection, etc., presenting new challenges to mobile human-computer interaction. In this survey paper, we overview some recently developed techniques for diverse information presentation on mobile devices through visual, audio, and tactile channels.
	TO cite this article:FENG Ling,QIAO Lin. An Overview of Mobile Information Presentation Techniques[OL].[ 4 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4403669


	7. Visualizing Java Software Structure and Evolution
	Zhao Haizhou ,Ye Qi
	Computer Science and Technology 15 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Knowing the overall structure of software is important for program understanding. Packages represent the coarse-grained structure of a software system. For the sake of program comprehension, in this paper we show the software evolution process through dynamic visualizing the package dependencies by using directed graphs. Through visualizing the evolution of package dependencies, programmers can get a better understanding of what the legacy system is trying to do and when it is trying to change. We also propose a methodology, which is based on the connectivity of packages in the network, to get the roles of different packages more measurable. Through this method, we can get the common used packages and specialized packages easily. We can get the overall dependency and packages roles more intuitively through visualization, and then we can get grasp the overall structure of the system.
	TO cite this article:Zhao Haizhou ,Ye Qi . Visualizing Java Software Structure and Evolution[OL].[15 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4397377


	8. Protocol Security Testing with SPIN and TTCN-3
	Zhou Li,Wang Zhiliang,Yin Xia
	Computer Science and Technology 14 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Protocol security testing is an important technique to ensure the security of communication protocols. However, methods considering both effective detection to specification vulnerabilities and efficient testing on protocol implementations are not well developed. In this paper, we present a general method for protocol security testing including protocol verification with SPIN model checker and protocol testing with formal testing language TTCN-3. We use threat model to model malicious entities and import the classification of information security to achieve a complete analysis of security requirements for protocol verification. We also develop a SPIN Trail to TTCN-3(st2ttcn) convention tool to generate testcases automatically from counter examples obtained from model checking. As a case study, we apply our approach to the security testing of Source Address Validation Improvements (SAVI) protocol. We test two versions of SAVI-DHCP protocol. The result indicates that our method is effective and efficient.
	TO cite this article:Zhou Li,Wang Zhiliang,Yin Xia. Protocol Security Testing with SPIN and TTCN-3[OL].[14 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4396471


	9. Bilinear Lancros components for fast dimensionality reduction and features extraction
	Ren Chuanxian,Dai Daoqing
	Computer Science and Technology 06 September 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Generalized low rank approximation of matrix (GLRAM) method has received successful application in pattern recognition and machine learning. We use bidirectional Lanczos components to approximate the projective vectors obtained from eigenvalue decomposition in the GLRAM method, where every data points keep the form of two dimensional matrix, instead of one dimensional vectors, thus the time-consuming eigenvalue decomposition procedure is avoided. The method gradually reduces the Frobenius norm based reconstruction error criterion, and lead to the approximation converged to the accurate solution in a success of iterations. Experimental results on face recognition and image classification show that our proposed new method is very efficient and effective.
	TO cite this article:Ren Chuanxian,Dai Daoqing. Bilinear Lancros components for fast dimensionality reduction and features extraction[J].pattern recognition ，2010年，43卷，11期，3742 ~ 3752


	10. Bi-clustering for error-bounded linear patterns in gene expression data
	Zeng Tao ,Liu Juan
	Computer Science and Technology 13 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Bi-clustering is a hard problem in most research fields, especially in the study of gene expression patterns. Except the shifting patterns, along the broadening observations in the study of gene regulatory pathways, scaling patterns or even more general linear patterns are thought to be at least equal importance to investigate. Comparing with MSR only can identify shifting patterns, MMSE is a unified measurement to formal such three types of gene expression patterns. However, MMSE was originally used in node-add bi-clustering framework so that it’s not efficient enough. And in another way, most previous bi-clustering methods only output several first arriving bi-clusters to avoid redundancy in obtained bi-clusters, which can’t completely reveal the distribution of whole potential patterns. So this paper proposes the error-bounded linear gene expression patterns based on MMSE and an effective bi-clustering method (Error-bounded Bi-clustering abbreviate as EB) to enumerate these refined patterns. A widely experiments on 54 controlled synthesized data-sets and 3 yeast cell cycle data-sets strongly support that EB is well matched in strength of currently state-of-the-art clustering/bi-clustering methods according to their biological P-value evaluations; and EB also has the most significant background clusters’ recovery ability than many other bi-clustering methods.
	TO cite this article:Zeng Tao ,Liu Juan . Bi-clustering for error-bounded linear patterns in gene expression data[OL].[13 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41845

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