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

A Survey of Reasoning in Parallelization

A Survey of Reasoning in Parallelization

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Mikhail Chalabine Christoph Kessler Programming Environments Laboratory Department of Computer and Information Science Linköping University Linkoping Sweden

We elaborate on reasoning in contemporary (semi) automatic parallelizing refactoring. As the main contribution we summarize contemporary approaches and show that all attempts to reason in parallelization thus far, have amounted to local code analysis given data and control dependencies. We conclude that, by retaining this perspective only, parallelization continues to exploit merely a subset of the reasoning methods available today and is likely to remain limited. To address this problem we suggest to expand the local analyses, such that, they take seriously relations between individual local parallelizing transformations. We argue that such a coupling allows to process sparser parallelizable constructs, such as, producer-consumer coordination. We identify questions to be addressed to put this principle into action and report on-going work on (reasoning) mechanisms able to support this.

关键词： Bismuth Artificial intelligence Automation Distributed computing Pattern recognition Software engineering programming environments computer networks Concurrent computing Information science

来源：评论

学校读者我要写书评

暂无评论

Improving grammar-based evolutionary algorithms via attributed derivation trees

Improving grammar-based evolutionary algorithms via attribut...

引用

7th European Conference on Genetic programming, EuroGP 2004

作者： Zvada, Szilvia Ványi, Róbert Department of Programming Systems Friedrich-Alexander University Martensstraße 3 ErlangenD-91058 Germany Department of Theoretical Computer Science Friedrich-Alexander University Martensstraße 3 ErlangenD-91058 Germany

ISBN: (纸本)3540213465

Using Genetic programming difficult optimization problems can be solved, even if the candidate solutions are complex objects. In such cases, it is a costly procedure to correct or replace the invalid individuals that may appear during the evolutionary process. Instead of such post-processing, context-free grammars can be used to describe the syntax of valid solutions, and the algorithm can be modified to work on derivation trees, such that it does not generate invalid individuals. Although tree operators have the advantage of good parameterizability, it is not trivial to construct them correctly and efficiently. In this paper an already existing method for derivation tree evolution and its extension towards attributed derivation trees are discussed. As the result of this extension the operators are not only faster but they are easy to parameterize, moreover the algorithm is better guided, thus it can converge faster. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Fast RNA structure alignment for crossing input structures

Fast RNA structure alignment for crossing input structures

引用

作者： Backofen, Rolf Landau, Gad M. Möhl, Mathias Tsur, Dekel Weimann, Oren Bioinformatics Institute of Computer Science Albert-Ludwigs-Universität Freiburg Germany Department of Computer Science University of Haifa Haifa 31905 Israel Department of Computer Science and Engineering NYU-Poly Six MetroTech Center Brooklyn NY 11201-3840 United States Programming Systems Lab Saarland University Saarbrücken Germany Ben-Gurion University Beer-Sheva Israel Massachusetts Institute of Technology Cambridge MA 02139 United States

The complexity of pairwise RNA structure alignment depends on the structural restrictions assumed for both the input structures and the computed consensus structure. For arbitrarily crossing input and consensus structures, the problem is NP-hard. For non-crossing consensus structures, Jiang et al.'s (2002) [9] algorithm computes the alignment in O(n2m2) time where n and m denote the lengths of the two input sequences. If the input structures are also non-crossing, the problem corresponds to tree editing which can be solved in O(m2n(1+lognm)) time (Demaine et al., 2007) [3]. We present a new algorithm that solves the problem for d-crossing structures in O(dm2nlogn) time, where d is a parameter that is one for non-crossing structures, bounded by n for crossing structures, and much smaller than n on many practical examples. Crossing input structures allow for applications where the input is not a fixed structure but is given as base-pair probability matrices. © 2010 Elsevier B.V. All rights reserved.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Product of interval-valued fuzzy graphs and degree

Product of interval-valued fuzzy graphs and degree

引用

作者： Rashmanlou, Hossein Pal, Madhumangal Borzooei, Rajab Ali Mofidnakhaei, F. Sarkar, Biswajit Department of Computer Science University College of Adib Sari Iran Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore India Department of Mathematics Shahid Beheshti University Tehran Iran Department of Physics Sari Branch Islamic Azad University Sari Iran Department of Industrial and Management Engineering Hanyang University Erica Campus Ansan Korea Republic of

Theoretical concepts of graphs are highly utilized by computer science applications. Especially in research areas of computer science such as data mining, image segmentation, clustering, image capturing and networking. The interval-valued fuzzy graphs are more flexible and compatible than fuzzy graphs due to the fact that they have many applications in networks. In this paper, at first we define three new operations on interval-valued fuzzy graphs namely strong product, tensor product and lexicographic product. Likewise, we study about the degree of a vertex in interval-valued fuzzy graphs which are obtained from two given interval-valued fuzzy graphs using the operations Cartesian product, composition, tensor and strong product of two interval-valued fuzzy graphs. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large interval-valued fuzzy graph as a combination of small, interval-valued fuzzy graphs and to derive its properties from those of the smaller ones. © 2018 - IOS Press and the authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Scalable detection of MPI-2 remote memory access inefficiency patterns

Scalable detection of MPI-2 remote memory access inefficienc...

引用

作者： Hermanns, Marc-André Geimer, Markus Mohr, Bernd Wolf, Felix Laboratory for Parallel Programming German Research School for Simulation Sciences GmbH 52425 Jülich Germany Forschungszentrum Jülich Jülich Supercomputing Centre Germany Department of Computer Science RWTH Aachen University Germany

Wait states in parallel applications can be identified by scanning event traces for characteristic patterns. In our earlier work we defined such inefficiency patterns for MPI-2 one-sided communication, although still based on a serial trace-analysis scheme with limited scalability. In this article we show how wait states in one-sided communications can be detected in a more scalable fashion by taking advantage of a new scalable trace-analysis approach based on a parallel replay, which was originally developed for MPI-1 point-to-point and collective communication. Moreover, we demonstrate the scalability of our method and its usefulness for the optimization cycle with applications running on up to 32,768 cores. © The Author(s) 2012.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Epistemic Multiagent Reasoning with Collaborative Robots 37

Epistemic Multiagent Reasoning with Collaborative Robots

引用

37th Italian Conference on Computational Logic, CILC 2022

作者： Soldà, Davide Fabiano, Francesco Dovier, Agostino Constraint and Logic Programming Lab University of Udine Udine33100 Italy Embedding System Unit of Fondazione Bruno Kessler Trento38123 Italy Department of Mathematical Physical and Computer Sciences University of Parma Parma43124 Italy Department of Mathematics Computer Science and Physics University of Udine Udine33100 Italy

Over the last few years, the fields of Artificial Intelligence, Robotics and IoT have gained a lot of attention. This increasing interest has brought, among other things, to the development of autonomous multi-agent systems where robotic entities may interact with each other. As for all the other autonomous settings, also these systems require arbitration. Our work tries to address this problem by presenting a framework that embeds both a classical and a multi-agent epistemic (epistemic, for brevity) planner in a robotic control architecture. The idea is to combine the (i) classical and the (ii) epistemic solvers to model efficiently the interaction with: the (i) physical world and the (ii) information flows, respectively. In particular, the presented architecture starts by planning on the "epistemic level" refining then single-agent world-altering actions thanks to the classical planner. To further optimize the solving process, we also introduce the concept of macros in epistemic planning. Macros, in fact, have been successfully employed in classical planning as they allow for opportune aggregations of actions that may lead to a reduction of plans' length. Finally, the overall framework is exemplified and validated with two Franka Emika manipulators. This allowed us to empirically justify how the combination of the two planning approaches (classical and epistemic), and the introduction of macros, reduce the computational time required by the orchestrating phase. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Formal specification of virtual process topologies

Formal specification of virtual process topologies

引用

IEEE International Conference on Cluster Computing

作者： K. Kazemi C. McDonald Programming Languages and Systems Group Department of Computer Science University of Western Australia Nedlands WA Australia

A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for interprocess communication, relieving the application developer of the cumbersome task of mapping logical neighbours to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server which then is used in the generation of the topological specification.

关键词： Formal specifications Message passing Libraries Network topology Workstations Supercomputers computer languages computer science Read only memory Network servers

来源：评论

学校读者我要写书评

暂无评论

A constraint-based approach for specification and verification of real-time systems

A constraint-based approach for specification and verificati...

引用

Real-Time Systems Symposium (RTSS)

作者： G. Gupta E. Pontelli Laboratory for Logic Databases and Advanced Programming Department Computer Science New Mexico State University USA

We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used for specifying real time systems. In our framework, a user models the ordering of real time events as the grammar of a language accepted by a timed automata, the real time constraints on these events are then captured as denotations of the grammar productions specified by the user. The grammar can be specified as a Definite Clause Grammar (DCG), while the denotations can be specified in constraint logic. The resulting specification can hence be regarded as a constraint logic program (CLP), and is executable. Many interesting properties of the real time system can be verified by posing appropriate queries to this CLP program. A major advantage of our approach is that it is constructive in nature, i.e., it can be used for computing the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call constraint automata and timed push down automata.

关键词： Real time systems Automata Logic programming Production systems Databases computer science Vehicles Clocks Context modeling

来源：评论

学校读者我要写书评

暂无评论

Core technologies for system renovation 23rd

Core technologies for system renovation

引用

23rd Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM 1996

作者： Van Den Brand, Mark Klint, Paul Verhoef, Chris Programming Research Group University of Amsterdam Kruislaan 403 AmsterdamNL-1098 SJ Netherlands Department of Software Technology Centre for Mathematics and Computer Science P.O. Box 4079 AmsterdamNL-1009 AB Netherlands

ISBN: (纸本)3540619941

Renovation of business-critical software is becoming increasingly important. We identify fundamental notions and techniques to aid in system renovation and sketch some basic techniques: generic language technology to build analysis tools, a knowledge retrieval system to aid in program understanding, and a coordination architecture that is useful to restructure monolithic systems thus enabling their renovation. We argue that these techniques axe not only essential for the renovation of old software but that they can also play an important role during the development and maintenance of new software systems. © 1996, Springer-Verlag. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Specification, implementation, and verification of Domain Specific Languages: A logic programming-based approach

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年 2407卷 211-239页

作者： Gupta, Gopal Pontelli, Enrico Applied Logic Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States

ISBN: (纸本)3540439595

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logic programming-based framework for specification, efficient implementation, and automatic verification of domain specific languages (DSLs). Our framework is based on using Horn logic (or pure Prolog), and eventually constraints, to specify denotational semantics of domain specific languages. Both the syntax as well as the semantic specification of the DSL in question are directly executable in our framework: the specification itself serves as an interpreter for the DSL. More efficient implementations of this DSL-a compiler-can be automatically derived via partial evaluation. Additionally, the executable specification can be used for automatic or semi-automatic verification of programs written in the DSL as well as for automatically obtaining traditional debuggers and profilers. The ability to verify DSL programs is a distinct advantage of our approach. In this paper we give a general outline of our approach, and illustrate it with practical examples. © 2002 Springer-Verlag Berlin Heidelberg.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：