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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,234 篇 期刊文献
1,749 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

4,003 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,672 篇 工学
- 2,095 篇 计算机科学与技术...
- 1,457 篇 软件工程
- 741 篇 电气工程
- 612 篇 控制科学与工程
- 332 篇 机械工程
- 325 篇 信息与通信工程
- 154 篇 动力工程及工程热...
- 148 篇 石油与天然气工程
- 129 篇 电子科学与技术（可...
- 128 篇 土木工程
- 91 篇 材料科学与工程（可...
- 89 篇 仪器科学与技术
- 75 篇 环境科学与工程（可...
- 72 篇 交通运输工程
- 69 篇 力学（可授工学、理...
- 64 篇 建筑学
- 61 篇 化学工程与技术
- 57 篇 水利工程
- 55 篇 航空宇航科学与技...
- 47 篇 生物医学工程（可授...
1,884 篇 理学
- 1,454 篇 数学
- 230 篇 系统科学
- 197 篇 物理学
- 197 篇 统计学（可授理学、...
- 68 篇 化学
- 60 篇 生物学
389 篇 管理学
- 338 篇 管理科学与工程(可...
- 72 篇 工商管理
- 48 篇 图书情报与档案管...
95 篇 医学
54 篇 经济学
- 51 篇 应用经济学
27 篇 农学
21 篇 法学
16 篇 教育学
9 篇 文学
3 篇 军事学
2 篇 艺术学

主题

4,003 篇 optimization alg...
270 篇 optimization
190 篇 algorithms
98 篇 machine learning
88 篇 design
65 篇 particle swarm o...
55 篇 genetic algorith...
54 篇 optimal control
51 篇 convergence
48 篇 objective functi...
47 篇 genetic algorith...
39 篇 simulation
39 篇 artificial intel...
38 篇 optimal design
38 篇 converge
34 篇 evolutionary alg...
34 篇 heuristic algori...
33 篇 predictive contr...
32 篇 deep learning
32 篇 optimisation

机构

12 篇 duy tan univ ins...
10 篇 national key lab...
8 篇 amman arab univ ...
7 篇 stanford univers...
7 篇 univ technol syd...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 google research ...
6 篇 school of artifi...
6 篇 semnan univ dept...
5 篇 politecn milan d...
5 篇 tu wien austria
5 篇 ain shams univ f...
5 篇 google deepmind ...
5 篇 school of data s...
5 篇 school of comput...
5 篇 university of mi...
5 篇 ton duc thang un...
4 篇 college of compu...
4 篇 semnan univ fac ...

作者

12 篇 abualigah laith
11 篇 ehteram mohammad
9 篇 gandomi amir h.
9 篇 hasanipanah mahd...
9 篇 notarstefano giu...
9 篇 ishibuchi hisao
8 篇 zhan zhi-hui
8 篇 zhang jun
7 篇 neumann frank
7 篇 rashid tarik a.
7 篇 ahmed ali najah
7 篇 hasanien hany m.
7 篇 quirynen rien
7 篇 pan jeng-shyang
7 篇 zhang lijun
6 篇 sundaram shreyas
6 篇 neumann aneta
6 篇 wang lei
6 篇 zhang lei
6 篇 yang shengxiang

语言

3,501 篇 英文
441 篇 其他
51 篇 中文
5 篇 土耳其文
4 篇 斯洛文尼亚文
3 篇 法文
1 篇 德文
1 篇 西班牙文
1 篇 塞尔维亚文

检索条件"主题词=Optimization algorithms"

共 4003 条记录，以下是3191-3200 订阅

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

详细简洁

排序：

Aeolus: An Optimizer for Distributed Intra-Node-Parallel Streaming Systems

Aeolus: An Optimizer for Distributed Intra-Node-Parallel Str...

引用

29th IEEE International Conference on Data Engineering (ICDE)

作者： Sax, Matthias J. Castellanos, Malu Chen, Qiming Hsu, Meichun Humboldt Univ Databases & Informat Syst Grp Berlin Germany Hewlett Packard Labs Palo Alto CA USA

ISBN: (纸本)9781467349093;9781467349086

Aeolus is a prototype implementation of a topology optimizer on top of the distributed streaming system Storm. Aeolus extends Storm with a batching layer which can increase the topology's throughput by more than one order of magnitude. Furthermore, Aeolus implements an optimization algorithm that computes the optimal batch size and degree of parallelism for each node in the topology automatically. Even if Aeolus is built on top of Storm, the developed concepts are not limited to Storm and can be applied to any distributed intra-node-parallel streaming system. We propose to demo Aeolus using an interactive Web UI. One part of the Web UI is a topology builder allowing the user to interact with the system. Topologies can be created from scratch and their structure and/or parameters can be modified. Furthermore, the user is able to observe the impact of the changes on the optimization decisions and runtime behavior. Additionally, the Web UI gives a deep insight in the optimization process by visualizing it. The user can interactively step through the optimization process while the UI shows the optimizer's state, computations, and decisions. The Web UI is also able to monitor the execution of a non-optimized and optimized topology simultaneously showing the advantage of using Aeolus.

关键词： optimization Procedure storms Streaming FIRST ORDER topology Web search engines webs World Wide Web congenital web optimization algorithms Distribute parallelism Consumers

来源：评论

学校读者我要写书评

暂无评论

A Branch-and-Bound algorithm using multiple GPU-based LP solvers

A Branch-and-Bound algorithm using multiple GPU-based LP sol...

引用

20th International Conference on High Performance Computing (HiPC)

作者： Meyer, Xavier Chopard, Bastien Albuquerque, Paul Univ Geneva Dept Comp Sci Geneva Switzerland Univ Appl Sci Western Switzerland Inst Informat & Telecommun Geneva Switzerland

ISBN: (纸本)9781479907298

The Branch-and-Bound (B& B) method is a wellknown optimization algorithm for solving integer linear programming (ILP) models in the field of operations research. It is part of software often employed by businesses for finding solutions to problems such as airline scheduling problems. It operates according to a divide-and-conquer principle by building a treelike structure with nodes that represent linear programming (LP) problems. A LP solver commonly used to process the nodes is the simplex method. Nowadays its sequential implementation can be found in almost all commercial ILP solvers. In this paper, we present a hybrid CPU-GPU implementation of the B&B algorithm. The B&B tree is managed by the CPU, while the revised simplex method is mainly a GPU implementation, relying on the CUDA technology of NVIDIA. The CPU manages concurrently multiple instances of the LP solver. The principal difference with a sequential implementation of the B&B algorithm pertains to the LP solver, provided that the B&B tree is managed with the same strategy. We thus compared our GPU-based implementation of the revised simplex to a wellknown open-source sequential solver, named CLP, of the COINOR project. For given problem densities, we measured a size threshhold beyond which our GPU implementation outperformed its sequential counterpart.

关键词： Solvers Simplex method optimization algorithms central processing units Branch and bound algorithms inductive logic programming Sequential GRAPPER PICK UP Graphics Processing Unit Ganglia

来源：评论

学校读者我要写书评

暂无评论

Spatial Frequency Reuse in a Novel Generation of PMR Networks

Spatial Frequency Reuse in a Novel Generation of PMR Network...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Lamiable, Alexis Tomasik, Joanna SUPELEC Syst Sci E3S Dept Comp Sci F-91192 Gif Sur Yvette France

ISBN: (纸本)9781467359399;9781467359382

Private Mobile Radio (PMR) networks are cellular infrastructures dedicated to be used by professionals, such as public safety, military, industry and transportation organizations. In those networks, resources are scarce, and there are strong Quality of Service (QoS) requirements. The emergence of new services which need more bandwidth has made the world PMR leader focus on the LTE-Advanced protocol. In order to ensure the QoS despite resource shortage, we propose an algorithm of Resource Blocks (RBs) allocation with spatial frequency reuse whose scheme takes into account users' (UEs') interference possibility and probability. We start by defining the underlying problem, which we call Weighted Fractional Coloring Problem (WFCP), in terms of graph theory. Next, we prove its NP-hardness. As obtaining an exact solution of such a problem in reasonable time is unrealistic, we propose a heuristic algorithm. In order to evaluate the performance of our algorithm we use a rigorous validation procedure. We compare its performance with that of a random one which we propose as a reference and the exact one which can be run on very small networks. Thanks to the results obtained we believe that the proposed algorithm can establish a solid starting point to conceive its distributed versions for novel PMR protocols.

关键词： frequency reuse resource allocation optimization algorithms interference control

来源：评论

学校读者我要写书评

暂无评论

Downloading and Analysing Images from the Internet in Order to Detect Special Objects

Downloading and Analysing Images from the Internet in Order ...

引用

6th International Conference on Multimedia Communications, Services and Security (MCSS)

作者： Leszczuk, Mikolaj Piwowarczyk, Tomasz Grega, Michal AGH Univ Sci & Technol PL-30059 Krakow Poland

ISBN: (纸本)9783642385599

Along with all the positives brought by the Internet, the global network is also used for criminal purposes. The goal of the presented work was to create and optimize applications working in parallel with the search and illegal content analysis system (SWAT) created previously at the authors' university. The role of the SWAT system is to penetrate the Internet to search for images and provide links to the presented application. The presented application is able to detect various special objects, such as faces, symbols or child pornography. The use of bees algorithm-based optimization made it possible to increase the effectiveness of image analysis. With appropriate assumptions, the efficiency was increased by a factor of three times compared to the application without optimization. The efficiency of the optimization algorithm depends largely on the nature of the input data, the URL addresses.

关键词： OpenCV optimization algorithms C# Python Internet safety Web Services

来源：评论

学校读者我要写书评

暂无评论

Energy-Optimal Collaborative GPS Localization with Short Range Communication

Energy-Optimal Collaborative GPS Localization with Short Ran...

引用

11th International Symposium and Workshops on Modeling and optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt)

作者： Kwak, Jeongho Kim, Jihwan Chong, Song Korea Adv Inst Sci & Technol Dept Elect Engn Seoul South Korea

ISBN: (纸本)9781612848242

The key issue of the localization study is that how we can minimize the energy consumption of devices with guaranteeing high degree of accuracy. In this paper, we show that the collaboration among proxy devices with short range communication is helpful to energy-efficiently localize their locations in time-average sense by analyzing the device proximity including real GPS trace of students in KAIST and NCSU campuses. Next, we deliberate what is the best method for selfish mobile users to collaborate for the energy-efficient localization, and formulate an optimization problem which considers the energy efficiency and/or user fairness. However, optimizing this problem is tricky since it requires a global knowledge of sets of proxy devices and also solving a NP-hard problem to select devices which directly measure locations. This paper makes a contribution towards presenting a practical and fully distributed location sharing protocol based on competition for turning off GPS, and an optimal algorithm which controls mean waiting time used for the competition. Through the extensive simulations under several sample topologies and real mobility trace in KAIST campus, we obtain the following interesting observations: (i) (in sample topologies) our scheme achieves a near-optimal performance of proposed problem in terms of energy efficiency and fairness (up to 27.2% power saving with 35.8% higher fairness than existing heuristic algorithms), (ii) (in real mobility trace) our scheme well adapts at even unpredictably changing mobility environment (65.5% power saving than no collaboration, 27.4% or more power saving with 25% higher fairness than the existing algorithms).

关键词： short-range communication Energy efficiency Global Positioning Systems optimization algorithms Nondeterministic polynomial-time hard energy consumption Waiting time

来源：评论

学校读者我要写书评

暂无评论

A barrier function based continuous-time algorithm for linear model predictive control

A barrier function based continuous-time algorithm for linea...

引用

European Control Conference (ECC)

作者： Feller, Christian Ebenbauer, Christian Univ Stuttgart Inst Syst Theory & Automat Control D-70550 Stuttgart Germany

ISBN: (纸本)9783033039629

In this paper, we present a novel linear model predictive control (MPC) scheme that relies on a continuous-time, barrier function based algorithm which asymptotically tracks the solution of a time-varying open-loop optimal control problem. In particular, the control input is obtained as the sampled output of a continuous-time dynamical system and no iterative optimization algorithm is needed in the on-line implementation. In addition, we present a new approach towards stabilizing MPC based on gradient recentered logarithmic barrier functions that allows enlargement of the employed terminal set.

关键词： barrier function nonlinear model predictive control Predictive control optimization algorithms linear models control input Maximum Allowable Concentration Hypertrophy disorientation to time Optimal control based asymptotic

来源：评论

学校读者我要写书评

暂无评论

On Mitigating Wind Energy Variability with Storage

On Mitigating Wind Energy Variability with Storage

引用

5th International Conference on Communication Systems and Networks (COMSNETS)

作者： Arya, Vijay Dutta, Partha Kalyanaraman, Shivkumar IBM-Research India

ISBN: (纸本)9781467353304;9781467353298

Reducing fluctuations and mitigating the variability of wind energy is essential for its integration in grids, electricity markets, microgrids, and distributed generation settings. In this work, we present a storage-based wind power smoothing system that uses novel optimization algorithms to reduce the variability of wind energy. The system considers forecasted and actual energy generated, battery size, and energy prices and determines export rates that have low variability and maximize either the energy exported or revenue earned. Our optimization algorithms are novel as they model an equivalent relaxed buffer system that uses only linear constraints and allows the computation of optimal smoothing solutions in an efficient manner. This enables the system to be used in an online manner in real time as well as in planning and operations. The smoothing system and the mathematical models and programs used in optimization are presented along with preliminary simulation results that demonstrate the need and effectiveness of the system with the help of real wind energy data. Finally, we compare wind smoothing to video smoothing and point out the important similarities and differences.

关键词： Wind energy optimization algorithms smoothing buffer system REVENUE

来源：评论

学校读者我要写书评

暂无评论

Man versus Machine: a Lens Design Challenge

Man versus Machine: a Lens Design Challenge

引用

Conference on Current Developments in Lens Design and Optical Engineering XIV

作者： Dilworth, Donald C. Shafer, David Optical Systems Design Inc. (United States) David Shafer Optical Design (United States)

After a generation of writing and improving lens design software, it is time to assess where we are. Specifically, can a modern program compete with, or surpass, the best human designers? Here we describe a friendly c... 详细信息

ISBN: (纸本)9780819496911

关键词： Lens design global optimization optimization algorithms aberration theory

来源：评论

学校读者我要写书评

暂无评论

Minimization of Cloud Task Execution Length with Workload Prediction Errors

Minimization of Cloud Task Execution Length with Workload Pr...

引用

20th International Conference on High Performance Computing (HiPC)

作者： Di, Sheng Wang, Cho-Li INRIA Paris France Univ Hong Kong Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781479907298

In cloud systems, it is non-trivial to optimize task's execution performance under user's affordable budget, especially with possible workload prediction errors. Based on an optimal algorithm that can minimize cloud task's execution length with predicted workload and budget, we theoretically derive the upper bound of the task execution length by taking into account the possible workload prediction errors. With such a state-of-the-art bound, the worst-case performance of a task execution with a certain workload prediction errors is predictable. On the other hand, we build a close-to-practice cloud prototype over a real cluster environment deployed with 56 virtual machines, and evaluate our solution with different resource contention degrees. Experiments show that task execution lengths under our solution with estimates of worstcase performance are close to their theoretical ideal values, in both non-competitive situation with adequate resources and the competitive situation with a certain limited available resources. We also observe a fair treatment on the resource allocation among all tasks.

关键词： Task execution Error of prediction Workload Budgets Resource utilization CLOUDS Clouds Religious Missions optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

optimization algorithms

Optimization algorithms

引用

International Symposium on Logistics and Industrial Informatics

作者： Csiszar, Sandor Budapest Tech Kalman Kando Fac Elect Engn Inst Microelect & Technol H-1084 Budapest Hungary

ISBN: (纸本)9781424414406

Nowadays an increasing number of papers appears in the subject of combinatorial optimization proposing a great variety of heuristics and metaheuristics, most of them apply special solution to fit the particular problem type. The analysis points out the importance of the generalization but the special intelligence in the algorithm design is still very important. Although the navigation in the solution space can be realized implicitly it has a decisive role in the performance. It is important to note that the success of sophisticated methods is often reduced by their relatively bad explorative capability. The well known algorithms are compared and also the latest most successful methods based on fast and simple heuristics- are discussed.

关键词： Algorithm design Solution space optimization algorithms Heuristics navigation role performance Generalization Fasting Intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共401页 << < 316 317 318 319 320 321 322 323 324 325 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：