Abstract:Ant colony algorithm can resolve dynamic optimization problems due to its robustness and adaptation. The aim of such algorithms in dynamic environments is no longer to find an optimal solution but to trail it over time. In this paper, a clustering ant colony algorithm with three immigrants schemes (K-ACS) is proposed to address the dynamic location routing problem (LRP). The LRP is divided into two parts constituted by a location allocation problem (LAP) and a vehicles routing problem (VRP) in dynamic environments. To deal with the LAP, a K-means clustering algorithm is used to tackle the location of depots and surrounding cities in each class. Then the ant colony algorithm with three immigrants including random immigrants, elitism-based immigrants and memory-based immigrants is utilized to handle the VRP in dynamic environments consisting of random and cyclic traffic factors. A comparative study is carried out to assess the effect of the utilization of clustering. Experimental results based on different scales of LRP instances demonstrate that the clustering algorithm can significantly improve the performance of K-ACS in terms of the qualities and robustness of solutions. Furthermore, K-ACS show promising performance in solving the LRP in two different dynamic environments, suggesting that the proposed algorithm may lead to a new technique for tracking the environmental changes by utilizing its clustering and evolutionary characteristics.

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. Ant colony optimization with clustering for solving the dynamic location routing problem
	Shangce Gao,Yirui Wang,Jiujun Cheng,Yasuhiro Inazumi,Yuki Todo
	Computer Science and Technology 01 July 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Ant colony algorithm can resolve dynamic optimization problems due to its robustness and adaptation. The aim of such algorithms in dynamic environments is no longer to find an optimal solution but to trail it over time. In this paper, a clustering ant colony algorithm with three immigrants schemes (K-ACS) is proposed to address the dynamic location routing problem (LRP). The LRP is divided into two parts constituted by a location allocation problem (LAP) and a vehicles routing problem (VRP) in dynamic environments. To deal with the LAP, a K-means clustering algorithm is used to tackle the location of depots and surrounding cities in each class. Then the ant colony algorithm with three immigrants including random immigrants, elitism-based immigrants and memory-based immigrants is utilized to handle the VRP in dynamic environments consisting of random and cyclic traffic factors. A comparative study is carried out to assess the effect of the utilization of clustering. Experimental results based on different scales of LRP instances demonstrate that the clustering algorithm can significantly improve the performance of K-ACS in terms of the qualities and robustness of solutions. Furthermore, K-ACS show promising performance in solving the LRP in two different dynamic environments, suggesting that the proposed algorithm may lead to a new technique for tracking the environmental changes by utilizing its clustering and evolutionary characteristics.
	TO cite this article:Shangce Gao,Yirui Wang,Jiujun Cheng, et al. Ant colony optimization with clustering for solving the dynamic location routing problem[OL].[ 1 July 2015] http://en.paper.edu.cn/en_releasepaper/content/4649159


	2. Approximating Algorithms for Computing Energy Constrained MinimumCost Steiner Trees
	ZOU Nianchen, GUO Longkun, HUANG Peihuang
	Computer Science and Technology 30 May 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Green data transmission is important for wireless networks, such assensor networks, mobile networks, etc. This paper gives approximationalgorithms for constructing energy constrained minimum cost Steinertrees (ECMST), a topology for data multicast considering both savingenergy and minimizing the occupied resource. For a given undirectedgraph, in which each edge is with nonnegative integral cost and energyconsumption, the ECMST problem is to compute a minimum cost tree spanningall specified terminals and satisfying a given energy consumptionconstraint. Apparently ECMST is NP-hard, since it includes the minimumSteiner tree problem which is known NP-hard.The paper first presents an approximation algorithm by extendingByrka et al.'s method via Lagrangian relaxation. Then, the paper improves the ratio of the approximation algorithm to $(2,,3)$by replacing components of the computed Steiner tree. The improvementis mainly based on three ingredients: a generalization of the $k$-Steinerratio against ECMST, the observation that ECMST is pseudo-polynomialsolvable when the number of the terminals are fixed, and the extensionof Byrka and et al.'s approximation algorithm. To the best of ourknowledge, our algorithm is with the best ratio in the current stateof the art. Although Ravi and Goemanshave proposed a $(1+epsilon,,1)$-approximation algorithm for thespecial case when all vertices are terminals, their method can notbe applied to ECMST, since their method is based on a matroid propertywhich doesn't hold for ECMST.
	TO cite this article:ZOU Nianchen, GUO Longkun, HUANG Peihuang. Approximating Algorithms for Computing Energy Constrained MinimumCost Steiner Trees[OL].[30 May 2015] http://en.paper.edu.cn/en_releasepaper/content/4640705

Saved Papers

Saved Papers


	3. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge
	Wei Xiao-Chao, Zhao Chuan, Jiang Han, Xu Qiu-Liang
	Computer Science and Technology 30 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: Oblivious transfer (OT) is an important cryptographic basic tool and can be used to construct many other cryptographic scheme, such as the secure two-party computation protocol. As a sub-component of one scheme, the OT protocol must meet the security requirement of the outside scheme. For example, when constructing a secure two-party computation protocol in the presence of malicious adversary, the OT protocol used should be fully simulated in the malicious model. We propose a OT$^2_1$ protocol with full simulation under the assumption of DDH problem, relying on the notion of zero-knowledge proof of knowledge of partial (subset) Diffie-Hellman tuples.
	TO cite this article:Wei Xiao-Chao, Zhao Chuan, Jiang Han, et al. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624947


	4. 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


	5. Integrating the local network structure and router performance for better routing stratege
	Chen Zhaoyin
	Computer Science and Technology 17 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Network capacity and average travel distance of data packets are two key measurements to reflect the efficiency of traffic routing strategy. Network structure and routing strategy are the main factors determining the network performance. Previous study shows that the Internet topology has both scale-free and small-world features. In this paper we study information packet routing process on scale-free networks by mimicking the Internet traffic delivery strategies. We propose a routing strategy integrating the network structure characteristic and router processing ability. We first model the network by presenting the relationship between network capacity and network topology, router processing ability including transmission rate and buffer size. We find that congestions are more susceptible to occur in the nodes with both large betweenness centrality and low router processing ability. Instead of only using the information of degree and betweenness centrality, the new algorithm is derived on both the betweenness centrality and router processing ability. Simulation results suggest that the integrated routing strategy is more efficient in terms of the network capacity and average packet travel distance than SP and MD routing strategy.
	TO cite this article:Chen Zhaoyin. Integrating the local network structure and router performance for better routing stratege[OL].[17 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624131


	6. The Design and Implementation of Lightweight event-driven based service execution environment
	Kai Zhang,Bo Cheng
	Computer Science and Technology 25 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In recent years, Node.js has been developed rapidly and widely used. The evented and asynchronous properties of Node.js provide new solutions to server-side programming. In this paper, we introduce a lightweight service execution environment based on the theory of event-driven in Node.js and Flow Based Programming, briefly describing how it works in Web of Things, and its implementation. The service execution environment can be extensible and flexible.
	TO cite this article:Kai Zhang,Bo Cheng. The Design and Implementation of Lightweight event-driven based service execution environment[OL].[25 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4620429


	7. Vehicle-Logo Recognition Method based on Local Binary Pattern
	Liang Dong,Zhang Honggang,Shi Kuan,Hou Chengwen
	Computer Science and Technology 08 October 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Vehicle-logo location and recognition has a high research value for intelligent transportation system. With the emergence of car deck, only license plate recognition has become unreliable for automated management traffic. The reliability of the vehicle identification will greatly improve when combining license plate information with vehicle information. In order to solve vehicle-logo location and recognition, the paper presents a new method of vehicle-logo location based on license plate location. Then the Local Binary Pattern(LBP) descriptor computed over an vehicle-logo image as feature vector, then similarity between test vehicle-logo image and template images calculated by Euclidean distance.And the experiments have a good recognition rate.
	TO cite this article:Liang Dong,Zhang Honggang,Shi Kuan, et al. Vehicle-Logo Recognition Method based on Local Binary Pattern[OL].[ 8 October 2014] http://en.paper.edu.cn/en_releasepaper/content/4612650


	8. 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


	9. 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


	10. Weighted Extension of OMP for Discriminative Dictionary Learning
	Chen Naheng
	Computer Science and Technology 10 July 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Classification based on sparse representation has received a great deal of attention in recent years. In this paper, a weighted extension of OMP for classification is presented. It can be used in dictionary learning algorithms when dealing with classification issue. The proposed method adds a weighted parameter to the OMP algorithm; therefore discriminative power is enhanced and leads a faster convergence. This method is evaluated in the face recognition on Extended YaleB database and AR database. The result shows that the method achieves comparable recognition accuracy to the state-of-the-art result and runs 18 times faster in Extended YaleB and 30 times faster in AR.
	TO cite this article:Chen Naheng. Weighted Extension of OMP for Discriminative Dictionary Learning[OL].[10 July 2014] http://en.paper.edu.cn/en_releasepaper/content/4601431

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