In order to realize scientific planning the layout of strategic loading station,the strategic-loading-station location problem was proposed,which is related to determine the location of each stay with station and the ...
详细信息
In order to realize scientific planning the layout of strategic loading station,the strategic-loading-station location problem was proposed,which is related to determine the location of each stay with station and the transportation plan on the precise of satisfying the general location constraints and problem related special constraintsBased on theory of capacitated facility location with multiple souring in two stage supply chain,one mixed integer linear programming model was established which took whole logistic cost embedding transportation and location costs as objectiveWhen confronted with small and medium size problem,this model could be exactly solved by optimization software using branch and bound algorithm,and when the problem size was big,this model could be heuristically solved by genetic algorithm which used 0-1 and priority-based combined encoding method to represent solution,cost-based and random-generated combined method to generate initial solution,solution repaired strategy and penalty method and special fitness function to deal illegal individual,and greedy based method to heuristically solve transshipment problemAt last,according to computational tests on randomly generated data demonstrated the practical feasibility of this method
The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For l...
详细信息
ISBN:
(纸本)9781467393010
The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.
Urban multimodal public transport system with rail transit as the backbone and bus as the collaborative operation is an important carrier for the travel of urban residents. For improving efficiency of urban public tra...
详细信息
Network-on-Chip (NoC) architecture is drawing intensive attention since it promises to maintain high performance in handling complex communication issues as the number of on-chip components increases. An effective...
详细信息
Network-on-Chip (NoC) architecture is drawing intensive attention since it promises to maintain high performance in handling complex communication issues as the number of on-chip components increases. An effective method of mapping multitask applications on multicores is necessary to effectively use the NoC potential. In this paper, we propose an approach of quadratic programming (QP) formulation at the first time for the mapping problem, and it can overcome the unacceptable complexity of Integer Linear Programming (ILP) in dealing with problems with large size due to the decrease in the number of variables. Experimental results show that, QP method is at least 10 times faster than ILP method for 20 given benchmarks.
A statistical model for global optimization is constructed generalizing some properties of the Wiener process to the multidimensional case. A new approach, which is similar to the branch and bound approach, is propose...
详细信息
ABSTRACT: This paper describes a mathematical model, an algorithm and a computer program that were specially developed to study the problem of a water quality management system undergoing a rapidly increasing environm...
详细信息
ABSTRACT. Individuals and organizations concerned with the expansion of the facilities of a river basin (such as a river basin authority) need to determine optimal strategies of operation and capital investment. They ...
详细信息
We consider a single‐machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical...
详细信息
暂无评论