Finite-time adaptive fuzzy control for a class of output constrained nonlinear systems with dead-zone

The article investigates the finite-time adaptive fuzzy control for a class of nonlinear systems with output constraint and input dead-zone. First, by skillfully combining the barrier Lyapunov function, backstepping design method, and finite-time control theory, a novel adaptive state-feedback tracking controller is constructed, and the output constraint of the nonlinear system is not violated. Second, the fuzzy logic system is used to approximate unknown function in the nonlinear system. Third, the finite-time command filter is introduced to avoid the problem of “complexity explosion” caused by repeated differentiations of the virtual control signal in conventional backstepping control schemes. Meanwhile, a new saturation function is added in the compensating signal for filter error to improve control accuracy. Finally, based on Lyapunov stability analysis, all the signals of the closed-loop are proved to be semi-globally uniformly ultimately bounded, and the tracking error converges to a small neighborhood region of the origin in a finite time. A simulation example is presented to demonstrate the effectiveness for the proposed control scheme.     

Machine fault diagnosis with small sample based on variational information constrained generative adversarial network

In actual engineering scenarios, limited fault data leads to insufficient model training and over-fitting, which negatively affects the diagnostic performance of intelligent diagnostic models. To solve the problem, this paper proposes a variational information constrained generative adversarial network (VICGAN) for effective machine fault diagnosis. Firstly, by incorporating the encoder into the discriminator to map the deep features, an improved generative adversarial network with stronger data synthesis capability is established. Secondly, to promote the stable training of the model and guarantee better convergence, a variational information constraint technique is utilized, which constrains the input signals and deep features of the discriminator using the information bottleneck method. In addition, a representation matching module is added to impose restrictions on the generator, avoiding the mode collapse problem and boosting the sample diversity. Two rolling bearing datasets are utilized to verify the effectiveness and stability of the presented network, which demonstrates that the presented network has an admirable ability in processing fault diagnosis with few samples, and performs better than state-of-the-art approaches.     

Topology optimization of flexure hinges with a prescribed compliance matrix based on the adaptive spring model and stress constraint

This paper focuses on the configuration design of flexure hinges with a prescribed compliance matrix and preset rotational center position. A new method for the topology optimization of flexure hinges is proposed based on the adaptive spring model and stress constraint. The hinge optimization model is formulated by maximizing the bending displacement with a spring while optimizing the compliance matrix to a prescribed value. To avoid numerical instability, an artificial spring is used as an auxiliary calculation, and a new strategy is developed for adaptively adjusting the spring stiffness according to the prescribed compliance matrix. The maximum stress of flexure hinge is limited by using a normalized P-norm of the effective von Mises stress, and a position constraint of rotational center is proposed to predetermine the position of the rotational center. In addition, to reduce the error of the stress measurement, a simple but effective filtering method is presented to obtain a complete black-and-white design. Numerical examples are used to verify the proposed method. Topology results show that the obtained flexure hinges have the prescribed compliance matrix and preset rotational center position while also meeting the stress requirements.     

A novel fast distance relay for series compensated transmission lines

This paper presents a fast distance relay for series compensated transmission lines based on the R–L differential-equation algorithm using the theory of equal transfer process of transmission lines. The measuring distances based on the proposed algorithm can fast approach the actual value of fault distance when a fault occurs in front of the series capacitor. When a fault occurs behind of the series capacitor, the fault loop, including the series capacitor, does not match the R–L transmission line model, so the measuring distances fluctuate severely. Based on this, the relative position of the fault with respect to the series capacitor can be judged effectively according to the fluctuation range of the measuring distances, and the accurate fault location can be obtained fast. A variety of PSCAD/EMTDC simulation tests show that the new relay has fast operating speed and high accuracy when applied to the long series compensated transmission lines.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

Event-triggered distributed receding horizon control for tracking and formation of homogeneous multi-agent systems

This paper proposes an event-triggered distributed receding horizon control (DRHC) approach for the formation and tracking problems of homogeneous multi-agent systems. For each agent, an event-triggering condition, based on assumed predictive information of the neighbours, is derived from stability analysis. Considering the uncertain deviation between the assumed and true predictive information, we design a time-varying compatibility constraint for the individual optimization problem. In the event-triggered DRHC algorithm, each agent solves the optimization problem and communicates with its neighbours only when the event-triggering condition is satisfied, so the communication and computation burden are reduced. Moreover, guarantees for the recursive feasibility and asymptotic stability of the overall system are proved. A simulation example is provided to illustrate effectiveness of the proposed approach.     

Time-series clustering – A decade review

Clustering is a solution for classifying enormous data when there is not any early knowledge about classes. With emerging new concepts like cloud computing and big data and their vast applications in recent years, research works have been increased on unsupervised solutions like clustering algorithms to extract knowledge from this avalanche of data. Clustering time-series data has been used in diverse scientific areas to discover patterns which empower data analysts to extract valuable information from complex and massive datasets. In case of huge datasets, using supervised classification solutions is almost impossible, while clustering can solve this problem using un-supervised approaches. In this research work, the focus is on time-series data, which is one of the popular data types in clustering problems and is broadly used from gene expression data in biology to stock market analysis in finance. This review will expose four main components of time-series clustering and is aimed to represent an updated investigation on the trend of improvements in efficiency, quality and complexity of clustering time-series approaches during the last decade and enlighten new paths for future works.     

实体造型中的几何约束

实体造型是一个基于约束的过程，完成从功能约束到几何约束、再到代数约束的转化而得到实体模型。本文讨论了几何约束的层次性及其表示，并且对几何约束同设计意图的关系进行了研究，提出了基于ＣＳＧ／ＧＣＧ／Ｂ－ｒｅｐ的模型表示。     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

挤压力对晶体生长速度及枝晶间距的影响

研究了挤压铸造时挤压力对宏观晶体生长速度的影响，给出了晶体生长速度表达式。结果表明：挤压力对合金宏观晶体生长速度的影响除与合金成分有关外，在某些挤压条件下，当形核率的增加幅度超过长大速度时，则挤压力可使宏观晶粒细化；反之，会使宏观晶粒变粗。随着挤压力的提高，合金凝固速度加快，一次枝晶间距和二次枝晶间距都随之减小，从而细化了树枝晶。