The M-computations induced by accessibility relations in nonstandard models M of Hoare logic

Hoare logic [1] is a logic used as a way of specifying semantics of programming languages, which has been extended to be a separation logic to reason about mutable heap structure [2]. In a model M of Hoare logic, each program α induces an M-computable function f _α ^M on the universe of M; and the M-recursive functions are defined on M. It will be proved that the class of all the M-computable functions f _α ^M induced by programs is equal to the class of all the M-recursive functions. Moreover, each M-recursive function is \(\sum {_1^{{N^M}}} \)-definable in M, where the universal quantifier is a number quantifier ranging over the standard part of a nonstandard model M.     

Vague集的模糊熵和距离测度的相互诱导关系

Vague集自提出以来,由于它在各个领域中的广泛应用而引起众多学者的注意,而模糊熵和距离测度是其中的关键技术。目前已有多种Vague集的模糊熵和距离测度的计算方法被提出来,但所有这些研究都没有讨论两者之间的联系。论文基于Vague集的模糊熵和距离测度的公理化定义,给出两者之间的相互诱导关系,建立了模糊熵和距离测度之间的联系。     

Optimal DG placement by multi-objective opposition based chaotic differential evolution for techno-economic analysis

Placement of optimally sized distributed generator (DG) units at optimal locations in the radial distribution networks can play a major role in improving the system performance. The maximum economic and technical benefits can be extracted by minimizing various objectives including yearly economic loss which includes installation, operation and maintenance cost, power loss as well as voltage deviation throughout the buses. The present problem is analysed considering these multi-objective frameworks and presents the best compromise solution or Pareto-optimal solution. Several equality and inequality constraints are also considered for the multi-objective optimization problem. In this paper, a novel multi-objective opposition based chaotic differential evolution (MOCDE) algorithm is proposed for solving the multi-objective problem in order to avoid premature convergence. Performance of population based meta-heuristic techniques largely depends on the proper selections of control parameters. It is reported that wrong parameters selection may lead to premature convergence and even stagnation. The proposed technique uses logistic mapping to generate chaotic sequence for control parameters. The proposed algorithm is implemented on IEEE-33 and IEEE-69 bus radial distribution systems for verifying its effectiveness. A comparative analysis with other modern multi-objective algorithms like NSGA-II, SPEA2 and MOPSO is also presented in this work. It is observed that the proposed algorithm can produce better results in terms of power loss and yearly economic loss minimization as well as improvement of voltage profile.     

Fuzzy closure operators II: induced relations,representation, and examples

 Closure operators (and related structures) are investigated from the point of view of fuzzy set theory. The paper is a follow up to [7] where fundamental notions and result have been established. The present approach generalizes the existing approaches in two ways: first, complete residuated lattices are used as the structures of truth values (leaving the unite interval [0,1] with minimum and other t-norms particular cases); second, the monotony condition is formulated so that it can reflect also partial subsethood (not only full subsethood as in other approaches). In this paper, we study relations induced by fuzzy closure operators (fuzzy quasiorders and similarities); factorization of closure systems by similarities and by so-called decrease of logical precision; representation of fuzzy closure operators by (crisp) closure operators; relation to consequence relations; and natural examples illustrating the notions and results. Supported by grant no. 201/99/P060 of the GA ČR and by NATO Advanced Fellowship B for 2000. The author would like to thank to Professor G. Gerla for helpful comments. Part of the paper written during author's research visit at the Center for Intelligent Systems, State University of New York at Binghamton. Support by the Center and by its director, Professor G.J. Klir, is gratefully acknowledged.     

Improving image retrieval by using spatial relations

In this paper we proposed the use of spatial relations as a way of improving annotation-based image retrieval. We analyzed different types of spatial relations and selected the most adequate ones for image retrieval. We developed an image comparison and retrieval method based on conceptual graphs, which incorporates spatial relations. Additionally, we proposed an alternative term-weighting scheme and explored the use of more than one sample image for retrieval using several late fusion techniques. Our methods were evaluated with a rich and complex image dataset, based on the 39 topics developed for the ImageCLEF 2008 photo retrieval task. Results show that: (i) incorporating spatial relations produces a significant increase in performance, (ii) the label weighting scheme we proposed obtains better results than other traditional schemes, and (iii) the combination of several sample images using late fusion produces an additional improvement in retrieval according to several metrics.     

Verifying Concurrent Data Structures by Simulation

We describe an approach to verifying concurrent data structures based on simulation between two Input/Output Automata (IOAs), modelling the specification and the implementation. We explain how we used this approach in mechanically verifying a simple lock-free stack implementation using forward simulation, and briefly discuss our experience in verifying three other lock-free algorithms which all required the use of backward simulation.     

Input-output relations for systems described by parabolic equations

This paper deals with the boundary value problem for a system described by a fourth-order parabolic equation which has been derived for the vibratory motion of an elastic plate. By defining the bending moment and the stress acting on the boundary as the input, and the displacement and the inclination at the boundary as the output, the direct and inverse input-output relations have been obtained. General parabolic systems with boundary inputs and boundary outputs are dealt with, and the input-output relations are obtained, accompanied with some examples.     

The loyal opposition of open source, Linux...and hype

The author discusses the hype surrounding the Linux operating system and open-source software development. Some see Linux not just as an OS but as the epitome of open source, a software development approach based on communal ownership and improvement of software, a movement they believe is vital to the best interests of software's future     

Bounded quantification and relations recognizable by finite automata

Summary The concept of inverse well-known for homomorphisms and gsm-mappings is extended to any language operation. The class IRP of language operations whose inverse preserves regularity is considered. As an application a necessary and sufficient condition is established for the class of relations recognizable by finite automata to be closed under different versions of bounded quantification.     

Chaotic sequence and opposition learning guided approach for data clustering

Pattern Analysis and Applications - Data clustering is a prevalent problem that belongs to the data mining domain. It aims to partition the given data objects into some specified number of clusters...     

基于网页结构挖掘的信息提取

本文提出了两种细粒度的、基于网页结构挖掘的信息提取方法,比较了它们的优缺点,并给出了相应具体实现的性能测试和结果分析.     

Analysis of Cluster Structures by Different Similarity Measures

Cybernetics and Systems Analysis - The analysis of cluster formations used in applied problems is given. In various studies, data segmentation is usually performed by only one form of clusters. It...     

Debugging Haskell by Observing Intermediate Data Structures

Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell community that can help debug full Haskell. This paper describes a portable debugger for full Haskell, building only on commonly implemented extensions. It is based on the concept of observation of intermediate data structures, rather than the more traditional stepping and variable examination paradigm used by traditional imperative debuggers.     

使用频繁结构提炼网络权威资源

在网络资源中有丰富的、对于许多应用领域有用的动态信息,已有许多的研究工作致力于提高网络中信息检索的质量,然而,这些工作中的大部分仍不能满足用户形形色色的请求．利用网络中的超链接提出新的算法ESFP来改善从搜索引擎返回的搜索结果的质量．运用SFP算法构造ESFP算法,完成从复杂的网络拓扑结构中提取权威的页面和社团．通过运行若干个实验来描述所提出的算法,这些实验数据表明,在处理搜索结果中使用ESFP算法在性能上要优于许多已知的算法如HITS等．     

用TC制作数据结构课件

在计算机科学中,数据结构不仅是一般程序设计的基础,而且是设计和编译程序、操作系统、数据库系统及其他系统程序和大型应用程序的重要基础。本课件的开发以Turb0C2．0为工具,运用其丰富的屏幕操作与图形函数功能对二叉树这种数据结构进行了模拟。汉字技术和键盘的处理技术的引用提供了一个人机交互的机会,能清晰透彻地理解运行的全过程。色彩与动画的有机结合,达到一目了然的效果,更能轻松地学习和掌握此门学科。     

Transitive approximation of fuzzy relations by alternating closures and openings

 In this paper, a new method is proposed for approximating a fuzzy relation on a finite universe by a min-transitive fuzzy relation that is `close' to it. The method consists of a cascade of T-transitive closure and opening operations, where the t-norm T gradually progresses from the Lukasiewicz t-norm W to the minimum operator M. The underlying T-transitive opening heuristic is particularly interesting for t-norms T that belong to the class of copulas.     

利用概念属性的约束关系构建本体论概念层次

本体论概念层次构建是本体论工程的重要任务之一。通过分析本体论概念属性间的约束关系,借助于布尔方程衍生概念属性间的存在约束,提出了根据概念属性间存在约束关系构建本体论概念层次的方法,并在此基础上给出了本体论概念层次的维护算法。