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 102 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. Combinatorial Strategy in Fuzz Testing | |||
Kai Zhao,Hua Zhang,Qiaoyan Wen | |||
Computer Science and Technology 23 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:For the purpose of fuzzing more than one field per iteration in fuzz testing, in this paper, we present Combinatorial strategy which fuzzs more than one field at a time. This strategy traverses all the combinations of fields. Each fields has it's corresponding mutations and it will fuzz every combinations one by one until all possible mutations have been exhausted. However, combinatorial explosion follows with the Combinatorial strategy. Analyzing the relations of fields which can reduce the combinations of fields is one way to avoid the problem. Manually setting the max number of iterations of each combinations can evidently reduce the total number of iterations which might sacrifice some flaws. Experiment indicates that Combinatorial strategy not only effectively generates iterations but also can avoid the combinatorial explosion to a certain extent. | |||
TO cite this article:Kai Zhao,Hua Zhang,Qiaoyan Wen. Combinatorial Strategy in Fuzz Testing[OL].[23 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4622619 |
2. Study of Software Plugin-based Malware | |||
Li Zhiqiao,Cui Xiang,Liang Yu | |||
Computer Science and Technology 25 November 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Security issues of software plugins are seldom studied in existing researches. The plugin mechanism provides a convenient way to extend an application's functionality. However, it may also introduce susceptibility to new security issues. For example, attackers can create a malicious plugin to accomplish intended goals stealthily. In this paper, we propose a Software Plugin-based Malware (SPM) model and implement SPM prototypes for Microsoft Office, Adobe Reader and mainstream browsers(IE,Google Chrome,Firefox), with the aim to study the development feasibility of such malware and illustrate their potential threats. | |||
TO cite this article:Li Zhiqiao,Cui Xiang,Liang Yu. Study of Software Plugin-based Malware[OL].[25 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4620461 |
3. DHCE-CAS: A DISTRIBUTED AND HYBRID COMPUTING ENVIRONMENT FOR COMPUTER ALGEBRA SYSTEM | |||
Liangyu Chen, Zhenbing Zeng | |||
Computer Science and Technology 17 November 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Computer Algebra System (CAS) is a fundamental and vital backbone inthe field of symbolic computation and automated reasoning. There aremany excellent CASs, which can provide good interface and quickcomputation for researchers. However, they are only designed tosolve some special purposes, e.g., polynomial operations orcalculation of Groebner bases, thus lead to inefficientcompatibility and cooperation. In this paper, a distributed andhybrid computing environment for computer algebra system (DHCE-CAS)has been outlined. DHCE-CAS provides high performance by expandingthe kernel library in CAS, with using external calling communicationinterface and integrating the parallel library and clustermanagement software. Each job is submitted to a queue, askedcomputational resources by slot attribute and scheduled based on itsticket value, which denote the priority of job. We test severalexamples by implementing the parallel algorithm of SuccessiveDifference Substitution for verifying the semi-definiteness ofpolynomial. | |||
TO cite this article:Liangyu Chen, Zhenbing Zeng. DHCE-CAS: A DISTRIBUTED AND HYBRID COMPUTING ENVIRONMENT FOR COMPUTER ALGEBRA SYSTEM[OL].[17 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4618355 |
4. A Tool for Testing Java Memory Leaks | |||
DANG Wanchun,QIAN Ju,ZHOU Xiaoyu | |||
Computer Science and Technology 21 August 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Even with a built-in garbage collector, Java programs still suffer from memory leak problems caused by useless references to stale objects. Lots of researches have been conducted for the diagnosing of leaking failures. However, testing and identifying the leaking runs, which act as key steps before diagnosing, are still challenging. In this paper, we introduce a leak specification tool named LeakSpec to help programmers test memory leaks in Java programs. The specification works as a test oracle to automatically determine whether a program suffers from memory leaks. Users can write their own leak specifications using our specification language. LeakSpec weaves the specification checking mechanisms into the tested programs. During test runs, a memory leak failure will be reported if the some specifications are not satisfied. With this specification-based approach, a tester does not need to manually watch the program executions to identify memory leaks. The automatically reporting of memory leaks can reduce the manual efforts in leak testing. We test the proposed approach on ArgoUML. The results show that it is effective.????? | |||
TO cite this article:DANG Wanchun,QIAN Ju,ZHOU Xiaoyu. A Tool for Testing Java Memory Leaks[OL].[21 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4606824 |
5. Expressing and Manipulating Defect-Properties of Software Architectures with Extended Relation Algebra RASA | |||
LI Zu-De, CHEN Ming | |||
Computer Science and Technology 05 August 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Just as a Relation Algebra is invaluable for operating on the architecture of a software system, so it can be used fruitfully for visualising, aggregating and analysing architectural defects.The early study has thus defined an extended Relation Algebra for Software Architectures, called RASA.%This paper continues on RASA by focusing on two aspects: (i) an application of RASA for expression and manipulation of architectural defect-properties; and (ii) an implementation of RASA based on a traditional relational database system.This gives a clear guideline for utilizing and implementing RASA in analysis of software architectures. | |||
TO cite this article:LI Zu-De, CHEN Ming. Expressing and Manipulating Defect-Properties of Software Architectures with Extended Relation Algebra RASA[OL].[ 5 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4602932 |
6. Quantitative Analysis of Multiple-Component Software Defects | |||
LI Zu-De, CHEN Ming | |||
Computer Science and Technology 05 August 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Certain vital-few defects affect system qualities and maintenance costs more adversely than do other defects.%Identifying the vital-few defects and quantifying their characteristics offer the potential to guide defect correction and prevention.This study finds out that multiple-component defects (MCDs), defects spanning multiple system components, are such defects.Two case studies were conducted in six software systems for drawing a quantitative MCD profile, in aspects of defect proportion, distribution, complexity, longevity, and correction effort.The findings show typically that an MCD is likely to cross software development phase or release boundary 5-8 times more than a non-MCD defect.The profile can aid software maintenance and quality improvement.For example, more regression testing efforts shall be focused on MCDs because they tend to leak into subsequent phases or releases. | |||
TO cite this article:LI Zu-De, CHEN Ming. Quantitative Analysis of Multiple-Component Software Defects[OL].[ 5 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4602929 |
7. An Energy-Aware Scheduling Method of Virtual Machines in DFVS-Enabled Cloud | |||
Ding Youwei,Qin Xiaolin | |||
Computer Science and Technology 28 February 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, an energy-aware method of virtual machines (VM) scheduling in DVFS-enabled cloud is proposed. We define performance-power ratio to weight the physical machines, and the physical machine with high performance-power ratio is assigned to VMs first. VMs are allocated when they arrive, and consolidated every time interval to fully utilize the physical machine with high performance-power ratio. The simulation results show that our scheduling algorithm consumes less energy than existing ones. | |||
TO cite this article:Ding Youwei,Qin Xiaolin. An Energy-Aware Scheduling Method of Virtual Machines in DFVS-Enabled Cloud[OL].[28 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4586844 |
8. Energy-Efficient Tasks Allocation in Cloud Computing | |||
Ding Youwei,Qin Xiaolin | |||
Computer Science and Technology 28 February 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper we propose a general algorithm ReBaSCP to energy aware allocate data-intensive tasks by powering down partial nodes in a deployed mapreduce cluster without modifying the replication strategy. ReBaSCP, which is a two-step method, selects minimal nodes to process the data-intensive task at first to coarsely reduce energy of the cluster, and then balances the workload of the selected nodes to further reduce the energy consumption of the selected nodes in a finer granularity. Experimental results show that our solution outperforms the existing methods.. | |||
TO cite this article:Ding Youwei,Qin Xiaolin. Energy-Efficient Tasks Allocation in Cloud Computing[OL].[28 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4586847 |
9. Definition of events In Complex Event Processing | |||
Zeng Qingxiang | |||
Computer Science and Technology 19 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the development of the Internet of things, such as temperature and humidity sensors, radio frequency identification (RFID) devices, infrared sensors and other information sensing equipments will produce large amounts of data. In order to distinguish each data from these sensing devices and describe more meaningful events for the users,a formal mathematical logic model is proposed in this paper. Each data from sensing devices is defined as a 6-tuple, which means an atomic event. Complex event is composed of atomic events and logical operators such as Conjunction, Disjunction, Negation and so on. We can use the model to describe atomic events and complex events, so that in complex event processing, by applying some rules to handle large amounts of data from sensing devices in real time, more meaningful events for the users among large amounts of data are discovered. For illustration, a example of a box of fruit transferred from a truck to a fruit supermarket is utilized to show the feasibility of the formal mathematical logic model in definition of events. Empirical results show that in complex event processing, the model can describe any data from information sensing equipments and more meaningful events for the users. | |||
TO cite this article:Zeng Qingxiang. Definition of events In Complex Event Processing[OL].[19 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4573109 |
10. 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 |
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