Sample Approximation-Based Deflation Approaches For Chance Sinr-Constrained Joint Power And Admission Control, 2017 Chinese Academy of Sciences
Sample Approximation-Based Deflation Approaches For Chance Sinr-Constrained Joint Power And Admission Control, Ya-Feng Liu, Mingyi Hong, Enbin Song
Consider the joint power and admission control (JPAC) problem for a multiuser single-input single-output (SISO) interference channel. Most existing works on JPAC assume the perfect instantaneous channel state information (CSI). In this paper, we consider the JPAC problem with the imperfect CSI, i.e., we assume that only the channel distribution information (CDI) is available. We formulate the JPAC problem into a chance (probabilistic)-constrained program, where each link's SINR outage probability is enforced to be less than or equal to a specified tolerance. To circumvent the computational difficulty of the chance SINR constraints, we propose to use the ...
Asynchronous Distributed Admm For Large-Scale Optimization—Part Ii: Linear Convergence Analysis And Numerical Performance, 2017 The Chinese University of Hong Kong
Asynchronous Distributed Admm For Large-Scale Optimization—Part Ii: Linear Convergence Analysis And Numerical Performance, Tsung-Hui Chang, Wei-Cheng Lao, Mingyi Hong, Xiangfeng Wang
The alternating direction method of multipliers (ADMM) has been recognized as a versatile approach for solving modern large-scale machine learning and signal processing problems efficiently. When the data size and/or the problem dimension is large, a distributed version of ADMM can be used, which is capable of distributing the computation load and the data set to a network of computing nodes. Unfortunately, a direct synchronous implementation of such algorithm does not scale well with the problem size, as the algorithm speed is limited by the slowest computing nodes. To address this issue, in a companion paper, we have proposed ...
Joint Downlink Base Station Association And Power Control For Max-Min Fairness: Computation And Complexity, 2017 Southeast University
Joint Downlink Base Station Association And Power Control For Max-Min Fairness: Computation And Complexity, Qingjiang Shi, Mingyi Hong, Xiqi Gao, Enbin Song, Yunlong Cai, Weiqiang Xu
The performance of full-duplex (FD) relay systems can be greatly impacted by the self-interference (SI) at relays. By exploiting multiple antennas, the spectral efficiency of FD relay systems can be enhanced through spatial SI mitigation. This paper studies joint source transmit beamforming and relay processing to achieve rate maximization for FD multiple-input-multiple-output (MIMO) amplify-and-forward (AF) relay systems with consideration of relay processing delay. The problem is difficult to solve mainly due to the SI constraint induced by the relay processing delay. In this paper, we first present a sufficient condition under which the relay amplification matrix has rank-one structure. Then ...
Decomposition By Successive Convex Approximation: A Unifying Approach For Linear Transceiver Design In Heterogeneous Networks, Mingyi Hong, Qiang Li, Ya-Feng Liu
No abstract provided.
Sinr Constrained Beamforming For A Mimo Multi-User Downlink System: Algorithms And Convergence Analysis, 2017 Zhejiang University
Sinr Constrained Beamforming For A Mimo Multi-User Downlink System: Algorithms And Convergence Analysis, Oingjang Shi, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Consider a multiple-input multiple-output (MIMO) downlink multi-user channel. A well-studied problem in such a system is the design of linear beamformers for power minimization with the quality of service (QoS) constraints. The most representative algorithms for solving this class of problems are the so-called minimum mean square error (MMSE)-second-order cone programming (SOCP) algorithm [Visotksy and Madhow, “Optimum Beamforming Using Transmit Antenna Arrays,” Proc. IEEE Veh. Technol. Conf., May 1999, vol. 1, pp. 851-856] , [Wong, Zheng, and Ng, “Convergence Analysis of Downlink MIMO Antenna System Using Second-Order Cone Programming,” Proc. 62nd IEEE Veh. Technol. Conf., Sep. 2005, pp. 492-496] and ...
Asynchronous Distributed Admm For Large-Scale Optimization—Part I: Algorithm And Convergence Analysis, 2017 The Chinese University of Hong Kong
Asynchronous Distributed Admm For Large-Scale Optimization—Part I: Algorithm And Convergence Analysis, Tsung-Hui Chang, Mingyi Hong, Wei-Cheng Liao, Xiangfeng Wang
Aiming at solving large-scale optimization problems, this paper studies distributed optimization methods based on the alternating direction method of multipliers (ADMM). By formulating the optimization problem as a consensus problem, the ADMM can be used to solve the consensus problem in a fully parallel fashion over a computer network with a star topology. However, traditional synchronized computation does not scale well with the problem size, as the speed of the algorithm is limited by the slowest workers. This is particularly true in a heterogeneous network where the computing nodes experience different computation and communication delays. In this paper, we propose ...
Control Uniqueness In Reconstructability Analysis, 2016 Portland State University
Control Uniqueness In Reconstructability Analysis, Martin Zwick
When the reconstructability analysis of a directed system yields a structure in which a generated variable appears in more than one subsystem, information from all of the subsystems can be used in modeling the relationship between generating and generated variables. The conceptualization and procedure proposed here is discussed in relation to Klir's concept of control uniqueness.
Multi-Level Decomposition Of Probalistic Relations, 2016 Portland State University
Multi-Level Decomposition Of Probalistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski
Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.
Enhancements To Crisp Possibilistic Reconstructability Analysis, 2016 Portland State University
Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick
Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) Reconstructibility Analysis, is presented. It is shown that in some cases while 3-variable NPN-classified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using Modified Reconstructibility Analysis (MRA). Also, it is shown that whenever a decomposition of 3-variable NPN-classified Boolean functions exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. A comparison of the corresponding complexities for Ashenhurst-Curtis decompositions, and Modified Reconstructibility Analysis (MRA) is also presented. While both AC and MRA decompose some but not all NPN-classes ...
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, 2016 Portland State University
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais
The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information-theoretic reconstructability analysis can be used to decide on optimal gene ordering.
Wholes And Parts In General Systems Methodology, 2016 Portland State University
Wholes And Parts In General Systems Methodology, Martin Zwick
Reconstructability analysis (RA) decomposes wholes, namely data in the form either of set-theoretic relations or multivariate probability distributions, into parts, namely relations or distributions involving subsets of variables. Data is modeled and compressed by variablebased decomposition, by more general state-based decomposition, or by the use of latent variables. Models, which specify the interdependencies among the variables, are selected to minimize error and complexity.
Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, 2016 Portland State University
Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, George G. Lendaris, Thaddeus T. Shannon, Martin Zwick
We consider the problem of matching domain-specific statistical structure to neural-network (NN) architecture. In past work we have considered this problem in the function approximation context; here we consider the pattern classification context. General Systems Methodology tools for finding problem-domain structure suffer exponential scaling of computation with respect to the number of variables considered. Therefore we introduce the use of Extended Dependency Analysis (EDA), which scales only polynomially in the number of variables, for the desired analysis. Based on EDA, we demonstrate a number of NN pre-structuring techniques applicable for building neural classifiers. An example is provided in which EDA ...
Complexity And Decomposability Of Relations, 2016 Portland State University
Complexity And Decomposability Of Relations, Martin Zwick
A discrete multivariate relation, defined set-theoretically, is a subset of a cartesian product of sets which specify the possible values of a number of variables. Where three or more variables are involved, the highest order relation, namely the relation between all the variables, may or may not be decomposable without loss into sets of lower order relations which involve subsets of the variables. In a completely parallel manner, the highest order relation defined information-theoretically, namely the joint probability distribution involving all the variables, may or may not be decomposed without loss into lower-order distributions involving subsets of the variables. Decomposability ...
Hydrobase: An Iot Gardening Application, 2016 San Jose State University
Hydrobase: An Iot Gardening Application, Nandini Kant Goyal
As the world is moving towards urban agriculture, there are many IoT Hydroponic Control Systems being introduced these days. There are many different platforms emerging, but they all suffer from the same flaw, the software and hardware are so tightly integrated that most of the times the individuals have no freedom of how to use the product, or they need to completely hack the system. This brings us to the need of a system that is designed to allow the user more flexibility in platform configuration, as well as assist in platform construction. We propose a model called Hydrobase to ...
Android Drone: Remote Quadcopter Control With A Phone, 2016 California Polytechnic State University, San Luis Obispo
Android Drone: Remote Quadcopter Control With A Phone, Aubrey John Russell
The purpose of the “Android Drone” project was to create a quadcopter that can be controlled by user input sent over the phone’s Wi-Fi connection or 4G internet connection. Furthermore, the purpose was also to be able to receive live video feedback over the internet connection, thus making the drone an inexpensive option compared to other, equivalent drones that might cost thousands of dollars. Not only that, but the Android phone also has a host of other useful features that could be utilized by the drone: this includes GPS, pathing, picture taking, data storage, networking and TCP/IP, a ...
Pairwise Relation Classification With Mirror Instances And A Combined Convolutional Neural Network, 2016 Singapore Management University
Pairwise Relation Classification With Mirror Instances And A Combined Convolutional Neural Network, Yu, Jianfei, Jing Jiang
Research Collection School Of Information Systems
Relation classification is the task of classifying the semantic relations between entity pairs intext. Observing that existing work has not fully explored using different representations forrelation instances, especially in order to better handle the asymmetry of relation types, in thispaper, we propose a neural network based method for relation classification that combines theraw sequence and the shortest dependency path representations of relation instances and usesmirror instances to perform pairwise relation classification. We evaluate our proposed modelson two widely used datasets: SemEval-2010 Task 8 and ACE-2005. The empirical results showthat our combined model together with mirror instances achieves the state-of-the-art results ...
Agora: A Knowledge Marketplace For Machine Learning, 2016 The University of Western Ontario
Agora: A Knowledge Marketplace For Machine Learning, Mauro Ribeiro
Electronic Thesis and Dissertation Repository
More and more data are becoming part of people's lives. With the popularization of technologies like sensors, and the Internet of Things, data gathering is becoming possible and accessible for users. With these data in hand, users should be able to extract insights from them, and they want results as soon as possible. Average users have little or no experience in data analytics and machine learning and are not great observers who can collect enough data to build their own machine learning models. With large quantities of similar data being generated around the world and many machine learning models ...
Improving The Performance Of Ice Sheet Modeling Through Embedded Simulation, 2016 University of Maine
Improving The Performance Of Ice Sheet Modeling Through Embedded Simulation, Christopher G. Dufour
Electronic Theses and Dissertations
Understanding the impact of global climate change is a critical concern for society at large. One important piece of the climate puzzle is how large-scale ice sheets, such as those covering Greenland and Antarctica, respond to a warming climate. Given such ice sheets are under constant change, developing models that can accurately capture their dynamics represents a significant challenge to researchers. The problem, however, is properly capturing the dynamics of an ice sheet model requires a high model resolution and simulating these models is intractable even for state-of-the-art supercomputers.
This thesis presents a revolutionary approach to accurately capture ice sheet ...
Achieving High Reliability And Efficiency In Maintaining Large-Scale Storage Systems Through Optimal Resource Provisioning And Data Placement, 2016 University of Tennessee, Knoxville
Achieving High Reliability And Efficiency In Maintaining Large-Scale Storage Systems Through Optimal Resource Provisioning And Data Placement, Lipeng Wan
With the explosive increase in the amount of data being generated by various applications, large-scale distributed and parallel storage systems have become common data storage solutions and been widely deployed and utilized in both industry and academia. While these high performance storage systems significantly accelerate the data storage and retrieval, they also bring some critical issues in system maintenance and management. In this dissertation, I propose three methodologies to address three of these critical issues.
First, I develop an optimal resource management and spare provisioning model to minimize the impact brought by component failures and ensure a highly operational experience ...
A Feasible No-Root Approach On Android, 2016 Singapore Management University
A Feasible No-Root Approach On Android, Yao Cheng, Yingjiu Li, Deng, Robert H.
Research Collection School Of Information Systems
Root is the administrative privilege on Android, which is however inaccessible on stock Android devices. Due to the desire for privileged functionalities and the reluctance of rooting their devices, Android users seek for no-root approaches, which provide users with part of root privileges without rooting their devices. In this paper, we newly discover a feasible no-root approach based on the ADB loopback. To ensure such no-root approach is not misused proactively, we examine its dark side, including privacy leakage via logs and user input inference. Finally, we discuss the solutions and suggestions from different perspectives.