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

Relation-algebraic Verification of Borůvka’s Minimum Spanning Tree Algorithm 1

19th international conference on relational and algebraic methods in computer science, ramics 2021

作者： Guttmann, Walter Robinson-O’Brien, Nicolas Department of Computer Science and Software Engineering University of Canterbury Christchurch New Zealand

ISBN: (数字)9783030887018

ISBN: (纸本)9783030887001

Previous work introduced a relation-algebraic framework for reasoning about weighted-graph algorithms. We use this framework to prove partial correctness of a sequential version of Borůvka’s minimum spanning tree algorithm. this is the first formal proof of correctness for this algorithm. We also discuss new abstractions that make it easier to reason about weighted graphs. © 2021, Springer Nature Switzerland AG.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

relational and algebraic methods in computer science - 14th international conference, ramics 2014, Proceedings

Relational and Algebraic Methods in Computer Science - 14th ...

引用

14th international conference on relational and algebraic methods in computer science, ramics 2014

ISBN: (纸本)9783319062501

the proceedings contain 27 papers. the topics discussed include: developments in concurrent kleene algebra;endowing concurrent kleene algebra with communication actions;concurrent kleene algebra with tests;completeness theorems for bi-kleene algebras and series-parallel rational POMSET languages;kleene algebra with converse;extended conscriptions algebraically;abstract dynamic frames;automated verification of relational while-programs;on faults and faulty programs;parameterized bisimulations: some applications;a point-free relation-algebraic approach to general topology;a mechanized abstract formalization of concept lattices;a sufficient condition for liftable adjunctions between Eilenberg-Moore categories;higher-order arrow categories;type-2 fuzzy controllers in arrow categories;and complete solution of a constrained tropical optimization problem with application to location analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Decision methods for concurrent kleene algebra with tests : Based on derivative 15

Decision methods for concurrent kleene algebra with tests : ...

引用

Student Track of the 15th international conference on relational and algebraic methods in computer science, ramics(ST) 2015

作者： Nakamura, Yoshiki Tokyo Instutute of Technology Oookayama Meguroku Japan

Concurrent Kleene Algebra with Tests (CKAT) were introduced by Peter Jipsen[Jip14]. We give derivatives for CKAT to decide word problems, for example emptiness, equivalence, containment problems. these derivative methods are expanded from derivative methods for Kleene Algebra and Kleene Algebra with Tests[Brz64][Koz08][ABM12]. Additionally, we show that the equivalence problem of CKAT is in EXPSPACE.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Developments in Concurrent Kleene Algebra 1

引用

14th international conference on relational and algebraic methods in computer science, ramics 2014

作者： Hoare, Tony Van Staden, Stephan Möller, Bernhard Struth, Georg Villard, Jules Zhu, Huibiao O'Hearn, Peter Microsoft Research Cambridge United Kingdom ETH Zurich Switzerland Institut für Informatik Universität Augsburg Germany Department of Computer Science University of Sheffield United Kingdom Department of Computing Imperial College London United Kingdom Software Engineering Institute East China Normal University China Facebook United Kingdom

ISBN: (数字)9783319062518

ISBN: (纸本)9783319062501

this report summarises recent progress in the research of its co-authors towards the construction of links between algebraic presentations of the principles of programming and the exploitation of concurrency in modern programming practice. the research concentrates on the construction of a realistic family of partial order models for Concurrent Kleene Algebra (aka, the Laws of Programming). the main elements of the model are objects and the events in which they engage. Further primitive concepts are traces, errors and failures, and transferrable ownership. In terms of these we can define other concepts which have proved useful in reasoning about concurrent programs, for example causal dependency and independence, sequentiality and concurrency, allocation and disposal, synchrony and asynchrony, sharing and locality, input and output. © 2014 Springer international Publishing.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8428 LNCS卷 V-VI页

作者： Höfner, Peter Jipsen, Peter Kahl, Wolfram Müller, Martin E. NICTA UNSW Anzac Parade 223 Kensington NSW 2033 Australia Chapman University School of Computational Sciences One University Drive Orange CA 92866 United States McMaster University Department of Computing and Software 1280 Main Street West Hamilton ON L8S 4K1 Canada University of Augsburg Department of Computer Science Universitätsstraße 6a 86159 Augsburg Germany

来源：评论

学校读者我要写书评

暂无评论

A marginalized denoising method for link prediction in relational data 14

A marginalized denoising method for link prediction in relat...

引用

14th SIAM international conference on Data Mining, SDM 2014

作者： Chen, Zheng Zhang, Weixiong Institute for Systems Biology Jianghan University Wuhan Hubei China Department of Computer Science and Engineering Washington University in St. Louis St. LouisMO United States

ISBN: (纸本)9781510811515

Missing information is ubiquitous in relational datasets. Imputation of missing relations, a.k.a. link prediction, has become an increasingly crucial problem in relational data analysis as a huge amount of data has been accumulated in various fields. Recent advances in the latent variable models have greatly improved the state-of-the-art in the link prediction accuracy, however it comes at the price of increasing complexity. In this paper, we propose a novel link prediction algorithm, marginalized denoising model (MDM), where the problem of predicting unobserved or missing links in a given relational matrix is cast as a problem of matrix denoising. the method learns a mapping function that models the embedded topological structures of the relational network by capturing the so-called indirect affinities among entities. We train the mapping function by recovering the originally observed matrix from a conceptually "infinite" number of corrupted matrices where some links are randomly masked from the observed matrix. By re-applying the learned function to the observed relational matrix, we aim to "denoise" the observed matrix and thus to recover the unobserved links. Experimental results on several benchmarks demonstrate the superior performance of the new method over several stateof-the-art link prediction methods. Copyright © SIAM.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

LODE: Linking Digital Humanities Content to the Web of Data 14

LODE: Linking Digital Humanities Content to the Web of Data

引用

14th IEEE/ACM Joint conference on Digital Libraries (JCDL) / 18th international conference on theory and Practice of Digital Libraries (TPDL)

作者： Sztyler, Timo Huber, Jakob Noessner, Jan Murdock, Jaimie Allen, Colin Niepert, Mathias Univ Mannheim Data & Web Sci Grp Mannheim Germany Indiana Univ Sch Informat & Comp Bloomington IN 47405 USA Indiana Univ Program Cognit Sci Bloomington IN 47405 USA Indiana Univ Dept Hist & Philosophy Sci Bloomington IN 47405 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)9781479955695

Numerous digital libraries projects maintain their data collections in the form of text, images, and metadata. While data may be stored in many formats, from plain text to XML to relational databases, the use of the resource description framework (RDF) as a standardized representation has gained considerable traction during the last five years. Almost every digital humanities meeting has at least one session concerned with the topic of digital humanities, RDF, and linked data, including JCDL. While most existing work in linked data has focused on improving algorithms for entity matching, the aim of our Linked Open Data Enhancer LODE is to work "out of the box", enabling their use by humanities scholars, computer scientists, librarians, and information scientists alike. With LODE we enable non-technical users to enrich a local RDF repository with high-quality data from the Linked Open Data cloud. LODE links and enhances the local RDF repository without reducing the quality of the data. In particular, we support the user in the enhancement and linking process by providing intuitive user-interfaces and by suggesting high quality linking candidates using state of the art matching algorithms. We hope that the LODE framework will be useful to digital humanities scholars complementing other digital humanities tools. (1)

关键词： Internet digital libraries humanities relational databases user interfaces JCDL LODE RDF repository Web of data art matching algorithms data collections digital humanities content digital humanities scholars digital humanities tools digital humanity digital libraries projects entity matching intuitive user-interfaces linked data linked open data cloud linked open data enhancer lode linking process resource description framework standardized representation Browsers Cognitive science Educational institutions Joining processes Resource description framework Search engines Standards Resource Description Framework semantic networks relational databases Humanities mineral dyke Data Collection methods digital libraries User Interface Device Component Cognitive science Browsers Search engines Educational institutions

来源：评论

学校读者我要写书评

暂无评论

the Impact of Equivalent, Redundant and Quasi Mutants on Database Schema Mutation Analysis

The Impact of Equivalent, Redundant and Quasi Mutants on Dat...

引用

international conference on Quality Software

作者： Chris J. Wright Gregory M. Kapfhammer Phil McMinn Dept. of Computer Science University of Sheffield Dept. of Computer Science Allegheny College

Since the relational database is an important component of real-world software and the schema plays a major role in ensuring the quality of the database, relational schema testing is essential. this paper presents methods for improving both the efficiency and accuracy of mutation analysis, an established method for assessing the quality of test cases for database schemas. Using a DBMS-independent abstract representation, the presented techniques automatically identify and remove mutants that are either equivalent to the original schema, redundant with respect to other mutants, or undesirable because they are only valid for certain database systems. Applying our techniques for ineffective mutant removal to a variety of schemas, many of which are from real-world sources like the U.S. Department of Agriculture and the Stack Overflow website, reveals that the presented static analysis of the DBMS-independent representation is multiple orders of magnitude faster than a DBMS-specific method. the results also show increased mutation scores in 75% of cases, with 44% of those uncovering a mutation-adequate test suite. Combining the presented techniques yields mean efficiency improvements of up to 33.7%, with averages across schemas of 1.6% and 11.8% for HyperSQL and PostgreSQL, respectively.

关键词： Abstracts relational databases Testing Syntactics Accuracy Software

来源：评论

学校读者我要写书评

暂无评论

relational representation theorem for powerset quantales

Relational representation theorem for powerset quantales

引用

13th international conference on relational and algebraic methods in computer science, ramics 2012

作者： Nishizawa, Koki Furusawa, Hitoshi Department of Information Systems Faculty of Environmental and Information Studies Tottori University of Environmental Studies Japan Department of Mathematics and Computer Science Kagoshima University Japan

ISBN: (纸本)9783642333132

the paper gives a sufficient condition for a quantale to be isomorphic to a sub-quantale of the quantale whose elements are binary relations on a set and whose order and monoid structure are respectively given by inclusion and relational composition and the identity relation. A quantale has such a relational representation, if its underlying lattice is a powerset of some set. We also show some other equivalent conditions of the sufficient condition. © 2012 Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：