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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

142 篇 期刊文献
64 篇 会议
1 篇 学位论文

馆藏范围

207 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

185 篇 工学
- 98 篇 航空宇航科学与技...
- 47 篇 仪器科学与技术
- 43 篇 计算机科学与技术...
- 36 篇 机械工程
- 28 篇 电气工程
- 12 篇 力学（可授工学、理...
- 11 篇 石油与天然气工程
- 10 篇 信息与通信工程
- 9 篇 软件工程
- 7 篇 控制科学与工程
- 7 篇 生物医学工程（可授...
- 5 篇 电子科学与技术（可...
- 5 篇 交通运输工程
- 5 篇 环境科学与工程（可...
- 3 篇 水利工程
- 3 篇 测绘科学与技术
- 3 篇 安全科学与工程
- 2 篇 土木工程
- 2 篇 船舶与海洋工程
62 篇 管理学
- 61 篇 管理科学与工程(可...
41 篇 理学
- 13 篇 物理学
- 12 篇 数学
- 9 篇 生物学
- 3 篇 化学
- 3 篇 地球物理学
- 2 篇 大气科学
16 篇 医学
- 8 篇 临床医学
- 5 篇 基础医学(可授医学...
- 4 篇 特种医学
2 篇 教育学
- 2 篇 心理学(可授教育学...
2 篇 农学
1 篇 经济学
1 篇 法学

主题

207 篇 algorithm perfor...
12 篇 search algorithm
9 篇 machine learning
9 篇 satellites
8 篇 angle of attack
8 篇 quaternions
8 篇 artificial intel...
8 篇 monte carlo simu...
7 篇 taylor series
7 篇 path planning
7 篇 earth
7 篇 image processing
7 篇 angular motion
7 篇 extended kalman ...
6 篇 dynamic response
6 篇 yaw
6 篇 numerical simula...
6 篇 euler equations
6 篇 optimization alg...
5 篇 flight testing

机构

4 篇 univ chicago dep...
3 篇 strapdown associ...
2 篇 univ calif los a...
2 篇 georgia inst tec...
2 篇 georgia inst tec...
2 篇 google inc mount...
2 篇 univ texas austi...
2 篇 kent state univ ...
2 篇 iowa state univ ...
2 篇 stanford univ de...
1 篇 insitu inc desig...
1 篇 ets aircraft mod...
1 篇 univ autonoma ma...
1 篇 univ alcala dept...
1 篇 virginia polytec...
1 篇 ohio univ commun...
1 篇 boeing co boeing...
1 篇 ctr biomed engn ...
1 篇 virginia polytec...
1 篇 polytech univ bu...

作者

4 篇 rogers jonathan
4 篇 sahiner berkman
4 篇 giger maryellen ...
4 篇 drukker karen
3 篇 mcnitt-gray mich...
3 篇 hu tingting
3 篇 wei peng
3 篇 savage paul g.
3 篇 baughan natalie
2 篇 pervan bs
2 篇 davidson morley
2 篇 volle kyle
2 篇 ignagni mb
2 篇 warner jonathan
2 篇 dethridge john
2 篇 myers kyle j.
2 篇 bertram joshua r...
2 篇 parkinson bw
2 篇 musoff h
2 篇 woolsey craig a.

语言

201 篇 英文
5 篇 其他
1 篇 德文

检索条件"主题词=algorithm performance"

共 207 条记录，以下是161-170 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Method of Structural Damage Test based on PSO algorithm

Method of Structural Damage Test based on PSO Algorithm

引用

International Asia Symposium on Intelligent Interaction and Affective Computing

作者： Yang, Tianqi Liu, Shaotang Hebei Univ Engn Dept Modern Educ Technol Ctr Handan Peoples R China Henan Inst Engn Dept Civil Engn Zhengzhou Peoples R China

ISBN: (纸本)9780769539102

In this paper, we improved the particle swarm optimization (PSO) algorithm with inertial weight by adopting the sigmoid function. The IPSO is applied to structural damage identification in frame structures. Firstly the theoretical background of the improved PSO (IPSO) algorithm is presented. Secondly, we use a suite of four famous benchmark functions to evaluate the algorithm performance. Some comparative studies on single and multi-damage of a 2-story rigid frame structure have been carried out. The results of the numerical simulation demonstrate that the approach can detect the structural damage with higher accuracy.

关键词： PSO algorithm performance structural damage

来源：评论

学校读者我要写书评

暂无评论

Lattice QCD on the IBM scalable POWERParallel systems SP2

Lattice QCD on the IBM scalable POWERParallel systems SP2

引用

1995 ACM/IEEE Supercomputing Conference (SC 95)

作者： Bernard, C DeTar, C Gottlieb, S Heller, UM Hetrick, J Ishizuka, N Karkkainen, L Lantz, SR Rummukainen, K Sugar, R Toussaint, D Wingate, M Washington Univ St. Louis United States

ISBN: (纸本)0897918622

A 512 node IBM Scalable POWERParallel Systems SP2 was installed at the Cornell Theory Center in October 1994. During the past couple of months we have Seen porting and optimizing code for carrying out lattice QCD calculations. Present performance is far from ideal, however, and optimization efforts are still under way. The rate limiting step in our code involves a rather generic inversion of. a large, sparse system, based on a partial differential equation in a multidimensional space. The insights we have gained so far may be useful in diagnosing performance in a wide class of applications. Copyright 1995 by the Association for Computing Machinery, Inc. (ACM).

关键词： IBM SP2 massively parallel processing lattice quantum chromodynamics MPL message passing algorithm optimization algorithm performance algorithm scalability partial differential equations sparse matrix problems Cornell Theory Center

来源：评论

学校读者我要写书评

暂无评论

Improvement of Gaussian Kernel Function for Face Recognition 3

Improvement of Gaussian Kernel Function for Face Recognition

引用

3rd International Conference on Electronics and Communication;Network and Computer Technology (ECNCT)

作者： He, Lingxiao Li, Shangjun Zhang, Wenfei Shanghai Pinghe Sch Shanghai 201206 Peoples R China Univ Calif Davis Davis CA 95616 USA Shanghai Shangde Expt Sch Shanghai 201315 Peoples R China

ISBN: (数字)9781510652118

ISBN: (纸本)9781510652118;9781510652101

Face recognition has been widely used in information security, access control, financial payment, criminal investigation, and other aspects due to its stability, convenience, ease to forge, and other advantages. The Gaussian blur, a fuzzy algorithm, uses the Gaussian distribution to increase the efficiency of face detection. However, the data distribution of the Gaussian blur model is not effective enough for face recognition. In this paper, we improve the one-dimensional Gaussian kernel function to the two-dimensional Gaussian kernel function and use the Gaussian distribution to improve the accuracy of the recognition system. We improve the Model and adopt the Gaussian calculation method. According to the one-dimensional Gaussian function and two-dimensional Gaussian function to carry on the analysis and operation, the conclusion is drawn that the two-dimensional Gaussian function can enhance the efficiency of face recognition when applied to the designed face recognition system. To verify the effectiveness of our method, we compare the proposed method with Gaussian blur on three different datasets. The experimental results show that our method significantly outperforms Gaussian blur. Our analyses illustrate that the recognition degree and range of the improved model are more comprehensive and broader, decreasing the time used for recognition.

关键词： Artificial Intelligence Face Recognition Gaussian Blur algorithm performance

来源：评论

学校读者我要写书评

暂无评论

Ranking Composite Services 39th

Ranking Composite Services

引用

39th International Conference on Information Systems Architecture and Technology (ISAT)

作者： Alagar, Vangalur Alsaig, Ammar Mohammad, Mubarak Concordia Univ Montreal PQ Canada

ISBN: (纸本)9783319999814;9783319999807

Service compositions are a means to create value-added services for service provider, as well as for service requester. From the consumer-centric point of view services that meet the predefined preferences of service requester add both economic value and satisfaction. In order to achieve consumer satisfaction in a market place it is necessary for service providers to design fair-algorithms for service composition and ranking of services, so that consumers will have less difficulty in selecting their most preferred services without much difficulty. This consumer-oriented approach has the potential to add value-added trust for business, leading to profitable business and healthier consumer relation. Motivated by this theme this paper proposes a fair ranking algorithm for composite services.

关键词： Fair ranking Simple and composite services algorithm performance

来源：评论

学校读者我要写书评

暂无评论

RL-based Path Planning for Autonomous Aerial Vehicles in Unknown Environments

RL-based Path Planning for Autonomous Aerial Vehicles in Unk...

引用

AIAA Aviation Forum and Exposition

作者： Battocletti, Gianpietro Urban, Riccardo Godio, Simone Guglieri, Giorgio Politecn Torino Turin Italy Politecn Torino Dept Mech & Aereospace Engn Turin Italy

ISBN: (数字)9781624106101

ISBN: (纸本)9781624106101

Unmanned Aerial Systems (UASs) have become a relevant sector in the aerospace industry. In the last decade, the increase in the capabilities of Unmanned Aerial Vehicles (UAVs), paired with a drop in their price, has led them to be used in many different applications where they are employed for their versatility and efficiency. A challenge that is being addressed in this field is that of autonomous UAVs fleets, i.e., the coordinated use of multiple UAVs to perform a common task. A particularly interesting application of UAV fleets is their use in the exploration and mapping of unknown or critical environments. This topic brings with it a significant number of challenges, from the design of the policy used to coordinate the fleet to the path planning algorithm that each UAV uses to move in the environment while exploring it. In this paper, a Reinforcement Learning (RL)-based approach for the cooperative exploration of unknown environments by a fleet of UAVs is presented. Two RL agents are trained to address this problem: the first has the task of coordinating the exploration task, optimizing the way the UAVs spread in the unknown area by assigning some waypoints to them. The waypoints are placed in order to optimize the distribution of the fleet and to maximize the exploration process efficiency. The second RL agent is a path planning algorithm and is used by each UAV to move in the environment to reach the region pointed by the first agent. The combined use of the two agents allows the fleet to coordinate in the execution of the exploration task.

关键词： Path Planning Unmanned Aerial Vehicle Reinforcement Learning Aerospace Industry Swarm algorithm Neural Networks Artificial Intelligence algorithm performance Prediction algorithms Numerical Modeling

来源：评论

学校读者我要写书评

暂无评论

A products generator for testing the performance of disassembly procedures

A products generator for testing the performance of disassem...

引用

4th International Conference on Environmentally Conscious Manufacturing

作者： Adenso-Diaz, B Torre, BG Univ Oviedo Escuela Politecn Super Ingn E-33204 Gijon Spain

ISBN: (纸本)0819455369

In recent decades, regulations and markets have been exerting pressure on designers and manufacturers to take more responsibility for the environmental impacts of their products throughout their life cycles. The problem of finding the disassembly sequence represents one of the major challenges when attempting to close product life cycles by carrying out reuse, recycling and remanufacturing practices. Many different techniques have been used to deal with this problem. varying from exact to heuristic solutions. So far, however, not much effort has gone into measuring and comparing the efficiency of this wide set of techniques. This is partly due to the difficulties of getting a wide population of real products, belonging to different industries and with different degree of complexity that might constitute a representative population for carrying out this kind of task. In this paper, a generator of complex products is presented that is able to build up products with hundreds of components joined by different kinds of joints in such a way that a theoretical "good"' disassembly sequence is always known. The efficiency of different methods for general products can thus be easily compared. The performance of a Scatter Search algorithm is tested as an example of its application in this case.

关键词： disassembly scatter search metaheuristics algorithm performance instance generator

来源：评论

学校读者我要写书评

暂无评论

Parallel Migration Models Applied to Competitive Differential Evolution

Parallel Migration Models Applied to Competitive Differentia...

引用

13th International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Bujok, Petr Tvrdik, Josef Univ Ostrava Dept Comp Sci 30 Dubna 22 CZ-70103 Ostrava Czech Republic

ISBN: (纸本)9780769546308

The influence of parallelism on the performance of competitive adaptive differential evolution is studied. Two serial competitive differential evolution variants described in literature and sixteen novel parallel variants were experimentally compared. All the parallel differential evolution variants in this study are based on a migration model with the star topology. The algorithms were compared on six benchmark functions with two levels of dimension (D = 10 and D = 30). The number of the function evaluations and the reliability rate of the search were used as basic characteristics of algorithm's performance. The experimental results show that the parallelism applied to competitive differential evolution together with a proper setting of the parameters controlling the parallel model can improve the performance of the algorithm and decrease the computational costs significantly at least in some problems.

关键词： Differential evolution parallel models algorithm performance experimental comparison

来源：评论

学校读者我要写书评

暂无评论

A Meta-Heuristic Approach for an Aerial-Ground Vehicle Path Planning Problem

A Meta-Heuristic Approach for an Aerial-Ground Vehicle Path ...

引用

AIAA SciTech Forum

作者： Lee, Jaekyung J. Rathinam, Sivakumar Humann, James D. Dotterweich, Jim Texas A&M Univ College Stn TX 77840 USA VARB DEVCOM Army Res Lab Los Angeles CA USA 3123 TAMU College Stn TX 77843 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

This study concerns the challenges of path planning and scheduling for multi-agent unmanned aerial vehicles (UAVs) operating under battery constraints while considering the presence of unmanned ground vehicles (UGVs) capable of recharging them. The objective is to efficiently coordinate UAVs and a UGV to maximize collected rewards by visiting nodes continuously in a 20 km x 20 km coverage area. The reward for each node is calculated based on the time difference between the last visit and the current visit, and the total nodes' reward contributes to the overall team score. The problem is a form of the Team Orienteering Problem (TOP), which is known to be NP-Hard. To solve this problem, we propose a new algorithm and simulation using a meta-heuristic approach. Specifically, our approach employs an advanced tabu search specialized in this problem with three improved tabu search stages: 2-point exchange, one-point movement, 2-opt cleanup, and two extra rearrange and reattach processes. It provides a feasible solution within a few minutes of computation time for large problems with accumulated nodes and rewards. Subsequently, our investigation uncovers a novel scheduling rule, which we apply to a demanding 72-hour mission schedule. Computational and simulation results demonstrate the algorithm's runtime, cumulative rewards, node visits, and charging schedules. The proposed approach is evaluated through simulations, further affirming its efficacy in addressing the challenges of path planning and scheduling for UAVs with battery constraints.

关键词： Heuristic Approach Path Planning Unmanned Ground Vehicle Unmanned Aerial Vehicle Computational Simulation algorithm performance Unmanned Vehicles Constant Current Charging Flight Operation Greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Observation Task Scheduling of Satellite Constellation with Consensus-based Task Pruning

Observation Task Scheduling of Satellite Constellation with ...

引用

AIAA SciTech Forum

作者： Kim, Sung Jun Kim, Chae-Hyeon Choi, Han-Lim Korea Adv Inst Sci & Technol Dept Aerosp Engn Daejeon 34141 South Korea Korea Adv Inst Sci & Technol KI Robot Daejeon 34141 South Korea

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

This paper introduces a consensus-based task pruning method for the MILP formulation of the satellite observation task scheduling problem. The method aims to enhance computational efficiency in assigning observation tasks to multiple satellites within a given time horizon. By establishing upper bounds for the number of tasks per satellite, the approach facilitates a bidding process where satellites reach a consensus to ensure each task is singularly assigned. This method effectively constrains the search space for the MILP solver, focusing only on allocated tasks, which leads to a significant reduction in computation time. Experimental results indicate that our method can reduce computation time by up to 95.62% compared to the exact MILP approach, without compromising the optimality of the solution.

关键词： Satellite Constellations Earth Observation Satellite Constellations MATLAB Mixed Integer Linear Programming algorithm performance Multi Agent System Climate Monitoring Satellite Services Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Optical Terrain Relative Navigation Approaches to Lunar Orbit, Descent and Landing

Optical Terrain Relative Navigation Approaches to Lunar Orbi...

引用

AIAA Science and Technology (SciTech) Forum and Exposition

作者： Steffes, Stephen R. Monterroza, Fredy Mario, Courtney Benhacine, Lylia Charles Stark Draper Lab Inc Houston TX 77058 USA

ISBN: (数字)9781624105784

ISBN: (纸本)9781624105784

Draper recognizes the importance of accurate navigation for future deep space applications and has a number of active efforts to develop solutions for these hard problems. Draper and NASA are cooperating on maturing technologies for deep space autonomous navigation and are currently concentrating on missions to the proposed Lunar Orbital Platform-Gateway orbit (a near rectilinear halo orbit around the Earth-Moon L1 Lagrange point) and on lunar landing missions. One of the more important technologies is vision aided navigation, since these techniques can be used in most flight phases to solve a number of navigation challenges. Recent developments from a number of projects have been leveraged and adapted for the lunar navigation problem. Several algorithms have been implemented and tested with simulated and real imagery for the near rectilinear halo orbit. The algorithms were evaluated based on numerous criteria, including robustness to changes in lighting over multiple orbits. This paper discusses Draper's efforts in adapting terrain relative navigation algorithms to the lunar orbit, descent and landing problems. The current approach and some general findings on several different algorithms are discussed.

关键词： Terrain Relative Navigation Near Rectilinear Halo Orbit Autonomous Navigation Space Missions Moon Planets Flight Phases algorithm performance Image Processing Machine Learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共21页 << < 12 13 14 15 16 17 18 19 20 21 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：