With a NP hard problem given, we may find a equivalent physical world. The rule of the changing of the physical states is simply the algorithm for solving the original NP hard problem .It is the most natural algorithm...With a NP hard problem given, we may find a equivalent physical world. The rule of the changing of the physical states is simply the algorithm for solving the original NP hard problem .It is the most natural algorithm for solving NP hard problems. In this paper we deal with a famous example , the well known NP hard problem——Circles Packing. It shows that our algorithm is dramatically very efficient. We are inspired that, the concrete physics algorithm will always be very efficient for NP hard problem.展开更多
In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' ...In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.展开更多
Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most c...Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.展开更多
One of the most intriguing problems of philosophy is the question whether the human mind and human consciousness can be completely reduced to matter, namely to the brain. A special problem in this context is what has ...One of the most intriguing problems of philosophy is the question whether the human mind and human consciousness can be completely reduced to matter, namely to the brain. A special problem in this context is what has been called the ＂hard problem.＂ The hard problem denies that it is possible to reduce phenomenal experiences to brain states. The hard problem claims that it is impossible for materialists to explain what it is like to feel something. Here, we will prove that the hard problem is a pseudo problem that is based on errors in logic and language. One of the key arguments for the hard problem, the conceivability of zombies, is logically wrong within naturalism, which most philosophers acknowledge. Nevertheless, generally all questions of the type ＂What is it like to feel something？＂ are either trivial or linguistically impermissible. The core of the ＂hard problem＂ is the mix-up between non-reducibility and non-describability.展开更多
Chalmers introduced the hard problem of consciousness as a profound gap between experience and physical concepts. Philosophical theories were based on different interpretations concerning the qualia/concept gap, such ...Chalmers introduced the hard problem of consciousness as a profound gap between experience and physical concepts. Philosophical theories were based on different interpretations concerning the qualia/concept gap, such as interactive dualism （Descartes）, as well as mono aspect or dual aspect monism. From a bio-psychological perspective, the gap can be explained by the different activity of two mental functions realizing a mental representation of extra-mental reality. The function of elementary sensation requires active sense organs, which create an uninterrupted physical chain from extra-mental reality to the brain and reflect the present. The function of categorizing reflection no longer needs sense organs, so that the physical chain to extra-mental reality is interrupted and now reflects the past. Whereas elementary sensation is an open system, categorizing reflection remains a closed system, separated from extra-mental reality. This creates the potentiality/reality gap, since prediction from the closed to the open system remains always uncertain. Elementary sensation is associated to specific qualia for each sense organ. Chalmers also attributed qualia to thoughts, with more neutral thought qualia. Thus at the qualia level, there is also an important gap, but now between specific sense qualia and neutral thought qualia. Since all physical concepts are simultaneously linked to neutral thought qualia, the hard problem might be explained by a qualia/qualia gap instead of a qualia/concept gap. The mental function of categorizing reflection induces the change from sense qualia to thought qualia by a categorization process. The specific sense qualia mosaic of an apple is reduced to physical concepts with neutral qualia by progressive categorization first to fruit, then to food, to chemicals and finally to calories. This might explain the gap felt in the hard problem, since specific sense qualia are completely different from neutral thought qualia, so that the hard problem could already be encountered at the qualia level. Since the gap of the hard problem is due to the interaction of different mental functions, it is compatible with a philosophical monism.展开更多
Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constrai...Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.展开更多
The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing....The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.展开更多
The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved ...The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.展开更多
In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movemen...In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movement of water drops in the natural hydrological cycle. The HCA performance is tested on various geometric structures and standard benchmarks instances. The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest. The obtained results illustrate the efficiency of using HCA for solving discrete domain optimization problems. The solution quality and number of iterations were compared with those of other metaheuristic algorithms. The comparisons demonstrate the effectiveness of the HCA.展开更多
The Balanced Academic Curriculum Problem （BACP） is a constraint satisfaction problem classified as （Non-deterministic Polynomial-time Hard） NP-Hard. This problem consists in the allocation of courses in the period...The Balanced Academic Curriculum Problem （BACP） is a constraint satisfaction problem classified as （Non-deterministic Polynomial-time Hard） NP-Hard. This problem consists in the allocation of courses in the periods that are part of a curriculum such that the prerequisites are satisfied and the load of courses is balanced for the students. This paper presents the solution for a modified BACP where the academic loads and number of curses may be the same or different for each one of the periods and allows having some courses in a specific period. This problem is modeled as an integer programming problem and is proposed the use of Tabu search with short-term memory for its solution because it is not possible to find solutions for all the instances of this modified problem with an exact method.展开更多
In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and...In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]展开更多
Based on the two-list algorithm and the parallel three-list algorithm, an improved parallel three-list algorithm for knapsack problem is proposed, in which the method of divide and conquer, and parallel merging withou...Based on the two-list algorithm and the parallel three-list algorithm, an improved parallel three-list algorithm for knapsack problem is proposed, in which the method of divide and conquer, and parallel merging without memory conflicts are adopted. To find a solution for the n-element knapsack problem, the proposed algorithm needs O（2^3n/8） time when O（2^3n/8） shared memory units and O（2^n/4） processors are available. The comparisons between the proposed algorithm and 10 existing algorithms show that the improved parallel three-fist algorithm is the first exclusive-read exclusive-write （EREW） parallel algorithm that can solve the knapsack instances in less than O（2^n/2） time when the available hardware resource is smaller than O（2^n/2） , and hence is an improved result over the past researches.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
基金86 3National High-Tech Program of China(86 3-30 6 -0 5 -0 3-1) National Natural Science Foundation of China(193310 5 0 ) Chi
文摘With a NP hard problem given, we may find a equivalent physical world. The rule of the changing of the physical states is simply the algorithm for solving the original NP hard problem .It is the most natural algorithm for solving NP hard problems. In this paper we deal with a famous example , the well known NP hard problem——Circles Packing. It shows that our algorithm is dramatically very efficient. We are inspired that, the concrete physics algorithm will always be very efficient for NP hard problem.
文摘In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.
文摘Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.
文摘One of the most intriguing problems of philosophy is the question whether the human mind and human consciousness can be completely reduced to matter, namely to the brain. A special problem in this context is what has been called the ＂hard problem.＂ The hard problem denies that it is possible to reduce phenomenal experiences to brain states. The hard problem claims that it is impossible for materialists to explain what it is like to feel something. Here, we will prove that the hard problem is a pseudo problem that is based on errors in logic and language. One of the key arguments for the hard problem, the conceivability of zombies, is logically wrong within naturalism, which most philosophers acknowledge. Nevertheless, generally all questions of the type ＂What is it like to feel something？＂ are either trivial or linguistically impermissible. The core of the ＂hard problem＂ is the mix-up between non-reducibility and non-describability.
文摘Chalmers introduced the hard problem of consciousness as a profound gap between experience and physical concepts. Philosophical theories were based on different interpretations concerning the qualia/concept gap, such as interactive dualism （Descartes）, as well as mono aspect or dual aspect monism. From a bio-psychological perspective, the gap can be explained by the different activity of two mental functions realizing a mental representation of extra-mental reality. The function of elementary sensation requires active sense organs, which create an uninterrupted physical chain from extra-mental reality to the brain and reflect the present. The function of categorizing reflection no longer needs sense organs, so that the physical chain to extra-mental reality is interrupted and now reflects the past. Whereas elementary sensation is an open system, categorizing reflection remains a closed system, separated from extra-mental reality. This creates the potentiality/reality gap, since prediction from the closed to the open system remains always uncertain. Elementary sensation is associated to specific qualia for each sense organ. Chalmers also attributed qualia to thoughts, with more neutral thought qualia. Thus at the qualia level, there is also an important gap, but now between specific sense qualia and neutral thought qualia. Since all physical concepts are simultaneously linked to neutral thought qualia, the hard problem might be explained by a qualia/qualia gap instead of a qualia/concept gap. The mental function of categorizing reflection induces the change from sense qualia to thought qualia by a categorization process. The specific sense qualia mosaic of an apple is reduced to physical concepts with neutral qualia by progressive categorization first to fruit, then to food, to chemicals and finally to calories. This might explain the gap felt in the hard problem, since specific sense qualia are completely different from neutral thought qualia, so that the hard problem could already be encountered at the qualia level. Since the gap of the hard problem is due to the interaction of different mental functions, it is compatible with a philosophical monism.
文摘Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.
基金supported by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant No.2011CDB453,2014CFB440)
文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.
文摘The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.
文摘In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movement of water drops in the natural hydrological cycle. The HCA performance is tested on various geometric structures and standard benchmarks instances. The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest. The obtained results illustrate the efficiency of using HCA for solving discrete domain optimization problems. The solution quality and number of iterations were compared with those of other metaheuristic algorithms. The comparisons demonstrate the effectiveness of the HCA.
文摘The Balanced Academic Curriculum Problem （BACP） is a constraint satisfaction problem classified as （Non-deterministic Polynomial-time Hard） NP-Hard. This problem consists in the allocation of courses in the periods that are part of a curriculum such that the prerequisites are satisfied and the load of courses is balanced for the students. This paper presents the solution for a modified BACP where the academic loads and number of curses may be the same or different for each one of the periods and allows having some courses in a specific period. This problem is modeled as an integer programming problem and is proposed the use of Tabu search with short-term memory for its solution because it is not possible to find solutions for all the instances of this modified problem with an exact method.
文摘In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]
文摘Based on the two-list algorithm and the parallel three-list algorithm, an improved parallel three-list algorithm for knapsack problem is proposed, in which the method of divide and conquer, and parallel merging without memory conflicts are adopted. To find a solution for the n-element knapsack problem, the proposed algorithm needs O（2^3n/8） time when O（2^3n/8） shared memory units and O（2^n/4） processors are available. The comparisons between the proposed algorithm and 10 existing algorithms show that the improved parallel three-fist algorithm is the first exclusive-read exclusive-write （EREW） parallel algorithm that can solve the knapsack instances in less than O（2^n/2） time when the available hardware resource is smaller than O（2^n/2） , and hence is an improved result over the past researches.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
