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.     

某面板堆石坝沉降观测资料反馈分析

根据某面板堆石坝施工期、蓄水初期以及几年来的沉降观测资料，对坝体填筑材料计算参数进行反馈分析，得出了能够反映坝体实际变形的弹塑性应力变形计算参数，有利于今后建立大坝变形预报模型，更准确地把握大坝实时运行状态。     

条件概率关系数据库模型

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

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

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

Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.     

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.     

A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships

This paper presents a simple, efficient computer-based method for discovering causal relationships from databases that contain observational data. Observational data is passively observed, as contrasted with experimental data. Most of the databases available for data mining are observational. There is great potential for mining such databases to discover causal relationships. We illustrate how observational data can constrain the causal relationships among measured variables, sometimes to the point that we can conclude that one variable is causing another variable. The presentation here is based on a constraint-based approach to causal discovery. A primary purpose of this paper is to present the constraint-based causal discovery method in the simplest possible fashion in order to (1) readily convey the basic ideas that underlie more complex constraint-based causal discovery techniques, and (2) permit interested readers to rapidly program and apply the method to their own databases, as a start toward using more elaborate causal discovery algorithms.     

Inference and learning in hybrid probabilistic network

This paper proposed a novel hybrid probabilistic network, which is a good tradeoff between the model complexity and learnability in practice. It relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains prove its clear advantages with respect to the generalization ability.     

Probabilistic analysis of uncertainties in seismic hazard assessment

Sources and current methods of analysis of uncertainty from randomness, fuzziness and ignorance or incomplete knowledge in seismic hazard assessment problem are briefly discussed at beginning; understandings of the authors are then presented in the following order. All three types of uncertainty come from incomplete knowledge. Probabilistic method can be applied to all of them, objective probability for random factors and subjective probability for the other two types of uncertain factors. Discrete subjective probability mass functions for incomplete and fuzzy factors can be obtained from logic-tree and membership functions respectively. Fractile curves may be used to show the scattering of any uncertainty factor, but a unified probabilistic treatment may be applied to any combination of all three types of uncertainty.