基于美学家人脑模型的产品外观创新设计研究

文章以工业设计理论为基础,综合应用人工智能技术、专家系统思想、基于数据库的知识发现和知识挖掘技术等技术,模拟美学家大脑的智能活动及其思维模型的研究,通过Internet 获取市场变化、用户需求信息,实用创新技法的计算机模拟等方式,提出了基于美学家人脑模型进行产品外观创新设计的理论方法。并以典型机床为例,已编制系统初步实现了美学原则的量化、设计风格分析、产品的美学模糊评价等功能。     

Lambda-calculus schemata

A lambda-calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constant and operator symbols, certain schemata, calledlambda abstractions, naturally define partial functions over the domain of interpretation. Two implementation strategies are considered: the retention strategy in which all variable bindings are retained until no longer needed (implying the use of some sort of garbage-collected store) and the deletion strategy, modeled after the usual stack implementation of ALGOL 60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created. Not all lambda abstractions evaluate correctly under the deletion strategy. Nevertheless, both strategies are equally powerful in the sense that any lambda abstraction can be mechanically translated into another that evaluates correctly under the deletion strategy and defines the same partial function over the domain of interpretation as the original. Proof is by translation into continuation-passing style.A preliminary version of this paper appeared in theProceedings of an ACM Conference on Proving Assertions about Programs, Las Cruces, New Mexico, January 1972.Work reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported in part by the Advanced Research Projects Agency of the Department of Defense and monitored by the Office of Naval Research Under Contract Number N00014-70-A-0362-0002.     

Obtaining coroutines with continuations

Continuations, when made available to the programmer as first class objects, provide a general control abstraction for sequential computation. The power of first class continuations is demonstrated by implementing a variety of coroutine mechanisms using only continuations and functional abstraction. The importance of general abstraction mechanisms such as continuations is discussed.     

Monads and composable continuations

Moggi's use of monads to factor semantics is used to model the composable continuations of Danvy and Filinski. This yields some insights into the type systems proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects of composable continuations requires a structure that is almost, but not quite, a monad.     

Compiling lambda-expressions using continuations and factorizations

We present a source-level transformation for recursion-removal with several interesting characteristics:

1. (i) the algorithm is simple and provably correct;

2. (ii) the stack utilization regime is chosen by the compiler rather than being fixed by the run-time environment;

3. (iii) the stack is available at the source language level so that further optimizations are possible;

4. (iv) the algorithm arises from ideas in category theory.

In addition to its implications for compilers, the transformation algorithm is useful as an implementation technique for advanced LISP-based systems, and one such application is described.     

A type-theoretic foundation of delimited continuations

There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters, the continuations become composable and the calculi become more expressive. We present a fine-grained analysis of control delimiters and formalise that their addition corresponds to the addition of a single dynamically-scoped variable modelling the special top-level continuation. From a type perspective, the dynamically-scoped variable requires effect annotations. In the presence of control, the dynamically-scoped variable can be interpreted in a purely functional way by applying a store-passing style. At the type level, the effect annotations are mapped within standard classical logic extended with the dual of implication, namely subtraction. A continuation-passing-style transformation of lambda-calculus with control and subtraction is defined. Combining the translations provides a decomposition of standard CPS transformations for delimited continuations. Incidentally, we also give a direct normalisation proof of the simply-typed lambda-calculus with control and subtraction.     

A proof-theoretic foundation of abortive continuations

We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce’s law without enforcing Ex Falso Quodlibet. We show that a “natural” implementation of this logic is Parigot’s classical natural deduction. We then move on to the computational side and emphasize that Parigot’s λ μ corresponds to minimal classical logic. A continuation constant must be added to λ μ to get full classical logic. The extended calculus is isomorphic to a syntactical restriction of Felleisen’s theory of control that offers a more expressive reduction semantics. This isomorphic calculus is in correspondence with a refined version of Prawitz’s natural deduction. This article is an extended version of the conference article “Minimal Classical Logic and Control Operators” (Ariola and Herbelin, Lecture Notes in Computer Science, vol. 2719, pp. 871–885, 2003). A longer version is available as a technical report (Ariola et al., Technical Report TR608, Indiana University, 2005). Z.M. Ariola supported by National Science Foundation grant number CCR-0204389. A. Sabry supported by National Science Foundation grant number CCR-0204389, by a Visiting Researcher position at Microsoft Research, Cambridge, U.K., and by a Visiting Professor position at the University of Genova, Italy.     

On the static and dynamic extents of delimited continuations

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias ) and the dynamic delimited-control operator control (alias ). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum.

We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of ‘control queue’.     

On the dynamic extent of delimited continuations

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum.     

两类特殊命题准确形式化的语义分析法

本文采用特有的语义分析方法对两类自然语言所表示的特殊命题进行准确形式化的讨论与研究。否定了一些错误形式,得到了这两类特殊命题正确形式化的公式和方法。     

The mistress user's book

The MISTRESS User's Book is reproduced here at our enthusiastic invitation. Inspired by it ourselves, we feel that it will be a far greater inspiration to writers than any number of dry articles on how to document software systems. It is introduced below by its authors.     

A Hierarchy of SOS Rule Formats

In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981. Also published in: Journal of Logic and Algebraic Programming 60–61 (2004) 17–140]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS's) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security- and probability-related issues. In this paper, we provide an initial hierarchy of SOS rules formats and meta-theorems formulated around them.     

Construction of convex continuations for functions defined on a hypersphere

Construction of convex continuations for functions defined on the vertices of some combinatorial polyhedra, in particular the permutation polyhedron and the arrangement polyhedron, has been studied in [1, 2]. Subsequently this result has been generalized to functions defined at the extreme points of an arbitrary polyhedron [3]. For purposes of combinatorial optimization [4-6] it is relevant to consider the existence and construction of convex continuations from continua, in particular, when the function is defined on a hypersphere in thek-dimensional space. Unfortunately, passage to the limit from discrete sets to continua does not produce positive results in this case. We are thus forced to develop special approaches to investigating the existence of convex continuations of functions defined on continua. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 27–36, March–April, 1998.     

一种有效的XQuery更新操作

XQuery是XML查询语言的推荐标准。正如其它数据查询语言一样,XQuery也有自己的更新操作,XQuery更新操作就是用插入、替换、删除等操作对XML文档树进行修改,本文依照W3C组织7月草案[1]对XQuery更新操作提出了一些新的想法。诸如:对上述操作进行完善,使之更易读写,还设想了一个update操作符用来进行集中式更新操作,可以提高执行效率。当然这些都符合草案关于XQuery更新操作的规范[2]。     

屏幕录像技术的优化

视频具有形声性、再现性等特点,对于过程的记录和展示具有较大作用。文章分析了常用屏幕录像软件的类型、特点及其设置要求,对屏幕录像过程及其注意事项进行了阐述,以期提高屏幕录像资源的质量。     

The semantics of the combination of atomized statements and parallel choice

In this paper we define a uniform language that is an extension of the language underlying the process algebraPA. One of the main extensions of this language overPA is given by so-called atomizing brackets. If we place these brackets around a statement then we treat this statement as an atomic action. Put differently, these brackets remove all interleaving points. We present a transition system for the language and derive its operational semantics. We show that there are several options for defining a transition system such that the resulting operational semantics is a conservative extension of the semantics forPA. We define a semantic domain and a denotational model for the language. Next we define a closure operator on the semantic domain and show how to use this closure operator to derive a fully abstract denotational semantics. Then the algebraic theory of the language is considered. We define a collection of axioms and a term rewrite system based on these axioms. Using this term rewrite system we are able to identify normal forms for the language. It is shown that these axioms capture the denotational equality. It follows that if two terms are provably equal then they have the same operational semantics. Finally, we show how to extend the axiomatization in order to axiomatize its operational equivalence.     

一个基于语义的中文事件论元抽取方法

中文是一种话题结构的语言,其表达方式比较灵活,但句法结构不如英文严谨,导致了事件中论元与触发词的关系较松散。现有的论元抽取方法多数是基于浅层语义的句法结构特征,从而造成了论元抽取性能低下。为了解决这个问题,提出了基于语义的中文事件论元抽取方法。该方法利用角色、实体和触发词的语义,弥补了论元抽取中单纯采用句法特征的缺陷。在ACE2005中文语料上的测试结果表明,该方法与基准系统相比具有更高的性能。     

CSS在FrontPage中的应用

FrontPage是一个简单易学且功能强大的网页制作软件,将它有效地与CSS技术结合起来可以使FrontPage的功能更加完善。本文介绍了如何在FrontPage中应用CSS的各种样式表.     

The rewriting logic semantics project

Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balance between abstraction and computational observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.     

The Rewriting Logic Semantics Project

Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory's axioms include both equations and rewrite rules provides a very useful “abstraction knob” to find the right balance between abstraction and observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.