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

14th Brazilian Symposium on Information Systems (SBSI)

作者： da Silva, Gabriel Bueno Seabra, Rodrigo Duarte Univ Fed Itajuba Ave BPS 1303 BR-37500903 Itajuba MG Brazil

ISBN: (纸本)9781450365598

Teaching of algorithms and data structures is present in the curriculum of the most computer courses, having great influence on the performance of students in some subsequent disciplines, as well as student training. However, many students' present difficulties in learning of the subject due to the abstraction ability and logical reasoning often have not developed. This research aims at presenting an open educational resource to assist students in learning algorithms and data structures. After applying the case study, the main results showed that the tool proposed is a good alternative to be used in the classroom contributing to learning the theme(1).

关键词： REA-AED Open Educational Research algorithms and data structures Teaching

来源：评论

学校读者我要写书评

暂无评论

GECCO'16 Workshop on algorithms and data structures for Evolutionary Computation Chairs' Welcome

GECCO'16 Workshop on Algorithms and Data Structures for Evol...

引用

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion

作者： Maxim Buzdalov ITMO University Saint Petersburg Russian Fed.

No abstract available.

ISBN: (纸本)9781450343237

No abstract available.

关键词： multiobjective optimization evolutionary computation algorithms and data structures speedup techniques

来源：评论

学校读者我要写书评

暂无评论

HEMLAB Algorithm Applied to the High-Lift Japan Aerospace Exploration Agency Standard Model

引用

JOURNAL OF AIRCRAFT 2025年第1期62卷 207-218页

作者： Sukas, Hulya Sahin, Mehmet Istanbul Tech Univ Fac Aeronaut & Astronaut TR-34469 Istanbul Turkiye

The high-lift Japan Aerospace Exploration Agency (JAXA) standard model (HL-JSM) has been numerically analyzed in order to further validate the HEMLAB code for realistic aircraft configurations. The numerical algorithm is based on highly efficient edge-based data structure for a vertex-based finite volume algorithm on hybrid meshes. The data pattern is arranged to meet the requirements of a vertex-based finite volume algorithm by considering data access patterns and cache efficiency. A fully implicit version of the numerical algorithm has also been implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc) library in order to improve the robustness of the algorithm. The resulting algebraic equations, including the one-equation Spalart-Allmaras, are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the flexible generalized minimal residual method [FGMRES(m)] Krylov subspace algorithm. The numerical method is also combined with the metric-based anisotropic mesh refinement library Python Adaptive Mesh Geometry Suite-INRIA (pyAMG) from National Institute for Research in Digital Science and Technology in order to improve the numerical accuracy. The numerical algorithm is initially applied to the two-dimensional L1T2 (National High Lift Programme) high-lift system, and then the calculations around the HL-JSM are carried out at relatively high angles of attack. The numerical results with the anisotropic mesh refinement library pyAMG indicate significant improvements in numerical accuracy.

关键词： algorithms and data structures Optimization Algorithm Aircraft Components and Structure Aerodynamic Force Unsteady Reynolds Averaged Navier Stokes Adaptive Mesh Refinement Computational Fluid Dynamics High Performance Computing Fluid Flow Properties

来源：评论

学校读者我要写书评

暂无评论

Consensus-Enabled Active Learning for Multi-Agent Systems in Ground Classification of Wetlands

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2025年第3期22卷 154-162页

作者： Fernando, Chandima Basha, Elizabeth Bradley, Justin Detweiler, Carrick Univ Nebraska Lincoln Sch Computing Lincoln NE 68588 USA Brookhaven Natl Lab Natl Synchrotron Light Source 2 Upton NY 11973 USA Univ Pacific Elect & Comp Engn Dept Stockton CA 95211 USA Univ Nebraska Lincoln Sch Comp Richard L & Carol S McNeel Associate Prof Lincoln NE 68588 USA Univ Nebraska Lincoln AIAA Lincoln NE 68588 USA North Carolina State Univ Raleigh NC 27695 USA

Distributed multi-agent unmanned aerial systems (UAS) have the potential to be heavily utilized in environmental monitoring, especially in wetland monitoring. Deep active learning algorithms provide key tools to analyze the sensed images captured during monitoring and interpret them precisely. However, these algorithms demand significant computational resources that limit their use with distributed UAS. In this paper, we propose a novel algorithm for consensus-enabled active learning that drastically reduces the computational demand while increasing the overall model accuracy. Once each of the UAS obtains a labeled subset of images through active learning, we update the weights of the model for three epochs only on the new images to reduce the computational cost, allowing for an increased operational time. The group of UAS communicates the model weights instead of the raw data and then leverages consensus to agree on updated weights. The consensus step mitigates the impact on weights caused by the updates and generalizes the knowledge of each individual UAS to the whole system, which results in increased model accuracy. Our method achieved an average of 11.15% increase in accuracy over 25 acquisition iterations whilst utilizing only 16.8% of the processor time compared to the centralized method of active learning.

关键词： Multi Agent System Unmanned Aerial Systems Convolutional Neural Network algorithms and data structures Communication Technology and Equipment Robots Guidance, Navigation, and Control Systems Computation Methods data Acquisition Water Landing

来源：评论

学校读者我要写书评

暂无评论

Practical Implementation of Optimal Bang-Bang Evasive Guidance

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2025年第3期48卷 707-713页

作者： Hou, Libing Wang, Junzhi Kuang, Minchi He, Shaoming Beijing Inst Technol Sch Aerosp Engn 5th Zhongguancun South St Beijing 100081 Peoples R China Tsinghua Univ Dept Precis Instrument 30th Shuangqing St Beijing 100084 Peoples R China Beijing Inst Technol Sch Aerosp Engn 5th Zhongguancun South St Beijing 100081 Peoples R China

来源：评论

学校读者我要写书评

暂无评论

Two data structures for building tetrahedralizations

引用

The Visual Computer 1990年第5期6卷 266-283页

作者： Bruzzone, Elisabetta De Floriani, Leila Elettronica San Giorgio-Elsag S.p.A. Genova I-16154 Via Puccini 2 Italy Istituto per la Matematica Applicata Consiglio Nazionale delle Ricerche Genova I-16132 Via L.B. Alberti 4 Italy

A polyhedral decomposition can be unambiguously described as the collection of four primitive elements (i.e., polyhedra, facets, edges, and vertices) plus their mutual adjacency relations. We consider here the problem of representing a specific kind of polyhedral decomposition, i.e., a tetrahedralization. We describe two different representations for a tetrahedralization. The first one can only model polyhedral decompositions with tetrahedral cells, while the second one is suitable for describing any partition of a volume into polyhedral cells with triangular facets. We present two sets of primitive Euler operators, which build and manipulate such representations while maintaining their topological integrity. The use of such operators is demonstrated in connection with two algorithms for building a Delaunay tetrahedralization, which show the different hedralization, which show the different uses of the two representations. © 1990 Springer-Verlag.

关键词： algorithms and data structures Decomposition models Delaunay triangulation Solid modeling Tetrahedralization

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Higher-Order Velocity Obstacle for Dynamic Collision Avoidance in Uncertain Environments

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2024年第9期21卷 709-725页

作者： Dinkar, Kumar Rahul Ghosh, Satadal Indian Inst Technol Madras Dept Aerosp Engn Chennai 600036 India ZF India Vehicle Mot Controls Chennai India

Autonomous systems like unmanned aircraft systems are touted as front-runners in terms of efficiency and agility in challenging operations like emergency response. The ability of autonomous agents in such systems to avoid collisions with dynamic obstacles while navigating through an obstacle-cluttered environment is critical for success in any mission. In addition to that, further challenges are posed by environments with uncertainties in obstacles' motion, sensing, and occluded regions. To this end, a higher-order velocity obstacle-based novel motion planner is presented in this paper in a probabilistic setup for smooth, collision-free navigation of the agent with acceleration constraints in uncertain, unstructured environments with an element of anticipation for the future environment. The effectiveness of the developed algorithm for safe, collision-free, and smooth navigation of the agent is investigated in simulation studies in two different kinds of environments, one with known trajectories of obstacles and the other with unknown maneuvering trajectories of obstacles. Extensive simulation studies are performed in the presence of dynamic obstacles to elucidate the performance of the proposed algorithm on four crucial parameters-mission time, computational time, minimum obstacle distance, and an overall control effort under varied obstacle densities. With satisfactory performance in all these aspects, the developed algorithm possesses strong potential for real-time implementation.

关键词： Aircraft Collision Avoidance Systems Unmanned Aircraft System Autonomous Systems Robot Kinematics Probability Distribution Functions Aerial Robots Model Predictive Control Trajectory Optimization Flight Control Surfaces algorithms and data structures

来源：评论

学校读者我要写书评

暂无评论

NUMERICAL APPROACH TO COMPUTING NONLINEAR H-INFINITY CONTROL LAWS

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1995年第5期18卷 989-994页

作者： HUANG, J LIN, CF American GNC Corporation Chatsworth California 91311

An algorithm and data structure are developed for finding the Taylor series solution of the Hamilton-Jacobi-Isaacs equation associated with the nonlinear H-infinity control problem. This algorithm yields a set of linear algebraic equations that not only lead to a transparent solvability condition of the Hamilton-Jacobi-Isaacs equation in the form of the Taylor series, but also furnish a systematic procedure to generate the coefficients of the Taylor series. This algorithm is illustrated through a missile pitch autopilot design example.

关键词： Computing Angle of Attack Taylor Series Autopilot algorithms and data structures Aerodynamic Coefficients H Infinity Control Dynamic Pressure Closed Loop System Feedback Control

来源：评论

学校读者我要写书评

暂无评论

Optimal Point Movement for Covering Circular Regions

引用

ALGORITHMICA 2015年第2期72卷 379-399页

作者： Chen, Danny Z. Tan, Xuehou Wang, Haitao Wu, Gangshan Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA Tokai Univ Hiratsuka Kanagawa 2591292 Japan Utah State Univ Dept Comp Sci Logan UT 84322 USA Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China

Given n points in a circular region C in the plane, we study the problems of moving the n points to the boundary of G to form a regular n-gon such that the maximum (min-max) or the sum (min-sum) of the Euclidean distances traveled by the points is minimized. These problems have applications, e.g., in mobile sensor barrier coverage of wireless sensor networks. The min-max problem further has two versions: the decision version and the optimization version. For the min-max problem, we present an O(nlog(2) n) time algorithm for the decision version and an O(nlog(3) n) time algorithm for the optimization version. The previously best algorithms for the two problem versions take O(n (3.5)) time and O(n (3.5)logn) time, respectively. For the min-sum problem we show that a special case with all points initially lying on the boundary of the circular region can be solved in O(n (2)) time, improving a previous O(n (4)) time solution. For the general min-sum problem, we present a 3-approximation O(n (2)) time algorithm. In addition, a by-product of our techniques is an algorithm for dynamically maintaining the maximum matching of a circular convex bipartite graph;our algorithm can handle each vertex insertion or deletion on the graph in O(log(2) n) time. This result may be interesting in its own right.

关键词： Computational geometry algorithms and data structures Circular region coverage Barrier coverage Mobile sensors Dynamic maximum matching Circular convex bipartite graph

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for the minimum connected domination on trapezoid graphs

引用

INFORMATION SCIENCES 2007年第12期177卷 2405-2417页

作者： Tsai, Yin-Te Lin, Yaw-Ling Hsu, F. R. Department of Computer Science and Communication Engineering Providence University Taiwan Department of Computer Science and Information Engineering Providence University Taiwan Department of Information Engineering and Computer Science Feng Chia University Taiwan

Given the trapezoid diagram, the problem of finding the minimum cardinality connected dominating set in trapezoid graphs was solved in O(m + n) time [Y.D. Liang, Steiner set and connected domination in trapezoid graphs, Inform. Process. Lett. 56 (2) (1995) 101-108]. Kbhler [E. Kohler, Connected domination and dominating clique in trapezoid graphs, Discr. Appl. Math. 99 (2000) 91-110] recently improved this result to O(n) time. For the (vertex) weighted case, the problem of finding the minimum weighted connected dominating set in trapezoid graphs can be solved in O(m + n log n) time [Anand Srinivasan, M.S. Chang, K. Madhukar, C. Pandu Rangan, Efficient algorithms for the weighted domination problems on trapezoid graphs, Manuscript, 1996]. Herein n (m) denotes the number of vertices (edges) of the trapezoid graph. In this paper, we show a different approach for the problem of finding the minimum cardinality connected dominating set in trapezoid graphs using O(n) time. For finding the minimum weighted connected dominating set, we show the problem can be solved in O(n log log n) time. (c) 2007 Elsevier Inc. All rights reserved.

关键词： algorithms and data structures trapezoid graphs dominating set (weighted) connected dominating set

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：