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

28th IEEE international conference on Data Engineering (ICDE)

作者： Sadoghi, Mohammad Javed, Rija Tarafdar, Naif Singh, Harsh Palaniappan, Rohan Jacobsen, Hans-Arno Univ Toronto Middleware Syst Res Grp Msrg Org Toronto ON M5S 1A1 Canada

ISBN: (纸本)9781467300421

We present an efficient multi-query event stream platform to support query processing over high-frequency event streams. Our platform is built over reconfigurable hardware -- FPGAs -- to achieve line-rate multi-query processing by exploiting unprecedented degrees of parallelism and potential for pipelining, only available through custom-built, application-specific and low-level logic design. Moreover, a multi-query event stream processing engine is at the core of a wide range of applications including real-time data analytics, algorithmic trading, targeted advertisement, and (complex) event processing.

关键词： query analysis streams CEP Field programmable gate arrays parallelism reconfigurable hardware event processing logic design Platform Pipeline processing real-time data

来源：评论

学校读者我要写书评

暂无评论

Incremental maintenance of overgrounded logic programs with tailored simplifications

引用

thEORY AND PRACTICE OF logic programming 2020年第5期20卷 719-734页

作者： Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

the repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. the proposedovergrounded programs with tailoring(OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, ourtailored simplificationtechnique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance.

关键词： Knowledge Representation and Reasoning Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

Design of a Compact Reversible Carry Look-Ahead Adder Using Dynamic programming 28

Design of a Compact Reversible Carry Look-Ahead Adder Using ...

引用

28th international conference on VLSI Design (VLSID) / 14th international conference on Embedded Systems

作者： Lisa, Nusrat Jahan Babu, Hafiz Md. Hasan Ahasnaullah Univ Sci & Technol Dept Comp Sci & Engn Dhaka Bangladesh Univ Dhaka Dept Comp Sci & Engn Dhaka 1000 Bangladesh

ISBN: (纸本)9781479966585

this paper presents a new method for designing a reversible carry look-ahead adder (RCLA) based on dynamic programming. In this method, we propose a faster technique for generating carry output, which also outperforms the existing ones in terms of number of operations. In addition, we design a compact reversible carry look-ahead circuit based on the proposed technique. In order to optimize our design, we propose a first ever known Reversible Partial Adder (RPA) circuit with the optimum numbers of the quantum cost and garbage outputs which concurrently produce carry propagation signal, carry generation signal and summation of the inputs. Using RPA as a unit element of RCLA construction, we optimize the designs of RCLA and show that the proposed design is better than the existing ones in terms of the number of gates, quantum cost, garbage outputs and delay with the help of Microwind DSCH 3.5, e.g., the proposed 128-bit adder improves 77.55% on number of gates, 10% on garbage outputs, 2.16% on delay and 77.61% on quantum cost over the existing best one.

关键词： Quantum Cost Garbage Output logic Design Reversible Computing Carry Look-Ahead Adder

来源：评论

学校读者我要写书评

暂无评论

Incremental maintenance of overgrounded logic programs with tailored simplifications

Incremental maintenance of overgrounded logic programs with ...

引用

36th international conference on logic programming (iclp)

作者： Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

关键词： Knowledge Representation and Reasoning Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

A case based approach to concrete deterioration assessment 28

A case based approach to concrete deterioration assessment

引用

28th international conference on Computer Applications in Industry and Engineering, CAINE 2015

作者： Neves, Jose Gomes, Guida Machado, Jose Vicente, Henrique Centro Algoritmi Universidade Do Minho Braga Portugal Departamento de Química Centro de Química de Évora Escola de Ciências e Tecnologia Universidade de Évora Évora Portugal

ISBN: (纸本)9781510812284

the deterioration of concrete infrastructures is of concern since maintenance and repair require large amounts of resources. It is a multifaceted and complex phenomenon, with multiple causes, namely age, use, maintenance, type of environmental exposure and aggression by biological, chemical, mechanical and physical agents. However, it may be prevented if proactive strategies were embraced (e.g., taking into account similar past experiences). Indeed, this work will start with the development of a decision support system to prevent these events from happening, centered on a formal framework based on logic programming for knowledge representation, complemented with a Case-Based Reasoning (CBR) approach to problem solving, which caters for the handling of incomplete, unknown, or even contradictory information. the CBR cycle was adapted in order to cater for the developments referred to above, and clustering methods were enforced to distinguish and aggregate collections of historical records in order to reduce the search space and enhance the retrieve phase.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

OCRA: A Tool for Checking the Refinement of Temporal Contracts 13

OCRA: A Tool for Checking the Refinement of Temporal Contrac...

引用

28th IEEE/ACM international conference on Automated Software Engineering (ASE)

作者： Cimatti, Alessandro Dorigatti, Michele Tonetta, Stefano FBK Irst Trento Italy

ISBN: (纸本)9781479902156

Contract-based design enriches a component model with properties structured in pairs of assumptions and guarantees. these properties are expressed in term of the variables at the interface of the components, and specify how a component interacts with its environment: the assumption is a property that must be satisfied by the environment of the component, while the guarantee is a property that the component must satisfy in response. Contract-based design has been recently proposed in many methodologies for taming the complexity of embedded systems. In fact, contract-based design enables stepwise refinement, compositional verification, and reuse of components. However, only few tools exist to support the formal verification underlying these methods. OCRA (Othello Contracts Refinement Analysis) is a new tool that provides means for checking the refinement of contracts specified in a linear-time temporal logic. the specification language allows to express discrete as well as metric real-time constraints. the underlying reasoning engine allows checking if the contract refinement is correct. OCRA has been used in different projects and integrated in CASE tools.

关键词： formal specification object-oriented programming program verification software reusability software tools specification languages temporal logic

来源：评论

学校读者我要写书评

暂无评论

Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT 28

Solving the Multi-Mode Resource-Constrained Project Scheduli...

引用

28th Annual IEEE international conference on Tools with Artificial Intelligence (ICTAI)

作者： Bofill, Miquel Coll, Jordi Suy, Josep Villaret, Mateu Univ Girona Dept Informat Matemat Aplicada & Estadist Girona Spain

ISBN: (纸本)9781509044597

the Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) is a generalization of the well known Resource-Constrained Project Scheduling Problem (RCPSP). the most common exact approaches for solving this problem are based on branch-and-bound algorithms, mixed-integer linear programming and Boolean satisfiability (SAT). In this paper, we present a new exact approach for solving this problem, using Satisfiability Modulo theories (SMT). We provide two encodings into SMT and several reformulation and preprocessing techniques. the optimization algorithm that we propose uses an SMT solver as an oracle, and depending on its answer is able to update the encoding for the next optimization step. We report extensive performance experiments showing the utility of the proposed techniques and the good performance of our approach that allows us to close several open instances.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Functional and Constraint logic programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Michael Hanus Claudio Sacerdoti Coen

this book constitutes the refereed post-conference proceedings of the 28th international Workshop on Functional and Constraint logic programming, WFLP 2020, held in Bologna, Italy, in September 2020.

ISBN: (数字)9783030753337

ISBN: (纸本)9783030753320

this book constitutes the refereed post-conference proceedings of the 28th international Workshop on Functional and Constraint logic programming, WFLP 2020, held in Bologna, Italy, in September 2020.

关键词： logics and Meanings of Programs programming Techniques Computer Hardware Mathematical logic and Formal Languages Computer System Implementation Special Purpose and Application-Based Systems

来源：评论

学校读者我要写书评

暂无评论

Inferring the Data Access from the Clients of Generic APIs

Inferring the Data Access from the Clients of Generic APIs

引用

28th international conference on Software Maintenance (ICSM)

作者： Song, Hui Huang, Gang Xiong, Yingfei Sun, Yanchun Peking Univ Sch Elect Engn & Comp Sci Minist Educ Key Lab High Confidence Software Technol Beijing Peoples R China

ISBN: (纸本)9781467323123

Many programs access external data sources through generic APIs. the class hierarchy of such a generic API does not reflect the schema of any particular data source, and thus it is hard to clarify what data an API client accesses and how it obtains them. this makes it difficult to maintain the API clients. In this paper, we show that the data access of an API client can be recovered through static analysis on the client's source code. We provide a formal and intuitive way to represent the data access, as a graph of so-called summoning snippets. Each snippet stands for a type of data accessed by the client, and carries the code slice from the client about how to obtain the data via the API. We provide an automated approach to inferring a complete and well-simplified set of summoning snippets from the client source code, based on points-to analysis and code slicing. We implement this approach as a development assistant tool, and evaluate it on eight open source data processing programs, with average precision and recall of 89% and 95%, respectively. Further inspection of these clients, as well as a user study about writing data accessing code on their data sources, show that the inference results are useful in the inspection of existing clients and the development of new data access logics.

关键词： customers Clients Data sources API Application programming interfaces AXIAL POWER INDICATOR American Petroleum Institute Access to Information information retrieval Use Studies Codes Apis data types Formal logic schema

来源：评论

学校读者我要写书评

暂无评论

Resource Constrained Dialog Policy Learning via Differentiable Inductive logic programming 28

Resource Constrained Dialog Policy Learning via Differentiab...

引用

28th international conference on Computational Linguistics, COLING 2020

作者： Zhou, Zhenpeng Beirami, Ahmad Crook, Paul Shah, Pararth Subba, Rajen Geramifard, Alborz Facebook

ISBN: (纸本)9781952148279

Motivated by the needs of resource constrained dialog policy learning, we introduce dialog policy via differentiable inductive logic (DILOG). We explore the tasks of one-shot learning and zero-shot domain transfer with DILOG on SimDial and MultiWoZ. Using a single representative dialog from the restaurant domain, we train DILOG on the SimDial dataset and obtain 99+% in-domain test accuracy. We also show that the trained DILOG zero-shot transfers to all other domains with 99+% accuracy, proving the suitability of DILOG to slot-filling dialogs. We further extend our study to the MultiWoZ dataset achieving 90+% inform and success metrics. We also observe that these metrics are not capturing some of the shortcomings of DILOG in terms of false positives, prompting us to measure an auxiliary Action F1 score. We show that DILOG is 100x more data efficient than state-of-the-art neural approaches on MultiWoZ while achieving similar performance metrics. We conclude with a discussion on the strengths and weaknesses of DILOG. © 2020 COLING 2020 - 28th international conference on Computational Linguistics, Proceedings of the conference. All rights reserved.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：