Dissertationen zum Thema „Information storage“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Information storage" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Scoffin, Robert A. „New materials for optical information storage“. Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365756.
Der volle Inhalt der QuelleNguyen, Hieu Duy. „It and Bit| Decoherence and Information Storage“. Thesis, University of California, Santa Barbara, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3612010.
Der volle Inhalt der QuelleWe studied two topics: i) how much physical resources are needed to store information and ii) decoherent histories theory applied to Grover search. Given a system consisting of d degrees of freedom each of mass m to store an amount S of information, we find that its average energy, 〈H〉, or size, 〈r2〉, can be made arbitrarily small individually, but its product 〈P〉 = 〈H〉〈 r2〉 is bounded below by (exp{S/d} − 1)2d2/m. This result is obtained in a nonrelativistic, quantum mechanical setting, and it is independent of earlier thermodynamical results such as the Bekenstein bound on the entropy of black holes.
The second topic is decoherent histories applied to the Grover search problem. The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target in a list of N items requires Ω( N) oracle queries when using a classical computer, while a quantum computer can accomplish the same task in O([special characters omitted]) queries using Grover's quantum algorithm. We study a closed quantum system executing Grover algorithm in the framework of decoherent histories and find it to be an exactly solvable model, thus yielding an alternate derivation of Grover's famous result. We also subject the Grover-executing computer to a generic external influence without needing to know the specifics of the Hamiltonian insofar as the histories decohere. Depending on the amount of decoherence, which is captured in our model by a single parameter related to the amount of information obtained by the environment, the search time can range from quantum to classical. Thus, we identify a key effect induced by the environment that can adversely affect a quantum computer's performance and demonstrate exactly how classical computing can emerge from quantum laws.
Bejjani, Ghassan J. „Information storage and access in decisionmaking organizations“. Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/15142.
Der volle Inhalt der QuelleMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 92-94.
by Ghassan J. Bejjani.
M.S.
Gao, Qiang 1964. „Noise reduction techniques for holographic information storage“. Diss., The University of Arizona, 1998. http://hdl.handle.net/10150/282620.
Der volle Inhalt der QuelleFohlin, Johan. „Home Storage Manager“. Thesis, Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-17494.
Der volle Inhalt der QuelleShadrin, Alexey [Verfasser]. „Positional Information Storage in Sequence Patterns / Alexey Shadrin“. Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1060368056/34.
Der volle Inhalt der QuelleVarshney, Lav R. (Lav Raj). „Optimal information storage : nonsequential sources and neural channels“. Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37851.
Der volle Inhalt der QuelleThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
MIT Institute Archives copy: pages 101-163 bound in reverse order.
Includes bibliographical references (p. 141-163).
Information storage and retrieval systems are communication systems from the present to the future and fall naturally into the framework of information theory. The goal of information storage is to preserve as much signal fidelity under resource constraints as possible. The information storage theorem delineates average fidelity and average resource values that are achievable and those that are not. Moreover, observable properties of optimal information storage systems and the robustness of optimal systems to parameter mismatch may be determined. In this thesis, we study the physical properties of a neural information storage channel and also the fundamental bounds on the storage of sources that have nonsequential semantics. Experimental investigations have revealed that synapses in the mammalian brain possess unexpected properties. Adopting the optimization approach to biology, we cast the brain as an optimal information storage system and propose a theoretical framework that accounts for many of these physical properties. Based on previous experimental and theoretical work, we use volume as a limited resource and utilize the empirical relationship between volume anrid synaptic weight.
(cont.) Our scientific hypotheses are based on maximizing information storage capacity per unit cost. We use properties of the capacity-cost function, e-capacity cost approximations, and measure matching to develop optimization principles. We find that capacity-achieving input distributions not only explain existing experimental measurements but also make non-trivial predictions about the physical structure of the brain. Numerous information storage applications have semantics such that the order of source elements is irrelevant, so the source sequence can be treated as a multiset. We formulate fidelity criteria that consider asymptotically large multisets and give conclusive, but trivialized, results in rate distortion theory. For fidelity criteria that consider fixed-size multisets. we give some conclusive results in high-rate quantization theory, low-rate quantization. and rate distortion theory. We also provide bounds on the rate-distortion function for other nonsequential fidelity criteria problems. System resource consumption can be significantly reduced by recognizing the correct invariance properties and semantics of the information storage task at hand.
by Lav R. Varshney.
S.M.
Adar, Eytan 1975. „Hybrid-search and storage of semi-structured information“. Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/46274.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 113-118).
Given today's tangle of digital information, one of the hardest tasks for computer users of information systems is finding anything in the mess. For a number of well documented reasons including the amazing growth in the Internet's popularity and the drop in the cost of storage, the amount of information on the net as well as on a user's local computer, has increased dramatically in recent years. Although this readily available information should be extremely beneficial for computer users, paradoxically it is now much harder to find anything. Many different solutions have been proposed to the general information seeking task of users, but few if any have addressed the needs of individuals or have leveraged the benefit of single-user interaction. The Haystack project is an attempt to answer the needs of the individual user. Once the user's information is represented in Haystack, the types of questions users may ask are highly varied. In this thesis we will propose a means of representing information in a robust framework within Haystack. Once the information is represented we describe a mechanism by which the diverse questions of the individual can be answered. This novel method functions by using a combination of existing information systems. We will call this combined system a hybrid-search system.
by Eytan Adar.
M.Eng.
Johnston, Reece G. „Secure storage via information dispersal across network overlays“. Thesis, The University of Alabama in Huntsville, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10157562.
Der volle Inhalt der QuelleIn this paper, we describe a secure distributed storage model to be used especially with untrusted devices, most notably cloud storage devices. The model does so through a peer-to-peer overlay and storage protocol designed to run on existing networked systems. We utilize a structured overlay that is organized in a layered, hierarchical manner based on the underlying network structure. These layers are used as storage sites for pieces of data near the layer at which that data is needed. This data is generated and distributed via a technique called an information dispersal algorithm (IDA) which utilizes an erasure code such as Cauchy Reed-Solomon (RS). Through the use of this IDA, the data pieces are organized across neighboring layers to maximize locality and prevent a compromise within one layer from compromising the data of that layer. Speci?cally, for a single datum to become compromised, a minimum of two layers would have to become compromised. As a result, security, survivability, and availability of the data is improved compared to other distributed storage systems. We present signi?cant background in this area followed by an analysis of similar distributed storage systems. Then, an overview of our proposed model is given along with an in-depth analysis, including both experimental results and theoretical analysis. The recorded overhead (encoding/decoding times and associated data sizes) shows that such a scheme can be utilized with little increase in overall latency. Making the proposed model an ideal choice for any distributed storage needs.
Shrestha, Tej Bahadur. „Heterocycles for life-sciences applications and information storage“. Diss., Kansas State University, 2010. http://hdl.handle.net/2097/13540.
Der volle Inhalt der QuelleDepartment of Chemistry
Stefan H. Bossmann
The photochromic spirodihydroindolizine/betaine (DHI/B) system has been reinvestigated applying picosecond, microsecond, stationary absorption measurements, and NMR-kinetics. The first surprise was that the electronic structure of the betaines is quite different than commonly assumed. The photochemical ring-opening of DHIs to betaines is a conrotatory 1,5 electrocyclic reaction, as picosecond absorption spectroscopy confirms. The (disrotatory) thermal ring-closing occurs from the cisoid betaine. The lifetime of the transoid betaine is 60 s at 300 K, whereas the lifetime of the cisoid isomer is of the order of 250 microseconds. According to these results, the electrocyclic back reaction of the betaines to the DHI is NOT rate determining, as previously thought, but the cisoid-transoid-isomerization of the betaine. Although the presence of a second nitrogen atom increases the photostability of the spirodihydroindolizine-pyridazine/betaine-system remarkably, the photochemical reaction mechanism appears to be exactly the same for spirodihydroindolizine-pyridazine/betaine-system. A nondestructive photoswitch or an information recording systems has been explored using styryl-quinolyldihydroindolizines. Both isomers DHI and betaine are fluorescent. When the blue betaine is stabilized in a thin polymethyl methacrylate (PMMA) matrix, it is stable for several hours even in room temperature and very stable at 77K. Although irradiation of visible light = 532 nm allows the photo-induced reaction of the Betaine back to the DHI, a nondestructive read-out can be performed at λ = 645 nm upon excitation with λ = 580 nm. Image recording (write) and read-out, as well as information storage (at 77K) have been demonstrated. Charged and maleimide-functionalized DHI/B systems have beed synthesized for use as photochemical gates of the mycobacterial channel porin MspA. Positively charged and maleimide functionalized DHI groups that were attached to the DHI/B-system permit the binding of the photoswitch to selective positions in the channel proteins due to the presence of a cysteine moiety. An inexpensive new method for the large scale synthesis of coelenterazine is developed. A modified Negishi coupling reaction is used to make pyrazine intermediates from aminopyrazine as an economical starting material. This method permits the use of up to 1g coelenterazine per kg body weight and day, which turns the renilla transfected stem cells into powerful light sources.
Leenders, Bram. „Heterogeneous Storage in HopsFS“. Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-202970.
Der volle Inhalt der QuelleWang, Xing. „Benchmarking Cloud Storage Systems“. Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-26716.
Der volle Inhalt der QuelleYuanjia, Gong. „Multi-version Storage: Code Design and Repair in Distributed Storage Systems“. Thesis, KTH, Teknisk informationsvetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209546.
Der volle Inhalt der QuelleMed tanke på den snabbt växande volymen av data, har intresset för forskning på datalagring vuxit under de senaste åren. Distribuerade lagringssystem spelar en viktig rolli att möta behovet av stora volymer av lagring. Distribuerade lagringssystem är alltsånär data är sparad på flera noder som är sammankopplade på olika sätt i ett nätverk.Jämfört med traditionella lokala lagringar, har distribuerad lagring fördelen att den harkortare svarstider, högre tillförlitlighet och bättre skalbarhet. Men om nätverket gårner, det blir ett länkavbrott eller maxkapaciteten i en buffert nås, kan det hända attall uppdatering inte når ut till alla noder, vilket resulterar i att flera olika versioner aven fil finns sparande samtidigt i systemet. Därför är en av utmaningarna är att varakonsekvent, att det alltid är den senaste versionen av en fil finns tillgänglig för allavid varje given tidpunkt. Målet med detta arbete är att studera flerversionslagrade fileroch hur programmeringsdesignen för distribuerade lagringssystem ser ut. Med andraord, finns det flera versioner av en fil, ska alla kunna återskapas. Jämfört med tidigarestudier, har vi med vårt system uppnått högre tillgänglighet, nämligen att en klient harfått tag i alla fall en version av en fil.Ett vanligt förkommande problem i det distribuerade lagringssystemen är fel i nodernaoch då ska en ny nod skapas för att öka behovet av tillit. I detta projekt, extralagringsnoder för reparation (DR lagringsnoder) är introducerade i reparationsprocessen.Resultatet visar att den optimala reparationsbandbredden med minimalt extra lagringsutrymmekan uppnås genom att introducera en specifikt antal DR lagringsnoder.Efter det, linjärkombinationer är framtagna för att reducera kostnaden att reparera därlänkkostnaden är hög. Sist men inte minst har vi kunnat påvisa att samarbete medandra fortfarande uppkopplade noder och med DR lagringsnoderna räcker för att utföraen lyckad reparationsprocess, även med länkavbrott.
湯旭瑜。 und Yuk-yue Tong. „Information organization and storage: the role of implicit theories“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31221737.
Der volle Inhalt der QuelleWare, John Mark. „Multi-scale data storage schemes for spatial information systems“. Thesis, University of South Wales, 1994. https://pure.southwales.ac.uk/en/studentthesis/multiscale-data-storage-schemes-for-spatial-information-systems(38746248-a8d7-4527-ab7a-e874140eda07).html.
Der volle Inhalt der QuelleKomaragiri, Vivek Chakravarthy. „Application of decision diagrams for information storage and retrieval“. Master's thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-04082002-144345.
Der volle Inhalt der QuelleTong, Yuk-yue. „Information organization and storage : the role of implicit theories /“. Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20715572.
Der volle Inhalt der QuelleGregory, Michael W. (Michael Walter). „Interrelational Laboratory Information System for Data Storage and Retrieval“. Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc935708/.
Der volle Inhalt der QuelleSENIGAGLIESI, LINDA. „Information-theoretic security techniques for data communications and storage“. Doctoral thesis, Università Politecnica delle Marche, 2019. http://hdl.handle.net/11566/263165.
Der volle Inhalt der QuelleThe last years have seen a growing need of security and privacy in many aspects of communications, together with the technological progress. Most of the implemented security solutions are based on the notion of computational security, and must be kept continuously updated to face new attacks and technology advancements. To meet the more and more strict requirements, solutions based on the information-theoretic paradigm are gaining interest to support pure cryptographic techniques, thanks to their capacity to achieve security independently on the attacker’s computing resources, also known as unconditional security. In this work we investigate how information-theoretic security can be applied to practical systems in order to ensure data security and privacy. We first start defining information-theoretic metrics to assess the secrecy performance of realistic wireless communication settings under practical conditions, together with a protocol that mixes coding techniques for physical layer security and cryptographic solutions. This scheme is able to achieve some level of semantic security at the presence of a passive attacker. At the same time, multiple scenarios are considered. We provide a security analysis for parallel relay channels, thus finding an optimal resource allocation that maximizes the secrecy rate. Successively, by exploiting a probabilistic model checker, we define the parameters for heterogeneous distributed storage systems that permit us to achieve perfect secrecy in practical conditions. For privacy purposes, we propose a scheme which guarantees private information retrieval of files for caching at the wireless edge against multiple spy nodes. We find the optimal content placement that minimizes the backhaul usage, thus reducing the communication cost of the system.
Kim, Hyojun. „Informed storage management for mobile platforms“. Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45768.
Der volle Inhalt der QuelleCheng, Antonio S. „A robust distrubuted storage system for large information retrieval applications“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0005/MQ40934.pdf.
Der volle Inhalt der QuelleDe, Ridder Ryan (Ryan James). „Business strategy of nucleic acid memory for digital information storage“. Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/110132.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (pages 62-67).
Nucleic acid memory (NAM) is the storage of digital data by encoding the information into the medium of nucleic acids. This is often called DNA storage, as typically, but not necessarily, the information is stored in the nucleobases that comprise DNA. Baum first introduced this idea in 1995, but it wasn't until 2012 that Church proved the idea on a larger scale. NAM has a number of features that make it very promising as a data storage medium. The three typically highlighted are capacity density, data retention (i.e., durability), and energy usage. NAM should enter the data storage market, as a hardware product, through the ~$4.5B archiving market, by targeting large storage service providers and large data-intensive corporations with on-premise operations. A NAM product has the potential to reduce the capital and operational cost base of these companies, by millions of dollars per year. An architecture strategy should be employed to enter the market, relying on control over underlying ideas and partnerships to barricade the company from competition. NAM is a decade away from commercialization, making this a very risky early stage venture. The costs need to come down at least 100,000-fold before the technology is cost competitive with current solutions. Additionally, there are a number of scientific and engineering issues that need to be carefully resolved. Due to the risks, the only viable funding source is government grants. If early stage funding were secured, IP should be developed in the core NAM technology of storage and access and an interim revenue source established. This would allow the company a strong chance to thrive in the competitive storage industry, if and when NAM becomes cost competitive.
by Ryan de Ridder.
S.M. in Engineering and Management
Farfan, Fernando R. „Efficient Storage and Domain-Specific Information Discovery on Semistructured Documents“. FIU Digital Commons, 2009. http://digitalcommons.fiu.edu/etd/126.
Der volle Inhalt der QuelleGholipour, Behrad. „Novel chalcogenide optoelectronic and nanophotonic information storage and processing devices“. Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/341256/.
Der volle Inhalt der QuelleBae, Sanghoon. „Development of a real-time and geographical information system-based transit management information system“. Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-11242009-020226/.
Der volle Inhalt der QuelleKerkinos, Ioannis. „Evaluation and benchmarking of Tachyon as a memory-centric distributed storage system for Apache Hadoop“. Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189571.
Der volle Inhalt der QuelleWatkins, Alfred R. „Continuous media object modeling, storage, and retrieval“. Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/9184.
Der volle Inhalt der QuelleATCHESON, PAUL DONALD. „AN INVESTIGATION OF ANALOG OPTICAL STORAGE THROUGH PHOTOCHEMICAL HOLE-BURNING“. Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/188022.
Der volle Inhalt der QuelleXu, Deyan. „A knowledge-based information storage and retrieval system for natural languages“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0031/MQ47379.pdf.
Der volle Inhalt der QuelleBromwich, Thomas Joseph. „The development and characterisation of magnetic nanodots for information storage applications“. Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426380.
Der volle Inhalt der QuelleHasselmo, M. E. „The representation and storage of visual information in the temporal lobe“. Thesis, University of Oxford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379950.
Der volle Inhalt der QuelleTan, Thiam Chu. „The development of an intelligent conceptual information storage and retrieval system“. Thesis, University of Sunderland, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358839.
Der volle Inhalt der QuelleSharma, Munish. „SHARIF: Solid Pod based Secured Healthcare Information Storage and Exchange Solution“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-105147.
Der volle Inhalt der QuelleSloof, Joël. „Classification Storage : A practical solution to file classification for information security“. Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-84553.
Der volle Inhalt der QuelleI dagens informationsålder har data blivit den mest värdefulla tillgången i världen. Datatillgångar har blivit högt prioriterade mål för cyberkriminella och digital krigsföring. För att minska dessa hot, finns det ett behov av informationssäkerhet, lagar och lagstiftning. Det kan vara utmanande för organisationer att ha kontroll över sitt data för att följa lagar som kräver data klassificering för att lagra känsligt data. Målet med avhandlingen är att skapa ett system som gör det lättare för organisationer att hantera filklassificering och som ökar informationssäkerhets medvetande bland användare. Classification Storage systemet har designats, implementerats och evaluerats i avhandlingen. Classification Storage systemet är en Klient--Server lösning som tillsammans skapar ett virtuellt filsystem. Det virtuella filsystemet är presenterad som en nätverksenhet, där data lagras separat, beroende på den klassificeringen användare sätter. Classification Storage systemet är evaluerat genom en användbarhetsstudie. Studien visar att användare tycker att Classification Storage systemet är intuitivt, lätt att använda och användare blir mer informationssäkerhets medveten genom att använda systemet.
Netshiongolwe, Mpho. „Investigating perceptions of reliability, efficiency and feasibility of data storage technology: A case study of cloud storage adoption at UCT Faculty of Science“. Master's thesis, Faculty of Humanities, 2019. http://hdl.handle.net/11427/30935.
Der volle Inhalt der QuelleFei, Qi. „Operation models for information systems /“. View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?IELM%202009%20FEI.
Der volle Inhalt der QuelleLee, Jaejin. „Robust multitrack modulation codes for the storage channel“. Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/15034.
Der volle Inhalt der QuelleChanana, Vivek, University of Western Sydney, of Science Technology and Environment College und School of Computing and Information Technology. „Enhancing information retrieval effectiveness through use of context“. THESIS_CSTE_CIT_Chanana_V.xml, 2004. http://handle.uws.edu.au:8081/1959.7/719.
Der volle Inhalt der QuelleDoctor of Philosophy (PhD)
Wang, Jiying. „Information extraction and integration for Web databases /“. View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANGJ.
Der volle Inhalt der QuelleIncludes bibliographical references (leaves 112-118). Also available in electronic version. Access restricted to campus users.
Chen, QiFan. „An object-oriented database system for efficient information retrieval applications“. Diss., This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-06062008-170433/.
Der volle Inhalt der QuelleHo, Lai-ming. „Evaluation of the development and impact of clinical information systems /“. Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19657857.
Der volle Inhalt der QuelleLin, Chang-Mei. „CICC Information System /“. Online version of thesis, 1992. http://hdl.handle.net/1850/11094.
Der volle Inhalt der QuelleColes, Susan. „Personal information systems : the implications of job and individual differences for design“. Thesis, Loughborough University, 1990. https://dspace.lboro.ac.uk/2134/33024.
Der volle Inhalt der QuelleTedori, Veronica. „Design of a safety management information and tracking system“. Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-03302010-020341/.
Der volle Inhalt der QuelleJennings, Daniel Blair. „Welding information system : design, operations, methods“. Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/29988.
Der volle Inhalt der QuelleApplied Science, Faculty of
Civil Engineering, Department of
Graduate
Rogers, Camille Françoise. „Teaching ethics in the Information Systems curriculum“. Click here to access dissertation, 2006. http://www.georgiasouthern.edu/etd/archive/spring2006/cfrogers/Rogers%5FCamille%5FF%5F200601.pdf.
Der volle Inhalt der Quelle"A dissertation submitted to the Graduate Faculty of Georgia Southern University in partial fulfillment of the requirements for the degree Doctor of Education." ETD. Includes bibliographical references (p. 144-157).
Mukherjea, Sougata. „Visualizing the information space of hypermedia systems“. Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8223.
Der volle Inhalt der QuelleYeung, Chung Kei. „Ontological model for information systems development methodology“. HKBU Institutional Repository, 2006. http://repository.hkbu.edu.hk/etd_ra/702.
Der volle Inhalt der QuelleFraser, Mark E. „Architecture and methodology for storage, retrieval and presentation of geo-spatial information“. [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000316.
Der volle Inhalt der QuelleTitle from title page of source document. Document formatted into pages; contains xi, 77 p.; also contains graphics. Includes vita. Includes bibliographical references.
Lomerson, William L. (William Lough). „Information Technology Needs of Professional Education Faculty with the Implications for the Design of Information Technology Systems“. Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc332783/.
Der volle Inhalt der Quelle