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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是261-270 订阅

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

详细简洁

排序：

Optimized Solutions for Beamforming Problems in Amplify-Forward Wireless Relay Networks

Optimized Solutions for Beamforming Problems in Amplify-Forw...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Phan, A. H. Tuan, H. D. Kha, H. H. Univ New South Wales Sch EET Sydney NSW 2052 Australia Univ Technol Sch Informat Technol & Engn Sydney NSW Australia

ISBN: (纸本)9781424492688

Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvex quadratically constrained quadratic programming (QCQP) problems which is very difficult to solve directly. Generally, by transforming a QCQP problem into a semi-definite program (SDP) and by relaxing rank-one constraints, the problem can be tackled essentially. If resulting matrices found after solving SDP problems are of rank-one then the task can be terminated. However, in some scenarios such as minimizing individual power constraints on relays, most of the rank-one dropped SDP solutions have rank higher than one. In this case, a nonsmooth reverse convex optimization technique is employed to solve the problem iteratively then rank-one solutions can be optimized numerically.

关键词： Array signal processing Interference Optimization Receivers Relays Vectors Wireless communication amplify and forward communication amplify-forward wireless relay networks beamforming problem concave programming convex programming nonconvex quadratically constrained quadratic programming problem nonsmooth reverse convex optimization power constraint quadratic programming radio networks semidefinite program

来源：评论

学校读者我要写书评

暂无评论

On Convergence Constraint Precoder Design for Iterative Frequency Domain Multiuser SISO Detector

On Convergence Constraint Precoder Design for Iterative Freq...

引用

46th Asilomar Conference on Signals, Systems and Computers

作者： Tervo, Valtteri Tolli, A. Karjalainen, J. Matsumoto, Tad Univ Oulu Ctr Wireless Commun POB 4500 Oulu 90014 Finland Japan Adv Inst Sci & Technol Ishikawa 923 Japan Renesas Mobile Europe Oy Oulu 90590 Finland

ISBN: (纸本)9781467350518

Convergence constraint power allocation (CCPA) in single carrier multiuser (MU) single-input single-output (SISO) systems with iterative frequency-domain (FD) soft cancelation (SC) minimum mean-squared error (MMSE) equalization is considered in this paper. In order to exploit full benefit of iterative receiver, convergence properties need to be considered. The proposed scheme can guarantee that the desired mutual information point/value after sufficient amount of iterations is achieved. In this paper, successive convex approximation algorithm is proposed as a solving the non-convex convergence constraint power minimization problem. Furthermore, the results of EXIT-chart analysis demonstrate that the CCPA design can achieve the objectives described above.

关键词： 3G mobile communication Long Term Evolution concave programming convergence of numerical methods convex programming frequency division multiple access iterative methods mean square error methods multiuser detection radio receivers

来源：评论

学校读者我要写书评

暂无评论

A Convex Relaxation of a Dimension Reduction Problem Using the Nuclear Norm

A Convex Relaxation of a Dimension Reduction Problem Using t...

引用

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

作者： Lyzell, Christian Andersen, Martin Enqvist, Martin Linkoping Univ Dept Elect Engn Div Automat Control S-58183 Linkoping Sweden

ISBN: (纸本)9781467320665

The estimation of nonlinear models can be a challenging problem, in particular when the number of available data points is small or when the dimension of the regressor space is high. To meet these challenges, several dimension reduction methods have been proposed in the literature, where a majority of the methods are based on the framework of inverse regression. This allows for the use of standard tools when analyzing the statistical properties of an approach and often enables computationally efficient implementations. The main limitation of the inverse regression approach to dimension reduction is the dependence on a design criterion which restricts the possible distributions of the regressors. This limitation can be avoided by using a forward approach, which will be the topic of this paper. One drawback with the forward approach to dimension reduction is the need to solve nonconvex optimization problems. In this paper, a reformulation of a well established dimension reduction method is presented, which reveals the structure of the optimization problem, and a convex relaxation is derived.

关键词： concave programming nonlinear estimation regression analysis

来源：评论

学校读者我要写书评

暂无评论

Convex Optimization for Precoder Design in MIMO Interference Networks

Convex Optimization for Precoder Design in MIMO Interference...

引用

50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Zhao, Yue Diggavi, Suhas N. Goldsmith, Andrea Poor, H. Vincent Stanford Univ Dept Elect Engn Stanford CA 94305 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA Princeton Univ Dept Elect Engn Princeton NJ 08540 USA

ISBN: (纸本)9781467345392;9781467345378

Optimal precoder design for weighted sum-rate maximization in multiple-input multiple-output interference networks is studied. For this well known non-convex optimization problem, convex approximations based on interference alignment are developed, for both single-beam and multi-beam cases. Precoder design methods that consist of two phases, an interference alignment phase and a post-alignment optimization phase, are proposed. The interference alignment solution is taken as the input to the post-alignment optimization phase. For post-alignment weighted sum-rate maximization, novel iterative distributed algorithms are proposed based on the developed convex approximations. Simulation results show that the proposed algorithms achieve promising weighted sum-rate gains over existing interference alignment algorithms. Interestingly, for the multi-beam case, significant gain is achieved at all SNRs, including the high SNR regime.

关键词： MIMO communication approximation theory concave programming convex programming distributed algorithms iterative decoding phase coding precoding radiofrequency interference

来源：评论

学校读者我要写书评

暂无评论

Optimal SNR-based Coverage in Poisson Cellular Networks with Power Density Constraints

Optimal SNR-based Coverage in Poisson Cellular Networks with...

引用

Australian Communications Theory Workshop (AusCTW)

作者： Samarasinghe, Tharaka Inaltekin, Hazer Evans, Jamie S. Monash Univ Dept Elect & Comp Syst Engn Clayton Vic 3800 Australia

ISBN: (纸本)9781467346757;9781467346733

This paper studies the coverage maximization for wireless networks in which base station (BS) locations are drawn from a homogenous spatial Poisson point process, and user locations are arbitrary. A user is covered for communication if its received signal-to-noise-ratio (SNR) is above a given threshold value, and the objective is to maximize the coverage probability under per unit area power density constraints. The resulting optimization problem is solved analytically by making use of the underlying concavity in the objective function when transmissions are impaired only by a power-law bounded path loss. Our results show that the optimal transmit power per BS is independent of the power density constraint, and the solution to the optimization problem represents the Pareto optimal boundary between the power density constraint and the coverage probability. Then, these results are extended to a system in which transmissions are impaired by both path loss and fading. The resulting optimization problem with fading turns out to be a non-convex optimization problem. In this case, we provide tight upper bounds on the optimal coverage probability. The paper also discusses the importance of using bounded path loss models for coverage maximization problems in wireless networks, and shows that an unbounded model will lead to trivial solutions.

关键词： Pareto optimisation cellular radio concave programming probability stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Towards a Fair Non-convex Resource Allocation in Wireless Networks

Towards a Fair Non-convex Resource Allocation in Wireless Ne...

引用

22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Tychogiorgos, G. Gkelias, A. Leung, K. K. Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

ISBN: (纸本)9781457713484

This paper presents a non-convex optimization framework for the Network Utility Maximization problem in Wireless Networks, which incorporates the interference among links and introduces a power penalty term in the objective function to assure both convergence and energy efficiency of the method. Moreover, a distributed gradient based algorithm is proposed that converges to the optimal solution for problems with zero duality gap and a fair-allocation heuristic is presented to resolve user oscillations when they occur. Finally, numerical results regarding the performance of the heuristic and the distributed approach are presented.

关键词： Convergence Distributed algorithms Optimization Oscillators Resource management Vectors Wireless communication concave programming convergence distributed gradient based algorithm energy conservation energy efficiency fair nonconvex resource allocation fair-allocation heuristic gradient methods network utility maximization problem nonconvex optimization framework objective function power penalty term radio networks resource allocation wireless networks zero duality gap

来源：评论

学校读者我要写书评

暂无评论

A Sub-optimal Threshold-Based Power Allocation Scheme for Joint Transmission in HetNet

A Sub-optimal Threshold-Based Power Allocation Scheme for Jo...

引用

IEEE 78th Vehicular Technology Conference (VTC Fall)

作者： Xu, Yujie Zhou, Wen'an Liang, Te Ren, Xiaotao Beijing Univ Posts & Telecommun ICN&SEC Ctr Beijing Peoples R China HUAWEI Technol Co Ltd Res Dept Wireless Networks Beijing Peoples R China

ISBN: (纸本)9781467361873

We study the power allocation of Marco eNodeB (MeNB) for joint transmission in Range Expanding region of HetNet. We formulate the optimization problem of maximizing HetNet throughput. The original problem turns out to be a non-convex problem. To achieve high system throughput and reduce the complexity, we put forward a sub-optimal power allocation scheme, i.e., Threshold-Based Power Allocation (TBPA) scheme. In TBPA scheme, we analyze the optimal subcarrier assignment and then set a basic power threshold for MeNB. Based on the threshold, subcarriers are selected to allocate power. We mathematically prove the original non-convex problem is turned into a quasi-convex problem. We evaluate TBPA scheme and other interference coordination schemes under different parameters. The simulation results show that compared to the conventional interference coordination schemes, TBPA scheme can improve the system throughput by a large margin with limited complexity.

关键词： Internet computational complexity concave programming convex programming mobile computing radiofrequency interference

来源：评论

学校读者我要写书评

暂无评论

Incentive Design for Efficient Building Quality of Service

Incentive Design for Efficient Building Quality of Service

引用

50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Aswani, Anil Tomlin, Claire Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781467345392;9781467345378

Buildings are a large consumer of energy, and reducing their energy usage may provide financial and societal benefits. One challenge in achieving efficient building operation is the fact that few financial motivations exist for encouraging low energy configuration and operation of buildings. As a result, incentive schemes for managers of large buildings are being proposed for the purpose of saving energy. This paper focuses on incentive design for the configuration and operation of building-wide heating, ventilation, and air-conditioning (HVAC) systems, because these systems constitute the largest portion of energy usage in most buildings. We begin with an empirical model of a building-wide HVAC system, which describes the tradeoffs between energy consumption, quality of service (as defined by occupant satisfaction), and the amount of work required for maintenance and configuration. The model has significant non-convexities, and so we derive some results regarding qualitative properties of non-convex optimization problems with certain partial-ordering features. These results are used to show that "baselining" incentive schemes suffer from moral hazard problems, and they also encourage energy reductions at the expense of also decreasing occupant satisfaction. We propose an alternative incentive scheme that has the interpretation of a performance-based bonus. A theoretical analysis shows that this encourages energy and monetary savings and modest gains in occupant satisfaction and quality of service, which is confirmed by our numerical simulations.

关键词： HVAC buildings (structures) concave programming design engineering energy conservation energy consumption hazards incentive schemes

来源：评论

学校读者我要写书评

暂无评论

Power Control for Constrained Throughput Maximization in Spectrum Shared Networks

Power Control for Constrained Throughput Maximization in Spe...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Tadrous, John Sultan, Ahmed Nafie, Mohammed El-Keyi, Amr Nile Univ WINC Cairo Egypt

ISBN: (纸本)9781424456383

We investigate power allocation for users in a shared spectrum network. In such a network, the primary (licensed) users communicate under a minimum guaranteed quality of service (QoS) requirements, whereas the secondary users opportunistically access the primary band. Our objective is to find a power control scheme that determines the transmit power for both primary and secondary users so that the overall network throughput is maximized while maintaining the quality of service of the primary users greater than a specified minimum limit. In the assumed model, no interference cancellation is done at the receivers resulting in a non-convex optimization problem. It has been shown previously that binary power control almost always achieves the global optimum solution when no QoS constraints are imposed. This is not necessarily the case in our scenario, however. We introduce a distributed algorithm for "ternary" power allocation to be used when individual measurements are available at each node. We show via simulations the relative efficiency of the proposed algorithm compared to previously suggested ones. If a central controller exists with available information about the system parameters, we enhance the performance of the proposed algorithm through an iterative geometric programming (GP) algorithm and prove its convergence to a better solution than ternary power allocation.

关键词： QoS constraints cognitive radio concave programming constrained throughput maximization distributed algorithm distributed algorithms geometric programming interference cancellation iterative geometric programming algorithm nonconvex optimization problem p

来源：评论

学校读者我要写书评

暂无评论

Capacity of Compound MIMO Gaussian Channels with Additive Uncertainty

Capacity of Compound MIMO Gaussian Channels with Additive Un...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Sun, Yin Koksal, C. Emre Shroff, Ness B. Ohio State Univ Dept ECE Columbus OH 43210 USA

ISBN: (纸本)9781479904464

This paper considers reliable communications over a multiple-input multiple-output (MIMO) Gaussian channel, where the channel matrix is within a bounded channel uncertainty region around a nominal channel matrix, i.e., an instance of the compound MIMO Gaussian channel. We study the optimal transmit covariance design to achieve the capacity of compound MIMO Gaussian channels, where the channel uncertainty region is characterized by the spectral norm. This design problem is a challenging non-convex optimization problem. However, in this paper, we reveal that this design problem has a hidden convexity property, and hence it can be simplified as a convex optimization problem. Towards this goal, we first prove that the optimal transmit design is to diagonalize the nominal channel, and then show that the duality gap between the capacity of the compound MIMO Gaussian channel and the minimal channel capacity is zero, which proves the conjecture of Loyka and Charalambous (IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2048-2063, 2012). The key tools for showing these results are a novel matrix determinant inequality and some unitarily invariant properties.

关键词： Gaussian channels MIMO communication concave programming convex programming determinants matrix algebra telecommunication network reliability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：