Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Complexity Theory for Public Policy
Date
2015-08-01
Author
Şener, Hasan Engin
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
132
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/34798
Journal
POLITICAL STUDIES REVIEW
DOI
https://doi.org/10.1111/1478-9302.12100_42
Collections
Department of Political Science and Public Administration, Article
Suggestions
OpenMETU
Core
A Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage
Hareedy, Ahmed; Lanka, Chinmayi; Guo, Nian; Dolecek, Lara (2019-04-01)
© 2018 IEEE.Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are increasingly being considered as a powerful error correction tool for modern dense storage devices. Optimizing NB-LDPC codes to overcome their error floor is one of the main code design challenges facing storage engineers upon deploying such codes in practice. Furthermore, the increasing levels of asymmetry incorporated by the channels underlying modern dense storage systems, e.g., multi-level Flash systems, exa...
A Bayesian Approach to Learning Scoring Systems
Ertekin Bolelli, Şeyda (2015-12-01)
We present a Bayesian method for building scoring systems, which are linear models with coefficients that have very few significant digits. Usually the construction of scoring systems involve manual efforthumans invent the full scoring system without using data, or they choose how logistic regression coefficients should be scaled and rounded to produce a scoring system. These kinds of heuristics lead to suboptimal solutions. Our approach is different in that humans need only specify the prior over what the ...
A Dynamic Systems Theory of epistemic curiosity
Subasi, Ahmet (Elsevier BV, 2019-08-01)
The article offers a unified theory of epistemic curiosity within dynamic systems framework. It focuses on complex motivational dynamics leading to epistemic curiosity preferences, which are complexly determined by a combination of motivational, affective and cognitive sub-systems operating within an epistemic ecology. Each sub-system is delimited and modelled as an interacting dimension of the multidimensional causality of the system. The theory focuses on personal variations rather than population average...
A metrics-based approach to the testing process and testability of object-oriented software systems
Yurga, Tolga; Doğru, Ali Hikmet; Department of Information Systems (2009)
This dissertation investigates the factors that affect testability and testing cost of object- oriented software systems. Developing a software program which eases the testing process by increasing testability is crucial. Also, to assess whether or not the testing effort and cost consumed or planned is adequate or not is another critical matter this dissertation aims to answer by composing a new way to evaluate the links between software design parameters and testing effort via source-based metrics. An auto...
A Three dimensional computer graphics approach in engineering problems
Geler, Utku; Tokdemir, Turgut; Department of Engineering Sciences (1997)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. E. Şener, “A Complexity Theory for Public Policy,”
POLITICAL STUDIES REVIEW
, pp. 438–438, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34798.