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

8th Annual IEEE international workshop on High-Level Design Validation and Test workshop

作者： Arora, R Hsiao, MS Virginia Tech Blacksburg VA USA

ISBN: (纸本)0780382366

We propose a novel technique to improve SAT-based Combinational Equivalence Checking (CEC) by statically adding meaningful clauses to the CNF formula of the miter circuit. A fast preprocessing quickly builds up the implication graph for the miter circuit under verification, resulting in a large set of direct, indirect and extended backward implications. the non-trivial implications are converted into two-literal clauses and added to the miter CNF database. these added clauses constrain the search space, and provide correlation among the different variables, which enhances the Boolean Constraint Propagation (BCP). Experimental results on ISCAS'85 CEC instances show that with the added clauses, an average speedup of more than 950x was achieved.

关键词： Automatic test pattern generation Boolean functions Business continuity Combinational circuits data structures databases Electronic design automation and methodology Input variables Logic Signal processing

来源：评论

学校读者我要写书评

暂无评论

Self-Adaptive Containers: Building Resource-Efficient Applications with Low Programmer Overhead

Self-Adaptive Containers: Building Resource-Efficient Applic...

引用

8th international Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)

作者： Huang, Wei-Chih Knottenbelt, William J. Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

ISBN: (纸本)9781467344012

Despite advances in operating system resource management and the availability of standardised container libraries, developing scalable high-capacity applications remains a non-trivial endeavour. Naive implementations of fundamental algorithms often rapidly exhaust system resources under heavy load. Resolving this via manual refactoring is usually possible but requires significant programmer effort, an effort which often has to be repeated in order to meet the resource constraints encountered in each different execution environment. this paper proposes a library of self-adaptive containers which provide a ready route to developing scalable applications with low programmer overhead. Given an execution environment, the library flexibly adapts its use of data structures in an effort to meet programmer-specified service level objectives. the library features a mechanism for tighter functionality specification than that provided by standard container libraries. this enables greater scope for efficiency optimisations, including the exploitation of probabilistic data structures and out-of-core storage. We have demonstrated the capabilities of the proposed library through a prototype implementation in C++. We show that when a Breadth First Search explicit state space exploration algorithm is executed, using the proposed library reduces insertion time by 68.5%, search time by 86.1%, and primary memory usage by 90.1% compared with the Standard Template Library.

关键词： Self-Adaptive Systems Containers Standard Template Library Probabilistic data structures

来源：评论

学校读者我要写书评

暂无评论

A comparison of BDDs, BMC, and sequential SAT for model checking 8

A comparison of BDDs, BMC, and sequential SAT for model chec...

引用

8th Annual IEEE international workshop on High-Level Design Validation and Test workshop

作者： Parthasarathy, G Iyer, MK Cheng, KT Wang, LC Univ Calif Santa Barbara Santa Barbara CA 93106 USA

ISBN: (纸本)0780382366

BDD-based model checking and bounded model checking (BMC) are the main techniques currently used in formal verification. An approach to unbounded model checking based on a sequential SAT solver was described in [8]. In general, there are robustness issues in SAT-based versus BDD-based model checking. the research reported in this paper attempts to analyze the asymptotic run-time behavior of modem BDD-based and SAT-based techniques for model checking to determine the circuit characteristics which lead to worst-case behavior in these approaches. We show evidence for a run-time characterization based on sequential correlation and clause density. We demonstrate that it is possible to predict the worst-case behavior of BMC based on these characterizations. this leads to some interesting insights into the behavior of these techniques on a variety of example circuits.

关键词： Boolean functions Chromium Circuits data structures Formal verification Law Legal factors Performance analysis Robustness Runtime

来源：评论

学校读者我要写书评

暂无评论

Approximate furthest neighbor with application to annulus query

引用

INFORMATION SYSTEMS 2017年 64卷 152-162页

作者： Pagh, Rasmus Silvestri, Francesco Sivertsen, Johan Skala, Matthew IT Univ Copenhagen Copenhagen Denmark

Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclidean space. the method builds on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk's approximation factor and reducing the running time by a logarithmic factor. We also present a variation based on a query-independent ordering of the database points;while this does not have the provable approximation factor of the query-dependent data structure, it offers significant improvement in time and space complexity. We give a theoretical analysis and experimental results. As an application, the query-dependent approach is used for deriving a data structure for the approximate annulus query problem, which is defined as follows: given an input set S and two parameters r > 0 and w >= 1, construct a data structure that returns for each query point q a point p is an element of S such that the distance between p and q is at least r/w and at most wr. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： SEARCH algorithms RECOMMENDER systems (Information filtering) EUCLIDEAN distance data structures (Computer science) SPACE & time

来源：评论

学校读者我要写书评

暂无评论

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Jack Snoeyink Pinyan Lu Kaile Su Lusheng Wang

ISBN: (数字)9783642297007

ISBN: (纸本)9783642296994

this book constitutes the refereed proceedings of the 6th international Frontiers of Algorithmics workshop, FAW 2012, and the 8th international Conference on Algorithmic Aspects in Information and Management, AAIM 2012, jointly held in Beijing, China, in May 2012. the 33 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 81 submissions. the papers are organized in topical sections on algorithms and data structures, algorithmic game theory and incentive analysis, biomedical imaging algorithms, communication networks and optimization, computational learning theory, knowledge discovery, and data mining, experimental algorithmic methodologies, optimization algorithms in economic and operations research, pattern recognition algorithms and trustworthy algorithms and trustworthy software.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Mathematics of Computing theory of Computation Management of Computing and Information Systems data structures

来源：评论

学校读者我要写书评

暂无评论

Bursty and hierarchical structure in streams

引用

data MINING AND KNOWLEDGE DISCOVERY 2003年第4期7卷 373-397页

作者： Kleinberg, J Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

A fundamental problem in text data mining is to extract meaningful structure from document streams that arrive continuously over time. E-mail and news articles are two natural examples of such streams, each characterized by topics that appear, grow in intensity for a period of time, and then fade away. the published literature in a particular research field can be seen to exhibit similar phenomena over a much longer time scale. Underlying much of the text mining work in this area is the following intuitive premise-that the appearance of a topic in a document stream is signaled by a "burst of activity," with certain features rising sharply in frequency as the topic emerges. the goal of the present work is to develop a formal approach for modeling such " bursts," in such a way that they can be robustly and efficiently identified, and can provide an organizational framework for analyzing the underlying content. the approach is based on modeling the stream using an infinite-state automaton, in which bursts appear naturally as state transitions;it can be viewed as drawing an analogy with models from queueing theory for bursty network traffic. the resulting algorithms are highly efficient, and yield a nested representation of the set of bursts that imposes a hierarchical structure on the overall stream. Experiments with e-mail and research paper archives suggest that the resulting structures have a natural meaning in terms of the content that gave rise to them.

关键词： data stream algorithms text mining Markov source models

来源：评论

学校读者我要写书评

暂无评论

algorithms in Bioinformatics 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540873617

ISBN: (纸本)9783540873600

this book constitutes the refereed proceedings of the 8th international workshop on algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting. the 32 revised full papers presented together with the abstract of a keynote talk were carefully reviewed and selected from 81 submissions. All current issues of algorithms in bioinformatics are addressed, reaching from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. the topics range in biological applicability from genome mapping, to sequence assembly, to microarray quality, to phylogenetic inference, to molecular modeling.

关键词： Algorithm Analysis and Problem Complexity Biochemistry, general Programming Techniques Computation by Abstract Devices data structures Discrete Mathematics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

Integrating CNF and BDD based SAT solvers 8

Integrating CNF and BDD based SAT solvers

引用

8th Annual IEEE international workshop on High-Level Design Validation and Test workshop

作者： Gopalakrishnan, S Durairaj, V Kalla, P Univ Utah Dept Elect & Comp Engn Salt Lake City UT 84112 USA

ISBN: (纸本)0780382366

this paper presents an integrated infrastructure of CNF and BDD based tools to solve the Boolean Satisfiability problem. We use both CNF and BDDs not only as a means of representation, but also to efficiently analyze, prune and guide the search. We describe a method to successfully re-orient the decision making strategies of contemporary CNF tools in a manner that enables an efficient integration with BDDs. Keeping in mind that BDDs suffer from memory explosion problems, we describe learning-based search space pruning techniques that augment the already, employed conflict analysis procedures of CNF tools. Our infrastructure is targeted towards solving those hard-to-solve instances where contemporary CNF tools invest significant search times. Experiments conducted over a wide range of benchmarks demonstrate the promise of our approach.

关键词： Binary decision diagrams Boolean functions Cities and towns data structures Decision making Equations Explosions Reachability analysis Runtime Scalability

来源：评论

学校读者我要写书评

暂无评论

Treemaps and the Visual comparison of hierarchical multi-attribute data 16

Treemaps and the Visual comparison of hierarchical multi-att...

引用

13th ACM international Working Conference on Advanced Visual Interfaces, AVI 2016

作者： Wittenburg, Kent Turchi, Tommaso Mitsubishi Electric Research Laboratories Inc. 201 Broadway 8th Floor CambridgeMA02129 United States Brunel University London Kingston Ln Uxbridge MiddlesexUB83PH United Kingdom

ISBN: (纸本)9781450341318

Treemaps have the desirable property of presenting overviews along with details of data and thus are of interest in visualizations of multi-attribute tabular data with attribute hierarchies. However, the original treemap algorithms and most subsequent variations are hampered in making parallel structures in a hierarchical data structure visually comparable. Structurally parallel elements are not aligned, making it difficult to compare them visually. We propose a method that allows for proportional and non-proportional subdivisions of subtrees while preserving visual alignment of parallel structures. We extend the framework so that other types of data visualizations can be placed within the graphical areas of a treemap to allow for the visual comparison of a broad collection of data types including temporal data. © 2016 Copyright held by the owner/author(s).

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

algorithms and Models for the Web Graph 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Alan Frieze Paul Horn Paweł Prałat

ISBN: (数字)9783642212864

ISBN: (纸本)9783642212857

this book constitutes the refereed proceedings of the 8th international workshop on algorithms and Models for the Web-Graph, WAW 2011, held in Atlanta, GA, in May 2011 - co-located with RSA 2011, the 15th international Conference on Random structures and algorithms.;the 13 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 19 submissions. Addressing a wide variety of topics related to the study of the Web-graph such as theoretical and empirical analysis, the papers feature original research in terms of algorithmic and mathematical analysis in all areas pertaining to the World-Wide Web with special focus to the view of complex data as networks.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Information Systems Applications (incl. Internet) data Mining and Knowledge Discovery Computer Communication Networks Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：