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

10th international symposium on database programming languages

作者： Hidders, J Marrara, S Paredaens, J Vercammen, R Univ Antwerp Dept Math & Comp Sci B-2020 Antwerp Belgium Univ Milan Dipartimento Tecnol Informaz I-26013 Crema CR Italy

ISBN: (纸本)3540309519

XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count and sum, sequence generation, node construction, position information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Various programming languages in Relation to Solving the Problem of Determining Indicators of Balance Reliability 10

Evaluation of Various Programming Languages in Relation to S...

引用

10th international Scientific symposium on Electrical Power Engineering (ELEKTROENERGETIKA)

作者： Chukreyev, Iurii Chukreyev, Mikhail Syktyvkar Forest Inst Syktyvkar Russia

ISBN: (纸本)9788055333243

Considers the use of various software tools to assess the possibility of obtaining indicators of balance reliability. A fairly new high-level, high-performance free programming language with dynamic typing Julia was used as a mathematical programming language. Traditional languages are represented by Fortran. the comparison of the speed of obtaining the result. the pros and cons of using each of the options are considered.

关键词： reliability criteria power system adequacy parameter power reserve software

来源：评论

学校读者我要写书评

暂无评论

Satisfiability of XPath queries with sibling axes

Satisfiability of XPath queries with sibling axes

引用

10th international symposium on database programming languages

作者： Geerts, F Fan, WF Univ Edinburgh Edinburgh EH8 9YL Midlothian Scotland

ISBN: (纸本)3540309519

We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To this end we revisit the satisfiability problem for a variety of XPath fragments with sibling axes, in the presence of DTDs, in the absence of DTDs, and under various restricted DTDs. In these settings we establish complexity bounds ranging from NLOGSPACE to undecidable. Our main conclusion is that in many cases, the presence of sibling axes complicates the satisfiability analysis. Indeed, we show that there are XPath satisfiability problems that are in PTIME and PSPACE in the absence of sibling axes, but that become NP-hard and EXPTIME-hard, respectively, when sibling axes are used instead of the corresponding vertical modalities (e.g., the wildcard and the descendant axis).

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

A New Roadmap on Linking theories of programming 10

A New Roadmap on Linking Theories of Programming

引用

10th international symposium on theoretical Aspects of Software Engineering (TASE)

作者： He Jifeng East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China

ISBN: (纸本)9781509017645

Formal methods advocate the crucial role played by the algebra of programs in specification and implementation of programs. Study leads to the conclusion that both the top-down approach (with denotational model as its origin) and the bottom-up approach (a journey started from operational model) can meet in the middle with a program algebra. this paper proposes a new approach on linking theories of programming. Given a program algebra, we construct a test operator taking a test case and the testing program as its arguments. the operator yields a collection of observations of the test outcomes. the denotational model of a program can be derived as a binary relation which relates the test cases with their outcomes. An operational model is considered as consistent if its step relation is consistent with the algebraic semantics.

关键词： Algebra Joining processes programming Command languages Software engineering Electronic mail Computational modeling programming Algebra electronic mail Software engineering Computational modeling program algebra CASING INSPECTION operational mode Binary relation program testing

来源：评论

学校读者我要写书评

暂无评论

the complexity and approximation of fixing numerical attributes in databases under integrity constraints

引用

INFORMATION SYSTEMS 2008年第4-5期33卷 407-434页

作者： Bertossi, Leopoldo Bravo, Loreto Franconi, Enrico Lopatenko, Andrei Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Edinburgh Sch Informat Edinburgh EH8 9YL Midlothian Scotland Google Inc Mountain View CA USA

Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constraints. Consistent answers are characterized as those answers that are invariant tinder all minimally repaired versions of the original database. We study the problem of repairing databases with respect to denial constraints by fixing integer numerical values taken by attributes. We introduce a quantitative definition of database repair, and investigate the complexity of several decision and optimization problems. Among them, database Repair Problem (DRP): deciding the existence of repairs within a given distance to the original instance, and CQA: deciding consistency of answers to simple and aggregate conjunctive queries under different semantics. We provide sharp complexity bounds, identifying relevant tractable and intractable cases. We also develop approximation algorithms for the latter. Among other results, we establish: (a) the Delta(P)(2)-hardness of CQA. (b) that DRP is MAXSNP-hard, but has a good approximation. (c) the intractability of CQA for aggregate queries for one database atom denials (plus built-ins), and also that it has a good approximation. (C) 2008 Elsevier B.V. All rights reserved.

关键词： integrity constraints inconsistent databases consistent query answering database repairs

来源：评论

学校读者我要写书评

暂无评论

Hardware-near programming in the common language infrastructure

Hardware-near programming in the common language infrastruct...

引用

10th IEEE international symposium on Object and Component-Oriented Real-Time Distributed Computing

作者： Richter, Stefan Rasche, Andreas Polze, Andreas Univ Potsdam Hasso Plattner Inst D-14482 Potsdam Germany

ISBN: (纸本)9780769527659

Virtual virtual machine-based programming languages, such as Java and C# have made the programming of desktop computer systems simpler, less error-prone and more efficient. Embedded systems development rarely benefits from this advantages. this is because the disciplines special needs, such as direct hardware access and timelininess, are rarely considered in it? these environments. In particular virtual machines usually do not allow for accessing hardware directly, making it impossible to express substantial parts of embedded systems inside the virtual environment. By specifying additional rules, describing an implementation of a conforming compiler and presenting examples, we show how the virtual machine defined by the ECMA standard 335 can be carefully extended to support hardware-near programming.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Order-sorted dependency pairs 08

Order-sorted dependency pairs

引用

PPDP 2008: 10th international ACM SIGPLAN symposium on Principles and Practice of Declarative programming

作者： Lucas, Salvador Meseguer, José DSIC Universidad Politécnica de Valencia Spain CS Dept. University of Illinois Urbana-Champaign IL United States

ISBN: (纸本)9781605581170

Types (or sorts) are pervasive in computer science and in rewriting-based programming languages, which often support subtypes (sub-sorts) and subtype polymorphism. Programs in these languages can be modeled as order-sorted term rewriting systems (OS-TRSs). Often, termination of such programs heavily depends on sort information. But few techniques are currently available for proving termination of OS-TRSs;and they often fail for interesting OS-TRSs. In this paper we generalize the dependency pairs approach to prove termination of OS-TRSs. Preliminary experiments suggest that this technique can succeed where existing ones fail, yielding easier and simpler termination proofs. Copyright © 2008 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Comparing and evaluating design pattern miner tools

Comparing and evaluating design pattern miner tools

引用

10th symposium on programming languages and Software Tools, SPLST 2007

作者： Fülöp, Lajos Jeno Ilia, Árpád Végh, Ádám Zoltán Ferenc, Rudolf Department of Software Engineering University of Szeged Árpad tér 2 H-6720 Szeged Hungary

ISBN: (纸本)9789634639251

Several tools are published in the literature which are able to mine design patterns from source code. Because a common test database - a benchmark - is not available, the accuracy of the tools is difficult to check and measuring any kind of improvements on the tools is also problematic. As an all-in-one solution we have developed a benchmark for evaluating and comparing design pattern miner tools, and for ensuring a test database for them. In this paper we present some experiments performed with the benchmark. Two design pattern miner tools - Columbus and Maisa - are evaluated and compared. the tools are evaluated on C++ reference implementations of design patterns and on a real software system called NotePad++. Design pattern instances from NotePad++ recovered by professional software developers are also added to the benchmark.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

programming - What is Next? 10th

Programming - What is Next?

引用

10th international symposium on Leveraging Applications of Formal Methods, ISoLA 2021

作者： Havelund, Klaus Steffen, Bernhard Jet Propulsion Laboratory California Institute of Technology Pasadena United States TU Dortmund University Dortmund Germany

ISBN: (纸本)9783030891589

the paper provides an introduction to the track: "programming - What is Next?", organized by the authors as part of ISoLA 2021: the 9th international symposium On Leveraging Applications of Formal Methods, Verification and Validation. A total of 14 papers were presented in the track, with responses to the question: what are the trends in current more recent programming languages, and what can be expected of future languages?. the track covers such topics as general-purpose programming languages, domain-specific languages, formal methods and modeling languages, textual versus graphical languages, and application programming versus embedded programming. © 2021, Springer Nature Switzerland AG.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

An inside analysis of a genetic-programming based optimizer

An inside analysis of a genetic-programming based optimizer

引用

10th international database Engineering and Applications symposium (IDEAS 2006)

作者： Muntes-Mulero, Victor Aguilar-Saborit, Josep Larriba-Pey, Josep-L. Zuzarte, Calisto Markl, Volker UPC Campus Nord Comp Arch Dept Campus NordC-Jordi Girona 1-3Modul D6 Barcelona 08034 Spain IBM Canada Ltd IBM Toronto Lab DB2 Markham L6G-IC7 BC Canada IBM Corp Almaden Res Ctr San Jose CA 95139 USA

ISBN: (纸本)9780769525778

the use of evolutionary algorithms has been proposed as a powerful random search strategy to solve the join order problem. Specifically, genetic programming used in query optimization has been proposed as an alternative to the limitations of dynamic programming with large join queries. However, very little is known about the impact and behavior of the genetic operations used in this type of algorithms. In this paper, we present an analysis that helps us to understand the effect of these operations during the optimization execution. Specifically, we study five different aspects: the age of the members in the population in terms of generations, the number of query execution plans (QEP) discarded without producing new offsprings, the average QEP life time in generations, the efficiency of the genetic operations and the evolution of the best cost. All in all, our analysis allows us to understand the impact of crossovers compared to mutation operations and the dynamically changing effects of these operations.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：