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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,459 篇 期刊文献
508 篇 会议
9 篇 学位论文
5 册 图书
4 篇 科技报告

馆藏范围

1,984 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

1,298 篇 工学
- 714 篇 电气工程
- 388 篇 控制科学与工程
- 354 篇 计算机科学与技术...
- 217 篇 信息与通信工程
- 146 篇 软件工程
- 116 篇 仪器科学与技术
- 68 篇 电子科学与技术（可...
- 59 篇 机械工程
- 54 篇 石油与天然气工程
- 33 篇 交通运输工程
- 20 篇 航空宇航科学与技...
- 16 篇 动力工程及工程热...
- 12 篇 力学（可授工学、理...
- 9 篇 土木工程
- 6 篇 材料科学与工程（可...
- 5 篇 测绘科学与技术
917 篇 理学
- 801 篇 数学
- 100 篇 系统科学
- 39 篇 物理学
- 31 篇 统计学（可授理学、...
- 6 篇 化学
- 6 篇 地球物理学
- 6 篇 生物学
532 篇 管理学
- 529 篇 管理科学与工程(可...
- 17 篇 工商管理
32 篇 经济学
- 25 篇 应用经济学
- 4 篇 理论经济学
32 篇 医学
- 25 篇 临床医学
- 9 篇 基础医学(可授医学...
5 篇 文学
- 4 篇 新闻传播学
2 篇 教育学
2 篇 农学
1 篇 法学

主题

1,985 篇 convex programmi...
108 篇 iterative method...
97 篇 linear programmi...
79 篇 concave programm...
78 篇 optimization
69 篇 linear matrix in...
66 篇 quadratic progra...
64 篇 optimisation
64 篇 array signal pro...
62 篇 robust control
59 篇 approximation th...
57 篇 computational co...
55 篇 optimal control
52 篇 nonlinear progra...
51 篇 stability
51 篇 control system s...
50 篇 mimo communicati...
49 篇 gradient methods
46 篇 linear systems
44 篇 wireless channel...

机构

25 篇 nanjing univ dep...
17 篇 polish acad sci ...
16 篇 hong kong baptis...
11 篇 georgia inst tec...
9 篇 univ hong kong d...
8 篇 high tech inst x...
8 篇 harbin inst tech...
7 篇 univ washington ...
7 篇 georgia inst tec...
7 篇 southern univ sc...
7 篇 xidian univ natl...
6 篇 hong kong baptis...
6 篇 nanjing normal u...
6 篇 univ florida dep...
5 篇 mcgill univ dept...
5 篇 sharif univ tech...
5 篇 technion israel ...
5 篇 univ iowa dept m...
5 篇 xidian univ sch ...
5 篇 southeast univ s...

作者

30 篇 yuan xiaoming
24 篇 kiwiel kc
20 篇 he bingsheng
11 篇 isernia tommaso
11 篇 iusem an
10 篇 lan guanghui
9 篇 han deren
9 篇 crocco lorenzo
9 篇 ma feng
9 篇 nazemi alireza
9 篇 geromel jc
8 篇 skarin v. d.
8 篇 fang sc
7 篇 tseng p
7 篇 li min
7 篇 tao min
7 篇 stefanov stefan ...
7 篇 rocca paolo
7 篇 jeyakumar v.
7 篇 giannakis georgi...

语言

1,909 篇 英文
57 篇 其他
17 篇 中文
2 篇 法文
1 篇 德文

检索条件"主题词=Convex Programming"

共 1985 条记录，以下是1891-1900 订阅

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

详细简洁

排序：

Profitable Scheduling on Multiple Speed-Scalable Processors 13

Profitable Scheduling on Multiple Speed-Scalable Processors

引用

Annual ACM Symposium on Parallel Algorithms and Architectures

作者： Peter Kling Peter Pietrzyk Heinz Nixdorf Institute & Computer Science Department University of Paderborn

ISBN: (纸本)9781450315722

We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by Chan et al. [10], which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm. In our scheduling problem, jobs arrive over time and are preemptable. They have different workloads, values, and deadlines. The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value. However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy. The cost of a schedule is the sum of lost values and invested energy. In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly. A processor's energy consumption is power P_α(s) integrated over time, where P_α(s) = s~α is the power consumption when running at speed s. Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs. This problem was introduced by Chan et al. [10] for the case of a-single processor. They presented an online algorithm which is α~α + 2eα-competitive. We provide an online algorithm for the case of multiple processors with an improved competitive ratio of α~α.

关键词： scheduling energy online algorithms primal-dual convex programming PROCESSOR convex programming jobs scheduler program Energy sources energy capacity Multiprocessor algorithms analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

High resolution SAR imagery with fully flexible prior

High resolution SAR imagery with fully flexible prior

引用

IET International Radar Conference (IET IRC 2020)

作者： Y. Xia X. Mao X. Liao C. Fang L. Yang Civil Aviation University of China Tianjin Key Laboratory for Advanced Signal Processing Tianjin China

Followed by the development of high-resolution Synthetic Aperture Radar (SAR) imagery, the statistical characteristics of the scenes or targets of interests become highly complicated and dynamically varying. It is therefore difficult to extract the elaborated features for further classification and recognition. In this paper, a fully flexible prior, named by generalized Gaussian distribution (GGD), is introduced for the feature enhancement of SAR imagery in Bayesian inference manner. Due to the flexibility of the prior model, detailed structure of the scenes or targets can be resolved in the Bayesian inference way. To accommodate for the non-conjugacy of the prior, the Bayesian inference is developed in a hierarchical manner, which guarantees closed-form solutions of the features. Considering the difficulties in solving the posterior of the target image, the variable splitting scheme of Alternating Direction Method of Multipliers (ADMM) is adopted, which is capable of separating the joint optimization into multiple sub-problems. This can simplify the computational complexity in a great extent. Finally, a proximity modified Markov Chain Monte Carlo (MCMC) sampling method is applied to solve the posterior, which ensures the computational efficiency with a satisfying level. Raw SAR data of stationary scene and moving target are used for the verification, and evaluations of Phase Transition Diagram (PTD) analysis is performed to show the superiority of the proposed algorithm.

关键词： Bayes methods Monte Carlo methods Gaussian distribution radar imaging synthetic aperture radar Markov processes sampling methods convex programming feature extraction image classification

来源：评论

学校读者我要写书评

暂无评论

Meta-Optimization

Meta-Optimization

引用

作者： Walsh,Toby, COMMONWEALTH SCIENTIFIC AND INDUSTRIAL RESEARCH ORGANIZATION CANBERRA Australia

This grant sought to investigate the use of meta-optimization in tackling broader classes of optimization problems, and solving existing optimization problems more efficiently. The research teams ultimate goal is to build solvers that learn over time, that exploit the common features found in repeated optimization problems, and that take account of the rich structure found in real world optimization. They investigated a number of approaches to improving solving using meta-optimization by a making use of a subsolver for particular class of important constraints difference logic, b adding sub-problems that reason about objective bounds more effectively, c automating a logic-based Benders approach of problem decomposition and d exploiting the online nature of many natural resource allocation problems. They also tackled a number of important scheduling problems, and redefined the state-of-the-art for each of these problems. Their results have been presented in multiple peer-reviewed archival journals throughout the project duration.

关键词： Optimization Scheduling (production) Integer programming Operations research Linear programming Applied matheatmtics convex programming Solvers

来源：评论

学校读者我要写书评

暂无评论

Phase transition of joint-sparse recovery from multiple measurements via convex optimization

Phase transition of joint-sparse recovery from multiple meas...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： S. W. Hu G. X. Lin S. H. Hsieh C. S. Lu Inst. of Inf. Sci. Taipei Taiwan

ISBN: (纸本)9781467369985

In sparse signal recovery of compressive sensing, the phase transition determines the edge, which separates successful recovery and failed recovery. Moreover, the width of phase transition determines the vague region, where sparse recovery is achieved in a probabilistic manner. Earlier works on phase transition analysis in either single measurement vector (SMV) or multiple measurement vectors (MMVs) is too strict or ideal to be satisfied in real world. Recently, phase transition analysis based on conic geometry has been found to close the gap between theoretical analysis and practical recovery result for SMV. In this paper, we explore a rigorous analysis on phase transition of MMVs. Such an extension is not intuitive at all since we need to redefine the null space and descent cone, and evaluate the statistical dimension for l_(2,1)-norm. By presenting the necessary and sufficient condition of successful recovery from MMVs, we can have a boundary on the probability that the solution of a MMVs recovery problem by convex programming is successful or not. Our theoretical analysis is verified to accurately predict the practical phase transition diagram of MMVs.

关键词： Phase transtormations combinational testing Signal restoration Theoretical analysis convex function convex programming

来源：评论

学校读者我要写书评

暂无评论

System Level Parameterizations, Constraints and Synthesis

System Level Parameterizations, Constraints and Synthesis

引用

American Control Conference

作者： Yuh-Shyang Wang Nikolai Matni John C. Doyle Department of Control and Dynamical Systems California Institute of Technology

ISBN: (纸本)9781509045839

We introduce the system level approach to controller synthesis, which is composed of three elements: System Level Parameterizations (SLPs), System Level Constraints (SLCs) and System Level Synthesis (SLS) problems. SLPs provide a novel parameterization of all internally stabilizing controllers and the system responses that they achieve. These can be combined with SLCs to provide parameterizations of constrained stabilizing controllers. We provide a catalog of useful SLCs, and show that by using SLPs with SLCs, we can parameterize the largest known class of constrained stabilizing controllers that admit a convex characterization. Finally, we formulate the SLS problem, and show that it defines the broadest known class of constrained optimal control problems that can be solved using convex programming. We end by using the system level approach to computationally explore tradeoffs in controller performance, architecture cost, robustness and synthesis/implementation complexity.

关键词： system level parameterization Controllers synthesis system response convex programming catalogs tradeoffs

来源：评论

学校读者我要写书评

暂无评论

Sensor and Actuator Placement for Large-Scale Systems: A Projection-Based Formulation

Sensor and Actuator Placement for Large-Scale Systems: A Pro...

引用

American Control Conference

作者： Nan Xue Chengzhi Yuan North Carolina State University Raleigh NC 27695 USA University of Rhode Island Kingston RI 02881 USA

ISBN: (纸本)9781538679012;9781538679265

The problem of sensor and actuator placement aims at achieving near-optimal control performance with only a small number of sensors or actuators. In this paper we present a new formulation and design for the problem of sensor and actuator placement as a structural-constrained H_2 optimization. The structural constraint is defined by two projections which indicate the placement of sensors and actuators respectively. The advantage of this formulation is that the associated structural constraint always satisfies quadratic invariance condition, and allows convex reformulation for the constrained H_2 optimization in model matching form. We provide an optimality gap between the constrained H_2 problem with selected sensors and actuators and the unconstrained H_2 problem with full feedback, and subsequently propose the minimization problem to tighten the gap. The overall computational complexity for our proposed design is shown to be O(n~3), which can be very scalable for large-scale applications. We illustrate our design with simulations of a IEEE prototype power system model.

关键词： computational complexity control system synthesis convex programming feedback interconnected systems large-scale systems minimisation optimal control optimisation sensor placement

来源：评论

学校读者我要写书评

暂无评论

Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation 11

Linearized Alternating Direction Method with Adaptive Penalt...

引用

Annual Conference on Neural Information Processing Systems

作者： Zhouchen Lin Risheng Liu Zhixun Su Visual Computing Group Microsoft Research Asia School of Mathematical Sciences Dalian University of Technology

ISBN: (纸本)9781618395993

Many machine learning and signal processing problems can be formulated as linearly constrained convex programs, which could be efficiently solved by the alternating direction method (ADM). However, usually the subproblems in ADM are easily solvable only when the linear mappings in the constraints are identities. To address this issue, we propose a linearized ADM (LADM) method by linearizing the quadratic penalty term and adding a proximal term when solving the sub-problems. For fast convergence, we also allow the penalty to change adaptively according a novel update rule. We prove the global convergence of LADM with adaptive penalty (LADMAP). As an example, we apply LADMAP to solve low-rank representation (LRR), which is an important subspace clustering technique yet suffers from high computation cost. By combining LADMAP with a skinny SVD representation technique, we are able to reduce the complexity O(n3) of the original ADM based method to O(rn2), where r and n are the rank and size of the representation matrix, respectively, hence making LRR possible for large scale applications. Numerical experiments verify that for LRR our LADMAP based methods are much faster than state-of-the-art algorithms.

关键词： penalty global convergence signal processing Self tuning convex programming

来源：评论

学校读者我要写书评

暂无评论

Energy- and Spectrum-Efficiency Tradeoff in OFDM-based Cognitive Radio Systems

Energy- and Spectrum-Efficiency Tradeoff in OFDM-based Cogni...

引用

IEEE Global Communications Conference

作者： Weijia Shi Shaowei Wang Dageng Chen School of Electronic Science & Engineering Nanjing University Communications Technology Lab Huawei Technologies Co. Ltd

ISBN: (纸本)9781479935130

In this paper, we investigate the Energy Efficiency (EE)- Spectrum Efficiency (SE) tradeoff issue in an OFDM-based cognitive radio (CR) network. A multi-objective resource allocation problem is formulated, where we try to maximize the EE and the SE simultaneously. The Pareto optimal set of the formulated problem is characterized by analyzing the relationship between the EE and the SE. To find a unique globally optimal solution, we proposed a unified EE-SE tradeoff metric, based on which the original optimization task is transformed into a single-objective problem that has a D.C. (Difference of two convex functions/sets) structure. Then an efficient barrier method is developed, where we speeds up the time-consuming computation of Newton step by exploiting the structure of the D.C. programming problem. Simulation results validate the effectiveness and efficiency of the proposed algorithm. Our general problem formulation sheds some insights on how to design an energy- and spectrum-efficient CR system.

关键词： OFDM modulation Pareto optimisation cognitive radio convex programming energy conservation radio networks radio spectrum management D.C. programming problem EE-SE tradeoff metric Newton step OFDM-based cognitive radio network Pareto optimal set convex functions structure convex sets structure energy-efficiency tradeoff multiobjective resource allocation problem single-objective problem spectrum-efficiency tradeoff convex functions Interference Measurement OFDM Pareto optimization Resource management

来源：评论

学校读者我要写书评

暂无评论

Cooperative Energy Trading in CoMP Systems Powered by Smart Grids

Cooperative Energy Trading in CoMP Systems Powered by Smart ...

引用

IEEE Global Communications Conference

作者： Jie Xu Rui Zhang ECE Department National University of Singapore

ISBN: (纸本)9781479935130

This paper studies the energy management in the coordinated multi-point (CoMP) systems powered by smart grids, where each base station (BS) with local renewable energy generation is allowed to implement the two-way energy trading with the grid. Due to the unevenly generated renewable energy over distributed BSs and the difference in the prices for buying/selling energy from/to the gird, it is in general beneficial for the cooperative BSs to jointly manage their energy trading with the grid and energy consumption in CoMP based communication for reducing the total energy cost. We consider the downlink transmission in one CoMP cluster by jointly optimizing the BSs' purchased/sold energy units from/to the grid and their cooperative transmit beamforming, so as to minimize the total energy cost subject to the given quality of service (QoS) constraints for the users. By applying techniques from convex optimization and uplink-downlink duality, we propose an efficient algorithm to solve this problem optimally. Through simulations, we show the performance gain achieved by our proposed joint energy trading and communication cooperation scheme in terms of cost reduction, as compared to a baseline scheme with the separate designs of communication cooperation and energy trading.

关键词： convex programming cooperative communication energy management systems smart power grids CoMP systems base station convex optimization cooperative energy trading cooperative transmit beamforming coordinated multipoint systems downlink transmission joint energy trading and communication cooperation scheme local renewable energy generation quality of service constraints smart grids two-way energy trading uplink-downlink duality Array signal processing Downlink Interference Quality of service Renewable energy sources Signal to noise ratio Vectors

来源：评论

学校读者我要写书评

暂无评论

Distributed Interference-Aware Energy-Efficient Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks

Distributed Interference-Aware Energy-Efficient Resource All...

引用

IEEE Global Communications Conference

作者： Zhenyu Zhou Mianxiong Dong Kaoru Ota Jun Wu Takuro Sato State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Electrical and Electronic Engineering North China Electric Power University National Institute of Information and Communications Technology Department of Information and Electric Engineering Muroran Institute of Technology School of Information Security Engineering Shanghai Jiao Tong University Graduate School of Global Information and Telecommunication Studies Waseda University

ISBN: (纸本)9781479935130

The introduction of device-to-device (D2D) into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of user equipments (UEs). In this paper, we propose a distributed interference-aware energy-efficient resource allocation algorithm to maximize each UE's energy efficiency (EE) subject to its specific quality of service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to maximize its own EE. The formulated EE maximization problem is a non-convex problem and is transformed into a convex optimization problem by exploiting the properties of the nonlinear fractional programming. An iterative optimization algorithm is proposed and verified through computer simulations.

关键词： cellular radio cochannel interference concave programming convex programming energy conservation iterative methods quality of service resource allocation D2D communication EE maximization problem QoS UE convex optimization problem device-to-device communication distributed interference-aware energy-efficient resource allocation iterative optimization algorithm nonconvex problem noncooperative game nonlinear fractional programming spectrum reuse transmission power constraint underlaying cellular network user equipment Games Interference Optimization Quality of service Receivers Resource management Transmitters

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共199页 << < 186 187 188 189 190 191 192 193 194 195 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：