Immobilization and activation of vanadium(III) and titanium(III) single‐site catalysts for ethylene polymerization using MgCl2‐based supports

Significant increases in the activity of vanadium(III) amidinate catalysts for ethylene polymerization have been obtained by immobilization on a MgCl₂‐based support prepared by reaction of AlEt₃ with a MgCl₂/ethanol adduct. Catalyst immobilization and activation on this type of support prevents the rapid decay in activity observed under homogeneous polymerization conditions with unsupported catalysts. Stable polymerization activity is also observed with analogous titanium(III) complexes. Polyethylene with narrow molecular weight distribution and spherical particle morphology is obtained without reactor fouling. Copyright © 2005 Society of Chemical Industry     

缺省理论的简化

缺省理论△=(D,W)中的缺省规则集D,是该理论的不确定因素.如果能去掉一些缺省规则而又不影响该理论的延伸,则就在一定程度上简化了该理论.本文证明了关于规范缺省理论的延伸的若干性质,利用这些性质,我们可以把某些规范缺省理论在一定条件下得以化简,有的甚至可以把它们化为一阶逻辑理论.     

A flexible architecture for distributed knowledge based systems with nomadic access through handheld devices

Nowadays any Knowledge Based System (KBS) realization needs of intercommunication among distributed components and to use non-connected and distributed data sources, which poses several challenges to the classical Artificial Intelligence field of KBS.

The multiagent paradigm and the use of ontologies are considered to be suitable tools to face the problems of designing and developing today KBS. On the other hand, using such networked KBS through handheld devices makes more efficient exploitation and interaction with the system.

This paper presents an open and flexible architecture for a distributed KBS and an application of it to construct a system for Psychological Disorders consulting, the so called PDA² (Psychological Disorder Assistant through PDA). We analyze the main features of the architecture as well as the agent tools we may use to construct it. Additionally, we present a support ontology for Psychological Disorders.     

Complexity classification in qualitative temporal constraint reasoning

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete.     

Induction in the Timed Interval Calculus

The Timed Interval Calculus, a timed-trace formalism based on set theory, is introduced. It is extended with an induction law and a unit for concatenation, which facilitates the proof of properties over trace histories. The effectiveness of the extended Timed Interval Calculus is demonstrated via a benchmark case study, the mine pump. Specifically, a safety property relating to the operation of a mine shaft is proved, based on an implementation of the mine pump and assumptions about the environment of the mine.     

抗窄带干扰宽带中频数字接收机的设计与实现

讨论了存在强干扰条件下MSK中频数字接收机的频域窄带干扰抑制、伪码快速捕获、MSK相干解调等实现方法。具体实现中提出了基于功率估计的码捕获门限实时调整方案，解决了动态干扰条件下的快速码捕获问题。基于FPGA DSP硬件设计和软件可编程数字信号处理算法，接收机具有较强的适应性和稳定性。     

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.     

An approach to efficient business intelligent system for financial prediction

A concept of business intelligent system for financial prediction is considered in this paper. It provides data needed for fast, precise and good business decision support to all levels of management. The aim of the project is the development of a new online analytical processing oriented on case-based reasoning (CBR) where a previous experience for every new problem is taken into account. Methodological aspects have been tested in practice as a part of the management information system development project of “Novi Sad Fair”. A case study of an improved application of CBR in prediction of future payments is discussed in the paper. This paper is originally presented at The International Conference on Hybrid Information Technology 2006, at the special session on “Intelligent Information Systems for Financial Engineering”, November 2006 in Cheju Island, Korea.     

A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming

This paper evaluates different forms of rank-based selection that are used with genetic algorithms and genetic programming. Many types of rank based selection have exactly the same expected value in terms of the sampling rate allocated to each member of the population. However, the variance associated with that sampling rate can vary depending on how selection is implemented. We examine two forms of tournament selection and compare these to linear rank-based selection using an explicit formula. Because selective pressure has a direct impact on population diversity, we also examine the interaction between selective pressure and different mutation strategies.