Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 72 papers published in subject: since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Study on Circle Detection Algorithm based on Data Dispersion | |||
WEI Youying,SHUAI Liguo,CHEN Huiling | |||
Computer Science and Technology 26 January 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Keywords: circle detection, center coordinates, dispersion To reduce time-consuming, a new algorithm for circle detection is proposed based on data dispersion. The center coordinates and radius can be detected with five steps in this algorithm precisely and quickly; firstly, to reduce the original circle to single-pixel width circle with image processing. Secondly, to calculate the center coordinates with three arbitrary points on the circle. There might be a deviation between the calculated center and real center. Thirdly, to determine a square area for the center coordinates computing with an experimental range and each pixel inside the square is a potential center. Fourthly, to compute the center with distance criterion and the center coordinate is determined when the variance reaches the minimum. Lastly, the radius is equal to the means of the distance vector with the minimum variance. Experiments are conducted and the results show that, comparing with the traditional Hough transform, the new algorit????? | |||
TO cite this article:WEI Youying,SHUAI Liguo,CHEN Huiling. Study on Circle Detection Algorithm based on Data Dispersion[OL].[26 January 2016] http://en.paper.edu.cn/en_releasepaper/content/4677465 |
2. Zooming image by a combination of bi-cubic polynomial with edges as twice constraints | |||
LIU Ye-Penguin, ZHANG Cai-Ming | |||
Computer Science and Technology 03 December 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The clarity and efficiency of the generated image is an important indicator which measures the quality of image zooming. Compared image which is obtained by existed zooming algorithm with the real images, it is more blurrier and consumes much time. On the basis of the existing scaling algorithm, this paper presents a zooming image by a combination of bi-cubic polynomial with edges as twice constraints algorithm. Algorithm is divided into two parts, in the first process, suppose the original scene surface corresponding to given data of the image can be represented by piecewise quadratic polynomial surface, and we can obtain the fitting surface by reversing of solving the image data. Then,by integrated to he fitting surface we can obtain a zooming image which is more blurrier in visual and fidelity. The initial image contains a lot of details of the information, but does not reflect visually. In the second process, it is the purpose that extracts the hide information and makes the image has better visual effect. By comparison, the new algorithm has better amplification effect and higher precision in visual, and spent less time. | |||
TO cite this article:LIU Ye-Penguin, ZHANG Cai-Ming. Zooming image by a combination of bi-cubic polynomial with edges as twice constraints[OL].[ 3 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4666447 |
3. A New Improved Algorithm for Secure Outsourcing of Modular Exponentiations | |||
Ye Jun, Chen Xiaofeng, Ma Jianfeng | |||
Computer Science and Technology 30 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Outsourcing computation allows for outsourced function evaluation from a resource-constrained client to a powerful server which may be not honest. The client invests some off-line computations to obtain a transformation of its function which is then passed to the server, who returns the result of the computation. In this paper we propose an outsourcing algorithm of modular exponentiations. In the computation process, the sensitive information during the modular exponentiation computation is hidden to the server, while the computation results can be efficiently verified by the client. | |||
TO cite this article:Ye Jun, Chen Xiaofeng, Ma Jianfeng. A New Improved Algorithm for Secure Outsourcing of Modular Exponentiations[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4626109 |
4. Design and Implementation of Semantic Resource Management Platform Based on LDAP | |||
WU Keqiao,LIU Chuanchang | |||
Computer Science and Technology 05 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the development of information technology, more and more social resources haven been information. But managing resources platforms with resource semantic annotation is infrequent. LDAP (Lightweight directory access protocol) is applied widely for its simplicity and integrity. OWL (Ontology Web Language) is widely used in the definition of ontology following the continually maturation of semantic web. With, its lightweight property, REST is usually selected to develop business service. So based on LDAP and ontology modeling, this paper provides a approach to design and implement SRMP (Semantic Resource Management Platform), and opens the CRUD (create, 3retrieve, update, delete) operation of resources with restful style. | |||
TO cite this article:WU Keqiao,LIU Chuanchang. Design and Implementation of Semantic Resource Management Platform Based on LDAP[OL].[ 5 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4620844 |
5. An Opposition Effective GSA Based Memetic Algorithm for Permutation Flow Shop Scheduling | |||
ZHOU Junping,WANG Huixian,SU Weihua | |||
Computer Science and Technology 25 February 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The permutation flow shop problem (PFSSP) is a well-known difficult combinatorial optimization problem. In this paper, we present a new hybrid optimization algorithm named OHGSA to solve the PFSSP. First, to make GSA suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous position in GSA to the discrete job permutation. Second, The NEH heuristic was combined the random initialization to initialize the population with certain quality and diversity. Third, to improve the convergence rate of GSA, the opposition-based DE employs opposition-based learning for the initialization and for generation jumping to enhance the global optimal solution. Fourth, the fast local search is used for enhancing the individuals with a certain probability. Additional-ly, Comparison with other results in the literature shows that the OHGSA is an ef-ficient and effective approach for the PFSSP. | |||
TO cite this article:ZHOU Junping,WANG Huixian,SU Weihua. An Opposition Effective GSA Based Memetic Algorithm for Permutation Flow Shop Scheduling[OL].[25 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4587358 |
6. On the Security of a Robust Certified Email System Based on Server-Supported Signature | |||
GUO Lifeng | |||
Computer Science and Technology 16 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Certified E-mail is a value-added service for standard e-mail systems, which allows a sender to deliver a message to a receiver in a fair way in the sense that either the sender gets a receipt from the receiver and the receiver accesses the content of the e-mail simultaneously, or neither party obtains the expected item. In ICICS'03, Yang et al. proposed a new certified e-mail system which alleviates computational overhead of mobile devices with limited computing power by server-supported signatures scheme. They claimed their scheme is fault-tolerant and robust against mobile adversary and conspiracy attacks. In this paper, we analyze their scheme and successfully identify several security flaws. Their scheme is vulnerable to conspiracy attacks by the sender colluding with a delegate. | |||
TO cite this article:GUO Lifeng. On the Security of a Robust Certified Email System Based on Server-Supported Signature[OL].[16 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4574522 |
7. MD5 Calculation and Decryption Using CUDA on GPU | |||
LEI Mingshan,JIANG Yanjun,GAO Zhanchun | |||
Computer Science and Technology 04 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:It is difficult to get the original information from a MD5 hash since MD5 is a one-way hash algorithm. MD5 decryption is based on MD5 calculation for brute force attack, which requires great computing resources. This paper presents an approach for MD5 calculation and decryption on GPU, which has high concurrency. The CUDA program performed on a PC with NVIDIA GTX 560TI graphics card. The experimental result has shown that the calculating speed is 150 million words per second, increasing from 10 to 20 times compared to program run on CPU (Core i7-950 @3.07GHz). GPU has great potential in future general-purpose computing and concurrent computing. | |||
TO cite this article:LEI Mingshan,JIANG Yanjun,GAO Zhanchun. MD5 Calculation and Decryption Using CUDA on GPU[OL].[ 4 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4573112 |
8. An Efficient Trip Planning Algorithm Under Constraints | |||
Jinling Bao,Xiaochun Yang,Bin Wang | |||
Computer Science and Technology 08 August 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The problem of trip planning has received wide concerns in recent years. More and more people require the service of automatically confirming the optimal tour route. When users assign the source and the destination, and the time limit of the tour, how can automatically decide the optimal tour route with the highest sum of the popularity scores of scenic spots. Current methods for trip planning are on the setting that providing with the route which is composed of the scenic spots to travel. These would work poorly for the pre-mentioned problem when the route satisfying the constraints can not be found. Thus we adjust the setting to giving the route composed of the scenic spots which users visit or simply pass by. Obviously, the modified problem would incur larger search cost as each scenic spot in the given route has two states. It can be demonstrated that this new problem is NP hard, making it difficult to find an efficient exact algorithm for the present. In this paper, we propose a greedy strategy based algorithm to solve the trip planning problem, and we also present an improved algorithm with better performance. The experimental results on synthesized and real data sets reveal that our algorithm is able to find the approximately optimal path in high efficiency. | |||
TO cite this article:Jinling Bao,Xiaochun Yang,Bin Wang. An Efficient Trip Planning Algorithm Under Constraints[OL].[ 8 August 2013] http://en.paper.edu.cn/en_releasepaper/content/4554413 |
9. Real-time Road Detection with Image Texture Analysis-based Vanishing Point Estimation | |||
ZU Zhaozi,XUE Jianru,CUI Dixiao | |||
Computer Science and Technology 13 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Visual perception is a key component of an autonomous vehicle system. Road detection is an essential function of a visual navigation system for an autonomous vehicle. In most cases detecting lane markings is one feasible and efficient approach to road detection. However, in some situation, for example, many rural roads have no lane markings. Furthermore, lacking of sharp, smooth edges and homogeneous surface brings difficulties to road detection. A texture analysis based vanishing point estimation method is used to detect road in this paper. The idea is that consistency in texture leads to the vanishing point in an image. The method uses the Sobel filter to compute the texture orientations. Then the vanishing point of the road is voted from the orientation of the texture. Finally, the vanishing point is used to constrain the searching of two road boundaries since they pass through the vanishing point. | |||
TO cite this article:ZU Zhaozi,XUE Jianru,CUI Dixiao. Real-time Road Detection with Image Texture Analysis-based Vanishing Point Estimation[OL].[13 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4506414 |
10. A Malware Detection Algorithm Based on Multi-view Fusion | |||
Guo Shanqing,Yu Qixia,Lin Fengbo,Wang Fengyu,Ban Tao | |||
Computer Science and Technology 05 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:One of the major problems concerning information assurance is malicious code. In order to detect them, many existing run-time intrusion or malware detection techniques utilize information available in Application Programming Interface (API) call sequences to discriminate between benign and malicious processes. Although some great progresses have been made, the new research results of ensemble learning make it possible to design better malware detection algorithm. This paper present a novel approach of detecting malwares using API call sequences. Basing on the fact that the API call sequences of a software show local property when doing network, file IO and other operations, we first divide the API call sequences of a malware into seven subsequences, and then use each subsequence to build a classification model. After these building models are used to classify software, their outputs are combined by using BKS and the final fusion results will be used to label whether a software is malicious or not. Experiments show that our algorithm can detect known malware effectively. | |||
TO cite this article:Guo Shanqing,Yu Qixia,Lin Fengbo, et al. A Malware Detection Algorithm Based on Multi-view Fusion[OL].[ 5 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4504580 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated