基于MAS理论的精密运动机构控制方法

描述了MAS的模型构成和各个agent的基本功能，以精密运动机构的PLC控制为对象，介绍了使用PLC控制精密运动对象的方法，给出了步进电机或伺服电机爬坡程序控制方法，对包络表的构成和执行过程作了描述。为精密运动部件的控制提供了有效方法。     

Water cycle algorithm-based economic dispatcher for sequential and simultaneous objectives including practical constraints

The article presents an efficient methodology based-on water cycle algorithm (WCA) to solve single and multiple objectives of economic load dispatch (ELD) aiming to generate the optimal value of the active generated power for each unit. Three objectives are adopted for optimisation either sequentially or concurrently; they are: (i) fuel cost considering valve-ripple effect, (ii) emission rate, and (iii) total network loss. The generating unit prohibited zones along with ramp rate limits and generating unit power limits specify the inequality constraints of the problem while maintaining system power balance. Usually, optimisation of simultaneous multiple objectives produces set of non-dominated Pareto-front solutions. To help the decision maker, the best compromise solution is carefully picked among optimal Pareto-front points. The proposed WCA-based methodology is demonstrated on three test cases with various complexities and under number of objective scenarios. Numerical results and further subsequent comparisons to other challenging optimisers indicate the viability and confirm the strength of the proposed WCA-based ELD method.     

无铅回流焊工艺及设备

主要讨论适应无铅回流焊的工艺及设备,推荐了两种适合于无铅制造的温度曲线(渐升式和梯形),并介绍了无铅回流炉的主要改进:增加温区数量;采用红外辐射与强制对流的加热方式;具有惰性气体环境;助焊剂收集系统;可控制的冷却系统及防止PCB变形的支撑条.最后介绍了可用于监控无铅回流过程的实时热管理系统.     

建筑漫步

在萨伏伊别墅,正是被排除在"新建筑五点"之外的那条坡道,才提供了展现"新建筑五点"的确切场所,而在这条坡道上展开的"建筑漫步",不但与柯布的"建筑物体"相辅相成,最终,它还将修正"新建筑五点"。     

基于随机优化的大规模噪声数据集快速学习方法

针对包含噪声与干扰数据的大规模机器学习问题,采用非凸Ramp损失函数抑制噪声和干扰数据的影响,提出一种基于随机优化的非凸线性支持向量机快速学习方法,有效改进训练速度和预测精度.实验结果表明该方法降低学习时间,在MNIST数据集上较传统学习方法的训练时间降低4个数量级.同时在一定程度上改进预测速度,并有效提升分类器对噪声数据集的泛化性能.     

建筑坡道--不容忽视的垂直疏散设施

简述了建筑坡道的类别和适用范围,指出了坡道作为垂直疏散设施的重要性和必要性,并结合建筑实例探讨了疏散坡道设计中的若干问题。     

2DInpaint: A novel privacy-preserving scheme for image inpainting in an encrypted domain over the cloud

The low cost, agility, and mobility of cloud services for processing and storage data have attracted user’s attention today. Untrusted third parties support these services, and users are always concerned about utilizing them for personal data. Addressing these data-privacy issues for image inpainting over the cloud infrastructure(s), we propose a model, 2DInpaint, to perform image inpainting by protecting image information from an eavesdropping adversary. Inpainting is a technique for modifying an image in an undetectable manner with applications ranging from restoration of damaged photographs to object-removal and replacement of lost blocks in image coding and transmission. It can be accomplished by propagating the information in the isophotes direction of the desired region(s) from the neighborhood. Performing this propagation when the image is in the encrypted domain (ED) is a challenging dilemma. The challenge is addressed by employing a modified version of 2D-bicubic interpolation over the region to be inpainted in ED. The ramp secret sharing scheme is utilized to secure image information and to reduce storage overhead over the cloud server. 2DInpaint is proved to be information-theoretical secure in a probabilistic viewpoint and through various cryptographic attacks. The qualitative and quantitative results of 2DInpaint are analyzed under the scenarios of classical image inpainting, object-removal, and text-removal, and compared with the schemes in the plain domain. Moreover, no limitations related to the topology of the region to be inpainted are required using our approach. To the best of our knowledge, 2DInpaint is the first move towards image inpainting in the ED.     

Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm

The unit commitment problem (UCP) is a nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems. The problem becomes even more complicated when dynamic power limit based ramp rate constraint is taken into account. Due to the inadequacy of deterministic methods in handling large-size instances of the UCP, various metaheuristics are being considered as alternative algorithms to realistic power systems, among which genetic algorithm (GA) has been investigated widely since long back. Such proposals have been made for solving only the integer part of the UCP, along with some other approaches for the real part of the problem. Moreover, the ramp rate constraint is usually discussed only in the formulation part, without addressing how it could be implemented in an algorithm. In this paper, the GA is revisited with an attempt to solve both the integer and real parts of the UCP using a single algorithm, as well as to incorporate the ramp rate constraint in the proposed algorithm also. In the computational experiment carried out with power systems up to 100 units over 24-h time horizon, available in the literature, the performance of the proposed GA is found quite satisfactory in comparison with the previously reported results.     

Effects of ramp slope,ramp height and users' pushing force on performance,muscular activity and subjective ratings during wheelchair driving on a ramp

We set and examined two hypotheses about effects of ramp slope (1:6, 1:8, 1:10, 1:12, and 1:14) by varying ramp height (0.15 m, 0.30 m, and 0.45 m) and pushing force of wheelchair users (weak, medium, and strong group). Thirty participants were recruited for the experiment, and they have ascended a ramp using a manual wheelchair. Three categories of dependent variables were measured: performance measures (total time and velocity), muscular activity measures (EMG of four upper extremity muscles) and subjective rating measures (physical discomfort and acceptability). Only the strong group used muscles constantly regardless of the ramp slope. Accessibility of the ramp decreased as the slope increased, and accessibility difference between slopes increased as the height increased. Based on the result, we suggest maximum allowable slope by ramp height: 1:8, 1:10 and 1:12 were recommended for the heights of 0.15 m, 0.30 m, and 0.45 m, respectively.     

A solution to the ramp rate and prohibited operating zone constrained unit commitment by GHS-JGT evolutionary algorithm

Unit commitment (UC) problem on a large scale with the ramp rate and prohibited zone constraints is a very complicated nonlinear optimization problem with huge number of constraints. This paper presents a new hybrid approach of ’Gaussian Harmony Search’ (GHS) and ’Jumping Gene Transposition’ (JGT) algorithm (GHS-JGT) for UC problem. In this proposed hybrid GHS-JGT for UC problem, scheduling variables are handled in binary form and other constants directly through optimum conditions in decimal form. The efficiency of this method is tested on ten units, forty units and hundred units test system. Simulation results obtained by GHS-JGT algorithm for each case show a better generation cost in less time interval, in comparison to the other existing results.