Relevant bibliographies by topics / Temporal constraints

Academic literature on the topic 'Temporal constraints'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Temporal constraints.'

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.

Journal articles on the topic "Temporal constraints"

1

Nair, Manjusha, Jinesh Manchan Kannimoola, Bharat Jayaraman, Bipin Nair, and Shyam Diwakar. "Temporal constrained objects for modelling neuronal dynamics." PeerJ Computer Science 4 (July 23, 2018): e159. http://dx.doi.org/10.7717/peerj-cs.159.

Full text
Abstract:
Background Several new programming languages and technologies have emerged in the past few decades in order to ease the task of modelling complex systems. Modelling the dynamics of complex systems requires various levels of abstractions and reductive measures in representing the underlying behaviour. This also often requires making a trade-off between how realistic a model should be in order to address the scientific questions of interest and the computational tractability of the model. Methods In this paper, we propose a novel programming paradigm, called temporal constrained objects, which facilitates a principled approach to modelling complex dynamical systems. Temporal constrained objects are an extension of constrained objects with a focus on the analysis and prediction of the dynamic behaviour of a system. The structural aspects of a neuronal system are represented using objects, as in object-oriented languages, while the dynamic behaviour of neurons and synapses are modelled using declarative temporal constraints. Computation in this paradigm is a process of constraint satisfaction within a time-based simulation. Results We identified the feasibility and practicality in automatically mapping different kinds of neuron and synapse models to the constraints of temporal constrained objects. Simple neuronal networks were modelled by composing circuit components, implicitly satisfying the internal constraints of each component and interface constraints of the composition. Simulations show that temporal constrained objects provide significant conciseness in the formulation of these models. The underlying computational engine employed here automatically finds the solutions to the problems stated, reducing the code for modelling and simulation control. All examples reported in this paper have been programmed and successfully tested using the prototype language called TCOB. The code along with the programming environment are available at http://github.com/compneuro/TCOB_Neuron. Discussion Temporal constrained objects provide powerful capabilities for modelling the structural and dynamic aspects of neural systems. Capabilities of the constraint programming paradigm, such as declarative specification, the ability to express partial information and non-directionality, and capabilities of the object-oriented paradigm especially aggregation and inheritance, make this paradigm the right candidate for complex systems and computational modelling studies. With the advent of multi-core parallel computer architectures and techniques or parallel constraint-solving, the paradigm of temporal constrained objects lends itself to highly efficient execution which is necessary for modelling and simulation of large brain circuits.
APA, Harvard, Vancouver, ISO, and other styles
2

Msaaf, Mohammed, and Fouad Belmajdoub. "Diagnosis of Discrete Event Systems under Temporal Constraints Using Neural Network." International Journal of Engineering Research in Africa 49 (June 2020): 198–205. http://dx.doi.org/10.4028/www.scientific.net/jera.49.198.

Full text
Abstract:
The good functioning of a discrete event system is related to how much the temporal constraints are respected. This paper gives a new approach, based on a statistical model and neural network, that allows the verification of temporal constraints in DES. We will perform an online temporal constraint checking which can detect in real time any abnormal functioning related to the violation of a temporal constraint. In the first phase, the construction of temporal constraints from statistical model is shown and after that neural networks are involved in dealing with the online temporal constraint checking.
APA, Harvard, Vancouver, ISO, and other styles
3

Chu, Wesley W., and Patrick H. Ngai. "Embedding temporal constraint propagation in machine sequencing for job shop scheduling." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 7, no. 1 (February 1993): 37–52. http://dx.doi.org/10.1017/s0890060400000056.

Full text
Abstract:
In this paper, we show how a temporal constraint propagation technique can be embedded in the machine sequencing approach for solving the job shop scheduling problem. The temporal constraint propagation algorithm propagates the precedence constraints and machine interference constraints to reduce the search space generated by the machine sequencing approach. Further, by making use of the temporal nature of the job shop scheduling, efficient algorithms to propagate precedence constraints and machine interference constraints are developed. Experimental results reveal that embedding constraint propagation in the machine sequencing approach significantly reduces the computation time more than by just using the machine sequencing approach alone. Further, the proposed temporal constraint propagation algorithms provide an order of magnitude improvement on the computation time over the conventional constraint propagation algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Jianhao, Junyang Ren, Wentao Ding, and Yuzhong Qu. "PaTeCon: A Pattern-Based Temporal Constraint Mining Method for Conflict Detection on Knowledge Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (June 26, 2023): 4166–72. http://dx.doi.org/10.1609/aaai.v37i4.25533.

Full text
Abstract:
Temporal facts, the facts for characterizing events that hold in specific time periods, are attracting rising attention in the knowledge graph (KG) research communities. In terms of quality management, the introduction of time restrictions brings new challenges to maintaining the temporal consistency of KGs and detecting potential temporal conflicts. Previous studies rely on manually enumerated temporal constraints to detect conflicts, which are labor-intensive and may have granularity issues. We start from the common pattern of temporal facts and constraints and propose a pattern-based temporal constraint mining method, PaTeCon. PaTeCon uses automatically determined graph patterns and their relevant statistical information over the given KG instead of human experts to generate time constraints. Specifically, PaTeCon dynamically attaches type restriction to candidate constraints according to their measuring scores. We evaluate PaTeCon on two large-scale datasets based on Wikidata and Freebase respectively, the experimental results show that pattern-based automatic constraint mining is powerful in generating valuable temporal constraints.
APA, Harvard, Vancouver, ISO, and other styles
5

Campos, M., J. M. Juárez, J. Palma, and R. Marín. "Using temporal constraints for temporal abstraction." Journal of Intelligent Information Systems 34, no. 1 (February 12, 2009): 57–92. http://dx.doi.org/10.1007/s10844-009-0079-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Frank, Jeremy. "Planning Solar Array Operations on the International Space Station." Proceedings of the International Conference on Automated Planning and Scheduling 23 (June 2, 2013): 470–71. http://dx.doi.org/10.1609/icaps.v23i1.13574.

Full text
Abstract:
Flight controllers manage the orientation and modes of eight large solar arrays that power the International Space Station (ISS). The task requires generating plans that balance complex constraints and preferences. These considerations include context-dependent constraints on viable solar array configurations, temporal limits on transitions between configurations, and preferences on which considerations have priority. The Solar Array Constraint Engine (SACE) treats this operations planning problem as a sequence of tractable constrained optimization problems. SACE uses constraint management and automated planning capabilities to reason about the constraints, to find optimal array configurations subject to these constraints and solution preferences, and to automatically generate solar array operations plans.
APA, Harvard, Vancouver, ISO, and other styles
7

Barber, F. "Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts." Journal of Artificial Intelligence Research 12 (February 1, 2000): 35–86. http://dx.doi.org/10.1613/jair.693.

Full text
Abstract:
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric point-based constraints, where each disjunct in each input disjunctive constraint is univocally associated to a label. Reasoning algorithms manage labeled constraints, associated label lists, and sets of mutually inconsistent disjuncts. These algorithms guarantee consistency and obtain a minimal network. Additionally, constraints can be organized in a hierarchy of alternative temporal contexts. Therefore, we can reason on context-dependent disjunctive metric constraints on intervals and points. Moreover, the model is able to represent non-binary constraints, such that logical dependencies on disjuncts in constraints can be handled. The computational cost of reasoning algorithms is exponential in accordance with the underlying problem complexity, although some improvements are proposed.
APA, Harvard, Vancouver, ISO, and other styles
8

MOUHOUB, MALEK. "A HOPFIELD-TYPE NEURAL NETWORK BASED MODEL FOR TEMPORAL CONSTRAINTS." International Journal on Artificial Intelligence Tools 13, no. 03 (September 2004): 533–45. http://dx.doi.org/10.1142/s0218213004001673.

Full text
Abstract:
In this paper we present an approximation method based on discrete Hopfield neural network (DHNN) for solving temporal constraint satisfaction problems. This method is of interest for problems involving numeric and symbolic temporal constraints and where a solution satisfying the constraints of the problem needs to be found within a given deadline. More precisely the method has the ability to provide a solution with a quality proportional to the allocated process time. The quality of the solution corresponds here to the number of satisfied constraints. This property is very important for real world applications including reactive scheduling and planning and also for over constrained problems where a complete solution cannot be found. Experimental study, in terms of time cost and quality of the solution provided, of the DHNN based method we propose provides promising results comparing to the other exact methods based on branch and bound and approximation methods based on stochastic local search.
APA, Harvard, Vancouver, ISO, and other styles
9

Duisberg, Robert A. "Animation Using Temporal Constraints." ACM SIGCHI Bulletin 20, no. 1 (July 1988): 81. http://dx.doi.org/10.1145/49103.1046503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zuenko, Aleksandr A., and Olga V. Fridman. "Reasoning with temporal constraints." Transactions of the Kоla Science Centre of RAS. Series: Engineering Sciences 14, no. 7/2023 (February 27, 2024): 43–51. http://dx.doi.org/10.37614/2949-1215.2023.14.7.005.

Full text
Abstract:
The work deals with the organization of temporal reasoning basing on constraint satisfaction methods. The definition of the constraint satisfaction problem and the notion of constraint consistency are given. The possibilities of epresentation of a planning problem as an interval constraint network are considered. As a mathematical apparatus for the formalization of temporal reasining, the Allen’s interval algebra is described, which main operations are composition and the intersection of temporal relations. A path consistency algorithm is given that implements one of the types of local consistency on interval constraint network and uses computations based on operations of interval algebra. An example of the application of this algorithm is presented. In the conclusion the prospects for the development of methods of temporal reasoning are considered.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Temporal constraints"

1

Choi, Ho Jin. "Controlling temporal constraints in planning." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ralley, Richard. "Spatial constraints on attention." Thesis, University of Hertfordshire, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sakai, Rodrigo Katsumoto. "Extensão de um SGBD para incluir o gerenciamento da informação temporal." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-01042009-143157/.

Full text
Abstract:
O fator temporal é uma variável natural da maioria dos sistemas de informação, pois no mundo real os eventos ocorrem de maneira dinâmica, modicando continuamente os valores dos seus objetos no decorrer do tempo. Muitos desses sistemas precisam registrar essa modicação e atribuir os instantes de tempo em que cada informação foi válida no sistema. Este trabalho reúne as características relacionadas aos Bancos de Dados Temporais e Bancos de Dados Objeto-Relacionais. O objetivo primordial é propor uma forma de implementar alguns aspectos temporais, desenvolvendo um módulo que faça parte das características e funcionalidades internas de um SGBD. O módulo temporal contempla principalmente a parte de restrições de integridade temporal que é utilizada para manter a consistência da informação temporal armazenada. Para isso, é proposto um novo tipo de dado que melhor representa as marcas temporais dos objetos. Uma parte importante para a implementação desse projeto é a utilização de um SGBD objeto-relacional que possui algumas características orientadas a objetos que permitem a extensão de seus recursos, tornando-o capaz de gerenciar alguns aspectos temporais. O módulo temporal desenvolvido torna esses aspectos temporais transparentes para o usuário. Por conseqüência, esses usuários são capazes de utilizar os recursos temporais com maior naturalidade.
The temporal factor is a natural variable of the majority of the information systems, therefore in the real world the events occur in dynamic way, modifying continuously the values of its objects in elapsing of the time. Many of these systems need to register this modication and to attribute the instants of time where each information was valid in the system. This work congregates the characteristics related to the Temporal Databases and Object-Relational Databases. The primordial objective is to consider a form to implement some temporal aspects, developing a module that is part of the characteristics and internal functionalities of a DBMS. The temporal module mainly contemplates the part of restrictions of temporal integrity that is used to keep the consistency of the stored temporal information. For this, a new data type is proposed that better represent the objects timestamps. An important part for the implementation of this project is the use of a object-relational DBMS that has some object-oriented characteristics that allow the extension of its resources, becoming capable to manage some temporal aspects. The developed temporal module becomes these transparent temporal aspects for the user. For consequence, these users are capable to use the temporal resources more naturally.
APA, Harvard, Vancouver, ISO, and other styles
4

Sandström, Kristian. "Enforcing Temporal Constraints in Embedded Control Systems." Doctoral thesis, KTH, Machine Design, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3328.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ullberg, Jonas. "Towards Continous Activity Monitoring with Temporal Constraints." Thesis, Örebro University, School of Science and Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-10579.

Full text
Abstract:

Public demand for intelligent services in their home environments can be expected to grow in the near future once the required technology becomes more widely available and mature. Many intelligent home services cannot be provided in a purely reactive fashion though since they require contextual knowledge about the environment and most importantly the activities the residents are engaged in at any given time. This poses a problem since information about a human’s behavior is not easily accessible and has to be recognized from aggregated sensor data in most cases. Numerous activity recognition techniqueshave been studied in the literature. In this thesis we focus on one such technique which takes a temporal reasoning approach to activity recognition, namely recognizing activities by planning for them with a temporal planner. OMPS is an example of such a planner that has been used in previous work to recognize activities of humans in domestic environments. An important requirement for monitoring activities in a real world application is the ability to do so continuously and reliably. Two shortcomings in the previous approach hindered OMPS’s capability to meet this requirement, namely maintaining the performance of the activity recognition over long monitoring horizons, and ensuring future temporal consistency of recognized activities. This thesis will define the two problems, detail their solutions, and finally evaluate the modified system with the corresponding changes implemented.

APA, Harvard, Vancouver, ISO, and other styles
6

Owuor, Dickson Odhiambo. "Capturing the temporal constraints of gradual patterns." Thesis, Montpellier, 2020. http://www.theses.fr/2020MONTS019.

Full text
Abstract:
La recherche de motifs fréquents permet d’extraire les corrélations d’attributs par le biais de règles graduelles comme: “plus il y a de X, plus il y a de Y”. Ces corrélations sont utiles pour identifier et isoler des relations entre les attributs qui peuvent ne pas être évidentes grâce à des analyses rapides des données. Par exemple, un chercheur peut appliquer une telle recherche pour déterminer quels attributs d’un ensemble de données présentent des corrélations inconnues afin de les isoler pour une exploration plus approfondie ou une analyse. Supposons que le chercheur dispose d’un ensemble de données qui possède les attributs suivants : âge, montant du salaire, du nombre d’enfants et du niveau d’éducation. Un motif graduel extrait peut prendre la forme “plus le niveau d’éducation est bas, plus le salaire est élevé”. Étant donné que cette relation est rare, il peut être intéressant pour le chercheur de mettre davantage l’accent sur ce phénomène afin de comprendre. Les techniques de recherche de motifs graduels existantes extraient des motifs graduels en (1) générant des les candidats de l’ensemble d’éléments, (2) validant des candidats et (3) en élaguant des candidats invalides en fonction sur la propriété d’anti-monotonie. Cette propriété d’anti-monotonie est telle qu’un candidat est considéré comme invalide si l’un de ses sous-ensembles est invalide. Cette propriété améliore l’efficacité du processus d’élagage. L’efficacité de la génération d’ensembles de candidats peut être améliorée en utilisant une approche heuristique qui optimise le processus. Dans ce travail, nous proposons une technique d’optimisation par des colonies de fourmis qui utilise une approche probabiliste imitant le comportement des fourmis biologiques en cherchant le chemin le plus court pour trouver de la nourriture afin de résoudre des problèmes combinatoires. Nous appliquons la technique d’optimisation des colonies de fourmis afin de générer des candidats des motifs graduels dont la probabilité d’être valide est élevée. Ceci, couplé avec la propriété d'anti-monotonie, se traduit par le développement d’une méthode efficace. Dans notre deuxième contribution, nous étendons l’extraction de modèles graduels existante à l’extraction de motifs graduels avec un décalage temporel approximatif entre ses attributs affectés. Un tel modèle est appelé motif graduel temporel flou. Cela peut prendre par exemple la forme: “plus il y a de X, plus il y a de Y presque 3 mois plus tard” Ces modèles ne peuvent être extraits que de séries de données chronologiques car ils impliquent la présence de l’aspect temporel. Dans notre troisième contribution, nous proposons une donnée modèle de croisement qui permet l’intégration d’implémentations d’algorithmes d’exploration de modèle graduel dans une plateforme Cloud. Cette contribution est motivée par la prolifération des applications IoT dans presque tous les domaines de notre société, ce qui s’accompagne de la fourniture de données chronologiques à grande échelle de différentes sources. Il peut être intéressant pour un chercheur de croiser différentes données de séries chronologiques dans le but d’extraire des motifs graduels temporels des attributs cartographiés. Par exemple un ensemble de données ‘humidité’ peut être temporairement croisé avec un ensemble de données indépendant qui enregistre ‘Population de mouches’, et un schéma peut prendre la forme: “plus l’humidité est élevée, plus vole presque 2 heures plus tard”. Notre méthode met l’accent sur l’intégration de l’exploitation des techniques les plus récentes de plate-formes Cloud, car cela facilite l’accès à nos méthodes en allégeant l’installation et la configuration pour les utilisateurs, permettant ainsi aux utilisateurs de passer plus de temps à se concentrer sur les phénomènes qu’ils analysent
Gradual pattern mining allows for extraction of attribute correlations through gradual rules such as: “the more X, the more Y”. Such correlations are useful in identifying and isolating relationships among the attributes that may not be obvious through quick scans on a data set. For instance, a researcher may apply gradual pattern mining to determine which attributes of a data set exhibit unfamiliar correlations in order to isolate them for deeper exploration or analysis. Assume the researcher has a data set which has the following attributes: age, amount of salary, number of children, and education level. An extracted gradual pattern may take the form “the lower the education level, the higher the salary”. Since this relationship is uncommon, it may interest the researcher in putting more focus on this phenomenon in order to understand it. As for many gradual pattern mining approaches, there is a key challenge to deal with huge data sets because of the problem of combinatorial explosion. This problem is majorly caused by the process employed for generating candidate gradual item sets. One way to improve the process of generating candidate gradual item sets involves optimizing this process using a heuristic approach. In this work, we propose an ant colony optimization technique which uses a popular probabilistic approach that mimics the behavior biological ants as they search for the shortest path to find food in order to solve combinatorial problems. We apply the ant colony optimization technique in order to generate gradual item set candidates whose probability of being valid is high. This coupled with the anti-monotonicity property, results in the development of a highly efficient ant-based gradual pattern mining technique. In our second contribution, we extend an existing gradual pattern mining technique to allow for extraction of gradual patterns together with an approximated temporal lag between the affected gradual item sets. Such a pattern is referred to as a fuzzy-temporal gradual pattern and it may take the form: “the more X, the more Y, almost 3 months later”. The addition of temporal dimension into the proposed approach makes it even worse regarding combinatorial explosion due to added task of searching for the most relevant time gap. In our third contribution, we propose a data crossing model that allows for integration of mostly gradual pattern mining algorithm implementations into a Cloud platform. This contribution is motivated by the proliferation of IoT applications in almost every area of our society and this comes with provision of large-scale time-series data from different sources. It may be interesting for a researcher to cross different time-series data with the aim of extracting temporal gradual patterns from the mapped attributes. For instance, a ‘humidity’ data set may be temporally crossed with an unrelated data set that records the ‘population of flies’, and a pattern may take the form: “the higher the humidity, the higher the number of flies, almost 2 hours later”. Again, the study emphasizes integration of gradual pattern mining techniques into a Cloud platform because this will facilitate their access on a subscription basis. This alleviates installation and configuration hustles for the users; therefore, it allows them to spend more time focusing on the phenomena they are studying
APA, Harvard, Vancouver, ISO, and other styles
7

Jobczyk, Krystian. "Temporal planning with fuzzy constraints and preferences." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMC259/document.

Full text
Abstract:
La planification temporelle constitue conceptuellement une partie du raisonnement temporelle et il appartient au domaine de recherche de l'intelligence artificielle. La planification temporelle peut être considérée comme une extension de la planification classique par les aspects temporels de l'action. La planification temporelle est généralement complété par des préférences ou des types différents decontraintes imposées à l'exécution des actiones. Il existe de nombreuses approches à ce problème. D'une part, il existe différents paradigmes pour la planification temporelle, par example: la planification par un recherche d'une solution optimale dans des graphes de planification (STRIPS), la planification via la satisfiabilité ou la planification pardes processus de Markov. Ces approches sont mutuellement incompatibles. D'autre part, la planification temporelle exige une sujet-spécification – comme il est défini d'une manière méthodologique. Selon cette situation, cette thèse vise à proposer une analyse approfondi de la planification avec des contraintes floues qui contient quelques remèdes à ces difficultés. À savoir, deux approches à la représentation et la modélisation de ces questions sont mises.Dans la première (chapitre 2, chapitre 3) - les relations floues d'Allen en tant que contraintes temporelles floues sont représentés par des normes de convolutions dans un espace de Banach des fonctions intégrables de Lebesgue. Cela nous permet de nous immergerles relations d'Allen dans les contextes computationnels de la planification temporelle (basée sur STRIPS et sur la procedure de Davis-Putnam) et d'élucider leur nature quantitative. Cette approche est développée dans un contexte des problèmes par systèmes multi-agents comme un sujet de cette approche. Dans les chapitres 4 et 5 les contraintes temporelles floues avec flou – introduit par préférences - sont représentées en termes logiques de la logique préférentielle de Halpern-Shoham. Cela nous permet d'adopter ces resultats dans une construction du contrôleur du plan. Cette approche est développée dans un contexte du problème du voyageur de commerce. Enfin, une tentative de réconcilier ces deux lignes de représentation des contraintes temporelles floues a été proposée dans le dernier chapitre
Temporal planning forms conceptually a part of temporal reasoning and it belongs to research area of Artificial Intelligence and it may be seen as an extension of classical planning by temporal aspects of acting. Temporal planing is usually complemented by considering preferences or different types of temporal constraints imposed on execution of actions. There exist many approaches to this issue. One one hand, there are different paradigms to temporal planning, such as: planning via search in graphs (STRIPS), planning via satisfiability or planning in terms of Markov processes. These approaches are mutually incompatible. In addition, temporal planning requires a subject-specification as it is rather defined in a methodological way. On the other hand, temporal constraints are represented and modeled in different ways dependently on their quantitative or qualitative nature. In particular, Allen’s relations between temporal intervals – an important class of temporal constraints – do not have any quantitative aspects and cannot be considered in computational contexts. According to this situation, this PhD-thesis is aimed at the proposing a depth-analysis of temporal planning with fuzzy constraints which contains some remedies on these difficulties. Namely, two approaches to the representation and modeling of these issues are put forward. In the first one (chapter 2, chapter 3) – fuzzy Allen’s relations as fuzzy temporal constraints are represented by norms of convolutions in a Banach space of Lebesgue integrable functions. It allows us immerse Allen’s relations in the computational contexts of temporal planning (based on STRIPS and on DavisPutnam procedure) and to elucidate their quantitative nature. This approach is developed in a context of Multi-Agent Problem as a subject basis of this approach. In the second one (chapter 4, chapter 5) – fuzzy temporal constrains with fuzziness introduced by preferences are represented in a logical terms of Preferential Halpern-Shoham Logic. It allows us to adopt these result in a construction of the plan controller. This approach is developed in a context of Temporal Traveling Salesman Problem as a subject basis of this approach. Finally, an attempt to reconcile these two lines of representation of fuzzy temporal constraints was also proposed
APA, Harvard, Vancouver, ISO, and other styles
8

Gruber, Wolfgang. "Modeling and transformation of workflows with temporal constraints." Berlin : Amsterdam : Aka, Akademische Verlagsgesellschaft ; IOS Press, 2004. http://catalog.hathitrust.org/api/volumes/oclc/57677828.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cotroneo, Orazio. "Mining declarative process models with quantitative temporal constraints." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24636/.

Full text
Abstract:
Time has always been a subject of study in science, philosophy and religion. Time was referred by the ancient Greeks with two separate words: Chronos and Kairos. Chronos referring to the quantitative aspect of it, while Kairos referring to the qualitative part of it. In this work, time, as a measurement system for a given business context, would be explored in both of its forms. Specifically in the last few years, embedding the notion of quantitative time in discovering declarative mining models has been a point of focus in research. The aim of this work is to enrich declarative process mining models with the notion of quantitative time, and then to adapt the discovery algorithm, inspired by Mooney in 1995, and then modified by Palmieri in 2020, to discover the enriched models.
APA, Harvard, Vancouver, ISO, and other styles
10

Teytaut, Yann. "On temporal constraints for deep neural voice alignment." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS196.

Full text
Abstract:
S’écouter, se répondre, faire se coïncider, se coordonner, s’accorder, se suivre, s’adapter, être à l’unisson, se synchroniser, s’aligner... Le riche vocabulaire dédié à la mise en correspondance dans le temps des activités humaines montre l’importance que revêt leur organisation temporelle. La communication humaine, multi-modale par nature, est pleinement concernée par cette problématique puisqu’il existe un écart sémantique entre les locutions orales et leurs séquences symboliques : comment bien interpréter un message écrit sans l’intonation vocale ? quel style performatif au delà d’une partition musicale figée ? Cette thèse se propose de révéler et expliquer les complexes relations entre les domaines audio et symbolique afin de réduire cet écart grâce à l’étude fine de l’inhérente temporalité contenue dans les enregistrements vocaux. Au coeur de cet objectif, se trouve la tâche d’alignement de voix qui vise à déterminer l’occurrence temporelle de symboles supposés présents dans un signal vocal. Ces travaux s’intéressent tout particulièrement au développement d’un modèle acoustique, ADAGIO, capable d’estimer de tels liens temps-symboles. Les récents progrès en apprentissage profond amènent à implémenter ADAGIO sous la forme d’un réseau de neurones profond dans un puissant formalisme générique : la “Classification Temporelle Connectioniste” (CTC). Cependant, la grande flexibilité offerte par la CTC est mise en défaut par son absence intrinsèque de garanties de prédictions temporellement précises. Les contributions clefs de cette recherche visent à renforcer la CTC par des contraintes temporelles supplémentaires pour améliorer la qualité des alignements déduits. Pour cela, trois tâches annexes de (1) reconstruction du contenu spectral, (2) propagation de la structure audio, et (3) monotonie guidée sont introduites et induisent un impact positif sur l’alignement entre voix, textes, et notes. Dès lors, ADAGIO contribue à de nombreuses applications pratiques au travers de collaborations telles que la synthèse vocale concaténative ou l’étude des stratégies de production expressives en jeu tant pour les attitudes sociales dans la parole que pour le style de chant dans des performances musicales
To listen, to respond, to make coincide, to coordinate, to adjust, to follow, to adapt, to be in unison, to synchronize, to align... The rich vocabulary dedicated to the correspondence of human activities shows the importance of their temporal organization. Human communication, multi-modal by nature, is fully concerned by this problematic since there exists a semantic gap between oral locutions and their symbolic sequences: how to interpret a written message without the vocal intonation? what performative style beyond a fixed musical score? This thesis proposes to uncover the complex underlying relationships between the audio and symbolic domains in order to reduce this gap through the fine study of the inherent temporality contained in voice recordings. The voice alignment task lies at the core of this objective, as it aims to determine the temporal occurrence of symbols that are assumed to be present in a voice signal. This work notably focuses on the development of an acoustic model, ADAGIO, capable of estimating such time-symbol links. Recent progress in deep learning have led to implement ADAGIO as a deep neural network in a powerful generic formalism: the “Connectionist Temporal Classification” (CTC). However, the great flexibility offered by CTC is undermined by its intrinsic lack of guarantees for temporally accurate predictions. Therefore, the key contributions of this research consist in reinforcing CTC with additional temporal constraints to improve the quality of the inferred alignments. To do so, three ancillary tasks of (1) spectral content reconstruction; (2) audio structure propagation; and (3) guided monotony are introduced and induce a positive impact on the alignment between voices, texts, and notes. Then, ADAGIO contributes to many practical applications via collaborations such as concatenative speech synthesis or the study of expressive production strategies at play for both social attitudes in speech and singing style in musical performances
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Temporal constraints"

1

Yates, Abigail E. Reasoning with qualitative temporal constraints. Manchester: UMIST, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stergiou, K. Backtracking algorithms for checking the consistency of temporal constraints. Manchester: UMIST, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dutta, Soumitra. "Approximate reasoning about temporal constraints in real time planning and search. Fontainbleau: INSEAD, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dutta, Soumitra. "Approximate reasoning about temporal constraints in real time planning and search". Fontainbleau: INSEAD, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mavroedis, John. Update operations in indefinite temporal constraint databases. Manchester: UMIST, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Papakammenos, Panagiotis. An SQL query language for indefinite temporal constraint databases. Manchester: UMIST, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hester, Todd. TEXPLORE: Temporal Difference Reinforcement Learning for Robots and Time-Constrained Domains. Heidelberg: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01168-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hester, Todd. TEXPLORE: Temporal Difference Reinforcement Learning for Robots and Time-Constrained Domains. Heidelberg: Springer International Publishing, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lips, Adrianus Leonardus Wilhelmus. Temporal constraints on the kinematics of the destabilization of an orogen: Syn- to post-orogenic extensional collapse of the northern Aegean Region = Tijdscontrole op de kinematiek van de destabilisiering van een orogeen : syn- en post-orogene, extensie gedomineerde, instorting van het noordelijk Egeïsch gebied. [Utrecht: Universiteit Utrecht, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gao, Hong. Building robust schedules using temporal protection - an empirical study of constraint based scheduling under machine failure uncertainty. Ottawa: National Library of Canada, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Temporal constraints"

1

Revesz, Peter. "Temporal Constraints." In Encyclopedia of Database Systems, 1–5. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_391-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Revesz, Peter. "Temporal Constraints." In Encyclopedia of Database Systems, 2945–48. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Revesz, Peter. "Temporal Constraints." In Encyclopedia of Database Systems, 3931–35. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wijsen, Jef. "Temporal Integrity Constraints." In Encyclopedia of Database Systems, 1–7. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_400-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wijsen, Jef. "Temporal Integrity Constraints." In Encyclopedia of Database Systems, 2976–82. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wijsen, Jef. "Temporal Integrity Constraints." In Encyclopedia of Database Systems, 3980–86. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Campos, M., J. Palma, and R. Marín. "Temporal Data Mining with Temporal Constraints." In Artificial Intelligence in Medicine, 67–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73599-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gertz, Michael, and Udo W. Lipeck. "“Temporal” Integrity Constraints in Temporal Databases." In Workshops in Computing, 77–92. London: Springer London, 1995. http://dx.doi.org/10.1007/978-1-4471-3033-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Terenziani, Paolo, Luca Anselma, and Stefania Montani. "Periodicity-Based Temporal Constraints." In Lecture Notes in Computer Science, 62–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11558590_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cohen, Ronald A. "Temporal Constraints on Attention." In The Neuropsychology of Attention, 409–32. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4419-7463-1_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Temporal constraints"

1

Wang, Lidan, Donald Metzler, and Jimmy Lin. "Ranking under temporal constraints." In the 19th ACM international conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1871437.1871452.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Talukdar, Partha Pratim, Derry Wijaya, and Tom Mitchell. "Acquiring temporal constraints between relations." In the 21st ACM international conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2396761.2396886.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cimatti, Alessandro, Marco Roveri, Angelo Susi, and Stefano Tonetta. "Object Models with Temporal Constraints." In 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods. IEEE, 2008. http://dx.doi.org/10.1109/sefm.2008.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mouhoub, M., and A. Sukpan. "Conditional and Composite Temporal Constraints with Preferences." In Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06). IEEE, 2006. http://dx.doi.org/10.1109/time.2006.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cucinotta, Tommaso, Gaetano Anastasi, and Luca Abeni. "Respecting Temporal Constraints in Virtualised Services." In 2009 33rd Annual IEEE International Computer Software and Applications Conference. IEEE, 2009. http://dx.doi.org/10.1109/compsac.2009.118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tansel, A. U. "Integrity constraints in temporal relational databases." In International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. IEEE, 2004. http://dx.doi.org/10.1109/itcc.2004.1286696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Grumbach, Stéphane, Philippe Rigaux, and Luc Segoufin. "Spatio-temporal data handling with constraints." In the sixth ACM international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/288692.288712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Benmansour, Rachid, Oliver Braun, and Said Hanafi. "Scheduling under resources and temporal constraints." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wondoh, John, Georg Grossmann, and Markus Stumptner. "Dynamic temporal constraints in business processes." In ACSW 2017: Australasian Computer Science Week 2017. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3014812.3014848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Duisberg, R. A. "Animated graphical interfaces using temporal constraints." In the SIGCHI conference. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/22627.22361.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Temporal constraints"

1

Pollack, Martha E. Mixed-Initiative Development of Plans With Expressive Temporal Constraints. Fort Belvoir, VA: Defense Technical Information Center, June 2007. http://dx.doi.org/10.21236/ada474565.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dorr, Bonnie, and Terry Gasterland. Constraints on the Generation of Tense, Aspect, and Connecting Words from Temporal Expressions. Fort Belvoir, VA: Defense Technical Information Center, August 2002. http://dx.doi.org/10.21236/ada459275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baader, Franz, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, and Veronika Thost. Metric Temporal Description Logics with Interval-Rigid Names (Extended Version). Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.233.

Full text
Abstract:
In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a growing interest in extending this work to the quantitative case. In this paper, we complement existing results on the combination of DLs with metric temporal logics over the natural numbers by introducing interval-rigid names. This allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time.
APA, Harvard, Vancouver, ISO, and other styles
4

Bleeker, W., J. Smith, M. Hamilton, S. Kamo, D. Liikane, P. Hollings, R. Cundari, M. Easton, and D. Davis. The Midcontinent Rift and its mineral systems: overview and temporal constraints of Ni-Cu-PGE mineralized intrusions. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2020. http://dx.doi.org/10.4095/326880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Davis, W. J., G. Chi, S. Castonguay, and M. McLeod. Temporal relationships between plutonism, metamorphism, and gold mineralization in southwestern New Brunswick: U-Pb and 40Ar/39Ar geochronological constraints. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2004. http://dx.doi.org/10.4095/215841.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. On the Complexity of Temporal Query Answering. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.191.

Full text
Abstract:
Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expressed by an appropriate Description Logic (DL) and the queries are conjunctive queries. Motivated by situation awareness applications, we investigate an extension of OBDA to the temporal case. As query language we consider an extension of the well-known propositional temporal logic LTL where conjunctive queries can occur in place of propositional variables, and as ontology language we use the prototypical expressive DL ALC. For the resulting instance of temporalized OBDA, we investigate both data complexity and combined complexity of the query entailment problem.
APA, Harvard, Vancouver, ISO, and other styles
7

Moore, David J. Estimating Carbon Flux and Storage: Constraint of the Community Land Model Using Observations at Different Temporal Scales. Office of Scientific and Technical Information (OSTI), January 2019. http://dx.doi.org/10.2172/1504233.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bernal, CArolina, and Razvan Vlaicu. Child Labor, Rainfall Shocks, and Financial Inclusion: Evidence from Rural Households. Inter-American Development Bank, August 2023. http://dx.doi.org/10.18235/0005058.

Full text
Abstract:
This paper examines how rural households cope with climate change related rainfall shocks by re-allocating childrens time between domestic activities and school attendance. Households affected by an unanticipated rainfall shock face an inter-temporal trade-off between current household income and future potential earnings. Financial inclusion may mitigate or exacerbate the human capital impacts of rainfall shocks depending on whether it relaxes or constrains household budgets. The data come from a three-round panel household survey in rural Colombia collected between 2010-2016. The main findings are that rainfall shocks induce households to choose immediate benefits over long-run investments in education by increasing the incidence of child labor and household chores at the expense of school attendance. Over-indebtedness through pre-existing formal loans reinforces the likelihood that a child works due to rainfall shocks, whereas asset insurance, foreign remittances, and natural disaster aid mitigate or eliminate the shock-induced shift toward domestic activities and away from schooling.
APA, Harvard, Vancouver, ISO, and other styles
9

Rice, J., R. C. Paulen, M. Ross, M. B. McClenaghan, and H. E. Campbell. Quaternary geology of the southern Core Zone area, Quebec and Newfoundland and Labrador. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331426.

Full text
Abstract:
The complex glacial geomorphology of east-central Quebec and western Labrador has resulted in conflicting ice-sheet reconstructions, leaving many questions regarding the behaviour of large ice sheets within their inner regions. Specifically, the ice-flow chronology and subglacial conditions remainpoorly constrained. To address this, surficial geology investigations were conducted across the border of Quebec and Labrador. A complex glacial history consisting of five ice-flow phases influenced by regional ice-stream dynamics was identified, including a near-complete ice-flow reversal. During each ice-flow phase, the subglacial thermal conditions fluctuated both spatially and temporally, resulting in palimpsest glacial dispersal patterns. Deglacial ages from samples collected as part of this research confirm deglaciation occurred relatively rapidly around 8 ka. The results of this work lead to a better understanding of the glacial history of an inner region of the Laurentide Ice Sheet and have important implications for mineral exploration in the southern Core Zone area.
APA, Harvard, Vancouver, ISO, and other styles
10

Rice, J. M., R. C. Paulen, M. Ross, M. B. McClenaghan, and H E Campbell. Quaternary geology of the south Core Zone area, Quebec and Labrador. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330903.

Full text
Abstract:
The complex glacial geomorphology of east-central Quebec and western Labrador has resulted in conflicting ice sheet reconstructions leaving many questions regarding the behaviour of large ice sheets within their inner regions. Specifically, the ice-flow chronology and subglacial conditions remain poorly constrained. To address this, surficial geology investigations were conducted across the border of Quebec and Labrador. A complex glacial history consisting of five ice-flow phases influenced by regional ice stream dynamics was identified, including a near-complete ice-flow reversal. During each ice-flow phase, the subglacial thermal conditions fluctuated both spatially and temporally, resulting in palimpsest glacial dispersal patterns. Deglacial ages from samples collected as part of this research confirm deglaciation occurred relatively rapidly around 8 ka. The results of this work improve our understanding of the glacial history of an inner region of the Laurentide Ice Sheet and have important implications for mineral exploration in the southern Core Zone area.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Temporal constraints' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography