Rozprawy doktorskie na temat „Information flow”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Information flow”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Heusser, Jonathan. "Automating quantitative information flow". Thesis, Queen Mary, University of London, 2011. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1260.
Pełny tekst źródłaZhang, Xiang. "Efficiency in Emergency medical service system : An analysis on information flow". Thesis, Växjö University, School of Mathematics and Systems Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-1620.
Pełny tekst źródłaIn an information system which includes plenty of information services, we are always seeking a solution to enhance efficiency and reusability. Emergency medical service system is a classic information system using application integration in which the requirement of information flow transmissions is extremely necessary. We should always ensure this system is running in best condition with highest efficiency and reusability since the efficiency in the system directly affects human life.
The aim of this thesis is to analysis emergency medical system in both qualitative and quantitative ways. Another aim of this thesis is to suggest a method to judge the information flow through the analysis for the system efficiency and the correlations between information flow traffic and system applications.
The result is that system is a main platform integrated five information services. Each of them provides different unattached functions while they are all based on unified information resources. The system efficiency can be judged by a method called Performance Evaluation, the correlation can be judged by multi-factorial analysis of variance method.
Aksakal, Baris. "Makeshift Information Constructions: Information Flow and Undercover Police". Thesis, University of North Texas, 2005. https://digital.library.unt.edu/ark:/67531/metadc4823/.
Pełny tekst źródłaEnescu, Mihai Adrian. "Precisely quantifying software information flow". Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/57379.
Pełny tekst źródłaScience, Faculty of
Computer Science, Department of
Graduate
Zhu, Ping. "Quantifying information flow with constraints". Thesis, City University London, 2010. http://openaccess.city.ac.uk/12101/.
Pełny tekst źródłaMoses, John. "Cohesion prediction using information flow". Thesis, University of Sunderland, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387492.
Pełny tekst źródłaPayne, Joshua. "Interaction Topologies and Information Flow". ScholarWorks @ UVM, 2009. http://scholarworks.uvm.edu/graddis/177.
Pełny tekst źródłaAlhalalat, Saleh Ismail. "Information flow in virtual organisations". Thesis, Loughborough University, 2005. https://dspace.lboro.ac.uk/2134/7757.
Pełny tekst źródłaSalvini, Fabio <1992>. "Flow logic based information flow analysis of Android applications". Master's Degree Thesis, Università Ca' Foscari Venezia, 2018. http://hdl.handle.net/10579/12996.
Pełny tekst źródłaBhatia, Shishir. "Structured Information Flow (SIF) Framework for Automating End-to-End Information Flow for Large Organizations". Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/31148.
Pełny tekst źródłaMaster of Science
Kassir, Abdallah. "Communication Efficiency in Information Gathering through Dynamic Information Flow". Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/12113.
Pełny tekst źródłaZanioli, Matteo <1984>. "Information flow analysis by abstract interpretation". Doctoral thesis, Università Ca' Foscari Venezia, 2012. http://hdl.handle.net/10579/1235.
Pełny tekst źródłaProteggere la segretezza delle informazioni nei sistemi informatici o all’interno di reti pubbliche `e uno dei principali problemi riguardanti la sicurezza informatica. L’obiettivo di questa tesi è fornire sia risultati teorici che sperimentali attraverso la progettazione di un’analisi di flussi di informazioni volta a verificare che i dati sensibili rimangano tali e non vengano resi pubblici. Il nostro approccio si fonda sull’Interpretazione Astratta, una teoria riguardante l’approssimazione della semantica dei programmi. Tracciamo le dipendenze tra le variabili attraverso formule proposizionali, in particolare usando il dominio Pos. Analizziamo i principali metodi per incrementare la precisione (tramite la combinazione di domini astratti) e l’efficienza (tramite l’utilizzo degli operatori di widening and narrowing) dell’analisi. Il prodotto ridotto tra il dominio logico Pos ed opportuni domini numerici fornisce un analisi più accurata rispetto quelle presenti in letteratura. La costruzione modulare della nostra analisi permette di gestire al meglio il trade-off tra efficienza e precisione regolando la granularità dell’astrazione e la complessità degli operatori astratti. In fine, introduciamo Sails, un nuovo strumento per l’analisi di flussi di informazioni per linguaggi tradizionali come Java, che non richiede nessuna annotazione manuale. Sails combina l’analisi dei flussi con differenti astrazioni dell’heap, inferendo i flussi anche su programmi che utilizzano strutture dati complesse. Abbiamo poi analizzato con Sails la suite SecuriBench-micro ottenendo dei risultati preliminari che hanno confermato l’efficacia del nostro approccio.
Protéger la confidentialité de l’information numérique stockée ou en transfert sur des réseaux publics est un problème récurrent dans le domaine de la sécurité informatique. Le but de cette thèse est de fournir des résultats théoriques et expérimentaux sur une analyse de flue permettant la vérification automatique de l’absence de fuite possible d’information sensible. Notre approche est basée sur la théorie de l’Interprétation Abstraite et consiste à manipuler une approximation de la sémantique des programmes. Nous détectons les différentes dépendances entre les variables d’un programme en utilisant des formules propositionnelles avec notamment le domaine Pos. Nous étudions les principales façon d’améliorer la précision (en combinant des domaines abstraits) et l’efficacité (en associant des opérateurs d’élargissement et de rétrécissement) de l’analyse. Le produit réduit du domaine logique Pos et d’un domaine numérique choisi permet une analyse strictement plus précise que celles précédemment présentent dans la littérature. La construction modulaire de notre analyse permet de choisir un bon compromis entre efficacité et précision en faisant varier la granularité de l’abstraction et la complexité des opérateurs abstraits. Pour finir, nous introduisons Sails une nouvelle analyse de flue destinée à des langages de haut niveau sans annotation tel que Java. Sails combine une analyse de fuite possible d’information à différentes abstraction de la mémoire (du tas), ce qui lui permet d’inférer des résultats sur des programmes manipulant des structures complexes. De premiers résultats expérimentaux permettent de pointer l’efficacité de notre approche en appliquant Sails à l’analyse de SecuriBench-micro.
Masri, Wassim. "DYNAMIC INFORMATION FLOW ANALYSIS, SLICING AND PROFILING". Case Western Reserve University School of Graduate Studies / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=case1092886961.
Pełny tekst źródłaThorpe, Tony. "Information flow in house building organisations". Thesis, Loughborough University, 1992. https://dspace.lboro.ac.uk/2134/6751.
Pełny tekst źródłaAdetoye, Adedayo Oyelakin. "Secure information flow : analysis and enforcement". Thesis, University of Birmingham, 2009. http://etheses.bham.ac.uk//id/eprint/408/.
Pełny tekst źródłaMyers, Andrew C. (Andrew Clifford). "Mostly-static decentralized information flow control". Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/16717.
Pełny tekst źródłaIncludes bibliographical references (p. 169-174) and index.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
The growing use of mobile code in downloaded programs such as applets and servlets has increased interest in robust mechanisms for ensuring privacy and secrecy. Common security mechanisms such as sand boxing and access control are either too restrictive or too weak -- they prevent applications from sharing data usefully, or allow private information to leak. For example, security mechanisms in Java prevent many useful applications while still permitting Trojan horse applets to leak private information. This thesis describes the decentralized label model, a new model of information flow control that protects private data while allowing applications to share data. Unlike previous approaches to privacy protection based on information flow, this label model is decentralized: it allows cooperative computation by mutually distrusting principals, without mediation by highly trusted agents. Cooperative computation is possible because individual principals can declassify their own data without infringing on other principals' privacy. The decentralized label model permits programs using it to be checked statically, which is important for the precise detection of information leaks. This thesis also presents the new language J flow, an extension to the Java programming language that incorporates the decentralized label model and permits static checking of information flows within programs. Variable declarations in J flow programs are annotated with labels that allow the static checker to check programs for information leaks efficiently, in a manner similar to type checking. Often, these labels can be inferred automatically, so annotating programs is not onerous. Dynamic checks also may be used safely when static checks are insufficiently powerful. A compiler has been implemented for the J flow language. Because most checking is performed statically at compile time, the compiler generates code with few additional dynamic tests, improving performance.
by Andrew C. Myers.
Ph.D.
Cheng, Winnie Wing-Yee. "Information flow for secure distributed applications". Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55095.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 171-177).
Private and confidential information is increasingly stored online and increasingly being exposed due to human errors as well as malicious attacks. Information leaks threaten confidentiality, lead to lawsuits, damage enterprise reputations, and cost billion of dollars. While distributed computing architectures provide data and service integration, they also create information flow control problems due to the interaction complexity among service providers. A main problem is the lack of an appropriate programming model to capture expected information flow behaviors in these large distributed software infrastructures. This research tackles this problem by proposing a programming methodology and enforcement platform for application developers to protect and share their sensitive data. We introduce Aeolus, a new platform intended to make it easier to build distributed applications that avoid the unauthorized release of information. The Aeolus security model is based on information flow control but differs from previous work in ways that we believe make it easier to use and understand. In addition, Aeolus provides a number of new mechanisms (anonymous closures, compound tags, boxes, and shared volatile state) to ease the job of writing applications. This thesis provides examples to show how Aeolus features support secure distributed applications. It describes the system design issues and solutions in designing a prototype implementation and presents performance results that show our platform has low overhead.
by Winnie Wing-Yee Cheng.
Ph.D.
Christian, Andrew D. (Andrew Dean). "Simulation of information flow in design". Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11102.
Pełny tekst źródłaSchultz, David Andrew. "Decentralized information flow control for databases". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78363.
Pełny tekst źródłaThis 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 (p. 177-194).
Privacy and integrity concerns have been mounting in recent years as sensitive data such as medical records, social network records, and corporate and government secrets are increasingly being stored in online systems. The rate of high-profile breaches has illustrated that current techniques are inadequate for protecting sensitive information. Many of these breaches involve databases that handle information for a multitude of individuals, but databases don't provide practical tools to protect those individuals from each other, so that task is relegated to the application. This dissertation describes a system that improves security in a principled way by extending the database system and the application platform to support information flow control. Information flow control has been gaining traction as a practical way to protect information in the contexts of programming languages and operating systems. Recent research advocates the decentralized model for information flow control (DIFC), since it provides the necessary expressiveness to protect data for many individuals with varied security concerns.However, despite the fact that most applications implicated in breaches rely on relational databases, there have been no prior comprehensive attempts to extend DIFC to a database system. This dissertation introduces IFDB, which is a database management system that supports DIFC with minimal overhead. IFDB pioneers the Query by Label model, which provides applications with a simple way to delineate constraints on the confidentiality and integrity of the data they obtain from the database. This dissertation also defines new abstractions for managing information flows in a database and proposes new ways to address covert channels. Finally, the IFDB implementation and case studies with real applications demonstrate that database support for DIFC improves security, is easy for developers to use, and has good performance.
by David Andrew Schultz.
Ph.D.
Zanioli, Matteo. "Information flow analysis by abstract interpretation". Paris 7, 2012. http://www.theses.fr/2012PA077262.
Pełny tekst źródłaProtecting the confidentiality of information stored in a computer system or transmitted over a public network is a relevant problem in computer security. The goal of this thesis is to provide both theoretical and experimental results towards the design of an information flow analysis for the automatic verification of absence of sensitive information leakage. Our approach is based on Abstract Interpretation, a theory of sound approximation of program semantics. We track the dependencies among program's variables using propositional formulae, namely the Pos domain. We study the main ways to improve the accuracy (by combination of abstract domains) and the efficiency (by combination of widening and narrowing operators) of the analysis. The reduced product of the logical domain Pos and suitable numerical domains yields to an analysis strictly more accurate with respect to the ones already in the literature. The modular construction of our analysis allows to deal with the trade-off between efficiency and accuracy by tuning the granularity of the abstraction and the complexity of the abstract operators. Finally, we introduce Sails, a new information flow analysis tool for mainstream languages like Java, that does not require any manual annotation. Sails combines the information leakage analysis with different heap abstractions, inferring information leakage over programs dealing with complex data structures too. We applied Sails to the analysis of the SecuriBench-micro suite and the preliminary experimental results outline the effectiveness of our approach
Lundqvist, Magnus. "Information Demand and Use : Improving Information Flow within Small-scale Business Contexts". Licentiate thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9666.
Pełny tekst źródłaEspinoza, Becerra Barbara. "Foundations of Quantitative Information Flow: Channels, Cascades, and the Information Order". FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1156.
Pełny tekst źródłaLaw, Yan Tai. "Pricing under random information flow and the theory of information pricing". Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9292.
Pełny tekst źródłaLe, Guernic Gurvan. "Confidentiality Enforcement Using Dynamic Information Flow Analyses". Phd thesis, Kansas State University, 2007. http://tel.archives-ouvertes.fr/tel-00198621.
Pełny tekst źródłaÀ la différence de la majorité des travaux précédents sur la non-interférence (principalement des analyses statiques), ce rapport de thèse s'intéresse au contrôle dynamique de la non-interférence. Le contrôle dynamique des flux d'information est une tâche complexe car l'information transportée par un message n'est pas une propriété intrinsèque de ce message. Elle dépend aussi, lorsque le destinataire connaît l'ensemble des message qui peuvent être envoyés, de la composition de cet ensemble. Le travail présenté dans ce rapport se base sur la composition d'analyses dynamiques et statiques des flux d'information. Des moniteurs de non-interférence sont développés pour différents langages dont un langage concurrent intégrant une commande de synchronisation. L'exactitude de ces moniteurs est prouvée et leur précision est comparée à des travaux précédents.
Zvirblis, Linas. "Securing Information Flow in Loosely-Coupled Systems". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-14086.
Pełny tekst źródłaDeng, Zhenyue. "Practical secure information flow in programming languages". FIU Digital Commons, 2005. http://digitalcommons.fiu.edu/etd/2771.
Pełny tekst źródłaZhang, Chenyi Computer Science & Engineering Faculty of Engineering UNSW. "Information flow security - models, verification and schedulers". Publisher:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/43410.
Pełny tekst źródłaGeorge, Ryan Thomas. "Information flow to support front end planning". Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1181666151/.
Pełny tekst źródłaTitle from first page of PDF file. Document formatted into pages; contains xvi, 385 p. ; also includes graphics (some col.). Contains additional supplemental file.
Akuney, Arseniy. "Information flow identification in large email datasets". Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/39847.
Pełny tekst źródłaLundqvist, Pia. "A service minded information flow in transports". Thesis, Linköpings universitet, Institutionen för teknik och naturvetenskap, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-96197.
Pełny tekst źródłaDetta examensarbete handlar om informationsflöden och kundservice vid Besam Production AB:s utskeppningsavdelning. Syftet med detta arbete är att se över de nuvarande rutinerna som idag finns på utskeppningsavdelning vad gäller informationsflöde vid de dagliga transportbokningarna både till transportören och till kunderna. Hur informationsflödet här kan förändras för att kunna bli mer effektivt, spara tid och bli en konkurrensfördel för Besam Production AB undersöks också. Även en granskning av den kundservice som Besam Production AB erbjuder vid transporter till sina kunder granskas och hur denna skulle kunna förbättras ses också över. I nulägesbeskrivningen tas det upp hur nuläget för skeppningsavdelningen ser ut både vad gäller informationsflöde till och från den transportör som används till de dagliga transporterna Geologistics och det informationsflöde som idag finns mellan utskeppningsavdelningen och dotterbolagen/slutkunderna. Det tas även i nulägesbeskrivningen upp vilken form av kundservice som i dagens läge ges vid transporter från Besam Production AB och vilken kundservice som Besam erhåller från Geologistics. I litteraturstudien studeras olika former av informationsflöde och vikten av informationsinnehållet. Här tas även upp olika former av kundservice vid transporter och hur viktigt det är för ett företag att ha rätt syn på sina kunder och hur viktigt det är att vara medveten om vad det egentligen kunderna vill ha vad gäller service. Resultatet av analysen mellan nulägesbeskrivningen och litteraturstudien finns i slutsatserna. De viktigaste resultaten som har framkommit genom detta arbete indikerar att genomgående förbättringar kan ske på utskeppningsavdelningen både vad gäller informationsflöden och kundservice. Som exempel på detta kan nämnas att det största informationsflödet idag sker med hjälp av fax. Om detta istället genomföras på elektronisk väg, skulle mer tid kunna frigöras som kan användas till den idag ej tillräckligt utvecklade kundservicen.
Ahmedani, Ahmer. "Information flow in a Java intermediate language". Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100756.
Pełny tekst źródłaTo address this issue, this thesis presents two context-sensitive inter-procedural analyses which analyze an intermediate representation of Java Bytecode for secure information flow. The first analysis assumes that there is only one instance of all class fields where as the second analysis uses points-to information to differentiate between instance fields which belong to different instances of the same class. The analyses track secure information in the program by maintaining sets of secure data. The analyses resolve dynamic method resolution in Java statically by analyzing all possible methods which may be invoked at a call site and merging the secure data sets. We were able to define rules to analyze all the statements in the intermediate representation and also accounted for Java libraries. The analyses do not expect any security annotations in the program.
Type information is useful in debugging, guiding optimizations, and specifying and providing safety proofs for programs. A type system for a subset of the Java Bytecode intermediate representation is also formulated in this thesis. An operational semantics is specified and a type preservation proof assures the soundness of the type system.
Non-trivial benchmarks were analyzed and explicit and implicit information flows were counted for both analyses. The empirical data collected suggests secure data is used in many statements of programs and output of data to a user at several places in a program can lead to information flow if the user does not have the right permission to observe the data.
Chung, William Wing-Ho. "Secure information flow in object oriented languages". Thesis, Imperial College London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.408806.
Pełny tekst źródłaZhang, Kan. "On secure information flow in computer systems". Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621829.
Pełny tekst źródłaRazavi, Joseph. "Information flow in spatial models of computation". Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/information-flow-in-spatial-models-of-computation(cbd06463-5662-44cd-abe5-5cbc7370d41d).html.
Pełny tekst źródłaMcCamant, Stephen. "Quantitative information-flow tracking for real systems". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44903.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 99-105).
An information-flow security policy constrains a computer system's end-to-end use of information, even as it is transformed in computation. For instance, a policy would not just restrict what secret data could be revealed directly, but restrict any output that might allow inferences about the secret. Expressing such a policy quantitatively, in terms of a specific number of bits of information, is often an effective program independent way of distinguishing what scenarios should be allowed and disallowed. This thesis describes a family of new techniques for measuring how much information about a program's secret inputs is revealed by its public outputs on a particular execution, in order to check a quantitative policy on realistic systems. Our approach builds on dynamic tainting, tracking at runtime which bits might contain secret in formation, and also uses static control-flow regions to soundly account for implicit flows via branches and pointer operations. We introduce a new graph model that bounds information flow by the maximum flow between inputs and outputs in a flow network representation of an execution. The flow bounds obtained with maximum flow are much more precise than those based on tainting alone (which is equivalent to graph reachability). The bounds are a conservative estimate of channel capacity: the amount of information that could be transmitted by an adversary making an arbitrary choice of secret inputs. We describe an implementation named Flowcheck, built using the Valgrind framework for x86/Linux binaries, and use it to perform case studies on six real C, C++, and Objective C programs, three of which have more than 250,000 lines of code. We used the tool to check the confidentiality of a different kind of information appropriate to each program. Its results either verified that the information was appropriately kept secret on the examined executions, or revealed unacceptable leaks, in one case due to a previously unknown bug.
by Stephen Andrew McCamant.
Ph.D.
Krohn, Maxwell N. (Maxwell Norman). "Information flow control for secure web sites". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45864.
Pełny tekst źródłaIncludes bibliographical references (leaves 117-125).
Sometimes Web sites fail in the worst ways. They can reveal private data that can never be retracted [60, 72, 78, 79]. Or they can succumb to vandalism, and subsequently show corrupt data to users [27]. Blame can fall on the off-the-shelf software that runs the site (e.g., the operating system, the application libraries, the Web server, etc.), but more frequently (as in the above references), the custom application code is the guilty party. Unfortunately, the custom code behind many Web sites is difficult to secure and audit, due to large and rapidly-changing trusted computing bases (TCBs). A promising approach to reducing TCBs for Web sites is decentralized information flow control (DIFC) [21, 69, 113]. DIFC allows the split of a Web application into two types of components: those inside the TCB (trusted), and those without (untrusted). The untrusted components are large, change frequently, and do most of the computation. Even if buggy, they cannot move data contrary to security policy. Trusted components are much smaller, and configure the Web site's security policies. They need only change when the policy changes, and not when new features are introduced. Bugs in the trusted code can lead to compromise, but the trusted code is smaller and therefore easier to audit. The drawback of DIFC, up to now, is that the approach requires a major shift in how programmers develop applications and thus remains inaccessible to programmers using today's proven programming abstractions. This thesis proposes a new DIFC system, Flume, that brings DIFC controls to the operating systems and programming languages in wide use today. Its key contributions are: (1) a simplified DIFC model with provable security guarantees; (2) a new primitive called endpoints that bridges the gap between the Flume DIFC model and standard operating systems interfaces; (3) an implementation at user-level on Linux; and (4) success in securing a popular preexisting Web application (MoinMoin Wiki).
by Maxwell Norman Krohn.
Ph.D.
Texin, Cheryl (Cheryl A. ). "Optical flow using phase information for deblurring". Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41673.
Pełny tekst źródłaIncludes bibliographical references (p. 121-123).
This thesis presents a method for reconstructing motion-degraded images by using velocity information generated with a phase-based optical flow calculation. The optical flow method applies a set of frequency-tuned Gabor filters to an image sequence in order to determine the component velocities for each pixel by tracking temporally separated phase contours. The resulting set of component velocities is normalized and averaged to generate a single 2D velocity at each pixel in the image. The 2D optical flow velocity is used to estimate the motion-blur PSF for the image reconstruction process, which applies a regularization filter to each pixel. The 2D velocities generally had small angular and magnitude errors. Image sequences where the motion varied from frame to frame had poorer results than image sequences where the motion was constant across all frames. The quality of the deblurred image is directly affected by the quality of the velocity vectors generated with the optical flow calculations. When accurate 2D velocities are provided, the deblurring process generates sharp results for most types of motion. The magnitude error proved to be a larger problem than the angular error, due to the averaging process involved in creating the 2D velocity vectors from the component velocities. Both the optical flow and deblurring components had difficulty handling rotational motion, where the linearized model of the motion vector is inappropriate. Retaining the component velocities may solve the problem of linearization.
by Cheryl Texin.
M.Eng.
Cliffer, Natan Tsvi Cohen. "Decentralized information flow control on a cluster". Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/45985.
Pełny tekst źródłaIncludes bibliographical references (p. 53-54).
Information flow control security models can prevent programs from divulging sensitive information in unexpected ways. There has been significant work on tracking information flow between processes in the same computer at the operating system level. I present a modification to the Flume information flow control system for OpenBSD that allows information flow to be tracked between programs on different computers, as long as the system software on all involved computers is maintained by the same trusted entity. This allows the benefits of Flume to be applied to computer systems that take the cluster approach to scaling.
by Natan Tsvi Cohen Cliffer.
M.Eng.
Mathewson, Nicholas A. (Nicholas Albert) 1977. "Verifying information flow control in Java bytecodes". Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86523.
Pełny tekst źródłaIncludes bibliographical references (p. 49).
by Nicholas A. Mathewson.
M.Eng.
Roberts, Benjamin George. "Language semantics for secure information flow analysis". Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607941.
Pełny tekst źródłaSarrab, Mohamed Khalefa. "Policy based runtime verification of information flow". Thesis, De Montfort University, 2011. http://hdl.handle.net/2086/4929.
Pełny tekst źródłaDash, Santanu Kumar. "Adaptive constraint solving for information flow analysis". Thesis, University of Hertfordshire, 2015. http://hdl.handle.net/2299/16354.
Pełny tekst źródłaAkella, Ravi Chandra. "Information flow properties for cyber-physical systems". Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Akella_09007dcc806406a3.pdf.
Pełny tekst źródłaVita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed April 15, 2009) Includes bibliographical references (p. 34-36).
Frazza, Alessandro <1988>. "An Information Flow Type System for Android". Master's Degree Thesis, Università Ca' Foscari Venezia, 2013. http://hdl.handle.net/10579/2839.
Pełny tekst źródłaMahnke, Rolf [Verfasser]. "Flow Experience on the Internet : Advances in Information Systems Flow Research / Rolf Mahnke". Berlin : epubli GmbH, 2015. http://d-nb.info/1070122920/34.
Pełny tekst źródłaMäkinen, J. M. (Juha-Matti). "Flow-tila elektronisten laitteiden käytössä". Master's thesis, University of Oulu, 2017. http://urn.fi/URN:NBN:fi:oulu-201710112982.
Pełny tekst źródłaKhademhosseinieh, Banafsheh, i Muhammad Tahir Khan. "Tools and Organisational Measures to Improve Information Flow". Thesis, Jönköping University, JTH, Computer and Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-9608.
Pełny tekst źródłaIn this age, too much information is provided to the users. So that they face information overload problem and spend more time in finding the right information according to their needs. The information available to the right person on the right time can make significant difference in the work tasks and business processes in an organisation.
This thesis work is on improving information flow within an organisation for a person having a certain role. The concentration of the work is on finding the factors (Qualifiers) which affect the information needs of the user and the actions which should be carried out to fulfil them, as well as suitable IT tools. All these have been presented as Final Result Table. This table shows the information needs, their qualifiers, and suggested actions that can be taken tocarry out a specific need. Besides, we found that there are some General Actions. These kinds of actions are not related to any specific need. Rather, while working to fulfil any of the needs, they can be taken for enhancing the work quality and speed. Further, these actions were classified into two groups: Information System Classification and Organisational Measures.
Gatenby, Robert A., i B. Roy Frieden. "Cellular information dynamics through transmembrane flow of ions". NATURE PUBLISHING GROUP, 2017. http://hdl.handle.net/10150/626193.
Pełny tekst źródłaMeng, Ziyuan. "Two-Bit Pattern Analysis For Quantitative Information Flow". FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1326.
Pełny tekst źródłaCorns, Steven Michael. "The role of information flow in engineering optimization". [Ames, Iowa : Iowa State University], 2008.
Znajdź pełny tekst źródła