To see the other types of publications on this topic, follow the link: Answer to a book.
Dissertations / Theses on the topic 'Answer to a book'
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 'Answer to a book.'
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.
1
Moody, Kyle Andrew. ""Why so serious?" comics, film and politics, or the comic book film as the answer to the question of identity and narrative in a post-9/11 world /." Oxford, Ohio : Miami University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=miami1249507295.
Full text
2
Wang, Lorraine. "You’re Not a Superhero, or Even an Artist! How the “Alias” Comic Book Holds the Answers." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/scripps_theses/800.
Full textAbstract:
Superhero comic books are not art, and middle-aged, non-white women are not superheroes. I seek to disprove both of these assumptions, and I use the "Alias" comic books from 2001-2004 for my argument.
3
Morais, Eduardo Menezes de. "Answer set programming probabilístico." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/.
Full textAbstract:
Este trabalho introduz uma técnica chamada Answer Set Programming Probabilístico (PASP), que permite a modelagem de teorias complexas e a verificação de sua consistência em relação a um conjunto de dados estatísticos. Propomos métodos de resolução baseados em uma redução para o problema da satisfazibilidade probabilística (PSAT) e um método de redução de Turing ao ASP.<br>This dissertation introduces a technique called Probabilistic Answer Set Programming (PASP), that allows modeling complex theories and check its consistence with respect to a set of statistical data. We propose a method of resolution based in the reduction to the probabilistic satisfiability problem (PSAT) and a Turing reduction method to ASP.
4
Adams, Gator. "Is Silence The Answer?" Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/cmc_theses/1606.
Full textAbstract:
This study examines the relationship between company management guidance, and ex-ante crash risk over the duration of 2008(Jan 2006-Dec 2009) financial crisis using the implied volatility skew, which is based upon ex-ante volatility implied by the pricing model developed by Black-Scholes (1973). The study finds that over the duration of this crisis period, management guidance decreases with a rise in ex-ante crash risk. Further, the study provides evidence on the relationship of management guidance and earnings volatility, and how that is affected by a firm's industry product concentration based on the Herfindahl-Hirschman Index (HHI) score.
5
Almqvist, Johansson Linn. "Skönlitteratur - vägen till läsmotiverade elever? : En kvalitativ intervjustudie om hur lärare anser att skönlitterära bokval och arbetsmetoder påverkar elevers läsmotivation och läsutveckling." Thesis, Luleå tekniska universitet, Institutionen för konst, kommunikation och lärande, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-79225.
Full textAbstract:
Syftet med studien var att undersöka vad klasslärare som arbetar i årskurs F–3 anser påverkar elevers läsmotivation samt hur de uppfattar att skönlitterära bokval och arbetsmetoder påverkar elevernas läsmotivation och läsutveckling. Bakgrundsavsnittet inleds med en redogörelse för hur inre och yttre motivation samt hur bokval och arbetsmetoder påverkar elevernas läsmotivation och läsutveckling. Studien har sin teoretiska utgångspunkt från det sociokulturella perspektivet på lärande samt den motivationsbaserade teorin Self-determination theory. Datan har samlats in med hjälp av kvalitativa semistrukturerade intervjuer med sex olika klasslärare. Intervjuerna spelades in till ljudfiler för att sedan transkriberas och sammanfattas med de olika steg som ingår i en innehållsanalys. Resultatet som framkommit visar att de tillfrågade klasslärarna i enlighet med den tidigare forskning som bearbetats anser att läsmotivation kan öka elevers läsutveckling. Eftersom motivation inte är beständigt tycks det anses viktigt att klasslärarna alltid utgår från eleverna och deras intressen och erfarenheter vid arbete med skönlitteratur för att läsmotivationen ska bibehållas. Resultatet visar även att klasslärarna i enhet med tidigare forskning anser att tid är avgörande för att eleverna ska utveckla sin läsmotivation till den grad att de så småningom ska kunna bli en del av vårt kunskapssamhälle.<br>The purpose of the study was to investigate what classroom teachers working in grades F–3 consider affecting pupils’ reading motivation and how they perceive that fictional book choices and working methods affect pupils’ reading motivation and reading development. The background section begins with a description of how intrinsic and extrinsic motivation as well as how choosing fiction and teaching methods affects the pupils’ reading motivation and reading development. The study has its theoretical starting point in the sociocultural perspective and in the Self-determination theory. The data of the study has been gathered through qualitative semi-structured interviews with six different primary school teachers. The interviews were recorded as audio files to be transcribed and then be summarised with the different steps by the analysis method. The result shows that, in accordance with the previous research, the asked classroom teachers believe that reading motivation can increase pupils’ reading development. Since motivation is not constant, it is important that the primary school teachers always has the students interests and experiences in mind while working with fiction in order to maintain reading motivation. The result also shows that the classroom teachers as well as previous research think that time is crucial for the pupils to develop their reading motivation to the extent that they eventually can become part of our knowledge society.
6
Yerikalapudi, Aparna Varsha. "Answer Extraction In Automated Reasoning." Scholarly Repository, 2008. http://scholarlyrepository.miami.edu/oa_theses/167.
Full textAbstract:
One aspect of Automated Reasoning (AR) deals with writing computer programs that can answer questions using logical reasoning. An Automated Theorem Proving system (ATP system) translates a question to be answered to a first-order logic conjecture, and attempts to prove the conjecture from a set of axioms provided, thereby leading to a proof. If a proof is found an answer extraction method can be applied to answer the original question. If more than one proof is possible, more than one answer may need to be extracted. For ATP systems that can find only one answer at a time, to answer questions that yield multiple answers, the ATP system can be re-invoked with a modified question to find other possible answers. In this thesis, an answer extraction method has been designed to extract more than one answer when an ATP system is used to answer a question that has multiple answers. The method is implemented in an interactive computer program and the process is called multiple-answer extraction. The answer extraction software, called the multi-answer system, is a three layered software architecture model. SNARK, at the bottom-most layer, serves as the ATP system that finds single answers. The answer extractor, in the middle layer, extracts possible answers by re-invoking the ATP system. The top layer compares the answers extracted to the user's expected answers. The software is command line driven. Keywords such as all, some, n (where n is a number), while and until are specified on the command line to limit the number of answers to be extracted. The top layer allows the user to check properties of the answer, e.g., if a specific element belongs to the set of answers obtained, or if the user's set of answers is a subset of the answers returned by the multi-answer system. This is done using set operations, such as subset, element of, union, difference, intersection, on the user's set of answers and the extracted set of answers.
7
Konczak, Kathrin. "Preferences in answer set programming." Phd thesis, Universität Potsdam, 2007. http://opus.kobv.de/ubp/volltexte/2007/1205/.
Full text
8
Muthmann, Klemens. "Community based Question Answer Detection." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-144719.
Full textAbstract:
Each day, millions of people ask questions and search for answers on the World Wide Web. Due to this, the Internet has grown to a world wide database of questions and answers, accessible to almost everyone. Since this database is so huge, it is hard to find out whether a question has been answered or even asked before. As a consequence, users are asking the same questions again and again, producing a vicious circle of new content which hides the important information.
One platform for questions and answers are Web forums, also known as discussion boards. They present discussions as item streams where each item contains the contribution of one author. These contributions contain questions and answers in human readable form.
People use search engines to search for information on such platforms. However, current search engines are neither optimized to highlight individual questions and answers nor to show which questions are asked often and which ones are already answered.
In order to close this gap, this thesis introduces the \\emph{Effingo} system. The Effingo system is intended to extract forums from around the Web and find question and answer items. It also needs to link equal questions and aggregate associated answers. That way it is possible to find out whether a question has been asked before and whether it has already been answered. Based on these information it is possible to derive the most urgent questions from the system, to determine which ones are new and which ones are discussed and answered frequently. As a result, users are prevented from creating useless discussions, thus reducing the server load and information overload for further searches.
The first research area explored by this thesis is forum data extraction. The results from this area are intended be used to create a database of forum posts as large as possible. Furthermore, it uses question-answer detection in order to find out which forum items are questions and which ones are answers and, finally, topic detection to aggregate questions on the same topic as well as discover duplicate answers. These areas are either extended by Effingo, using forum specific features such as the user graph, forum item relations and forum link structure, or adapted as a means to cope with the specific problems created by user generated content. Such problems arise from poorly written and very short texts as well as from hidden or distributed information.
9
Wu, Lynn 1981. "Prism : an answer projection system." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/18021.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>MIT Institute Archives copy: p. 29-56 bound in reverse order.<br>Includes bibliographical references (p. 54-56).<br>Prism is an answer projection system that combines the best attributes of traditional and Web-based question answering systems. Traditional question answering systems retrieve answers with pinpoint accuracy but limited coverage, using a small and reliable data source, while Web-based systems retrieve answers with broad coverage but limited accuracy, using a large but noisy data source. By taking advantage of the strengths of each system, an answer projection system can answer as many questions as a Web-based system while still being as accurate as a traditional system. In fact, Prism improves the performance of a traditional question answering system by 25%. It improves the accuracy of answers retrieved from the World Wide Web by 10%, and more importantly, it verifies answers retrieved from the Web by providing reliable supporting documents. By combining Prism with traditional and Web-based systems, we obtain a question answering system with high accuracy and broad coverage.<br>by Lynn Wu.<br>M.Eng.
10
Stafford, Tammy. "The Effect of Question-Answer Relationships on Ninth-Grade Students' Ability to Accurately Answer Comprehension Questions." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5515.
Full textAbstract:
This experimental research study examined the effects of the Question-Answer Relationships (QAR) taxonomy on ninth-grade students' ability to answer comprehension questions. Participants included 32 incoming ninth-grade students who were required to attend summer school due to poor attendance, grades, and/or standardized test scores. Participants were randomly assigned to experimental and control groups. Experimental group participants received one week of initial strategy instruction followed by three weeks of maintenance activities. Results indicated that the strategy had a negative effect on students' question-answering ability and raised questions regarding comprehension instruction, length of interventions, and the role of scaffolded support for a target population of adolescent readers. Discussion of the results revolves around interventions, QAR instruction, reading ability, and motivation of the participants.<br>Ed.D.<br>Doctorate<br>Education and Human Performance<br>Education
11
Sualp, Merter. "Answer Localization System Using Discourse Evaluation." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605628/index.pdf.
Full textAbstract:
The words in a language not only help us to construct the sentences but also contain some other features, which we usually underestimate. Each word relates itself to the
remaining ones in some way. In our daily lives, we extensively use these relations in many areas, where question direction is also one of them.
In this work, it is investigated whether the relations between the words can be useful for question direction and an approach for question direction is presented.
Besides, a tool is devised in the way of this approach for a course given in Turkish.
The relations between the words are represented by a semantic network for nouns and verbs. By passing through the whole course material and using the relations
meronymy for only nouns<br>synonymy, antonymy, hypernymy, coordinated words for both nouns and verbs<br>entailment and causality for only verbs, the semantic
network, which is the backbone of the application, is constructed.
The end product of our research consists of three modules:
·<br>getting the question from the user and constructing the set of words that are related to the words that make up the question
·<br>scoring each course section by comparing the words of the question set and the words in the section
·<br>presenting the sections that may contain the answer
The sections that are evaluated are taken as the sections of the course for granted.
The chat logs that expand three years of the course were taken by permission and questions were extracted from them. They were used for testing purposes of the
constructed application.
12
Law, Mark. "Inductive learning of answer set programs." Thesis, Imperial College London, 2018. http://hdl.handle.net/10044/1/64824.
Full textAbstract:
The goal of Inductive Logic Programming (ILP) is to find a hypothesis that explains a set of examples in the context of some pre-existing background knowledge. Until recently, most research on ILP targeted learning definite logic programs. This thesis constitutes the first comprehensive work on learning answer set programs, introducing new learning frameworks, theoretical results on the complexity and generality of these frameworks, algorithms for learning ASP programs, and an extensive evaluation of these algorithms. Although there is previous work on learning ASP programs, existing learning frameworks are either brave -- where examples should be explained by at least one answer set -- or cautious where examples should be explained by all answer sets. There are cases where brave induction is too weak and cautious induction is too strong. Our proposed frameworks combine brave and cautious learning and can learn ASP programs containing choice rules and constraints. Many applications of ASP use weak constraints to express a preference ordering over the answer sets of a program. Learning weak constraints corresponds to preference learning, which we achieve by introducing ordering examples. We then explore the generality of our frameworks, investigating what it means for a framework to be general enough to distinguish one hypothesis from another. We show that our frameworks are more general than both brave and cautious induction. We also present a new family of algorithms, called ILASP (Inductive Learning of Answer Set Programs), which we prove to be sound and complete. This work concerns learning from both non-noisy and noisy examples. In the latter case, ILASP returns a hypothesis that maximises the coverage of examples while minimising the length of the hypothesis. In our evaluation, we show that ILASP scales to tasks with large numbers of examples finding accurate hypotheses even in the presence of high proportions of noisy examples.
13
Alves, Ricardo Jorge de Aragão Vaz. "Database repairs with answer set programming." Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6325.
Full textAbstract:
Dissertação para obtenção do Grau de Mestre em
Engenharia Informática<br>Integrity constraints play an important part in database design. They are what allow
databases to store accurate information, since they impose some properties that must
always hold. However, none of the existing Database Management Systems allows the
specification of new integrity constraints if the information stored is already violating
these new integrity constraints.
In this dissertation, we developed DRSys, an application that allows the user to specify
integrity constraints that he wishes to enforce in the database. If the database becomes
inconsistent with respect to such integrity constraints, DRSys returns to the user possible ways to restore consistency, by inserting or deleting tuples into/from the original database, creating a new consistent database, a database repair. Also, since we are dealing with databases, we want to change as little information as possible, so DRSys offers the user two distinct minimality criteria when repairing the database: minimality under set inclusion or minimality under cardinality of operations.
We approached the database repairing problem by using the capacity of problem solving
offered by Answer Set Programming (ASP), which benefits from the simple specification
of problems, and the existence of “Solvers” that solve those problems in an efficient
manner.
DRSys is a database repair application that was built on top of the database management
system PostgreSQL. Furthermore, we developed a graphical user interface, to aid
the user in the whole process of defining new integrity constraints and in the process of database repairing.
We evaluate the performance and scalability of DRSys, by presenting several tests in
different situations, exploring particular features of it as well, in order to understand the scalability of DRSys.
14
Creek, Richard David. "Kant's Negative Answer to Molyneux's Question." Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/48429.
Full textAbstract:
While it has recently been argued that Kant's views about space in the Transcendental Aesthetic do not commit him to an affirmative answer to Molyneux's question, there has been very little attention given to the issue of what a Kantian negative answer would look like. The paper begins by defending the view that the arguments of the Aesthetic alone do not provide a direct answer to Molyneux's question. I will then argue that addressing Molyneux's question on Kant's behalf is much more complicated, requiring us to pay special attention to his views on the relationship between vision and touch, the specific sort of concepts that are relevant, and some issues involving the schemata for these concepts. To this end, I will examine the extent to which different considerations in each of these areas lead to radically different, competing answers to Molyneux's question. When difficulties surrounding both of these possible answers are examined, the modified framework that is left standing will support a negative answer.<br>Master of Arts
15
Zepeda, Cortès Claudia. "Evacuation planning using Answer Set Programming." Lyon, INSA, 2005. http://theses.insa-lyon.fr/publication/2005ISAL0117/these.pdf.
Full textAbstract:
Actuellement, les responsables de la protection contre les situations de désastre doivent prendre les décisions sur la préparation et l'exécution des plans d'évacuation en considérant les causes potentielles du désastre. Pour cette raison, il est souhaitable de développer un système capable d'obtenir et d'analyser les plans d'évacuation basés sur la connaissance du milieu particulier, des données géographiques et de leurs propres capacités et d'échanger l'information et les services avec des systèmes semblables comme pour les êtres humains. Pour développer un tel système, on utilisera Answer Set Programming (ASP). ASP est un langage de programmation logique et déclaratif pour la représentation de la connaissance. ASP représente un nouveau paradigme pour la représentation logique qui permet, selon le concept de la négation par échec, de résoudre des problèmes avec la connaissance par défaut et de permettre un raisonnement non- monotone. L'objectif de notre travail est précisément de faire des recherches et d'évaluer les capacités de ASP à représenter des situations de désastre ayant pour objectif d'aider à définir des plans d'évacuation. La motivation de notre travail se base sur l'idée que ASP possède de nombreuses qualités qu'un tel programme doit avoir: Il est possible de traduire l'information géographique dans un format que ASP peut comprendre. Il existe Answer Set Planning qui procure une manière naturelle et élégante de modeler les problèmes de planification. ASP utilise le concept de négation par échec qui permet d'exprimer des exceptions, des restrictions et de représenter une connaissance incomplète. Il existe en plus, dans ASP, plusieurs approches afin d'exprimer des préférences<br>Currently, the persons in charge of protection against the situations of disaster must make the decisions on the preparation and the execution of the evacuation plans by considering the potential causes of the disaster. For this reason, it is desirable to develop a system able to generate and analyse the evacuation plans based on the knowledge of the particular situation, the geographical data and their own capacities, and to exchange information and the services. To develop such a system, one can use Answer Set Programming (ASP). ASP is a logical and declarative programming language for the representation of knowledge. ASP represents a new paradigm for the logical representation which allows, by using the concept of negation by failure, to solve problems with knowledge by default and to allow not-monotonous reasoning. The objective of our work is precisely to carry out research and to evaluate the capacities of ASP to represent simulations of disaster having for objective to help define evacuation plans. The motivation of our work is based on the idea that ASP has many qualities that such a program must have: it is possible to translate geographical information in a format that ASP can understand. There is an Answer Set Planning which gets a manner natural and elegant to model the problems of planning. ASP uses the concept of negation by failure which makes it possible to express exceptions, restrictions and to represent incomplete knowledge. There exists moreover, in ASP, several approaches in order to express preferences
16
Zepeda, Cortès Claudia Laurini Robert Sol Martínez David. "Evacuation planning using answer set programming." Villeurbanne : Doc'INSA, 2006. http://docinsa.insa-lyon.fr/these/pont.php?id=zepeda_cortes.
Full textAbstract:
Thèse doctorat : Informatique : Villeurbanne, INSA : 2005. Thèse doctorat : Informatique : Universidad de las Américas-Puebla : 2005.<br>Thèse soutenue en co-tutelle. Thèse rédigée en français, en anglais et en espagnol. Titre provenant de l'écran-titre. Bibliogr. p. 229-236.
17
Zhao, Jicheng. "A study of answer set programming /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20ZHAO.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.<br>Includes bibliographical references (leaves 49-51). Also available in electronic version. Access restricted to campus users.
18
Ward, Jeffrey Alan. "Answer set programming with clause learning." Connect to this title online, 2004. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1092840020.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2004.<br>Title from first page of PDF file. Document formatted into pages; contains xv, 170 p. : ill. Advisors: Timothy J. Long and John S. Schlipf, Department of Computer Science and Engineering. Includes bibliographical references (p. 165-170).
19
Thiele, Sven. "Modeling biological systems with Answer Set Programming." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2012/5938/.
Full textAbstract:
Biology has made great progress in identifying and measuring the building blocks of life. The availability of high-throughput methods in molecular biology has dramatically accelerated the growth of biological knowledge for various organisms. The advancements in genomic, proteomic and metabolomic technologies allow for constructing complex models of biological systems. An increasing number of biological repositories is available on the web, incorporating thousands of biochemical reactions and genetic regulations.
Systems Biology is a recent research trend in life science, which fosters a systemic view on biology. In Systems Biology one is interested in integrating the knowledge from all these different sources into models that capture the interaction of these entities. By studying these models one wants to understand the emerging properties of the whole system, such as robustness.
However, both measurements as well as biological networks are prone to considerable incompleteness, heterogeneity and mutual inconsistency, which makes it highly non-trivial to draw biologically meaningful conclusions in an automated way. Therefore, we want to promote Answer Set Programming (ASP) as a tool for discrete modeling in Systems Biology. ASP is a declarative problem solving paradigm, in which a problem is encoded as a logic program such that its answer sets represent solutions to the problem. ASP has intrinsic features to cope with incompleteness, offers a rich modeling language and highly efficient solving technology.
We present ASP solutions, for the analysis of genetic regulatory networks, determining consistency with observed measurements and identifying minimal causes for inconsistency. We extend this approach for computing minimal repairs on model and data that restore consistency. This method allows for predicting unobserved data even in case of inconsistency.
Further, we present an ASP approach to metabolic network expansion. This approach exploits the easy characterization of reachability in ASP and its various reasoning methods, to explore the biosynthetic capabilities of metabolic reaction networks and generate hypotheses for extending the network.
Finally, we present the BioASP library, a Python library which encapsulates our ASP solutions into the imperative programming paradigm. The library allows for an easy integration of ASP solution into system rich environments, as they exist in Systems Biology.<br>In den letzten Jahren wurden große Fortschritte bei der Identifikation und Messung der Bausteine des Lebens gemacht. Die Verfügbarkeit von Hochdurchsatzverfahren in der Molekularbiology hat das Anwachsen unseres biologischen Wissens dramatisch beschleunigt. Durch die technische Fortschritte in Genomic, Proteomic und Metabolomic wurde die Konstruktion komplexer Modelle biologischer Systeme ermöglicht. Immer mehr biologische Datenbanken sind über das Internet verfügbar, sie enthalten tausende Daten biochemischer Reaktionen und genetischer Regulation.
System Biologie ist ein junger Forschungszweig der Biologie, der versucht Biologische Systeme in ihrer Ganzheit zu erforschen. Dabei ist man daran interessiert möglichst viel Wissen aus den unterschiedlichsten Bereichen in ein Modell zu aggregieren, welches das Zusammenwirken der verschiedensten Komponenten nachbildet. Durch das Studium derartiger Modelle erhofft man sich ein Verständnis der aufbauenden Eigenschaften, wie zum Beispiel Robustheit, des Systems zu erlangen.
Es stellt sich jedoch die Problematik, das sowohl die biologischen Modelle als auch die verfügbaren Messwerte, oft unvollständig, miteinander unvereinbar oder fehlerhaft sind. All dies macht es schwierig biologisch sinnvolle Schlussfolgerungen zu ziehen.
Daher, möchten wir in dieser Arbeit Antwortmengen Programmierung (engl. Answer Set Programming; ASP) als Werkzeug zur diskreten Modellierung system biologischer Probleme vorschlagen. ASP verfügt über eingebaute Eigenschaften zum Umgang mit unvollständiger Information, eine reichhaltige Modellierungssprache und hocheffiziente Berechnungstechniken.
Wir präsentieren ASP Lösungen zur Analyse von Netzwerken genetischer Regulierungen, zur Prüfung der Konsistenz mit gemessene Daten, und zur Identifikation von Gründen für Inkonsistenz. Diesen Ansatz erweitern wir um die Möglichkeit zur Berechnung minimaler Reparaturen an Modell und Daten, welche Konsistenz erzeugen. Mithilfe dieser Methode werden wir in die Lage versetzt, auch im Fall von Inkonsistenz, noch ungemessene Daten vorherzusagen.
Weiterhin, präsentieren wir einen ASP Ansatz zur Analyse metabolischer Netzwerke. Bei diesem Ansatz, nutzen wir zum einen aus das sich Erreichbarkeit mit ASP leicht spezifizieren lässt und das ASP mehrere mächtige Methoden zur Schlussfolgerung bereitstellt, welche sich auch kombiniert lassen. Dadurch wird es möglich die Synthese Möglichkeiten eines Metabolischen Netzwerks zu erforschen und Hypothesen für Erweiterungen des metabolischen Netzwerks zu berechnen.
Zu guter Letzt, präsentieren wir die BioASP Softwarebibliothek. Die BioASP-Bibliothek kapselt unsere ASP Lösungen in das imperative Programmierparadigma und vereinfacht eine Integration von ASP Lösungen in heterogene Betriebsumgebungen, wie sie in der System Biologie vorherrschen.
20
WINSNES, CASPER, and GUSTAV ZANDER. "Solving Heyawake puzzles using Answer Set Programming." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157344.
Full textAbstract:
Den här rapporten undersöker automatisk lösning av Heyawakepussel genom att använda Answer Set Programming. Heyawake är på många sätt likt det mer välkända Sudoku men har inte blivit lika efterforskat vilket gör spelet väldigt intressant att undersöka.Spelet är bevisat NP-fullständigt så fokus har legat på att implementera lösaren istället för att göra den så snabb som möjligt men endel optimeringar har ändå gjorts.Answer Set Programming ha länge använts för att lösa NP-fullständiga problem och för Heyawake är det möjligt att lösa normalstora pussel väldigt snabbt. För att optimera lösaren krävs djupgående kunskaper om Answer Set Programming-lösaren som används.<br>This report exmamines automatic solving of Heyawake puzzles usingAnswer Set Programming. Heyawake is somewhat similar to the morewell known Sudoku but has not been as extensively researched whichmakes the game very interesting to examine.The game has previously been proven to be NP-complete so the focushas been on implementing the solver instead of making it fast althoughsome optimizations has been made.Answer Set Programming has long been used to solve NP-completeproblems and for Heyawake it is possible to solve normal sized puzzlesvery fast. Optimizing the solver proved to be hard unless you have extensiveknowledge of the Answer Set Programming solver that is used.
21
Richards, Samuel. "Can Adam Smith Answer the Normative Question?" Digital Archive @ GSU, 2013. http://digitalarchive.gsu.edu/philosophy_theses/131.
Full textAbstract:
In The Sources of Normativity, Christine Korsgaard argues that in order to avoid the threat of moral skepticism, our moral theories must show how the claims they make about the nature of our actions obligate us to act morally. A theory that can justify the normativity of morality in this way answers what Korsgaard calls “the normative question.” Although Korsgaard claims that only Kantian theories of morality, such as her own, can answer the normative question, I argue that Adam Smith’s sentimentalist moral theory, as presented in The Theory of Moral Sentiments, can answer the normative question as well. As a result, it is possible to respond to the moral skeptic in the way Korsgaard outlines without accepting some of the theoretical drawbacks of Korsgaard’s own moral theory.
22
Joty, Shafiz Rayhan, and University of Lethbridge Faculty of Arts and Science. "Answer extraction for simple and complex questions." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2008, 2008. http://hdl.handle.net/10133/666.
Full textAbstract:
When a user is served with a ranked list of relevant documents by the standard document
search engines, his search task is usually not over. He has to go through the entire
document contents to find the precise piece of information he was looking for. Question
answering, which is the retrieving of answers to natural language questions from a document
collection, tries to remove the onus on the end-user by providing direct access to
relevant information. This thesis is concerned with open-domain question answering. We
have considered both simple and complex questions. Simple questions (i.e. factoid and
list) are easier to answer than questions that have complex information needs and require
inferencing and synthesizing information from multiple documents.
Our question answering system for simple questions is based on question classification
and document tagging. Question classification extracts useful information (i.e. answer
type) about how to answer the question and document tagging extracts useful information
from the documents, which is used in finding the answer to the question.
For complex questions, we experimented with both empirical and machine learning approaches.
We extracted several features of different types (i.e. lexical, lexical semantic,
syntactic and semantic) for each of the sentences in the document collection in order to
measure its relevancy to the user query. One hill climbing local search strategy is used
to fine-tune the feature-weights. We also experimented with two unsupervised machine
learning techniques: k-means and Expectation Maximization (EM) algorithms and evaluated
their performance. For all these methods, we have shown the effects of different kinds
of features.<br>xi, 214 leaves : ill. (some col.) ; 29 cm. --
23
Pang, Po-yee Patricia, and 彭寶儀. "Institutional talk: question-answer sequencesin classroom interaction." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B26839568.
Full text
24
Sen, Tanmoy. "Platform Ecosystem : ARM's answer to Intel's dominance." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/111290.
Full textAbstract:
Thesis: S.M. in Engineering and Management, Massachusetts Institute of Technology, Engineering Systems Division, 2014.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 60-63).<br>The personal computing industry has witnessed significant changes with more users moving from desktop PCs to battery-operated mobile devices. These dynamics have prompted chip-design companies to evaluate ways to lower the power consumption of devices, thereby elongating battery life. With its lower power microprocessor-core architecture, a newer and smaller company, ARM Holdings, has been able to challenge the much bigger incumbent Intel and capture significant market share by creating a powerful ecosystem based on strategic partnerships. This thesis will evaluate how ARM's 'design and license' business model based on a platform ecosystem-partnerships with Original Equipment Manufacturers (OEMs), semiconductor companies, and software developers, has been able to counter Intel's vertically-integrated business model. This thesis will discuss the details of underlying technologies - Intel's high speed vs. ARM's low power architectures, and further evaluate how ARM gives its partners more customizing power and the ability to differentiate its products with respect to competitors that also use the ARM architecture.<br>by Tanmoy Sen.<br>S.M. in Engineering and Management
25
Cao, Haoliang. "Automating Question Generation Given the Correct Answer." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287460.
Full textAbstract:
In this thesis, we propose an end-to-end deep learning model for a question generation task. Given a Wikipedia article written in English and a segment of text appearing in the article, the model can generate a simple question whose answer is the given text segment. The model is based on an encoder-decoder architecture. Our experiments show that a model with a fine-tuned BERT encoder and a self-attention decoder give the best performance. We also propose an evaluation metric for the question generation task, which evaluates both syntactic correctness and relevance of the generated questions. According to our analysis on sampled data, the new metric is found to give better evaluation compared to other popular metrics for sequence to sequence tasks.<br>I den här avhandlingen presenteras en djup neural nätverksmodell för en frågeställningsuppgift. Givet en Wikipediaartikel skriven på engelska och ett textsegment i artikeln kan modellen generera en enkel fråga vars svar är det givna textsegmentet. Modellen är baserad på en kodar-avkodararkitektur (encoderdecoder architecture). Våra experiment visar att en modell med en finjusterad BERT-kodare och en självuppmärksamhetsavkodare (self-attention decoder) ger bästa prestanda. Vi föreslår också en utvärderingsmetrik för frågeställningsuppgiften, som utvärderar både syntaktisk korrekthet och relevans för de genererade frågorna. Enligt vår analys av samplade data visar det sig att den nya metriken ger bättre utvärdering jämfört med andra populära metriker för utvärdering.
26
Mur, Jori. "Off-line answer extraction for question answering." [S.l. : [Groningen : s.n.] ; University Library Groningen] [Host], 2008. http://irs.ub.rug.nl/ppn/.
Full text
27
Nielsen, Rodney D. "Learner answer assessment in Intelligent Tutoring Systems." Connect to online resource, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3303833.
Full text
28
Diamond, Alan. "Discovery in the Court of Chancery : the rule that a defendant who submits to answer must answer fully, 1673-1875." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316701.
Full text
29
Deng, Yu. "Using ontologies to improve answer quality in databases." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3510.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2006.<br>Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
30
Gebser, Martin. "Proof theory and algorithms for answer set programming." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2011/5542/.
Full textAbstract:
Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems.
ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving.
We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns.
The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them.
We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found.
Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.<br>Antwortmengenprogrammierung (engl. Answer Set Programming; ASP) ist ein Paradigma zum deklarativen Problemlösen, wobei Problemstellungen durch logische Programme beschrieben werden, sodass bestimmte Modelle, Antwortmengen genannt, zu Lösungen korrespondieren. Die zunehmenden praktischen Anwendungen von ASP verlangen nach performanten Werkzeugen zum Lösen komplexer Problemstellungen.
ASP integriert diverse Konzepte aus verwandten Bereichen. Insbesondere sind automatisierte Techniken für die Suche nach Antwortmengen durch Verfahren zum Lösen des aussagenlogischen Erfüllbarkeitsproblems (engl. Boolean Satisfiability; SAT) inspiriert. Letztere beruhen auf soliden beweistheoretischen Grundlagen, wohingegen es für ASP kaum formale Systeme gibt, um Lösungsmethoden einheitlich zu beschreiben und miteinander zu vergleichen. Weiterhin basiert der Erfolg moderner Verfahren zum Lösen von SAT entscheidend auf fortgeschrittenen Suchtechniken, die in gängigen Methoden zur Antwortmengenberechnung nicht etabliert sind.
Diese Arbeit entwickelt beweistheoretische Grundlagen und fortgeschrittene Suchtechniken im Kontext der Antwortmengenberechnung. Unsere formalen Beweissysteme ermöglichen die Charakterisierung, den Vergleich und die Analyse vorhandener Lösungsmethoden für ASP. Außerdem entwerfen wir moderne Verfahren zum Lösen von ASP, die fortgeschrittene Suchtechniken aus dem SAT-Bereich integrieren und erweitern. Damit trägt diese Arbeit sowohl zum tieferen Verständnis von Lösungsmethoden für ASP und ihrer Beziehungen untereinander als auch zu ihrer Verbesserung durch die Erschließung fortgeschrittener Suchtechniken bei.
Die zentrale Idee unseres Ansatzes besteht darin, Atome und komposite Konstrukte innerhalb von logischen Programmen gleichermaßen mit aussagenlogischen Variablen zu assoziieren. Dies ermöglicht die Isolierung fundamentaler Inferenzschritte, die wir in formalen Charakterisierungen von Lösungsmethoden für ASP selektiv miteinander kombinieren können. Darauf aufbauend zeigen wir, dass unterschiedliche Einschränkungen von Fallunterscheidungen zwangsläufig zu exponentiellen Effizienzunterschieden zwischen den charakterisierten Methoden führen. Wir generalisieren unseren beweistheoretischen Ansatz auf logische Programme mit erweiterten Sprachkonstrukten und weisen analytisch nach, dass das Treffen bzw. Unterlassen von Fallunterscheidungen auf solchen Konstrukten ebenfalls exponentielle Effizienzunterschiede bedingen kann.
Die zuvor beschriebenen fundamentalen Inferenzschritte nutzen wir zur Extraktion inhärenter Bedingungen, denen Antwortmengen genügen müssen. Damit schaffen wir eine Grundlage für den Entwurf moderner Lösungsmethoden für ASP, die fortgeschrittene, ursprünglich für SAT konzipierte, Suchtechniken mit einschließen und darüber hinaus einen transparenten Technologietransfer zwischen Verfahren zum Lösen von ASP und SAT erlauben. Neben der Suche nach einer Antwortmenge behandeln wir ihre Aufzählung, sowohl für gesamte Antwortmengen als auch für Projektionen auf ein Subvokabular. Hierfür entwickeln wir neuartige Methoden, die wiederholungsfreies Aufzählen in polynomiellem Platz ermöglichen, ohne die Suche zu beeinflussen und ggf. zu behindern, bevor Antwortmengen berechnet wurden.
31
Kasimir, Elke. "Question-answer test and givenness : some question marks." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/869/.
Full textAbstract:
In order to investigate the empirical properties of focus, it is necessary
to diagnose focus (or: "what is focused") in particular linguistic
examples. <br>It is often taken for granted that the application of one
single diagnostic tool, the so-called question-answer test, which
roughly says that whatever a question asks for is focused in the
answer, is a fool-proof test for focus. <br>This paper investigates one
example class where such uncritical belief in the question-answer test
has led to the assumption of rather complex focus projection rules: in
these examples, pitch accent placement has been claimed to depend on
certain parts of the focused constituents being given or not. <br>It is
demonstrated that such focus projection rules are unnecessarily
complex and in turn require the assumption of unnecessarily
complicated meaning rules, not to speak of the difficulties to give a
precise semantic/pragmatic definition of the allegedly involved
givenness property. <br>For the sake of the argument, an alternative
analysis is put forward which relies solely on alternative sets
following Mats Rooth's work, and avoids any recourse to givenness.<br>
As it turns out, this alternative analysis is not only simpler but also
makes in a critical case the better predictions.
32
Souther, David F. "How does God answer your most important questions?" Theological Research Exchange Network (TREN) Access this title online, 2005. http://www.tren.com.
Full text
33
Ibarra, Roberto. "Modernization through education the answer for combating terrorism." Thesis, Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/5683.
Full textAbstract:
Approved for public release; distribution is unlimited.<br>in combating terrorism. A comparative analysis in this thesisillustrates that education by itself does not prevent terrorism. Other causal factors must be considered when addressing individuals who do commit terrorist acts. This thesis will use the cases of the Liberation Tamil Tigers of Eelam (LTTE) in Sri Lanka and eleven profiles of educated individuals who were involved in terrorist acts as counterexamples to the education-only theory. It will also discuss present U.S. operations in Afghanistan that focus on education, and present proposals to improve the social and economic conditions that are necessary aspects of reforms being neglected.
34
Krug, Damon Brian. "Transfer of information : is relational processing the answer?" Virtual Press, 1990. http://liblink.bsu.edu/uhtbin/catkey/720153.
Full textAbstract:
The present research focused on the transfer of information from a learning situation to a problem solving task. In particular, the effect of relational processing upon the transfer of information to the solution of insight problems was considered.The design of the study was a five by two factorial design. Within this design the independent variables were five levels of relational processing, ranging from full relational processing (essay) to individual item processing (deleted letter list) and two levels of instruction, informed and uninformed. The dependent measure was the number of insight problems correctly solved. The problems consisted of ten statements which did not make sense unless one part of the sentence was modified. The subject's task was to supply the necessary information needed to make sense of the sentence.The results showed no effect for type of instruction and there was no interaction between the type of instruction and level of relational processing. There was a significant effect due to level of relational processing. More specifically, the essay condition lead to the greatest amount and individually processed items lead to the lowest amount of information transfer. Further, it was suggested that the relationship between relational processing and the transfer of information was linear. These findings were interpreted as indicating that relational processing was a significant factor in explaining the transfer of information.<br>Department of Educational Psychology
35
Mohamed, Zaki Ali Mona. "Investigating data quality in question and answer reports." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/investigating-data-quality-in-question-and-answer-reports(169f4905-c73b-40e3-9203-f3cec05fa45f).html.
Full textAbstract:
Data Quality (DQ) has been a long-standing concern for a number of stakeholders in a variety of domains. It has become a critically important factor for the effectiveness of organisations and individuals. Previous work on DQ methodologies have mainly focused on either the analysis of structured data or the business-process level rather than analysing the data itself. Question and Answer Reports (QAR) are gaining momentum as a way to collect responses that can be used by data analysts, for instance, in business, education or healthcare. Various stakeholders benefit from QAR such as data brokers and data providers, and in order to effectively analyse and identify the common DQ problems in these reports, the various stakeholders' perspectives should be taken into account which adds another complexity for the analysis. This thesis investigates DQ in QAR through an in-depth DQ analysis and provide solutions that can highlight potential sources and causes of problems that result in "low-quality" collected data. The thesis proposes a DQ methodology that is appropriate for the context of QAR. The methodology consists of three modules: question analysis, medium analysis and answer analysis. In addition, a Question Design Support (QuDeS) framework is introduced to operationalise the proposed methodology through the automatic identification of DQ problems. The framework includes three components: question domain-independent profiling, question domain-dependent profiling and answers profiling. The proposed framework has been instantiated to address one example of DQ issues, namely Multi-Focal Question (MFQ). We introduce MFQ as a question with multiple requirements; it asks for multiple answers. QuDeS-MFQ (the implemented instance of QuDeS framework) has implemented two components of QuDeS for MFQ identification, these are question domain-independent profiling and question domain-dependent profiling. The proposed methodology and the framework are designed, implemented and evaluated in the context of the Carbon Disclosure Project (CDP) case study. The experiments show that we can identify MFQs with 90% accuracy. This thesis also demonstrates the challenges including the lack of domain resources for domain knowledge representation, such as domain ontology, the complexity and variability of the structure of QAR, as well as the variability and ambiguity of terminology and language expressions and understanding stakeholders or users need.
36
Ackerman, Mark S. "Answer garden : a tool for growing organizational memory." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12233.
Full text
37
McCook, Judy G., and Patricia Vanhook. "HELP SARA: An Answer to Rural SANE Shortage." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etsu-works/7176.
Full text
38
Horner, Jean M. "Delightful Density: The Answer to Suburbia's Missing Pedestrian." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/32509.
Full textAbstract:
The Pedestrian is compromised in the majority of our built landscapes. Today's dominant fixture is the automobile. Pedestrian and automobile efficiency are in direct competition with each other; to facilitate one is to inhibit the other.
Pedestrian functionality depends on the presence of walkable destinations, commonly referred to as multi-use areas. Pedestrian functionality is an important issue because sprawl, the current development norm, is reaching the physical limits of the countryside. Density is the positive alternative to issues we encounter as a result of low density such as increased runoff, pollution, congestion, obesity, physical inactivity, and road rage. â The alternative to sprawl is simple and timely: neighborhoods of housing, parks and schools placed within walking distance of shops, civic services, jobs and transit â a modern version of the traditional town.â 1 Improving pedestrian functionality has the ability to impact multiple aspects of our lives and improve the quality of life we experience. â We need communities that are occupied full time and that provide a world of opportunity for kids, communities that support women and men in their efforts to weave together an ever more complex life of home and work.â 2
1 Calthorpe, Peter, p. 16
2 Duany, Andres, p. 25<br>Master of Landscape Architecture
39
Herrine, Luke. "What Makes a Belief Warranted? A Pragmatist’s Answer." Oberlin College Honors Theses / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1275599008.
Full text
40
Hagen, Kate. "God's answer to body obsession in Christian women." Online full text .pdf document, available to Fuller patrons only, 2003. http://www.tren.com.
Full text
41
Lodi, Sara <1990>. "Modern Monetary Theory, an answer to Euro crisis." Master's Degree Thesis, Università Ca' Foscari Venezia, 2014. http://hdl.handle.net/10579/5266.
Full textAbstract:
As the effects of the crisis became more and more evident, some nations began to show signs of economic decline and some of them started to think about abandoning Euro. Many economists argued that such a proposal was pure mad-ness, stupid and inconvenient if implemented. However, this idea increasingly began to attract attention over time. Numerous hasty and superficial analysis on the use started to flock, stimulating the spread of further opinions and publica-tions. The debate began to deepen and the contrast between the two schools of economic thought (the orthodox and the heterodox neo-classical post-Keynesian) has reinvigorated. The awareness about the seriousness of the matter, though, arose in England in 2011 when a competition with a prize of 250 thousand pounds was organized. The Wolfson prize was awarded to the best piece of aca-demic work which could provide a sensible answer to the question: “If member states leave the Economic and Monetary Union, what is the best way for the eco-nomic process to be managed to provide the soundest foundation for the future growth and prosperity of the current membership?”. The contest was won by Roger Bootle, with his “Leaving the Euro: a practical guide” which will be dis-cussed in the last chapter.
This thesis analyses the global financial and economic crisis from its origins en-tailed in the excesses of Wall Street, until the imbalances in Europe, through the opinions and studies of internationally renowned economists belonging to both schools of economic thought. Particular attention has been given to the economic policies of austerity in Europe and the main macroeconomic effects that these re-strictive policies have had on the member states restrictions, especially on pe-ripheral countries.
Consequently the focus will shifts to the Modern Monetary Theory as a theoretical alternative to interpret the reasons for the imbalances in the Euro area. The cen-tral aspect of this theory is the different interpretation of the deficit of the govern-ment budget on the basis of sectorial balance sheets and their mechanism of supporting the economy in the downturn.
To conclude, referring to the paper that won the Wolfson prize in 2011 a potential exit strategy with a main focus on Italy is described, addressing the more relevant legal and economic issues. As for economic aspects, a comparison is performed to determine which option was the best among the potential solutions to a long period of austerity or the ordered abandonment of the Euro. Finally, several probable drawbacks are listed that should give pause to the countries in question before making such a drastic choice.
42
Sonnet, Jean-Pierre. "The book within the book : writing in Deuteronomy /." Leiden ; New York ; Köln : E. J. Brill, 1997. http://catalogue.bnf.fr/ark:/12148/cb37206800b.
Full text
43
Oetsch, Johannes, Martin Schwengerer, and Hans Tompits. "Kato: a plagiarism-detection tool for answer-set programs." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4148/.
Full textAbstract:
We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments of) logic programs to help detecting cases of plagiarism. Currently, the tool is realised for DLV programs but it is designed to handle various logic-programming syntax versions. We review basic features and the underlying methodology of the tool.
44
Lynam, Thomas. "Exploitation of Redundant Inverse Term Frequency for Answer Extraction." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1190.
Full textAbstract:
An automatic question answering system must find, within a corpus,short factual answers to questions posed in natural language. The process involves analyzing the question, retrieving information related to the question, and extracting answers from the retrieved information. This thesis presents a novel approach to answer extraction in an automated question answering (QA) system. The answer extraction approach is an extension of the MultiText QA system. This system employs a question analysis component to examine the question and to produce query terms for the retrieval component which extracts several document fragments from the corpus. The answer extraction component selects a few short answers from these fragments. This thesis describes the design and evaluation of the Redundant Inverse Term Frequency (RITF) answer extraction component. The RITF algorithm locates and evaluates words from the passages that are likely to be associated with the answer. Answers are selected by finding short fragments of text that contain the most likely words based on: the frequency of the words in the corpus, the number of fragments in which the word occurs, the rank of the passages as determined by the IR, the distance of the word from the centre of the fragment, and category information found through question analysis. RITF makes a substantial contribution in overall results, nearly doubling the Mean Reciprocal Rank (MRR), a standard measure for evaluating QA systems.
45
Prokofyeva, Tatiana. "The Strategic Use of Question-Answer Pairs in Russian." Thesis, Linköpings universitet, Avdelningen för språk och kultur, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-86901.
Full textAbstract:
One of the most important social activities in the lives of human beings is conversation. Apart from thoughts and ideas, we can express our feelings and emotions by means of conversation. Moreover, since conversation is recognized as a reciprocal process, we can understand and grasp what the people involved in the interaction are displaying. Being all around us, conversation is a means which makes us social. Its description and analysis have become a concern for many scientists. For the past forty years, conversation has been a subject of study for sociologists, linguists and social psychologists. Since that time, we may speak of the emergence of conversation analysis (hereinafter referred to as CA).
46
Munyati, Mass. "The sexual health of Zambia, is education the answer." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/MQ37818.pdf.
Full text
47
Baisden, Gregory Scott. "Recombinant Mythology as answer to the Anti-Life Equation." Thesis, Pacifica Graduate Institute, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3590362.
Full textAbstract:
<p> The pervasive perspective of Western culture views spirit as enmeshed or entombed in matter, an interpretive frame that drives us to periodic socio-political disintegration and bourgeoning planetary illness because it neither honors flesh as vehicle for spirit nor tends spirit as animating flesh. Rather, our dominant paradigm emphasizes disdaining the body and lamenting the spirit, thereby either indulging the former or discounting it, while either disempowering the latter as incarcerated in flesh or seeking its "liberation" from flesh. This is an <i>Anti-Life Equation</i> denigrating both body and spirit, and playing a fundamental role in humanity's current crises in faith, politics, and sustainability. </p><p> The Myth of Orpheus has traditionally been interpreted as exemplifying this emphasis by portraying him as a failure both of body because attached to his mortal lover and of spirit because unable to refrain from dooming her to eternity amongst the shades of Hades. In this frame, the mythic master of the lyre becomes a proponent of a transcendentalist imperative to free spirit from carnal prison. But what if Orpheus was not a failure – not because he failed in bringing Eurydice's spirit shade back to the day world, but because he succeeded in relinquishing his love from her carnal form and from his attachments to and projections upon her? </p><p> From this perspective, that of a Recombinant Mythology, we may reclaim our foundational stories from the anti-life perspectives and interpretations that color them. Thus we may recognize Orpheus as the very image of perceiving, acknowledging, and embracing the spiral gift of life, in which spirit enters body as a journey of experience for the tempering of soul, for transforming or transmuting phenomenal, incarnate being, rather than as a trap of separation, dislocation, and isolation from divinity.</p>
48
East, Deborah J. "DATALOG WITH CONTRAINTS: A NEW ANSWER-SET PROGRAMMING FORMALISM." UKnowledge, 2001. http://uknowledge.uky.edu/gradschool_diss/322.
Full textAbstract:
Knowledge representation and search are two fundamental areas of artificial intelligence. Knowledge representation is the area of artificial intelligence which deals with capturing, in a formal language, the properties of objects and the relationships between objects. Search is a systematic examination of all possible candidate solutions to a problem that is described as a theory in some knowledge representation formalism. We compare traditional declarative programming formalisms such as PROLOG and DATALOG with answer-set programming formalisms such as logic programming with stable model semantic. In this thesis we develop an answer-set formalism we can DC. The logic of DC is based on the logic of prepositional schemata and a version of Closed World Assumption. Two important features of the DC logic is that it supports modeling of the cardinalities of sets and Horn clauses. These two features facilitate modeling of search problems. The DC system includes and implementation of a grounder and a solver. The grounder for the DC system grounds instances of problems retaining the structure of the cardinality of sets. The resulting theories are thus more concise. In addition, the solver for the DC system utilizes the structure of cardinality of sets to perform more efficient search. The second feature, Horn clauses, are used when transitive closure will eliminate the need for additional variables. The semantics of the Horn clauses are retained in the grounded theories. This also results in more concise theories. Our goal in developing DC is to provide the computer science community with a system which facilitates modeling of problems, is easy to use, is efficient and captures the class of problems in NP-search. We show experimental results comparing DC to other systems. These results show that DC is always competitive with state-of-the-art answer-set programming systems and for many problems DC is more efficient.
49
Crick, Thomas. "Superoptimisation : provably optimal code generation using answer set programming." Thesis, University of Bath, 2009. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.518295.
Full text
50
JOHANSSON, ELEONOR. "Slow fashion : the answer for a sustainable fashion industry?" Thesis, Högskolan i Borås, Institutionen Textilhögskolan, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20182.
Full textAbstract:
The fashion industry is today a global industry and has huge effect on our environment as well as on people. It is dominated by fast fashion and just-in-time production that has lead to increased seasons and mini-collections in season, which generate new low price items in store every week and even every day. This in turn has lead to an escalation in fashion trends that spris our desires for new experiences and leads to overconsumption where consumers buy more than they need, which in the end results in fashion waste.<br>Program: Magisterutbildning i Applied Textile Management