Polite computing

This paper presents politeness as a key social requirement for computer human interaction (CHI). Politeness is defined, in information terms, as offering the locus of control of a social interaction to another party. Software that creates pop-up windows is not illegal, but is impolite, as it preempts user choice. It is proposed that impolite software drives users away, while polite software attracts them. Specifying politeness suggests four requirements: (1) Respect user choice (2) Disclose yourself (3) Offer useful choices (4) Remember past choices. Software that ignores these rules may fail not by logic error but by social error. “Mr. Clippy” is an example of software that users often disable because it is impolite. Operating systems could support application politeness by providing an application source registry and a general meta-choice console. A future is envisaged where software politeness is a critical software success requirement.     

Polite personal agent

Personal agents are computer programs that learn users' interests, preferences, and habits and give them proactive, personalized assistance with a computer application. Such agents are analogous to personal assistants in the real-world work environment. Both agents and assistants gradually learn a target individual's preferences and habits to enhance collaboration and productivity.     

基于代数特征与粗糙集相结合的特征提取方法

对特征抽取方法进行了研究,提出一种新的特征抽取方法,克服了Roman W等提出的特征抽取方法中缺乏鉴别信息的缺点.通过对高维的人脸数据用PCA和LDA降维,利用粗糙集理论中的属性约简算法进行进一步的维数压缩.实验结果表明,该方法具有良好的性能.     

关于代数攻击中代数免疫的若干性质分析

代数免疫是衡量布尔函数抵抗代数攻击能力的重要指标,本文证明了在仿射变换作用下,代数免疫保持不变,并且通过证明布尔函数与仿射函数异或后所得到的新函数与原布尔函数代数免疫最多相差1,找到了Walsh谱与代数免疫的关系,使得代数免疫作为密码函数的一个性质特征与其他特征类似,同样可以通过谱来衡量。     

关于代数攻击中代数免疫的若干性质分析

代数免疫是衡量布尔函数抵抗代数攻击能力的重要指标,本文证明了在仿射变换作用下,代数免疫保持不变,并且通过证明布尔函数与仿射函数异或后所得到的新函数与原布尔函数代数免疫最多相差1,找到了Walsh谱与代数免疫的关系,使得代数免疫作为密码函数的一个性质特征与其他特征类似,同样可以通过谱来衡量.     

A Formal and Tool-Equipped Approach for the Integration of State Diagrams and Formal Datatypes

Separation of concerns or aspects is a way to deal with the increasing complexity of systems. The separate design of models for different aspects also promotes a better reusability level. However, an important issue is then to define means to integrate them into a global model. We present a formal and tool-equipped approach for the integration of dynamic models (behaviors expressed using state diagrams) and static models (formal data types) with the benefit to share advantages of both: graphical user-friendly models for behaviors, formal and abstract models for data types. Integration is achieved in a generic way so that it can deal with both different static specification languages (algebraic specifications, Z, B) and different dynamic specification semantics     

Robust Plotting of Polar Algebraic Curves, Space Algebraic Curves, and Offsets of Planar Algebraic Curves

In this paper, based on modifications to the well-known subdivision scheme in combination with modified affine arithmetic method to guide the subdivision, we propose four robust and reliable algorithms for plotting polar algebraic curves, space algebraic curves and offsets of planar algebraic curves.     

Decomposition of Algebraic Functions

Functional decomposition—whether a functionf(x) can be written as a composition of functionsg(h(x)) in a non-trivial way—is an important primitive in symbolic computation systems. The problem of univariate polynomial decomposition was shown to have an efficient solution by Kozen and Landau (1989). Dickerson (1987) and Gathen (1990a) gave algorithms for certain multivariate cases. Zippel (1991) showed how to decompose rational functions. In this paper, we address the issue of decomposition of algebraic functions. We show that the problem is related to univariate resultants in algebraic function fields, and in fact can be reformulated as a problem ofresultant decomposition. We characterize all decompositions of a given algebraic function up to isomorphism, and give an exponential time algorithm for finding a non-trivial one if it exists. The algorithm involves genus calculations and constructing transcendental generators of fields of genus zero.     

Algebraic program testing

Summary An approach to the study of program testing is introduced in which program testing is treated as a special kind of equivalence problem. In this approach, classes of programs P ^* and associated classes of test sets T ^* are defined which have the property that if two programs P and Q in P ^* agree on a set of tests from T ^*, then P and Q are computationally equivalent. The properties of a class P ^* and the associated class T ^* can be thought of as defining a set of assumptions about a hypothetical correct version Q of a program P in P ^*. If the assumptions are valid then it is possible to prove the correctness of P by testing. The main result of the paper is an equivalence theorem for classes of programs which carry out sequences of computations involving the elements of arrays.This research was funded by the National Science Foundation under grant No. MCS 76-03295     

Process Algebraic Non-product-forms

A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interacting processes such as arise in multi-class queueing networks with Processor Sharing servers. It is based on an analysis of the minimal cycles in the state space of a multi-agent cooperation, which can be simply identified. The extended methodology leads to what we believe are new separable solutions and, more generally, the results represent a viable practical application of the theory of Markovian process algebras in stochastic modelling.     

Algebraic nonrobustness conditions

We consider systems with small gain and phase margins (nonrobust systems). We obtain conditions on roots and coefficients of characteristic polynomials for open- and closed-loop nonrobust systems. These conditions are used to find the boundaries of modal control pole placement regions that guarantee a system’s robustness.     

基于代数正规型构造的代数免疫最优布尔函数

现有代数免疫最优布尔函数的构造方法大多基于支撑集,通过代数正规型直接构造的方法研究较少.为此,利用代数正规型的多项式表示构造一类代数免疫性质优的布尔函数,研究其代数次数、代数免疫阶、函数重量、非线性度等性质,分析采用这种方法构造的代数免疫最优布尔函数的性质及计数等结果.由构造方法可以得到代数免疫最优的布尔函数,其中包含一些已有的特殊构造结果,表明该方法更具有一般性,包含更多具有最优代数免疫阶的函数.     

Vague矩阵的代数性质

在Vague集理论的基础上,结合Vague关系和Vague集的运算,讨论了Vague矩阵的一些相关性质,并给出了m×n阶Vague矩阵的全体所具有的代数结构。     

拟左群的一个代数结构

给出一个拟左群同构于拟群和左零带的直积的一个充分必要条件,同时给出了左群的收缩诣零扩张的一个刻画。     

Algebraic theory of probabilistic processes

In this paper we extend de Nicola and Hennessy’s testing theory to deal with probabilities. We say that two processes are testing equivalent if the probabilities with which they pass any test are equal. We present three alternative semantic views of our testing equivalence. First, we introduce adequate extensions of acceptance sets (inducing an operational characterization) and acceptance trees (inducing a denotational semantics). We also present a sound and complete axiomatization of our testing equivalence. So, this paper represents a complete study of the adaptation of the classical testing theory for probabilistic processes.     

Algebraic geometry of Bayesian networks

We study the algebraic varieties defined by the conditional independence statements of Bayesian networks. A complete algebraic classification is given for Bayesian networks on at most five random variables. Hidden variables are related to the geometry of higher secant varieties.