A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

Defocusing image to pattern contact holes using attenuated phase shift masks

The patterning of contact holes by selecting out-of-focus image plane (defocus) using attenuated phase shift masks (APSM) has been studied. Defocus is found to enhance the image modulation at low partial coherence for contact holes with negative local average of mask function. Semi-dense holes up to 130 nm in 8% APSM have been printed by 0.5 μm defocus at a partial coherence of 0.31 using KrF scanner with highest numerical aperture of 0.68. However, these holes were closed with in-focus imaging. Defocus is also found to be beneficial for patterning the pitches that have extensive side lobes with in-focus imaging.     

The properties of a spinel copper cobaltite prepared at low temperatures and normal pressure

The properties of a spinel copper cobaltite obtained by thermal decomposition of mixed nitrates of both metals at 350°C and normal pressure are described. It has been shown that the maximum copper content (x) in the spinel Cu_xCo_3?xO₄ does not exceed 0.9. When the copper amount in the initial mixture is higher a second phase CuO is formed. The copper ions are distributed over the A- and the B-sites of the spinel lattice, i.e. the spinel is partially inverted. Such a model explains well the data obtained about the lattice parameter, IR-absorption and the magnetic susceptibility of the samples with different x.     

用仿真工具优化车辆动力系统(一)

在本文的第一部分，介绍了一种理想的车辆动力系统的计算机辅助开发过程。它显示了现代仿真技术在产品持续发展过程中的作用，该技术采用硬件回路作非在线的仿真，并通过现代化的试验手段对车辆进行匹配。特别重要的是提供了将电控变速器和发动机控制单元综合的可能性。接着是在线仿真在诸如发动机和变速器模式方面的应用和发展，它是上述开发过程的基础。根据上述的方法论，本文论述了仿真技术已取得的成绩和将来的应用可能性。     

Adaptive motion control using neural network approximations

In this paper, we present a new adaptive technique for tracking control of mechanical systems in the presence of friction and periodic disturbances. Radial Basis Functions (RBFs) are used to compensate for the effects of nonlinearly occurring parameters in the friction and periodic disturbance model. Theoretical analysis, such as stability and transient performance, is provided. Furthermore, the performance of the adaptive RBF controller and its non-adaptive counterpart are compared.     

我国“十五“电力供需预测分析

分析“十五”期间我国电力需求预测和电力预测中的不确定因素,提出建议采取的措施。     

Topology preservation of template-based 6-subiteration reduction operations

Generally, a reduction operation (e.g., thinning and shrinking) on 3D binary images can be represented as a set of reduction templates where every object voxel of the image satisfying any template is turned to a background voxel. Generally, it is rather difficult, error-prone and time-consuming for verifying the topological soundness of a 3D parallel reduction operation. This paper proposes sufficient conditions of time complexity O(n) for verifying the topological soundness of 3D parallel 6-subiteration reduction operations of n templates where such a kind of 3D reduction operations is performed alternatively from the six orthogonal directions to turn object voxels to background voxels. By such sufficient conditions, the topology soundness of a 3D 6-subiteration parallel reduction operation can be verified by checking each and every of its templates.     

Control of discrete time nonlinear systems with a time-varying structure

In this paper, we present a control methodology for a class of discrete time nonlinear systems that depend on a possibly exogenous scheduling variable. This class of systems consists of an interpolation of nonlinear dynamic equations in strict feedback form, and it may represent systems with a time-varying nonlinear structure. Moreover, this class of systems is able to represent some cases of gain scheduling control, Takagi-Sugeno fuzzy systems, as well as input-output realizations of nonlinear systems which are approximated via localized linearizations. We present two control theorems, one using what we call a “global” approach (akin to traditional backstepping), and a “local” approach, our main result, where backstepping is again used but the control law is an interpolation of local control terms. An aircraft wing rock regulation problem with varying angle of attack is used to illustrate and compare the two approaches.     

Stability robustness of networked control systems with respect to packet loss

This paper is concerned with stability analysis of discrete-time networked control systems over a communication channel subject to packet loss whose behavior is modeled by an i.i.d Bernoulli process with a packet dropping probability bounded by a constant. A necessary and sufficient condition for stability is obtained. A packet dropping margin is introduced as a measure of stability robustness of a system against packet dropping, and a formula for it is derived. A design method is proposed for achieving a large margin subject to a constraint that the system has a set of prescribed nominal closed-loop poles.