Programming an expressive autonomous agent

Emotions are the integral part of human cognitive processes. To make an artificial agent more human-like, agent programming languages should be able to model the emotion based artificial agent. To address the need of incorporation of emotions in agent programming languages, recently, extension of 2APL with emotions is proposed by the researchers. However, they were unable to program complex emotion dynamics, due to integration complexities associated with advanced emotive models. They have modified 2APL by designing E-rules, coping rules, and an interface-Affect Engine. The Affect Engine establishes a link between the modified 2APL and a rather simpler emotion model, ALMA. Here, we propose the programming constructs for integrating an advanced yet rule based emotion model, EMIA, in line with the 2APL. The fusion of both has been carried out by redefining the syntax, semantics and deliberation cycle of the 2APL. These redefinitions lead to the required transformation in the dialect cycle; from the sense-interpret-act to percept–appraisal-elicitation-act. The proposed novel programming constructs and pragmatics enable flexible and adaptive emotional behavioral modeling for an expressive autonomous agent with domain independent emotion elicitation, emotion regulation and emotion transition processes. The simulation results show high believability in the emotions expressed by the agent while responding to the real life scenarios.     

Real-time painting with an expressive virtual Chinese brush

Many painters today are going digital; because of the convenience and ease of experimentation that painting software gives. Our goal is to effectively simulate the process of brush painting - particularly the dynamics of a brush tuft - so that artists can use a virtual brush to paint with spirit - that is, in a lively, dynamic, brisk way. We've designed an efficient deformable brush model with spreading bristles that works in real time with consumer-level hardware. Our system renders realistic brushwork in response to input data captured from a device with six degrees of freedom (DOFs). Our research thus far focuses on brush modeling and ink depositing from brush to paper. The simulation of ink diffusion on paper, another important feature of Eastern brushwork, is a future goal.     

Data memory organization and optimizations in application-specificsystems

In application-specific designs, customized memory organization expands the search space for cost-optimized solutions. Several optimization strategies can be applied to embedded systems with several different memory architectures: data cache, scratch-pad memory, custom memory architectures, and dynamic random-access memory (DRAM)     

Toward an expert system for expressive musical performance

The development and implementation of an expert system that determines the tempo and articulations of Bach fugues are described. The rules in the knowledge base are based on the expertise of two professional performers. The system's input is a numeric representation of the fugue. The system processes the input using a transition graph, a data structure consisting of nodes where data is stored and edges that connect the nodes. The transition graph recognizes rhythmic patterns in the input. Once the system identifies a pattern, it applies a specific rule or performs a procedure. System output consists of a listing of tempo and articulation instructions. To validate the expert system, its output was compared with versions of fugues edited by one of the two experts used in developing the system. In tests with six fugues, the expert system generated the same editing instructions 85 to 90% of the time     

GXL to GraphML and Vice Versa with XSLT

We explore the issues involved in converting graph data stored in GXL or GraphML into each other. It turns out that XSLT provides a simple, portable, and effective mechanism for format conversion in either direction. As a by-product, some subtle differences between the formats become apparent.     

基于XSLT的XML安全的应用研究

扩展标记语言(XML)的出现,使得在异构环境下数据的交换和传输成为可能.在应用过程中,对传输中文档安全性的要求就显得异常重要.与XML紧密相关的是扩展样式表语言(XSL),其文档转换组件(XSLT)具有强大的功能,能够对文档进行编码转换以便进行安全传输.本文通过在XML中的实际应用来加以验证;同时本文提出了一种将XSLT作为插件考虑的文档传输体系;并且标识出了为适应这种应用需求,要用到的XSLT的相关属性.通过利用XSLT所具有的扩展函数,可知XSLT是最适合XML数据安全应用的方案.     

利用XSLT转换XML文档的应用

XML实现了数据与表示的分离,需要通过样式表来显示XML数据.目前有两种常用的样式表格式CSS和XSL.本文首先讨论了CSS的不足和XSL的优势,然后介绍了XSL和XSLT转换语言,并深入讨论了XSLT的工作原理,最后结合水调工程中的一个实例,具体说明如何利用XSLT分别实现在浏览器和服务器端XML文档的转换.     

From Böhm's Theorem to Observational Equivalences: an Informal Account

There are essentially two ways of looking at the computational behaviours of λ-terms. One consists in putting the term within a context (possibly of λ-calculus extensions) and observing some properties (typically termination). The other consists in reducing the term until some meaningful information is obtained: this naturally leads to a tree representation of the information implicitly contained in the original term. The paper is an informal overview of the role played by Böhm's Theorem in these observations of terms.     

用XSLT实现XML文档的查询

首先介绍用XSLT实现SML文档查询时,采用的处理模型以及相关XSLT指令在XML文档查询中的运用,接着给出一个查询示例,最后针对XML文档的查询,比较了XSLT与XQUERY的差别。     

On Deciding Readiness and Failure Equivalences for Processes

In this paper, we study the complexity of deciding readiness and failure equivalences for finite state processes and recursively defined processes specified by normed context-free grammars (CFGs) in Greibach normal form (GNF). The results are as follows: (1) Readiness and failure equivalences for processes specified by normed GNF CFGs are both undecidable. For this class of processes, the regularity problem with respect to failure or readiness equivalence is also undecidable. Moreover, all these undecidability results hold even for locally unary processes. In the unary case, these problems become decidable. In fact, they are Π^p₂-complete, We also show that with respect to bisimulation equivalence, the regularity for processes specified by normed GNF CFGs is NL-complete. (2) Readiness and failure equivalences for finite state processes are PSPACE-complete. This holds even for locally unary finite state processes. These two equivalences are co-NP-complete for unary finite state processes. Further, for acyclic finite state processes, readiness and failure equivalences are co-NP-complete and they are NL-complete in the unary case. (3) For finite tree processes, we show that finite trace, readiness, and failure equivalences are all L-complete. Further, the results remain true for the unary case. Our results provide a complete characterization of the computational complexity of deciding readiness and failure equivalences for several important classes of processes.     

Output schemas of XSLT stylesheets and their applications

The capabilities of XSLT processing are widely used to transform XML documents into target XML documents. These target XML documents conform to output schemas of the used XSLT stylesheet. Output schemas of XSLT stylesheets can be used for a static analysis of the used XSLT stylesheet, to automatically detect the XSLT stylesheet of target XML documents or to reason on the output schema without access to the target XML documents. In this paper, we develop an approach to automatically determining the output schema of an XSLT stylesheet. We also describe several application scenarios of output schemas. The experimental evaluation shows that our prototype can determine the output schemas of nearly all typical XSLT stylesheets and the improvements in preciseness in several application scenarios when using output schemas in comparison to when not using output schemas.     

XSLT在XML向HTML转换中的作用

XML是一种显示数据的标记语言,它能使数据通过网络无障碍地进行传输,并显示在用户的浏览器上.XML实现了数据与表示的分离,需要通过样式表来显示XML数据.介绍XSLT的特性及功能,通过示例,介绍通过XSLT如何将一个XML文档转换为HTML文档的方法.并说明该方法的用途.     

Program and proof optimizations with type systems

We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented in terms of types ascribed to expressions and statements, certifiable by type derivations, and the transformation component carries out the optimizations that the type derivations license. We describe dead code elimination and common subexpression elimination. In the case of common subexpression elimination we circumvent non-compositionality with a combined type system for a combination of two analyses. The motivation of this work lies in certified code applications, where an optimization of a program must be supported by a checkable justification. As an example application we highlight “proof optimization”, i.e., mechanical transformation of a program’s functional correctness proof together with the program, based on the analysis type derivation.     

Concurrency control optimizations in a prolog database

The degree of concurrency allowed by a concurrency control scheme depends on the knowledge it has about the database and the transactions. This paper analyzes the syntactic information available in a Prolog database to improve concurrency. An optimistic concurrency control scheme is chosen since it is a natural choice for Prolog databases. The conflict criteria among transactions in a Prolog environment is translated into conditions on the query search tree. This aids in identifying concurrency related information from the depth-first search execution strategy. A spesented in stages such that progressively more information is considered to construct the read and the write sets (required to check conflicts) and better concurrency is achieved. An orthogonal contribution of the information analysis is a new query evaluation optimization. The price for better concurrency is paid in terms of increased storage and computation costs. The optimality of the algorithms with respect to the available information and derived concurrency is discussed qualitatively.This work was supported by the National Science Foundation under grant DCR-8502161 and CCR-8701671, and by the New York State Center for Advanced Technologies under contract CAT (89)-5.     

基于XSLT与SVG实现动态矢量WebGIS

设计了一种基于XSLT与SVG的动态矢量WebGIS实现方案。在该方案中,WebGIS服务器通过对客户端请求的分析,对于存储为XML/GML数据库的地理空间数据,通过XML查询进行数据抽取,接着对得到XML/GML文档进行整理,得到该文档对应的元数据,并通过查询GIS应用服务器上的XSL元数据库,得到该文档中元数据所对应的XSL元数据,然后将出现的XSL元数据进行集成,生成一个新的样式表（XSL）,根据这个样式表将XML/GML文档经XSLT转换转化为SVG图像,并经过GZIP压缩将其压缩为SVGZ格式传往客户端,从而实现了地理空间数据的矢量传输和显示。由于根据用户的请求动态下载数据生成包含SVGZ的Web页面传给客户端,所以这种WebGIS不仅安全可靠也具有较高的效率。     

运用XML和XSLT技术实现Web页面的重用

从分析页面结构特征入手,运用XML和XSLT技术实现Web页面的重用。该方法用动态XML文件定义页面的组成,用XSLT文件定义页面布局,通过XSLT转化把二者统一起来得到最终的页面。页面布局与页面组成的分离实现了页面布局和页面组成块的重用。     

基于XSLT的XML文档信息隐藏方法研究

XML文档具有存储与显示分离的特性,利用XSLT可以将同一篇XML文档显示出不同的内容,这样就可以实现隐藏信息的目的。通过研究XML的样式表转换,提出了基于XSLT的内容抽取、内容比较、样式表合并的三种XML文档信息隐藏方法,每种隐藏方法利用了样式表元素的不同性质,并通过实例对进行具体介绍和分析。上述三种隐藏方法主要针对文档的显示特性,不对文档存储的格式和内容做任何改动。实验结果表明,利用样式表转换的方法在XML文档中隐藏信息具有实现简单、安全性高的特点。     

基于XSLT的动态搜索技术研究与实现

利用XSLT将XML文档转换成格式化过的HTML代码的方法的提出，避免了Ajax中使用JavaScipt动态遍历XML节点来创建结果表格所导致创建一个大字符串所引发的种种问题．提高了代码的可维护性．改善了网络性能。     

Computing optimal outcomes under an expressive representation of settings with externalities

When a decision must be made based on the preferences of multiple agents, and the space of possible outcomes is combinatorial in nature, it becomes necessary to think about how preferences should be represented, and how this affects the complexity of finding an optimal (or at least a good) outcome. We study settings with externalities, where each agent controls one or more variables, and how these variables are set affects not only the agent herself, but also potentially the other agents. For example, one agent may decide to reduce her pollution, which will come at a cost to herself, but will result in a benefit for all other agents. We formalize how to represent such domains and show that in a number of key special cases, it is NP-complete to determine whether there exists a nontrivial feasible solution (and therefore the maximum social welfare is completely inapproximable). However, for one important special case, we give an algorithm that converges to the solution with the maximal concession by each agent (in a linear number of rounds for utility functions that additively decompose into piecewise constant functions). Maximizing social welfare, however, remains NP-hard even in this setting. We also demonstrate a special case that can be solved in polynomial time using linear programming.