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 2 3 4 5

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 2 3 4 5

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. Location-aware Routing for Pocket Switched Networks
	Ye Tian,Jiang Li
	Computer Science and Technology 26 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we seek to understand the reasons causing failures and delays of message delivery in Pocket Switched Networks (PSN), and to use this understanding for improving the network. By studying two real-world datasets, we find that node isolation is prevalent in PSN networks, which largely accounts for the inefficiencies in message delivery. In addition, by analyzing nodes’ contact-location relationship, we find that individual and system-wide key locations exist and their existence suggests potential improvements in message routing. Motivated by our observation, we design a location assisted routing scheme for PSN networks. With simulation-based experiments using real-world and synthetic contact traces, we compare the proposal with other representative routing schemes, and show that with the awareness of the location information, the proposed solution could deliver more messages within shorter delays, thus improves the network remarkably.
	TO cite this article:Ye Tian,Jiang Li. Location-aware Routing for Pocket Switched Networks[OL].[26 January 2010] http://en.paper.edu.cn/en_releasepaper/content/39480


	2. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks
	Wu Wanrong ,Wang Qianping ,Wang Wei ,Su Yu-e ,Hao Li
	Computer Science and Technology 11 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In wireless sensor networks, energy efficiency is an important standard for evaluating the effectiveness of the time synchronization protocols. Hence, energy should be conserved as much as possible provided that algorithm can achieve a certain accuracy. In this paper, we propose an energy efficient time synchronization algorithm in which each layer of the network can be synchronized merely by receiving broadcast messages rather than relying on two-way message exchange. Simulation result shows that our improved strategy reduced the energy consumption and prolonged the lifetime of network compared with TPSN
	TO cite this article:Wu Wanrong ,Wang Qianping ,Wang Wei , et al. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks[OL].[11 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35128

Saved Papers

Saved Papers


	3. Feature-Distance-Based Region Matching Interpolation of Multidimensional Grey-Level Images
	Su Yong,Zhang Caiming
	Computer Science and Technology 18 June 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Image interpolation plays an important role in three-dimensional reconstruction, and the interpolation results have a great impact on the reconstruction directly. A feature-distance-based region matching interpolation method is presented in this paper: First, the corresponding relation between the interpolated images is built by an optimization process which is based on the gray value, the gradient of the gray value, the gradient direction in neighboring slices and the gray-scale continuous threshold which is set to get the paired points. Second, for the best-matching point pair, linear interpolation, and for the worst-matching point pair, we calculate the shortest feature distance to the relative feature points and use the shortest feature distance to control the image interpolation. The results show that the new method does not require the image shape information and can improve the image fuzzy border problem of internal organs and enhance the quality of the interpolated images.
	TO cite this article:Su Yong,Zhang Caiming. Feature-Distance-Based Region Matching Interpolation of Multidimensional Grey-Level Images[OL].[18 June 2009] http://en.paper.edu.cn/en_releasepaper/content/33255


	4. Calculating Eigenpairs of Real skew symmetric matrices by Neural Networks
	Liu Yiguang
	Computer Science and Technology 09 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a novel approach is presented to extract all eigenpairs of real skew symmetric matrices. Firstly, a functional neural network model is designed to calculate the eigenvalue whose imaginary part is the largest, and the associated eigenvector. In the next runs, by building initial vectors using known eigenvectors, all eigenvalues which have positive imaginary parts and the associated eigenvectors are obtained. Then, by the conjugate property, all eigenpairs are known. Compared with other approaches, the proposed method does not need to construct matrix series. Finally, two examples are employed to illustrate the effectiveness of the approach.
	TO cite this article:Liu Yiguang . Calculating Eigenpairs of Real skew symmetric matrices by Neural Networks[OL].[ 9 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28632


	5. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner
	Xiaoyun Chen,Huiling Liu,Pengfei Chen,Longjie Li
	Computer Science and Technology 02 September 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we present a novel data-mining algorithm, called LPS-Miner, to mine the complete frequent patterns in the transaction database. LPS-Miner algorithm bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light Partial-Support FP-Tree Forest) to present the database. LPS-FP-Tree is a variation of FP-Tree with lighter and unidirectional nodes and mining process depends on partial-support of the patterns. The algorithm adopts partition and divide-and-conquer strategies in maximum, which decomposes the mining task into a set of smaller tasks. The light data structure and the efficient memory management mechanism keep the memory usage stable and efficient. Moreover, other implementation-based optimizations, such as pruning and outputting-optimization, make the algorithm achieve high efficiency. We test our c++ implementation of this algorithm versus several other algorithms on four datasets. The experimental results show that our algorithm has better space and time efficiency.
	TO cite this article:Xiaoyun Chen,Huiling Liu,Pengfei Chen, et al. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner[OL].[ 2 September 2008] http://en.paper.edu.cn/en_releasepaper/content/23675


	6. Sublingual Vein Segmentation Based on Color Features
	Zifei Yan,Kuanquan Wang,Naimin Li
	Computer Science and Technology 06 January 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The Sublingual Vein Diagnosis, one part of Tongue Diagnosis, plays an important role in deciding the healthy condition of humans. So far, extensive studies have been made on extracting tongue surface features, but rarely refer to sublingual vein that is also diagnostically important. This paper presents two approaches to segment the sublingual veins taking the color features of sublingual images into consideration. Experimental results show that, sublingual vein structures can been successfully mapped for 129 out of 150 patients and healthy subjects, when utilizing u component and S component for segmentation, and the average segmentation rate is up to 86%.
	TO cite this article:Zifei Yan,Kuanquan Wang,Naimin Li. Sublingual Vein Segmentation Based on Color Features[OL].[ 6 January 2008] http://en.paper.edu.cn/en_releasepaper/content/17785


	7. Advanced Framework for Iterative Hash Functions---C-hash
	Zhimin Li,Bo Yang,Lin Li,Shihui Zheng,Yixian Yang,Zhang Zhihui
	Computer Science and Technology 14 November 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we study the cryptanalytical techniques to perform Joux multi-collision, Kelsey and Schneier generic long message second preimage attack and Kelsey and Kohno herding attack on the Merkle-Damgard construction as well as its variants with XOR-linear/additive checksums and propose an advanced Merkle-Damgard construction, C-hash, by changing the feedback addition value, which can add the computation complexity of the generic attacks, compared with Merkle-Damgard construction and its variants.
	TO cite this article:Zhimin Li,Bo Yang,Lin Li, et al. Advanced Framework for Iterative Hash Functions---C-hash[OL].[14 November 2007] http://en.paper.edu.cn/en_releasepaper/content/16347


	8. The Research on Using STK to the Simulation of Interference in Satellite Communication
	Shi Zhiliang
	Computer Science and Technology 16 March 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The purpose of the simulation of the interference in the satellite communication is to determine the affection of the interference. This paper puts forward a method of the simulation of the interference in the satellite communication using STK/Comm., builds a scenario and analyses the effect of the interference.
	TO cite this article:Shi Zhiliang. The Research on Using STK to the Simulation of Interference in Satellite Communication [OL].[16 March 2007] http://en.paper.edu.cn/en_releasepaper/content/11472


	9. Ensemble Learning Based On The Sensitivity Of Neural Network
	tangjia
	Computer Science and Technology 06 February 2007
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Ensemble Learning to construct the learner in regression and classification is a hot research topic in machine learning in recent years, it has been proved empirically and theoretically to improve the generalization of learner in both regression and classification significantly, most of the methods to create Ensemble Learner by manipulating the training data, the architecture, the output of the neural network and others as evolutionary methods etc. Here, we present a new method to construct the ensemble learner through the behavior of the neural network-- the sensitivity of neural network that represents the nature of the neural network to some extent, and we give four measures based on the sensitivity of the neural network to select the neural network to represent the whole available neural network, some experiments based on the UCI benchmark prove that compare to the classic ensemble approaches as Bagging and Boosting , our method greatly improve the generalization of neural network ensembles and far smaller size both in regression and classification, the result of this paper gives us more suggestions that maybe we can pay more attention on the inhesion of neural network to construct the ensemble neural network with high diversity.
	TO cite this article:tangjia. Ensemble Learning Based On The Sensitivity Of Neural Network[OL].[ 6 February 2007] http://en.paper.edu.cn/en_releasepaper/content/11059

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