You searched for +publisher:"University of Colorado" +contributor:("Lijun Chen").
Showing records 1 – 16 of
16 total matches.
No search limiters apply to these results.
University of Colorado
1.
Zheng, Chenyu.
Self-Organizing Hybrid Cellular-MANETs.
Degree: PhD, Computer Science, 2014, University of Colorado
URL: https://scholar.colorado.edu/csci_gradetds/87 
► It is well-recognized that our dependence on mobile communications grows; however, users of wireless devices may encounter inadequate coverage due to a variety of…
(more)
▼ It is well-recognized that our dependence on mobile communications grows; however, users of wireless devices may encounter inadequate coverage due to a variety of shortage and outage circumstances. There are also cost and law issues associated with the problem of inadequate wireless coverage. This is an especially urgent issue in disaster areas where the access to outside world is critical for rescue operations. In this thesis, a self-organizing communication framework is presented for extending wireless coverage for mobile devices, without requiring modifications of existing wireless infrastructures. Participating devices form a hybrid cellular mobile ad hoc network (hybrid cellular-MANET), relaying data off net through the nodes that have both sufficient cellular forwarding capabilities and adequate battery charge level. In a hybrid cellular-MANET, the mobility of the users/devices cause continuous topology and role changes, and the battery energy is critical for communicating with the outside world. To solve these identified challenging problems, a low-complexity, mobility-aware, energy-aware, multi-path data routing mechanism (HMANET) is designed for this framework. The proposed routing includes two major components: a baseline routing that includes a locally reactive and hence low-complexity routing sub-component to handle mobility; and an energy-aware multi-path routing that is motivated by an energy optimization problem and uses only local information. Packet-level simulations show that the proposed routing scheme achieves good performance in delay, packet delivery, adaptiveness to mobility, and energy consumption. In addition, this framework is implemented in Android devices. People can install the corresponding Android application on smartphones and tablets, and use it to form a hybrid cellular-MANET to extend wireless coverage. The results from conducted phone-in-the-loop emulations show that the proposed routing scheme can achieve more effcient energy utilization. Lastly, a fully functioning microblogging system is built for smart devices in disaster areas to validate the feasibility of hybrid cellular-MANETs. The experimental results show that the HMANET protocol statistically outperforms the classic Hybrid Wireless Mesh Protocol (HWMP) used in the IEEE 802.11s standard in terms of adaptiveness to role change and mobility in the hybrid cellular-MANET.
Advisors/Committee Members: Douglas Sicker, Lijun Chen.
Subjects/Keywords: Mobile phone; wireless coverage; Android devices; microblogging; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zheng, C. (2014). Self-Organizing Hybrid Cellular-MANETs. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/87
Chicago Manual of Style (16th Edition):
Zheng, Chenyu. “Self-Organizing Hybrid Cellular-MANETs.” 2014. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/csci_gradetds/87.
MLA Handbook (7th Edition):
Zheng, Chenyu. “Self-Organizing Hybrid Cellular-MANETs.” 2014. Web. 27 Feb 2021.
Vancouver:
Zheng C. Self-Organizing Hybrid Cellular-MANETs. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/csci_gradetds/87.
Council of Science Editors:
Zheng C. Self-Organizing Hybrid Cellular-MANETs. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/csci_gradetds/87
University of Colorado
2.
Shalaby, Yassmin.
Minimizing Price of Anarchy in Resource Allocation Games.
Degree: MS, Electrical, Computer & Energy Engineering, 2014, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/85
► Resource allocation refers to problems where there is a set of resources to be allocated efficiently among a group of agents. The distributed nature…
(more)
▼ Resource allocation refers to problems where there is a set of resources to be allocated efficiently among a group of agents. The distributed nature of resource allocation motivates modeling it as a distributed control problem. One of the strong modeling frameworks for distributed control problems is the game theoretic framework. Game theory provides mathematical models that aid in studying the aggregate behavior of a group of decision makers. The main challenge in modeling a distributed optimization problem as a game is the design of agents' utility functions. A utility function is designed as a distribution rule of some welfare; and the goal is to distribute the welfare in a way that incentivizes players to land in a "good" equilibrium point. The ratio between the performance of the worst possible equilibrium point and the optimal outcome of a game is called the price of anarchy. A distribution rule that distributes the welfare exactly is called budget-balanced, and one that distributes the welfare with excess is said to satisfy a relaxed budget-balance condition. On the other hand, if it causes a deficit we say that it violates the budget-balance condition.
In this thesis, we study the design of utility functions in resource allocation games that minimize the price of anarchy. We compare two families of utility functions that guarantee equilibrium existence, namely the Shapley value and the marginal contribution. The Shapley value is a budget-balanced distribution rule, while the marginal contribution satisfies the relaxed budget-balance condition given that the welfare being distributed is submodular. We derive price of anarchy bounds for the marginal contribution utility in resource allocation games and compare them to those for the Shapley value, derived in the literature. We also perform a small-scale study for a wider range of utility functions.
Lastly, we examine the connection between the price of anarchy and the satisfiability of the budget-balance conditions of the utility designs. We show that violating the budget-balance condition worsens the price of anarchy.
Advisors/Committee Members: Jason Marden, Eric Frew, Lijun Chen.
Subjects/Keywords: Distributed Control; Game Theory; Marginal Contribution; Price of Anarchy; Resource Allocation Games; Shapley Value; Electrical and Computer Engineering; Operational Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shalaby, Y. (2014). Minimizing Price of Anarchy in Resource Allocation Games. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/85
Chicago Manual of Style (16th Edition):
Shalaby, Yassmin. “Minimizing Price of Anarchy in Resource Allocation Games.” 2014. Masters Thesis, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/ecen_gradetds/85.
MLA Handbook (7th Edition):
Shalaby, Yassmin. “Minimizing Price of Anarchy in Resource Allocation Games.” 2014. Web. 27 Feb 2021.
Vancouver:
Shalaby Y. Minimizing Price of Anarchy in Resource Allocation Games. [Internet] [Masters thesis]. University of Colorado; 2014. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/ecen_gradetds/85.
Council of Science Editors:
Shalaby Y. Minimizing Price of Anarchy in Resource Allocation Games. [Masters Thesis]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/ecen_gradetds/85
University of Colorado
3.
Driggs, Derek T.
Optimization for High-Dimensional Data Analysis.
Degree: MS, Applied Mathematics, 2017, University of Colorado
URL: https://scholar.colorado.edu/appm_gradetds/86
► As modern datasets continue to grow in size, they are also growing in complexity. Data are more often being recorded using multiple sensors, creating large,…
(more)
▼ As modern datasets continue to grow in size, they are also growing in complexity. Data are more often being recorded using multiple sensors, creating large, multidimensional datasets that are difficult to analyze. In this thesis, we explore methods to accelerate low-rank recovery algorithms for data analysis, with an emphasis on Robust Principal Component Analysis (RPCA). We also develop a tensor-based approach to RPCA that preserves the inherent structure of multidimensional datasets, allowing for improved analysis. Both of our approaches use nuclear-norm regularization with Burer-Monteiro factorization (or higher-order generalizations thereof) to transform convex but expensive programs into non-convex programs that can be solved efficiently. We supplement our non-convex programs with a certificate of optimality that can be used to bound the suboptimality of each iterate. We demonstrate that both of these approaches allow for new applications of RPCA in fields involving multidimensional datasets; for example, we show that our methods can be used for real-time video processing as well as the analysis of fMRI brain-scans. Traditionally, these tasks have been considered too demanding for low-rank recovery algorithms.
Advisors/Committee Members: Stephen Becker, Lijun Chen, Jem Corcoran.
Subjects/Keywords: Low-rank regularization; Parallel programming; RPCA; Tensor; Applied Mathematics; Numerical Analysis and Scientific Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Driggs, D. T. (2017). Optimization for High-Dimensional Data Analysis. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/86
Chicago Manual of Style (16th Edition):
Driggs, Derek T. “Optimization for High-Dimensional Data Analysis.” 2017. Masters Thesis, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/appm_gradetds/86.
MLA Handbook (7th Edition):
Driggs, Derek T. “Optimization for High-Dimensional Data Analysis.” 2017. Web. 27 Feb 2021.
Vancouver:
Driggs DT. Optimization for High-Dimensional Data Analysis. [Internet] [Masters thesis]. University of Colorado; 2017. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/appm_gradetds/86.
Council of Science Editors:
Driggs DT. Optimization for High-Dimensional Data Analysis. [Masters Thesis]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/86
University of Colorado
4.
Yarlagadda, Abhiram.
The Price of Local Voltage Control in Distribution Systems.
Degree: MS, 2015, University of Colorado
URL: https://scholar.colorado.edu/tlen_gradetds/9
► In this thesis, motivated by an optimization model for understanding the local voltage control in the distribution system, we introduce a minimum cost voltage…
(more)
▼ In this thesis, motivated by an optimization model for understanding the local voltage control in the distribution system, we introduce a minimum cost voltage control problem. We propose a minimum cost voltage control algorithm, and show that it cannot be implemented based on only local voltage. We further show that no local voltage control algorithm can achieve the minimum cost. However, in practice we may have the constraint or preference to adopt local controls. It is important to characterize the performance of the local control with respect to system-wide properties such as the aggregate cost. We thus introduce the notion of the
price of local control (
PoLC) to characterize the performance of local voltage control in terms of the aggregate cost minimization. Specifically, we use the gap between the minimum cost and the cost achieved by the network equilibrium of local voltage control as the metric for
PoLC. We characterize how the
PoLC scales with the size, topology, and heterogeneity of the power network for a few special cases. In particular, we identify a universal upper bound for
PoLC that is independent of the power line reactance and the topology of the network; and for the tree network, we find that the
PoLC saturates with the size of the network. Such results will be insightful to understanding the limitation of local controls and help deliberate the trade-off between informational constraint/requirement and system-wide efficiency in design choice.
Advisors/Committee Members: Lijun Chen, Sangtae Ha, Eugene Liu.
Subjects/Keywords: algorithms; smart grid; voltage control; optimization; local control; Applied Mathematics; Controls and Control Theory; Power and Energy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yarlagadda, A. (2015). The Price of Local Voltage Control in Distribution Systems. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/tlen_gradetds/9
Chicago Manual of Style (16th Edition):
Yarlagadda, Abhiram. “The Price of Local Voltage Control in Distribution Systems.” 2015. Masters Thesis, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/tlen_gradetds/9.
MLA Handbook (7th Edition):
Yarlagadda, Abhiram. “The Price of Local Voltage Control in Distribution Systems.” 2015. Web. 27 Feb 2021.
Vancouver:
Yarlagadda A. The Price of Local Voltage Control in Distribution Systems. [Internet] [Masters thesis]. University of Colorado; 2015. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/tlen_gradetds/9.
Council of Science Editors:
Yarlagadda A. The Price of Local Voltage Control in Distribution Systems. [Masters Thesis]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/tlen_gradetds/9
University of Colorado
5.
Save, Chinmay.
Self-organization and Communication Networks for Microgrid.
Degree: MS, 2012, University of Colorado
URL: https://scholar.colorado.edu/tlen_gradetds/13
► Microgrids play an important role in deployment of smart grids by providing means for integration of renewable sources in electrical grid, reducing carbon footprint…
(more)
▼ Microgrids play an important role in deployment of smart grids by providing means for integration of renewable sources in electrical grid, reducing carbon footprint as well as lessening the load on utility. As the smart grid is being deployed, the nodes participating in electrical grids are becoming "smarter", thus an effective communication network needs to be in place for exchange of information between these nodes. Self-organizing electric grid will help overcome faults, power outages and will facilitate in effective distribution of electricity. This thesis is investigates wireless communication network protocols and network design for intra as well as inter microgrid communication. This work also investigates a feasibility of exchange of electricity between microgrids and develops an algorithm to self-organize an electrical grid is also provided.
Advisors/Committee Members: Frank Barnes, Tim Brown, Lijun Chen.
Subjects/Keywords: electric power; simulation; WiFi; solar; wind; Computer Sciences; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Save, C. (2012). Self-organization and Communication Networks for Microgrid. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/tlen_gradetds/13
Chicago Manual of Style (16th Edition):
Save, Chinmay. “Self-organization and Communication Networks for Microgrid.” 2012. Masters Thesis, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/tlen_gradetds/13.
MLA Handbook (7th Edition):
Save, Chinmay. “Self-organization and Communication Networks for Microgrid.” 2012. Web. 27 Feb 2021.
Vancouver:
Save C. Self-organization and Communication Networks for Microgrid. [Internet] [Masters thesis]. University of Colorado; 2012. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/tlen_gradetds/13.
Council of Science Editors:
Save C. Self-organization and Communication Networks for Microgrid. [Masters Thesis]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/tlen_gradetds/13
University of Colorado
6.
Zhou, Xinyang.
Distributed Real-Time Voltage Regulation in Distribution Networks.
Degree: PhD, 2018, University of Colorado
URL: https://scholar.colorado.edu/tlen_gradetds/31
► The increasing penetration of renewable and distributed energy resources (DERs) in distribution networks call for fast and efficient distributed voltage regulation algorithms. This thesis first…
(more)
▼ The increasing penetration of renewable and distributed energy resources (DERs) in distribution networks call for fast and efficient distributed voltage regulation algorithms. This thesis first studies the existing local Volt/VAR control and designs new local algorithms with less restrictive convergence conditions and better voltage regulation. Meanwhile, unlike the traditional assets owned and managed by utility companies, the customer-owned DERs are not necessarily subject to the control of network operators unless properly incentivized. This thesis then investigates the joint design of distributed control and incentive mechanisms for managing DERs by introducing a market-based voltage regulation framework and extending it to a real-time setting with both continuous and discrete decision variables as well as device dynamics under time-varying operating conditions. The resulting randomized distributed algorithm admits asynchronous implementation in practical systems, and its performance is analytically characterized as well as numerically evaluated.
Advisors/Committee Members: Lijun Chen, Sangtae Ha, Frank Barnes, Emiliano Dall’Anese, Dirk Grunwald.
Subjects/Keywords: distributed control and optimization; distribution network; real-time pricing; time-varying optimization; voltage regulation; volt/var control; Electrical and Computer Engineering; Power and Energy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhou, X. (2018). Distributed Real-Time Voltage Regulation in Distribution Networks. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/tlen_gradetds/31
Chicago Manual of Style (16th Edition):
Zhou, Xinyang. “Distributed Real-Time Voltage Regulation in Distribution Networks.” 2018. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/tlen_gradetds/31.
MLA Handbook (7th Edition):
Zhou, Xinyang. “Distributed Real-Time Voltage Regulation in Distribution Networks.” 2018. Web. 27 Feb 2021.
Vancouver:
Zhou X. Distributed Real-Time Voltage Regulation in Distribution Networks. [Internet] [Doctoral dissertation]. University of Colorado; 2018. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/tlen_gradetds/31.
Council of Science Editors:
Zhou X. Distributed Real-Time Voltage Regulation in Distribution Networks. [Doctoral Dissertation]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/tlen_gradetds/31
University of Colorado
7.
Qi, Hanchao.
Low-Dimensional Signal Models in Compressive Sensing.
Degree: PhD, Electrical, Computer & Energy Engineering, 2013, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/68
► In today's world, we often face an explosion of data that can be difficult to handle. Signal models help make this data tractable, and…
(more)
▼ In today's world, we often face an explosion of data that can be difficult to handle. Signal models help make this data tractable, and thus play an important role in designing efficient algorithms for acquiring, storing, and analyzing signals. However, choosing the right model is critical. Poorly chosen models may fail to capture the underlying structure of signals, making it hard to achieve satisfactory results in signal processing tasks. Thus, the most accurate and concise signal models must be used.
Many signals can be expressed as a linear combination of a few elements of some dictionary, and this is the motivation behind the emerging field of compressive sensing. Compressive sensing leverages this signal model to enable us to perform signal processing tasks without full knowledge of the data.
However, this is only one possible model for signals, and many signals could in fact be more accurately and concisely described by other models. In particular, in this thesis, we will look at two such models, and show how these other two models can be used to allow signal reconstruction and analysis from partial knowledge of the data.
First, we consider signals that belong to low-dimensional nonlinear manifolds, i.e. that can be represented as a continuous nonlinear function of few parameters. We show how to apply the kernel trick, popular in machine learning, to adapt compressive sensing to this type of sparsity. Our approach provides computationally-efficient, improved signal reconstruction from partial measurements when the signal is accurately described by such a manifold model.
We then consider collections of signals that together have strong principal components, so that each individual signal may be modeled as a linear combination of these few shared principal components. We focus on the problem of finding the center and principal components of these high-dimensional signals using only their measurements. We show experimentally and theoretically that our approach will generally return the correct center and principal components for a large enough collection of signals. The recovered principal components also allow performance gains in other signal processing tasks.
Advisors/Committee Members: Shannon M. Hughes, Youjian Liu, Francois Meyer, Lijun Chen, Alireza Doostan.
Subjects/Keywords: algorithms; compressive sensing; nonlinear manifolds; high-dimensional signals; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Qi, H. (2013). Low-Dimensional Signal Models in Compressive Sensing. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/68
Chicago Manual of Style (16th Edition):
Qi, Hanchao. “Low-Dimensional Signal Models in Compressive Sensing.” 2013. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/ecen_gradetds/68.
MLA Handbook (7th Edition):
Qi, Hanchao. “Low-Dimensional Signal Models in Compressive Sensing.” 2013. Web. 27 Feb 2021.
Vancouver:
Qi H. Low-Dimensional Signal Models in Compressive Sensing. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/ecen_gradetds/68.
Council of Science Editors:
Qi H. Low-Dimensional Signal Models in Compressive Sensing. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/ecen_gradetds/68
University of Colorado
8.
Matviychuk, Yevgen.
Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing.
Degree: PhD, Electrical, Computer & Energy Engineering, 2016, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/124
► While the field of image processing has been around for some time, new applications across many diverse areas, such as medical imaging, remote sensing,…
(more)
▼ While the field of image processing has been around for some time, new applications across many diverse areas, such as medical imaging, remote sensing, astrophysics, cellular imaging, computer vision, and many others, continue to demand more and more sophisticated image processing techniques. These areas inherently rely on the development of novel methods and algorithms for their success. Many important cases in these applications can be posed as problems of reversing the action of certain linear operators. Recently, patch-based methods for image reconstruction have been shown to work exceptionally well in addressing these inverse problems, establishing new state-of-the-art benchmarks for many of them, and even approaching estimated theoretical limits of performance.
However, there is still space and need for improvement, particularly in highly specialized domains. The purpose of this thesis will be to improve upon these prior patch-based image processing methods by developing a computationally efficient way to model the underlying set of patches as arising from a low-dimensional manifold. In contrast to other works that have attempted to use a manifold model for patches, ours will rely on the machinery of kernel methods to efficiently approximate the solution. This will make our approach much more suitable for practical use than those of our predecessors. We will show experimental results paralleling or exceeding those of modern state-of-the-art image processing algorithms for several inverse problems. Additionally, near the end of the thesis, we will revisit the problem of learning a representation for the manifold from its samples and develop an improved approach for it. In contrast to prior methods for manifold learning, our kernel-based strategy will be robust to issues of learning from very few or noisy samples, and it will readily allow for interpolation along or projection onto the manifold.
Advisors/Committee Members: Shannon M. Hughes, Youjian Liu, Lijun Chen, Jem Corcoran, Elizabeth Bradley.
Subjects/Keywords: Image processing; Inverse problems; Kernel methods; Machine learning; Manifold models; Computer Sciences; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Matviychuk, Y. (2016). Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/124
Chicago Manual of Style (16th Edition):
Matviychuk, Yevgen. “Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing.” 2016. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/ecen_gradetds/124.
MLA Handbook (7th Edition):
Matviychuk, Yevgen. “Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing.” 2016. Web. 27 Feb 2021.
Vancouver:
Matviychuk Y. Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/ecen_gradetds/124.
Council of Science Editors:
Matviychuk Y. Learning and Mapping onto Manifolds with Applications to Patch-based Image Processing. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/ecen_gradetds/124
University of Colorado
9.
Li, Xing.
Optimization and Performance of MIMO B-MAC Interference Networks.
Degree: PhD, Electrical, Computer & Energy Engineering, 2015, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/118
► This thesis studies optimization and performance of the MIMO B-MAC interference networks which includes broadcast channel (BC), multiaccess channel (MAC), interference channels, X networks,…
(more)
▼ This thesis studies optimization and performance of the MIMO B-MAC interference networks which includes broadcast channel (BC), multiaccess channel (MAC), interference channels, X networks, and many practical wireless networks as special cases. A 3D channel model for distributed MIMO system is set up, based on which the antenna correlations can be characterized in analytic form. We propose a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channels (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm and the polite water-filling (PWF) algorithm. The WMMSE algorithm is provably convergent, while the PWF algorithm takes the advantage of the optimal transmit signal structure and converges the fastest in most situations but is not guaranteed to converge in all situations. It is highly desirable to design an algorithm that has the advantages of both algorithms. The proposed dual link algorithm is such an algorithm. Its fast and guaranteed convergence is important to distributed implementation and time varying channels. In addition, the technique and a scaling invariance property used in the convergence proof may find applications in other non-convex problems in communication networks. The dual link algorithm is also further modified to fit practical applications. Since the centralized algorithm is not scalable as network size increases, the optimization algorithm needs to be working in a mainly distributed fashion to avoid having huge signaling overheads. We've proposed the distributed dual link algorithm for time division duplex (TDD) interference networks. It replaces direct and cross channel information feedbacks with iterations of forward and reverse link pilots training whose complexity grows linearly with the number of users in the network. By totally avoiding channel state knowledge feedback, the distributed dual link algorithm has significant lower signaling overhead compared to the traditional methods, especially in networks with large number of interfering users. However, the real TDD channels are not reciprocal because the transmit and receive RF chains are different in a transceiver. To solve this issue, we proposed a simple method of channel calibration to restore TDD channel reciprocity for MIMO interference networks that is essential to the distributed implementation of the Dual Link algorithm and other algorithms that require reciprocity. On the other hand, the channel knowledge is generally imperfect in a realistic scenario. To study its impact, we introduce a simple channel uncertainty model that characterizes different levels of channel uncertainty. Based on this model, the ergodic weighted sum-rate maximization problem is studied. The ergodic…
Advisors/Committee Members: Youjian Liu, Lijun Chen, Mahesh K. Varanasi, Behrouz Touri, Peter Mathys.
Subjects/Keywords: Duality; Interference Channel; MIMO; Optimization; Weighted Sumrate Maximization; Systems and Communications; Theory and Algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, X. (2015). Optimization and Performance of MIMO B-MAC Interference Networks. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/118
Chicago Manual of Style (16th Edition):
Li, Xing. “Optimization and Performance of MIMO B-MAC Interference Networks.” 2015. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/ecen_gradetds/118.
MLA Handbook (7th Edition):
Li, Xing. “Optimization and Performance of MIMO B-MAC Interference Networks.” 2015. Web. 27 Feb 2021.
Vancouver:
Li X. Optimization and Performance of MIMO B-MAC Interference Networks. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/ecen_gradetds/118.
Council of Science Editors:
Li X. Optimization and Performance of MIMO B-MAC Interference Networks. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/ecen_gradetds/118
University of Colorado
10.
Pang, Yimin.
Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.
Degree: PhD, 2019, University of Colorado
URL: https://scholar.colorado.edu/eeng_gradetds/39
► Spectrum sharing allows the coexistence of heterogeneous wireless networks on the same frequency band. Managing the interference between such networks is critically important to…
(more)
▼ Spectrum sharing allows the coexistence of heterogeneous wireless networks on the same frequency band. Managing the interference between such networks is critically important to ensure high spectrum efficiency, thus motivating the study of multiple-input-multiple-output (MIMO) interference channels (IC) in information theory. This dissertation studies three classes of such interference channels, namely, the MIMO one-to-three IC, the MIMO IC-ZIC, and the MIMO MAC-IC-MAC. The MIMO one-to-three IC is a partially connected three-user IC with multiple antenna terminals, where one transmitter that causes interference is heard at all three receivers, whereas the other two transmitters are heard only by their intended receivers. We present inner and outer bounds on the capacity region of the MIMO one-to-three IC, quantify the gap between the two bounds, and show that the gap is independent of the channel signal-to-noise ratios (SNRs) and interference-to-noise ratios (INRs). In particular, the achievable scheme at the interfering transmitter involves three-level superposition coding with linear precoding based on the generalized singular value decomposition (GSVD) whereas the non-interfering transmitters perform single-user coding with Gaussian codebooks and scaled identity covariances. The outer bound is obtained using genie-aided arguments with various combinations of genie information provided to the receivers. The generalized degrees of freedom (GDoF) region, which can be seen as a high SNR approximation of the capacity region, of the MIMO one-to-three IC is then fully characterized. We study the achievability of the GDoF region and the sum GDoF curve using an analysis tool developed in this dissertation, which we refer to as multidimensional signal-level partitioning. This tool is tailored for demonstrating the achievability of GDoF-tuples of a MIMO network that can be achieved via multi-level superposition coding. The MIMO IC-ZIC is also a partially connected three-user IC consisting of three transmitter-receiver pairs. In the IC-ZIC, the first and second pairs form a two-user IC, the first and third pairs form a one-sided or Z interference channel (ZIC) and the second and third transmitter-receiver pairs taken by themselves are two non-interfering point-to-point links. In this thesis, an explicit inner bound is obtained via a coding scheme is proposed in which the first transmitter employs three-level superposition coding (as in the MIMO one-to-three IC), the second one employs the previously proposed and well-known Karmakar-Varanasi coding scheme (which achieves a constant-gap-to-capacity region of the two-user MIMO IC), and the third transmitter employs single-user coding with a Gaussian codebook (with scaled identity covariance). An explicit single region outer bound based on genie-aided arguments is then obtained. The gap between the inner and outer bounds is then shown to be within a quantifiable gap to the capacity region and the gap is independent of channel SNRs and INRs. The GDoF region is then…
Advisors/Committee Members: Mahesh Varanasi, Youjian Liu, Fabio Somenzi, Lijun Chen, Sriram Sankaranarayanan.
Subjects/Keywords: generalized degrees of freedom; ic-zic; interference channel; mac-ic-mac; mimo; one-to-three; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pang, Y. (2019). Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/eeng_gradetds/39
Chicago Manual of Style (16th Edition):
Pang, Yimin. “Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.” 2019. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/eeng_gradetds/39.
MLA Handbook (7th Edition):
Pang, Yimin. “Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.” 2019. Web. 27 Feb 2021.
Vancouver:
Pang Y. Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/eeng_gradetds/39.
Council of Science Editors:
Pang Y. Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/eeng_gradetds/39
University of Colorado
11.
Borowski, Holly Patricia.
Performance Tradeoffs in Distributed Control Systems.
Degree: PhD, Aerospace Engineering Sciences, 2016, University of Colorado
URL: https://scholar.colorado.edu/asen_gradetds/127
► Large scale systems consisting of many interacting subsystems are often controlled in a distributed fashion due to inherent limitations in computation, communication, or sensing.…
(more)
▼ Large scale systems consisting of many interacting subsystems are often controlled in a distributed fashion due to inherent limitations in computation, communication, or sensing. Here, individual agents must make decisions based on local, often incomplete information. This dissertation focuses on understanding performance tradeoffs in distributed control systems, specifically focusing on using a game theoretic framework to assign agent control laws. Performance of a distributed control law is determined by (1) the degree with which it meets a stated objective, (2) the amount of time it takes to converge, (3) agents' informational requirements, and (4) vulnerability to adversarial manipulation. The three main research questions addressed in this work are:
When is fast convergence to near-optimal behavior possible in a distributed system? We design a distributed control law which converges to a near-optimal configuration in a time that is near-linear in the number of agents. This worst case convergence time is an improvement over existing algorithms whose worst-case convergence times are exponential in the number of agents.
Can agents in a distributed system learn near-optimal correlated behavior despite severely limited information about one another's behavior? We design a distributed control law that imposes limited informational requirements for individual agents and converges to near-optimal correlated behavior.
How does the structure of agent interaction impact a distributed control system's vulnerability to adversarial manipulation? We derive a graph theoretical condition that ensures resilience to adversarial manipulation, and we examine the conditions under which an adversary can manipulate collective behavior in a distributed control system, simply by influencing small subsets of agents.
Advisors/Committee Members: Jason Marden, Eric Frew, Lijun Chen, Dale Lawrence, David Leslie.
Subjects/Keywords: Distributed Control; Game Theory; Aerospace Engineering; Applied Mathematics; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Borowski, H. P. (2016). Performance Tradeoffs in Distributed Control Systems. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/asen_gradetds/127
Chicago Manual of Style (16th Edition):
Borowski, Holly Patricia. “Performance Tradeoffs in Distributed Control Systems.” 2016. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/asen_gradetds/127.
MLA Handbook (7th Edition):
Borowski, Holly Patricia. “Performance Tradeoffs in Distributed Control Systems.” 2016. Web. 27 Feb 2021.
Vancouver:
Borowski HP. Performance Tradeoffs in Distributed Control Systems. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/asen_gradetds/127.
Council of Science Editors:
Borowski HP. Performance Tradeoffs in Distributed Control Systems. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/asen_gradetds/127
University of Colorado
12.
Dibie, Ogheneovo.
Computational Methodologies for Understanding the Dynamics of an Online Community of Educators.
Degree: PhD, Computer Science, 2016, University of Colorado
URL: https://scholar.colorado.edu/csci_gradetds/117
► Online learning communities are becoming an invaluable component of educator instruction. By providing educators with access to teaching resources and best practices shared by…
(more)
▼ Online learning communities are becoming an invaluable component of educator instruction. By providing educators with access to teaching resources and best practices shared by their peers, these communities have been shown to improve the instructional practices of educators and produce increases in student learning. Given the importance of online learning communities to teaching and learning, understanding their dynamics and the factors that influence these dynamics has key implications for educator instruction and student learning. A better understanding of the aforementioned dynamics can also benefit agencies that support these communities.
In this dissertation, I show that sociological network theory can be used to understand the dynamics of online learning communities. Specifically, the phenomena of homophily (tendency of individuals to have social ties with others of similar traits) and triadic closures (tendency of new connections to develop between individuals sharing a common neighbor) can be understood through the sharing and usage behaviors of educators. I also demonstrate how an understanding of the triadic closure process can be used to improve the performance of traditional resource recommendation systems. Finally, I show that social influence may play a significant role in the diffusion and popularity of resources within online learning communities.
Advisors/Committee Members: Tamara Sumner, James Martin, Qin Lv, Lijun Chen, Keith Maull.
Subjects/Keywords: Behavioral economics; Educational data mininng; Information cascades; Recommendation systems; Social network analysis; Databases and Information Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dibie, O. (2016). Computational Methodologies for Understanding the Dynamics of an Online Community of Educators. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/117
Chicago Manual of Style (16th Edition):
Dibie, Ogheneovo. “Computational Methodologies for Understanding the Dynamics of an Online Community of Educators.” 2016. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/csci_gradetds/117.
MLA Handbook (7th Edition):
Dibie, Ogheneovo. “Computational Methodologies for Understanding the Dynamics of an Online Community of Educators.” 2016. Web. 27 Feb 2021.
Vancouver:
Dibie O. Computational Methodologies for Understanding the Dynamics of an Online Community of Educators. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/csci_gradetds/117.
Council of Science Editors:
Dibie O. Computational Methodologies for Understanding the Dynamics of an Online Community of Educators. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/csci_gradetds/117
University of Colorado
13.
Lu, Fenglong.
Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels.
Degree: PhD, Electrical, Computer & Energy Engineering, 2016, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/134
► This dissertation considers a PV system architecture based on series-connected low-voltage ac microinverters (LVACs). In contrast to standard microinverters, LVACs do not require a…
(more)
▼ This dissertation considers a PV system architecture based on series-connected low-voltage ac microinverters (LVACs). In contrast to standard microinverters, LVACs do not require a high step-up conversion stage, resulting in improved efficiency and reduced cost. The dissertation proposes distributed autonomous control of LVACs, which is one of the challenges of this architecture. Each LVAC is operated autonomously by a coupled-loop controller that regulates instantanous output power. Modeling of system dynamics is challenging due to the nonlinear and time-varying nature of the controller. The system is first modeled in a design-oriented manner where a linearized small-signal model is obtained and solved at every operating point under a quasi-static assumption. The modeling approach and the controller design are verified by simulations and experiments on a scaled-down system consisting of three series-connected LVACs, demonstrating appropriate ac voltage sharing across LVACs. In certain cases, such as a low compensator gain, significant total distortion harmonic (THD) is observed in ac line current. Such distortion cannot be predicted by the quasi-static approach. A pre-distortion technique is used to reduce the distortion, and experimental results demonstrate low THD (3~4%) across a wide operating range. A Fourier-expansion based method is then developed to analytically model the system, establish conditions that need to be met in order to avoid distortion, and to find a steady-state solution in terms of current harmonics. This modeling approach is verified by simulations and experiments at multiple operating points, demonstrating accurate predictions of the fundamental and the harmonics of the ac current.
Advisors/Committee Members: Dragan Maksimovic, Li Shang, Khurram K. Afridi, Lijun Chen, Chris A. Deline.
Subjects/Keywords: autonomous; control; low-voltage; microinverter; series-connected; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lu, F. (2016). Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/134
Chicago Manual of Style (16th Edition):
Lu, Fenglong. “Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels.” 2016. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/ecen_gradetds/134.
MLA Handbook (7th Edition):
Lu, Fenglong. “Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels.” 2016. Web. 27 Feb 2021.
Vancouver:
Lu F. Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/ecen_gradetds/134.
Council of Science Editors:
Lu F. Autonomous Control of Series-Connected Low Voltage Micro-Inverters (LVAC) for Photovoltaic Panels. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/ecen_gradetds/134
University of Colorado
14.
Pearre, Ben.
Model-Free in situ Optimisation of Data-Ferried Sensor Networks.
Degree: PhD, Computer Science, 2013, University of Colorado
URL: https://scholar.colorado.edu/csci_gradetds/75
► Given multiple widespread stationary data sources (nodes), an unmanned aircraft (UA) can fly over the sensors and gather the data via a wireless link.…
(more)
▼ Given multiple widespread stationary data sources (nodes), an unmanned aircraft (UA) can fly over the sensors and gather the data via a wireless link. This is known as data ferrying or data muling, and finds application in surveillance and scientific monitoring of remote and inaccessible regions. Desiderata for such a network include competing objectives related to latency, bandwidth, power consumption by the nodes, and tolerance for imperfect environmental information. For any design objective, network performance depends upon the control policies of UA and nodes. A model of such a system permits optimal planning, but is difficult to acquire and maintain. Node locations may not be precisely known. Radio fields are directional and irregular, affected by antenna shape, occlusions, reflections, diffraction, and fading. Complex aircraft dynamics further hamper planning. The conventional approach is to plan trajectories using approximate models, but inaccuracies in the models degrades the quality of the solution. In order to provide an alternative to the process of building and maintaining detailed environmental and system models, we present a model-free learning framework for trajectory optimisation and control of node radio transmission power in UA-ferried sensor networks. We introduce policy representations that are easy both for learning algorithms to manipulate and for off-the-shelf autopilots and radios to work with. We show that the policies can be optimised through direct experience with the environment. To speed and stabilise the policy learning process, we introduce a metapolicy that learns through experience with past scenarios, transferring knowledge to new problems. Algorithms are tested using two radio propagation simulators, both of which produce irregular radio fields not commonly studied in the data-ferrying literature. The first introduces directional antennas and point noise sources. The second additionally includes interaction with terrain. Under the simpler radio simulator, the proposed algorithms generally perform within ~15% of optimal performance after a few dozen trials. Environments produced by the terrain-based simulator are more challenging, with learners generally approaching to within ~40% of optimal performance in similar time. We show that under either simulator even small modelling errors can reduce the optimal planner's performance below that of the proposed learning approach.
Advisors/Committee Members: Timothy X Brown, Eric W. Frew, Lijun Chen, Nikolaus Correll, Michael C. Mozer.
Subjects/Keywords: data ferrying; energy conservation; metalearning; reinforcement learning; trajectory optimisation; unmanned aerial vehicle (UAV); Artificial Intelligence and Robotics; Communication; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pearre, B. (2013). Model-Free in situ Optimisation of Data-Ferried Sensor Networks. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/75
Chicago Manual of Style (16th Edition):
Pearre, Ben. “Model-Free in situ Optimisation of Data-Ferried Sensor Networks.” 2013. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/csci_gradetds/75.
MLA Handbook (7th Edition):
Pearre, Ben. “Model-Free in situ Optimisation of Data-Ferried Sensor Networks.” 2013. Web. 27 Feb 2021.
Vancouver:
Pearre B. Model-Free in situ Optimisation of Data-Ferried Sensor Networks. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/csci_gradetds/75.
Council of Science Editors:
Pearre B. Model-Free in situ Optimisation of Data-Ferried Sensor Networks. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/csci_gradetds/75
University of Colorado
15.
Xu, Minghui.
Theory of Steady-State Superradiance.
Degree: PhD, Physics, 2016, University of Colorado
URL: https://scholar.colorado.edu/phys_gradetds/166
► In this thesis, I describe the theoretical development of the superradiant laser, or laser in the extreme bad-cavity regime. In this regime, the cavity…
(more)
▼ In this thesis, I describe the theoretical development of the superradiant laser, or laser in the extreme bad-cavity regime. In this regime, the cavity decay rate is much greater than the atomic dynamics. The atoms emit photons into the cavity mode superradiantly in steady state. We develop group-theoretic methods that enable us to exactly solve mesoscopic systems with hundreds of atoms. We demonstrate the synchronization of atomic dipoles in steady-state superradiance. With this synchronized system, we propose conditional Ramsey spectroscopy which allows us to observe Ramsey fringes indefinitely, even in the presence of atomic decoherence. Furthermore, we explore manifestations of synchronization in the quantum realm with two superradiant atomic ensembles. We show that two such ensembles exhibit a dynamical phase transition from two disparate oscillators to quantum phase-locked dynamics. Finally, we study the mechanical eect of the light-atom interaction in the steady-state superradiance. We find efficient many-body cooling of atoms. The work described in this thesis lays the theoretical foundation for the superradiant laser and for a potential future of active optical frequency standards.
Advisors/Committee Members: Murray J. Holland, James K. Thompson, Ana Maria Rey, Lijun Chen, Thomas DeGrand.
Subjects/Keywords: Cavity QED; Laser Cooling; Precision Measurement; Quantum Synchronization; Superradiant Laser; Atomic, Molecular and Optical Physics; Quantum Physics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Xu, M. (2016). Theory of Steady-State Superradiance. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/phys_gradetds/166
Chicago Manual of Style (16th Edition):
Xu, Minghui. “Theory of Steady-State Superradiance.” 2016. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/phys_gradetds/166.
MLA Handbook (7th Edition):
Xu, Minghui. “Theory of Steady-State Superradiance.” 2016. Web. 27 Feb 2021.
Vancouver:
Xu M. Theory of Steady-State Superradiance. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/phys_gradetds/166.
Council of Science Editors:
Xu M. Theory of Steady-State Superradiance. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/phys_gradetds/166
University of Colorado
16.
Molnar, Gabor.
Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare.
Degree: PhD, 2014, University of Colorado
URL: https://scholar.colorado.edu/tlen_gradetds/8
► This dissertation includes three multidisciplinary and empirical essays each focusing on a different aspect of broadband Internet access markets in the United States. The…
(more)
▼ This dissertation includes three multidisciplinary and empirical essays each focusing on a different aspect of broadband Internet access markets in the United States. The first essay investigates the effects of the number of Internet Service Providers (ISPs) and their product-type on broadband Internet quality. The second essay conducts an empirical analysis of quality competition and examines how incumbent telcos respond to competition from cable ISPs and other telco ISP market entrants. The third essay investigates whether people are willing to pay more money for real estate located in areas where high-speed broadband is available than for a property that does not offer this amenity. The analyses use data on broadband availability from the National Broadband Map, performance measurement information from the Measuring Broadband America program, and additional public and non-public data sets.
Advisors/Committee Members: Scott J. Savage, Douglas C. Sicker, Lijun Chen, Richard R. Green, Thomas G. Thibodeau.
Subjects/Keywords: broadband; Internet; market structure; quality; real estate; welfare; Computer Sciences; Economics; OS and Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Molnar, G. (2014). Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/tlen_gradetds/8
Chicago Manual of Style (16th Edition):
Molnar, Gabor. “Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare.” 2014. Doctoral Dissertation, University of Colorado. Accessed February 27, 2021.
https://scholar.colorado.edu/tlen_gradetds/8.
MLA Handbook (7th Edition):
Molnar, Gabor. “Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare.” 2014. Web. 27 Feb 2021.
Vancouver:
Molnar G. Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2021 Feb 27].
Available from: https://scholar.colorado.edu/tlen_gradetds/8.
Council of Science Editors:
Molnar G. Three Empirical Essays on United States Broadband Internet Markets: Quality, Competition, and Welfare. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/tlen_gradetds/8
. 
Open Access Theses and Dissertations