Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Bayesian statistics (1)
- Combinatorial Optimization (1)
- Cost-risk analysis (1)
- Critical mobilities (1)
- Economic globalization (1)
-
- Electricity grids (1)
- Heuristic (1)
- Knapsack Problem (1)
- Linearization (1)
- Maritime transportation (1)
- Markowitz model (1)
- Modern portfolio theory (1)
- Non-stationary quantum channels (1)
- Nonlinear Optimization (1)
- Operations Research (1)
- Optimization (1)
- Probabilistic error cancellation (1)
- Quantum Computing (1)
- Social infrastructures and social logistics (1)
- Supply chain dynamics and politics (1)
- Technocapitalism and labor (1)
- Texas (1)
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Cost-Risk Analysis Of The Ercot Region Using Modern Portfolio Theory, Megan Sickinger
Cost-Risk Analysis Of The Ercot Region Using Modern Portfolio Theory, Megan Sickinger
Master's Theses
In this work, we study the use of modern portfolio theory in a cost-risk analysis of the Electric Reliability Council of Texas (ERCOT). Based upon the risk-return concepts of modern portfolio theory, we develop an n-asset minimization problem to create a risk-cost frontier of portfolios of technologies within the ERCOT electricity region. The levelized cost of electricity for each technology in the region is a step in evaluating the expected cost of the portfolio, and the historical data of cost factors estimate the variance of cost for each technology. In addition, there are several constraints in our minimization problem to …
Stability Of Quantum Computers, Samudra Dasgupta
Stability Of Quantum Computers, Samudra Dasgupta
Doctoral Dissertations
Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications such as simulating many-body quantum systems for molecular structure understanding, factorization of large integers, enhance machine learning, and in the process, disrupt industries like telecommunications, material science, pharmaceuticals and artificial intelligence. However, quantum computing's potential is curtailed by noise, further complicated by non-stationary noise parameter distributions across time and qubits. This dissertation focuses on the persistent issue of noise in quantum computing, particularly non-stationarity of noise parameters in transmon processors. It …
Containerization Of Seafarers In The International Shipping Industry: Contemporary Seamanship, Maritime Social Infrastructures, And Mobility Politics Of Global Logistics, Liang Wu
Dissertations, Theses, and Capstone Projects
This dissertation discusses the mobility politics of container shipping and argues that technological development, political-economic order, and social infrastructure co-produce one another. Containerization, the use of standardized containers to carry cargo across modes of transportation that is said to have revolutionized and globalized international trade since the late 1950s, has served to expand and extend the power of international coalitions of states and corporations to control the movements of commodities (shipments) and labor (seafarers). The advent and development of containerization was driven by a sociotechnical imaginary and international social contract of seamless shipping and cargo flows. In practice, this liberal, …
The Precedence-Constrained Quadratic Knapsack Problem, Changkun Guan
The Precedence-Constrained Quadratic Knapsack Problem, Changkun Guan
Honors Theses
This thesis investigates the previously unstudied Precedence-Constrained Quadratic Knapsack Problem (PC-QKP), an NP-hard nonlinear combinatorial optimization problem. The PC-QKP is a variation of the traditional Knapsack Problem (KP) that introduces several additional complexities. By developing custom exact and approximate solution methods, and testing these on a wide range of carefully structured PC-QKP problem instances, we seek to identify and understand patterns that make some cases easier or harder to solve than others. The findings aim to help develop better strategies for solving this and similar problems in the future.