Дисертації з теми "Computer program theory"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Computer program theory".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Khamiss, A.-A. M. "Program construction in Martin-Lof's theory of types." Thesis, University of Essex, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373210.
Повний текст джерелаJervis, Clive Andrew. "A theory of program correctness with three valued logic." Thesis, University of Leeds, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277297.
Повний текст джерелаIreland, Andrew. "Mechanization of program construction in Martin-Loef's theory of types." Thesis, University of Stirling, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.236080.
Повний текст джерелаDuong, Chay N. "A study of new-wave theory and an implementation of the new wave theory into GTSELOS computer program." Thesis, Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/21492.
Повний текст джерелаNewlands, D. A., and mikewood@deakin edu au. "Structured development of an asynchronous forth processor using trace theory." Deakin University. School of Sciences, 1989. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20050915.140144.
Повний текст джерелаDoshi, Vishal D. (Vishal Devendra). "Functional compression : theory and application." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/43038.
Повний текст джерелаIncludes bibliographical references (p. 75-77).
We consider the problem of functional compression. The objective is to separately compress possibly correlated discrete sources such that an arbitrary deterministic function of those sources can be computed given the compressed data from each source. This is motivated by problems in sensor networks and database privacy. Our architecture gives a quantitative definition of privacy for database statistics. Further, we show that it can provide significant coding gains in sensor networks. We consider both the lossless and lossy computation of a function. Specifically, we present results of the rate regions for three instances of the problem where there are two sources: 1) lossless computation where one source is available at the decoder, 2) under a special condition, lossless computation where both sources are separately encoded, and 3) lossy computation where one source is available at the decoder. Wyner and Ziv (1976) considered the third problem for the special case f(X, Y) = X and derived a rate distortion function. Yamamoto (1982) extended this result to a general function. Both of these results are in terms of an auxiliary random variable. Orlitsky and Roche (2001), for the zero distortion case, gave this variable a precise interpretation in terms of the properties of the characteristic graph; this led to a particular coding scheme. We extend that result by providing an achievability scheme that is based on the coloring of the characteristic graph. This suggests a layered architecture where the functional layer controls the coloring scheme, and the data layer uses existing distributed source coding schemes. We extend this graph coloring method to provide algorithms and rates for all three problems.
by Vishal D. Doshi.
S.M.
Lee, Kathryn Green Melville Joel G. "Comparison of the theory, application, and results of one- and two- dimensional flow models." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Summer/Theses/LEE_KATHRYN_42.pdf.
Повний текст джерелаGhica, Dan R. "A games-based foundation for compositional software model checking /." Oxford : Oxford University Computing Laboratory, 2002. http://web.comlab.ox.ac.uk/oucl/publications/tr/rr-02-13.html.
Повний текст джерелаHeyer, Tim. "Semantic Inspection of Software Artifacts From Theory to Practice." Doctoral thesis, Linköping : Univ, 2001. http://www.ep.liu.se/diss/science_technology/07/25/index.html.
Повний текст джерелаRushton, Matthew V. "Static and dynamic type systems." Diss., Connect to the thesis Connect to the thesis, 2004. http://hdl.handle.net/10066/1483.
Повний текст джерелаWeissenbacher, Georg. "Program analysis with interpolants." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:6987de8b-92c2-4309-b762-f0b0b9a165e6.
Повний текст джерелаMerten, Samuel A. "A Verified Program for the Enumeration of All Maximal Independent Sets." Ohio University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1479829000576398.
Повний текст джерелаBicker, Marcelle M. "A toolkit for uncertainty reasoning and representation using fuzzy set theory in PROLOG expert systems /." Online version of thesis, 1987. http://hdl.handle.net/1850/10294.
Повний текст джерелаEscalante, Osuna Carlos. "Estimating the cost of GraphLog queries." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0002/NQ32743.pdf.
Повний текст джерелаMajakwara, Jacob. "Application of multiserver queueing to call centres." Thesis, Rhodes University, 2010. http://hdl.handle.net/10962/d1015461.
Повний текст джерелаBacak, Gökşen Ufuktepe Ünal. "Vertex Coloring of A Graph/." [s.l.] : [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/matematik/T000416.pdf.
Повний текст джерелаBeşeri, Tina Ufuktepe Ünal. "Edge Coloring of A Graph/." [s.l.]: [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/matematik/T000439.pdf.
Повний текст джерелаKatirai, Hooman. "A theory and toolkit for the mathematics of privacy : methods for anonymizing data while minimizing information loss." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34526.
Повний текст джерелаIncludes bibliographical references (leaves 85-86).
Privacy laws are an important facet of our society. But they can also serve as formidable barriers to medical research. The same laws that prevent casual disclosure of medical data have also made it difficult for researchers to access the information they need to conduct research into the causes of disease. But it is possible to overcome some of these legal barriers through technology. The US law known as HIPAA, for example, allows medical records to be released to researchers without patient consent if the records are provably anonymized prior to their disclosure. It is not enough for records to be seemingly anonymous. For example, one researcher estimates that 87.1% of the US population can be uniquely identified by the combination of their zip, gender, and date of birth - fields that most people would consider anonymous. One promising technique for provably anonymizing records is called k-anonymity. It modifies each record so that it matches k other individuals in a population - where k is an arbitrary parameter. This is achieved by, for example, changing specific information such as a date of birth, to a less specific counterpart such as a year of birth.
(cont.) Previous studies have shown that achieving k-anonymity while minimizing information loss is an NP-hard problem; thus a brute force search is out of the question for most real world data sets. In this thesis, we present an open source Java toolkit that seeks to anonymize data while minimizing information loss. It uses an optimization framework and methods typically used to attack NP-hard problems including greedy search and clustering strategies. To test the toolkit a number of previously unpublished algorithms and information loss metrics have been implemented. These algorithms and measures are then empirically evaluated using a data set consisting of 1000 real patient medical records taken from a local hospital. The theoretical contributions of this work include: (1) A new threat model for privacy - that allows an adversary's capabilities to be modeled using a formalism called a virtual attack database. (2) Rationally defensible information loss measures - we show that previously published information loss measures are difficult to defend because they fall prey to what is known as the "weighted indexing problem." To remedy this problem we propose a number of information-loss measures that are in principle more attractive than previously published measures.
(cont.) (3) Shown that suppression and generalization - two concepts that were previously thought to be distinct - are in fact the same thing; insofar as each generalization can be represented by a suppression and vice versa. (4) We show that Domain Generalization Hierarchies can be harvested to assist the construction of a Bayesian network to measure information loss. (5) A database can be thought of as a sub-sample of a population. We outline a technique that allows one to predict k-anonymity in a population. This allows us, under some conditions, to release records that match fewer than k individuals in a database while still achieving k-anonymity against an adversary according to some probability and confidence interval. While we have chosen to focus our thesis on the anonymization of medical records, our methodologies, toolkit and command line tools are equally applicable to any tabular data such as the data one finds in relational databases - the most common type of database today.
by Hooman Katirai.
S.M.
Jami, Valentina. "Development of Computer Program for Wind Resource Assessment, Rotor Design and Rotor Performance." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1513703072278665.
Повний текст джерелаShah, Vijay Pravin. "An advanced signal processing toolkit for Java applications." Master's thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-11102002-141018.
Повний текст джерелаScholz, Jason B. "Real-time performance estimation and optimizaton of digital communication links /." Title page, contents and abstract only, 1992. http://web4.library.adelaide.edu.au/theses/09PH/09phs368.pdf.
Повний текст джерелаSalim, Hamid M. "Cyber safety : a systems thinking and systems theory approach to managing cyber security risks." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/90804.
Повний текст джерелаThesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
93
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 148-156).
If we are to manage cyber security risks more effectively in today's complex and dynamic Web 2.0 environment, then a new way of thinking is needed to complement traditional approaches. According to Symantec's 2014 Internet Security Threat Report, in 2012 more than ten million identities that included real names, dates of birth, and social security were exposed by a single breach. In 2013 there were eight breaches that each exposed over ten million identities. These breaches were recorded despite the fact that significant resources are expended, on managing cyber security risks each year by businesses and governments. The objective of this thesis was twofold. The first objective was to understand why traditional approaches for managing cyber security risks were not yielding desired results. Second, propose a new method for managing cyber security risks more effectively. The thesis investigated widely used approaches and standards, and puts forward a method based on the premise that traditional technology centric approaches have become ineffective on their own. This lack of efficacy can be attributed primarily to the fact that, Web 2.0 is a dynamic and a complex socio-technical system that is continuously evolving. This thesis proposes a new method for managing cyber security risks based on a model for accident or incident analysis, used in Systems Safety field. The model is called System-Theoretic Accident Model and Processes (STAMP). It is rooted in Systems Thinking and Systems Theory. Based on a case study specifically written for this thesis, the largest cyber-attack reported in 2007 on a major US based retailer, is analyzed using the STAMP model. The STAMP based analysis revealed insights both at systemic and detailed level, which otherwise would not be available, if traditional approaches were used for analysis. Further, STAMP generated specific recommendations for managing cyber security risks more effectively.
by Hamid M. Salim.
S.M. in Engineering and Management
S.M.
Kim, Pilho. "E-model event-based graph data model theory and implementation /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29608.
Повний текст джерелаCommittee Chair: Madisetti, Vijay; Committee Member: Jayant, Nikil; Committee Member: Lee, Chin-Hui; Committee Member: Ramachandran, Umakishore; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Ornelas, Gilbert. "Set-valued extensions of fuzzy logic classification theorems /." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2007. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.
Повний текст джерелаLin, Chia-Yang. "Conceptual model builder." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2708.
Повний текст джерелаGedela, Naga Venkata Praveen babu. "MEASUREMENT AND ITS HISTORICAL CONTEXT." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1226037175.
Повний текст джерелаKaiser, Alexander. "Monotonicity in shared-memory program verification." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:1d16b4b5-524a-40db-b7bf-062374f8679c.
Повний текст джерелаFaitelson, David. "Program synthesis from domain specific object models." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:0c5a992e-dad4-435c-a576-e3ed504bcdbd.
Повний текст джерелаMasten-Cain, Kathryn. "Toward a Grounded Theory of Community Networking." Thesis, University of North Texas, 2014. https://digital.library.unt.edu/ark:/67531/metadc500035/.
Повний текст джерелаMcHard, Richard William. "Sperner properties of the ideals of a Boolean lattice." Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://proquest.umi.com/pqdweb?index=0&did=1957320841&SrchMode=2&sid=2&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1268340717&clientId=48051.
Повний текст джерелаIncludes abstract. Title from first page of PDF file (viewed March 11, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 170-172). Also issued in print.
Krishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.
Повний текст джерелаCash, Heather. "A Library of Functions in C++ for Building and Manipulating Large Graphs." Honors in the Major Thesis, University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1213.
Повний текст джерелаBachelors
Engineering and Computer Science
Computer Science
Zhao, Wang. "Domain knowledge transformation (DKT) for conceptual design of mechanical systems /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841351.
Повний текст джерелаNeron, Pierre. "A Quest for Exactness: Program Transformation for Reliable Real Numbers." Phd thesis, Ecole Polytechnique X, 2013. http://tel.archives-ouvertes.fr/tel-00924379.
Повний текст джерелаHaller, Leopold Carl Robert. "Abstract satisfaction." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:68f76f3a-485b-4c98-8d02-5e8d6b844b4e.
Повний текст джерелаPajovic, Milutin. "The development and application of random matrix theory in adaptive signal processing in the sample deficient regime." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/93775.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 237-243).
This thesis studies the problems associated with adaptive signal processing in the sample deficient regime using random matrix theory. The scenarios in which the sample deficient regime arises include, among others, the cases where the number of observations available in a period over which the channel can be approximated as time-invariant is limited (wireless communications), the number of available observations is limited by the measurement process (medical applications), or the number of unknown coefficients is large compared to the number of observations (modern sonar and radar systems). Random matrix theory, which studies how different encodings of eigenvalues and eigenvectors of a random matrix behave, provides suitable tools for analyzing how the statistics estimated from a limited data set behave with respect to their ensemble counterparts. The applications of adaptive signal processing considered in the thesis are (1) adaptive beamforming for spatial spectrum estimation, (2) tracking of time-varying channels and (3) equalization of time-varying communication channels. The thesis analyzes the performance of the considered adaptive processors when operating in the deficient sample support regime. In addition, it gains insights into behavior of different estimators based on the estimated second order statistics of the data originating from time-varying environment. Finally, it studies how to optimize the adaptive processors and algorithms so as to account for deficient sample support and improve the performance. In particular, random matrix quantities needed for the analysis are characterized in the first part. In the second part, the thesis studies the problem of regularization in the form of diagonal loading for two conventionally used spatial power spectrum estimators based on adaptive beamforming, and shows the asymptotic properties of the estimators, studies how the optimal diagonal loading behaves and compares the estimators on the grounds of performance and sensitivity to optimal diagonal loading. In the third part, the performance of the least squares based channel tracking algorithm is analyzed, and several practical insights are obtained. Finally, the performance of multi-channel decision feedback equalizers in time-varying channels is characterized, and insights concerning the optimal selection of the number of sensors, their separation and constituent filter lengths are presented.
by Milutin Pajovic.
Ph. D.
Poernomo, Iman Hafiz 1976. "Variations on a theme of Curry and Howard : the Curry-Howard isomorphism and the proofs-as-programs paradigm adapted to imperative and structured program synthesis." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9405.
Повний текст джерелаMerry, Alexander. "Reasoning with !-graphs." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:416c2e6d-2932-4220-8506-50e6b403b660.
Повний текст джерелаBlažková, Klára. "Teorie vnitřního prostředí." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2013. http://www.nusl.cz/ntk/nusl-225941.
Повний текст джерелаSuoja, Nicole Marie. "Directional wavenumber characteristics of short sea waves." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/88473.
Повний текст джерелаIncludes bibliographical references (leaves 134-141).
by Nicole Marie Suoja.
Ph.D.
Fruth, Matthias. "Formal methods for the analysis of wireless network protocols." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:df2c08f4-001c-42d3-a2f4-9922f081fb49.
Повний текст джерелаJaoua, Ali. "Recouvrement avant de programmes sous les hypotheses de specifications deterministes et non deterministes." Toulouse 3, 1987. http://www.theses.fr/1987TOU30227.
Повний текст джерелаHuffman, Brian Charles. "HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/113.
Повний текст джерелаRamsey, Terry 1946. "The calendar heap: A new implementation of the calendar queue." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/291354.
Повний текст джерелаTessler, Michael. "Specifications of a software environment for the computer-aided design of control systems." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63218.
Повний текст джерелаKreuger, Per. "Computational Issues in Calculi of Partial Inductive Definitions." Doctoral thesis, Decisions, Networks and Analytics lab, 1995. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21196.
Повний текст джерелаAlso published as SICS Dissertation no. SICS-D-19
Park, Seongmin. "A hypertext learning system for theory of computation." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/897499.
Повний текст джерелаDepartment of Computer Science
Islam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.
Повний текст джерелаDepartment of Computer Science
Gill, David Michael. "Automatic theorem proving programs and group presentations." Thesis, University of St Andrews, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268121.
Повний текст джерелаLee, Timothy J. "CHITRA93 : a tool to analyze system behavior by visualizing and modeling ensembles of traces /." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020057/.
Повний текст джерела