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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

175 篇 期刊文献
56 篇 会议
3 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

162 篇 工学
- 66 篇 计算机科学与技术...
- 33 篇 电气工程
- 26 篇 控制科学与工程
- 24 篇 软件工程
- 15 篇 机械工程
- 11 篇 化学工程与技术
- 9 篇 材料科学与工程（可...
- 9 篇 动力工程及工程热...
- 9 篇 信息与通信工程
- 8 篇 仪器科学与技术
- 7 篇 力学（可授工学、理...
- 6 篇 石油与天然气工程
- 5 篇 航空宇航科学与技...
- 4 篇 电子科学与技术（可...
- 3 篇 光学工程
- 3 篇 土木工程
- 2 篇 水利工程
- 2 篇 环境科学与工程（可...
- 2 篇 生物工程
115 篇 理学
- 74 篇 数学
- 19 篇 物理学
- 15 篇 化学
- 7 篇 生物学
- 6 篇 统计学（可授理学、...
- 3 篇 地球物理学
64 篇 管理学
- 64 篇 管理科学与工程(可...
8 篇 医学
- 4 篇 药学(可授医学、理...
- 3 篇 临床医学
5 篇 经济学
- 3 篇 应用经济学
- 2 篇 理论经济学
4 篇 农学
2 篇 法学
1 篇 教育学
1 篇 文学

主题

235 篇 simplex algorith...
59 篇 linear programmi...
16 篇 optimization
13 篇 genetic algorith...
7 篇 computational co...
6 篇 adaptive optics
4 篇 exterior point a...
4 篇 global optimizat...
3 篇 degeneracy
3 篇 algorithms
3 篇 pivoting rules
3 篇 mathematical ana...
3 篇 network flows
3 篇 hybrid algorithm
3 篇 large-scale line...
3 篇 convex hull
3 篇 branch-and-bound
3 篇 image sharpness
3 篇 dynamic programm...
2 篇 computer simulat...

机构

2 篇 univ michigan an...
2 篇 college of compu...
2 篇 se univ dept mat...
2 篇 southeast univ d...
2 篇 budapest univ te...
2 篇 consultant
2 篇 natl univ irelan...
2 篇 univ calif davis...
2 篇 univ washington ...
2 篇 atom energy comm...
2 篇 univ innsbruck i...
1 篇 univ salerno dep...
1 篇 ritsumeikan univ...
1 篇 rice univ dept c...
1 篇 rice univ dept e...
1 篇 simon fraser uni...
1 篇 concordia univ d...
1 篇 univ texas dept ...
1 篇 eth zentrum eth ...
1 篇 southwest petr u...

作者

4 篇 samaras nikolaos
3 篇 pan ping-qi
3 篇 kocsis attila
2 篇 nabli hedi
2 篇 chhatre sunil
2 篇 ruan xuexian
2 篇 konstantinidis s...
2 篇 ouyang aijia
2 篇 felberer f.
2 篇 murray l. p.
2 篇 tlas m.
2 篇 tsai zhi-ren
2 篇 bodson marc
2 篇 coignus j.
2 篇 fadel maurice
2 篇 hu jian-feng
2 篇 soleimani-damane...
2 篇 zwick uri
2 篇 müller-plathe f
2 篇 thiemann rene

语言

206 篇 英文
22 篇 其他
6 篇 中文
1 篇 朝鲜文

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

共 235 条记录，以下是171-180 订阅

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

详细简洁

排序：

Task Assignment of Heterogeneous UAV for Anti-radar Mission Using CTAP Models 16

Task Assignment of Heterogeneous UAV for Anti-radar Mission ...

引用

16th IEEE International Conference on Mechatronics and Automation (IEEE ICMA)

作者： Yi, Siqi Long, Zhiqiang Lin, Juncan Natl Univ Def Technol Coll Intelligent Sci Changsha 410073 Peoples R China Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha 410073 Peoples R China

ISBN: (纸本)9781728116976

In this paper, task assignment about the anti-radar cooperative combat with heterogeneous unmanned aerial vehicle (UAV) formation is analyzed. First, the capacitated transshipment assignment problem (CTAP) model is adapted to represent the task assignment, and the fast and efficient large-scale minimum cost algorithm combined with the tree search is proposed to solve the final task plan. Specifically, the variable definition and reasonable coordination constraints between UAVs and the tasks are presented in detail. Moreover, we design and realized a simulation system which is called heterogeneous UAV formation cooperative task assignment simulation platform, which can test and analyze the optimization and feasibility of the proposed algorithm.

关键词： Heterogeneous UA V formation Task assignment CTAP model simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

BUDGET CONSTRAINED OPTIMAL TIME SCHEDULING algorithm IN GRID

BUDGET CONSTRAINED OPTIMAL TIME SCHEDULING ALGORITHM IN GRID

引用

2nd IEEE International Conference on Broadband Network and Multimedia Technology

作者： Yi, Lv Chuan, Liu Sheng, Huang Qing, Jiang Chongqing Univ Posts & Telecommun Commun & Informat Engn Inst Chongqing 400065 Peoples R China

ISBN: (纸本)9781424450053

Tasks' smallest completion time is a fundamental goal of the grid scheduling, however, the completion time of tasks and cost are often anti-correlated. In this paper, A Budget Constrained Optimal Time Scheduling on the grid computing platforms is discussed, where resources have different speeds of computation and Prices. The task scheduling problem is converted into a linear programming problem. Each resource gains the optimal execution time and the smallest completion time of the task were obtained, under the condition of the budget constraint, using of the simplex algorithm to obtain the optimal solution. The simulation results show that the performance of the algorithm is superior to other similar algorithms.

关键词： grid scheduling linear programming simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Remote phasing of the multiple mirror telescope with far-field optimization

Remote phasing of the multiple mirror telescope with far-fie...

引用

Telescope Control Systems II Conference

作者： Mehta, NC Allen, CW consultant (United States)

ISBN: (纸本)0819425346

In order to achieve diffraction-limited performance in a distributed aperture optical system such as the Multiple Mirror Telescope, the elements must be optically phased to form a single aperture which can be a difficult task, In this paper, we report a novel, iterative adaptive control method, called Far-Field Optimization, which employs the simplex algorithm to configure the elements of a distributed aperture telescope to optical alignment. Far-field optimization does not require the knowledge of the adaptive mirror surfaces, thus eliminating the need for a wavefront sensor, but uses a simple measure of the point-spread function (image-plane intensity). We present results of computer simulations to demonstrate the utility of far-field optimization to remotely align the six-element Multiple Mirror Telescope in a few seconds, even in the presence of drifting atmospheric turbulence.

关键词： multiple mirror telescope remote alignment active optics far-field optimization simplex algorithm global optimization adaptive optics atmospheric turbulence compensation

来源：评论

学校读者我要写书评

暂无评论

Optimization of Routing Architecture and Performance for FPGA Routing Fabric

Optimization of Routing Architecture and Performance for FPG...

引用

4th Asia Symposium on Quality Electronic Design (ASQED)

作者： Tan, Biley Altera Corp M Sdn Bhd IC Design Engn George Town 11900 Malaysia

ISBN: (纸本)9781467326865

Being a critical highway between FPGA core IPs, the routing fabric components play an integral part in overall core performance. Optimizing the components in the routing fabric region is not a trivial task when considering the multitude of variable physical parameters involved especially the profound association with software programming and constantly changing process parameters. Common optimization algorithm would be discussed, incorporating propose multi-dimensional graphical method. Case study illustrates the potential of graphical method in identifying optimal component sizing and tradeoffs, aiding design and decision making in delivering the most optimal designs in routing fabric region. Supported by comprehensive graphical performance visualization, basic routing element architecture would also be discussed, developing expressions to promote faster optimization by narrowing down the region of interest;improving resource utilization on optimization.

关键词： Routing resource optimization simplex algorithm graphical visualization routing architecture FPGA

来源：评论

学校读者我要写书评

暂无评论

Design and Optimization of an Active OTA-C Filter Based on STOHE algorithm 24

Design and Optimization of an Active OTA-C Filter Based on S...

引用

24th International Conference on Applied Electronics (AE)

作者： Barri, Dalibor Jakovenko, Jiri Czech Tech Univ Dept Microelect Prague Czech Republic STMicroelect Dept Microelect Prague Czech Republic

ISBN: (纸本)9788026108122

With increasing demands on design and optimization of analog circuits in real applications, a limited number of algorithms for practical use have been presented. The drawbacks of already existing standard algorithms are in a possibility to stagnate in a not optimal solution and also big time consumption. These drawbacks have been overcome by our new proposed algorithm STOHE. The new algorithm is a combination of a STOchastic and HEuristic algorithms. As the stochastic respectively heuristic algorithm was chosen differential evolution algorithm respectively simplex algorithm. The algorithm has been verified by the design and optimization of an active OTA-C filter where the standard approach fails.

关键词： differential evolution algorithm OTA-C filter simplex algorithm STOHE algorithm

来源：评论

学校读者我要写书评

暂无评论

BEYOND HIRSCH CONJECTURE: WALKS ON RANDOM POLYTOPES AND SMOOTHED COMPLEXITY OF THE simplex METHOD

BEYOND HIRSCH CONJECTURE: WALKS ON RANDOM POLYTOPES AND SMOO...

引用

47th Annual IEEE Symposium on Foundations of Computer Science

作者： Vershynin, Roman Univ Calif Davis Dept Math Davis CA 95616 USA

ISBN: (纸本)0769527205

The smoothed analysis of algorithms is concerned with the expected running time of an algorithm under slight random perturbations of arbitrary inputs. Spielman and Teng proved that the shadow vertex simplex method has polynomial smoothed complexity. On a slight random perturbation of an arbitrary linear program, the simplex method finds the solution after a walk on polytope(s) with expected length polynomial in the number of constraints n, the number of variables d, and the inverse standard deviation of the perturbation 1/sigma. We show that the length of walk in the simplex method is actually polylogarithmic in the number of constraints n. Spielman-Teng's bound on the walk was O*(n(86) d(55) sigma(-30)), up to logarithmic factors. We improve this to O(log(7) n(d(9) + d(3) sigma(-4))). This shows that the tight Hirsch conjecture n-d on the length of walk on polytopes is not a limitation for the smoothed linear programming. Random perturbations create short paths between vertices. We propose a randomized Phase-I for solving arbitrary linear programs, which is of independent interest. Instead of finding a vertex of a feasible set, we add a vertex at random to the feasible set. This does not affect the solution of the linear program with constant probability. So, in expectation it takes a constant number of independent trials until a correct solution is found. This overcomes one of the major difficulties of smoothed analysis of the simplex method-one can now statistically decouple the walk from the smoothed linear program. This yields a much better reduction of the smoothed complexity to a geometric quantity-the size of planar sections of random polytopes. We also improve upon the known estimates for that size, showing that it is polylogarithmic in the number of vertices.

关键词： simplex algorithm smoothed analysis random polytopes

来源：评论

学校读者我要写书评

暂无评论

Upper and Lower Bounds on the Smoothed Complexity of the simplex Method 2023

Upper and Lower Bounds on the Smoothed Complexity of the Sim...

引用

55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)

作者： Huiberts, Sophie Lee, Yin Tat Zhang, Xinzhi Columbia Univ New York NY 10027 USA Microsoft Res Redmond WA USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450399135

The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng ( JACM '04) for this purpose, defines the smoothed complexity of solving a linear program with d variables and n constraints as the expected running time when Gaussian noise of variance sigma(2) is added to the LP data. We prove that the smoothed complexity of the simplex method is O (sigma(-3/2) d(13/4) log(7/4) n), improving the dependence on 1/.. compared to the previous bound of O(sigma(-2) d(2) root log n). We accomplish this through a new analysis of the shadow bound, key to earlier analyses as well. Illustrating the power of our new method, we use our method to prove a nearly tight upper bound on the smoothed complexity of two-dimensional polygons. We also establish the first non-trivial lower bound on the smoothed complexity of the simplex method, proving that the shadow vertex simplex method requires at least O (min sigma(-1/2) d(-1/2) log(-1/4) d(2d)) pivot steps with high probability. A key part of our analysis is a new variation on the extended formulation for the regular 2-gon. We end with a numerical experiment that suggests this analysis could be further improved.

关键词： simplex algorithm Linear Programming Smoothed Complexity

来源：评论

学校读者我要写书评

暂无评论

algorithms and Software for Studying the Impact of Fuel and Energy Prices on the Economy of the Russian Federation 10

Algorithms and Software for Studying the Impact of Fuel and ...

引用

10th International Conference on Management of Large-Scale System Development (MLSD)

作者： Lukatskii, Alexander M. Fedorova, Galina V. Russian Acad Sci Energy Res Inst ERIRAS Moscow Russia

ISBN: (纸本)9781538607985

The software tools that were used to simulate the impacts from the change of prices for fuel and energy on economic subjects of the Russian economy are described. The equations of product input-output balances are used here to coordinate the decisions of economic subjects. An algorithm for obtaining a solution of a system of linear inequalities of this problem is proposed. It based on the method of inverse matrix and can be considered as an alternative to the simplex algorithm. Its implementation is an improvement of the software tools of the Creator and Digger complex developed earlier in ERIRAS.

关键词： economic subjects macroeconomic model product input-output balances prices of fuel and energy resources simulation modeling linear inequalities simplex algorithm inverse matrix

来源：评论

学校读者我要写书评

暂无评论

Simple inexpensive adaptive optical system for large ground-based telescopes at infrared wavelengths

Simple inexpensive adaptive optical system for large ground-...

引用

SPIE Conference on Adaptive Optical System Technologies

作者： Mehta, NC Consultant (United States)

ISBN: (纸本)0819428000

Simple adaptive optical systems are studied that can provide real-time atmospheric turbulence compensation at infrared wavelengths for large ground-based astronomical telescopes. A tip-tilt mirror and a 7-element segmented mirror, along with an iterative adaptive control method, called Far-Field Optimization, provide the turbulence correction. The primary advantage of far-held optimization is that no near-field phase measurements are required, thus eliminating the need for a wavefront sensor that is necessary in conventional adaptive optical systems. Far-field optimization may also somewhat relax the requirements for an artificial guide star. Computer simulations are used to investigate the application of far-field optimization in the presence of drifting atmospheric turbulence and as a function of the spatial granularity and the temporal bandwidth of the adaptive mirror.

关键词： adaptive optics atmospheric turbulence correction segmented mirror tip-tilt mirror spatial granularity temporal bandwidth far-field optimization simplex algorithm global optimization

来源：评论

学校读者我要写书评

暂无评论

Solving Totally Unimodular LPs with the Shadow Vertex algorithm 32

Solving Totally Unimodular LPs with the Shadow Vertex Algori...

引用

32nd International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Brunsch, Tobias Grosswendt, Anna Roeglin, Heiko Univ Bonn Dept Comp Sci Bonn Germany

ISBN: (纸本)9783939897781

We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number n of variables, the number m of constraints, and 1/delta, where delta is a parameter that measures the flatness of the vertices of the polyhedron. This extends our recent result that the shadow vertex algorithm finds paths of polynomial length (w.r.t. n, m, and 1/delta) between two given vertices of a polyhedron [4]. Our result also complements a recent result due to Eisenbrand and Vempala [6] who have shown that a certain version of the random edge pivot rule solves linear programs with a running time that is strongly polynomial in the number of variables n and 1/delta, but independent of the number m of constraints. Even though the running time of our algorithm depends on m, it is significantly faster for the important special case of totally unimodular linear programs, for which 1/delta <= n and which have only O(n(2)) constraints.

关键词： linear optimization simplex algorithm shadow vertex method

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：