Dissertations / Theses on the topic 'Abstract information'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Abstract information.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Janakiraman, Muralidharan. "Abstract Index Interfaces." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5288.
Full textLedezma, Carlos. "Static analysis of multi-threaded applications by abstract interpretation." Thesis, KTH, Programvaruteknik och Datorsystem, SCS, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-143029.
Full textShovman, Mark. "Measuring comprehension of abstract data visualisations." Thesis, Abertay University, 2011. https://rke.abertay.ac.uk/en/studentTheses/4cfbdab1-0f91-4886-8b02-a4a8da48aa72.
Full textOkhravi, Christopher. "Markup has resolution. : In search of a more abstract language." Thesis, Uppsala universitet, Institutionen för informatik och media, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-236664.
Full textBylund, Johanna, and Josefine Nåvik. "Allt är inte sagt bara för att en lag har talat : En kvalitativ dokumentstudie om hur insiderlagen i praktiken kan ses som en spelregel." Thesis, Mittuniversitetet, Institutionen för ekonomi, geografi, juridik och turism, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-37009.
Full textNyckelord: Värdepappersreglering, asymmetrisk information, abstrakta system, abstrakt förtroende, spelregel, spelAbstractInsider trading regulation is a highly-debated topic which often leads to black headlines in the media. Attempts to counteract insider trading is based on the asymmetric information that is common in the securities market and which seems to be the reason why the market can be perceived as unfair and immoral. Insider trading regulation has thus been considered necessary, but the law itself has been questioned when it comes to its real function and efficiency. Earlier research namely shows that the law may be better understood as a game rule where the game is amoral. How the law practically can be better understood as a game rule seems however yet to be lacking in previous research. A study comparing insider law with economic crimes, such as fraud offenses, has thus been considered necessary to determine in which ways the insider law can be compared to an amoral rule of law. This qualitative document-study thus aims to analyze and describe the insider law in a social constructive approach and in what ways it practically can be better understood as a game rule. The importance of maintaining trust in the securities market has also been emphasized by the supervisory authorities Ekobrottsmyndigheten and Finansinspektionen, therefore it was also considered interesting to study documents from their respective websites. The documents were analyzed based on a content analysis where the results were linked to securities regulation and insider law, trust in its abstract form and insiderlaw and/or game rules. The results of this study indicate that the insider law practically should be better understood as a game rule as insider trading is a victimless crime where there are difficulties in proving that a crime actually has been committed.
Tennis, Joseph T. "The economic and aesthetic axis of information organization frameworks (extended abstract)." dLIST, 2007. http://hdl.handle.net/10150/106120.
Full textMénard, Elaine. "Indexing and retrieving images in a multilingual world (extended abstract)." dLIST, 2007. http://hdl.handle.net/10150/105900.
Full textLidén, Alice, and Victoria Nyberg. "Vem vet och vem bryr sig? : En kvalitativ studie om generation Y:s medvetenhet om produktplacering och övervakning på internet och i sociala medier." Thesis, Mittuniversitetet, Avdelningen för ekonomivetenskap och juridik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34481.
Full textDespite that the medial and academic interest in online and social media surveillance has increased, previous research shows that younger users of these technologies themselves appear to remain relatively unconcerned with surveillance. By conducting five semi structured interviews and two focus group interviews with respondents from generation Y, the authors of this study aim to get a picture of the respondents’ awareness and attitude towards surveillance and product placement on the internet and in social media. The study, which is a qualitative case study with a social constructivist approach, aims at expanding previous research in surveillance as well as contributing to increased knowledge for young consumers who on a daily basis are active in the digital market. The empirical data of the study are presented by a thematic analysis, which links the results to selected theoretical models of surveillance, trust and knowledge. The result and analysis indicate that some awareness of product placement and surveillance exists and that the attitude towards both of the terms are relatively indifferent or negative. Respondents are perceived to accept the trade-off of greater usability for decreased control which, among other things, may be due to their strong need to integrate with each other and their trust in abstract systems. The study concludes with a final discussion highlighting the potential consequences of trusting the systems where a possible negative consequence may be a reduced ability to gain new ontological knowledge.
Krieglstein, Daniel. "Rethinking the Scientific Database| Exploring the Feasibility of Building a New Scientific Abstract Database." Thesis, Illinois Institute of Technology, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10827846.
Full textAbstract databases are essential for literature reviews, and in turn for the scientific process. Research into user interface designs and their impact on scientific article discovery is limited. The following study details the process of building a new abstract database and explores several user interface design elements that should be tested in the future.
The initial goal of this study was to test the feasibility of building a new abstract database. Using Crossref metadata, we concluded that the cost to produce parsing code for the entire data set proved prohibitive for a volunteer team. The legal, production, and design elements necessary to build a new abstract database are discussed in detail. This study should serve as a baseline for future abstract database testing.
Geng, Zhao. "Visual analysis of abstract multi-dimensional data with parallel coordinates." Thesis, Swansea University, 2013. https://cronfa.swan.ac.uk/Record/cronfa43002.
Full textHerbert, George D. "Compiling Unit Clauses for the Warren Abstract Machine." UNF Digital Commons, 1987. http://digitalcommons.unf.edu/etd/571.
Full textBruhl, Analee. "The role of situations and thematic reorganization in the conceptual processing of abstract concepts." Thesis, Lyon 2, 2014. http://www.theses.fr/2014LYO20040/document.
Full textThe human conceptual system is known to contain two main types of concepts: concrete and abstract. Abstract concepts such as opinion or determination express the sequences of relations between different entities. They also manifest the internal and introspective states of existence that characterize the human consciousness. The semantic representation and organization of abstract concepts has received very little attention in the cognitive psychology literature over the past decades, whereas the vast majority of studies have been dedicated to concrete concepts. Previous research on abstract concepts has explained how they are conceptually represented by focusing on their differences from concrete concepts i.e., the concreteness effect. Current theories of grounded cognition such as the Perceptual Symbol Systems Theory propose that situational knowledge and experiences could play a key role in how people simulate, understand and use abstract concepts.Our aim was to assess the principles that underlie the conceptual structure, organization and representation of abstract concepts within the cognitive system. Four series of behavioural experiments using categorization and similarity judgment tasks were designed to investigate the role of situational information and thematic organization in the processing of abstract concepts. The results indicated that the co-occurrences and the experiencing of unrelated abstract concepts in relevant situations significantly influenced the emergence of novel thematic reorganizations between the concepts compared to baseline. Thus, suggesting the central role that thematic reorganization and situational information play in the conceptual representation of abstract concepts
Wagner, Filho Jorge Alberto. "Evaluating immersive approaches to multidimensional information visualization." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/175082.
Full textThe use of novel displays and interaction resources to support immersive data visualization and improve the analytical reasoning is a research trend in Information Visualization. In this work, we evaluate the use of HMD-based environments for the exploration of multidimensional data, represented in 3D scatterplots as a result of dimensionality reduction. We present a new modelling for the evaluation problem in such a context, accounting for the two factors whose interplay determine the impact on the overall task performance: the difference in errors introduced by performing dimensionality reduction to 2D or 3D, and the difference in human perception errors under different visualization conditions. This two-step framework offers a simple approach to estimate the benefits of using an immersive 3D setup for a particular dataset. As use case, the dimensionality reduction errors for a series of roll calls datasets when using two or three dimensions are evaluated through an empirical task-based approach. The perception error and overall task performance are assessed through controlled comparative user studies. When comparing desktop-based (2D and 3D) with an HMD-based (3D) visualization, initial results indicated that perception errors were low and similar in all approaches, resulting in overall performance benefits in both 3D techniques. The immersive condition, however, was found to require less effort to find information and less navigation, besides providing much larger subjective perception of accuracy and engagement. Nonetheless, the use of flying navigation resulted in inefficient times and frequent user discomfort In a second moment, we implemented and evaluated an alternative data exploration approach where the user remains seated and viewpoint change is only realisable through physical movements. All manipulation is done directly by natural mid-air gestures, with the data being rendered at arm’s reach. The virtual reproduction of an exact copy of the analyst’s desk aims to increase immersion and enable tangible interaction with controls and two dimensional associated information. A second user study was carried out comparing this scenario to a desktop-based equivalent, exploring a set of 9 representative perception and interaction tasks based on previous literature. We demonstrate that our prototype setup, named VirtualDesk, presents excellent results regarding user comfort and immersion, and performs equally or better in all analytical tasks, while adding minimal or no time overhead and amplifying data exploration.
Mittelbach, Martin. "Coding Theorem and Memory Conditions for Abstract Channels with Time Structure." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-168302.
Full textIm ersten Teil der Arbeit wird ein Kodierungstheorem und ein dazugehöriges Umkehrtheorem von Kadota und Wyner (1972) für abstrakte Kanäle mit Zeitstruktur verallgemeinert. Als wesentlichster Beitrag wird das Kodierungstheorem für eine signifikant schwächere Bedingung an das Kanalausgangsgedächtnis bewiesen, die sogenannte totale Ergodizität für block-i.i.d. Eingaben. Dieses Ergebnis wird hauptsächlich durch eine alternative Charakterisierung der Informationsratenkapazität erreicht. Es wird gezeigt, dass die von Kadota und Wyner verwendete ψ-Mischungsbedingung (asymptotische Gedächtnislosigkeit am Kanalausgang) recht einschränkend ist, insbesondere für die wichtige Klasse der Gaußkanäle. In der Tat, für Gaußkanäle wird bewiesen, dass die ψ-Mischungsbedingung äquivalent zu endlichem Gedächtnis am Kanalausgang ist. Darüber hinaus wird eine schwache Umkehrung für alle stationären Kanäle mit Zeitstruktur bewiesen. Sowohl Intersymbolinterferenz als auch Eingabebeschränkungen werden in allgemeiner und flexibler Form berücksichtigt. Aufgrund der direkten Verwendung von äußeren Maßen und der Herleitung einer angepassten Version von Feinsteins Lemma ist es möglich, auf die Standarderweiterung der σ-Algebra am Kanaleingang zu verzichten, wodurch die Darstellungen transparenter und einfacher werden. Angestrebt wird eine operationelle Perspektive. Die Verwendung eines abstrakten Modells erlaubt dabei die einheitliche Betrachtung von zeitdiskreten und zeitstetigen Kanälen. Für abstrakte Kanäle mit Zeitstruktur werden im zweiten Teil der Arbeit Bedingungen für ein unendliches Gedächtnis am Kanalausgang systematisch analysiert. Unter Ausnutzung der Zusammenhänge zu dem umfassenden Gebiet der stark mischenden zufälligen Prozesse wird eine Hierarchie in Form einer Folge von Implikationen zwischen den verschiedenen Gedächtnisvarianten hergeleitet. Die im Beweis des Kodierungstheorems verwendete ergodentheoretische Gedächtniseigenschaft und die ψ-Mischungsbedingung von Kadota und Wyner (1972) sind dabei Bestandteil der hergeleiteten Systematik. Weiterhin werden Bedingungen für den Kanal spezifiziert, unter denen Eigenschaften von zufälligen Prozessen am Kanaleingang bei einer Transformation durch den Kanal erhalten bleiben. Im letzten Teil der Arbeit werden sowohl Integrationskanäle als auch Hintereinanderschaltungen von Kanälen in Bezug auf Mischungsbedingungen sowie weitere für das Kodierungstheorem relevante Kanaleigenschaften analysiert. Die erzielten Ergebnisse sind nützlich bei der Untersuchung vieler physikalisch relevanter Kanalmodelle und erlauben eine komponentenbasierte Betrachtung zusammengesetzter Kanäle. Es wird eine Reihe von Beispielen untersucht, einschließlich deterministischer Kanäle, zufälliger Filter und daraus zusammengesetzter Modelle. Abschließend werden Anwendungen aus weiteren Gebieten, beispielsweise der statistischen Signalverarbeitung, diskutiert. Insbesondere die Fourier-Transformation stationärer zufälliger Prozesse wird im Zusammenhang mit starken Mischungsbedingungen betrachtet
Bugajska, Malgorzata. "Spatial visualization of abstract information : a classification model for visual design guidelines in the digital domain /." [S.l.] : [s.n.], 2003. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=14903.
Full textChowdhury, Ziaul Islam. "Implementation of an abstract module for entity resolution to combine data sources with the same domain information." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-87294.
Full textLa, Barre Kathryn. "Faceted navigation and browsing features in new OPACs: A more robust solution to problems of information seekers? (extended abstract)." dLIST, 2007. http://hdl.handle.net/10150/106157.
Full textAhrsjö, Carl. "Real-time event based visualization of multivariate abstract datasets : Implementing and evaluating a dashboard visualization prototype." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-170395.
Full textMuñoz, Álvaro Aranda. "Comparing 3D interfaces of virtual factories : an iconic 3D interface against an abstract 3D visualisation." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4115.
Full textThis thesis explores and compares two prototypes that present a visualisation of the process state of a factory. The first prototype presents a generic interface in which primitive 3D shapes convey the information of the factory status. The second prototype is complemented with specific and iconic 3D models of the factory that help the users associating the conveyed information to the factory flow. The motivation behind this dissertation is that the type of generic interface presented can lead to more reusable interfaces in the future.
Lakshminarayanan, R. "TriSL: A Software Architecture Description Language and Environment." Thesis, Indian Institute of Science, 1999. http://hdl.handle.net/2005/87.
Full textTran, David. "Investigating the applicability of Software Metrics and Technical Debt on X++ Abstract Syntax Tree in XML format : calculations using XQuery expressions." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162719.
Full textFrancis, Caroline M. "How Information Retrieval Systems Impact on Designers' Searching Strategies Within the Early Stages of the Design Process." Queensland University of Technology, 2006. http://eprints.qut.edu.au/16280/.
Full textJilläng, Emil. "Making ASN.1 (Abstract Syntax Notation One) human-readable : Investigative and practical study to generalize decoding and manual validation of ASN.1 from the cellular network during run time." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-67595.
Full textASN.1 är en kraftfull formell notation uppdelad i två delar. En specifikation av data och medföljande data i binär form. Att skapa avkodare till dessa filer kan ofta vara tidskrävande. Syftet med det här examensarbetet är att vidareutveckla nuvarande verktyg på Arctic Group till en applikation som avkodar ett flertal olika ASN.1-specifikationer och data. Detta skall göras under körning och skall inte kräva att applikationen byggs om för varje specifikation. Applikationen skall även generera mänskligt läsbar utdata och abstrahera bort oönskad information. Två sätt att bygga en ASN.1-avkodare hittades under förstudien och applikationen designades med inspiration av en lösning som sparar data i en mellanliggande lista. Genom att inte inkludera kodning av data i applikationen kunde genvägar tas och det önskade resultatet kunde uppnås under körning. Applikationen designades med tre delar. Den första delen var en ASN.1-läsare som använde verktyget ANTLR4 byggt i Java, den andra en del som matchade informationen från specifikationen till den binära datan. Den sista delen var en formaterare för utdata som även abstraherade bort oönskad information. Resultatet blev en applikation som korrekt läser av minst tre av de mest använda ASN.1-specifikationerna hos uppdragsgivaren och som bara behöver byggas om då en ny datatyp introduceras i specifikationerna. Problem uppstod vid matching av data till specifikationen vilket ledde till att matchningen och formateringen blev bara delvis implementerat. Applikationen utvärderades genom att testa många olika ASN.1 specifikationer, kontrollera att allt genererades korrekt under körning och att utöka läsaren efterhand för att kunna hantera mer syntax då den introducerades i de nya specifikationerna. Även om applikationen inte än stödjer godtycklig ASN.1-specifikation kan den verka som en bas för vidareutveckling mot en mer komplett generaliserad lösning.
Rahman, Mohammad Hafijur. "Designing Framework for Web Development." Thesis, Uppsala universitet, Institutionen för informatik och media, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-168362.
Full textZimic, Sheila. "Internetgenerationen bit för bit : Representationer av IT och ungdom i ett informationssamhälle." Doctoral thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-21926.
Full textCamporesi, Ferdinanda. "Formal and exact reduction for differential models of signalling pathways in rule-based languages." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLEE005/document.
Full textThe behaviour of a cell is driven by its capability to receive, propagate and communicate signals. Proteins can bind together on some binding sites. Post-translational modifications can reveal or hide some sites, so new interactions can be allowed or existing ones can be inhibited. Due to the huge number of different bio-molecular complexes, we can no longer derive or integrate ODE models. A compact way to describe these systems is supplied by rule-based languages. However combinatorial complexity raises again when one attempt to describe formally the behaviour of the models. This motivates the use of abstractions. We propose two methods to reduce the size of the models, that exploit respectively the presence of symmetries between sites and the lack of correlation between different parts of the system. The symmetries relates pairs of sites having the same capability of interactions. We show that this relation induces a bisimulation which can be used to reduce the size of the original model. The information flow analysis detects, for each site, which parts of the system influence its behaviour. This allows us to cut the molecular species in smaller pieces and to write a new system. Moreover we show how this analysis can be tuned with respect to a context. Both approaches can be combined. The analytical solution of the reduced model is the exact projection of the original one. The computation of the reduced model is performed at the level of rules, without the need of executing the original model
Петрасова, Світлана Валентинівна. "Інформаційна технологія ідентифікації знань у наукометричних системах на основі інтелектуального аналізу слабоформалізованих даних." Thesis, НТУ "ХПІ", 2016. http://repository.kpi.kharkov.ua/handle/KhPI-Press/28125.
Full textThesis for a candidate degree in technical sciences, speciality 05.13.06 – Information Technologies. – National Technical University "Kharkiv Polytechnic Institute". – Kharkiv, 2017. The objective of the thesis is to increase the effectiveness of knowledge identi-fication in scientometric systems by designing the models and methods of intelligent analysis of weakly formalized data. The main results are as follows. The current state of the knowledge identification problem in scientometric systems has been analysed. Existing methods for the intelligent analysis of weakly formalized data have been systematized. Thus the basic requirements for designing the information technology of knowledge identification have been formulated. Using the finite predicate algebra in the information and logical models of knowledge identification in Ukrainian and English abstract data of scientometric systems has been proved. The logical-linguistic model of semantically connected fragments identification in weakly formalized abstract information has been developed. The model is based on the use of algebraic-predicate operations that allows effectively extracting knowledge from abstract information. The method for the formalization of semantic relations between entities has been improved. The method is based on the use of the semantic similarity measure and intelligent analysis for the identification of equivalence and tolerance classes that allows defining implicit relations of similarity and relations of taxonomy. The method for comparator identification has got the further development. This method is used to classify abstract fragments in scientometric systems that allows determining common information spaces of scientific interaction by modelling intel-ligence functions of understanding and classification of sense. The information technology of knowledge identification in scientometric systems has been improved. The technology allows identifying common research fronts by defining dynamically implicit connections between abstracts of scientometric systems. The research results have been implemented in the systems of summaries and abstracts processing. Using the developed information technology improves the effectiveness of knowledge identification in weakly formalized data by increasing the average values of the precision and recall measures of semantic similarity of text information. The practical results can be used in information retrieval, expert, and information-analytical general-purpose systems for the formation of electronic catalogues of semantically connected texts in scientometric, library, and abstract systems.
Петрасова, Світлана Валентинівна. "Інформаційна технологія ідентифікації знань у наукометричних системах на основі інтелектуального аналізу слабоформалізованих даних." Thesis, НТУ "ХПІ", 2017. http://repository.kpi.kharkov.ua/handle/KhPI-Press/28123.
Full textThesis for a candidate degree in technical sciences, speciality 05.13.06 – Information Technologies. – National Technical University "Kharkiv Polytechnic Institute". – Kharkiv, 2017. The objective of the thesis is to increase the effectiveness of knowledge identi-fication in scientometric systems by designing the models and methods of intelligent analysis of weakly formalized data. The main results are as follows. The current state of the knowledge identification problem in scientometric systems has been analysed. Existing methods for the intelligent analysis of weakly formalized data have been systematized. Thus the basic requirements for designing the information technology of knowledge identification have been formulated. Using the finite predicate algebra in the information and logical models of knowledge identification in Ukrainian and English abstract data of scientometric systems has been proved. The logical-linguistic model of semantically connected fragments identification in weakly formalized abstract information has been developed. The model is based on the use of algebraic-predicate operations that allows effectively extracting knowledge from abstract information. The method for the formalization of semantic relations between entities has been improved. The method is based on the use of the semantic similarity measure and intelligent analysis for the identification of equivalence and tolerance classes that allows defining implicit relations of similarity and relations of taxonomy. The method for comparator identification has got the further development. This method is used to classify abstract fragments in scientometric systems that allows determining common information spaces of scientific interaction by modelling intel-ligence functions of understanding and classification of sense. The information technology of knowledge identification in scientometric systems has been improved. The technology allows identifying common research fronts by defining dynamically implicit connections between abstracts of scientometric systems. The research results have been implemented in the systems of summaries and abstracts processing. Using the developed information technology improves the effectiveness of knowledge identification in weakly formalized data by increasing the average values of the precision and recall measures of semantic similarity of text information. The practical results can be used in information retrieval, expert, and information-analytical general-purpose systems for the formation of electronic catalogues of semantically connected texts in scientometric, library, and abstract systems.
Real, Lucas Correia Villa. "Uma arquitetura para análise de fluxo de dados estruturados aplicada ao sistema brasileiro de TV digital." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-01092009-151152/.
Full textVarious computing systems transfer data in structured data streams which also happen to be, sometimes, hierarchically organized. Such data stream model is characterized by the dense amount of information transmitted, which requires the receiver to immediately manipulate the elements extracted from that communication channel. The high rate in which data flows also makes it hard, if not impossible, for the receiver to store the desired information in its memory, which makes data flow analysis especially challenging. This work presents a novel structured data flow analysis architecture applied to the logical hierarchy defined by the Brazilian Digital TV System for the transmission of television programs, validated by means of a fully functional reference implementation.
Kissinger, Susan M. "Development of an instructional natural resources information model /." Link to abstract, 2002. http://epapers.uwsp.edu/abstracts/2002/Kissinger.pdf.
Full textColledan, Andrea. "Abstract Machine Semantics for Quipper." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22835/.
Full textPalczynski, Jacob [Verfasser]. "Time-continuous behaviour comparison based on abstract models / Jacob Palczynski." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2014. http://d-nb.info/1051895839/34.
Full textSchmid, Joachim [Verfasser]. "Refinement and implementation techniques for Abstract State Machines / Joachim Schmid." Ulm : Universität Ulm. Fakultät für Informatik, 2002. http://d-nb.info/1015323995/34.
Full textKiselman, Vanda. "Kvalitetsutvärdering av den bibliografiska databasen Historical Abstracts." Thesis, Uppsala University, Department of ALM, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-101672.
Full textTsoupidi, Rodothea Myrsini. "Two-phase WCET analysis for cache-based symmetric multiprocessor systems." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-222362.
Full textUppskattning av längsta exekveringstid (eng. worst-case execution time eller WCET) är ett problem som angår inbyggda system och i synnerhet realtidssystem. Att uppskatta en säker WCET för enkelkärniga system utan spekulativa mekanismer är en utmanande uppgift och ett aktuellt forskningsämne. Tillkomsten av avancerade hårdvarumekanismer, som ofta saknar förutsägbarhet, komplicerar ytterligare de nuvarande analysmetoderna för WCET. Inom fältet för inbyggda system ställs höga säkerhetskrav. Således antas en konservativ inställning till nya spekulativa mekanismer. Trotts detta går säkerhetskritiska system mer och mer i riktning mot multiprocessorsystem. I multiprocessorsystem påverkas en process som exekveras på en processorenhet av processer som exekveras på andra processorenheter. I symmetriska multiprocessorsystem med delade minnen påträffas denna interferens i det delade minnet och den gemensamma bussen. Privata minnen introducerar cache-koherens problem som resulterar i ytterligare beroende mellan processerna. Syftet med detta examensarbete är tvåfaldigt: (1) att utvärdera en befintlig analysmetod för WCET efter integrering av en lågnivå analys och (2) att designa och implementera en cache-baserad flerkärnig WCET-analys genom att utvidga denna enkelkärniga metod. Den enkelkärniga metoden är implementerad i KTH’s Timing Analysis (KTA), ett verktyg för tidsanalys. KTA genomför en så-kallad Abstrakt Sök-baserad Metod som är baserad på Abstrakt Interpretation. Utvärderingen av denna analys innefattar integrering av mikroarkitektur mekanismer, såsom cache-minne och pipeline, i KTA. Dessa mekanismer är nödvändiga för att utvidga analysen till att omfatta de hårdvarumodeller som används idag inom fältet för inbyggda system. Den flerkärniga WCET-analysen genomförs i två steg och uppskattar WCET av en process som körs i närvaron av olika tids och rumsligt störande processer. Första steget registrerar minnesåtkomst för alla tids störande processer, medans andra steget använder sig av första stegets information för att utföra den flerkärniga WCET-analysen. Den flerkärniga analysen förutsätter ett system med privata cache-minnen och en gemensamm buss som implementerar MESI protokolen för att upprätthålla cache-koherens.
Pellitta, Giulio <1984>. "Extending Implicit Computational Complexity and Abstract Machines to Languages with Control." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6558/.
Full textSteinhöfel, Dominic [Verfasser], Reiner [Akademischer Betreuer] Hähnle, and Gilles [Akademischer Betreuer] Barthe. "Abstract Execution: Automatically Proving Infinitely Many Programs / Dominic Steinhöfel ; Reiner Hähnle, Gilles Barthe." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2020. http://d-nb.info/1212584007/34.
Full textStahlbauer, Andreas [Verfasser], Sven [Akademischer Betreuer] Apel, and Willem [Akademischer Betreuer] Visser. "Abstract Transducers for Software Analysis and Verification / Andreas Stahlbauer ; Sven Apel, Willem Visser." Passau : Universität Passau, 2020. http://d-nb.info/1219730890/34.
Full textBerger, Josef. "An infinitesimal approach to stochastic analysis on abstract Wiener spaces." Diss., [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965761444.
Full textAlba, Castro Mauricio Fernando. "Abstract Certification of Java Programs in Rewriting Logic." Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/13617.
Full textAlba Castro, MF. (2011). Abstract Certification of Java Programs in Rewriting Logic [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/13617
Palancia
Steup, Christoph [Verfasser]. "Abstract sensor event processing to achieve dynamic composition of cyber-physical systems / Christoph Steup." Magdeburg : Universitätsbibliothek, 2018. http://d-nb.info/1154485676/34.
Full textCezar, Ivo Martins. "A participatory knowledge information system for beef farmers : a case applied to the State of Mato Grosso do Sul, Brazil." Thesis, University of Edinburgh, 1999. http://webex.lib.ed.ac.uk/abstracts/cezar01.pdf.
Full textStapel, Florian [Verfasser]. "Ontology-based representation of abstract optimization models for model formulation and system generation / Florian Stapel." Paderborn : Universitätsbibliothek, 2016. http://d-nb.info/1108389333/34.
Full textBusatto, Giorgio [Verfasser]. "An abstract model of hierarchical graphs and hierarchical graph transformation / von Giorgio Busatto." Oldenburg : Univ., Fachbereich Informatik, 2002. http://d-nb.info/967851955/34.
Full textFröhling, Judith [Verfasser], Michael [Akademischer Betreuer] Sonnenschein, Oliver [Akademischer Betreuer] Kramer, and Wei Lee [Akademischer Betreuer] Woon. "Abstract flexibility description for virtual power plant scheduling / Judith Fröhling ; Michael Sonnenschein, Oliver Kramer, Wei Lee Woon." Oldenburg : BIS der Universität Oldenburg, 2017. http://d-nb.info/1141904462/34.
Full textFröhling, Judith Verfasser], Michael [Akademischer Betreuer] [Sonnenschein, Oliver [Akademischer Betreuer] Kramer, and Wei Lee [Akademischer Betreuer] Woon. "Abstract flexibility description for virtual power plant scheduling / Judith Fröhling ; Michael Sonnenschein, Oliver Kramer, Wei Lee Woon." Oldenburg : BIS der Universität Oldenburg, 2017. http://d-nb.info/1141904462/34.
Full textPerrin, Olivier. "Un modèle d'intégration d'outils dans les environnements de développement de logiciels." Nancy 1, 1994. http://www.theses.fr/1994NAN10355.
Full textBaumann, Ringo [Verfasser], Gerhard [Akademischer Betreuer] Brewka, Gerhard [Gutachter] Brewka, and Pietro [Gutachter] Baroni. "Metalogical Contributions to the Nonmonotonic Theory of Abstract Argumentation / Ringo Baumann ; Gutachter: Gerhard Brewka, Pietro Baroni ; Betreuer: Gerhard Brewka." Leipzig : Universitätsbibliothek Leipzig, 2014. http://d-nb.info/1238600093/34.
Full textPoguntke, Mark [Verfasser]. "Abstrakte Interaktionsmodelle für die Integration in bestehende Benutzerschnittstellen / Mark Poguntke." Ulm : Universität Ulm, 2016. http://d-nb.info/1096473909/34.
Full textSemmelrock, Nils [Verfasser], and Mila [Akademischer Betreuer] Majster-Cederbaum. "Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations / Nils Semmelrock. Betreuer: Mila Majster-Cederbaum." Mannheim : Universitätsbibliothek Mannheim, 2013. http://d-nb.info/1037076699/34.
Full text