Ranked Relations: Query Languages and Query Processing Methods for Multimedia

In this paper, we describe the notion of a ranked relation that incorporates to the relational data model the notion of rank, i.e. ordering among tuples or objects. The ordering of tuples may be based on a single rank information, or multiple ranks combined together. We show that such relations arise naturally in many applications, especially in applications that query outside sources and return ranked relations as answers to content based queries. We introduce an algebra for querying ranked relations and give examples of its use for various applications. We then prove various properties of the algebra with special emphasis on the preservation of the coherence property, which shows when different rank columns are guaranteed to induce the same ordering among tuples. We show how these properties can be used to produce approximate early returns. Finally, we give experimental results based on Internet search engines for our early returns method and show that our method provides meaningful and fast answers to the user.     

一种支持多种编程语言的微服务应用环境实现方法

微服务架构由于其开发、部署、维护的模块化和独立特性,非常适合各种复杂工业应用的开发,互联网、云计算、大数据的快速发展也使得微服务架构成为当前软件开发的主流应用技术.本文针对典型的微服务架构,给出了一种能够兼容JAVA、Python、C++、C#等编程语言开发的微服务应用环境实现方法.实际测试表明,该方法能够实现上述编程...     

UML和建模工具Rational Rose的应用

介绍使用UML建模语言利用Rational公司发布的RationalRose在开发网上购物系统中的应用。     

Design for Proof: An Approach to the Design of Domain-Specific Languages

We propose that the domain of a Domain-Specific Language (DSL) can be characterised by: 1. the class of environments in which systems developed in the language are expected to operate; and 2. the class of properties which such systems are expected to possess. The design of DSLs should therefore include the development of a proof system that eases the task of proving the properties in the class identified for the anticipated operating environments. We develop these ideas in the context of industrial computing systems by presenting a semantics and proof system for a language based on IEC 1131-3, the international standard programming language for programmable controllers. Of particular significance in this example is the use of a diagrammatic representation and the development of a proof system for a class of invariance properties that requires only local knowledge of the structure of diagrams. Received February 1998 / Accepted in revised form October 1998     

An Observation Approach to the Semantics of Agent Communication Languages

We show how a formal framework for the observation issue in computer systems can be used for the specification of an agent behavior, abstracting away from agent inner details while focusing on its interactive behavior. This model can also be used as a specification of agent communication languages (ACLs), providing the proper abstraction level to represent the conditions causing an agent to send a message, as well as its effect on the receiving agent. In particular, this approach generalizes upon existing ACL semantics, such as FIPA ACL, that relate agent communicative acts to the agent mental state. Since the observation framework induces a more abstract architecture than other known approaches, our semantics are likely to be applicable to a wider set of agent architectures, thus better supporting standardization aims. Some application examples are shown, describing how various aspects of ACL semantics can be specified within our framework.     

RUP统一过程在创建Web中的应用

主要讨论如何使用RUP统一过程理论来开发web应用,建立高质量的web应用软件。RUP采用Inte-rnet技术,可以增强团队的开发效率,并为所有成员提供最佳的软件实现方案。     

Automatic Speech Recognition for Under-Resourced Languages: Application to Vietnamese Language

This paper presents our work in automatic speech recognition (ASR) in the context of under-resourced languages with application to Vietnamese. Different techniques for bootstrapping acoustic models are presented. First, we present the use of acoustic–phonetic unit distances and the potential of crosslingual acoustic modeling for under-resourced languages. Experimental results on Vietnamese showed that with only a few hours of target language speech data, crosslingual context independent modeling worked better than crosslingual context dependent modeling. However, it was outperformed by the latter one, when more speech data were available. We concluded, therefore, that in both cases, crosslingual systems are better than monolingual baseline systems. The proposal of grapheme-based acoustic modeling, which avoids building a phonetic dictionary, is also investigated in our work. Finally, since the use of sub-word units (morphemes, syllables, characters, etc.) can reduce the high out-of-vocabulary rate and improve the lack of text resources in statistical language modeling for under-resourced languages, we propose several methods to decompose, normalize and combine word and sub-word lattices generated from different ASR systems. The proposed lattice combination scheme results in a relative syllable error rate reduction of 6.6% over the sentence MAP baseline method for a Vietnamese ASR task.      

BRA: An Algorithm for Simulating Bounded Rational Agents

This paper describes a simulation approach for modelling decision-making processes under incomplete and imperfect information in Agent-based Computational Economics (ACE). The main idea is to represent decision-making in a model-free framework that can be applied to a larger set of simulation problems, not just the domain modelled. The method translates some basic sociopsychological concepts from the bounded rationality and learning literature into an executable algorithm. In a simple example, the algorithm is applied in the domain of behavioural game theory, illustrating how the algorithm can be used to reproduce observed patterns of human behaviour.     

Application of Generative-Grammar Formalism to Analysis of Cognate Languages

Difficulties emerging in implementing compilers of several cognate languages within the framework of a unified software system are analyzed. The problem of design of cognate language compilers of efficient structure is formulated. Ways of solution of the problem of effective construction of cognate language compilers and organization of parsing of texts in an arbitrary language are proposed and their advantages are considered.     

基于有理插值算法在无功补偿中的研究

电弧炉具有低压、大电流而且负荷非线性的特点,这就决定了无功功率相对较大.运行功率因数低,进行无功补偿是十分必要的.采用TCR+FC进行无功补偿得到了越来越多的应用.通过改变触发角来控制电抗器中电流,改变触发角大小,去调节感性无功的大小使电路中感性无功和容性无功相平衡,TCR型SVC控制中触发控制角的计算精度直接影响无功补偿的效果.文中利用有理插值法作为晶闸管触发控制角的计算方法,通过仿真表明该方法具有计算量小、精度高的特点.