基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

基于机器视觉的轮胎表面缺陷检测系统的研究与应用

在传统的轮胎表面缺陷依靠人工检测,存在劳动强度高、受人的主观影响大以及效率低下的问题。针对这一现象,研究了一种基于机器视觉的轮胎表面缺陷3D检测系统。该系统依靠机器视觉系统获取检测轮胎的表面图像,然后创建3D模型、判定缺陷类型,最终实现实时自动预警,为轮胎生产商提供一种自动化检测方案。系统集成了先进的技术、软件和工具,配套的信息管控系统可以对轮胎型号和生产数据进行采集、存储、分析,以便在生产过程中实现更高效、更可靠的质量控制,具有较高的实际应用推广价值。     

Structural Aspects and Prediction of Calmodulin-Binding Proteins

Calmodulin (CaM) is an important intracellular protein that binds Ca²⁺ and functions as a critical second messenger involved in numerous biological activities through extensive interactions with proteins and peptides. CaM’s ability to adapt to binding targets with different structures is related to the flexible central helix separating the N- and C-terminal lobes, which allows for conformational changes between extended and collapsed forms of the protein. CaM-binding targets are most often identified using prediction algorithms that utilize sequence and structural data to predict regions of peptides and proteins that can interact with CaM. In this review, we provide an overview of different CaM-binding proteins, the motifs through which they interact with CaM, and shared properties that make them good binding partners for CaM. Additionally, we discuss the historical and current methods for predicting CaM binding, and the similarities and differences between these methods and their relative success at prediction. As new CaM-binding proteins are identified and classified, we will gain a broader understanding of the biological processes regulated through changes in Ca²⁺ concentration through interactions with CaM.     

小型核桃脱壳分选一体机的设计

核桃不仅营养价值极高,而且核桃壳的药用价值也非常高,国内小企业和家庭在核桃硬壳脱壳加工环节,一般采用人工破壳取仁的方式,这种方式劳动强度大,人工成本高且不卫生;针对这个问题设计了一款小型的硬壳脱壳,壳仁分离分选的机器来提高生产效率,减少成本,提高收入。     

深孔爆破成井技术在三道庄钼矿的试验与应用研究

洛钼集团矿山公司三道庄矿区由于历史原因,露天开采境界地下内存在的采空区已危及矿山公司的正常安全生产,阻碍了洛钼集团可持续发展。为解决这一重大问题,经过充分调研和多方论证,认为深孔一次爆破成井技术是解决此类采空区难题唯一的经济上合理、技术可行、安全可靠的手段与途径。深孔爆破成井实现与采空区顶板的贯通,使采空区边岩稳定,顶岩暴露面积缩小,确保了采空区的稳定;保证了台阶正常推进。     

轻量级电驱水下机械臂设计与运动学分析

设计了一款四功能水下机械臂，并对驱动关节进行了模块化设计和密封测试。为了保证水下机械臂的可靠性，在水下机械臂水下测试前，进行了强度校核和模态分析。为了验证水下机械臂的性能，通过 Ｄ- Ｈ法建立了其运动学模型，在此基础上分别进行了正、逆运动学分析。此外还采用蒙特卡洛法，在正运动学分析的基础上研究了工作空间特点。研究结果将为进一步的运动控制提供有益的帮助。     

Effects of Winding Attachment Positions on Output Characteristics of Flux‐Modulating Synchronous Machines

The flux‐modulating synchronous machine (FMSM) is a new type of multipole SM with nonoverlapping concentrated armature and field windings on the stator. This paper compares the output characteristics of two FMSMs through finite element analysis (FEA) and experiments. In both of the FMSMs, the attachment positions of the armature and field windings are swapped. To determine the reason for the discrepancies in their output characteristics, unsaturated inductances were calculated using a d‐‐q equivalent circuit. In addition, the calculated results of the inductances were confirmed through a visualization of the leakage fluxes using FEA. The results of the study show that the synchronous inductance can be reduced by attaching the armature winding to the air‐gap side of the stator teeth and that the reduction leads to an increase in output power.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

Design of delayed reconfigurable manufacturing system based on part family grouping and machine selection

To improve the convertibility of reconfigurable manufacturing system (RMS), the concept of delayed reconfigurable manufacturing system (D-RMS) was proposed. RMS and D-RMS are both constructed around part family. However, D-RMS may suffer from ultra-long system problem with unacceptable idle machines using generic RMS part families. Besides, considering the complex basic system structure of D-RMS, machine selection of D-RMS should be addressed, including dedicated machine, flexible machine, and reconfigurable machine. Therefore, a system design method for D-RMS based on part family grouping and machine selection is proposed. Firstly, a part family grouping method is proposed for D-RMS that groups the parts with more former common operations into the same part family. The concept of longest relative position common operation subsequence (LPCS) is proposed. The similarity coefficient among the parts is calculated based on LPCS. The reciprocal value of the operation position of LPCS is adopted as the characteristic value. The average linkage clustering (ALC) algorithm is used to cluster the parts. Secondly, a machine selection method is proposed to complete the system design of D-RMS, including machine selection rules and the dividing point decision model. Finally, a case study is given to implement and verify the proposed system design method for D-RMS. The results show that the proposed system design method is effective, which can group parts with more former common operations into the same part family and select appropriate machine types.     

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.