检索结果-内蒙古大学图书馆

IEEE Annual conference on Pervasive Computing and Communications Workshops (PerCom)

作者： Zoé Drey Charles Consel Thales INRIA Talence France ENSEIRB/INRIA Talence France

By nature, ubiquitous computing applications are intimately intertwined with users' everyday life. this situation is challenging because it requires to make the development of applications accessible to end-users. Furthermore, ubiquitous computing consists of a variety of areas, including home automation and assisted living, raising a need for an open-ended approach. We present Pantagruel, a visual programming language that is end-user oriented. Our approach is open-ended in that Pantagruel integrates a language to describe a ubiquitous computing environment. Such description takes the form of a taxonomy, defining the entities relevant to a given ubiquitous computing area. this description serves as a parameter to a sensor-controller-actuator development paradigm. the orchestration of area-specific entities is supported by high-level constructs, customized with respect to taxonomical information. We have implemented a visual environment to prototyping ubiquitous computing applications. Furthermore, we have developed a compiler for Pantagruel that targets a domain-specific middleware. Our environment leverages a 2D Tenderer to enable the simulation and of applications. We successfully simulated a range of applications in various ubiquitous computing areas, such as home automation, assisted living and building management.

关键词： Prototypes Ubiquitous computing logic programming Taxonomy Computational modeling Computer languages Sensor phenomena and characterization Middleware Home automation Pervasive computing

来源：评论

学校读者我要写书评

暂无评论

Context-aware and resource efficient sensing infrastructure for context-aware applications

Context-aware and resource efficient sensing infrastructure ...

引用

IEEE Annual conference on Pervasive Computing and Communications Workshops (PerCom)

作者： Peizhao Hu Suan Khai Chong Jadwiga Indulska Shonali Krishnaswamy School of Information Technology and Electrical Engineering University of Queensland Australia NICTA Australia Caulfield School of Information Technology Monash University Australia

Middleware for wireless sensor networks and middleware for context-aware applications both provide information abstraction and programming support for gathering, pre-processing, and managing sensor data. However the former mostly concentrates on optimising the operations of the resource constrained hardware and simplifying access to the raw sensor data while the latter focuses on gathering sensor data, pre-processing it to the abstract context information required by the applications and providing reasoning on this data. In this paper, we explore the idea of enhancing middleware for context-aware applications with solutions from sensor networks middleware to allow resource efficient and context-aware management of sensing infrastructure. the decisions on which sensor data needs to be delivered to the middleware for evaluation are based on current contextual situations. the approach allows to trade the level of confidence in context information for resource efficiency in context provisioning without a detrimental effect on the functionality of context-aware applications.

关键词： Middleware Context awareness Wireless sensor networks Resource management Pervasive computing Information technology Application software logic Large-scale systems Prototypes

来源：评论

学校读者我要写书评

暂无评论

the logic of message-passing

引用

SCIENCE OF COMPUTER programming 2009年第8期74卷 498-533页

作者： Cockett, J. R. B. Pastro, Craig Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada Macquarie Univ Dept Math N Ryde NSW 2109 Australia

Message-passing is a key ingredient of concurrent programming. the purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message-passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the term calculus borrows heavily from the (synchronous) pi-calculus. the cut-elimination procedure for the system provides an operational semantics. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Message passing Concurrency Process semantics Linear logic Term logic Multicategory Polycategory Linear distributive category Poly-actegory Linear actegory

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming for studying logics

Answer Set Programming for studying logics

引用

8th Mexican International conference on Artificial Intelligence

作者： Zepeda, Claudia Luis Carballido, Jose Marin, Angel Osorio, Mauricio Benemerita Univ Autonoma Puebla Puebla Mexico Amer Univ Puebla Mexico

We describe different ASP encodings to show the independence of some axioms of G(3)' logic, and to obtain a paraconsistent multivalued logic based on the axioms of G(3)' logic.

ISBN: (纸本)9780769539331

We describe different ASP encodings to show the independence of some axioms of G(3)' logic, and to obtain a paraconsistent multivalued logic based on the axioms of G(3)' logic.

关键词： axiomatic systems independence of axioms multivalued logics answer set programming

来源：评论

学校读者我要写书评

暂无评论

the Shadow Knows: Refinement and security in sequential programs

引用

SCIENCE OF COMPUTER programming 2009年第8期74卷 629-653页

作者： Morgan, Carroll Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

Stepwise refinement is a crucial conceptual tool for system development, encouraging program construction via a number of separate correctness-preserving stages which ideally can be understood in isolation. A crucial conceptual component of security is an adversary's ignorance of concealed information. We suggest a novel method of combining these two ideas. Our suggestion is based on a mathematical definition of "ignorance-preserving" refinement that extends classical refinement by limiting an adversary's access to concealed information: moving from specification to implementation should never increase that access. the novelty is the way we achieve this in the context of sequential programs. Specifically we give an operational model (and detailed justification for it), a basic sequential programming language and its operational semantics in that model, a "logic of ignorance" interpreted over the same model, then a program-logical semantics bringing those together - and finally we use the logic to establish, via refinement, the correctness of a real (though small) protocol: Rivest's Oblivious Transfer. A previous report* treated Chaum's Dining Cryptographers similarly. In passing we solve the Refinement Paradox for sequential programs. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Security Privacy Hoare logic Specification Implementation logic of knowledge

来源：评论

学校读者我要写书评

暂无评论

An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning

引用

INTERNATIONAL JOURNAL OF COMPUTER MAthEMATICS 2009年第10-11期86卷 1852-1866页

作者： Burrieza, A. Mora, A. Ojeda-Aciego, M. Orlowska, E. Univ Malaga Dept Matemat Aplicada E-29071 Malaga Spain Univ Malaga Dept Filosofia E-29071 Malaga Spain Inst Natl Telecommun Warsaw Poland

logic programming has been used as a natural framework to automate deduction in the logic of order-of-magnitude reasoning. Specifically, we introduce a Prolog implementation of the Rasiowa-Sikorski proof system associated with the relational translation Re(OM) of the multi-modal logic of order-of-magnitude qualitative reasoning OM.

关键词： relational theorem proving Rasiowa-Sikorski procedure modal logic tableaux procedure automated theorem proving

来源：评论

学校读者我要写书评

暂无评论

An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning

An implementation of a dual tableaux system for order-of-mag...

引用

8th International conference of Computational and Mathematical Methods in Science and Engineering (CMMSE 2008)

作者： Burrieza, A. Mora, A. Ojeda-Aciego, M. Orlowska, E. Univ Malaga Dept Matemat Aplicada E-29071 Malaga Spain Univ Malaga Dept Filosofia E-29071 Malaga Spain Inst Natl Telecommun Warsaw Poland

关键词： relational theorem proving Rasiowa-Sikorski procedure modal logic tableaux procedure automated theorem proving

来源：评论

学校读者我要写书评

暂无评论

Decidable Order-Sorted logic programming for Ontologies and Rules with Argument Restructuring 8

Decidable Order-Sorted Logic Programming for Ontologies and ...

引用

8th International Semantic Web conference

作者： Kaneiwa, Ken Nguyen, Philip H. P. National Institute of Information and Communications Technology Japan Department of Justice Government of South Australia Australia

ISBN: (纸本)9783642049293

this paper presents decidable fragment for combining ontologies mid rules in order-sorted logic programming. We describe order-sorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they conceptually yield a hierarchy similar to the hierarchies of sorts and predicates. By extending the order-sorted Horn-clause calculus, we develop a query-answering system that can answer queries such as atoms and meta-atoms generalized by containing predicate variables. We show that the expressive query-answering system computes every generalized query in single exponential time, i.e., the complexity of our query system is equal to that of DATALOG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Processing OWL2 ontologies using thea an application of logic programming

Processing OWL2 ontologies using Thea an application of logi...

引用

6th International Workshop on OWL: Experiences and Directions, OWLED 2009 - Co-located with the 8th International Semantic Web conference, ISWC 2009 and the 3rd International conference on Web Reasoning and Rule Systems, RR 2009

作者： Vassiliadis, Vangelis Wielemaker, Jan Mungall, Chris

Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically for ontology processing. Prolog, with its logic-based, declarative semantics offers many advantages as a host programming language for querying and processing OWL2 ontologies. the SWI-Prolog semweb library provides some support for OWL but until now there has been a lack of any library providing direct and comprehensive support for OWL2. We have developed thea, a library based directly on the OWL2 functionalstyle syntax, allowing storage and manipulation of axioms as a Prolog database. thea can translate ontologies to Description logic programs but the emphasis is on using Prolog as an application programming and processing language rather than a reasoning engine. thea offers the ability to seamless connect to the java OWL API and OWLLink servers. thea also includes support for SWRL. In this paper we provide examples of using thea for processing ontologies, and compare the results to alternative methods. thea is available from Github: http://***/vangelisv/ thea.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A Plot-Manipulation Algebra to Support Digital Storytelling

A Plot-Manipulation Algebra to Support Digital Storytelling

引用

8th International conference on Entertainment Computing (ICEC 2009)

作者： Karlsson, Boerje Barbosa, Simone D. J. Furtado, Antonio L. Casanova, Marco A. Pontificia Univ Catolica Rio de Janeiro Dept Informat BR-22451900 Rio de Janeiro Brazil

ISBN: (纸本)9783642040511

Plot composition is examined here at a logic design level, an intermediate stage that comes next to the conceptual level wherein the intended narrative genre is specified. An abstract data structure is proposed to represent plots, together with an algebra for manipulating the data structure. Our purpose is to adapt for narratives the strategy applied to databases by Codd's relational model. the basic operators of our Plot-Manipulation Algebra (PMA) are introduced in view of the four fundamental relations between events that we identified in a previous work. A logic programming prototype was implemented in order to run examples using the algebra.

关键词： storytelling narratology plots logic design algebraic formalisms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：