Specific emitter identification for satellite communication using probabilistic neural networks

Electromagnetic signal emitted by satellite communication (satcom) transmitters are used to identify specific individual uplink satcom terminals sharing the common transponder in real environment, which is known as specific emitter identification (SEI) that allows for early indications and warning (I&W) of the targets carrying satcom furnishment and furthermore the real time electromagnetic situation awareness in military operations. In this paper, the authors are the first to propose the identification of specific transmitters of satcom by using probabilistic neural networks (PNN) to reach the goal of target recognition. We have been devoted to the examination by exploring the feasibility of utilizing the Hilbert transform to signal preprocessing, applying the discrete wavelet transform to feature extraction, and employing the PNN to perform the classification of stationary signals. There are a total of 1000 sampling time series with binary phase shift keying (BPSK) modulation originated by five types of satcom transmitters in the test. The established PNNs classifier implements the data testing and finally yields satisfactory accuracy at 8 dB(±1 dB) carrier to noise ratio, which indicates the feasibility of our method, and even the keen insight of its application in military.     

Integration of imitation learning using GAIL and reinforcement learning using task-achievement rewards via probabilistic graphical model

The integration of reinforcement learning (RL) and imitation learning (IL) is an important problem that has long been studied in the field of intelligent robotics. RL optimizes policies to maximize the cumulative reward, whereas IL attempts to extract general knowledge about the trajectories demonstrated by experts, i.e, demonstrators. Because each has its own drawbacks, many methods combining them and compensating for each set of drawbacks have been explored thus far. However, many of these methods are heuristic and do not have a solid theoretical basis. This paper presents a new theory for integrating RL and IL by extending the probabilistic graphical model (PGM) framework for RL, control as inference. We develop a new PGM for RL with multiple types of rewards, called probabilistic graphical model for Markov decision processes with multiple optimality emissions (pMDP-MO). Furthermore, we demonstrate that the integrated learning method of RL and IL can be formulated as a probabilistic inference of policies on pMDP-MO by considering the discriminator in generative adversarial imitation learning (GAIL) as an additional optimality emission. We adapt the GAIL and task-achievement reward to our proposed framework, achieving significantly better performance than policies trained with baseline methods.     

Design and Implementation of a Flexible Manufacturing Control System Using Neural Network

Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to outperform the effect of noisy inputs.     

条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

Numerical simulation of typical contact situations of brake friction materials

In the paper, a model typical for contact situations of automotive brakes is established based on the method of movable cellular automata. The processes taking place at local contacts in an automotive brake system are analysed. Based on microscopic and micro-analytical observations, the following contact situations were simulated: (i) a couple of ferritic steel against pearlitic steel, both covered by an oxide layer mixed with graphite nanoparticles and (ii) the same situation but without oxide layers. The results of calculated mean coefficients of friction of the oxide-on-oxide contact correspond well to expected values for a real braking system, whereas steel-on-steel contact are twice as high. This allows one to make some conclusions; for example, oxide formation will take place more quickly than friction layer elimination, and finally this is responsible for the stabilisation of the coefficient of friction.     

神经网络在缺陷识别中的应用

为了准确、快速地进行缺陷识别，介绍了一种新型的前馈神经网络模型，即径向基概率神经网络。与以往的算法相比，该方法具有分类识别精度高且速度快的优点。仿真获得了很好的结果。     

Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.     

Learning Automata from Ordered Examples

Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations.