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-Applications

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

Results per page:

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

Select Subject

All (8831)

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

Chinese Language Informat...(2)
Computer Aided Design(13)
Computer Decision Support...(4)
Computer Graphics(9)
Computer Image Processing(67)
Computer Information Mana...(2)
Computer Process Control(0)
Computer Simulation(13)
Other Subjects of Compute...(25)

Rank

Results per page:

52 Total, 6 Pages | << First < Previous 1 2 3 4 5 6 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. Adaptive Tag Ranking based on Saliency Analysis
	ZHAO Ripeng,SONG Zehai,FENG Songhe
	Computer Science and Technology 25 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Tag ranking has become a hot research topic due to its importance for image analysis and retrieval. Existing annotation methods about tag ranking can be roughly classified into two categories: tag relevance ranking and tag saliency ranking. Both methods have pros and cons. In this paper, we propose an adaptive tag ranking based on saliency analysis which combines the advantages of tag relevance ranking and tag saliency ranking. The main idea behind the approach is apparently simple. In short, to the given image, we first carry out image salient region detection and image saliency analysis by machine learning techno-logies like Support Vector Machine (SVM). If there exist visually salient regions of the given image, the corresponding annotated tags can be ranked according to the saliency property of the corresponding visual content; else tags can be ranked according to the relevance scores to the content of the image. The performance will be better than existing methods. To demonstrate the effectiveness and efficiency of the proposed algorithm, we do experiments on the COREL and MSRC image datasets.
	TO cite this article:ZHAO Ripeng,SONG Zehai,FENG Songhe. Adaptive Tag Ranking based on Saliency Analysis[OL].[25 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4476147


	2. A Fast Algorithm for Fractional-order Total Variation Based Multiplicative Noise Removal
	Zhang Jun,Wei Zhihui
	Computer Science and Technology 31 December 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, using the operator splitting technique, we propose a fast alternating iterative algorithm for the fractional-order total variation regularized model with general fidelity term. As an application, we use the new algorithm to solve two models for multiplicative noise removal with different fidelity terms. To improve the performance, we choose the parameters adaptively and propose an adaptive algorithm for multiplicative noise removal. Numerical results show that the new algorithm with fixed parameters has low computational cost. The adaptive algorithms can not only remove the noise and eliminate the staircase effect in the non-textured region, but also preserve the textures well in the textured region, and therefore can improve the result visually efficiently.
	TO cite this article:Zhang Jun,Wei Zhihui. A Fast Algorithm for Fractional-order Total Variation Based Multiplicative Noise Removal[OL].[31 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4457900

Saved Papers

Saved Papers


	3. A Novel Graph Isomorphism Algorithm Based on Feature Selection in Network Motif Discovery
	HU Jialu,SUN Ling,YU Liang,GAO Lin
	Computer Science and Technology 27 August 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Motifs are small connected subnetworks that occur in significantly higher frequencies than in random networks. For finding motifs, we have to count the subnetwork frequencies, which conduct graph isomorphism. However, subgraph isomorphism remains a challenging problem. In this paper, we present a new heuristic algorithm based on feature selection to cluster huge amounts of graphs into isomorphic categories. Firstly, four rich-information features of graphs, MinB, πa, πp and SFeature, are constructed to reducing the searching space and complexity. Then , two feature combination approaches FCCG ( feature compression for clustering graphs ）and FVCG (feature vector for clustering graphs) are introduced to canonically label graphs using these features. Finally, we implement five kinds of feature combinations on a synthetically generated database to evaluate the performance of the algorithm. Experiment results show that our new algorithms can precisely and effectively solve the graph isomorphism problem for both the directed and undirected graphs. Furthermore, we test the algorithm for motif detection in Saccharomyces cerevisiae gene regulatory network. Network motifs which are theoretically and experimentally proved to be of great significance are successfully detected.
	TO cite this article:HU Jialu,SUN Ling,YU Liang, et al. A Novel Graph Isomorphism Algorithm Based on Feature Selection in Network Motif Discovery[OL].[27 August 2011] http://en.paper.edu.cn/en_releasepaper/content/4441016


	4. Mining and Visualizing Uncertain Data Based on Self-Organizing Maps
	Yu Zhiwen
	Computer Science and Technology 13 April 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recently, mining uncertain data is gaining considerable attention due to more and more applications, such as sensor database, location database, biometric information systems, produce uncertain data. Though there exist a lot of approaches to cluster the uncertain data, none of them address mining and visualizing uncertain data. In this paper, we propose a new neural network algorithm called uncertain self-organizing map (USOM) which combines fuzzy distance function and self-organizing map to mine and visualize the uncertain data. The self-organizing map assigns the high dimensional data to the corresponding neurons and projects them on a low-dimensional grid which consists of the neurons. Each neuron is viewed as a small cluster which is a collection of the uncertain data. We merge the neurons in the low-dimensional grid to form the bigger clusters by minimal spanning tree. The experiments show that the new approaches works well in the uncertain dataset.
	TO cite this article:Yu Zhiwen. Mining and Visualizing Uncertain Data Based on Self-Organizing Maps[OL].[13 April 2011] http://en.paper.edu.cn/en_releasepaper/content/4416888


	5. Adjacency Sampling: A Scalable Line Drawing Kernel with Artifact Reduced
	Tang Chen,Li Sheng
	Computer Science and Technology 17 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper we exploit sampling topology information in image space directly for visibility of line drawing and silhouette extraction. We propose a new line drawing kernel that depends on image-space adjacency test between primitives in GPU without any preprocessing step or extra adjacent information prestored. By this kernel, our visibility test acquires high accuracy in wireframe rendering and performs fairly well also in sketch and stylized line drawing, and our silhouette extraction method extracts visible portion of silhouette edges in image-space with clear and regular outlook. Our methods can be easily implemented and be controlled. The experiments show the privileges of our method in line drawing.
	TO cite this article:Tang Chen,Li Sheng. Adjacency Sampling: A Scalable Line Drawing Kernel with Artifact Reduced[OL].[17 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4406859


	6. Semi-Split Bregman Iteration Algorithm for Image Denoising
	Zhang Jun,Wei Zhihui
	Computer Science and Technology 26 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The split Bregman iteration has been demonstrated to be an efficient tool for solving total variation regularized minimization problems. In denosing case, it can remove noise efficiently, but it can not preserve textures well. In this paper, we analyze the split Bregman method from the perspective of function matching, and reveal the reason why it can not preserve textures well. Based on this analysis, we develop a new method called the semi-split Bregman iteration algorithm for image denoising. The numerical results show that the semi-split Bregman iteration algorithm can preserve the textures and improve the peak signal to noise ratio efficiently in the processing of denoising.
	TO cite this article:Zhang Jun,Wei Zhihui. Semi-Split Bregman Iteration Algorithm for Image Denoising[OL].[26 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4401265


	7. A Discretization Algorithm Based on Information Distance Criterion and Ant Colony Optimization Algorithm
	Jia Lixin,Zhu Wenzhi
	Computer Science and Technology 27 July 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Discretization algorithms have played an important role in data mining, which is widely applied in industrial control. Since the current discretization methods can not accurately reflect the degree of the class-attribute interdependency of the industrial database, a new discretization algorithm, which is based on information distance criterion and ant colony optimization algorithm(ACO), is proposed. The paper analyses the information measures of the interdependence between two discrete variables, and an improved information distance criterion is generated to evaluate the class-attribute interdependency of the discretization scheme. In the algorithm, The ACO is applied to detect the optimal discretization scheme, and a new pheromone matrix is defined on the construction of the optimization, and an effective heuristic values assignment approach, which is used with the criterion values of discretization scheme, is proposed. We performed the experiments on a real industrial database. Experiment results verify that the proposed algorithm can produce a better discretization results.
	TO cite this article:Jia Lixin,Zhu Wenzhi. A Discretization Algorithm Based on Information Distance Criterion and Ant Colony Optimization Algorithm[OL].[27 July 2010] http://en.paper.edu.cn/en_releasepaper/content/4380070


	8. Two Improved Proxy Multi-signature Schemes Based on the Elliptic Curve Cryptosystem
	Xue Qingshui ,Li Fengying ,Cao Zhenfu
	Computer Science and Technology 06 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In a proxy signature scheme, one original signer delegates a proxy signer to sign messages on behalf of the original signer. In a proxy multi-signature scheme, n original signers cooperate to delegate their signing power to one proxy signer. In 2003, Chen, Chung and Huang proposed one proxy-protected proxy multi-signature scheme (CCH1 scheme) based on the elliptic curve cryptosystem. Park et al. pointed out that CCH1 scheme is insecure, however, they couldn’t provide a modified scheme or new schemes. To resist the forgery attack from the original signer proposed by Park et al., based on CCH1 scheme, one improved scheme is proposed. In 2004, Chen, Chung and Huang proposed another proxy multi-signature scheme (CCH2 scheme) also based on the elliptic curve cryptosystem. By security analysis, Park et al. showed that CCH2 scheme can’t resist the conspiracy attack from all original signers. As to CCH2 scheme, Park et al. neither provided an improved version or new version. Based on CCH2 scheme, a modified scheme is brought forward.
	TO cite this article:Xue Qingshui ,Li Fengying ,Cao Zhenfu . Two Improved Proxy Multi-signature Schemes Based on the Elliptic Curve Cryptosystem[OL].[ 6 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41559


	9. Applying Collaborative Filtering Techniques for Individual Fashion ecommendation
	Lei Jianlan,Wang Jin,Lu Guodong
	Computer Science and Technology 28 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Collaborative filtering (CF) technique is the most successful method for recommendation system. In this article, we developed a fashion recommendation system by using CF technique. In order to improve on data sparseness problems in CF technique, firstly we built users’ similarities based on users’ background information which is related with fashion, then the neighbors’ predicting ratings were filled into the U-I rating matrix in advance before the traditional collaborative filtering. While computing the background information similarities, we develop a hybrid similarity model which can deal with different types of properties. The method can solve the data sparseness of U-I rating matrix effectively.
	TO cite this article:Lei Jianlan,Wang Jin,Lu Guodong. Applying Collaborative Filtering Techniques for Individual Fashion ecommendation[OL].[28 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38147


	10. TRIZ in 3D Garment CAD
	Li Weilong,Wang Jin,Lu Guodong
	Computer Science and Technology 28 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The 40 inventive principles of TRIZ are useful methods for solving engineering design problem. 3D garment CAD is significant for improve the efficiency and level of fashion design. This article describes the application of these principles of TRIZ in three-dimensional garment CAD. Based on the characteristics and requirements of fashion design, the author analyze the basic meaning of these inventive principles, and use them in the research and application three-dimensional garment CAD, such as decomposition and combination of apparel components, clothing structural design, setting of clothing color and pattern library, inter-conversion between three-dimensional mesh of clothing and two-dimensional pieces and so on. Some examples show that the application of these principles is feasible and effective.
	TO cite this article:Li Weilong,Wang Jin,Lu Guodong. TRIZ in 3D Garment CAD[OL].[28 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38143

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