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.     

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.     

On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

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.     

Enhanced relative permittivity in niobium and europium co-doped TiO2 ceramics

The appearance of colossal permittivity materials broadened the choice of materials for energy-storage applications. In this work, colossal permittivity in ceramics of TiO₂ co-doped with niobium and europium ions ((Eu_0.5Nb_0.5)_xTi_1-xO₂ ceramics) was reported. A large permittivity (ε_r ～ 2.01?×?10⁵) and a low dielectric loss (tanδ ～ 0.095) were observed for (Eu_0.5Nb_0.5)_xTi_1-xO₂ (x?=?1%) ceramics at 1?kHz. Moreover, two significant relaxations were observed in the temperature dependence of dielectric properties for (Eu, Nb) co-doped TiO₂ ceramics, which originated from defect dipoles and electron hopping, respectively. The low dielectric loss and high relative permittivity were ascribed to the electron-pinned defect-dipoles and electrons hopping. The (Eu_0.5Nb_0.5)_xTi_1-xO₂ ceramic with great colossal permittivity is one of the most promising candidates for high-energy density storage applications.     

Experimental and modeling approaches of MR behaviors under large step strains

Rheological properties of MR fluids under large step strain shear are presented in this paper. The experiments were carried out using a rheometer with parallel-plate geometry. Under the large step strain shear, MR fluids behave as nonlinear viscoelastic properties, where the stress relaxation modulus, G(t, γ), shows a decreasing trend with step strain. The experimental results indicate that G(t, γ) obeys time-strain separability. Thus, a mathematical form based on finite exponential serials is proposed to predict MR behavior. In this model, G(t, γ) is represented as the product of a linear stress relaxation, G(t), and the damping function, h(γ), i.e. G(t, γ)=G(t) h(γ). G(t) is simply represented as a three-parameter exponential serial and h(γ) has a sigmoidal form with two parameters. The parameters are identified by adopting an efficient optimization method proposed by Stango et al. The comparison between the experimental results and the model-predicted values indicates that this mathematical model can accurately predict MR behavior.     

实体造型中的几何约束

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