Tesis sobre el tema "Temporal reasoning"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Temporal reasoning".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Sripada, Suryanarayana Murthy. "Temporal reasoning in deductive databases". Thesis, Imperial College London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387841.
Texto completoGago, M. Carmen FernaÌndez. "Efficient control of temporal reasoning". Thesis, University of Liverpool, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.402682.
Texto completoNilsson, Mikael. "Efficient Temporal Reasoning with Uncertainty". Licentiate thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119409.
Texto completoHamlet, I. M. "Assumption based temporal reasoning in medicine". Thesis, University of Sussex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235351.
Texto completoEvans, David Hugh. "An investigation of persistence in temporal reasoning". Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267814.
Texto completoTawfik, Ahmed Yassin. "Changing times, an investigation in probabilistic temporal reasoning". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/nq23971.pdf.
Texto completoHostetter, Michael. "Analogical representation in temporal, spatial, and mnemonic reasoning". Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-03242009-040545/.
Texto completoGao, Feng. "Complex medical event detection using temporal constraint reasoning". Thesis, University of Aberdeen, 2010. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=153271.
Texto completoShu, I.-hsiang 1979. "Enabling fast flexible planning through incremental temporal reasoning". Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/18035.
Texto completoIncludes bibliographical references (leaves 70-71).
In order for a team of autonomous agents to successfully complete its mission, the agents must be able to quickly re-plan on the fly as unforeseen events arise in the environment. This requires temporally flexible plans that allow the agent to adapt to execution uncertainties by not overcommitting on time constraints, and a continuous planner that replans at any point when the current plan fails. To achieve both of these requirements, planners must have the ability to reason quickly about timing constraints. This thesis provides a fast incremental algorithm, ITC, for determining the temporal consistency of temporally flexible plans. Additionally, the temporal reasoning capability of ITC is able to return the conflict or the nature of the inconsistency to the planner, such that the planner can resolve inconsistencies quickly and intelligently. The ITC algorithm combines the speed of shortest-path algorithms known to network optimization with the spirit of incremental algorithms such as Incremental A* and those used within truth maintenance systems (TMS). The algorithm has been implemented and integrated into a temporal planner, called Kirk. It has demonstrated an order of magnitude speed increase on cooperative air vehicle scenarios.
by I-hsiang Shu.
M.Eng.
Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics". Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.
Texto completoBrown, Daniel. "Temporal case-based reasoning for insulin decision support". Thesis, Oxford Brookes University, 2015. https://radar.brookes.ac.uk/radar/items/020befaf-009b-44ff-ac6d-4b9f2bcc21a0/1/.
Texto completoDufour-Lussier, Valmi. "Reasoning with qualitative spatial and temporal textual cases". Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0182/document.
Texto completoThis thesis proposes a practical model making it possible to implement a case-based reasoning system that adapts processes represented as natural language text in response to user queries. While the cases and the solutions are in textual form, the adaptation itself is performed on networks of temporal constraints expressed with a qualitative algebra, using a belief revision operator. Natural language processing methods are used to acquire case representations and to regenerate text based on the adaptation result
Dufour-Lussier, Valmi. "Reasoning with qualitative spatial and temporal textual cases". Electronic Thesis or Diss., Université de Lorraine, 2014. http://www.theses.fr/2014LORR0182.
Texto completoThis thesis proposes a practical model making it possible to implement a case-based reasoning system that adapts processes represented as natural language text in response to user queries. While the cases and the solutions are in textual form, the adaptation itself is performed on networks of temporal constraints expressed with a qualitative algebra, using a belief revision operator. Natural language processing methods are used to acquire case representations and to regenerate text based on the adaptation result
Bränd, Stefan. "Using Rigid Landmarks to Infer Inter-Temporal Spatial Relations in Spatio-Temporal Reasoning". Thesis, Linköpings universitet, Artificiell intelligens och integrerad datorsystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-124064.
Texto completoNogueira, Vitor Beires. "Temporal reasoning in a logic programming language with modularity". Doctoral thesis, Universidade de Évora, 2008. http://hdl.handle.net/10174/11138.
Texto completode, Leng Daniel. "Spatio-Temporal Stream Reasoning with Adaptive State Stream Generation". Licentiate thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138645.
Texto completoThe series name Linköping Studies in Science and Technology Licentiate Thesis is inocorrect. The correct series name is Linköping Studies in Science and Technology Thesis.
NFFP6
CENIIT
Broxvall, Mathias. "A Study in the Computational Complexity of Temporal Reasoning". Doctoral thesis, Linköping : Univ, 2002. http://www.ep.liu.se/diss/science_technology/07/79/index.html.
Texto completoRodriguez, Moreno Diana V. "The dynamics of syllogistic reasoning : an fMRI investigation /". Access full-text from WCMC:, 2005. http://proquest.umi.com/pqdweb?did=1428837041&sid=5&Fmt=2&clientId=8424&RQT=309&VName=PQD.
Texto completoSioutis, Michaël. "Algorithmic contributions to qualitative constraint-based spatial and temporal reasoning". Thesis, Artois, 2017. http://www.theses.fr/2017ARTO0401/document.
Texto completoQualitative Spatial and Temporal Reasoning is a major field of study in Artificial Intelligence and, particularly, in Knowledge Representation, which deals with the fundamental cognitive concepts of space and time in an abstract manner. In our thesis, we focus on qualitative constraint-based spatial and temporal formalisms and make contributions to several aspects. In particular, given a knowledge base of qualitative spatial or temporal information, we define novel local consistency conditions and related techniques to efficiently solve the fundamental reasoning problems that are associated with such knowledge bases. These reasoning problems consist of the satisfiability problem, which is the problem of deciding whether there exists a quantitative interpretation of all the entities of a knowledge base such that all of its qualitative relations are satisfied by that interpretation, the minimal labeling problem, which is the problem of determining all the atoms for each of the qualitative relations of a knowledge base that participate in at least one of its solutions, and the redundancy problem, which is the problem of obtaining all the non-redundant qualitative relations of a knowledge base. Further, we enrich the field of spatio-temporal formalisms that combine space and time in an interrelated manner by making contributions with respect to a qualitative spatio-temporal logic that results by combining the propositional temporal logic (PTL) with a qualitative spatial constraint language, and by investigating the task of ordering a temporal sequence of qualitative spatial configurations to meet certain transition constraints
BERTAGNON, ALESSANDRO. "Improving Reasoning in Constraint Logic Programming: an Application to Route Planning and Qualitative Temporal Reasoning Problems". Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2487898.
Texto completoLa programmazione (logica) a vincoli (Constraint Logic Programming (CLP)) è un paradigma di programmazione nato per risolvere problemi di soddisfacimento di vincoli (Constraint Satisfaction Problem (CSP)) e problemi di ottimizzazione vincolata (Constraint Optimization Problem (COP)) in intelligenza artificiale. Le tecniche di risoluzione per i problemi di soddisfacimento di vincoli, dette anche di constraint reasoning, possono essere suddivise in due strategie distinte e ortogonali: inferenza (detta anche “propagazione dei vincoli”) e ricerca nello spazio degli stati. L’obiettivo della ricerca presentata in questa tesi è quello di sviluppare algoritmi di constraint reasoning per due popolari domini applicativi: la pianificazione dei percorsi dei veicoli e il ragionamento temporale qualitativo. Per quanto riguarda i problemi di pianificazione dei percorsi dei veicoli, studieremo il problema del commesso viaggiatore euclideo (Euclidean Traveling Salesperson Problem (ETSP)), un caso speciale del più noto problema del commesso viaggiatore (Traveling Salesperson Problem (TSP)). Molte istanze di problemi reali appartengono alla sottoclasse dell’ETSP, in cui i nodi da visitare sono punti nel piano euclideo, e la distanza tra loro è la distanza euclidea. L’approccio più comune in CLP per risolvere l’ETSP è quello di costruire una matrice di distanza, e poi affrontare il problema in modo più generale come un TSP. Invece, in questo lavoro proponiamo di utilizzare le informazioni geometriche, presenti nelle istanze dell’ETSP, per migliorare la propagazione dei vincoli. Applichiamo anche tecniche di apprendimento automatico (foreste casuali, reti neurali) con l’obiettivo di imporre solo il sottoinsieme più efficiente di vincoli per aumentare le prestazioni globali di risoluzione. Il ragionamento temporale qualitativo, d’altra parte, è un’area che ha notevolmente beneficiato delle tecniche di programmazione a vincoli da quando James F. Allen ha proposto un’algebra, nel 1983, che in seguito è diventata nota come Allen’s Interval Algebra (IA). Quando i vincoli di un problema riguardano le relazioni temporali tra eventi, il problema viene definito CSP temporale. La Branching Interval Algebra (BA) è la naturale generalizzazione della IA in cui il tempo non è più rappresentato come una linea retta ma piuttosto come un albero che può ramificarsi nel futuro. Anche BA ha molte potenziali applicazioni in diverse aree dell’intelligenza artificiale; ma sfortunatamente, il problema di coerenza dei CSP temporali espressi in BA è NP-difficile, come nel caso lineare. Per poter risolvere il problema di coerenza in modo efficiente, un approccio consiste nello sfruttare i frammenti trattabili dell’algebra. In questa tesi viene presentato uno studio sulla trattabilità di alcuni frammenti di BA e viene proposta una versione migliorata di un algoritmo di ricerca che sfruttando tali frammenti trattabili è in grado di ottenere migliori prestazioni computazionali.
Mülâyim, Mehmet Oǧuz. "Anytime Case-Based Reasoning in Large-Scale Temporal Case Bases". Doctoral thesis, Universitat Autònoma de Barcelona, 2020. http://hdl.handle.net/10803/671283.
Texto completoEl enfoque de la metodología Case-Based Reasoning (CBR) para la resolución de problemas de que "problemas similares tienen soluciones similares" ha demostrado ser bastante favorable para muchas aplicaciones de inteligencia artificial industrial. Sin embargo, las mismas ventajas de CBR dificultan su desempeño ya que las bases de casos (CB) crecen más que tamaños razonables. Buscar casos similares es costoso. Esta desventaja a menudo hace que CBR sea menos atractivo para los entornos de datos abundantes de hoy en día, mientras que, en realidad, cada vez hay más razones para beneficiarse de esta metodología eficaz. En consecuencia, el enfoque tradicional de la comunidad CBR de controlar el crecimiento de la CB para mantener el rendimiento está cambiando hacia la búsqueda de nuevas formas de tratar con datos abundantes. Como contribución a estos esfuerzos, esta tesis tiene como objetivo acelerar el CBR aprovechando tanto los espacios de problemas como los de soluciones en los CB de gran escala que se componen de casos relacionados temporalmente, como en el ejemplo de las historias clínicas electrónicas. Para las ocasiones en las que la aceleración que logramos para obtener resultados exactos aún no sea factible, dotamos al sistema CBR con capacidades de algoritmos anytime para proporcionar resultados aproximados con confianza en caso de interrupción. Aprovechar la temporalidad de los casos nos permite alcanzar ganancias superiores en el tiempo de ejecución para los CB de millones de casos. Los experimentos con conjuntos de datos del mundo real disponibles públicamente fomentan el uso continuo de CBR en dominios en los que CBR históricamente sobresale como la atención médica; y a su vez, no sufriendo, sino disfrutando del big data.
Case-Based Reasoning (CBR) methodology's approach to problem-solving that "similar problems have similar solutions" has proved quite favorable for many industrial artificial intelligence applications. However, CBR's very advantages hinder its performance as case bases (CBs) grow larger than moderate sizes. Searching similar cases is expensive. This handicap often makes CBR less appealing for today's ubiquitous data environments while, actually, there is ever more reason to benefit from this effective methodology. Accordingly, CBR community's traditional approach of controlling CB growth to maintain performance is shifting towards finding new ways to deal with abundant data. As a contribution to these efforts, this thesis aims to speed up CBR by leveraging both problem and solution spaces in large-scale CBs that are composed of temporally related cases, as in the example of electronic health records. For the occasions when the speed-up we achieve for exact results may still not be feasible, we endow the CBR system with anytime algorithm capabilities to provide approximate results with confidence upon interruption. Exploiting the temporality of cases allows us to reach superior gains in execution time for CBs of millions of cases. Experiments with publicly available real-world datasets encourage the continued use of CBR in domains where it historically excels like healthcare; and this time, not suffering from, but enjoying big data.
Universitat Autònoma de Barcelona. Programa de Doctorat en Informàtica
Talbot, Christine. "Directing Virtual Humans Using Play-Scripts and Spatio-Temporal Reasoning". Thesis, The University of North Carolina at Charlotte, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10791242.
Texto completoHistorically, most virtual human character research focuses on realism/emotions, interaction with humans, and discourse. The majority of the spatial positioning of characters has focused on one-on-one conversations with humans or placing virtual characters side-by-side when talking. These rely on conversation space as the main driver (if any) for character placement.
Movies and games rely on motion capture (mocap) files and hard-coded functions to perform spatial movements. These require extensive technical knowledge just to have a character move from one place to another. Other methods involve the use of Behavior Markup Language (BML), a form of XML, which describes character behaviors. BML Realizers take this BML and perform the requested behavior(s) on the character(s). Also, there are waypoint and other spatial navigation schemes, but they primarily focus on traversals and not correct positioning. Each of these require a fair amount of low-level detail and knowledge to write, plus BML realizers are still in their early stages of development.
Theatre, movies, and television all utilize a form of play-scripts, which provide detailed information on what the actor must do spatially, and when for a particular scene (that is spatio-temporal direction). These involve annotations, in addition to the speech, which identify scene setups, character movements, and entrances /exits. Humans have the ability to take these play-scripts and easily perform a believable scene.
This research focuses on utilizing play-scripts to provide spatio-temporal direction to virtual characters within a scene. Because of the simplicity of creating a playscript, and our algorithms to interpret the scripts, we are able to provide a quick method of blocking scenes with virtual characters.
We focus on not only an all-virtual cast of characters, but also human-controlled characters intermixing with the virtual characters for the scene. The key here is that human-controlled characters introduce a dynamic spatial component that affects how the virtual characters should perform the scene to ensure continuity, cohesion, and inclusion with the human-controlled character.
The algorithms to accomplish the blocking of a scene from a standard play-script are the core research contribution. These techniques include some part of speech tagging, named entity recognition, a rules engine, and strategically designed force-directed graphs. With these methods, we are able to similarly map any play-script’s spatial positioning of characters to a human-performed version of the same playscript. Also, human-based evaluations indicate these methods provide a qualitatively good performance.
Potential applications include: a rehearsal tool for actors; a director tool to help create a play-script; a controller for virtual human characters in games or virtual environments; or a planning tool for positioning people in an industrial environment.
Abeysinghe, Geetha Kalyani. "Event calculus to support temporal reasoning in a clinical domain". Thesis, University of Southampton, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.238888.
Texto completoEl-Geresy, Baher. "Qualitative representation and reasoning for spatial and spatio-temporal systems". Thesis, University of South Wales, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.403330.
Texto completoBlum, Anthony John. "An investigation into the psychology of spatial and temporal reasoning /". The Ohio State University, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487841548269909.
Texto completoLegge, Gaynor W. "A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation". Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278352/.
Texto completoPeng, Taoxin. "A general approach to temporal reasoning about action and change". Thesis, University of Greenwich, 2001. http://gala.gre.ac.uk/6265/.
Texto completoRusmawati, Yanti. "Modelling and reasoning about dynamic networks as concurrent systems". Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/modelling-and-reasoning-about-dynamic-networks-as-concurrent-systems(f6bd4a9c-e356-48ea-83a4-3d9d17c550c2).html.
Texto completoHallin, Magnus. "SMT-Based Reasoning and Planning in TAL". Thesis, Linköpings universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72596.
Texto completoLazarovski, Daniel. "Extending the Stream Reasoning in DyKnow with Spatial Reasoning in RCC-8". Thesis, Linköpings universitet, KPLAB - Laboratoriet för kunskapsbearbetning, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-75885.
Texto completoCollaborative Unmanned Aircraft Systems (CUAS)
Schultz, Carl 1984. "Methodologies for the development of qualitative spatial and temporal reasoning applications". Thesis, University of Auckland, 2010. http://hdl.handle.net/2292/6040.
Texto completoGalushka, Mykola. "Discovering and managing similarity knowledge in temporal case-based reasoning systems". Thesis, University of Ulster, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535142.
Texto completoSuda, Martin [Verfasser] y Christoph [Akademischer Betreuer] Weidenbach. "Resolution-based methods for linear temporal reasoning / Martin Suda. Betreuer: Christoph Weidenbach". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2015. http://d-nb.info/1078261164/34.
Texto completoLI, Hongsheng. "An extended HD Fluent Analysis of Temporal knowledge in OWL-based clinical Guideline System". Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/11742.
Texto completoLeeser, Miriam Ellen. "Reasoning about the function and timing of integrated circuits with Prolog and temporal logic". Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.232797.
Texto completoBorges, Rafael. "A neural-symbolic system for temporal reasoning with application to model verification and learning". Thesis, City University London, 2012. http://openaccess.city.ac.uk/1303/.
Texto completoWu, Jing. "A qualitative spatio-temporal modelling and reasoning approach for the representation of moving entities". Thesis, Brest, 2015. http://www.theses.fr/2015BRES0036/document.
Texto completoThe research developed in this thesis introduces a qualitative approach for representing and reasoning on moving entities in a two-dimensional geographical space. Movement patterns of moving entities are categorized based on a series of qualitative spatial models of topological relations between a directed line and a region, and orientation relations between two directed lines, respectively. Qualitative movements are derived from the spatio-temporal relations that characterize moving entities conceptualized as either points or regions in a two-dimensional space. Such a spatio-temporal framework supports the derivation of the basic movement configurations inferred from moving and static entities. The approach is complemented by a tentative qualification of the possible natural language expressions of the primitive movements identified. Complex movements can be represented by a composition of these primitive movements. The notion of conceptual transition that favors the exploration of possible trajectories in the case of incomplete knowledge configurations is introduced and explored.Composition tables are also studied and provide additional reasoning capabilities. The whole approach is applied to the analysis of flight patterns and maritime trajectories
Beaumont, Matthew y n/a. "Handling Over-Constrained Temporal Constraint Networks". Griffith University. School of Information Technology, 2004. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20041213.084512.
Texto completoBeaumont, Matthew. "Handling Over-Constrained Temporal Constraint Networks". Thesis, Griffith University, 2004. http://hdl.handle.net/10072/366603.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Lu, Zhirui. "Multi-valued temporal logic based reasoning system with applications to decision support in intelligent environments". Thesis, University of Ulster, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.550789.
Texto completoAlsarhani, Sami. "Reasoning about history based access control policy using past time operators of interval temporal logic". Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10406.
Texto completoRasmussen, Louise J. "THE EFFECTS OF REPRESENTATIONAL FORMAT AND DISCOURSE PRINCIPLES ON THE COMPREHENSION AND PRODUCTION OF TEMPORAL ORDER". Wright State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=wright1190080849.
Texto completoBalser, Michael [Verfasser]. "Verifying Concurrent Systems with Symbolic Execution : Temporal Reasoning is Symbolic Execution with a Little Induction / Michael Balser". Aachen : Shaker, 2006. http://d-nb.info/1170528821/34.
Texto completoMartiny, Karsten [Verfasser]. "PDT logic : a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems / Karsten Martiny". Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1152030132/34.
Texto completoMas, i. Casals Orestes. "Sistemas difusos dinámicos para el tratamiento de información temporal imprecisa". Doctoral thesis, Universitat Politècnica de Catalunya, 1997. http://hdl.handle.net/10803/6914.
Texto completoEn el ámbito de la ingeniería, el núcleo de cualquier solución difusa actual es un sistema lógico difuso, encargado de obtener las salidas a partir de las entradas en un proceso de tres etapas: füzzificación, inferencia y desfuzzifícación. Hasta la fecha, la totalidad de sistemas difusos efectúan sus razonamientos basándose solamente en los valores actuales de las entradas. Ello ha dado como resultado que los sistemas de inferencia difusa sean, desde el punto de vista matemático, sistemas no lineales algebraicos. Este hecho contrasta fuertemente con el entorno en que dichos sistemas suelen emplearse. En efecto, la mayoría de aplicaciones se construyen y utilizan en entornos dinámicos, los cuales son capaces de presentar comportamientos mucho más complejos que los sistemas estáticos. Cabe entonces preguntarse si el uso de sistemas difusos dinámicos -es decir, aquellos en que sus salidas dependan no sólo de los valores presentes de las entradas sino también de los pasados-, aportaría mejoras respecto a las soluciones difusas actuales.
En esta tesis se ha desarrollado una metodología para incorporar conceptos temporales difusos a los sistemas de inferencia difusa tradicionales. Para ello se ha propuesto una forma simple y eficaz de representar los citados conceptos en un entorno de ingeniería. Posteriormente se ha mostrado cómo introducirlos en las reglas difusas tradicionales, y se ha desarrollado un algoritmo para efectuar la inferencia en esta nueva situación. Se obtienen finalmente dos algoritmos distintos para dos casos diferenciados, pero ambas expresiones presentan la interesante propiedad de poder interpretarse como una convolución, tradicional en uno de los casos y una nueva forma que hemos denominado convolution difusa para el otro caso. Estas expresiones se pueden realizar por tanto de una forma muy elegante mediante circuitos analógicos o digitales.
La metodología desarrollada requiere que los conceptos temporales difusos que se manejan deban realizarse mediante la respuesta impulsional de un circuito lineal. Ello remite al problema del diseño de filtros desde el punto de vista temporal, mucho menos estudiado que desde el punto de vista frecuencial. A resultas de ello se dedica una parte de la presente tesis a establecer las pautas a seguir en el proceso de diseño de dichos filtros, valiéndose de técnicas de aproximación y de optimización.
Finalmente se presentan un ejemplo de aplicación, de interés tanto teórico como práctico. En él se presenta un sistema de reconocimiento simple de comandos verbales, basado en las técnicas propuestas en la presente tesis. Los resultados obtenidos han mostrado que con una estructura muy simple es posible obtener una discriminación más que suficiente entre las órdenes programadas, con la ventaja que presenta el realizar el sistema de forma totalmente analógica.
Kreutzmann, Arne [Verfasser], Christian [Akademischer Betreuer] Freksa y Alessandro [Akademischer Betreuer] Saffiotti. "Qualitative Spatial and Temporal Reasoning based on And/Or Linear Programming : an approach to partially grounded qualitative spatial reasoning / Arne Kreutzmann. Gutachter: Christian Freksa ; Alessandro Saffiotti. Betreuer: Christian Freksa". Bremen : Staats- und Universitätsbibliothek Bremen, 2014. http://d-nb.info/1072226669/34.
Texto completoCohen-Solal, Quentin. "Un cadre algébrique pour le raisonnement qualitatif en présence d'informations hétérogènes : application aux raisonnements multi-échelle et spatio-temporel". Thesis, Normandie, 2017. http://www.theses.fr/2017NORMC245/document.
Texto completoIn this thesis, we are interested in qualitative multi-scale reasoning, qualitative spatio-temporal reasoning and combinations of qualitative formalisms.We propose to extend the multiscale temporal reasoning to take into account the fact that time intervals can be perceived as instants at certain scales of precision, to fully formalize this reasoning and to study its consistency problem. We show in particular that this formalism decides consistency and that the consistency problem is NP-complete, even in the simplest case.In addition, we propose a general framework for reasoning on temporal sequences of qualitative information, a form of spatio-temporal description. This framework allows for reasoning in the context of complex evolutions. For example, the considered entities may have characteristics preserved over time, evolve in a dependent manner with respect to each other, while having a potentially irreversible and different behavior depending on their nature. Moreover, in this context, reasoning is computationally more efficient than state-of-the-art approaches. In particular, we study the consistency problem in the specific context of constant-size moving regions, and show that this framework actually decides consistency.Furthermore, we propose a formal framework unifying several forms of extensions and combinations of qualitative formalisms, including multi-scale reasoning and temporal sequences. This framework allows one to reason in the context of each of these combinations and extensions, but also to study in a unified way the consistency problem. In particular, we establish two complementary theorems guaranteeing that the consistency problem is polynomial, and we use them to prove that several fragments of temporal sequences are tractable
Azmat, Shoaib. "Multilayer background modeling under occlusions for spatio-temporal scene analysis". Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/54005.
Texto completoRodrigues, Teresa Raquel. "O impacto da aprendizagem musical no desempenho de habilidades cognitivas implicadas na matemática". Master's thesis, Universidade de Évora, 2011. http://hdl.handle.net/10174/12025.
Texto completoPreusse, Franziska [Verfasser], Der Meer Elke [Akademischer Betreuer] Van, Isabell [Akademischer Betreuer] Wartenburger y Roland [Akademischer Betreuer] Grabner. "High fluid intelligence and analogical reasoning : behavioural and cerebral correlates and their temporal characteristics / Franziska Preusse. Gutachter: Elke van der Meer ; Isabell Wartenburger ; Roland Grabner". Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://d-nb.info/1018232516/34.
Texto completo