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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

192 篇 期刊文献
119 篇 会议

馆藏范围

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

日期分布

学科分类号

291 篇 工学
- 244 篇 电气工程
- 83 篇 信息与通信工程
- 54 篇 计算机科学与技术...
- 38 篇 控制科学与工程
- 17 篇 电子科学与技术（可...
- 16 篇 仪器科学与技术
- 13 篇 石油与天然气工程
- 10 篇 交通运输工程
- 7 篇 机械工程
- 7 篇 软件工程
- 2 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 公安技术
33 篇 理学
- 23 篇 数学
- 8 篇 系统科学
- 2 篇 物理学
- 1 篇 统计学（可授理学、...
19 篇 管理学
- 19 篇 管理科学与工程(可...
5 篇 医学
- 5 篇 临床医学
1 篇 文学
- 1 篇 新闻传播学

主题

311 篇 concave programm...
80 篇 convex programmi...
57 篇 iterative method...
39 篇 array signal pro...
34 篇 nonlinear progra...
33 篇 mimo communicati...
33 篇 resource allocat...
31 篇 nonconvex proble...
31 篇 relay networks (...
30 篇 wireless channel...
29 篇 radiofrequency i...
29 篇 minimisation
28 篇 integer programm...
25 篇 computational co...
24 篇 telecommunicatio...
24 篇 cognitive radio
23 篇 approximation th...
23 篇 nonconvex optimi...
22 篇 probability
21 篇 optimization

机构

6 篇 xidian univ natl...
4 篇 univ manchester ...
4 篇 univ british col...
4 篇 shiraz univ tech...
3 篇 pla univ sci & t...
3 篇 shanghai jiao to...
3 篇 ohio state univ ...
3 篇 southeast univ n...
3 篇 caltech div engn...
3 篇 guangdong univ t...
3 篇 tsinghua univ de...
3 篇 indian inst tech...
3 篇 southeast univ s...
2 篇 nanjing univ pos...
2 篇 xidian univ natl...
2 篇 islamic azad uni...
2 篇 guangdong univ t...
2 篇 nanjing univ pos...
2 篇 texas tech univ ...
2 篇 univ oviedo dept...

作者

6 篇 schober robert
4 篇 tuan h. d.
3 篇 hamdi khairi a.
3 篇 baidas mohammed ...
3 篇 alsusa emad
3 篇 singh vindheshwa...
3 篇 rinaldi f.
3 篇 ng derrick wing ...
3 篇 ling bingo wing-...
2 篇 tadrous john
2 篇 soleimanpour-mog...
2 篇 tasis c.
2 篇 wu yuan
2 篇 ruiz m. m.
2 篇 aghaei jamshid
2 篇 niknam taher
2 篇 gitizadeh mohsen
2 篇 qiu jing
2 篇 liu chen
2 篇 sciandrone m.

语言

308 篇 英文
2 篇 中文
1 篇 其他

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

共 311 条记录，以下是231-240 订阅

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

详细简洁

排序：

Time-Optimal Path Following for Robots with Object Collision Avoidance using Lagrangian Duality

Time-Optimal Path Following for Robots with Object Collision...

引用

9th International Workshop on Robot Motion and Control (RoMoCo)

作者： Debrouwere, Frederik Van Loock, Wannes Pipeleers, Goele Diehl, Moritz De Schutter, Joris Swevers, Jan Katholieke Univ Leuven Dept Mech Engn Div PMA BE-3001 Heverlee Belgium Katholieke Univ Leuven Dept Elect Engn Div SCD BE-3001 Heverlee Belgium

ISBN: (纸本)9781467355100;9781467355117

Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time while respecting system constraints. This paper focusses on time-optimal path following problems in robotics where collision must be avoided with other robots or moving obstacles. The developed method is based on the convex reformulation of the time-optimal path following problem with simplified dynamics presented in [1]. The robot and the obstacles are modelled as unions of convex polyhedra and the collision avoidance constraints are derived using Lagrangian duality. These constraints render the optimization problem non-convex. However, numerical simulations show that the resulting non-convex optimization problem can still be solved efficiently using a non-linear solver, due to the time-optimal path following formulation [1] and the proposed formulation of the collision avoidance constraints.

关键词： collision avoidance concave programming mobile robots nonlinear programming numerical analysis time optimal control

来源：评论

学校读者我要写书评

暂无评论

Improved cardinality bounds on the auxiliary random variables in Marton's inner bound

Improved cardinality bounds on the auxiliary random variable...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Anantharam, Venkat Gohari, Amin Nair, Chandra Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA Sharif Univ Technol Informat Syst & Secur Lab Tehran Iran Chinese Univ Hong Kong Dept Informat Engn Sha Tin NT Peoples R China

ISBN: (纸本)9781479904464

Marton's region is the best known inner bound for a general discrete memoryless broadcast channel. We establish improved bounds on the cardinalities of the auxiliary random variables. We combine the perturbation technique along with a representation using concave envelopes to achieve this improvement. As a corollary of this result, we show that a randomized time division strategy achieves the entire Marton's region for binary input broadcast channels, extending the previously known result for the sum-rate and validating a previous conjecture due to the same authors.

关键词： broadcast channels concave programming perturbation techniques set theory

来源：评论

学校读者我要写书评

暂无评论

Inverse Source for Radiating Element Positioning in Antenna Synthesis

Inverse Source for Radiating Element Positioning in Antenna ...

引用

2010 IEEE International Symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Araque, Javier L. Vecchi, Giuseppe Politecn Torino I-10129 Turin Italy

ISBN: (纸本)9781424449682

The most critical issue in antenna synthesis is the spatial localization of the antenna constituent elements; for arrays, this translates into the problem of sparse array synthesis or array thinning, and for shaped reflector synthesis it is the very determination of the reflecting surface. In fact, absence of knowledge of the precise location of the (actual or equivalent) sources of the field typically leads to non-convex optimization problems.

关键词： antenna arrays antenna synthesis array thinning concave programming inverse source nonconvex optimization radiating element positioning sparse array synthesis spatial localization

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Downlink Transmission in Multi-Cell Coordinated Beamforming Systems

Energy-Efficient Downlink Transmission in Multi-Cell Coordin...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Wang, Xiaoming Zhu, Pengcheng Sheng, Bin You, Xiaohu Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781467359399;9781467359382

Coordinated multipoint has been widely introduced to enhance the capacity, especially that of users at cell edge. Recently energy efficient transmission techniques are increasingly important due to the increase of energy consumption in wireless communication systems. In this paper, an energy efficient cooperative transmission algorithm using coordinated beamforming is proposed for multi-cell MIMO networks. We formulate the problem as a non-convex optimization problem in a fractional form. Then we transform the problem into an equivalent form and propose an iterative algorithm to solve it. In each iteration, a simplified zero-forcing coordinated beamforming using beam tracing and an optimal power allocation algorithm for maximizing energy efficiency are derived. Simulation results demonstrate that the proposed algorithm has a better energy efficiency performance than the traditional capacity maximizing method. With the lower complexity, the proposed method using beam tracing approaches the energy efficiency performance of the subspace decomposition method in slowly varying channels.

关键词： MIMO communication array signal processing cellular radio concave programming cooperative communication iterative methods

来源：评论

学校读者我要写书评

暂无评论

Outage Minimization in Fading Channels: Optimal Power Allocation with Channel Distribution Information Known at Transmitter

Outage Minimization in Fading Channels: Optimal Power Alloca...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Huang, Chuan Zhang, Rui Cui, Shuguang Texas A&M Univ Dept ECE College Stn TX 77843 USA

ISBN: (纸本)9781467309219;9781467309202

This paper revisits the optimal power allocation for outage minimization in the classic point-to-point fading channels with the channel distribution information (CDI) known at the transmitter. The channel state information (CSI) is assumed to be perfectly known at the receiver, but not available at the transmitter. In particular, we consider a finite horizon of N-block transmissions subject to an average power constraint at the transmitter. Although minimizing the time-averaged per-block outage probability over each N-block transmission is shown to be a non-convex problem for a large class of practical fading channels, we show that the globally optimal power allocation is obtainable by a simple one-dimensional search. It is shown that if the average transmit power is above a certain threshold determined by the distribution of the fading channel and the target transmission rate, the uniform power allocation is optimal;otherwise, an on-off power allocation is optimal. Moreover, a suboptimal low-complexity power allocation scheme is proposed, which is shown to be asymptotically optimal as N goes to infinity. Finally, numerical results are provided to validate our analysis.

关键词： concave programming fading channels minimisation probability radio receivers radio transmitters

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Two-way AF Relay System with Multiple-antennas

Energy Efficient Two-way AF Relay System with Multiple-anten...

引用

IEEE 74th Vehicular Technology Conference (VTC)

作者： Kim, Hongjoon Lee, Namjeong Kang, Joonhyuk Korea Adv Inst Sci & Technol KAIST Taejon South Korea

ISBN: (纸本)9781424483273

In this paper, we study an energy efficient two-way amplify-and-forward (AF) relay network equipped with multiple antennas at both sources and relay. To minimize the transmit power while satisfying quality of service (QoS) of both sources, transmit beamformers and receive combiners are designed with ZF-based relay processing matrix. Due to the non-convexity of the optimization problem, the original problem is decomposed into two simpler optimization problems which can be solved through iteration algorithm. As an alternative, eigen-beamforming based technique is also provided to reduce the complexity of the iterative solution at the expense of the power usage. Numerical results show that the proposed solution efficiently reduces the additional power usage of the system compared to the eigen-beamforming based technique while meeting the QoS constraint of each source. Moreover, we can see the proposed algorithm converges to the steady-state value in a reasonable number of iterations.

关键词： Array signal processing Minimization Optimization QoS constraint Quality of service Relays Transceivers Vectors amplify and forward communication amplify-and-forward relay network antennas concave programming eigenbeamforming based technique eigenvalues a

来源：评论

学校读者我要写书评

暂无评论

Linear MMSE Precoding and Equalization for Network MIMO with Partial Cooperation

Linear MMSE Precoding and Equalization for Network MIMO with...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Kaviani, Saeed Simeone, Osvaldo Krzymien, Witold A. Shamai (Shitz), Shlomo Univ Alberta TRLabs Edmonton AB Canada New Jersey Inst Technol CWCSPR Newark NJ 07102 USA Technion Israel Inst Technol Dept Elect Engn Haifa Israel

ISBN: (纸本)9781424492688

A cellular multiple-input multiple-output (MIMO) downlink system is studied in which each base station (BS) transmits to some of the users, so that each user receives its intended signal from a subset of the BSs. This scenario is referred to as network MIMO with partial cooperation, since only a subset of the BSs are able to coordinate their transmission towards any user. The focus of this paper is on the optimization of linear beamforming strategies at the BSs and at the users for network MIMO with partial cooperation. Individual power constraints at the BSs are enforced. It is first shown that the system is equivalent to a MIMO interference channel with generalized linear constraints (MIMO-IFC-GC). The problem of minimizing the weighted sum mean square error (WSMSE) of the data estimates is non-convex, and suboptimal solutions with reasonable complexity need to be devised. Novel designs that aim at minimizing the WSMSE are then proposed. Extensive numerical simulations are provided to compare the performance of the considered schemes for realistic cellular systems.

关键词： Interference channels MIMO MIMO communication MIMO interference channel MMSE equalization Optimization Receiving antennas Transmitters base station cellular multiple input multiple output downlink system cellular radio cellular system concave programming cooperative communication equalisers generalized linear constraints interference (signal) least mean squares methods linear MMSE precoding linear beamforming strategy network MIMO nonconvex problem partial cooperation power constraints precoding radiofrequency interference weighted sum mean square error

来源：评论

学校读者我要写书评

暂无评论

Fast Inference for Situational Awareness in 5G Millimeter Wave Massive MIMO Systems 20

Fast Inference for Situational Awareness in 5G Millimeter Wa...

引用

20th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Mendrzik, Rico Meyer, Florian Bauch, Gerhard Win, Moe MIT Wireless Informat & Network Sci Lab Cambridge MA 02139 USA Hamburg Univ Technol Inst Commun Hamburg Germany

ISBN: (纸本)9781538665282

Situational awareness in wireless networks refers to the availability of information on node locations and their environments. Fifth generation millimeter wave multiple-input multiple-output communication systems have the potential to jointly estimate the position, orientation, and clock offset of user equipments together with the positions of reflecting or scattering objects in their propagation environments. However, even in a static setting, the corresponding maximum a posteriori estimation problem is nonlinear and non-convex, and thus very difficult to solve in moderate computation time. We present an augmented version of the optimization problem underlying maximum a posteriori estimation, where geometric constraints are introduced to limit the size of the search space considerably. The constrained problem is then solved using a conventional interior point optimization method. Numerical results show that our approach has a very low computational complexity and that it can typically reach the Cramer-Rao lower bound.

关键词： 5G mobile communication computational complexity concave programming maximum likelihood estimation millimetre wave communication millimetre wave propagation MIMO communication nonlinear programming Millimeter wave propagation situational awareness MIMO communication complexity classes Nonlinear programming maximum likelihood estimation multiple input multiple output systems Maximum a posteriori estimation Awareness millimeter wave computational time clock skew COMMUNICATION SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

Coordinated Downlink Beamforming in Multicell Wireless Network 5

Coordinated Downlink Beamforming in Multicell Wireless Netwo...

引用

5th IEEE International Conference on Communications and Electronics (ICCE)

作者： Tam, H. H. M. Tuan, H. D. Che, E. Univ Technol Sydney Fac Engn & Informat Technol Broadway NSW 2007 Australia

ISBN: (纸本)9781479950515

We consider the joint design of downlink beamforming vectors in a multicell multi-antenna wireless network to maximise the network sum rate subject to base station power and quality-of-service (QoS) constraints. It is shown that the problem is reformulated by a concave program, for which an efficient iterative procedure of low complexity is then developed. Index terms: Multicell multi-antenna networks, coordinated beamforming, sum rate maximisation, concave programming

关键词： concave programming coordinated beamforming Multicell multi-antenna networks sum rate maximisation

来源：评论

学校读者我要写书评

暂无评论

Semidefinite Relaxations of Chance Constrained Algebraic Problems

Semidefinite Relaxations of Chance Constrained Algebraic Pro...

引用

51st IEEE Annual Conference on Decision and Control (CDC)

作者： Jasour, A. M. Lagoa, C. Penn State Univ Dept Elect Engn University Pk PA 16802 USA Penn State Univ Fac Elect Engn University Pk PA 16802 USA

ISBN: (纸本)9781467320665

In this paper, we present preliminary results on a general approach to chance constrained algebraic problems. In this type of problems, one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally complex. With the objective of developing systematic numerical procedures to solve such problems, a sequence of convex relaxations is provided, whose optimal value is shown to converge to solution of the original problem. In other words, we provide a sequence of semidefinite programs of increasing dimension and complexity which can arbitrarily approximate the solution of the probability maximization problem. Two numerical examples are presented to illustrate preliminary results on the numerical performance of the proposed approach.

关键词： algebra concave programming statistical analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：