The Simplicity and Power model for inductive inference

With this paper we wish to present a simplicity (informally ‘simple explanations are the best’) formalism that is easily and directly applicable to modeling problems in cognitive science. While simplicity has been extensively advocated as a psychologically relevant principle, a general modeling formalism has been lacking. The Simplicity and Power model (SP) is a particular simplicity-based framework, that has been supported in machine learning (Wolff, Unifying computing and cognition: the SP theory and its applications, 2006). We propose its utility in cognitive modeling. For illustration, we provide SP demonstrations of the trade-off between encoding with whole exemplars versus parts of stimuli in learning and the effect of wide versus narrow distributions in categorization. In both cases, SP computations show how simplicity can account for these contrasts, in terms of how the frequency of individual exemplars in training compares to the frequency of their constituent parts.     

From P2P to reliable semantic P2P systems

Current research to harness the power of P2P networks involves building reliable Semantic Peer-to-Peer (SP2P) systems. SP2P systems combine two complementary technologies: P2P networking and ontologies. There are several types of SP2P systems with applications to knowledge management systems, databases, the Semantic Web, emergent semantics, web services, and information systems. Correct semantic mapping is fundamental for success of SP2P systems where semantic mapping refers to semantic relationship between concepts from different ontologies. Current research on SP2P systems has emphasized semantics at the cost of dealing with the traditional issues of P2P networks of reliability and scalability. As a result of their lack of resilience to temporary mapping faults, SP2P systems can suffer from disconnection failures. Disconnection failures arise when SP2P systems that use adaptive query routing methods treat temporary mapping faults as permanent mapping faults. This paper identifies the disconnection failure problem due to temporary semantic mapping faults and proposes an algorithm to resolve it. To identify the problem, we will use a simulation model of SP2P systems. The Fault-Tolerant Adaptive Query Routing (FTAQR) algorithm proposed to resolve the problem is an adaptation of the generous tit-for-tat method originally developed in evolutionary game theory. The paper demonstrates that the reliability of an SP2P system increases by using the algorithm.     

External and internal attentional environments I. The utilization of cardiac deceleratory and acceleratory response data for evaluating differences in mental workload between machine-paced and self-paced work ∗

Previous evidence has suggested that self-paced (SP) task performance may constitute a higher mental workload than machine-paced (MP) performance. These differences in mental workload were thought to be due to the presence, when working SP, of an internal pacing mechanism serving to maintain the worker's rhythm. In MP tasks, this function would be maintained externally by the machine. The present investigation attempted to directly test this hypothesis. For this purpose, Lacey's psychophysiological model relating changes in heart rate (HR) to attentional demands was employed. Differences in cardiac deceleratory and acceleratory activity between MP and SP performance were evaluated for each of two tasks. In one task, the emphasis was predominantly on visual detection. Based on the suspected direction of attentional demands, this task was characterized as external. The other task required mental solution to arithmetic problems and was categorized accordingly as internal. Psychophysiological findings were consistent with Lacey's basic model and offered no support for the existence of an internal pacing mechanism under SP conditions. Instead, they suggested the presence of uncertainty factors reflecting higher mental workload during the MP performance of both tasks. Performance data, however, did not support the causal interpretation given by Lacey for his psychophysiological model, and were explained in terms of a complex interplay between HR level and HR change.     

论引用监控机等若干关键计算机安全思想

Reference Monior（RM）和Security Policy(SP)等是非常基础的计算机安全概念,本文对RM和SP及相关的概念的形成过程和应用情况进行分析,就它们的真正意义及准确的中文命名给出我们的看法,同时指出现有的对应中文术语的不贴切之处,我们以充足的证据阐明我们的观点的正确性,以求能为计算机安全系统的研发和应用提供正确借鉴。     

Challenges and Research Directions in Agent-Oriented Software Engineering

Agent-based computing is a promising approach for developing applications in complex domains. However, despite the great deal of research in the area, a number of challenges still need to be faced (i) to make agent-based computing a widely accepted paradigm in software engineering practice, and (ii) to turn agent-oriented software abstractions into practical tools for facing the complexity of modern application areas. In this paper, after a short introduction to the key concepts of agent-based computing (as they pertain to software engineering), we characterise the emerging key issues in multiagent systems (MASs) engineering. In particular, we show that such issues can be analysed in terms of three different scales of observation, i.e., in analogy with the scales of observation of physical phenomena, in terms of micro, macro, and meso scales. Based on this characterisation, we discuss, for each scale of observation, what are the peculiar engineering issues arising, the key research challenges to be solved, and the most promising research directions to be explored in the future.     

Representation of highly-complex knowledge in a database

This paper presents a unified framework for representing highly-complex knowledge in a database as a new paradigm for handling large and complex information in an easy and efficient manner. The framework provides a database with the capabilities to support next generation databases for decision support systems through the use of derivation rules, temporal information, knowledge from multiple sources with different measures of quality and epistemic knowledge. The model integrates concepts from both thedatabase and theartificial intelligence disciplines.     

基于子空间信息量准则的软测量模型选择研究

提出了子空间信息量概念及其准则,并引出了函数集信息量的概念;在此基础上,阐述了基于上述概念和准则的软测量模型选择理论,指出并解决了软测量模型选择欠学习与过学习问题;给出了一种次优软测量模型选择算法。最后,通过具体实例验证了上述方法的可行性和优越性。     

基于时空分析的线索性事件的抽取与集成系统研究

信息抽取技术能够提供高质量的检索服务。本文面向网络新闻事件,对人们感兴趣的事件关键信息进行了抽取和集成。系统中采用了如下的方法、策略: (1) 利用句型模板构造抽取规则,然后直接从经过时间短语和空间短语识别和规范化处理的文本中抽取事件信息,从而跳过了深层句法分析,降低了实现系统的难度; (2) 利用事件的规范化的时空信息关联不同文档中的同一事件,进行事件合并; (3) 文档发生事件转移时对文档进行事件切分,从而解决了文档内不同事件信息的归并问题。初步实验结果表明:本文采用的方法和策略是有效的。     

A Contextual Approach for Designing and Using OR Quantitative Models

Practitioners of Operations Research (OR) traditionally concentrate on mathematical and computational aspects of quantitative models, sometimes resulting in risky implementation or early model obsolescence. We propose an approach, inspired by system concepts and technology management, which includes softer influences, such as decision frequency, model life cycle and technological stage of management, to help modeling and model management decisions. Some graphic indicators are developed to help diagnosis and conception.     

Classical mereology and restricted domains

Classical Mereology, the formal theory of the concepts of part, overlap and sum as defined by Le niewski does not have any notion of being a whole. Because of this neutrality the concepts of Mereology are applicable in each and every domain. This point of view is not generally accepted. But a closer look at domain-specific approaches defining non-classical (quasi)-mereological notions reveals that the question of whether something belongs to a restricted domain (and, thus, fulfills a certain criterion of integrity) has come to be mixed up with the question of whether it exists. We claim that the structural differences between restricted domains are not based on different mereological concepts, but on different concepts of being a whole. Taking Classical Mereology for granted in looking at different domains can shed more light on the specific nature of these domains, their similarities and differences. Three examples of axiomatic accounts dealing with restricted domains (linear orders of extended entities as they can be found in discussions of the ontology of time, topological structure and set-theory) are discussed. We show that Classical Mereology is applicable to these domains as soon as they are seen as being embedded in a less restricted (or even the most comprehensive) domain. Each of the accounts may be axiomatically formulated by adding one non-mereological primitive to whatever concepts are chosen to develop Classical Mereology. These primitives are strongly related to the domain-specific notions of integrity or being a whole.