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

Proceedings of the 14th international conference on Model driven engineering languages and systems

作者： Shaukat Ali Lionel C. Briand Andrea Arcuri Suneth Walawege Simula Research Laboratory and The University of Oslo Norway Simula Research Laboratory Norway Cisco Systems Inc Norway

ISBN: (纸本)9783642244841

Systematic and rigorous robustness testing is very critical for embedded systems, as for example communication and control systems. Robustness testing aims at testing the behavior of a system in the presence of faulty situations in its operating environment (e.g., sensors and actuators). In such situations, the system should gracefully degrade its performance instead of abruptly stopping execution. To systematically perform robustness testing, one option is to resort to model-based robustness testing (MBRT), based for example on UML/MARTE models. However, to successfully apply MBRT in industrial contexts, new technology needs to be developed to scale to the complexity of real industrial systems. In this paper, we report on our experience of performing MBRT on video conferencing systems developed by Cisco Systems, Norway. We discuss how we developed and integrated various techniques and tools to achieve a fully automated MBRT that is able to detect previously uncaught software faults in those systems. We provide an overview of how we achieved scalable modeling of robustness behavior using aspect-oriented modeling, test case generation using search algorithms, and environment emulation for test case execution. Our experience and lessons learned identify challenges and open research questions for the industrial application of MBRT.

关键词： aspect-oriented modeling search algorithms UML robustness MARTE Model-based testing

来源：评论

学校读者我要写书评

暂无评论

An overview of backtrack search satisfiability algorithms

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2003年第3期37卷 307-326页

作者： Lynce, I Marques-Silva, JP Univ Tecn Lisboa IST INES CEL P-1000029 Lisbon Portugal

Propositional Satisfiability ( SAT) is often used as the underlying model for a significant number of applications in Artificial Intelligence as well as in other fields of Computer Science and Engineering. Algorithmic solutions for SAT include, among others, local search, backtrack search and algebraic manipulation. In recent years, several different organizations of local search and backtrack search algorithms for SAT have been proposed, in many cases allowing larger problem instances to be solved in different application domains. While local search algorithms have been shown to be particularly useful for random instances of SAT, recent backtrack search algorithms have been used for solving large instances of SAT from real-world applications. In this paper we provide an overview of backtrack search SAT algorithms. We describe and illustrate a number of techniques that have been empirically shown to be highly effective in pruning the amount of search on significant and representative classes of problem instances. In particular, we review strategies for non-chronological backtracking, procedures for clause recording and for the identification of necessary variable assignments, and mechanisms for the structural simplification of instances of SAT.

关键词： satisfiability search algorithms backtracking

来源：评论

学校读者我要写书评

暂无评论

Mobile Robot Platform for Real-Time search algorithms

Mobile Robot Platform for Real-Time Search Algorithms

引用

International Conference Mixed Design of Integrated Circuits and Systems

作者： Janusz Pochmara Wojciech Grygiel Radoslaw Koppa Krzysztof Kaminski Poznan University of Technology Chair of Computer Engineering Poznan Poznan University of Technology

ISBN: (纸本)9781479913589

In our investigation we focus on the A~* Algorithm, for solving path-finding problems, because it is fairly flexible and can be used in a wide range of contexts. The main problem of A~* Algorithm is the finite computer memory. Using this method, the robot can decide how to move from end to end point in an efficient manner without colliding with previously mapped obstacles. When in need of finding a path on considerably large map, computer has to remember a complex list of examined and open nodes, which can occupy most of free space in computer memory. Nonetheless, this solution shows the best results and it is worth analyzing as the algorithm for the intelligent robot movements.

关键词： search algorithms Astar Path finding

来源：评论

学校读者我要写书评

暂无评论

Distributed Cooperative Path Planning for Multi-UAV in Information-Rich and Dynamic Environments

引用

DRONES 2025年第1期9卷 38-38页

作者： Duan, Pengfei Chen, Dawei Beihang Univ Dept Artificial Intelligence Beijing 100191 Peoples R China Chinese Aeronaut Estab Collaborat Innovat Ctr Beijing 100012 Peoples R China

Accurate path planning is essential for effective regional avoidance in multiple unmanned aerial vehicle (multi-UAV) systems. Existing static path-planning techniques often fail to integrate multiple information sources, resulting in diminished performance in information-rich and dynamic environments. This paper proposes a distributed collaborative path-planning algorithm for dynamically changing targets in complex environments with multisource information. More specifically, a multi-UAV collaboration and path-planning method based on information-fusion technology is first presented to fuse the multisource data received by the UAVs from different platforms, such as space-based, air-based, and land-based. Subsequently, we introduce an algorithm to mark and divide the environment and hazardous areas, therefore enhancing overall situational awareness and eliminating visual blind spots in emergency communications scenarios. Furthermore, we develop an efficient, intelligent path-planning algorithm founded on objective functions and optimization methods at different stages, enabling UAVs to navigate safely while minimizing energy expenditure. Finally, the proposed strategy is validated through a simulation platform, demonstrating that the intelligent path-planning algorithm introduced in this study exhibits robust trajectory optimization capabilities in complex environments enriched with diverse information and potential threats.

关键词： distributed collaboration path planning artificial intelligence information fusion search algorithms

来源：评论

学校读者我要写书评

暂无评论

MCTS With Refinement for Proposals Selection Games in Scene Understanding

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2025年第5期47卷 3257-3270页

作者： Stekovic, Sinisa Rad, Mahdi Moradi, Alireza Fraundorfer, Friedrich Lepetit, Vincent Graz Univ Technol Inst Comp Graph & Vis A-8010 Graz Austria Univ Paris Est Ecole Ponts ParisTech F-77420 Paris France

We propose a novel method applicable in many scene understanding problems that adapts the Monte Carlo Tree search (MCTS) algorithm, originally designed to learn to play games of high-state complexity. From a generated pool of proposals, our method jointly selects and optimizes proposals that minimize the objective term. In our first application for floor plan reconstruction from point clouds, our method selects and refines the room proposals, modelled as 2D polygons, by optimizing on an objective function combining the fitness as predicted by a deep network and regularizing terms on the room shapes. We also introduce a novel differentiable method for rendering the polygonal shapes of these proposals. Our evaluations on the recent and challenging Structured3D and Floor-SP datasets show significant improvements over the state-of-the-art both in speed and quality of reconstructions, without imposing hard constraints nor assumptions on the floor plan configurations. In our second application, we extend our approach to reconstruct general 3D room layouts from a color image and obtain accurate room layouts. We also show that our differentiable renderer can easily be extended for rendering 3D planar polygons and polygon embeddings. Our method shows high performance on the Matterport3D-Layout dataset, without introducing hard constraints on room layout configurations.

关键词： Proposals Floors Layout Three-dimensional displays Image reconstruction Optimization Point cloud compression AEC differentiable rendering floor plan estimation MCTS room layout reconstruction scene understanding search algorithms

来源：评论

学校读者我要写书评

暂无评论

CLAIRE: combining sets, search and rules to better express algorithms

引用

THEORY AND PRACTICE OF LOGIC PROGRAMMING 2002年第6期2卷 769-805页

作者： Caseau, Y Josset, FX Laburthe, F Bouygues SA eLab F-78061 St Quentin en Yvelines France

This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately well known and are available under various programming environments, the originality of the CLAIRE language comes from the tight integration, which yields interesting run-time performances, and from the richness of this combination, which yields new ways in which to express complex algorithmic patterns with few elegant lines. To achieve the opposite goals of a high abstraction level (conciseness and readability) and run-time performance (CLAIRE is used as a C++ pre-processor), we have developed two kinds of compiler: first, a pattern pre-processor handles iterations over both concrete and abstract sets (data types and program fragments), in a completely user-extensible manner;secondly, an inference compiler transforms a set of logical rules into a set of functions (demons that are used through procedural attachment).

关键词： rules sets search algorithms object-oriented language

来源：评论

学校读者我要写书评

暂无评论

An experimental study about the search mechanism in the SLAVE learning algorithm:: Hill-climbing methods versus genetic algorithms

引用

INFORMATION SCIENCES 2001年第1-4期136卷 159-174页

作者： González, A Pérez, R Univ Granada Dept Ciencias Computac & Inteligencia Artificial ETS Ingn Informat E-18071 Granada Spain

One of the basic elements in the development of the AI system is the search mechanism, The choice of the search method can determine the goodness of the developed system. In concrete, in the learning algorithms, the search mechanisms play a very important role. SLAVE is an inductive learning algorithm that describes the behavior of a system by a fuzzy rule set being a genetic algorithm of its search mechanism. In this work, we want to study the influence of the search mechanism in the learning process of SLAVE. So, we analyze the results obtained with SLAVE using several search mechanisms based on hill-climbing techniques described in the literature. (C) 2001 Elsevier Science Inc. All rights reserved.

关键词： inductive learning algorithms genetic algorithms simulated annealing hill-climbing search algorithms

来源：评论

学校读者我要写书评

暂无评论

Natural Language search and Associative-Ontology Matching algorithms Based on Graph Representation of Texts 3rd

Natural Language Search and Associative-Ontology Matching Al...

引用

3rd Conference on Computational Methods in Systems and Software (CoMeSySo)

作者： Kuleshov, Sergey Zaytseva, Alexandra Aksenov, Alexey St Petersburg Inst Informat & Automat RAS St Petersburg Russia

ISBN: (纸本)9783030303297;9783030303280

The ability to freely publish any information content is causing rapid growth of unstructured, duplicated and unreliable information volumes with irregular dynamics. This significantly complicates timely access to actual reliable information especially in the tasks of the specific scientific topics monitoring or when it is necessary to get quick insight of adjacent scientific fields of interest. The paper contains the description of the technology of text representation as a semantic graph. The algorithmic implementation of proposed technology in the tasks of fuzzy and exploratory information search is developed. The problems of current search technologies are considered. The proposed ontology-associative graph matching approach to post-full-text search system development is capable of solving the problem of document search under conditions of insufficient initial data for correct query formation. The proposed graph representation of texts allows restricting usable ontology, which in turn gives the benefit of thematic localization of the search region in the field of knowledge.

关键词： Ontology matching Associative ontology approach Natural language processing search algorithms Graph representation

来源：评论

学校读者我要写书评

暂无评论

The Research on the algorithms of Keyword search in Relational Database

The Research on the Algorithms of Keyword Search in Relation...

引用

10th Asia-Pacific Web Conference and Workshops

作者： Li, Peng Zhu, Qing Wang, Shan Renmin Univ China Sch Informat Key Lab Data Engn & Knowledge Engn Beijing 100872 Peoples R China

ISBN: (纸本)9783540893752

With the development of relational database, people require better database not only in the aspect of database performance, but, also in the aspect of the database's interactive ability. So that the database is much more friendly than just before and if;is, possible for a, common user who do not have any special knowledge oil database call access the database, without knowing the schema of database and writing intricate SQL. For the reason that the information retrieval oil the web has developed well to some extent, when we develop the technology of keyword search in relational database, we can draw some ideas from information retrieve. But the great differences between the text database oil the web and the relational database also bring some new challenges: 1) The answer needed by user is not;only one tuple in database, but the tuple sets consisting of the tuple connect from different table using the 4 primary key-foreign key" relationship. 2)The results of the evaluation criteria is more important, because it is directly related to the effectiveness of search System. 3)The structure of relational database is much more intricate than text database, and the algorithms of information retrieval are not fit the relational database. So in this paper, we introduce a novel keyword search algorithm and a modified criteria of evaluating answers in order to enhance efficiency of the keyword search and return much more effective information to users, finally, the search algorithm's performance is tested and evaluated.

关键词： Keywords search relational database information retrieval search algorithms

来源：评论

学校读者我要写书评

暂无评论

An experimental study about the search mechanism in the SLAVE learning algorithm:: Hill-climbing methods versus genetic algorithms

An experimental study about the search mechanism in the SLAV...

引用

8th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2000)

作者： González, A Pérez, R Univ Granada Dept Ciencias Computac & Inteligencia Artificial ETS Ingn Informat E-18071 Granada Spain

关键词： inductive learning algorithms genetic algorithms simulated annealing hill-climbing search algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：