Succinct Representation, Leaf Languages, and Projection Reductions

In this article, the following results are shown: 1. For succinctly encoded problemss(A), completeness under polynomial time reductions is equivalent to completeness under projection reductions, an extremely weak reduction defined by a quantifier-free projective formula. 2. The succinct versions(Aof a computational problemAis complete under projection reductions for the class of problems characterizable with leaf languageA, but not complete undermonotoneprojections. 3. A strong conversion lemma: IfAis reducible toBin polylogarithmic time, then the succinct version ofAis monotone projection reducible to the succinct version ofB. This result strengthens previous results by Papadimitriou and Yannakakis, and Balcázar and Lozano. It allows iterated application for multiple succinct problems. 4. For all syntactic complexity classes there exist complete problems undermonotoneprojection reductions. This positively answers a question by Stewart for a large number of complexity classes.     

Integrating Feature Extractors for the Estimation of Human Facial Age

Facial feature extraction algorithms play an important role in many applications of face biometrics such as face recognition for person identification, classification of emotions by facial expression recognition and age estimation using facial images. In this paper, an integration of different type of feature extraction algorithms is applied on facial images for accurate age estimation. This integration is performed by using two-level fusion of features and scores with the help of feature-level and score-level fusion techniques. In our proposed method, the advantage of using different types of features such as biologically inspired features, texture-based features, and appearance-based features is used. Feature-level fusion of biologically inspired and texture-based methods is integrated into the proposed method and their combination is fused with an appearance-based method using score-level fusion. Experiments on the publicly available MORPH and FG-NET databases prove the effectiveness of the proposed method and the proposed method outperforms many of the state-of-the-art systems.     

Method for the Functional Diagnosis of Nondeterministic Finite State Machines

Journal of Computer and Systems Sciences International - The problem of the functional diagnosis of critical systems, described by a nondeterministic finite state machine model, is considered. A...     

A Fault-Detection Approach to the Conformance Testing of Nondeterministic Systems

The classical fault-detection approach to conformance testing for deterministic systems is based on state identification by means of diagnosis sequences. This paper extends this approach to set identification for nondeterministic systems in which an action may reach more than one state. It presents a new scheme for testing and deriving diagnosis sequences in terms of both specified and unspecified actions of a nondeterministic labeled transition system. New definitions and derivation methods for generalized unique input/output sequences and distinguishing sequences for set identification are proposed. The methods preserve failure equivalence and require minimization of the set space with respect to set-observational equivalence.     

Representation of Algebraic Functions As Power and Fractional Power Series of Special Type

A Maple procedure is described by means of which an algebraic function given by an equation f(x y) = 0 can be expanded into a fractional power series (Puiseux series)

Modeling and Inference of Extended Interval Temporal Logic for Nondeterministic Intervals

Extended interval temporal logic (EITL), an extension of the traditional point-interval temporal logic (PITL), is proposed. In contrast to PITL that represents the dynamic aspects of deterministic intervals, EITL can model and reason about the temporal relations among nondeterministic intervals in discrete-event systems, in which the duration of an event is indeterminate and only the lower bound and upper bound of the ending time can be predicted in advance. Time Petri nets (TPNs) are used for modeling EITL, for they give a straightforward view of temporal relations between the extended intervals and also provide a number of theoretical and practical analysis methods. An inference engine based on the TPN modeling complemented with algebraic inequalities is proposed to construct an analytical representation of the EITL relations and solve qualitative temporal reasoning problems. Linear inference mechanism based on TPN reduction rules is used to infer new temporal relations and handle quantitative temporal reasoning problems with linear time complexity, as our example shows.     

配电系统GIS功能开发技术的探讨

针对ＭａｐＯｂｊｅｃｔｓ的功能和电力配电网的具体要求,阐述了基于ＭａｐＯｂｊｅｃｔｓ的配电网地理信息系统的开发过程,提出了实用的软件开发方案。     

Nondeterministic dependencies in relations: An extention of the concept of functional dependency

In the present article, some special semantic integrity constraints—so called nondeterministic dependencies—are proposed. These dependencies can be regarded as stochastic extensions of functional dependencies. After some basic definitions, the concept of nondeterministic dependency is introduced. Examples are given and an implementation for a statistical analysis system is described. Some properties are discussed.     

PSL构造双向交换自动机及非确定自动机的方法

PSL(property specification language)是一种用于描述并行系统的属性规约语言,包括线性时序逻辑FL(foundation language)和分支时序逻辑OBE(optional branching extension)两部分.由于OBE就是CTL(computation tree logic),并且具有时钟声明的公式很容易改写成非时钟公式,因此重点研究了非时钟FL逻辑.为便于进行模型检验,每个FL公式必须转化成为一种可验证形式,通常是自动机(非确定自动机).构造非确定自动机的过程主要是通过中间构建交换自动机来实现.详细给出了由非时钟FL构造双向交换自动机的构造规则.构造规则的核心逻辑不仅仅局限于是在LTL(linear temporal logic)基础上的正规表达式,而且全面而充分地考虑了各种FL操作算子的可能性.并且给出了将双向交换自动机转化为非确定自动机的一种方法.最后,编写了将PSL转化为上述自动机的实现工具.FL双向交换自动机的构造规则计算复杂度仅是FL公式长度的线性表达式,验证了构造规则的正确性.在此基础上,证明了双向交换自动机与其转化的等价的非确定自动机接受的语言相同.上述工作对解决复杂并行系统建模和模型验证问题具有重要的理论意义和应用价值.     

五遥功能在电力调度自动化系统中的实现

介绍茅台酒股份有限公司电力调度管理系统的五遥功能和实现方式.     

Strong and Auxiliary Forms of the Semi-Lagrangian Method for Incompressible Flows

We present a review of the semi-Lagrangian method for advection–diffusion and incompressible Navier–Stokes equations discretized with high-order methods. In particular, we compare the strong form where the departure points are computed directly via backwards integration with the auxiliary form where an auxiliary advection equation is solved instead; the latter is also referred to as Operator Integration Factor Splitting (OIFS) scheme. For intermediate size of time steps the auxiliary form is preferrable but for large time steps only the strong form is stable.     

核电站KIT系统改造中的反应堆热功率监视功能开发

该文主要涉及大亚湾核电站KIT系统升级改造中与反应堆热功率监视功能开发相关的内容。热功率监视模块接收来自反应堆一回路的温度、压力、流量等信号,计算反应堆的实时热功率和滑动平均热功率,对热功率进行实时显示并设置报警功能。该文从改造背景、功能需求、计算原理、功能应用等方面对热功率监视模块的设计开发进行了描述。     

Symbolic Conversion of Holonomic Functions to Hypergeometric Type Power Series

Programming and Computer Software - A term an is m-fold hypergeometric, for a given positive integer m, if the ratio $${{a}_{{n + m}}}{text{/}}{{a}_{n}}$$ is a rational function over a field...     

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance

Ordered binary decision diagrams with repeated tests are considered both in complexity theory and in applications. Bollig et al. have proved in [B. Bollig, M. Sauerhoff, D. Sieling, I. Wegener, Hierarchy theorems of kOBDDs and kIBDDs, Theoret. Comput. Sci. 205 (1998) 45-60] a tight hierarchy result for the classes of functions representable by k layers of polynomial-size deterministic ordered binary decision diagrams. In this paper the nondeterministic case is investigated, where the layers are driven by one and the same variable ordering. For k being a constant, it is shown that for the existential, the parity-, and the majority acceptance mode the analogous hierarchy collapses.     

Evaluation of Functions,Gradients, and Jacobians

Ramon E. Moore originated two fertile fields of computational mathematics, interval analysis and automatic differentiation. The first is concerned with the rigorous validation of approximately computed results, and the second with evaluation of derivatives from the computational process without derivation of formulas for them. Jointly and separately, these fields have grown into vast areas of research into theory and applications. In this paper, some simple topics are selected from each subject for illustration.