Structural health monitoring system based on multi-agent coordination and fusion for large structure

In practical applications of structural health monitoring technology, a large number of distributed sensors are usually adopted to monitor the big dimension structures and different kinds of damage. The monitored structures are usually divided into different sub-structures and monitored by different sensor sets. Under this situation, how to manage the distributed sensor set and fuse different methods to obtain a fast and accurate evaluation result is an important problem to be addressed deeply. In the paper, a multi-agent fusion and coordination system is presented to deal with the damage identification for the strain distribution and joint failure in the large structure. Firstly, the monitoring system is adopted to distributedly monitor two kinds of damages, and it self-judges whether the static load happens in the monitored sub-region, and focuses on the static load on the sub-region boundary to obtain the sensor network information with blackboard model. Then, the improved contract net protocol is used to dynamically distribute the damage evaluation module for monitoring two kinds of damage uninterruptedly. Lastly, a reliable assessment for the whole structure is given by combing various heterogeneous classifiers strengths with voting-based fusion. The proposed multi-agent system is illustrated through a large aerospace aluminum plate structure experiment. The result shows that the method can significantly improve the monitoring performance for the large-scale structure.     

SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

Workers’ rest allowance and smoothing of the workload in assembly lines

Ergonomic aspects have a crucial role in manual assembly systems. They impact on the workers’ health, final product quality and productivity. For these reasons, there is the necessity to integrate them into the assembly line balancing phase as, whereas, only time and cost variables are considered. In this study, human energy expenditures are considered as ergonomic aspects and we integrate them, for the first time, into the assembly line balancing problem type 2 through the rest allowance evaluation. We consider as an objective function the minimization of the smoothness index. Firstly, a new optimal method based on mixed integer linear programming and a new linearization methodology are proposed. Then, a heuristic approach is introduced. To complete the study, a computational experimentation is presented to validate the mathematical model and to compare the methodologies proposed in terms of computational time, complexity and solution. Additionally, we provide a detailed analysis of the impact that rest allowance evaluation can have on productivity comparing the results obtained, taking into account the rest allowance integration before, during and after the assembly balancing process.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

THE effect of Srandom DOPANT fluctuation on threshold voltage and drain current variation in junctionless nanotransistors

We investigate the effect of dopant random fluctuation on threshold voltage and drain current variation in a two-gate nanoscale transistor. We used a quantum-corrected technology computer aided design simulation to run the simulation (10000 randomizations). With this simulation, we could study the effects of varying the dimensions (length and width), and thicknesses of oxide and dopant factors of a transistor on the threshold voltage and drain current in subthreshold region (off) and overthreshold (on). It was found that in the subthreshold region the variability of the drain current and threshold voltage is relatively fixed while in the overthreshold region the variability of the threshold voltage and drain current decreases remarkably, despite the slight reduction of gate voltage diffusion (compared with that of the subthreshold). These results have been interpreted by using previously reported models for threshold current variability, load displacement, and simple analytical calculations. Scaling analysis shows that the variability of the characteristics of this semiconductor increases as the effects of the short channel increases. Therefore, with a slight increase of length and a reduction of width, oxide thickness, and dopant factor, we could correct the effect of the short channel.     

Industrial sugar beets to biofuel: Field to fuel production system and cost estimates

Specialized varieties of sugar beets (Beta vulgaris L.) may be an eligible feedstock for advanced biofuel designation under the USA Energy Independence and Security Act of 2007. These non-food industrial beets could double ethanol production per hectare compared to alternative feedstocks. A mixed-integer mathematical programming model was constructed to determine the breakeven price of ethanol produced from industrial beets, and to determine the optimal size and biorefinery location. The model, based on limited field data, evaluates Southern Plains beet production in a 3-year crop rotation, and beet harvest, transportation, and processing. The optimal strategy depends critically on several assumptions including a just-in-time harvest and delivery system that remains to be tested in field trials. Based on a wet beet to ethanol conversion rate of 110 dm³ Mg⁻¹ and capital cost of 128 M$ for a 152 dam³ y⁻¹ biorefinery, the estimated breakeven ethanol price was 507 $ m⁻³. The average breakeven production cost of corn (Zea mays L.) grain ethanol ranged from 430 to 552 $ m⁻³ based on average net corn feedstock cost of 254 and 396 $ m⁻³ in 2014 and 2013, respectively. The estimated net beet ethanol delivered cost of 207 $ m⁻³ was lower than the average net corn feedstock cost of 254–396$ m⁻³ in 2013 and 2014. If for a mature industry, the cost to process beets was equal to the cost to process corn, the beet breakeven ethanol price would be $387 m^-3 (587 $ m⁻³ gasoline equivalent).     

Hierarchical multi-reservoir optimization modeling for real-world complexity with application to the Three Gorges system

High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 10⁷ m³ less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators.     

Effects of SO2 on selective catalytic reduction of NO with NH3 over a TiO2 photocatalyst

The effect of SO₂ gas was investigated on the activity of the photo-assisted selective catalytic reduction of nitrogen monoxide (NO) with ammonia (NH₃) over a TiO₂ photocatalyst in the presence of excess oxygen (photo-SCR). The introduction of SO₂ (300 ppm) greatly decreased the activity of the photo-SCR at 373 K. The increment of the reaction temperature enhanced the resistance to SO₂ gas, and at 553 K the conversion of NO was stable for at least 300 min of the reaction. X-ray diffraction, FTIR spectroscopy, thermogravimetry and differential thermal analysis, x-ray photoelectron spectroscopy (XPS), elemental analysis and N₂ adsorption measurement revealed that the ammonium sulfate species were generated after the reaction. There was a strong negative correlation between the deposition amount of the ammonium sulfate species and the specific surface area. Based on the above relationship, we concluded that the deposition of the ammonium sulfate species decreased the specific surface area by plugging the pore structure of the catalyst, and the decrease of the specific surface area resulted in the deactivation of the catalyst.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.