Sensor network design based on system-wide reliability criteria. Part I: Objectives

Reliability based criteria are quite popular for optimal sensor network design. We present a modified definition of system reliability for sensor network design for two applications: reliable estimation of variables in a steady state linear flow process, and reliable fault detection and diagnosis for any process. Unlike the weakest-link based definition of system reliability in the literature, the proposed definition considers the entire system and is consistent with the reliability concept used in classical reliability literature. For each application, dual approaches for defining system reliability are proposed, and their analogy with the reliability problem in the classical reliability literature is established. Using examples and stochastic simulations, the advantage of using the proposed system reliability in contrast to the existing definition is illustrated. Part II of this series of articles presents methods for efficient generation of the system reliability function and its use in optimization-based approaches for designing optimal sensor networks.     

一种基于小字典不对等语料的跨语言词嵌入方法

双语词嵌入通常采用从源语言空间到目标语言空间映射,通过源语言映射嵌入到目标语言空间的最小距离线性变换实现跨语言词嵌入。然而大型的平行语料难以获得,词嵌入的准确率难以提高。针对语料数量不对等、双语语料稀缺情况下的跨语言词嵌入问题,该文提出一种基于小字典不对等语料的跨语言词嵌入方法,首先对单语词向量进行归一化,对小字典词对正交最优线性变换求得梯度下降初始值,然后通过对大型源语言(英语)语料进行聚类,借助小字典找到与每一聚类簇相对应的源语言词,取聚类得到的每一簇词向量均值和源语言与目标语言对应的词向量均值,建立新的双语词向量对应关系,将新建立的双语词向量扩展到小字典中,使得小字典得以泛化和扩展。最后,利用泛化扩展后的字典对跨语言词嵌入映射模型进行梯度下降求得最优值。在英语—意大利语、德语和芬兰语上进行了实验验证,实验结果证明该文方法可以在跨语言词嵌入中减少梯度下降迭代次数,减少训练时间,同时在跨语言词嵌入上表现出较好的正确率。     

Facial expression recognition of intercepted video sequences based on feature point movement trend and feature block texture variation

Facial Expression Recognition (FER) is an important subject of human–computer interaction and has long been a research area of great interest. Accurate Facial Expression Sequence Interception (FESI) and discriminative expression feature extraction are two enormous challenges for the video-based FER. This paper proposes a framework of FER for the intercepted video sequences by using feature point movement trend and feature block texture variation. Firstly, the feature points are marked by Active Appearance Model (AAM) and the most representative 24 of them are selected. Secondly, facial expression sequence is intercepted from the face video by determining two key frames whose emotional intensities are minimum and maximum, respectively. Thirdly, the trend curve which represents the Euclidean distance variations between any two selected feature points is fitted, and the slopes of specific points on the trend curve are calculated. Finally, combining Slope Set which is composed by the calculated slopes with the proposed Feature Block Texture Difference (FBTD) which refers to the texture variation of facial patch, the final expressional feature are formed and inputted to One-dimensional Convolution Neural Network (1DCNN) for FER. Five experiments are conducted in this research, and three average FER rates 95.2%, 96.5%, and 97% for Beihang University (BHU) facial expression database, MMI facial expression database, and the combination of two databases, respectively, have shown the significant advantages of the proposed method over the existing ones.     

Estimation of the Stress-Strength Reliability for Exponentiated Pareto Distribution Using Median and Ranked Set Sampling Methods

In reliability analysis, the stress-strength model is often used to describe the life of a component which has a random strength (X) and is subjected to a random stress (Y). In this paper, we considered the problem of estimating the reliability R=P [Y<X] when the distributions of both stress and strength are independent and follow exponentiated Pareto distribution. The maximum likelihood estimator of the stress strength reliability is calculated under simple random sample, ranked set sampling and median ranked set sampling methods. Four different reliability estimators under median ranked set sampling are derived. Two estimators are obtained when both strength and stress have an odd or an even set size. The two other estimators are obtained when the strength has an odd size and the stress has an even set size and vice versa. The performances of the suggested estimators are compared with their competitors under simple random sample via a simulation study. The simulation study revealed that the stress strength reliability estimates based on ranked set sampling and median ranked set sampling are more efficient than their competitors via simple random sample. In general, the stress strength reliability estimates based on median ranked set sampling are smaller than the corresponding estimates under ranked set sampling and simple random sample methods.     

基于特征融合的中文简历解析方法研究

针对基于规则和统计的传统中文简历解析方法效率低、成本高、泛化能力差的缺点，提出一种基于特征融合的中文简历解析方法，即级联Word2Vec生成的词向量和用BLSTM（Bidirectional Long Short-Term Memory）建模字序列生成的词向量，然后再结合BLSTM和CRF（Conditional Random Fields）对中文简历进行解析（BLSTM-CRF）。为了提高中文简历解析的效率，级联包含字序列信息的词向量和用Word2Vec生成的词向量，融合成一个新的词向量表示；再由BLSTM强大的学习能力融合词的上下文信息，输出所有可能标签序列的分值给CRF层；再由CRF引入标签之间约束关系求解最优序列。利用梯度下降算法训练神经网络，使用预先训练的词向量和Dropout优化神经网络，最终完成对中文简历的解析工作。实验结果表明，所提的特征融合方法优于传统的简历解析方法。     

Type II fuzzy set-based data analytics to explore amino acid associations in protein sequences of Swine Influenza Virus

The veracity present in molecular data available in biological databases possesses new challenges for data analytics. The analysis of molecular data of various diseases can provide vital information for developing better understanding of the molecular mechanism of a disease. In this paper, an attempt has been made to propose a model that addresses the issue of veracity in data analytics for amino acid association patterns in protein sequences of Swine Influenza Virus. The veracity is caused by intra-sequential and inter-sequential biases present in the sequences due to varying degrees of relationships among amino acids. A complete dataset of 63,682 protein sequences is downloaded from NCBI and is refined. The refined dataset consists of 26,594 sequences which are employed in the present study. The type I fuzzy set is employed to explore amino acid association patterns in the dataset. The type I fuzzy support is refined to partially remove the inter-sequential biases causing veracity in data. The remaining inter-sequential biases present in refined fuzzy support are evaluated and eliminated using type II fuzzy set. Hence, it is concluded that a combination of type II fuzzy & refined fuzzy approach is the optimal approach for extracting a better picture of amino acid association patterns in the molecular dataset.     

Word length and lexical activation: Longer is better.

Many models of spoken word recognition posit the existence of lexical and sublexical representations, with excitatory and inhibitory mechanisms used to affect the activation levels of such representations. Bottom-up evidence provides excitatory input, and inhibition from phonetically similar representations leads to lexical competition. In such a system, long words should produce stronger lexical activation than short words, for 2 reasons: Long words provide more bottom-up evidence than short words, and short words are subject to greater inhibition due to the existence of more similar words. Four experiments provide evidence for this view. In addition, reaction-time-based partitioning of the data shows that long words generate greater activation that is available both earlier and for a longer time than is the case for short words. As a result, lexical influences on phoneme identification are extremely robust for long words but are quite fragile and condition-dependent for short words. Models of word recognition must consider words of all lengths to capture the true dynamics of lexical activation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Tracking the mind during reading: The influence of past, present, and future words on fixation durations.

Reading requires the orchestration of visual, attentional, language-related, and oculomotor processing constraints. This study replicates previous effects of frequency, predictability, and length of fixated words on fixation durations in natural reading and demonstrates new effects of these variables related to 144 sentences. Such evidence for distributed processing of words across fixation durations challenges psycholinguistic immediacy-of-processing and eye-mind assumptions. Most of the time the mind processes several words in parallel at different perceptual and cognitive levels. Eye movements can help to unravel these processes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.