Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used....Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.展开更多
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed...Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.展开更多
In this paper, we propose a motion planning system for bin picking using 3-D point cloud. The situation that the objects are put miscellaneously like the inside in a house is assumed. In the home, the equipment which ...In this paper, we propose a motion planning system for bin picking using 3-D point cloud. The situation that the objects are put miscellaneously like the inside in a house is assumed. In the home, the equipment which makes an object stand in line doesn’t exist. Therefore the motion planning system which considered a collision problem becomes important. In this paper, Information on the objects is measured by a laser range finder (LRF). The information is used as 3-D point cloud, and the objects are recognized by model-base. We propose search method of a grasping point for two-fingered robotic hand, and propose search method of a path to approach the grasping point without colliding with other objects.展开更多
We implemented a 3-3-1 algorithm in order to provide safe and simple self-titration in patients who newly initiated BOT as well as who were already on BOT and evaluated its utility in clinical setting. A total of 46 p...We implemented a 3-3-1 algorithm in order to provide safe and simple self-titration in patients who newly initiated BOT as well as who were already on BOT and evaluated its utility in clinical setting. A total of 46 patients, 21 patients in the newly-initiated group and 25 patients in the existing BOT group performed dose adjustment using 3-3-1 algorithm. HbA1c was significantly improved 4 weeks after the initiation from 8.5% ± 1.2% at baseline to 7.3% ± 0.7% at the final evaluation (p 0.01, vs. Baseline). The average daily insulin units increased throughout the study period from 10.1 ± 6.7 at baseline to 14.6 ± 8.9 units at the final evaluation. Weight didn’t significantly change throughout the study (p = 0.12). The incidents of hypoglycemia were 0.8/month during the insulin dose self-adjustment period and 0.4/month during the follow-up period. The 3-3-1 algorithm using insulin glargine provided a safe and simple dose adjustment and demonstrated its utility in patients who were newly introduced to insulin treatment as well as who were already on BOT.展开更多
Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and co...Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.展开更多
An algorithm for integrating the constitutive equations in thermal framework is presented, in which the plastic deformation gradient is chosen as the integration variable. Compared with the classic algorithm, a key fe...An algorithm for integrating the constitutive equations in thermal framework is presented, in which the plastic deformation gradient is chosen as the integration variable. Compared with the classic algorithm, a key feature of this new approach is that it can describe the finite deformation of crystals under thermal conditions. The obtained plastic deformation gradient contains not only plastic defor- mation but also thermal effects. The governing equation for the plastic deformation gradient is obtained based on ther- mal multiplicative decomposition of the total deformation gradient. An implicit method is used to integrate this evo- lution equation to ensure stability. Single crystal 1 100 aluminum is investigated to demonstrate practical applications of the model. The effects of anisotropic properties, time step, strain rate and temperature are calculated using this integration model.展开更多
In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis a...In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.展开更多
Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tail...Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.展开更多
Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit th...Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.展开更多
Traditional scheduling algorithms for avionics communication have the shortcoming of messages accumulation,the efficiency and reliability of the service can be improved by combining the distributed integrated modular ...Traditional scheduling algorithms for avionics communication have the shortcoming of messages accumulation,the efficiency and reliability of the service can be improved by combining the distributed integrated modular avionics(DIMA)system with a time trigger mechanism.To further improve the utilization of system resources,the static scheduling algorithm of time triggered service is studied.By making the time trigger message schedule dispersedly,the stabilities of both the available time slots for the event triggered messages and the system will be improved.An improved two-dimensional bin packing algorithm is also presented to achieve the above-mentioned purpose with an extra benefit of better delay performance.展开更多
The production cycle of open-cast coal mines generally in eludes drilling, blasting, loading, hauling and coal preparation activities. Individual optimization of these activities does not mean that the whole system is...The production cycle of open-cast coal mines generally in eludes drilling, blasting, loading, hauling and coal preparation activities. Individual optimization of these activities does not mean that the whole system is optimized. This paper proposes a cost model considering all activities in mining cycle and system-wide approach to minimize the total mining cost of bench production. Since the fragmentation size and blast-hole diameter are linked to all activities of mining system, they are considered as decision variables in the problem form ul at io n. The operatio n costs are then minimized by using the evolutionary algorithm. Moreover, the impact of the change in the explosive price, and the hourly unit cost of equipment on total mining cost is quantified by sensitivity analysis. A case study is implemented to demonstrate the developed model.展开更多
文摘Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.
文摘Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.
文摘In this paper, we propose a motion planning system for bin picking using 3-D point cloud. The situation that the objects are put miscellaneously like the inside in a house is assumed. In the home, the equipment which makes an object stand in line doesn’t exist. Therefore the motion planning system which considered a collision problem becomes important. In this paper, Information on the objects is measured by a laser range finder (LRF). The information is used as 3-D point cloud, and the objects are recognized by model-base. We propose search method of a grasping point for two-fingered robotic hand, and propose search method of a path to approach the grasping point without colliding with other objects.
文摘We implemented a 3-3-1 algorithm in order to provide safe and simple self-titration in patients who newly initiated BOT as well as who were already on BOT and evaluated its utility in clinical setting. A total of 46 patients, 21 patients in the newly-initiated group and 25 patients in the existing BOT group performed dose adjustment using 3-3-1 algorithm. HbA1c was significantly improved 4 weeks after the initiation from 8.5% ± 1.2% at baseline to 7.3% ± 0.7% at the final evaluation (p 0.01, vs. Baseline). The average daily insulin units increased throughout the study period from 10.1 ± 6.7 at baseline to 14.6 ± 8.9 units at the final evaluation. Weight didn’t significantly change throughout the study (p = 0.12). The incidents of hypoglycemia were 0.8/month during the insulin dose self-adjustment period and 0.4/month during the follow-up period. The 3-3-1 algorithm using insulin glargine provided a safe and simple dose adjustment and demonstrated its utility in patients who were newly introduced to insulin treatment as well as who were already on BOT.
基金supported by the grants DMS 0405343 and DMR 0520425.
文摘Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.
基金supported by the Key Project of the National Natural Science Foundation of China(10932003)Project of Chinese National Programs for Fundamental Research and Development(2012CB619603 and 2010CB832700)"04" Great Project of Ministry of Industrialization and Information of China (2011ZX04001-21)
文摘An algorithm for integrating the constitutive equations in thermal framework is presented, in which the plastic deformation gradient is chosen as the integration variable. Compared with the classic algorithm, a key feature of this new approach is that it can describe the finite deformation of crystals under thermal conditions. The obtained plastic deformation gradient contains not only plastic defor- mation but also thermal effects. The governing equation for the plastic deformation gradient is obtained based on ther- mal multiplicative decomposition of the total deformation gradient. An implicit method is used to integrate this evo- lution equation to ensure stability. Single crystal 1 100 aluminum is investigated to demonstrate practical applications of the model. The effects of anisotropic properties, time step, strain rate and temperature are calculated using this integration model.
文摘In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.
文摘Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.
文摘Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.
基金Supported by Joint Fundation for Equipment Pre-research of Aerospace Science and Technology
文摘Traditional scheduling algorithms for avionics communication have the shortcoming of messages accumulation,the efficiency and reliability of the service can be improved by combining the distributed integrated modular avionics(DIMA)system with a time trigger mechanism.To further improve the utilization of system resources,the static scheduling algorithm of time triggered service is studied.By making the time trigger message schedule dispersedly,the stabilities of both the available time slots for the event triggered messages and the system will be improved.An improved two-dimensional bin packing algorithm is also presented to achieve the above-mentioned purpose with an extra benefit of better delay performance.
文摘The production cycle of open-cast coal mines generally in eludes drilling, blasting, loading, hauling and coal preparation activities. Individual optimization of these activities does not mean that the whole system is optimized. This paper proposes a cost model considering all activities in mining cycle and system-wide approach to minimize the total mining cost of bench production. Since the fragmentation size and blast-hole diameter are linked to all activities of mining system, they are considered as decision variables in the problem form ul at io n. The operatio n costs are then minimized by using the evolutionary algorithm. Moreover, the impact of the change in the explosive price, and the hourly unit cost of equipment on total mining cost is quantified by sensitivity analysis. A case study is implemented to demonstrate the developed model.
