You searched for subject:(Theoretic)
.
Showing records 1 – 30 of
207 total matches.
◁ [1] [2] [3] [4] [5] [6] [7] ▶

Anna University
1.
Deisy C.
Information theoretic based Interactive algorithms for
Feature selection;.
Degree: Information theoretic based Interactive algorithms for
Feature selection, 2015, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/43509
► newline Feature selection is one of the important techniques in data newlinepreprocessing for data mining It reduces the number of features removes newlineirrelevant redundant or…
(more)
▼ newline Feature selection is one of the important
techniques in data newlinepreprocessing for data mining It reduces
the number of features removes newlineirrelevant redundant or noisy
data and brings the immediate effects for newlineapplications
Reducing the dimensionality of the data reduces the size of the
newlinehypothesis space increase classification accuracy and reduce
the computation newlinetime The selection of a small number of
highly predictive features is used to newlineavoid over fitting the
training data The high dimensional data often contains newlinemany
redundant features Both theoretical analysis and empirical evidence
newlineshows that irrelevant and redundant features affect the
speed and accuracy of newlinelearning algorithms and thus should be
eliminated as well newlineFeature selections have also been applied
to small and mediumsized newlinedatasets in order to locate the
most informative features for later use newlineMany feature
selection methods have been developed and are reviewed
newlinecritically in this thesis with particular emphasis on their
current limitations newlineThe leading methods in this field are
presented in a consistent algorithmic newlineFramework newlineThe
choice of selecting particular classification method is based on
newlinethe classification accuracy computation time robustness
scalability and newlineinterpretability newline
reference p142-158.
Advisors/Committee Members: Ramaraj N.
Subjects/Keywords: Information theoretic; Interactive 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):
C, D. (2015). Information theoretic based Interactive algorithms for
Feature selection;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/43509
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
C, Deisy. “Information theoretic based Interactive algorithms for
Feature selection;.” 2015. Thesis, Anna University. Accessed January 17, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/43509.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
C, Deisy. “Information theoretic based Interactive algorithms for
Feature selection;.” 2015. Web. 17 Jan 2021.
Vancouver:
C D. Information theoretic based Interactive algorithms for
Feature selection;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Jan 17].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/43509.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
C D. Information theoretic based Interactive algorithms for
Feature selection;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/43509
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Hawaii – Manoa
2.
Miller, Lisa Jane.
Information theoretic clustering of astrobiology documents.
Degree: 2016, University of Hawaii – Manoa
URL: http://hdl.handle.net/10125/100993
► M.S. University of Hawaii at Manoa 2012.
Astrobiology is a new and highly interdisciplinary field encompassing research from a diversity of disciplines including astrophysics, biology,…
(more)
▼ M.S. University of Hawaii at Manoa 2012.
Astrobiology is a new and highly interdisciplinary field encompassing research from a diversity of disciplines including astrophysics, biology, chemistry, and geology. The AIRFrame project has been funded by NASA as part of an attempt to connect astrobiology research and researchers across disciplinary and institutional boundaries. One of the major tasks in building the AIRFrame system is to identify the major topics of research in astrobiology across disciplines and how existing work fits into these topics. While there are two astrobiology-specific scholarly journals, most researchers choose to publish in journals of their own discipline. In this work, an unsupervised learning method was applied to a corpus of astrobiology-related journal articles originating from a variety of disciplines with a goal of discovering common themes and topics. Unsupervised learning, or clustering, discovers groupings within a dataset without the aid of labeled data samples. The Information Bottleneck method [43] was employed for this project because it has been shown to be one of the most accurate and robust methods of clustering unlabeled multi-dimensional data such as text [40, 4]. Within this same framework, it also is possible to determine the maximum number of meaningful clusters that can be resolved in a finite dataset [41]. This work was the first application of this method to document clustering. Additionally, a new related algorithm was developed for preprocessing data. This new method was evaluated on its ability to indicate which words from the document data are best for use in clustering. These methods were combined to produce a dataset grouped by common topics present in 479 abstracts and full-text articles listed as publications in the NASA Astrobiology Institute 2009 Annual Report. The resulting clusters revealed several themes present in the data and groups of documents that are strongly connected on many levels through different numbers of clusters.
Subjects/Keywords: clustering; information theoretic clustering
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):
Miller, L. J. (2016). Information theoretic clustering of astrobiology documents. (Thesis). University of Hawaii – Manoa. Retrieved from http://hdl.handle.net/10125/100993
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Miller, Lisa Jane. “Information theoretic clustering of astrobiology documents.” 2016. Thesis, University of Hawaii – Manoa. Accessed January 17, 2021.
http://hdl.handle.net/10125/100993.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Miller, Lisa Jane. “Information theoretic clustering of astrobiology documents.” 2016. Web. 17 Jan 2021.
Vancouver:
Miller LJ. Information theoretic clustering of astrobiology documents. [Internet] [Thesis]. University of Hawaii – Manoa; 2016. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/10125/100993.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Miller LJ. Information theoretic clustering of astrobiology documents. [Thesis]. University of Hawaii – Manoa; 2016. Available from: http://hdl.handle.net/10125/100993
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester
3.
Zhou, Jianer (1977 - ); Rudi, Nils.
Essays in interfaces of operations and finance in supply
chains.
Degree: PhD, 2011, University of Rochester
URL: http://hdl.handle.net/1802/14512
► This dissertation is a collection of three essays addressing interface issues of operations and finance in supply chains. In the first essay, we study pricing…
(more)
▼ This dissertation is a collection of three essays
addressing interface issues of operations and finance in supply
chains.
In the first essay, we study pricing of financial hedging
contracts used by firms
to better respond to uncertainty in
product markets. We consider a single-period
problem in which a
firm has only one opportunity for resource acquisition before
demand uncertainty is resolved, and he makes the product pricing
decision based on
the realized demand function. To offset the risk
of his real investment, the firm buys
a tailor-made hedging
contract from an issuer with an underlying payoff partially
correlated with the uncertainty in the product market. We show the
contract effect
by formulating the negotiation process between
both parties in the framework of a
Stackelberg game and price
equilibrium. For each game-theoretic setting, we derive
the
equilibrium solution and present the comparative statics. We also
investigate
the case in which the issuer lays off her risk from
one contract by writing another
contract with a second firm, and
compare contract performance with a benchmark
case in which two
firms trade directly rather than through the issuer.
In the second
essay, we study a supply chain in which a retailer faces a classic
newsvendor problem with a financial constraint on his capacity to
order inventory. To sell more products, the manufacturer teams up
with a bank to offer an
interest-free loan program. We formulate
the interaction between the retailer and
the manufacturer as a
Stackelberg game in which the manufacturer has the dominant pricing
power. Our results indicate that the loan program can
significantly
improve each party's profit. The retailer becomes
more aggressive in ordering when
equilibrium order quantity is low
but demand risk is high. We also investigate open
account
financing in which the manufacturer allows a partial and delayed
payment,
equivalent to a loan to the retailer. Compared with open
account financing, bank
financing improves the entire supply chain
profit. Numerical experiments demonstrate the supply chain
performance under bank financing and indicate that demand
volatility may actually improve contract efficiency. We propose two
contract forms
that coordinate the supply chain of these three
parties.
In the last essay, we continue to consider such a supply
chain in a multi-period
setting. The retailer may be financially
constrained or even distressed in each period. Either the
manufacturer or the bank can offer a loan program and ultimately
bear the retailer's bankruptcy risk. Formulating these two
scenarios in Markov
decision processes with a finite horizon and
employing a Stackelberg game in each
period, we show that the bank
may "under-lend" to the small retailer in bank-led
financing and
that manufacturer-led financing outperforms its counterpart. The
manufacturer, however, may "over-lend" to the retailer, which
raises a concern of
excessive credit risk. Debt relief is a better
alternative to the manufacturer who is
more willing to save…
Subjects/Keywords: Financial hedging; Financial collaboration; Game theoretic application
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, Jianer (1977 - ); Rudi, N. (2011). Essays in interfaces of operations and finance in supply
chains. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/14512
Chicago Manual of Style (16th Edition):
Zhou, Jianer (1977 - ); Rudi, Nils. “Essays in interfaces of operations and finance in supply
chains.” 2011. Doctoral Dissertation, University of Rochester. Accessed January 17, 2021.
http://hdl.handle.net/1802/14512.
MLA Handbook (7th Edition):
Zhou, Jianer (1977 - ); Rudi, Nils. “Essays in interfaces of operations and finance in supply
chains.” 2011. Web. 17 Jan 2021.
Vancouver:
Zhou, Jianer (1977 - ); Rudi N. Essays in interfaces of operations and finance in supply
chains. [Internet] [Doctoral dissertation]. University of Rochester; 2011. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1802/14512.
Council of Science Editors:
Zhou, Jianer (1977 - ); Rudi N. Essays in interfaces of operations and finance in supply
chains. [Doctoral Dissertation]. University of Rochester; 2011. Available from: http://hdl.handle.net/1802/14512

University of Minnesota
4.
Wagner, Kyle.
Examination Of Three Practice Schedules for Single Digit Math.
Degree: PhD, Educational Psychology, 2019, University of Minnesota
URL: http://hdl.handle.net/11299/209020
► The primary goal of this project is to expand and generalize the literature base for interleaved practice. This study compares interleaved practice to repetitive practice…
(more)
▼ The primary goal of this project is to expand and generalize the literature base for interleaved practice. This study compares interleaved practice to repetitive practice and incremental rehearsal within the context of learning single digit math facts. Third grade (n = 34) and fourth grade (n = 40) students learned target single digit math facts in one of three practice schedules. Using a within-subjects counterbalanced and crossed design, students were exposed to three different learning conditions. Comparisons were made regarding accuracy of responses during acquisition trials and retention trials, as well as learning efficiency. Results indicated very few differences between practice conditions regarding acquisition accuracy, increased accuracy during retention trials for interleaved and incremental rehearsal practice, and higher learning efficiency for interleaved practice when compared to incremental rehearsal. Student pretest accuracy moderated effects of practice schedule and opportunities to practice resulting in different outcomes for students with different levels of mastery at the outset of the intervention. This study is the first comparison of interleaved and incremental rehearsal practice, and the results suggest that interleaved practice is the most efficient schedule for drilling math facts.
Subjects/Keywords: incramental rehearsal; information theoretic; interleaved; math; practice
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):
Wagner, K. (2019). Examination Of Three Practice Schedules for Single Digit Math. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/209020
Chicago Manual of Style (16th Edition):
Wagner, Kyle. “Examination Of Three Practice Schedules for Single Digit Math.” 2019. Doctoral Dissertation, University of Minnesota. Accessed January 17, 2021.
http://hdl.handle.net/11299/209020.
MLA Handbook (7th Edition):
Wagner, Kyle. “Examination Of Three Practice Schedules for Single Digit Math.” 2019. Web. 17 Jan 2021.
Vancouver:
Wagner K. Examination Of Three Practice Schedules for Single Digit Math. [Internet] [Doctoral dissertation]. University of Minnesota; 2019. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/11299/209020.
Council of Science Editors:
Wagner K. Examination Of Three Practice Schedules for Single Digit Math. [Doctoral Dissertation]. University of Minnesota; 2019. Available from: http://hdl.handle.net/11299/209020

Georgia Tech
5.
Lim, Yusun.
Game theoretic distributed coordination: drifting environments and constrained communications.
Degree: PhD, Electrical and Computer Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/52986
► The major objective of this dissertation is extending the capabilities of game theoretic distributed control to more general settings. In particular, we are interested in…
(more)
▼ The major objective of this dissertation is extending the capabilities of game
theoretic distributed control to more general settings. In particular, we are interested in drifting environments and/or constrained communications.
The first part of the dissertation concerns slowly varying dynamics, i.e., drifting environments. A standard assumption in game
theoretic learning is a stationary environment, e.g., the game is fixed. We investigate the case of slow variations and show that for sufficiently slow time variations, the limiting behavior “tracks” the stochastically stable states. Since the analysis is regarding Markov processes, the results could be applied to various game
theoretic learning rules. In this research, the results were applied to log-linear learning. A mobile sensor coverage example was tested in both simulation and laboratory experiments.
The second part considers a problem of coordinating team players' actions without any communications in team-based zero-sum games. Generally, some global signalling devices are required for common randomness between players, but communications are very limited or impossible in many practical applications. Instead of learning a one-shot strategy, we let players coordinate a periodic sequence of deterministic actions and put an assumption on opponent's rationality. Since team players' action sequences are periodic and deterministic, common randomness is no longer required to coordinate players. It is proved that if a length of a periodic action sequence is long enough, then opponents with limited rationality cannot recognize its pattern. Because the opponents cannot recognize that the players are playing deterministic actions, the players' behavior looks like a correlated and randomized joint strategy with empirical distribution of their action sequences. Consequently players can coordinate their action sequences without any communications or global signals, and the resulting action sequences have correlated behavior.
Moreover, the notion of micro-players are introduced for efficient learning of long action sequences. Micro-player matching approach provides a new framework that converts the original team-based zero-sum game to a game between micro-players. By introducing a de Bruijn sequence to micro-player matching, we successfully separate the level of opponent's rationality and the size of the game of micro-players. The simulation results are shown to demonstrate the performance of micro-player matching methods.
Lastly, the results of the previous two topics are combined by considering a problem of coordinating actions without communications in drifting environments. More specifically, it is assumed that the opponent player in the team-based zero-sum games tries to adjust its strategy in the set of bounded recall strategies. Then the time-varying opponent's strategy can be considered as a dynamic environment parameter in a coordination game between the team players. Additionally, we develop a human testbed program for further study regarding a human as an…
Advisors/Committee Members: Shamma, Jeff S. (advisor), Wardi, Yorai (committee member), Fekri, Faramarz (committee member), Feron, Eric (committee member), Howard, Ayanna M. (committee member), Bloch, Matthieu R. (committee member).
Subjects/Keywords: Game theoretic learning; Cooperative control; Distributed control
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):
Lim, Y. (2014). Game theoretic distributed coordination: drifting environments and constrained communications. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52986
Chicago Manual of Style (16th Edition):
Lim, Yusun. “Game theoretic distributed coordination: drifting environments and constrained communications.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 17, 2021.
http://hdl.handle.net/1853/52986.
MLA Handbook (7th Edition):
Lim, Yusun. “Game theoretic distributed coordination: drifting environments and constrained communications.” 2014. Web. 17 Jan 2021.
Vancouver:
Lim Y. Game theoretic distributed coordination: drifting environments and constrained communications. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1853/52986.
Council of Science Editors:
Lim Y. Game theoretic distributed coordination: drifting environments and constrained communications. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52986

Indian Institute of Science
6.
Shelke, Sunil Sitaram.
A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction.
Degree: MSc Engg, Faculty of Engineering, 2014, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/2361
► Global warming is currently a major challenge facing the world. There are widespread ongoing efforts in the form of summits, conferences, etc., to find satisfactory…
(more)
▼ Global warming is currently a major challenge facing the world. There are widespread ongoing efforts in the form of summits, conferences, etc., to find satisfactory ways of surmounting this challenge. The basic objective of all such efforts can be summarized as conception and formation of protocols to reduce the pace of global carbon levels. Game theory and mechanism design provide a natural modeling tool for capturing the strategic dynamics involved in global warming related problems. This dissertation explores for the first time the use of voting mechanisms in the context of solving the central problems, namely, allocation of emission caps and reduction quotas to strategic emitting agents (countries).
The contribution of this dissertation is two-fold. The first contribution is to develop an elegant game
theoretic model that accurately captures the strategic interactions among different emitting agents in a global warming setting. This model facilitates a convenient way of exploring a mechanism design approach for solving important allocation problems in the global warming context. The second contribution is to propose and explore a novel approach, based on voting mechanisms, to solve two problems: (1) allocating emission caps and (2) allocating reduction quotas to strategic agents.
Our work investigates the use of voting mechanisms that satisfy four desirable properties:
(1) non-dictatorship, (2) strategy-proofness, (3) efficiency, and (4) anonymity. In particular, we explore the median selection, maximum order statistic selection, and general Kth order statistic selection voting mechanisms. Our results clearly show that only trivial allocations satisfy all the above properties simultaneously. We next investigate the use of voting mechanisms for the dual problem, namely, allocation of emission reductions to emitting agents. Here, we show that non-trivial allocations are possible, however an important property, individual rationality, might be compromised.
The investigations in the thesis bring out certain limitations in applying voting mechanisms that satisfy all the four properties above. Nevertheless, the insights obtained provide valuable guidelines for solving emission allocation related problems in a principled and informed way.
Advisors/Committee Members: Narahari, Y (advisor).
Subjects/Keywords: Game Theory; Carbon Emissions; Global Warming - Game Theoretic Model; Global Warming - Voting Mechanism; Carbon Emissions - Allocation and Reduction; Game Theoretic Approach; Game Theoretic Model; Computer Science
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):
Shelke, S. S. (2014). A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2361
Chicago Manual of Style (16th Edition):
Shelke, Sunil Sitaram. “A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction.” 2014. Masters Thesis, Indian Institute of Science. Accessed January 17, 2021.
http://etd.iisc.ac.in/handle/2005/2361.
MLA Handbook (7th Edition):
Shelke, Sunil Sitaram. “A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction.” 2014. Web. 17 Jan 2021.
Vancouver:
Shelke SS. A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction. [Internet] [Masters thesis]. Indian Institute of Science; 2014. [cited 2021 Jan 17].
Available from: http://etd.iisc.ac.in/handle/2005/2361.
Council of Science Editors:
Shelke SS. A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction. [Masters Thesis]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2361

University of Oulu
7.
Toivonen, T. (Tuukka).
Efficient methods for video coding and processing.
Degree: 2008, University of Oulu
URL: http://urn.fi/urn:isbn:9789514286957
► Abstract This thesis presents several novel improvements to video coding algorithms, including block-based motion estimation, quantization selection, and video filtering. Most of the presented improvements…
(more)
▼ Abstract
This thesis presents several novel improvements to video coding algorithms, including block-based motion estimation, quantization selection, and video filtering. Most of the presented improvements are fully compatible with the standards in general use, including MPEG-1, MPEG-2, MPEG-4, H.261, H.263, and H.264.
For quantization selection, new methods are developed based on the rate-distortion theory. The first method obtains locally optimal frame-level quantization parameter considering frame-wise dependencies. The method is applicable to generic optimization problems, including also motion estimation. The second method, aimed at real-time performance, heuristically modulates the quantization parameter in sequential frames improving significantly the rate-distortion performance. It also utilizes multiple reference frames when available, as in H.264. Finally, coding efficiency is improved by introducing a new matching criterion for motion estimation which can estimate the bit rate after transform coding more accurately, leading to better motion vectors.
For fast motion estimation, several improvements on prior methods are proposed. First, fast matching, based on filtering and subsampling, is combined with a state-of-the-art search strategy to create a very quick and high-quality motion estimation method. The successive elimination algorithm (SEA) is also applied to the method and its performance is improved by deriving a new tighter lower bound and increasing it with a small constant, which eliminates a larger part of the candidate motion vectors, degrading quality only insignificantly. As an alternative, the multilevel SEA (MSEA) is applied to the H.264-compatible motion estimation utilizing efficiently the various available block sizes in the standard.
Then, a new method is developed for refining the motion vector obtained from any fast and suboptimal motion estimation method. The resulting algorithm can be easily adjusted to have the desired tradeoff between computational complexity and rate-distortion performance. For refining integer motion vectors into half-pixel resolution, a new very quick but accurate method is developed based on the mathematical properties of bilinear interpolation.
Finally, novel number theoretic transforms are developed which are best suited for two-dimensional image filtering, including image restoration and enhancement, but methods are developed with a view to the use of the transforms also for very reliable motion estimation.
Subjects/Keywords: block matching; filtering; motion estimation; number theoretic transforms; rate-distortion optimization
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):
Toivonen, T. (. (2008). Efficient methods for video coding and processing. (Doctoral Dissertation). University of Oulu. Retrieved from http://urn.fi/urn:isbn:9789514286957
Chicago Manual of Style (16th Edition):
Toivonen, T (Tuukka). “Efficient methods for video coding and processing.” 2008. Doctoral Dissertation, University of Oulu. Accessed January 17, 2021.
http://urn.fi/urn:isbn:9789514286957.
MLA Handbook (7th Edition):
Toivonen, T (Tuukka). “Efficient methods for video coding and processing.” 2008. Web. 17 Jan 2021.
Vancouver:
Toivonen T(. Efficient methods for video coding and processing. [Internet] [Doctoral dissertation]. University of Oulu; 2008. [cited 2021 Jan 17].
Available from: http://urn.fi/urn:isbn:9789514286957.
Council of Science Editors:
Toivonen T(. Efficient methods for video coding and processing. [Doctoral Dissertation]. University of Oulu; 2008. Available from: http://urn.fi/urn:isbn:9789514286957

Cornell University
8.
Fan, Xiaoqing.
Variable Packet-Error Coding.
Degree: PhD, Electrical and Computer Engineering, 2017, Cornell University
URL: http://hdl.handle.net/1813/59035
► Consider a communication scenario in which a source is encoded into N packets, at most T of which may be arbitrarily altered by an omniscient…
(more)
▼ Consider a communication scenario in which a source is encoded into N packets, at most T of which may be arbitrarily altered by an omniscient adversary. Unlike prior work in coding theory which seeks to optimize only the worst-case performance of the code, in this work, codes are designed to enable the decoder to reproduce the source
subject to a certain distortion constraint when there are no packets errors,
subject to a less stringent distortion constraint when there is one error, etc. The topic of this thesis is to find the trade-off between rate and distortion in such communication scenarios.
A code design based on the Polytope codes is introduced for the binary source with erasure distortion measure and is also proven to have partial optimality property. Moreover, for the point-to-point scenario (N=1 and T=1), both inner bounds and outer bounds are derived for discrete sources with finite alphabet with general distortion measure. For the binary source with Hamming distortion, these two bounds are proven to be the same.
For a Gaussian source with a mean-square error distortion, it is shown that a natural design based on MDS codes is not order-optimal in the rate as the distortion constraint tends to zero, but a hybrid scheme that involves a form of uncoded transmission is. We derive an outer bound which has a constant gap with the inner bound naturally generated by the codes we design, thus fully characterizing the Rate-Distortion region.
Advisors/Committee Members: Wagner, Aaron B. (chair), Tang, Ao (committee member), Suh, Gookwon Edward (committee member).
Subjects/Keywords: Electrical engineering; Error-Correction Codes; Information-theoretic Security; Multiple Descriptions
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):
Fan, X. (2017). Variable Packet-Error Coding. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/59035
Chicago Manual of Style (16th Edition):
Fan, Xiaoqing. “Variable Packet-Error Coding.” 2017. Doctoral Dissertation, Cornell University. Accessed January 17, 2021.
http://hdl.handle.net/1813/59035.
MLA Handbook (7th Edition):
Fan, Xiaoqing. “Variable Packet-Error Coding.” 2017. Web. 17 Jan 2021.
Vancouver:
Fan X. Variable Packet-Error Coding. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1813/59035.
Council of Science Editors:
Fan X. Variable Packet-Error Coding. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/59035

Vanderbilt University
9.
Sun, Bin.
Cohomology of group theoretic Dehn fillings.
Degree: PhD, Mathematics, 2019, Vanderbilt University
URL: http://hdl.handle.net/1803/12295
► This thesis aims to study cohomology of group theoretic Dehn fillings. For sufficiently deep Dehn fillings of hyperbically embedded subgroups, we first prove that Dehn…
(more)
▼ This thesis aims to study cohomology of group
theoretic Dehn fillings. For sufficiently deep Dehn fillings of hyperbically embedded subgroups, we first prove that Dehn filling kernels enjoy a particular free product structure, which is termed the Cohen-Lyndon property. We then combine the Cohen-Lyndon property with the Lyndon-Hochschild-Serre spectral sequence to compute cohomology of Dehn filling quotients. As applications, we estimate cohomological dimensions of Dehn fillings quotients, give criterions for Dehn fillings quotients to be of type FP
infty, and construct useful quotients of acylindrically hyperbolic groups with certain homological properties.
Advisors/Committee Members: Michael Mihalik (committee member), Alexander Olshanskiy (committee member), Robert Scherrer (committee member), Denis Osin (Committee Chair).
Subjects/Keywords: hyperbolically embedded subgroup; group theoretic Dehn filling; group cohomology
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):
Sun, B. (2019). Cohomology of group theoretic Dehn fillings. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/12295
Chicago Manual of Style (16th Edition):
Sun, Bin. “Cohomology of group theoretic Dehn fillings.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed January 17, 2021.
http://hdl.handle.net/1803/12295.
MLA Handbook (7th Edition):
Sun, Bin. “Cohomology of group theoretic Dehn fillings.” 2019. Web. 17 Jan 2021.
Vancouver:
Sun B. Cohomology of group theoretic Dehn fillings. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1803/12295.
Council of Science Editors:
Sun B. Cohomology of group theoretic Dehn fillings. [Doctoral Dissertation]. Vanderbilt University; 2019. Available from: http://hdl.handle.net/1803/12295

Anna University
10.
Vetrivelan P.
Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -.
Degree: Information and communication
engineering, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/54061
Abstract available
Reference p.231-240 and publication
p.241-243
Advisors/Committee Members: Narayanasamy, P.
Subjects/Keywords: Game; Heterogeneous; Theoretic; Weightedranking
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):
P, V. (2014). Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/54061
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
P, Vetrivelan. “Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -.” 2014. Thesis, Anna University. Accessed January 17, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/54061.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
P, Vetrivelan. “Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -.” 2014. Web. 17 Jan 2021.
Vancouver:
P V. Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Jan 17].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/54061.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
P V. Game theoretic and weightedranking approaches for
seamless vertical handover in 4g heterogeneous networks; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/54061
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University
11.
Vetrivelan P.
Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;.
Degree: Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous
networks, 2015, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/49592
► Fourth Generation 4G or Next Generation Wireless Networks newline NGWN enables the integration and interworking of current wireless newlineSystems With 4G NGWNs user demands various…
(more)
▼ Fourth Generation 4G or Next Generation Wireless
Networks newline NGWN enables the integration and interworking of
current wireless newlineSystems With 4G NGWNs user demands various
levels of broadband newlineservices voice data and multimedia
across different wireless networks and newlineoperators for
seamless roaming at vehicular speeds The process of automatic
newlineswitching across different networks without any interruption
is known as newlinevertical handover The existing system lacks
standard handover interfaces and newlinescalability I e it does not
provide seamless roaming across different newlineoperators and
different networks Therefore it has limited QoS during
newlineheterogeneous handover It is inefficient and impractical to
consider received newlinesignal strength RSS as the sole criterion
for heterogeneous handover So newlinemore complex metrics like
momentary cost bandwidth power consumption newlinenetwork
conditions and user preferences are also considered for vertical
newlinehandover decision newlineAlthough the existing network
selection mechanisms ensure the newlinemaximal user s Quality of
Experience QoE by taking into account of user s newlinepreferences
and network conditions the multi dimensional decision problem
newlineis not addressed in the existing system newline
newline
Reference p.131-240
Advisors/Committee Members: Narayanasamy P.
Subjects/Keywords: 4g Heterogeneous; Game theoretic; Information and communication 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):
P, V. (2015). Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/49592
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
P, Vetrivelan. “Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;.” 2015. Thesis, Anna University. Accessed January 17, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/49592.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
P, Vetrivelan. “Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;.” 2015. Web. 17 Jan 2021.
Vancouver:
P V. Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Jan 17].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/49592.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
P V. Game theoretic and weighted ranking Approaches for
seamless Vertical handover in 4g Heterogeneous networks;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/49592
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide
12.
Otumawu-Apreku, Kofi.
Matters of management, sustainability, and efficiency: essays in fisheries.
Degree: 2013, University of Adelaide
URL: http://hdl.handle.net/2440/83828
► This thesis addresses three main issues in fisheries management: monitoring and enforcement; profit efficiency; and factors determining profit efficiency. The overall objective is to provide…
(more)
▼ This thesis addresses three main issues in fisheries management: monitoring and enforcement; profit efficiency; and factors determining profit efficiency. The overall objective is to provide broad theoretical and empirical analysis of fisheries management issues that seek to address sustainability and efficiency questions in the industry. The first issue investigated is whether monitoring and enforcement, as management policy instruments, can lower illegal harvesting and therefore preserve fish stocks. Using a game
theoretic approach the strategic interaction between management and fishers, in the presence of illegal, unreported, and unregulated (IUU), is examined. Results of the analysis show that equilibrium compliance strategies of fishers affect stocks over time. It is further observed that increasing the cost of engaging in illegal activities, through punishment, may be sound economic policy. The second issue examined is efficiency in the South Australian Rock Lobster Fishery. To do this a new approach, in the context of fisheries, is used to overcome the small sample sizes and negative profit challenges inherent in fisheries. Specifically, the Nerlovian and Directional Distance Function methods are used to decompose profits of the fisheries into technical and allocative efficiencies. In addition, the meta-frontier efficiency technique is used to compare the Northern and Southern Zones, the two fisheries in the South Australian Rock Lobster Fishery. Results show that profit inefficiency in this fishery can be largely attributed to allocative inefficiency. Further, it is observed that there is significant variability between efficiency levels in the Northern and Southern Zones. The final issue considered is the natural question of what factors, besides technical and allocative inefficiency, may possibly explain profit inefficiencies in the South Australian Rock Lobster Fishery. To answer this question we investigate the effects of incorporating a fixed input on equilibrium profits and biomass. We first set up a theoretical model with an input that is fixed in the short-run (vessel size) but that can be used with a variable input at sub-optimal capacity. We use this model to get predictions for the impact on profits of exogenous changes in biomass, output price and vessel size. These give us interesting theoretical insights into why it is important to incorporate fixed inputs into profit analysis. We then conduct an empirical investigation to gain an understanding of the effects of these non-discretionary factors on profit efficiency. In particular, we apply a truncated regression with bootstrap methodology to data on individual firm profit efficiency from the South Australian Rock Lobster Fishery. We find empirical support for our predictions that increased biomass and smaller vessel length are associated with higher profits. An additional empirical result is that individual quota management is positively associated with profit efficiency.
Advisors/Committee Members: McWhinnie, Stephanie Faye (advisor), Kvasov, Dmitriy (advisor), Findlay, Christopher Charles (advisor), School of Economics (school).
Subjects/Keywords: violation; compliance; game-theoretic efficiency; Nerlovian; truncation; bootstrap
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):
Otumawu-Apreku, K. (2013). Matters of management, sustainability, and efficiency: essays in fisheries. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/83828
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Otumawu-Apreku, Kofi. “Matters of management, sustainability, and efficiency: essays in fisheries.” 2013. Thesis, University of Adelaide. Accessed January 17, 2021.
http://hdl.handle.net/2440/83828.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Otumawu-Apreku, Kofi. “Matters of management, sustainability, and efficiency: essays in fisheries.” 2013. Web. 17 Jan 2021.
Vancouver:
Otumawu-Apreku K. Matters of management, sustainability, and efficiency: essays in fisheries. [Internet] [Thesis]. University of Adelaide; 2013. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/2440/83828.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Otumawu-Apreku K. Matters of management, sustainability, and efficiency: essays in fisheries. [Thesis]. University of Adelaide; 2013. Available from: http://hdl.handle.net/2440/83828
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
13.
Zavareh, Alireza.
Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing.
Degree: 2012, , School of Engineering
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2132
► This thesis provides an analytical and two numerical methods for solving a parabolic equation of two-dimensional mean curvature flow with some applications. In analytical…
(more)
▼ This thesis provides an analytical and two numerical methods for solving a parabolic equation of two-dimensional mean curvature flow with some applications. In analytical method, this equation is solved by Lie group analysis method, and in numerical method, two algorithms are implemented in MATLAB for solving this equation. A geometric algorithm and a step-wise algorithm; both are based on a deterministic game theoretic representation for parabolic partial differential equations, originally proposed in the genial work of Kohn-Serfaty [1].
+46-767165881
Subjects/Keywords: Mean curvature flow; Lie group analysis; Parabolic equation; Deterministic game theoretic
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):
Zavareh, A. (2012). Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing. (Thesis). , School of Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2132
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zavareh, Alireza. “Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing.” 2012. Thesis, , School of Engineering. Accessed January 17, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2132.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zavareh, Alireza. “Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing.” 2012. Web. 17 Jan 2021.
Vancouver:
Zavareh A. Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing. [Internet] [Thesis]. , School of Engineering; 2012. [cited 2021 Jan 17].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2132.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zavareh A. Analytical and Numerical methods for a Mean curvature flow equation with applications to financial Mathematics and image processing. [Thesis]. , School of Engineering; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2132
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
14.
Zhang, Xin.
An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.
Degree: 2011, RIAN
URL: http://eprints.maynoothuniversity.ie/2564/
► Distributed Interactive Applications (DIAs) enable geographically dispersed users to interact with each other in a virtual environment. A key factor to the success of a…
(more)
▼ Distributed Interactive Applications (DIAs) enable geographically dispersed users
to interact with each other in a virtual environment. A key factor to the success
of a DIA is the maintenance of a consistent view of the shared virtual world for
all the participants. However, maintaining consistent states in DIAs is difficult
under real networks. State changes communicated by messages over such networks
suffer latency leading to inconsistency across the application. Predictive Contract
Mechanisms (PCMs) combat this problem through reducing the number of messages
transmitted in return for perceptually tolerable inconsistency. This thesis examines
the operation of PCMs using concepts and methods derived from information theory.
This information theory perspective results in a novel information model of PCMs
that quantifies and analyzes the efficiency of such methods in communicating the
reduced state information, and a new adaptive multiple-model-based framework for
improving consistency in DIAs.
The first part of this thesis introduces information measurements of user behavior
in DIAs and formalizes the information model for PCM operation. In presenting the
information model, the statistical dependence in the entity state, which makes using
extrapolation models to predict future user behavior possible, is evaluated. The
efficiency of a PCM to exploit such predictability to reduce the amount of network
resources required to maintain consistency is also investigated. It is demonstrated
that from the information theory perspective, PCMs can be interpreted as a form
of information reduction and compression.
The second part of this thesis proposes an Information-Based Dynamic Extrapolation
Model for dynamically selecting between extrapolation algorithms based on
information evaluation and inferred network conditions. This model adapts PCM
configurations to both user behavior and network conditions, and makes the most
information-efficient use of the available network resources. In doing so, it improves
PCM performance and consistency in DIAs.
Subjects/Keywords: Electronic Engineering; Information-Theoretic; Framework for Consistency Maintenance; Distributed Interactive Applications
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):
Zhang, X. (2011). An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. (Thesis). RIAN. Retrieved from http://eprints.maynoothuniversity.ie/2564/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhang, Xin. “An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.” 2011. Thesis, RIAN. Accessed January 17, 2021.
http://eprints.maynoothuniversity.ie/2564/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Xin. “An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.” 2011. Web. 17 Jan 2021.
Vancouver:
Zhang X. An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. [Internet] [Thesis]. RIAN; 2011. [cited 2021 Jan 17].
Available from: http://eprints.maynoothuniversity.ie/2564/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang X. An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. [Thesis]. RIAN; 2011. Available from: http://eprints.maynoothuniversity.ie/2564/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
15.
Yilmaz, Baki Berkay Berkay.
COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION.
Degree: PhD, Electrical and Computer Engineering, 2020, Georgia Tech
URL: http://hdl.handle.net/1853/62810
► Side/Covert channels are asynchronous channels which are not designed nor intended to transfer information. These channels are generated as a byproduct of per-forming legitimate program…
(more)
▼ Side/Covert channels are asynchronous channels which are not designed nor intended to transfer information. These channels are generated as a byproduct of per-forming legitimate program activities on the hardware of computer systems. Although there are many approaches to analyze and estimate their information leakage capacity, they do not consider 1) asynchronous nature of side/covert channels, 2) variability inexecution time of each instruction, and 3) interrupts due to other software activities. Ignoring any of these features can result in underestimating the severity of information leakage, and inaccurate models that can mislead the analysis of these channels. To successfully evaluate the severity of side/covert channels, our research has 1)modeled the side channels considering the dependency among instructions as a consequence of processor pipeline and program functionality, 2) modeled and analyzed an electromagnetic (EM) covert channel, generated due to computer activities, and proposed bounds for the capacity of these channels, 3) introduced a generalized model for covert channels with different sources (i.e. power, cache, EM, etc.) and an assessment methodology to analyze systems against attacks based on these channels, and 4) modeled side channel signals emanated while executing instruction sequences on a processor, which leverages design-stage investigation of new products. The work provides a deep understanding of side/covert channels generated by program activities which can be utilized to secure devices by optimizing their designs to minimize information leakage.
Advisors/Committee Members: Zajic, Alenka (advisor), Prvulovic, Milos (advisor), Bloch, Matthieu R (committee member), Keromytis, Angelos (committee member), Durgin, Gregory D (committee member), Orso, Alessandro (committee member).
Subjects/Keywords: Covert channels; side channels; security; information-theoretic security; modeling; cyber security.
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):
Yilmaz, B. B. B. (2020). COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62810
Chicago Manual of Style (16th Edition):
Yilmaz, Baki Berkay Berkay. “COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION.” 2020. Doctoral Dissertation, Georgia Tech. Accessed January 17, 2021.
http://hdl.handle.net/1853/62810.
MLA Handbook (7th Edition):
Yilmaz, Baki Berkay Berkay. “COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION.” 2020. Web. 17 Jan 2021.
Vancouver:
Yilmaz BBB. COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1853/62810.
Council of Science Editors:
Yilmaz BBB. COVERT/SIDE CHANNEL ANALYSIS, MODELING AND CAPACITY ESTIMATION. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62810

University of Florida
16.
Emigh, Matthew S.
Model-Based Reinforcement Learning Using Information-Theoretic Descriptors.
Degree: PhD, Electrical and Computer Engineering, 2017, University of Florida
URL: https://ufdc.ufl.edu/UFE0050611
► Reinforcement learning is a subfield of machine learning which attempts to quantify the value of each state or state/action combination in a space. For control…
(more)
▼ Reinforcement learning is a subfield of machine learning which attempts to quantify the value of each state or state/action combination in a space. For control problems, the goal is to select actions so as to maximize the expected cumulative rewards experienced by an agent visiting the states. This is a difficult problem for a number of reasons, and is especially so in continuous spaces. We propose a novel framework for exploring and exploiting continuous (infinite) spaces and mitigating the numerous difficulties associated with high dimensional and infinite spaces. We first discuss using metric learning to reduce the dimensionality of a state space and to use in combination with state approximation methods. We also discuss a novel method to compute transition probabilities in continuous state spaces. We use an information-
theoretic learning approach to compute divergences between transition probability probability density functions to quantify uncertainty in the space. We then discuss using divergence and a novel concept called divergence-to-go in a model-based reinforcement learning framework to explore unknown regions of the continuous space. Finally, we propose a unifying framework to tie together the previous work, and suggest directions for future research. ( en )
Advisors/Committee Members: PRINCIPE,JOSE C (committee chair), RANGARAJAN,ANAND (committee member), MCCULLOUGH,SCOTT A (committee member).
Subjects/Keywords: divergence-to-go – information-theoretic-learning – reinforcement-learning
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):
Emigh, M. S. (2017). Model-Based Reinforcement Learning Using Information-Theoretic Descriptors. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0050611
Chicago Manual of Style (16th Edition):
Emigh, Matthew S. “Model-Based Reinforcement Learning Using Information-Theoretic Descriptors.” 2017. Doctoral Dissertation, University of Florida. Accessed January 17, 2021.
https://ufdc.ufl.edu/UFE0050611.
MLA Handbook (7th Edition):
Emigh, Matthew S. “Model-Based Reinforcement Learning Using Information-Theoretic Descriptors.” 2017. Web. 17 Jan 2021.
Vancouver:
Emigh MS. Model-Based Reinforcement Learning Using Information-Theoretic Descriptors. [Internet] [Doctoral dissertation]. University of Florida; 2017. [cited 2021 Jan 17].
Available from: https://ufdc.ufl.edu/UFE0050611.
Council of Science Editors:
Emigh MS. Model-Based Reinforcement Learning Using Information-Theoretic Descriptors. [Doctoral Dissertation]. University of Florida; 2017. Available from: https://ufdc.ufl.edu/UFE0050611

University of Iowa
17.
Antony, Bhavna Josephine.
A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images.
Degree: PhD, Electrical and Computer Engineering, 2013, University of Iowa
URL: https://ir.uiowa.edu/etd/4944
► Spectral-domain optical coherence tomography (SD-OCT) is a non-invasive imaging modality that allows for the quantitative study of retinal structures. SD-OCT has begun to find…
(more)
▼ Spectral-domain optical coherence tomography (SD-OCT) is a non-invasive imaging modality that allows for the quantitative study of retinal structures. SD-OCT has begun to find widespread use in the diagnosis and management of various ocular diseases. While commercial scanners provide limited analysis of a small number of retinal layers, the automated segmentation of retinal layers and other structures within these volumetric images is quite a challenging problem, especially in the presence of disease-induced changes.
The incorporation of a priori information, ranging from qualitative assessments of the data to automatically learned features, can significantly improve the performance of automated methods. Here, a combined machine learning-based approach and graph-
theoretic approach is presented for the automated segmentation of retinal structures in SD-OCT images. Machine-learning based approaches are used to learn textural features from a training set, which are then incorporated into the graph-
theoretic approach. The impact of the learned features on the final segmentation accuracy of the graph-
theoretic approach is carefully evaluated so as to avoid incorporating learned components that do not improve the method. The adaptability of this versatile combination of a machine-learning and graph-
theoretic approach is demonstrated through the segmentation of retinal surfaces in images obtained from humans, mice and canines.
In addition to this framework, a novel formulation of the graph-
theoretic approach is described whereby surfaces with a disruption can be segmented. By incorporating the boundary of the "hole" into the feasibility definition of the set of surfaces, the final result consists of not only the surfaces but the boundary of the hole as well. Such a formulation can be used to model the neural canal opening (NCO) in SD-OCT images, which appears as a 3-D planar hole disrupting the surfaces in its vicinity. A machine-learning based approach was also used here to learn descriptive features of the NCO.
Thus, the major contributions of this work include 1) a method for the automated correction of axial artifacts in SD-OCT images, 2) a combined machine-learning and graph-
theoretic framework for the segmentation of retinal surfaces in SD-OCT images (applied to humans, mice and canines), 3) a novel formulation of the graph-
theoretic approach for the segmentation of multiple surfaces and their shared hole (applied to the segmentation of the neural canal opening), and 4) the investigation of textural markers that could precede structural and functional change in degenerative retinal diseases.
Advisors/Committee Members: Garvin, Mona K. (supervisor).
Subjects/Keywords: graph-theoretic approach; machine learning; retinal segmentation; 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):
Antony, B. J. (2013). A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/4944
Chicago Manual of Style (16th Edition):
Antony, Bhavna Josephine. “A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images.” 2013. Doctoral Dissertation, University of Iowa. Accessed January 17, 2021.
https://ir.uiowa.edu/etd/4944.
MLA Handbook (7th Edition):
Antony, Bhavna Josephine. “A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images.” 2013. Web. 17 Jan 2021.
Vancouver:
Antony BJ. A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images. [Internet] [Doctoral dissertation]. University of Iowa; 2013. [cited 2021 Jan 17].
Available from: https://ir.uiowa.edu/etd/4944.
Council of Science Editors:
Antony BJ. A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images. [Doctoral Dissertation]. University of Iowa; 2013. Available from: https://ir.uiowa.edu/etd/4944
18.
Charles, Janelle K.
Probability distribution estimation using control theoretic smoothing splines.
Degree: Mathematics, 2009, Texas Tech University
URL: http://hdl.handle.net/2346/8443
► In this paper, we examine the relationship between optimal control and statistics. We explore the use of control theoretic smoothing splines in the estimation of…
(more)
▼ In this paper, we examine the relationship between optimal control and statistics. We explore the use of control
theoretic smoothing splines in the estimation of continuous probability distribution functions defined on a finite interval [0,T], where the data is summarized by empirical probability distributions. In particular, we consider the estimation of distributions of the form exp(f(t)), where there is no restriction on the sign of f(t). The construction of the optimal smoothed curve, y(t), is based on the minimization of an integral cost function done through the application of the Hilbert Projection Theorem, which guarantees that a unique minimum exists.
Further spline construction is implemented in approximating cumulative distribution functions where the Hilbert space methodology is no longer applicable. This estimation is based on a process of iterative optimization through dynamic programming.
Advisors/Committee Members: Martin, Clyde F. (Committee Chair), Long, Kevin (committee member), Seo, Byungtae (committee member), Ghosh, Bijoy K. (committee member).
Subjects/Keywords: Theoretic smoothing splines
…later realized that the
control theoretic splines and smoothing splines of statistics shared a… …common
framework. The primary difficulty in the construction of control theoretic splines is… …x5D;,[15] and
significant work in control theoretic splines has been done in [… …of control
2
Texas Tech University, Janelle K. Charles, May 2009
theoretic smoothing… …the process
of constructing the control theoretic smoothing spline when no constraints are…
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):
Charles, J. K. (2009). Probability distribution estimation using control theoretic smoothing splines. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/8443
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Charles, Janelle K. “Probability distribution estimation using control theoretic smoothing splines.” 2009. Thesis, Texas Tech University. Accessed January 17, 2021.
http://hdl.handle.net/2346/8443.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Charles, Janelle K. “Probability distribution estimation using control theoretic smoothing splines.” 2009. Web. 17 Jan 2021.
Vancouver:
Charles JK. Probability distribution estimation using control theoretic smoothing splines. [Internet] [Thesis]. Texas Tech University; 2009. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/2346/8443.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Charles JK. Probability distribution estimation using control theoretic smoothing splines. [Thesis]. Texas Tech University; 2009. Available from: http://hdl.handle.net/2346/8443
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
19.
Zhang, Xin.
An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.
Degree: 2011, RIAN
URL: http://mural.maynoothuniversity.ie/2564/
► Distributed Interactive Applications (DIAs) enable geographically dispersed users to interact with each other in a virtual environment. A key factor to the success of a…
(more)
▼ Distributed Interactive Applications (DIAs) enable geographically dispersed users
to interact with each other in a virtual environment. A key factor to the success
of a DIA is the maintenance of a consistent view of the shared virtual world for
all the participants. However, maintaining consistent states in DIAs is difficult
under real networks. State changes communicated by messages over such networks
suffer latency leading to inconsistency across the application. Predictive Contract
Mechanisms (PCMs) combat this problem through reducing the number of messages
transmitted in return for perceptually tolerable inconsistency. This thesis examines
the operation of PCMs using concepts and methods derived from information theory.
This information theory perspective results in a novel information model of PCMs
that quantifies and analyzes the efficiency of such methods in communicating the
reduced state information, and a new adaptive multiple-model-based framework for
improving consistency in DIAs.
The first part of this thesis introduces information measurements of user behavior
in DIAs and formalizes the information model for PCM operation. In presenting the
information model, the statistical dependence in the entity state, which makes using
extrapolation models to predict future user behavior possible, is evaluated. The
efficiency of a PCM to exploit such predictability to reduce the amount of network
resources required to maintain consistency is also investigated. It is demonstrated
that from the information theory perspective, PCMs can be interpreted as a form
of information reduction and compression.
The second part of this thesis proposes an Information-Based Dynamic Extrapolation
Model for dynamically selecting between extrapolation algorithms based on
information evaluation and inferred network conditions. This model adapts PCM
configurations to both user behavior and network conditions, and makes the most
information-efficient use of the available network resources. In doing so, it improves
PCM performance and consistency in DIAs.
Subjects/Keywords: Electronic Engineering; Information-Theoretic; Framework for Consistency Maintenance; Distributed Interactive Applications
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):
Zhang, X. (2011). An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. (Thesis). RIAN. Retrieved from http://mural.maynoothuniversity.ie/2564/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhang, Xin. “An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.” 2011. Thesis, RIAN. Accessed January 17, 2021.
http://mural.maynoothuniversity.ie/2564/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Xin. “An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications.” 2011. Web. 17 Jan 2021.
Vancouver:
Zhang X. An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. [Internet] [Thesis]. RIAN; 2011. [cited 2021 Jan 17].
Available from: http://mural.maynoothuniversity.ie/2564/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang X. An Information-Theoretic
Framework for Consistency
Maintenance in Distributed
Interactive Applications. [Thesis]. RIAN; 2011. Available from: http://mural.maynoothuniversity.ie/2564/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
20.
Chou, Remi.
Information-theoretic security under computational, bandwidth, and randomization constraints.
Degree: PhD, Electrical and Computer Engineering, 2015, Georgia Tech
URL: http://hdl.handle.net/1853/53837
► The objective of the proposed research is to develop and analyze coding schemes for information-theoretic security, which could bridge a gap between theory an practice.…
(more)
▼ The objective of the proposed research is to develop and analyze coding schemes for information-
theoretic security, which could bridge a gap between theory an practice. We focus on two fundamental models for information-
theoretic security: secret-key generation for a source model and secure communication over the wire-tap channel. Many results for these models only provide existence of codes, and few attempts have been made to design practical schemes. The schemes we would like to propose should account for practical constraints. Specifically, we formulate the following constraints to avoid oversimplifying the problems. We should assume: (1) computationally bounded legitimate users and not solely rely on proofs showing existence of code with exponential complexity in the block-length; (2) a rate-limited public communication channel for the secret-key generation model, to account for bandwidth constraints; (3) a non-uniform and rate-limited source of randomness at the encoder for the wire-tap channel model, since a perfectly uniform and rate-unlimited source of randomness might be an expensive resource. Our work focuses on developing schemes for secret-key generation and the wire-tap channel that satisfy subsets of the aforementioned constraints.
Advisors/Committee Members: Bloch, Matthieu (advisor), Fekri, Faramarz (advisor), Barry, John (committee member), McLaughlin, Steven (committee member), Tetali, Prasad (committee member).
Subjects/Keywords: Information-theoretic security; Information-theory; Coding theory; Polar codes
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):
Chou, R. (2015). Information-theoretic security under computational, bandwidth, and randomization constraints. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53837
Chicago Manual of Style (16th Edition):
Chou, Remi. “Information-theoretic security under computational, bandwidth, and randomization constraints.” 2015. Doctoral Dissertation, Georgia Tech. Accessed January 17, 2021.
http://hdl.handle.net/1853/53837.
MLA Handbook (7th Edition):
Chou, Remi. “Information-theoretic security under computational, bandwidth, and randomization constraints.” 2015. Web. 17 Jan 2021.
Vancouver:
Chou R. Information-theoretic security under computational, bandwidth, and randomization constraints. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1853/53837.
Council of Science Editors:
Chou R. Information-theoretic security under computational, bandwidth, and randomization constraints. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53837

University of South Carolina
21.
Gamel, Heather.
D-Spaces and L-Special Trees.
Degree: PhD, Mathematics, 2011, University of South Carolina
URL: https://scholarcommons.sc.edu/etd/1596
► This dissertation concerns D-spaces and set-theoretic trees. A topological space, X, is a D-space if for every neighbornet of the space there is a…
(more)
▼ This dissertation concerns D-spaces and set-
theoretic trees. A topological space, X, is a D-space if for every neighbornet of the space there is a closed, discrete set from X whose images in the neighbornet are a cover for X. A set-
theoretic tree is a poset where for any element the set of its predecessors is well-ordered.
In this dissertation it is shown that certain L-special trees are D-spaces and some of them are hereditarily so.In particular, let L=[0,1]<super>α</super> with α a countable ordinal be given the lexicographic order. For α < ω+1, the author shows that any L-special tree is hereditarily a D-space. For certain α with ω < α < ω
1 the author shows that any L-special tree is a D-space. For the remaining countable ordinals α, the current progress is shown.
Advisors/Committee Members: Peter J Nyikos.
Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Set Theoretic Topology
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):
Gamel, H. (2011). D-Spaces and L-Special Trees. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1596
Chicago Manual of Style (16th Edition):
Gamel, Heather. “D-Spaces and L-Special Trees.” 2011. Doctoral Dissertation, University of South Carolina. Accessed January 17, 2021.
https://scholarcommons.sc.edu/etd/1596.
MLA Handbook (7th Edition):
Gamel, Heather. “D-Spaces and L-Special Trees.” 2011. Web. 17 Jan 2021.
Vancouver:
Gamel H. D-Spaces and L-Special Trees. [Internet] [Doctoral dissertation]. University of South Carolina; 2011. [cited 2021 Jan 17].
Available from: https://scholarcommons.sc.edu/etd/1596.
Council of Science Editors:
Gamel H. D-Spaces and L-Special Trees. [Doctoral Dissertation]. University of South Carolina; 2011. Available from: https://scholarcommons.sc.edu/etd/1596

University of British Columbia
22.
Li, Chen.
Essays on the inventory theory of money demand.
Degree: PhD, Economics, 2007, University of British Columbia
URL: http://hdl.handle.net/2429/417
► The goal of this dissertation is to examine the theoretical and empirical implications of the inventory theoretic approach to the demand for money. Chapter 1…
(more)
▼ The goal of this dissertation is to examine the theoretical and empirical implications of the inventory theoretic approach to the demand for money.
Chapter 1 reviews the existing inventory theoretic frameworks and empirical money demand literature and provides an overview of this thesis. One of the main conclusions is that the elasticity results from the existing inventory theoretic models are not robust.
Chapter 2 develops a partial equilibrium inventory theoretic model, in which a fixed cost is involved per cash transfer. The key feature is that a firm endogenously chooses the frequency of pay periods, which a household takes as given. When the firm must borrow working capital and pay wages by cheque, I show that both the firm and the household choose to transfer cash every payday only. The model keeps the basic result from the classical inventory theoretic approach that both the income and interest elasticity of money demand are 0.5.
Chapter 3 extends the partial equilibrium model into a general equilibrium framework and shows that the partial equilibrium elasticity results no longer apply in the general equilibrium. First, the income elasticity is 1 in the general equilibrium. Second, the interest elasticity has two values depending on a threshold interest rate. When interest rates are below this threshold, the model is the Cash-In-Advance model with a constant income velocity of money and zero interest elasticity; otherwise the interest elasticity is close to 0.5 and the velocity fluctuates in response to variations in interest rates. Finally, the general equilibrium elasticity results are robust across alternative specifications of the agent's utility.
Chapter 4 calibrates the general equilibrium model to the last 40 years of US data for M1. By constructing a residual measure of money transaction costs from the structural money demand function, I find that a structural break in the transaction costs occurred in 1981 might have been responsible for the instability of long-run money demand. The benefit of this approach is that it can explain this pattern of money demand without appealing to an exogenous structural break in the money demand function.
Subjects/Keywords: money demand; equilibrium; theoretic model
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, C. (2007). Essays on the inventory theory of money demand. (Doctoral Dissertation). University of British Columbia. Retrieved from http://hdl.handle.net/2429/417
Chicago Manual of Style (16th Edition):
Li, Chen. “Essays on the inventory theory of money demand.” 2007. Doctoral Dissertation, University of British Columbia. Accessed January 17, 2021.
http://hdl.handle.net/2429/417.
MLA Handbook (7th Edition):
Li, Chen. “Essays on the inventory theory of money demand.” 2007. Web. 17 Jan 2021.
Vancouver:
Li C. Essays on the inventory theory of money demand. [Internet] [Doctoral dissertation]. University of British Columbia; 2007. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/2429/417.
Council of Science Editors:
Li C. Essays on the inventory theory of money demand. [Doctoral Dissertation]. University of British Columbia; 2007. Available from: http://hdl.handle.net/2429/417

University of Texas – Austin
23.
-1709-7032.
Resource allocation in service and logistics systems.
Degree: PhD, Operations Research & Industrial Engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/47042
► Resource allocation is a problem commonly encountered in strategic planning, where a typical objective is to minimize the associated cost or maximize the resulting profit.…
(more)
▼ Resource allocation is a problem commonly encountered in strategic planning, where a typical objective is to minimize the associated cost or maximize the resulting profit. It is studied analytically and numerically for service and logistics systems in this dissertation, with the major resource being people, services or trucks. First, a staffing level problem is analyzed for large-scale single-station queueing systems. The system manager operates an Erlang-C queueing system with a quality-of-service (QoS) constraint on the probability that a customer is queued. However, in this model, the arrival rate is uncertain in the sense that even the arrival-rate distribution is not completely known to the manager. Rather, the manager has an estimate of the support of the arrival-rate distribution and the mean. The goal is to determine the number of servers needed to satisfy the quality of service constraint. Two models are explored. First, the constraint is enforced on an overall delay probability, given the probability that different feasible arrival-rate distributions are selected. In the second case, the constraint has to be satisfied by every possible distribution. For both problems, asymptotically optimal solutions are developed based on Halfin-Whitt type scalings. The work is followed by a discussion on solution uniqueness with a joint QoS constraint and a given arrival-rate distribution in multi-station systems. Second, an extension to Naor’s analysis on the joining or balking problem in observable M=M=1 queues and its variant in unobservable M=M=1 queues is presented to incorporate parameter uncertainty. The arrival-rate distribution is known to all, but the exact arrival rate is unknown in both cases. The optimal joining strategies are obtained and compared from the perspectives of individual customers, the social optimizer and the profit maximizer, where differences are recognized between the results for systems with deterministic and stochastic arrival rates. Finally, an integrated ordering and inbound shipping problem is formulated for an assembly plant with a large number of suppliers. The objective is to minimize the annual total cost with a static strategy. Potential transportation modes include full truckload shipping and less than truckload shipping, the former of which allows customized routing while the latter does not. A location-based model is applied in search of near-optimal solutions instead of an exact model with vehicle routing, and numerical experiments are conducted to investigate the insights of the problem.
Advisors/Committee Members: Hasenbein, John J. (advisor), Kutanoglu, Erhan (advisor), Bickel, James E. (committee member), Khajavirad, Aida (committee member), Morrice, Douglas J. (committee member).
Subjects/Keywords: Staffing service systems; Parameter uncertainty; Game-theoretic queueing; Inbound shipping
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):
-1709-7032. (2016). Resource allocation in service and logistics systems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/47042
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-1709-7032. “Resource allocation in service and logistics systems.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed January 17, 2021.
http://hdl.handle.net/2152/47042.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-1709-7032. “Resource allocation in service and logistics systems.” 2016. Web. 17 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-1709-7032. Resource allocation in service and logistics systems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/2152/47042.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-1709-7032. Resource allocation in service and logistics systems. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/47042
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Michigan
24.
Pak, Dohyun.
Real option and game theoretic approach to telecommunication network optimization.
Degree: PhD, Industrial engineering, 2005, University of Michigan
URL: http://hdl.handle.net/2027.42/124905
► This dissertation introduces a new method for telecommunications network optimization based on real options and game theory. The model is applied to routing optimization, capacity…
(more)
▼ This dissertation introduces a new method for telecommunications network optimization based on real options and game theory. The model is applied to routing optimization, capacity expansion, and resource allocation problems. First, we study network routing and capacity expansion in a telecommunications network. The real option theory is used to model network delay/blocking under the correlated network demands. This gives an analytical representation for network costs. Based on the costs, we solve optimal network routing by using a global optimization method. And we suggest a new network capacity expansion method that depends on the optimal routing. Our model implies that if the network point-to-point demands have high volatility and negative or low correlations then there is a significant benefit from a complex network structure with multiple nodes, because it has many routing options that have high value in this case. Further, due to the option value in this case there is a high need for network capacity expansion. We also show that the average blocking/delay cost and capacity expansions are concave functions of the demand volatilities. Second, we study wireless telecommunications network systems. We formulate game models for resource allocation in Time Division Multiple Access (TDMA) and Code Division Multiple Access (CDMA) systems by using a mixed strategy equilibrium. In the game models, each user minimizes his/her power and connection costs. The users' activities are analyzed by using simulations. The results imply that the TDMA game model improves the systems' performance significantly regardless of the power cost. However, due to the near-far problem in the CDMA system, the power cost control is critical to maintain its efficient resource allocation.
Advisors/Committee Members: Keppo, Jussi Samuli (advisor).
Subjects/Keywords: Approach; Game Theoretic; Game-theoretic; Network Optimization; Real Option; Telecommunication
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):
Pak, D. (2005). Real option and game theoretic approach to telecommunication network optimization. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124905
Chicago Manual of Style (16th Edition):
Pak, Dohyun. “Real option and game theoretic approach to telecommunication network optimization.” 2005. Doctoral Dissertation, University of Michigan. Accessed January 17, 2021.
http://hdl.handle.net/2027.42/124905.
MLA Handbook (7th Edition):
Pak, Dohyun. “Real option and game theoretic approach to telecommunication network optimization.” 2005. Web. 17 Jan 2021.
Vancouver:
Pak D. Real option and game theoretic approach to telecommunication network optimization. [Internet] [Doctoral dissertation]. University of Michigan; 2005. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/2027.42/124905.
Council of Science Editors:
Pak D. Real option and game theoretic approach to telecommunication network optimization. [Doctoral Dissertation]. University of Michigan; 2005. Available from: http://hdl.handle.net/2027.42/124905
25.
Oueidat, Dahlia.
Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP.
Degree: Docteur es, Sciences et génie des activités à risques, 2016, Paris Sciences et Lettres (ComUE)
URL: http://www.theses.fr/2016PSLEM023
► En vue d’éviter ou de diminuer l’importance des dégâts causés par les accidents majeurs, il convient de modéliser les fonctions et les relations entre les…
(more)
▼ En vue d’éviter ou de diminuer l’importance des dégâts causés par les accidents majeurs, il convient de modéliser les fonctions et les relations entre les composants d’un système industriel. Pour cela, dans cette thèse, on utilise la démarche de modélisation par la méthode STAMP (Systems-Theoretic Accident Model and Processes) pour représenter la structure hiéarchique du système, ainsi que les mécanismes de contrôle nécessaire pour préserver la sécurité d’un processus industriel. Afin de traiter les problématiques liées aux contrôles de la sécurité industrielle, on propose l’utilisation de l’outil de simulation Anylogic. Cet outil, permet modéliser et de simuler le comportement du système en fonction du temps en mode normal et en mode dégradé.L’objectif de ces travaux est donc de proposer une démarche basée à la fois sur la modélisation et la simulation pour analyser les risques et prévenir les accidents d’un site de stockage et distribution de GPL (Gaz Pétrole liquéfié).
System thinking concepts and simulation tools are used to model the risk prevention plan and operational modes designed to enforce safety constraints at a French liquefied petroleum gas (LPG) storage and distribution facility. In France, such facilities are classified and the subject of special legislation and safety regulations. Their supervision is the responsibility of a control and regulatory body. A technological risk and prevention plan is provided, where all the dangerous phenomena likely to occur in addition to the safety control measures are listed in the safety report. Safety is therefore addressed through rules, and control mechanisms ensure that the system complies with safety constraints. Taking this facility as a case study, we use the STAMP theoretical framework together with AnyLogic simulation software to model technical elements and human and organizational behavior. We simulate how the system evolves over time and the strategies that are deployed in a loss of control scenario. The aim is to assess whether the prescribed safety program covers all of the system's phases; namely operations and audits. The results enrich other research that focuses on the contribution of system dynamics to risk analysis and accident prevention.
Advisors/Committee Members: Garbolino, Emmanuel (thesis director), Guarnieri, Franck (thesis director).
Subjects/Keywords: Anylogic; STAMP (Systems-Theoretic Accident Model and Processes); Analyse des risques; Accident; GPL; STAMP (Systems-Theoretic Accident Model and Processes); Risk analysis; LPG plant; Anylogic; Accident; 650
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):
Oueidat, D. (2016). Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2016PSLEM023
Chicago Manual of Style (16th Edition):
Oueidat, Dahlia. “Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP.” 2016. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed January 17, 2021.
http://www.theses.fr/2016PSLEM023.
MLA Handbook (7th Edition):
Oueidat, Dahlia. “Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP.” 2016. Web. 17 Jan 2021.
Vancouver:
Oueidat D. Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2016. [cited 2021 Jan 17].
Available from: http://www.theses.fr/2016PSLEM023.
Council of Science Editors:
Oueidat D. Apport de la modélisation et de la simulation à l'analyse des risques et la prévention des accidents d'un site de stockage de GPL : Evaluating LPG storage and distribution safety operations plan with a simulation tool and providing recommendations based on STAMP. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2016. Available from: http://www.theses.fr/2016PSLEM023
26.
Salina, Fernando Vernal.
Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação.
Degree: PhD, Física Aplicada, 2007, University of São Paulo
URL: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-06042011-091943/
;
► Nesta tese é apresentado um novo método de reconstrução de imagens, por tomografia de transmissão, de projeções sujeitas a ruído na contagem de fótons. O…
(more)
▼ Nesta tese é apresentado um novo método de reconstrução de imagens, por tomografia de transmissão, de projeções sujeitas a ruído na contagem de fótons. O método de reconstrução selecionado utiliza a técnica POCS (Projections Onto Convex Sets). A estimação das projeções originais a partir das observações ruidosas se dá por meio de quatro métodos: a) estimação utilizando o critério MAP (Maximum a Posteriori); b) filtragem nos coeficientes wavelets das projeções ruidosas; c) aplicação do filtro de Wiener pontual e d) aplicação do filtro de Goodman-Belsher. É apresentado o resultado da reconstrução após a estimação das projeções, mostrando o ISNR (Improvement Signal-to-Noise Ratio) entre as imagens reconstruídas, a partir das projeções ruidosas, com a técnica POCS, estimando as projeções e sem a realização da estimação. Foram utilizados, para reconstrução tomográfica, projeções de corpos de prova obtidos por meio de simulação e também projeções obtidas experimentalmente no minitomógrafo do CNPDIA - EMBRAPA. O uso de estimação sobre as projeções ruidosas mostrou-se eficaz para melhorar a relação sinal-ruído na imagem final, pois esse pré-processamento faz com que os conjuntos impostos pelas projeções sejam mais restritivos. Deve-se observar que a melhoria das imagens obtidas com o uso de filtragem das projeções é obtida com uma relação custo-benefício bastante baixa, pois a maior parte do custo computacional está na fase de reconstrução das imagens.
In this thesis is pesented a new method for image reconstruction, by transmission tomography, for projections under noise in the counting of photons. The selected method of reconstruction uses the POCS (Projections Onto Convex Sets) technique. The estimation of the original projections from the noisy projections observed is performed through four methods: a) estimation using the MAP (Maximum a Posteriori) criteria; b) through of filtering of the wavelets coefficients of the noisy projections; c) using the pointwise Wiener filter and d) using the Goodman-Belsher filter. We present the result of reconstruction after projection estimation, showing the ISNR (Improvement Signal-to-Noise Ratio) between the reconstructed images on noisy projections, using POCS technique after the estimated projections and without this estimation. We use, for tomographic reconstruction, test body projections obtained through simulation and also projections obtained experimentally in the minitomograph scanner of CNPDIA-EMBRAPA. The use of estimation on noisy projections demonstrated to be efficient in improving the signalnoise ratio in the final image, since this pre-processing makes the sets that projections more restrictive. We should observe that the use of projection filtering is obtained with a cost-benefit ratio rather low, since the largest part of the computational effort is in the image reconstruction phase.
Advisors/Committee Members: Mascarenhas, Nelson Delfino D\'Ávila, Tannus, Alberto.
Subjects/Keywords: Computadorized Tomography; Estimation Theoretic; POCS; POCS; Reconstrução Tomográfica; Teoria da Estimação; Tomografia Computadorizada; Tomographic Reconstruction
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):
Salina, F. V. (2007). Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/76/76132/tde-06042011-091943/ ;
Chicago Manual of Style (16th Edition):
Salina, Fernando Vernal. “Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação.” 2007. Doctoral Dissertation, University of São Paulo. Accessed January 17, 2021.
http://www.teses.usp.br/teses/disponiveis/76/76132/tde-06042011-091943/ ;.
MLA Handbook (7th Edition):
Salina, Fernando Vernal. “Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação.” 2007. Web. 17 Jan 2021.
Vancouver:
Salina FV. Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação. [Internet] [Doctoral dissertation]. University of São Paulo; 2007. [cited 2021 Jan 17].
Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-06042011-091943/ ;.
Council of Science Editors:
Salina FV. Métodos híbridos para reconstrução tomográfica de imagens usando POCS e teoria da estimação. [Doctoral Dissertation]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-06042011-091943/ ;

University of Alberta
27.
Shuai, Zhisheng.
A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks.
Degree: PhD, Department of Mathematical and Statistical
Sciences, 2010, University of Alberta
URL: https://era.library.ualberta.ca/files/hd76s0901
► For coupled systems of differential equations on networks, a graph-theoretic approach to the construction of Lyapunov functions is systematically developed in this thesis. Kirchhoff’s Matrix-Tree…
(more)
▼ For coupled systems of differential equations on
networks, a graph-theoretic approach to the construction of
Lyapunov functions is systematically developed in this thesis.
Kirchhoff’s Matrix-Tree Theorem in graph theory plays an essential
role in the approach’s development. The approach is successfully
applied to several coupled systems well-known in the literature to
demonstrate its applicability and effectiveness.
Subjects/Keywords: A graph-theoretic approach; coupled systems; Lyapunov functions; global stability; Matrix-Tree Theorem; 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):
Shuai, Z. (2010). A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/hd76s0901
Chicago Manual of Style (16th Edition):
Shuai, Zhisheng. “A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks.” 2010. Doctoral Dissertation, University of Alberta. Accessed January 17, 2021.
https://era.library.ualberta.ca/files/hd76s0901.
MLA Handbook (7th Edition):
Shuai, Zhisheng. “A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks.” 2010. Web. 17 Jan 2021.
Vancouver:
Shuai Z. A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks. [Internet] [Doctoral dissertation]. University of Alberta; 2010. [cited 2021 Jan 17].
Available from: https://era.library.ualberta.ca/files/hd76s0901.
Council of Science Editors:
Shuai Z. A graph-theoretic approach to the construction of Lyapunov
functions for coupled systems on networks. [Doctoral Dissertation]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/hd76s0901
28.
Kalliris, Konstantinos.
Οργανωμένο έγκλημα και διαφθορά.
Degree: 2018, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)
URL: http://hdl.handle.net/10442/hedi/44353
► The relation between organized crime and corruption is widely documented. Quite often, corruption is included in the definition of organized crime as one of the…
(more)
▼ The relation between organized crime and corruption is widely documented. Quite often, corruption is included in the definition of organized crime as one of the most common activities of organized criminal groups. This thesis offers an interpretation of the strategic choice of criminal organizations to resort to corrupting state officials and civil servants. The game-theoretic approach adopted looks at corruption as a rational choice made by two ‘players’: criminal organizations and states. Corruption emerges as the least costly option when the power balance between the two is maintained. In the context of this theory, a description of both organized crime and corruption is attempted. Organized criminality is described as a type of unlawful activity that can be distinguished from similar collective criminal activities by reference to its tendency to establish monopolies. Understanding the nature of this criminal monopoly is crucial for an accurate description of the powerful position from which criminal organizations ‘negotiate’ with the state. Corruption is described as an instance of cooperation to the end of mutually advancing each party’s interests - that is, a phenomenon that extends beyond financial transactions and the relationship between citizens and the state. Once the crucial concepts and the proposed theory of cooperation are properly analysed, they are tested empirically by means of a hybrid historic-comparative method, which combines the methods of agreement and difference. The cases examined in the context of the former method are the Sicilian Mafia, the Japanese Jakuza and Chicago’s Outfit. Gangs are employed as a ‘control case’, since they share many characteristics with criminal organizations but lack the tendency to monopolise their area of interest. The confirmation of the theoretical findings of the thesis is followed by a critical review of the current legislation and policy recommendations.
Η σχέση ανάμεσα στο οργανωμένο έγκλημα και τη διαφθορά είναι ευρύτατα καταγεγραμμένη. Συχνά, η διαφθορά συμπεριλαμβάνεται στον ορισμό του οργανωμένου εγκλήματος ως μία από τις συνηθέστατες δραστηριότητες των εγκληματικών οργανώσεων. Αυτή η διατριβή προσφέρει μία ερμηνεία της στρατηγικής επιλογής των εγκληματικών οργανώσεων να καταφεύγουν στη διαφθορά κρατικών αξιωματούχων και δημοσίων λειτουργών. Η παιγνιοθεωρητική προσέγγιση που προκρίνεται αντιμετωπίζει τη διαφθορά ως μία ορθολογική επιλογή από τους δύο εμπλεκόμενους «παίκτες»: τις εγκληματικές οργανώσεις και τα κράτη. Η διαφθορά αναδεικνύεται ως η λιγότερο επιζήμια επιλογή όταν η σχέση ισχύος ανάμεσά τους είναι σχετικά ισορροπημένη. Στο πλαίσιο της ανάπτυξης αυτής της θεωρίας επιχειρείται η περιγραφή των δύο κρίσιμων εννοιών, ήτοι του οργανωμένου εγκλήματος και της διαφθοράς. Οι εγκληματικές οργανώσεις περιγράφονται ως ένας φαινότυπος παραβατικής δράσης που διακρίνεται από παρεμφερείς ομαδικές δραστηριότητες με βασικό κριτήριο το μονοπωλιακό χαρακτήρα της. Η κατανόηση αυτού του χαρακτήρα είναι κρίσιμη για την περιγραφή της θέσης ισχύος από την οποία το…
Subjects/Keywords: Οργανωμένο έγκλημα; Διαφθορά, Εγκληματολογικές προσεγγίσεις της; Θεωρία παιγνίων; Organised crime; Corruption; Game theoretic approach
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):
Kalliris, K. (2018). Οργανωμένο έγκλημα και διαφθορά. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/44353
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kalliris, Konstantinos. “Οργανωμένο έγκλημα και διαφθορά.” 2018. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed January 17, 2021.
http://hdl.handle.net/10442/hedi/44353.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kalliris, Konstantinos. “Οργανωμένο έγκλημα και διαφθορά.” 2018. Web. 17 Jan 2021.
Vancouver:
Kalliris K. Οργανωμένο έγκλημα και διαφθορά. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/10442/hedi/44353.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kalliris K. Οργανωμένο έγκλημα και διαφθορά. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. Available from: http://hdl.handle.net/10442/hedi/44353
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University
29.
Zhao, Li.
Essays on the Econometrics of Discrete Games of Complete Information.
Degree: PhD, Economics, 2016, Vanderbilt University
URL: http://hdl.handle.net/1803/10559
► This dissertation considers questions in the econometrics of discrete games of complete information. Chapter 1 proposes an econometric framework that explicitly models the selection of…
(more)
▼ This dissertation considers questions in the econometrics of discrete games of complete information. Chapter 1 proposes an econometric framework that explicitly models the selection of equilibria as a discrete choice model. Such framework could achieve point identification. A simulation based approach is proposed to estimate the structural model. Chapter 2 discusses the relationship among the three types of partial identification approaches available in the literature. I show a modified version of bound estimation is equivalent to the sensitive analysis approach and the sharp identification approach in the sense that they draw inference on the same identified set. Chapter 3 studies identification and estimation of discrete games in large networks. Moment inequalities on choice probabilities of subnetworks are constructed to partially identify the model. Monte Carlo studies are conducted in Chapter 1 and 3 to evaluate the performance of approaches developed in this dissertation. Two applications are considered, Chapter 1 contains a study on the entry competition in the home improvement industry; Chapter 3 studies peer effects on smoking in friend networks.
Advisors/Committee Members: Federico H. Gutierrez (committee member), Yanqin Fan (committee member), Alejandro Molnar (committee member), Tong Li (Committee Chair).
Subjects/Keywords: social network; empirical game-theoretic analysis; strategic interaction; peer effect; entry competition; partial identification
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):
Zhao, L. (2016). Essays on the Econometrics of Discrete Games of Complete Information. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10559
Chicago Manual of Style (16th Edition):
Zhao, Li. “Essays on the Econometrics of Discrete Games of Complete Information.” 2016. Doctoral Dissertation, Vanderbilt University. Accessed January 17, 2021.
http://hdl.handle.net/1803/10559.
MLA Handbook (7th Edition):
Zhao, Li. “Essays on the Econometrics of Discrete Games of Complete Information.” 2016. Web. 17 Jan 2021.
Vancouver:
Zhao L. Essays on the Econometrics of Discrete Games of Complete Information. [Internet] [Doctoral dissertation]. Vanderbilt University; 2016. [cited 2021 Jan 17].
Available from: http://hdl.handle.net/1803/10559.
Council of Science Editors:
Zhao L. Essays on the Econometrics of Discrete Games of Complete Information. [Doctoral Dissertation]. Vanderbilt University; 2016. Available from: http://hdl.handle.net/1803/10559

Jawaharlal Nehru University
30.
Jana, Debnarayan.
Numerical and Field theoretic studies in low dimensional
condensed matter physics; -.
Degree: English, 1997, Jawaharlal Nehru University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/16997
None
Bibliography, Appendices Pages are in the end of
each chapter.
Advisors/Committee Members: Samuel, Joseph.
Subjects/Keywords: Condensed; Dimensional; Field theoretic; Numerical; 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):
Jana, D. (1997). Numerical and Field theoretic studies in low dimensional
condensed matter physics; -. (Thesis). Jawaharlal Nehru University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/16997
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Jana, Debnarayan. “Numerical and Field theoretic studies in low dimensional
condensed matter physics; -.” 1997. Thesis, Jawaharlal Nehru University. Accessed January 17, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/16997.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Jana, Debnarayan. “Numerical and Field theoretic studies in low dimensional
condensed matter physics; -.” 1997. Web. 17 Jan 2021.
Vancouver:
Jana D. Numerical and Field theoretic studies in low dimensional
condensed matter physics; -. [Internet] [Thesis]. Jawaharlal Nehru University; 1997. [cited 2021 Jan 17].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16997.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Jana D. Numerical and Field theoretic studies in low dimensional
condensed matter physics; -. [Thesis]. Jawaharlal Nehru University; 1997. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16997
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] [6] [7] ▶
.