Browsing Bilkent Theses by Title
Now showing items 3706-3725 of 5515
-
Panel cointegration analysis to exchange rate determination : monetary model versus Taylor rule model
(Bilkent University, 2009)This thesis examines the validity of the monetary model and the Taylorrule model in determining exchange rates in the long run. The monetary model and the Taylor-rule model are tested using the US dollar exchange rates ... -
Paradigm regained : the Hutchinsonian reconstruction of Trinitarian Protestant Christianity (1724-1806)
(Bilkent University, 2003)Recently, there has been a considerable attempt by historians of eighteenth-century intellectual history to present the religious and conservative side of the Enlightenment thought. Hutchinsonianism, as an eighteenth-century ... -
Paradigms and dynamic change in the Turkish party system
(Bilkent University, 2011)This study argues that, contrary to popular assertions of the Turkish party system as inexplicable or unpatterned or as the persistent manifestation of an essential socio-cultural cleavage, the historic operation of the ... -
The paradox of horror or the value of negative aesthetic experiences
(Bilkent University, 2019-06)David Hume (1982) in Of Tragedy asks the question that how is it possible for audiences to get pleasure from disagreeable emotions? My dissertation addresses the contemporary version of the paradox of tragedy that raises ... -
Parafac-spark: parallel tensor decompositions on spark
(Bilkent University, 2019-08)Tensors are higher order matrices, widely used in many data science applications and scienti c disciplines. The Canonical Polyadic Decomposition (also known as CPD/PARAFAC) is a widely adopted tensor factorization to ... -
Parallel algorithms for the solution of large sparse inequality systems on distributed memory architectures
(Bilkent University, 1998) -
Parallel direct and hybrid methods based on row block partitioning for solving sparse linear systems
(Bilkent University, 2017-08)Solving system of linear equations is a kernel operation in many scienti c and industrial applications. These applications usually give rise to linear systems in which the coe cient matrix is very large and sparse. The ... -
Parallel direct volume rendering of unstructured grids based on object-space decomposition
(Bilkent University, 1997) -
Parallel hardware and software implementations for electromagnetic computations
(Bilkent University, 2005)Multilevel fast multipole algorithm (MLFMA) is an accurate frequencydomain electromagnetics solver that reduces the computational complexity and memory requirement significantly. Despite the advantages of the MLFMA, ... -
Parallel image restoration
(Bilkent University, 2004)In this thesis, we are concerned with the image restoration problem which has been formulated in the literature as a system of linear inequalities. With this formulation, the resulting constraint matrix is an unstructured ... -
Parallel machine scheduling subject to machine availability constraints
(Bilkent University, 2006)Within a planning horizon, machines may become unavailable due to unexpected breakdowns or pre-scheduled activities. A realistic approach in constructing the production schedule should explicitly take into account such ... -
Parallel mapping and circuit partitioning heuristics based on mean field annealing
(Bilkent University, 1992)Moan Field Annealinp; (MFA) aJgoritlim, receñí,ly proposc'd for solving com binatorial optimization problems, combines the characteristics of nenral networks and simulated annealing. In this thesis, MFA is formulated for ... -
Parallel maze routing algorithms on a hypercube multicomputer
(Bilkent University, 1991) -
Parallel processing for progressive refinement radiosity
(Bilkent University, 1993)Progressive refinement radiosity is an increasingly popular method for realistic image synthesis of non-existing environments. The method successfully approximates the light distribution in an environment, however it ... -
A Parallel Prolog emulator
(Bilkent University, 1988)There are various parallel Prolog execution models proposed so far. In this study, an emulator has been developed to test the execution model PPEM. The emulator is used to collect data to evaluate the performance of the ... -
Parallel rendering algorithms for distributed-memory multicomputers
(Bilkent University, 1997) -
Parallel sequence mining on distributed- memory systems
(Bilkent University, 2001)Discovering all the frequent sequences in very large databases is a time consuming task. However, large databases forces to partition the original database into chunks of data to process in main-memory. Most current ... -
Parallel sparse matrix vector multiplication techniques for shared memory architectures
(Bilkent University, 2014)SpMxV (Sparse matrix vector multiplication) is a kernel operation in linear solvers in which a sparse matrix is multiplied with a dense vector repeatedly. Due to random memory access patterns exhibited by SpMxV operation, ... -
Parallel sparse matrix-vector multiplies and iterative solvers
(Bilkent University, 2005)Sparse matrix-vector multiply (SpMxV) operations are in the kernel of many scientific computing applications. Therefore, efficient parallelization of SpMxV operations is of prime importance to scientific computing ... -
Parallel streaming graph partitioning utilizing multilevel framework
(Bilkent University, 2018-08)Graph partitioning is widely used for e cient parallelization of a variety of applications. Streaming graph partitioning is a one pass partitioning solution provided to overcome high computation costs of o ine graph ...
