Ransomware is one kind of malware using cryptography to prevent victims from normal use of their computers. As a result, victims lose the access to their files and desktops unless they pay the ransom to the attackers....
详细信息
Ransomware is one kind of malware using cryptography to prevent victims from normal use of their computers. As a result, victims lose the access to their files and desktops unless they pay the ransom to the attackers. By the end of 2019, ransomware attack had caused more than 10 billion dollars of financial loss to enterprises and individuals. In this work, we propose a Network-Assisted Approach (NAA), which contains local detection and network-level detection, to help user determine whether a machine has been infected by ransomware. To evaluate its performance, we built 100 containers in Docker to simulate network scenarios. A hybrid ransomware sample which is close to real-world ransomware is deployed on stimulative infected machines. The experiment results show that our network-level detection mechanisms are separately applicable to WAN and LAN scenarios for ransomware detection.
"Difficult to see a doctor" and prominent contradictions between doctors and patients in large public hospitals have become an urgent research topic in China. In this paper, we propose a multi-patient treatm...
详细信息
"Difficult to see a doctor" and prominent contradictions between doctors and patients in large public hospitals have become an urgent research topic in China. In this paper, we propose a multi-patient treatment mode (MTM) to improve medical efficiency and patient satisfaction. Based on the MTM, a problem named the doctor-patient combined matching problem (DPCMP) is proposed and can be described by a two-stage process: (1) The patients are grouped according to similar disease symptoms. (2) How to capture an optimal matching scheme form the grouped patients? Therefore, to solve the aforementioned problem, a mathematical model of the DPCMP is constructed, and several improved ant colony optimization algorithms are designed. Finally, certain examples verify the effectiveness and good performances of the proposed methods.
Satellite laser ranging (SLR) is a technology with the highest precision of single measurement of satellite radial distance, which is developing rapidly in the direction of long-distance, high-precision and automation...
详细信息
Satellite laser ranging (SLR) is a technology with the highest precision of single measurement of satellite radial distance, which is developing rapidly in the direction of long-distance, high-precision and automation. SLR autonomous observation task scheduling is an important step in realizing station automation, which needs to satisfy the principles of satellite tracking priority and maximization of observation revenue at the same time. In order to improve the automation and intelligence level of SLR system, based on the framework of antcolonyoptimization (ACO) algorithm, this paper combines the dynamic optimization characteristics of ACO algorithm and the local optimization characteristics of greedy algorithm, introduces the maximum-minimum ant mechanism, and puts forward a scheduling scheme for SLR observation task based on greedy antcolonyalgorithm (GACA). The results show that compared to the current scheduling methods applied in practice. The results show that compared with the current scheduling method applied in practice, the number of observation satellites obtained from the GACA algorithm-based observation task planning for the SLR system has been improved by 37.4%, the total arc segment of satellite observation with higher priority has been extended by 36.47%, and the total observation gain has been increased by 42.39% in the same period of time. It effectively solves the problems of low efficiency, easy to miss stars and less stars in the observation process in manual scheduling, and provides a simple, practical, efficient and convenient observation task planning scheme for the establishment of an unmanned SLR system.
Since sensor nodes use limited battery power, sensor nodes power is considered to be a challenge and fundamental issue in wireless networks. Wireless sensor networks (WSNs) have recently used clustering-based methods ...
详细信息
Since sensor nodes use limited battery power, sensor nodes power is considered to be a challenge and fundamental issue in wireless networks. Wireless sensor networks (WSNs) have recently used clustering-based methods and different routing protocols in clusters which are full of sensor nodes. In this way, cluster heads (CHs), which are regarded as the selected nodes among other nodes within a given cluster, accumulate the information transmitted from their own cluster and send it to the sink. In this method, they try to control power consumption in a balanced way. In clustering method and routing among network nodes, network lifetime is enhanced which leads to achieving the best efficiency and productivity. In this paper, the optimized black hole algorithm is employed to select an optimal CH from sensor nodes. The CH selection is optimized by the free buffer of nodes, residual energy, and distance. The path between source CH and sink is identified by using antcolonyoptimization (ACO) algorithm. The combination of black hole algorithm and antcolonyalgorithm, with respect to clustering and routing, leads to the optimization of the proposed method in terms of operational criteria such as power consumption and eventually lifetime enhancement. The results obtained from simulating the proposed method in Matlab environment indicated that it has better results in comparison with other methods. The outputs of the obtained results from the proposed method indicated that it outperformed the other four comparative methods in terms of packet delivery rate and the number of transmitted packets to the CH and to the sink.
Trading aspect of agricultural supply chain system is sophisticated since it consists of many stages and involves various entities/agencies. Recently, blockchain technology could prove its effectiveness to solve some ...
详细信息
Trading aspect of agricultural supply chain system is sophisticated since it consists of many stages and involves various entities/agencies. Recently, blockchain technology could prove its effectiveness to solve some of the concerns in agricultural supply chain systems. Nevertheless, maximizing profit for producers (in our study farmers) is another important concern that can be addressed by consortium establishment which blockchain technology is the best solution for this purpose due to the following reasons. First, since all the nodes in the blockchain keep the verified and synchronized version of the chain, each node can verify the transactions' transparency. Second, blockchain technology is temper-proof that means no one can change the history of the transactions. These two main features of blockchain technology can provide a suitable ground to construct a consortium among the producers. However, there are other specific requirements that a successful consortium in agricultural supply chain system should address them that motivate us to a new design of blockchain technology. More precisely, in our design we consider the problems of trustability, scalability, and share amount assignment. For trustability, we utilize cyber physical system to ensure the quantity and quality of the products. Scalability is being addressed by adopting the concept of public service platform and proposing a new consensus algorithm. And finally share amount assignment is being solved by our improved version of ant colony optimization algorithm. Experimental results and analysis prove the effectiveness and accuracy of our proposed design for blockchain technology.
It is of great value to research the problem of forest pest and disease control. Currently, helicopters play an important role in dealing with this problem. However, the spraying route planning still depends on the pi...
详细信息
It is of great value to research the problem of forest pest and disease control. Currently, helicopters play an important role in dealing with this problem. However, the spraying route planning still depends on the pilot's driving experience, which leads to low efficiency and less accurate coverage. For this reason, this paper attempts to use intelligent algorithms to plan the pesticide spraying route for helicopters. When the helicopter is conducting spraying operations in multiple forest areas, the routes are divided into two parts: pesticide spraying routes for individual forest areas and dispatch routes between multiple forest areas. First, the shorter spraying route with fewer turnarounds for individual forest areas was determined. Then a two-layer intelligent algorithm, a combination of a genetic algorithm (GA) and ant colony optimization algorithm (ACO), was designed to determine the dispatch route between multiple forest areas, which is referred to as GAACO-GA. The performance was evaluated in self-created multiple forest areas and compared with other two-layer intelligent algorithms. The results show that the GAACO-GA algorithm found the shortest dispatch route (5032.75 m), which was 5.60%, 5.45%, 6.54%, and 4.07% shorter than that of GA-GA algorithm, simulated annealing-GA (SA-GA) algorithm, ACO-GA algorithm, and particle swarm optimization-GA (PSO-GA) algorithm, respectively. A spraying experiment with a helicopter was conducted near Pigzui Mountain, Huai'an City Jiangsu Province, China. It was found that the flight path obtained from the proposed algorithm was 5.43% shorter than that derived from a manual planning method. The dispatch route length was reduced by 16.93%, the number of turnarounds was reduced by 11 times, and the redundant coverage was reduced by 17.87%. Moreover, helicopter fuel consumption and pesticide consumption decreased by 10.56% and 5.43%, respectively. The proposed algorithm can shorten the application route, reduce the number of
In this paper, three cluster-first route-second approaches are proposed to solve the capacitated vehicle routing problem (CVRP) that extends a traveling salesman problem (TSP). In the first phase, a giant tour coverin...
详细信息
In this paper, three cluster-first route-second approaches are proposed to solve the capacitated vehicle routing problem (CVRP) that extends a traveling salesman problem (TSP). In the first phase, a giant tour covering all customers is built using three different metaheuristic algorithms as an ACO, a GA, and an ABCA. Then, the giant tour is split with respecting the vehicle capacity, and vehicles are loaded. In the second phase, we transform our problem into a small TSP after completing the clustering process, and a routing problem is solved based on a Branch-and-Bound algorithm. We evaluate the performance of these approaches on the benchmark problems. The computational results show that these approaches achieve high-quality results and gain an advantage in terms of CPU time. Besides, these approaches are also applied to a real-life case study related to a distribution CVRP meeting the weekly demands of a supermarket chain and provide a better routing solution.
In this study, a hybrid model integrating the antcolonyoptimization (ACO) algorithm and fuzzy c-means (FCM) clustering method into the adaptive neuro-fuzzy inference system (ANFIS) was proposed to predict the bond s...
详细信息
In this study, a hybrid model integrating the antcolonyoptimization (ACO) algorithm and fuzzy c-means (FCM) clustering method into the adaptive neuro-fuzzy inference system (ANFIS) was proposed to predict the bond strength between fibre-reinforced polymer (FRP) sheets and concrete surface under direct tension. Eight parameters including the compressive strength of concrete, maximum aggregate size, tensile strength of FRP, thickness of FRP, elastic modulus of FRP, adhesive tensile strength, length of FRP and width of FRP are employed as the inputs, and the bond strength is used as the output variable. A comparison was conducted between some existing empirical models and the proposed hybrid ACO-based ANFIS model. The results confirmed that the developed ACO-based ANFIS model exhibits greater accuracy than the other eleven models, with higher coefficient of determination (R2 = 0.97) and Nash-Sutcliffe efficiency index (NS = 0.97), and lower root mean squared error (RMSE = 1.29 kN), mean absolute error (MAE = 0.81 kN) and mean absolute relative error (MARE = 0.053), while according to the Akaike information criterion (AIC) index, the accuracy of this model lies in its considerable complexity compared to others.
Automated guided vehicle (AGV) is one of the main equipment for horizontal transportation in automated container terminals, and the optimization of AGV scheduling has become increasingly important. Existing scheduling...
详细信息
Automated guided vehicle (AGV) is one of the main equipment for horizontal transportation in automated container terminals, and the optimization of AGV scheduling has become increasingly important. Existing scheduling systems tend to make decisions based on deterministic conditions, ignoring the dynamic changes and uncertainties of the terminal environment, such as the arrival of random tasks during AGV operations. In addition, the battery swapping process is neglected in most AGV scheduling studies, yet it is crucial to ensure the operation of AGVs. In this paper, we construct a two-stage stochastic programming model for the joint scheduling problem of battery swapping and task operation with random tasks. A double-threshold constraint for battery swapping decision-making is adopted. The results show that the double-threshold strategy is better for AGV utilization than the single-threshold one. Upon the solution method, a simulationbased ant colony optimization algorithm is proposed. Sample average approximation is used to calculate the expected cost, and two local search procedures are introduced to improve the quality of the solutions. In the cases of multiple instances and several random task samples with different arrival rates, our method was compared with three practical policies under a deterministic model. Computational results show that the scheduling scheme considering random tasks in advance is more robust and stable.
Industry 5.0 puts forward higher requirements for smart cities, including low -carbon, sustainable, and people -oriented, which pose challenges to the design of smart cities. In response to the above challenges, this ...
详细信息
Industry 5.0 puts forward higher requirements for smart cities, including low -carbon, sustainable, and people -oriented, which pose challenges to the design of smart cities. In response to the above challenges, this study introduces the cyber-physical-social system (CPSS) and parallel system theory into the design of smart cities, and constructs a smart city framework based on parallel system theory. On this basis, in order to enhance the security of smart cities, a sustainable patrol subsystem for smart cities has been established. The intelligent patrol system uses a drone platform, and the trajectory planning of the drone is a key problem that needs to be solved. Therefore, a mathematical model was established that considers various objectives, including minimizing carbon emissions, minimizing noise impact, and maximizing coverage area, while also taking into account the flight performance constraints of drones. In addition, an improved metaheuristic algorithm based on antcolonyoptimization (ACO) algorithm was designed for trajectory planning of patrol drones. Finally, a digital environmental map was established based on real urban scenes and simulation experiments were conducted. The results show that compared with the other three metaheuristic algorithms, the algorithm designed in this study has the best performance.
暂无评论