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

4th international conference on Scalable Uncertainty Management, SUM 2010

ISBN: (纸本)3642159508

the proceedings contain 32 papers. the topics discussed include: Markov chain Monte Carlo and databases;answer set programming, the solving paradigm for knowledge representation and reasoning;graphical and logical-based representations of uncertain information in a possibility theory framework;probabilistic data: a tiny survey;the role of epistemic uncertainty in risk analysis;uncertainty in clustering and classification;information fusion;use of the domination property for interval valued digital signal processing;managing lineage and uncertainty under a data exchange setting;a formal analysis of logic-based argumentation systems;handling inconsistency with preference-based argumentation;a possibility theory-oriented discussion of conceptual pattern structures;on the use of fuzzy cardinalities for reducing plethoric answers to fuzzy queries;and from Bayesian classifiers to possibilistic classifiers for numerical data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A basis set of operators for space-time computations

A basis set of operators for space-time computations

引用

作者： Beal, Jacob BBN Technologies Cambridge MA 02138 United States

ISBN: (纸本)9780769542294

Although many different models of spatial computation have been proposed, no unifying theory of computation over continuous space-time has yet been developed. Lack of such a theory has made it difficult to compare spatial computing models and impossible to determine their completeness. this paper takes a step toward the goal of a unifying model by identifying a mathematical basis set of operators from which any finitely-approximable causal computation can be constructed. the utility of this basis set of operators is then further demonstrated by using it to analyze the universality of the Proto spatial computing programming language. © 2010 IEEE.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Testing First-Order logic Axioms in Program Verification

Testing First-Order Logic Axioms in Program Verification

引用

4th international conference on Tests and Proofs

作者： Ahn, Ki Yung Denney, Ewen Portland State Univ Portland OR 97207 USA NASA Ames Res Ctr Mission Crit Technol Inc Moffett Field CA 94035 USA NASA Ames Res Ctr Stinger Ghaffarian Technol Inc Moffett Field CA 94035 USA

ISBN: (纸本)9783642139765

Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms correctly (that is, formalizing properties of an intended mathematical interpretation) is non-trivial in practice, and avoiding or even detecting unsoundness can sometimes be difficult to achieve. Moreover, speculating soundness of axioms based on the output of the provers themselves is not easy since they do not typically give counterexamples. We adopt the idea of model-based testing to aid axiom authors in discovering errors in axiomatizations. To test the validity of axioms, users define a computational model of the axiomatized logic by giving interpretations to the function symbols and constants in a simple declarative programming language. We have developed an axiom testing framework that helps automate model definition and test generation using off-the-shelf tools for meta-programming, property-based random testing, and constraint solving. We have experimented with our tool to test the axioms used in AUTOCERT, a program verification system that has been applied to verify aerospace flight code using a first-order axiomatization of navigational concepts, and were able to find counterexamples for a number of axioms.

关键词： model-based testing program verification automated theorem proving property-based testing constraint solving

来源：评论

学校读者我要写书评

暂无评论

An algebraic condition and an algorithm for the internal contact between two ellipsoids

引用

ENGINEERING COMPUTATIONS 2009年第6期26卷 635-644页

作者： Trabelsi, Ibrahim Moakher, Maher Gatumel, Cendrine Berthiaux, Henri LAMSIN ENIT & FS Gabes Natl Engn Sch Tunis Tunis Tunisia UMR CNRS 2392 Ecoles Mines Albi Ctr RAPSODEE EMAC Albi France

Purpose - the purpose of this paper is to present a new method for the detection and resolution of the contact point between two ellipsoids. Numerical simulations of ellipsoidal particles in a rotary cylinder are also presented. Desigri/methodology/approach - An algebraic condition is developed for the internal contact between two ellipsoids and an efficient contact detection algorithm for overlapping ellipsoids is implemented. Findings - this method was found to have the advantages of effectiveness and speed in the detection and resolution of the contact point. Originality/value - the dynamics of granular materials are of great importance in many industries dealing with powders and grains, such as pharmaceutical, chemical, and food industries. the main difficulty of such simulations is the excessive CPU time required for a large number of particles. In the discrete element method, contact detection between grains is the most expensive step in solving a nonlinear system for determination of the contact point, the normal vector and the overlap distance between ellipsoids. the numerical behavior and the optimization of the new algorithm presented in this paper are important also.

关键词： programming and algorithmic languages Geometric planes and solids

来源：评论

学校读者我要写书评

暂无评论

Lukasiewicz's 4-valued logic and normal modal logics

Lukasiewicz's 4-valued logic and normal modal logics

引用

4th Indian international conference on Artificial Intelligence, IICAI 2009

作者： Majkic, Zoran Prasad, Bhanu Applied Mathematics Department ETF University of Belgrade Serbia Department of Computer and Information Sciences Florida A and M University Tallahassee FL 32307 United States

ISBN: (纸本)9780972741279

In this paper, we investigate the Lukasiewicz's 4-valued modal logic based on the Aristotele's modal syllogistic. We present a new interpretation of the set of algebraic truth values by introducing the truth and knowledge orderings similar to those in Belnap's 4-valued bilattice but by replacing the original Belnap's negation with the lattice pseudo-complement instead. Based on it. we develop a formal modal Boolean algebra for Lukasiewicz's system. We show that this modal algebra corresponds to the standard normal modal logic and develop an autoreferential Kripke-style semantics for it. where Lukasiewicz Aristotele's ''necessity" operator is an existential additive instead of an universal (standard) multiplicative modal operator. Moreover, we show that the standard (modem) ne- cessity modal operator based on S4 accessibility relation (the truth partial order in Lukasiewicz Belnap's bilattice) is an identity and consequently is not useful in Lukasiewicz's system. Copyright © 2009 by IICAI.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

A Navigation over XML Documents through Linear Algebra Tools

A Navigation over XML Documents through Linear Algebra Tools

引用

4th international conference on Internet and Web Applications and Services

作者： Georgieva, Adriana Georgiev, Bozhidar Tech Univ Sofia Fac Appl Math & Informat Sofia Bulgaria Tech Univ TU Sofia Fac Comp Syst & Control Sofia Bulgaria

ISBN: (纸本)9781424438518

this paper presents an algebraic approach meant to provide an access to XML (Extensible Markup Language) components in the XML hierarchical trees. An adequate theoretical mechanism is critical for the creation of query languages that handle XML documents and is extremely important for the development and standardization of XML parsing process. the authors of this article propose an algebraic formalism for navigation over XML source text, based on linear algebra theory. In the paper are presented the advantages of this nontraditional approach. the idea is compared to existing higher-order logic formalisms. A main goal of this article is to provide several modern linear algebra tools for work on the XML documents through direct access to the nodes of XML trees. the authors deeply feel that (his direction of research is crucial to advance query languages design, development and their future embedding into practice.

关键词： hierarchical XML structure module-finite algebra bijective mapping XML conceptual model monadic second order logic XPath scripting language

来源：评论

学校读者我要写书评

暂无评论

Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables 09

Universal algebra over lambda-terms and nominal terms: The c...

引用

4th international Workshop on logical Frameworks and Meta-Languages: theory and Practice, LFMTP 2009

作者： Gabbay, Murdoch J. Mulligan, Dominic P.

ISBN: (纸本)9781605585291

this paper develops the correspondence between equality reasoning with axioms using terms syntax, and reasoning using nominal terms syntax. Both syntaxes involve name-abstraction: Terms represent functional abstraction;nominal terms represent atomsabstraction in nominal sets. It is not evident how to relate the two syntaxes because their intended denotations are so different. We use universal algebra, the logic of equational reasoning, a logical foundation based on an equality judgement form which is spartan but which is sufficiently expressive to encode mathematics in theory and practice. We investigate how syntax, algebraic theories, and derivability relate across -theories (algebra over -terms) and nominal algebra theories. Copyright © 2009 ACM.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Information Socurity and Cryptology - 4th international conference, Inscrypt 2008, Revised Selected Papers

引用

4th international conference on Information Security and Cryptology, Inscrypt 2008

ISBN: (纸本)9783642014390

the proceedings contain 30 papers. the topics discussed include: the state of hash functions and the NIST SHA-3 competition;key evolution systems in untrusted update environments;secure and privacy-preserving information brokering;provably secure convertible nominative signature scheme;cryptanalysis of two ring signcryption schemes;efficient signcryption key encapsulation without random oracles;security analysis of multivariate polynomials for hashing;SPVT-II: an efficient security protocol verifier based on logic programming;batch ZK proof and verification of OR logic;constructing variable-length PRPs and SPRPs from fixed-length PRPs;impossible differential analysis of reduced round CLEFIA;chosen ciphertext secure certificateless threshold encryption in the standard model;further observations on certificateless public key encryption;and efficient hardware architecture of SHA-256 algorithm for trusted mobile computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SYNthESIS OF PROGRAM MODULES FOR TYPICAL BOILER-HOUSE APPLICATIONS 4

SYNTHESIS OF PROGRAM MODULES FOR TYPICAL BOILER-HOUSE APPLIC...

引用

4th international conference on Electrical and Control Technologies

作者： Danilevicius, Gediminas Ezerskis, Darius Kaunas Univ Technol Kaunas Lithuania

ISBN: (纸本)9781634397988

A Paper suggests automated control program synthesis for typical boiler-house of small to medium power. Due to typical boiler-house architecture even part of control algorithms for the equipment or overall program structure can be ready made. this paper presents the way to build those control algorithms and automated generation of the control program for programmable logic controller. Process signal coding, special PLC templates and meta-program for the boiler-house control program is also presented.

关键词： Boiler-house meta-program PLC programming

来源：评论

学校读者我要写书评

暂无评论

logic methods for many-valued logics: Higher-order autoepistemic language concepts

Logic methods for many-valued logics: Higher-order autoepist...

引用

4th Indian international conference on Artificial Intelligence, IICAI 2009

作者： Majkić, Zoran Applied Mathematics Department ETF University of Belgrade Serbia

ISBN: (纸本)9780972741279

the higher-order types of Herbrand interpretations for databases arise often in practice when we have to deal with uncertain or imprecise information, or in constrained databases. they are a consequence of the introduction of a kind of the observational equivalence for the hidden information in the ordinary Herbrand interpretations. It means that the logics for such databases are particular functional many-valued logics, where the set of algebraic truth values is a complete distributive lattice of functions from the set of values of hidden attributes to the 2-valued lattice of classic truth values. In this paper we present a general definition for higher-order Herbrand interpretation types and their standard flattening into the ordinary 2-valued Herbrand inter-pretations. Unfortunately such a flattening is not able to support the higher-order language concepts as those used in the original databases. Because of that we introduce a modal flattening into the quotient, modulo observation equivalence, Herbrand interpretations. then we show how we are able to define the higher- order autoepistemic language concepts, but in a multi-modal logics framework where the original many-valued ground formulae are transformed into modal 2- valued autoepistemic concepts. We define a multi-modal Kripke model semantics for them based only on theoretical considerations for autoepistemic semantics of concepts. We explain why, when we are dealing with uncertainty or with predicate compression, that is, with higher-order Herbrand interpretation types for such many-valued logics, we are dealing fundamentally with the logics with a possible worlds semantics. After that we show that each universal multi-modal operator can be canonically replaced by a unique existential modal operator in order to obtain a normal (mono)modal logic for higher-order language concepts useful for practical applications. Copyright © 2009 by IICAI.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：