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 84 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. A Parallel Algorithm for DNA Sequences Alignment Based on MPI | |||
Xue Qianfei,Xie Jiang,Shu Junhui,Zhang Huiran,Dai Dongbo,Wu Xing,Zhang Wu | |||
Computer Science and Technology 24 March 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:DNA sequences have the fundamental information for each species and a comparison between DNA sequences is one of the basic biological problems. There are a large number of algorithms applied in sequence alignment. Some are for approximate alignment, and others are for exact alignment, which also plays an important role in biology research. In this paper, a new parallel algorithm based on FED algorithm for exact sequences alignment with MPI is proposed. The experimental results indicate that the proposed algorithm can report the matched positions in the specific sequence and improve the matching speed with MPI, as well as reduce the storage requirement. | |||
TO cite this article:Xue Qianfei,Xie Jiang,Shu Junhui, et al. A Parallel Algorithm for DNA Sequences Alignment Based on MPI[J]. |
2. Model Checking Hybrid Systems Within Hybrid Temporal Logic | |||
ZHANG Haibin | |||
Computer Science and Technology 28 January 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we deal with the model checking issue for hybrid systems within hybrid temporal logic. We solve the model checking problem for timed automata by translating it to the same issue for interval temporal logic. Then we prove that the model checking issue of multirate automata can be translated to that of timed automata. Finally, we give an approach for checking the linear propositional property of compact rectangular automata. | |||
TO cite this article:ZHANG Haibin. Model Checking Hybrid Systems Within Hybrid Temporal Logic[OL].[28 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4583955 |
3. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats | |||
He Lian,Wen Qianyan,Zhang Zhao | |||
Computer Science and Technology 24 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:mining unknown protocol packet formats is a very effective way to improve network security, especially in promoting the accuracy of network fuzz test. However, researches reverse engineering unknown protocol packets mostly depend on manual analysis, which is extremely time consuming and low efficiency. In this paper, we proposed a new method to infer the unknown protocol packet formats automatically. This method could infer the potential TLV fields and extract protocol format with low time consuming. First we define a threshold value for the sum of tag field types. Then we increase the value of a variable standing for the length of a tag filed until the type number of this tag fields reaches the threshold. After the tag filed is obtained, we can easily get the length field and the value field next to it. Run this process on the value field recursively, and we could finally get the whole structure of packet formats. In order to demonstrate the effectiveness, we applied our methods on the Get-Request packets of SNMP. As a result, almost 90% of the TLV structures of packets are extracted, at the same time, the field of Get-Request Id is also inferred successfully | |||
TO cite this article:He Lian,Wen Qianyan,Zhang Zhao. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats[OL].[24 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4575830 |
4. Sinkhole Attack Detection in Clustered-based Self-organizing Networks | |||
Zhang Fangjiao,ZHAI Lidong | |||
Computer Science and Technology 09 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Self-organizing networks has vast applied foreground in the future because of its low-cost, save-power, and easy implementation etc. But in such many applications, some of them place high demands on it. And safety becomes critical for wide application. Sinkhole attack is a common attack, which easily is combined with other attacks to cause more damage. In this paper, a method to detect the sinkhole attack is proposed. Two arguments are raised to help detect the nodes suffering from sinkhole attack, Credit Rating and Flow difference. | |||
TO cite this article:Zhang Fangjiao,ZHAI Lidong. Sinkhole Attack Detection in Clustered-based Self-organizing Networks[OL].[ 9 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4573922 |
5. A perception-motivated Interpolation algorithm for dynamic image sequences | |||
WANG Qian,DU Junping | |||
Computer Science and Technology 21 October 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Image interpolation is a classical problem in image processing. In this paper, we propose a perception-motivated interpolation algorithm for dynamic image sequences, which attempts to acquire high quality interpolation results in accordance with human visual perception. This algorithm mainly consists of two stages. First, the salient region detection method based on histogram contrast is used to capture attention regions of images. Then a partition interpolation model is presented to improve the interpolation quality of attention regions. Conducted experiments have shown that our algorithm can spend less time to produce satisfactory image sequences.????? | |||
TO cite this article:WANG Qian,DU Junping. A perception-motivated Interpolation algorithm for dynamic image sequences[OL].[21 October 2013] http://en.paper.edu.cn/en_releasepaper/content/4562236 |
6. Research on Kernel Function of Support Vector Machine | |||
Liu Lijuan,Shen Bo,Wang Xing | |||
Computer Science and Technology 01 July 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Support Vector Machine is a kind of algorithm used for classifying linear and nonlinear data, which not only has a solid theoretical foundation, but is more accurate than other sorting algorithms in many areas of applications, especially in dealing with high-dimensional data. It is not necessary for us to get the specific mapping function in solving quadratic optimization problem of SVM, and the only thing we need to do is to use kernel function to replace the complicated calculation of the dot product of the data set, reducing the number of dimension calculation. This paper introduces the theoretical basis of support vector machine, summarizes the research status and analyses the research direction and development prospects of kernel function. | |||
TO cite this article:Liu Lijuan,Shen Bo,Wang Xing. Research on Kernel Function of Support Vector Machine[OL].[ 1 July 2013] http://en.paper.edu.cn/en_releasepaper/content/4549429 |
7. RESEARCH OF LOSSLESS DIGITAL WATERMARKING TECHNOLOGY | |||
Sun Jianguo,KOU Liang,XIA Songzhu | |||
Computer Science and Technology 14 March 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The digital map is an important and indispensable resource to the national strategic security and social economic development. At the present, needs to focus on resolving the utility question of digital vector map copyright protection technology, furthermore, the information hiding technology is the basic content of the research areas of the digital vector maps copyright protection. It is proposed a digital copyright protection scheme, based on the principle of unauthorized cannot resume, copyright embedding operation selection partly transform for the map content. Processing area determined by the spatial clustering analysis method that is based on grid density. | |||
TO cite this article:Sun Jianguo,KOU Liang,XIA Songzhu. RESEARCH OF LOSSLESS DIGITAL WATERMARKING TECHNOLOGY[OL].[14 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4526746 |
8. Research on the Realization Method of Workflow Engine in Enterprise Information Management | |||
Qiu Xiaoping ,Gangqiao Shi,Changlin Song,Yang Xu | |||
Computer Science and Technology 08 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a feasible realization method of workflow engine is discussed in detailed for enterprise information management on the basis of database technology. Under the guidance of workflow management Coalition (WfMC), the data model of workflow engine is presented firstly based on the process model given, in which the attributes of process, activity and its relationships with role, application, workflow relation data and transfer condition are marked out. And then the basic control principles of workflow engine are designed based on the necessary tables of process instances and activity instances, in which the control method of process instance and activity instance are discussed in detail including the creation, startup, management or status evolvement of the instance. In our research work, this workflow engine is programmed as this realization method successfully on the development platform of SQL server 2000 and Visual Studio 2005 and the results shows the effectiveness of the workflow engine for inventory information management. Our achievements give a feasible realization method for business process management in enterprise using the advanced workflow technology, which can assign the good flexibility to the information management and improve the whole performance of enterprise while facing the changing market requirements. | |||
TO cite this article:Qiu Xiaoping ,Gangqiao Shi,Changlin Song, et al. Research on the Realization Method of Workflow Engine in Enterprise Information Management[J]. |
9. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension | |||
Xu Guangquan ,Junjie Wang | |||
Computer Science and Technology 08 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Browser extensions enhance the browser to help meet the varied needs of a broad user population through adding personalized features to browser. However, extensions can also expose user to disastrous attacks from the web. This paper took Firefox as an example to thoroughly study its extension mechanism and security problem, designed and implemented a monitoring system, which was depended on a behavior sequence knowledge base and used to find ongoing attacks. To show the practicality of our system, we described the characteristic behavior sequences of five typical kinds of attacks. Experiments showed that our system successfully find 11 from 18 times tentative attacks. | |||
TO cite this article:Xu Guangquan ,Junjie Wang. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension[OL].[ 8 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4506732 |
10. An image similarity measure based on corner | |||
Li Dehua,Zhu Jingchao,Yang Zhi | |||
Computer Science and Technology 07 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents a method to compare an image with a set of images and rank the images by their similarity. The common way either uses time-cost features or a set of training examples to get arguments, this method is fast and similar with text comparison. Firstly, we get all images' corner points by chord-to-point distance accumulation (CPDA), then generate their feature vectors by corners which can overcome different lightness, rotation and scale, finally compute the similarity between the images by their feature vectors, while the similarity function provides two arguments to fit into different applications. The experimental results tell us that the precision and performance both perform very well. As this method is kind of like text comparison, so it is well-defined for the image search engine. | |||
TO cite this article:Li Dehua,Zhu Jingchao,Yang Zhi. An image similarity measure based on corner[OL].[ 7 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4511424 |
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