Dynamically consistent reduction of logical regulatory graphs

To cope with the increasing complexity of regulatory networks, we define a reduction method for multi-valued logical models.Starting with a detailed model, we use decision diagrams to compute reduced models by iteratively “removing” regulatory components. To keep a consistent dynamical behaviour, the logical rules associated with the targets of each removed node are actualised to account for the (indirect) effects of its regulators.This construction of reduced models preserves crucial dynamical properties of the original model, including stable states and more complex attractors. In this respect, the relationship between the attractor configuration of the original model and those of reduced models is formally established. We further analyse the issue of attractor reachability.Finally, we illustrate the flexibility and efficiency of the proposed reduction method by its application to a multi-valued model of the fly segment polarity network, which is involved in the control of segmentation during early embryogenesis.     

Dynamically adapting to system load and program behavior in multiprogrammed multiprocessor systems

Parallel execution of application programs on a multiprocessor system may lead to performance degradation if the workload of a parallel region is not large enough to amortize the overheads associated with the parallel execution. Furthermore, if too many processes are running on the system in a multiprogrammed environment, the performance of the parallel application may degrade due to resource contention. This work proposes a comprehensive dynamic processor allocation scheme that takes both program behavior and system load into consideration when dynamically allocating processors. This mechanism was implemented on the Solaris operating system to dynamically control the execution of parallel C and Java application programs. Performance results show the effectiveness of this scheme in dynamically adapting to the current execution environment and program behavior, and that it outperforms a conventional time‐shared system. Copyright © 2002 John Wiley & Sons, Ltd.     

动态选取数据表中的号码

该文主要论述了如何利用VB中的文本框、列表框与SQL Server中的数据表建立联系,并用定时器实现动态选取号码的功能,包括界面的设计、控件属性的设置、具体实现的方法及代码等。     

子系统的动态重构

本文主要讨论了动态重构特性及其发展现状,介绍了利用Ｘｉｌｉｎｘ ＸＣ６２００ ＦＰＧＡ进行系统动态重构的方法。     

Unprovability of the logical characterization of bisimulation

We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the Hennessy-Milner logic proposed by Desharnais does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization is unprovable for spaces that are projections of a coanalytic set. Underlying this construction there is a proof that stationary Markov processes over general measurable spaces do not have semi-pullbacks.     

Multidimensional logical transforms

This correspondence reviews the logical transform and pre-sents new theoretical and empirical developments. Novel extensions of the logical transform into spaces of three and four dimensions are de-scribed using the hexahedral and octahedral tessellations. These new tessellations are important in that they yield sufficiently compact neighborhoods to permit multidimensional cellular logic transforms to be carried out in real time by table lookup. Applications of logical transforms in these tessellations to data and image analysis are provided.     

Anti-dual logical functions

A class of logical functions, anti-dual functions, are defined and investigated by their characteristic properties. Finally, the number of symmetry types of such functions is showed forn≤6, and related to that of, self-dnal functions.     

First-order logical filtering

Logical filtering is the process of updating a belief state (set of possible world states) after a sequence of executed actions and perceived observations. In general, it is intractable in dynamic domains that include many objects and relationships. Still, potential applications for such domains (e.g., semantic web, autonomous agents, and partial-knowledge games) encourage research beyond intractability results.In this paper we present polynomial-time algorithms for filtering belief states that are encoded as First-Order Logic (FOL) formulas. Our algorithms are exact in many cases of interest. They accept belief states in FOL without functions, permitting arbitrary arity for predicates, infinite universes of elements, and equality. They enable natural representation with explicit references to unidentified objects and partially known relationships, still maintaining tractable computation. Previous results focus on more general cases that are intractable or permit only imprecise filtering. Our algorithms guarantee that belief-state representation remains compact for STRIPS actions (among others) with unbounded-size domains. This guarantees tractable exact filtering indefinitely for those domains. The rest of our results apply to expressive modeling languages, such as partial databases and belief revision in FOL.     

Hybrid logical analyses of the ambient calculus

In this paper, hybrid logic is used to formulate three control flow analyses for Mobile Ambients, a process calculus designed for modelling mobility. We show that hybrid logic is very well-suited to express the semantic structure of the ambient calculus and how features of hybrid logic can be exploited to reduce the “administrative overhead” of the analysis specification and thus simplify it. Finally, we use HyLoTab, a fully automated theorem prover for hybrid logic, both as a convenient platform for a prototype implementation as well as to formally prove the correctness of the analysis.     

On the paralogicality of some logical constructs

Some mathematical definitions and constructs from the theory of computation are considered and are shown to be incorrect and inconsistent in some cases. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 180–186, May–June 2008.     

Multivariate time series prediction of lane changing behavior using deep neural network

Many real world pattern classification problems involve the process and analysis of multiple variables in temporal domain. This type of problem is referred to as Multivariate Time Series (MTS) problem. It remains a challenging problem due to the nature of time series data: high dimensionality, large data size and updating continuously. In this paper, we use three types of physiological signals from the driver to predict lane changes before the event actually occurs. These are the electrocardiogram (ECG), galvanic skin response (GSR), and respiration rate (RR) and were determined, in prior studies, to best reflect a driver’s response to the driving environment. A novel Group-wise Convolutional Neural Network, MTS-GCNN model is proposed for MTS pattern classification. In our MTS-GCNN model, we present a new structure learning algorithm in training stage. The algorithm exploits the covariance structure over multiple time series to partition input volume into groups, then learns the MTS-GCNN structure explicitly by clustering input sequences with spectral clustering. Different from other feature-based classification approaches, our MTS-GCNN can select and extract the suitable internal structure to generate temporal and spatial features automatically by using convolution and down-sample operations. The experimental results showed that, in comparison to other state-of-the-art models, our MTS-GCNN performs significantly better in terms of prediction accuracy.     

Dynamically generated follow-up questions

Automatic text generators are at the heart of systems that provide users with information. The trick is getting the system to answer follow-up questions as naturally as possible. We have devised a direct manipulation interface that treats system-generated texts as structured objects that users can manipulate. With our interface, users select the portions of system-generated text that they don't understand or want more information about, and the system provides a menu of questions to ask. Question menus, generated on the fly, take into account the user model, underlying knowledge base(s), and the prior discourse context     

Dynamically Scheduling VLIW Instructions

Very long instruction word (VLIW) machines potentially provide the most direct way to exploit instruction-level parallelism; however, they cannot be used to emulate current general-purpose instruction set architectures. In addition, programs scheduled for a particular implementation of a VLIW model cannot be guaranteed to be binary compatible with other implementations of the same machine model with a different number of functional units or functional units with different latencies. This paper describes an architecture, named dynamically trace scheduled VLIW (DTSVLIW), that can be used to implement machines that execute code of current RISC or CISC instruction set architectures in a VLIW fashion, with backward code compatibility. Preliminary measurements of the DTSVLIW performance, obtained with an execution-driven simulator running the SPECint95 benchmark suite, are also presented.     

可动态扩展的嵌入式操作系统

可动态扩展的嵌入式操作系统研究的目的是使系统能够根据系统环境和用户需求动态的调整系统的行为，本文在标准的嵌入式实时操作系统基础上，采用核心扩展，软组件等技术提出并实现了一个适用于嵌入式操作系统的动态扩展方案，本方案在保证嵌入式系统实时性和安全性的前提下，使系统具有高度的灵活性。     

Ontological aspects of logical databases

The practical advantage of logical databases is the inferencing capability they provide. An important theoretical effect is the clarification of semantic issues, through logic to model theory.     

The complexity of logical theories

In this paper we introduce a method of encoding the computation of an alternating TM into a logical theory. The efficiency of the embedding we give together with the decision procedures, using Ehrenfencht games, which have been developed over the past few years, yield precise lower bounds for many decidable theories. In this paper we apply our technique explicitly to the theory of reals with addition; however, it should be clear that the techniques apply directly to other theories as well.We also outline the proof of a general theorem, motivated by a comment of A.R. Meyer and discovered independently by A.R. Meyer and L. Stockmeyer, which allows us to obtain a recent result of Bruss and Meyer directly from our precise characterization of R.A.     

Reasoning with logical bilattices

The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. The outcome are paraconsistent logics with a lot of desirable properties. A preliminary version of this paper appears in Arieli and Avron (1994).