The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, cate...The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem.展开更多
The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of th...The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.展开更多
By applying the integral transform method and the inverse transformation technique based upon the two types of integration, the present paper has successfully obtained an exact algebraic solution for a two-dimensional...By applying the integral transform method and the inverse transformation technique based upon the two types of integration, the present paper has successfully obtained an exact algebraic solution for a two-dimensional Lamb＇s problem due to a strip impulse loading for the first time. With the algebraic result, the excitation and propagation processes of stress waves, including the longitudinal wave, the transverse wave, and Rayleigh-wave, are discussed in detail. A few new conclusions have been drawn from currently available integral results or computational results.展开更多
Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation an...Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation and display of the sensitivity kernel will be different.Unfortunately,in the past,both perspectives give the same name to their quantity computed/displayed,and that has caused some confusion.To distinguish between the two,their perspective should be added to the names.This paper focuses only on the perspective of the Forward Problem where the input parameters are known.The Perturbation method has been successfully used in the computation of the sensitivity kernels of observations on 1D and 3D viscosity variations from the Forward perspective.One aim of this paper is to review and clarify the physics of the Perturbation method and bring out some important aspects of this method that have been misunderstood or neglected.Another aim is to present sensitivity kernels from the Perturbation method using 3D(both radially and laterally heterogeneous)Earth models with realistic ice history.These new results are now suitable for future comparison with those from new methods using the Forward perspective.Finally,the sensitivity computations for realistic ice histories on a 3D Earth is reviewed and used to search for optimal locations of new GIA observations.展开更多
The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxe...The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxes into a single container. Both algorithms adopt the concept of building layers on one face of the container, but the first heuristic determines the layer face once for all, while the second treats the remaining container space as a reduced-sized container after one layer is loaded and, hence, selects the layer face dynamically. To handle the layout design problem at a layer's level, a block-based 2D packing procedure is also developed. Numerical studies demonstrate the efficiency of the heuristics.展开更多
In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation...In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.展开更多
By using the modified iteration method of large deflection theory of plates with variable thichness[1], we solve the problem of circular plates with variable thickness subjected to combined loads under the boundary co...By using the modified iteration method of large deflection theory of plates with variable thichness[1], we solve the problem of circular plates with variable thickness subjected to combined loads under the boundary conditions of the clamped edges and get comparatively more accurate second-order approximate analytical solution. If the results of this paper are degraded into the special cases, the results coinciding with those of papers [1,2] can be obtained. In this paper, the characteristic curves are plotted and some comparisons are made. The results of this paper are satisfactory.展开更多
This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for exam...This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for example, the 11-bus system is not an ill-conditioned system. In addition, a new approach to solve Load Flow Problems, E-ψtc, is introduced. It is an explicit method;solving linear equations is not needed. It can handle very tough and very large systems. The advantage of this method has been fully proved by two examples. The authors give this new method a detailed description of how to use it to solve Load Flow Problems and successfully apply it to the 43-bus and the 11-bus systems. The authors also propose a strategy to test the reliability, and by solving gradient equations, this new method can answer if the solution exists or not.展开更多
Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to...Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to schedule their loads. In this paper, load scheduling problem is formulated as a LCP （load commitment problem）. The load model is general and can model atomic and non-atomic loads. Furthermore, it can also take into consideration the relative discomfort caused by delay in scheduling any load. For this purpose, a single parameter ＂uric＂ is introduced in the load model which captures the relative discomfort caused by delay in scheduling a particular load. Guidelines for choosing this parameter are given. All the other parameters of the proposed load model can be easily specified by the consumer. The paper shows that the general LCP can be viewed as multi-stage decision making problem or a MDP （Markov decision problem）. RL （reinforcement learning） based algorithm is developed to solve this problem. The efficacy of the algorithm is investigated when the price of electricity is available in advance as well as for the case when it is random. The scalability of the approach is also investigated.展开更多
The working platforms supported with multiple extensible legs must be leveled before they come into operation.Although the supporting stiffness and reliability of the platform are improved with the increasing number o...The working platforms supported with multiple extensible legs must be leveled before they come into operation.Although the supporting stiffness and reliability of the platform are improved with the increasing number of the supporting legs,the increased overdetermination of the multi-leg platform systems leads to leveling coupling problem among legs and virtual leg problem in which some of the supporting legs bear zero or quasi zero loads.These problems make it quite complex and time consuming to level such a multi-leg platform.Based on rigid body kinematics,an approximate equation is formulated to rapidly calculate the leg extension for leveling a rigid platform,then a proportional speed control strategy is proposed to reduce the unexpected platform distortion and leveling coupling between supporting legs.Taking both the load coupling between supporting legs and the elastic flexibility of the working platform into consideration,an optimal balancing legs’ loads(OBLL) model is firstly put forward to deal with the traditional virtual leg problem.By taking advantage of the concept of supporting stiffness matrix,a coupling extension method(CEM) is developed to solve this OBLL problem for multi-leg flexible platform.At the end,with the concept of supporting stiffness matrix and static transmissibility matrix,an optimal load balancing leveling method is proposed to achieve geometric leveling and legs’ loads balancing simultaneously.Three numerical examples are given out to illustrate the performance of proposed methods.This paper proposes a method which can effectively quantify all of the legs’ extension at the same time,achieve geometric leveling and legs’ loads balancing simultaneously.By using the proposed methods,the stability,precision and efficiency of auto-leveling control process can be improved.展开更多
The bending problem of a functionally graded anisotropic cantilever beam subjected to a linearly distributed load is investigated. The analysis is based on the exact elasticity equations for the plane stress problem. ...The bending problem of a functionally graded anisotropic cantilever beam subjected to a linearly distributed load is investigated. The analysis is based on the exact elasticity equations for the plane stress problem. The stress function is introduced and assumed in the form of a polynomial of the longitudinal coordinate. The expressions for stress components are then educed from the stress function by simple differentiation. The stress function is determined from the compatibility equation as well as the boundary conditions by a skilful deduction. The analytical solution is compared with FEM calculation, indicating a good agreement.展开更多
Electrical load forecasting is very crucial for electrical power systems’planning and operation.Both electrical buildings’load demand and meteorological datasets may contain hidden patterns that are required to be i...Electrical load forecasting is very crucial for electrical power systems’planning and operation.Both electrical buildings’load demand and meteorological datasets may contain hidden patterns that are required to be investigated and studied to show their potential impact on load forecasting.The meteorological data are analyzed in this study through different data mining techniques aiming to predict the electrical load demand of a factory located in Riyadh,Saudi Arabia.The factory load and meteorological data used in this study are recorded hourly between 2016 and 2017.These data are provided by King Abdullah City for Atomic and Renewable Energy and Saudi Electricity Company at a site located in Riyadh.After applying the data pre-processing techniques to prepare the data,different machine learning algorithms,namely Artificial Neural Network and Support Vector Regression(SVR),are applied and compared to predict the factory load.In addition,for the sake of selecting the optimal set of features,13 different combinations of features are investigated in this study.The outcomes of this study emphasize selecting the optimal set of features as more features may add complexity to the learning process.Finally,the SVR algorithm with six features provides the most accurate prediction values to predict the factory load.展开更多
Environmental problems have received a great deal of attention in recent years.In particular,CO2 emissions worsen global warming and other environmental problems.The transport sector accounts for 20% of the total CO2 ...Environmental problems have received a great deal of attention in recent years.In particular,CO2 emissions worsen global warming and other environmental problems.The transport sector accounts for 20% of the total CO2 emissions.Therefore,the CO2 emission reduction of the transport sector is of great importance.In order to reduce emissions effectively,it is necessary to change the distribution and transportation processes.The purpose of this study is to minimize both the transportation costs and CO2 emissions during transportation.Our model considers a transportation scheduling problem in which loads are transported from an overseas production base to three domestic demand centers.The need for time-space networks arises naturally to improve the model.It is possible to know the distance carriers are moving,and also consider the timetables of carriers during transportation.Carrier choice,less-than carrier load,and domestic transportation among demand centers are considered as the three target areas to reduce CO2 emissions during the distribution process.The research model was formulated as a mixed integer programming (MIP) problem.It achieves cost reduction,and will contribute to improvement of the natural environment.展开更多
In this paper, we consider the buckling of an Euler-Bernoulli graphene beam due to an axial compressive load. We formulate the problem as a non-linear (eigenvalue) two-point boundary value problem, prove some properti...In this paper, we consider the buckling of an Euler-Bernoulli graphene beam due to an axial compressive load. We formulate the problem as a non-linear (eigenvalue) two-point boundary value problem, prove some properties of the eigenpairs and introduce a suitable numerical shooting method scheme for approximating them. We present the perturbation and the numerical approximations of the first and second buckling loads and the corresponding shapes.展开更多
Purpose:The study aimed to investigate the role of training load characteristics and injury and illness risk in youth ski racing.Methods:The training load characteristics as well as traumatic injuries,overuse injuries...Purpose:The study aimed to investigate the role of training load characteristics and injury and illness risk in youth ski racing.Methods:The training load characteristics as well as traumatic injuries,overuse injuries,and illnesses of 91 elite youth ski racers(age=12.1±1.3 years,mean±SD)were prospectively recorded over a period of 1 season by using a sport-specific online database.Multiple linear regression analyses were performed to monitor the influence of training load on injuries and illnesses.Differences in mean training load characteristics between preseason,in-season,and post-season were calculated using multivariate analyses of variance.Results:Differences were discovered in the number of weekly training sessions(p=0.005)between pre-season(4.97±1.57)and post-season(3.24±0.71),in the mean training volume(p=0.022)between in-season(865.8±197.8 min)and post-season(497.0±225.5 min)and in the mean weekly training intensity(Index)(p=0.012)between in-season(11.7±1.8)and post-season(8.9±1.7).A total of 185 medical problems were reported(41 traumatic injuries,12 overuse injuries,and 132 illnesses).The weekly training volume and training intensity was not a significant risk factor for injuries(p>0.05).Training intensity was found to be a significant risk factor for illnesses in the same week(β=0.348;p=0.044;R^(2)=0.121)and training volume represents a risk factor for illnesses in the following week(β=0.397;p=0.027;R^(2)=0.157).Conclusion:A higher training intensity and volume were associated with increased illnesses,but not with a higher risk of injury.Monitoring training and ensuring appropriate progression of training load between weeks may decrease incidents of illness in-season.展开更多
Software Defined Network(SDN)has been developed rapidly in technology and popularized in application due to its efficiency and flexibility in network management.In multi-controller SDN architecture,the Controller Plac...Software Defined Network(SDN)has been developed rapidly in technology and popularized in application due to its efficiency and flexibility in network management.In multi-controller SDN architecture,the Controller Placement Problem(CPP)must be solved carefully as it directly affects the whole network performance.This paper proposes a Multi-objective Greedy Optimized K-means Algorithm(MGOKA)to solve this problem to optimize worst-case and average delay between switches and controllers as well as synchronization delay and load balance among controllers for Wide Area Networks(WAN).MGOKA combines the process of network partition based on the K-means algorithm with cluster fusion based on the greedy algorithm and designs a normalization strategy to convert a multi-objective into a single-objective optimization problem.The simulation results depict that in different network scales with different numbers of controllers,the relative optimization rate of our proposed algorithm compared with K-means,K-means++,and GOKA can reach up to 101.5%,109.9%,and 79.8%,respectively.Moreover,the error rate between MGOKA and the global optimal solution is always less than 4%.展开更多
基金The National Natural Science Foundation of China(No.70571033,70831002)
文摘The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem.
文摘The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.
基金Project supported by the National Natural Science Foundation of China(No.10572002).
文摘By applying the integral transform method and the inverse transformation technique based upon the two types of integration, the present paper has successfully obtained an exact algebraic solution for a two-dimensional Lamb＇s problem due to a strip impulse loading for the first time. With the algebraic result, the excitation and propagation processes of stress waves, including the longitudinal wave, the transverse wave, and Rayleigh-wave, are discussed in detail. A few new conclusions have been drawn from currently available integral results or computational results.
文摘Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation and display of the sensitivity kernel will be different.Unfortunately,in the past,both perspectives give the same name to their quantity computed/displayed,and that has caused some confusion.To distinguish between the two,their perspective should be added to the names.This paper focuses only on the perspective of the Forward Problem where the input parameters are known.The Perturbation method has been successfully used in the computation of the sensitivity kernels of observations on 1D and 3D viscosity variations from the Forward perspective.One aim of this paper is to review and clarify the physics of the Perturbation method and bring out some important aspects of this method that have been misunderstood or neglected.Another aim is to present sensitivity kernels from the Perturbation method using 3D(both radially and laterally heterogeneous)Earth models with realistic ice history.These new results are now suitable for future comparison with those from new methods using the Forward perspective.Finally,the sensitivity computations for realistic ice histories on a 3D Earth is reviewed and used to search for optimal locations of new GIA observations.
基金the Natural Sciences and Engineering Research Council of Canada (NSERC) under the Discovery Grant Program
文摘The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxes into a single container. Both algorithms adopt the concept of building layers on one face of the container, but the first heuristic determines the layer face once for all, while the second treats the remaining container space as a reduced-sized container after one layer is loaded and, hence, selects the layer face dynamically. To handle the layout design problem at a layer's level, a block-based 2D packing procedure is also developed. Numerical studies demonstrate the efficiency of the heuristics.
基金supported by the Shanghai Applied Materials Foundation (Grant No.06SA18)
文摘In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.
文摘By using the modified iteration method of large deflection theory of plates with variable thichness[1], we solve the problem of circular plates with variable thickness subjected to combined loads under the boundary conditions of the clamped edges and get comparatively more accurate second-order approximate analytical solution. If the results of this paper are degraded into the special cases, the results coinciding with those of papers [1,2] can be obtained. In this paper, the characteristic curves are plotted and some comparisons are made. The results of this paper are satisfactory.
文摘This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for example, the 11-bus system is not an ill-conditioned system. In addition, a new approach to solve Load Flow Problems, E-ψtc, is introduced. It is an explicit method;solving linear equations is not needed. It can handle very tough and very large systems. The advantage of this method has been fully proved by two examples. The authors give this new method a detailed description of how to use it to solve Load Flow Problems and successfully apply it to the 43-bus and the 11-bus systems. The authors also propose a strategy to test the reliability, and by solving gradient equations, this new method can answer if the solution exists or not.
文摘Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to schedule their loads. In this paper, load scheduling problem is formulated as a LCP （load commitment problem）. The load model is general and can model atomic and non-atomic loads. Furthermore, it can also take into consideration the relative discomfort caused by delay in scheduling any load. For this purpose, a single parameter ＂uric＂ is introduced in the load model which captures the relative discomfort caused by delay in scheduling a particular load. Guidelines for choosing this parameter are given. All the other parameters of the proposed load model can be easily specified by the consumer. The paper shows that the general LCP can be viewed as multi-stage decision making problem or a MDP （Markov decision problem）. RL （reinforcement learning） based algorithm is developed to solve this problem. The efficacy of the algorithm is investigated when the price of electricity is available in advance as well as for the case when it is random. The scalability of the approach is also investigated.
基金supported by Shandong Provincial Natural Science Foundation of China(Grant No.ZR2010EL003)
文摘The working platforms supported with multiple extensible legs must be leveled before they come into operation.Although the supporting stiffness and reliability of the platform are improved with the increasing number of the supporting legs,the increased overdetermination of the multi-leg platform systems leads to leveling coupling problem among legs and virtual leg problem in which some of the supporting legs bear zero or quasi zero loads.These problems make it quite complex and time consuming to level such a multi-leg platform.Based on rigid body kinematics,an approximate equation is formulated to rapidly calculate the leg extension for leveling a rigid platform,then a proportional speed control strategy is proposed to reduce the unexpected platform distortion and leveling coupling between supporting legs.Taking both the load coupling between supporting legs and the elastic flexibility of the working platform into consideration,an optimal balancing legs’ loads(OBLL) model is firstly put forward to deal with the traditional virtual leg problem.By taking advantage of the concept of supporting stiffness matrix,a coupling extension method(CEM) is developed to solve this OBLL problem for multi-leg flexible platform.At the end,with the concept of supporting stiffness matrix and static transmissibility matrix,an optimal load balancing leveling method is proposed to achieve geometric leveling and legs’ loads balancing simultaneously.Three numerical examples are given out to illustrate the performance of proposed methods.This paper proposes a method which can effectively quantify all of the legs’ extension at the same time,achieve geometric leveling and legs’ loads balancing simultaneously.By using the proposed methods,the stability,precision and efficiency of auto-leveling control process can be improved.
基金Project supported by the National Natural Science Foundation of China(Nos.10472102 and 10432030)
文摘The bending problem of a functionally graded anisotropic cantilever beam subjected to a linearly distributed load is investigated. The analysis is based on the exact elasticity equations for the plane stress problem. The stress function is introduced and assumed in the form of a polynomial of the longitudinal coordinate. The expressions for stress components are then educed from the stress function by simple differentiation. The stress function is determined from the compatibility equation as well as the boundary conditions by a skilful deduction. The analytical solution is compared with FEM calculation, indicating a good agreement.
基金Funding Statement:The researchers would like to thank the Deanship of Scientific Research,Qassim University for funding the publication of this project.
文摘Electrical load forecasting is very crucial for electrical power systems’planning and operation.Both electrical buildings’load demand and meteorological datasets may contain hidden patterns that are required to be investigated and studied to show their potential impact on load forecasting.The meteorological data are analyzed in this study through different data mining techniques aiming to predict the electrical load demand of a factory located in Riyadh,Saudi Arabia.The factory load and meteorological data used in this study are recorded hourly between 2016 and 2017.These data are provided by King Abdullah City for Atomic and Renewable Energy and Saudi Electricity Company at a site located in Riyadh.After applying the data pre-processing techniques to prepare the data,different machine learning algorithms,namely Artificial Neural Network and Support Vector Regression(SVR),are applied and compared to predict the factory load.In addition,for the sake of selecting the optimal set of features,13 different combinations of features are investigated in this study.The outcomes of this study emphasize selecting the optimal set of features as more features may add complexity to the learning process.Finally,the SVR algorithm with six features provides the most accurate prediction values to predict the factory load.
文摘Environmental problems have received a great deal of attention in recent years.In particular,CO2 emissions worsen global warming and other environmental problems.The transport sector accounts for 20% of the total CO2 emissions.Therefore,the CO2 emission reduction of the transport sector is of great importance.In order to reduce emissions effectively,it is necessary to change the distribution and transportation processes.The purpose of this study is to minimize both the transportation costs and CO2 emissions during transportation.Our model considers a transportation scheduling problem in which loads are transported from an overseas production base to three domestic demand centers.The need for time-space networks arises naturally to improve the model.It is possible to know the distance carriers are moving,and also consider the timetables of carriers during transportation.Carrier choice,less-than carrier load,and domestic transportation among demand centers are considered as the three target areas to reduce CO2 emissions during the distribution process.The research model was formulated as a mixed integer programming (MIP) problem.It achieves cost reduction,and will contribute to improvement of the natural environment.
文摘In this paper, we consider the buckling of an Euler-Bernoulli graphene beam due to an axial compressive load. We formulate the problem as a non-linear (eigenvalue) two-point boundary value problem, prove some properties of the eigenpairs and introduce a suitable numerical shooting method scheme for approximating them. We present the perturbation and the numerical approximations of the first and second buckling loads and the corresponding shapes.
文摘Purpose:The study aimed to investigate the role of training load characteristics and injury and illness risk in youth ski racing.Methods:The training load characteristics as well as traumatic injuries,overuse injuries,and illnesses of 91 elite youth ski racers(age=12.1±1.3 years,mean±SD)were prospectively recorded over a period of 1 season by using a sport-specific online database.Multiple linear regression analyses were performed to monitor the influence of training load on injuries and illnesses.Differences in mean training load characteristics between preseason,in-season,and post-season were calculated using multivariate analyses of variance.Results:Differences were discovered in the number of weekly training sessions(p=0.005)between pre-season(4.97±1.57)and post-season(3.24±0.71),in the mean training volume(p=0.022)between in-season(865.8±197.8 min)and post-season(497.0±225.5 min)and in the mean weekly training intensity(Index)(p=0.012)between in-season(11.7±1.8)and post-season(8.9±1.7).A total of 185 medical problems were reported(41 traumatic injuries,12 overuse injuries,and 132 illnesses).The weekly training volume and training intensity was not a significant risk factor for injuries(p>0.05).Training intensity was found to be a significant risk factor for illnesses in the same week(β=0.348;p=0.044;R^(2)=0.121)and training volume represents a risk factor for illnesses in the following week(β=0.397;p=0.027;R^(2)=0.157).Conclusion:A higher training intensity and volume were associated with increased illnesses,but not with a higher risk of injury.Monitoring training and ensuring appropriate progression of training load between weeks may decrease incidents of illness in-season.
基金Supported by the National Natural Science Foundation of China(62102241)。
文摘Software Defined Network(SDN)has been developed rapidly in technology and popularized in application due to its efficiency and flexibility in network management.In multi-controller SDN architecture,the Controller Placement Problem(CPP)must be solved carefully as it directly affects the whole network performance.This paper proposes a Multi-objective Greedy Optimized K-means Algorithm(MGOKA)to solve this problem to optimize worst-case and average delay between switches and controllers as well as synchronization delay and load balance among controllers for Wide Area Networks(WAN).MGOKA combines the process of network partition based on the K-means algorithm with cluster fusion based on the greedy algorithm and designs a normalization strategy to convert a multi-objective into a single-objective optimization problem.The simulation results depict that in different network scales with different numbers of controllers,the relative optimization rate of our proposed algorithm compared with K-means,K-means++,and GOKA can reach up to 101.5%,109.9%,and 79.8%,respectively.Moreover,the error rate between MGOKA and the global optimal solution is always less than 4%.
