Minimum weight directed spanning tree problem with degree, hop and capacity constraints

Download
116488.pdf
2001
Ertem, Dilek
Show full item record
159
views
0
downloads
https://hdl.handle.net/11511/11455
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Minimum Common Outage Probability for the Broadcast Relay Channel
Isikman, Arif Onder; Yüksel Turgut, Ayşe Melda (2011-01-01)
In this paper the broadcast relay channel (BRC) is studied. In the BRC model, the source communicates with two destinations with the help of a single relay. The minimum common outage probability for four different transmission protocols, direct transmission (DT), multihop (MH), path selection (PS) and link combination with path selection (LCPS) is investigated under long-term power constraint for constant rate transmission. In addition, the epsilon-outage rate region for a fixed common outage probability is...
Maximum Loss of Spectrally Negative Lévy Processes
Vardar Acar, Ceren (null; 2018-06-21)
The joint distribution of the maximum loss and the maximum gain is obtained for a spectrally negative L,vy process until the passage time of a given level. Their marginal distributions up to an independent exponential time are also provided. The existing formulas for Brownian motion with drift are recovered using the particular scale functions.
Zero-knowledge range proofs and applications on decentralized constructions
Günsay, Esra; Cenk, Murat; Department of Cryptography (2021-2-15)
Appropriate, effective, and efficient use of cryptographic protocols contributes to many novel advances in real-world privacy-preserving constructions. One of the most important cryptographic protocols is the zero-knowledge proofs. The zero-knowledge proofs have recently gained the utmost importance in terms of decentralized systems, especially in the context of privacy. In many decentralized systems, such as electronic voting, e-cash, e-auctions, or anonymous credentials, the zero-knowledge range proofs ar...
Minimum order linear system identification and parameter estimation with application
Erdoğan, Onur Cem; Balkan, Raif Tuna; Platin, Bülent Emre; Department of Mechanical Engineering (2014)
Design, control, and investigation of complex systems require a tool to understand and model system behavior. This tool is the system identification, which convert the system response to a mathematical formulation. During the identification phase, the utilized model is important to convey system behavior. In this study, a number of minimum order and non-parametric system identification algorithms are implemented for the identification of linear time invariant mechanical systems. For this purpose, impulse re...
Finite-Difference Sensitivity Calculation in Iteratively Solved Problems
Eyi, Sinan (2011-01-01)
In this study, the accuracy of the finite-difference sensitivities is examined in iteratively solved problems. The aim of this research is to reduce the error in the finite difference sensitivity calculations. The norm value of the finite-difference sensitivity error in the state variables is minimized with respect to the finite-difference step size. The optimum finitedifference step size is formulated as a function of the norm values of both convergence error and higher order sensitivities. In order to cal...
Citation Formats
D. Ertem, “Minimum weight directed spanning tree problem with degree, hop and capacity constraints,” Middle East Technical University, 2001.
METU IIS - Integrated Information Service open@metu.edu.tr