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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,236 篇 期刊文献
1,750 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

3,669 篇 工学
- 2,085 篇 计算机科学与技术...
- 1,445 篇 软件工程
- 742 篇 电气工程
- 613 篇 控制科学与工程
- 333 篇 机械工程
- 327 篇 信息与通信工程
- 155 篇 动力工程及工程热...
- 149 篇 石油与天然气工程
- 129 篇 电子科学与技术（可...
- 129 篇 土木工程
- 92 篇 材料科学与工程（可...
- 89 篇 仪器科学与技术
- 75 篇 环境科学与工程（可...
- 73 篇 交通运输工程
- 69 篇 力学（可授工学、理...
- 65 篇 建筑学
- 61 篇 化学工程与技术
- 57 篇 水利工程
- 55 篇 航空宇航科学与技...
- 47 篇 生物医学工程（可授...
1,874 篇 理学
- 1,443 篇 数学
- 229 篇 系统科学
- 196 篇 物理学
- 192 篇 统计学（可授理学、...
- 68 篇 化学
- 60 篇 生物学
391 篇 管理学
- 340 篇 管理科学与工程(可...
- 72 篇 工商管理
- 48 篇 图书情报与档案管...
95 篇 医学
54 篇 经济学
- 51 篇 应用经济学
28 篇 农学
21 篇 法学
16 篇 教育学
9 篇 文学
3 篇 军事学
2 篇 艺术学

主题

4,006 篇 optimization alg...
270 篇 optimization
190 篇 algorithms
98 篇 machine learning
88 篇 design
66 篇 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...
33 篇 deep learning
32 篇 optimisation

机构

12 篇 duy tan univ ins...
10 篇 national key lab...
8 篇 amman arab univ ...
7 篇 stanford univers...
7 篇 univ technol syd...
7 篇 semnan univ dept...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 google research ...
6 篇 school of artifi...
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
12 篇 ehteram mohammad
9 篇 gandomi amir h.
9 篇 hasanipanah mahd...
9 篇 notarstefano giu...
9 篇 ishibuchi hisao
8 篇 zhan zhi-hui
8 篇 zhang jun
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 frank
6 篇 wang lei
6 篇 zhang lei
6 篇 yang shengxiang
6 篇 wei ermin

语言

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

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

共 4006 条记录，以下是3111-3120 订阅

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

详细简洁

排序：

Opportunistic sensor scheduling in wireless control systems

Opportunistic sensor scheduling in wireless control systems

引用

IEEE Annual Conference on Decision and Control

作者： Konstantinos Gatsis Miroslav Pajic Alejandro Ribeiro George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania 200 South 33rd Street Philadelphia PA 19104

ISBN: (纸本)9781467360890

We consider a wireless control system where multiple power-constrained sensors transmit plant output measurements to a controller over a shared wireless medium. A centralized scheduler, situated at the controller, grants channel access to a single sensor on each time step. Given plant and controller dynamics, we design scheduling and transmit power policies that adapt opportunistically to the random wireless channel conditions experienced by the sensors. The objective is to obtain a stable system, by minimizing the expected decrease rate of a given Lyapunov function, while respecting the sensors' power constraints. We develop an online optimization algorithm based on the random channel sequence observed during execution which converges almost surely to the optimal protocol design.

关键词： Sensors wireless remote control optimization algorithms Liapunov function stream order Controllers stabilization system wireless wireless medium wireless channels Legal Executions

来源：评论

学校读者我要写书评

暂无评论

Reverse and Forward Engineering of Frequency Control in Power Networks

Reverse and Forward Engineering of Frequency Control in Powe...

引用

IEEE Annual Conference on Decision and Control

作者： Seungil You Lijun Chen Control and Dynamical Systems California Institute of Technology Pasadena CA 91125 USA Computer Science and Telecommunications University of Colorado Boulder CO 80309 USA

ISBN: (纸本)9781467360890

We reverse-engineer the frequency dynamics with general primary frequency control and show that it is a distributed algorithm to solve a well-defined optimization problem. We further investigate the role of deadband in control, and show that if the aggregated uncontrolled load deviation is nonzero the frequencies will be synchronized, and if however it is zero the frequencies may oscillate but within the deadband. The optimization model does not only provide a way to characterize the equilibrium and establish the convergence of the frequency dynamics, but also suggests a principled way to engineer frequency control. By leveraging the optimization problem and insights from reverse engineering, we propose a distributed realtime frequency control scheme that does not only maintain the frequency to the nominal value but also achieves economic efficiency. This is drastically different from the current hierarchical control approach that addresses frequency regulation and economic efficiency at different timescales and with centralized control, and is what is needed for future power system to cope with rapid and large fluctuations in supply/demand and manage a huge number of control points. This work presents a step towards developing a new foundation - network dynamics as optimization algorithms - for distributed realtime control and optimization of future power networks.

关键词： Frequency control Power grids Economic efficiency INTEGRATED SHIP CONTROL distributed algorithms optimization algorithms Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

ROBUST NONNEGATIVE MATRIX FACTORIZATION VIA L_1 NORM REGULARIZATION BY MULTIPLICATIVE UPDATING RULES

ROBUST NONNEGATIVE MATRIX FACTORIZATION VIA L_1 NORM REGULAR...

引用

IEEE International Conference on Image Processing

作者： Bin Shen Bao-Di Liu Qifan Wang Rongrong Ji Comput. Sci. Purdue Univ. West Lafayette IN USA

ISBN: (纸本)9781479957521

Nonnegative Matrix Factorization (NMF) is a widely used technique in many applications such as face recognition, motion segmentation, etc. It approximates the nonnegative data in an original high dimensional space with a linear representation in a low dimensional space by using the product of two nonnegative matrices. In many applications data are often partially corrupted with large additive noise. When the positions of noise are known, some existing variants of NMF can be applied by treating these corrupted entries as missing values. However, the positions are often unknown in many real world applications, which prevents the usage of traditional NMF or other existing variants of NMF. This paper proposes a Robust Nonnegative Matrix Factorization (RobustNMF) algorithm that explicitly models the partial corruption as large additive noise without requiring the information of positions of noise. In particular, the proposed method jointly approximates the clean data matrix with the product of two nonnegative matrices and estimates the positions and values of outliers/noise. An efficient iterative optimization algorithm with a solid theoretical justification has been proposed to learn the desired matrix factorization. Experimental results demonstrate the advantages of the proposed algorithm.

关键词： face recognition image motion analysis iterative methods matrix decomposition additive noise high dimensional space iterative optimization algorithm linear representation low dimensional space motion segmentation multiplicative updating rules nonnegative matrix factorization Additive noise Computer vision Face Linear programming Robustness Sparse matrices Nonnegative matrix factorization l1 norm regularizer sparse noise matrix decomposition Additive noise Facial Recognition Motion segmentation image motion analysis Sparse matrix Nonnegative three-dimensional space images computer vision iterative methods linear programming optimization algorithms Face Face

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPLEXITY OF SINR OUTAGE CONSTRAINED MAX-MIN-FAIRNESS MULTICELL COORDINATED BEAMFORMING PROBLEM

ON THE COMPLEXITY OF SINR OUTAGE CONSTRAINED MAX-MIN-FAIRNES...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Wei-Chiang Li Tsung-Hui Chang Chong-Yung Chi Institute of Communications Engineering & Department of Electrical Engineering National Tsing Hua University Hsinchu Taiwan 30013 Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan 10607

ISBN: (纸本)9781479928941

Max-min-fairness (MMF), which concerns optimizing the worst signal-to-interference-plus-noise ratio (SINR) performance of receivers, is a popular transmitter design criterion in multiuser communications. In the single-input single-output (SISO), multiple-input single-output (MISO), and single-input multiple-output (SIMO) interference channels with perfect channel state information at the transmitters, it has been shown that the MMF power allocation and beamforming design problems are polynomial-time solvable, and efficient optimization algorithms exist. In this paper, we assume that the transmitters have channel distribution information only, and study the MMF coordinated beamforming design problem under probabilistic SINR outage constraints. While such a problem is non-convex, it was not clear if it is polynomial-time solvable. We propose a complexity analysis, showing that the SINR outage constrained MMF problem is polynomial-time solvable in the SISO scenario whereas it is NP-hard in the MISO scenario. The NP-hardness is established by showing that the MISO MMF problem is at least as difficult as the 3-satisfiability problem which is NP-complete.

关键词： multiple-input single-output SINR Transmitters design problems Nondeterministic polynomial-time hard optimization algorithms Polynomial time Channel state information Complexity Complexity Analysis Non-Convex Soluble

来源：评论

学校读者我要写书评

暂无评论

MATRIX RECOVERY FROM QUANTIZED AND CORRUPTED MEASUREMENTS

MATRIX RECOVERY FROM QUANTIZED AND CORRUPTED MEASUREMENTS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Andrew S. Lan Christoph Studer Richard G. Baraniuk Rice University Cornell University

ISBN: (纸本)9781479928941

This paper deals with the recovery of an unknown, low-rank matrix from quantized and (possibly) corrupted measurements of a subset of its entries. We develop statistical models and corresponding (multi-)convex optimization algorithms for quantized matrix completion (Q-MC) and quantized robust principal component analysis (Q-RPCA). In order to take into account the quantized nature of the available data, we jointly learn the underlying quantization bin boundaries and recover the low-rank matrix, while removing potential (sparse) corruptions. Experimental results on synthetic and two real-world collaborative filtering datasets demonstrate that directly operating with the quantized measurements--rather than treating them as real values--results in (often significantly) lower recovery error if the number of quantization bins is less than about 10.

关键词： rank of matrix system recovery optimization algorithms statistical models (nuclear) entry quantizer Quantization matrix SYNTHETICS available data matrices Subset

来源：评论

学校读者我要写书评

暂无评论

FAST COMPUTATION OF THE L_1-PRINCIPAL COMPONENT OF REAL-VALUED DATA

FAST COMPUTATION OF THE L_1-PRINCIPAL COMPONENT OF REAL-VALU...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Sandipan Kundu Panos P. Markopoulos Dimitris A. Pados Department of Electrical Engineering State University of New York at Buffalo NY 14260

ISBN: (纸本)9781479928941

Recently, Markopoulos et al. [1], [2] presented an optimal algorithm that computes the L_1 maximum-projection principal component of any set of N real-valued data vectors of dimension D with complexity polynomial in N, O(N~D). Still, moderate to high values of the data dimension D and/or data record size N may render the optimal algorithm unsuitable for practical implementation due to its exponential in D complexity. In this paper, we present for the first time in the literature a fast greedy single-bit-flipping conditionally optimal iterative algorithm for the computation of the L_1 principal component with complexity O(N~3). Detailed numerical studies are carried out demonstrating the effectiveness of the developed algorithm with applications to the general field of data dimensionality reduction and direction-of-arrival estimation.

关键词： optimization algorithms dimensionality reduction deuterium ABSORBED DOSE

来源：评论

学校读者我要写书评

暂无评论

Robust eigenvalue assignment for time-delay systems

Robust eigenvalue assignment for time-delay systems

引用

IEEE Annual Conference on Decision and Control

作者： Robert Schmid Thang Nguyen Department of Electrical and Electronic Engineering University of Melbourne Australia Department of Engineering University of Exeter UK

ISBN: (纸本)9781467360890

We consider the problem of robust pole assignment for a linear time invariant plant with state feedback subject to time delay in the control input. For systems with a known time delay, we offer a parametric formula for the feedback gain matrix that will assign a desired set of closed-loop eigenvalues to the time-delay system. Secondly we consider systems subject to small input time delays and introduce an unconstrained optimisation algorithm for the computation of a state feedback matrix to deliver the desired pole placement in a manner that minimises the sensitivity of the eigenvalues to input time delays. The performance of the algorithm is compared against an alternative robust pole placement method from the recent literature and found to give significantly reduced time delay sensitivity.

关键词： Delay systems pole assignment State feedback eigenvalues time delay control control input optimization algorithms information matrix

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Model Predictive Torque Control of a Load Commutated Inverter and Synchronous Machine

Nonlinear Model Predictive Torque Control of a Load Commutat...

引用

International Power Electronics Conference

作者： Stefan Almer Thomas Besselmann Joachim Ferreau ABB Corporate Research

ISBN: (纸本)9781479927067

The paper at hand considers the design of a controller for torque regulation of a variable speed synchronous machine fed by a line commutated rectifier and a load commutated inverter. The control approach is model predictive control where a constrained optimal control problem is solved to minimize the deviation of the torque from its reference. The dynamic model of the converters and drive is nonlinear and considers both the rectifier and inverter firing angles as control input. Controlling both firing angles simultaneously, as opposed to in a cascaded manner, implies improved potential for dynamic performance and disturbance rejection. In particular, the controller handles voltage dips on the line better than a conventional PI controller. The nonlinear MPC solution is implemented through on-line optimization. The optimization algorithm has been implemented on an embedded system and has been shown to execute sufficiently fast for the targeted control frequency.

关键词： Torque control synchronous machines Inventors Frequency control Rectifiers voltage sags LOAD Embedded systems Torque Disturbance rejection Controllers dynamic characteristics Converters optimization algorithms Nonlinear Models

来源：评论

学校读者我要写书评

暂无评论

Arbitrary pole placement with the extended Kautsky-Nichols-van Dooren parametric form with minimum gain

Arbitrary pole placement with the extended Kautsky-Nichols-v...

引用

American Control Conference

作者： Robert Schmid Thang Nguyen Lorenzo Ntogramatzidis Department of Electrical and Electronic Engineering University of Melbourne Australia Department of Engineering University of Exeter UK Department of Mathematics and Statistics Curtin University Australia

ISBN: (纸本)9781479932757

We consider the classic problem of pole placement by state feedback. We revisit the well-known eigenstructure assignment algorithm of Kautsky, Nichols and van Dooren [1] and extend it to obtain a novel parametric form for the pole-placing feedback matrix that can deliver any set of desired closed-loop eigenvalues, with any desired multiplicities. This parametric formula is then employed to introduce an unconstrained nonlinear optimisation algorithm to obtain a feedback matrix that delivers the desired pole placement with minimum gain.

关键词： pole assignment Parametric optimization algorithms State feedback Gain

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task Allocation in Asynchronous Shared Memory 14

Dynamic Task Allocation in Asynchronous Shared Memory

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Dan Alistarh James Aspnes Michael A. Bender Rati Gelashvili Seth Gilbert MIT Yale tony Brook University & Tokutek NUS

ISBN: (纸本)9781611973389

Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation, and we prove that our solution is optimal within logarithmic factors. The main algorithmic idea is a randomized concurrent data structure called a dynamic to-do tree, which allows processes to pick new tasks to perform at random from the set of available tasks, and to insert tasks at random empty locations in the data structure. Our analysis shows that these properties avoid duplicating work unnecessarily. On the other hand, since the adversary controls the input as well the scheduling, it can induce executions where lots of processes contend for a few available tasks, which is inefficient. However, we prove that every algorithm has the same problem: given an arbitrary input, if OPT is the worst-case complexity of the optimal algorithm on that input, then the expected work complexity of our algorithm on the same input is O(OPT log~3m), where m is an upper bound on the number of tasks that are present in the system at any given time.

关键词： task allocation Religious Missions Asynchronous solidification optimization algorithms SUCO gene Optimized production technology shared memory Legal Executions Data structures algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共401页 << < 308 309 310 311 312 313 314 315 316 317 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：