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

iterative power control based admission control for wireless networks

WIRELESS NETWORKS 2016年第2期22卷 619-633页

作者： Narendran, K. Karthik, R. M. Sivalingam, Krishna M. Ctr Excellence Wireless Technol Madras 600113 Tamil Nadu India Samsung India Software Operat Bengaluru India Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India India UK Adv Technol Ctr Excellence Next Generat Madras Tamil Nadu India

This paper studies transmission power control algorithms for cellular networks. One of the challenges in commonly used iterative mechanisms to achieve this is to identify if the iteration will converge since convergence indicates feasibility of transmit power allocation under prevailing network conditions. The convergence criterion should also be simple to calculate given the time constraints in a real-time wireless network. Towards this goal, this paper derives simple sufficient conditions for convergence of an iterative power control algorithm using existing bounds from matrix theory. With the help of suitable numerical examples, it is shown that the allocated transmit powers of the nodes converge when sufficient conditions are satisfied, and diverge when they are not satisfied. This forms the basis for an efficient link data-rate based admission control mechanism for wireless networks. The mechanism considers parameters such as signal strength requirement, link datarate requirement, and number of nodes in the system. Simulation based analysis shows that existing links are able to maintain their desired datarates despite the addition of new wireless links.

关键词： Power control Admission control iterative algorithm Convergence of iterative algorithm Wireless networks

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications

引用

THEORETICAL COMPUTER SCIENCE 2016年第PartB期656卷 188-214页

作者： Zohora, Fatema Tuz Rahman, M. Sohel Bangladesh Univ Engn & Technol Dept CSE AlEDA Grp Dhaka 1000 Bangladesh

In this paper, an algorithm is proposed that detects the existence of common ancestor gene sequences for non-overlapping inversion (reversed complement) metric given two input DNA sequences. Theoretical worst case running time complexity of the algorithm is proven to be O (n(4)), where n is the length of each input sequence. However, by experiment, the running time complexity is found to be O (n(3)) for the worst case and O (n(2)) for average case. Moreover, the worst case occurs when both input sequences have the similarity of around 90% which is very rare. This work is motivated by the purpose of diagnosing an unknown genetic disease that shows allelic heterogeneity, a case where a normal gene mutates in different orders resulting in two different gene sequences causing two different genetic diseases. Our algorithm can potentially save huge energy and cost of the existing diagnostic approaches. The algorithm can be useful as well in the study of breed-related hereditary conditions to determine the genetic spread of a defective gene in the population. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Consensus string Inversion Genetic disease Allelic heterogeneity iterative algorithm Matrix

来源：评论

学校读者我要写书评

暂无评论

Photovoltaic systems in low-voltage networks and overvoltage correction with reactive power control

引用

IET RENEWABLE POWER GENERATION 2016年第3期10卷 410-417页

作者： Pompodakis, Evangelos E. Drougakis, Ioannis A. Lelis, Ioannis S. Alexiadis, Minas C. Aristotle Univ Thessaloniki Sch Elect & Comp Engn GR-54006 Thessaloniki Greece

This study deals with the overvoltage problems caused by the increased photovoltaic (PV) penetration in typical rural radial distribution systems, where small PV systems and household consumers are connected. For this study, the authors used an iterative algorithm to solve the power flow problem in radial grids and considered three methods for the correction of unacceptable overvoltages, which are based on different principles. The system under consideration is an almost symmetrical three phase, low-voltage radial network, consisting of nine PV and consumer connection points. The system was simulated for a whole year with a sample time of 15 min, taking into account the variations of the solar radiation and loads. The results verified that the control of reactive power on the line can successfully manage overvoltage issues. The additional demand of reactive power and consequent line losses are used to evaluate various correction methods.

关键词： photovoltaic power systems overvoltage protection power distribution protection reactive power control load flow power distribution control low voltage network overvoltage correction reactive power control overvoltage problems photovoltaic penetration rural radial distribution systems small photovoltaic systems iterative algorithm power flow problem radial network line loss

来源：评论

学校读者我要写书评

暂无评论

Two iterative algorithms for the reflexive and Hermitian reflexive solutions of the generalized Sylvester matrix equation

引用

JOURNAL OF VIBRATION AND CONTROL 2015年第3期21卷 483-492页

作者： Ramadan, Mohamed A. El-Danaf, Talaat S. Bayoumi, Ahmed M. E. Menoufia Univ Dept Math Shibin Al Kawm Egypt Ain Shams Univ Dept Math Cairo Egypt

This paper is concerned with iterative solutions to the generalized Sylvester matrix equation A1V+A2V+B1W+B2W=E1VF1+E2VF2+C. Two iterative algorithms are presented to obtain the reflexive and Hermitian reflexive solutions. With these iterative algorithms, for any initial reflexive and Hermitian reflexive matrices the solutions can be obtained. Some needed lemmas are first stated, then two theorems are stated and proved where the iterative solutions are obtained. Finally, we report two numerical examples to verify the theoretical results.

关键词： Generalized Sylvester matrix equation conjugate Hermitian reflexive matrix reflexive matrix iterative algorithm inner product Frobenius norm

来源：评论

学校读者我要写书评

暂无评论

Input-to-state stability for discrete-time nonlinear switched singular systems

引用

INFORMATION SCIENCES 2016年 358卷 18-28页

作者： Liu, Yunlong Kao, Yonggui Karimi, Hamid Reza Gao, Zairui Weifang Univ Coll Informat & Control Engn Weifang 261061 Peoples R China Harbin Inst Technol Dept Math Weihai 264209 Peoples R China Univ Agder Fac Technol & Sci Dept Engn N-4898 Grimstad Norway

This paper investigates the input-to-state stability (ISS) problems for a class of discrete time nonlinear switched singular systems (SSSs). Two novel ISS criteria are proposed based on average dwell time (ADT) approach and iterative algorithm of discrete-time systems (TADS). In particular, the following two cases are considered for the underlying systems: the first case is that all the sub-systems are exponentially stable, and the other case is that only a few sub-systems are exponentially stable. The corresponding ISS criteria are obtained to guarantee that the closed-loop systems are input-to-state stable via ADT approach and IADS. We neither construct a specific Lyapunov function for ISS in the proof process of the stability criteria nor design a specific structure of the control inputs. The design deficit of the switching controllers is optimized and the design difficulty of the switching controllers is reduced via the proposed criteria. Finally, two numerical examples are provided to illustrate the feasibility of the results obtained. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Switched singular system Discrete-time system Nonlinear system Input-to-state stability Average dwell time iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimization Model for Clustering Categorical Data Streams with Drifting Concepts

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2016年第11期28卷 2871-2883页

作者： Bai, Liang Cheng, Xueqi Liang, Jiye Shen, Huawei Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Shanxi Univ Sch Comp & Informat Technol Taiyuan 030006 Shanxi Peoples R China

There is always a lack of a cluster validity function and optimization strategy to find out clusters and catch the evolution trend of cluster structures on a categorical data stream. Therefore, this paper presents an optimization model for clustering categorical data streams. In the model, a cluster validity function is proposed as the objective function to evaluate the effectiveness of the clustering model while each new input data subset is flowing. It simultaneously considers the certainty of the clustering model and the continuity with the last clustering model in the clustering process. An iterative optimization algorithm is proposed to solve an optimal solution of the objective function with some constraints. Furthermore, we strictly derive a detection index for drifting concepts from the optimization model. We propose a detection method that integrates the detection index and the optimization model to catch the evolution trend of cluster structures on a categorical data stream. The new method can effectively avoid ignoring the effect of the clustering validity on the detection result. Finally, using the experimental studies on several real data sets, we illustrate the effectiveness of the proposed algorithm in clustering categorical data streams, compared with existing data-streams clustering algorithms.

关键词： Cluster analysis optimization model iterative algorithm categorical data stream drifting-concept detection

来源：评论

学校读者我要写书评

暂无评论

Coordinated multicell beamforming for massive multiple-input multiple-output systems based on uplink-downlink duality

引用

IET COMMUNICATIONS 2016年第17期10卷 2380-2390页

作者： He, Shiwen Huang, Yongming Shi, Yanru Qi, Chenhao Jin, Shi Yang, Luxi Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China

This paper studies joint beamforming and power allocation for multicell multiuser multi-antenna systems with the objective of maximising the minimum signal-to-interference-plus-noise ratio (max-min SINR). The authors first consider developing an iterative algorithm to achieve the optimal performance by extending the uplink-downlink duality for finite-scale wireless communication systems. The solution is then generalised to achieve the asymptotically optimal multicell beamforming with the aim to reduce the overhead of signalling exchange between coordinated base stations based on large dimension random matrix theory. Based on that, an efficient multicell beamforming algorithm is proposed to asymptotically achieve the max-min SINR. To further solve the complexity issue of large dimensional matrix inversion involved in the calculation of beamforming vectors, they propose a low-complexity beamforming calculator based on truncated polynomial expansion approach. Numerical results validate the effectiveness of the authors' proposed algorithms and show that they can achieve the optimal or asymptotically optimal performance in a massive multi-input multi-output system with low complexity and small backhaul overhead.

关键词： array signal processing MIMO communication radiofrequency interference telecommunication signalling matrix algebra multiuser detection iterative methods coordinated multicell beamforming massive multiple-input multiple-output systems uplink-downlink duality joint beamforming power allocation multicell multiuser multiantenna systems signal-to-interference-plus-noise ratio SINR iterative algorithm finite-scale wireless communication systems random matrix theory

来源：评论

学校读者我要写书评

暂无评论

Wireless backhaul resource allocation and user-centric clustering in ultra-dense wireless networks

引用

IET COMMUNICATIONS 2016年第15期10卷 1858-1864页

作者： Hua, Cunqing Luo, Yifeng Liu, Huibo Shanghai Jiao Tong Univ Sch Informat Secur Engn Shanghai 200240 Peoples R China

Wireless backhaul is a promising technology to lower the cost for connecting a large number of densely deployed access points in the emerging fifth generation wireless system. In this study, the authors consider the joint optimisation of resource allocation in wireless backhaul links and user-centric clustering in the access links. The objective is to maximise the weighted sum rate of all users under the backhaul resource constraints. To solve this intractable problem, they first adopt the (1)-norm approximation approach to convert the non-convex backhaul constraints into the solvable forms. They then reformulate the objective function as a set of second-order cone constraints based on the sequential parametric convex approximation method. An iterative algorithm is proposed to solve the transformed problem based on its special property. Simulation results show that the proposed algorithm outperforms other existing schemes under different network settings.

关键词： pattern clustering 5G mobile communication radio links approximation theory convex programming iterative methods concave programming iterative algorithm successive parametric convex approximation method second-order cone constraint set nonconvex backhaul constraint l(1)-norm approximation approach backhaul resource constraint weighted sum rate maximisation access link wireless backhaul link resource allocation joint optimisation fifth generation wireless system ultra-dense wireless network user-centric clustering wireless backhaul resource allocation

来源：评论

学校读者我要写书评

暂无评论

Image Reconstruction for ECT Based on Extended Sensitivity Matrix

引用

IEEE SENSORS JOURNAL 2016年第8期16卷 2466-2476页

作者： Ye, Jiamin Mao, Mingxu Wang, Haigang Yang, Wuqiang Chinese Acad Sci Inst Engn Thermophys Beijing 100190 Peoples R China Univ Manchester Sch Elect & Elect Engn Manchester M13 9PL Lancs England

Image reconstruction for electrical capacitance tomography (ECT) is usually based on a sensitivity matrix. To reduce the effect of soft-filed property of ECT and enhance the quality of reconstructed images, a new image reconstruction method for ECT based on an extended sensitivity matrix is proposed. The elements used in constructing the sensitivity matrix are a set of block bases instead of each individual pixel. Using the new block basis approach, an iterative algorithm for image reconstruction in ECT is implemented with a 12-electrode square ECT sensor. The performance of the new approach is evaluated according to the simulation and experimental results. Preliminary results show that the image reconstruction based on an extended sensitivity matrix with a suitably designed block basis can improve the image quality and stability compared with the Landweber iteration algorithm based on the conventional one-pixel basis.

关键词： Electrical capacitance tomography iterative algorithm extended sensitivity matrix numerical simulation experimental study

来源：评论

学校读者我要写书评

暂无评论

Auxiliary principle and iterative algorithm for a new system of generalized mixed equilibrium problems in Banach spaces

引用

APPLIED MATHEMATICS AND COMPUTATION 2011年第7期218卷 3507-3514页

作者： Ding, Xie Ping Sichuan Normal Univ Coll Math & Software Sci Chengdu 610066 Sichuan Peoples R China

In this paper, we study a new system of generalized mixed equilibrium problems involving skew-symmetric bifunctions (SGMEP) in reflexive Banach spaces. A system of auxiliary mixed equilibrium problems (SAMEP) for solving the SGMEP is introduced and the existence and uniqueness of the solutions of the SAMEP is first proved. Next, by using the auxiliary principle technique, a new iterative algorithm to compute the approximate solutions of the SGMEP is suggested and analyzed. Finally, the strong convergence of the iterative sequences generated by the algorithm is also proved under quite mild conditions. These results improve, unify and generalize some known results in recent literature. (C) 2011 Elsevier Inc. All rights reserved.

关键词： System of generalized mixed equilibrium problems involving skew-symmetric bifunctions Auxiliary principle iterative algorithm Reflexive Banach space

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：