Thematische Bibliographien / Pattern languages

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Pattern languages“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 20. Februar 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Pattern languages" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Pattern languages"

Salingaros, Nikos A. „The structure of pattern languages“. Architectural Research Quarterly 4, Nr. 2 (Juni 2000): 149–62. http://dx.doi.org/10.1017/s1359135500002591.

Der volle Inhalt der Quelle

Annotation:

Pattern languages help us tackle the complexity of a variety of systems ranging from computer software, to buildings and cities. Each ‘pattern’ represents a rule governing one working piece of a complex system, and the application of pattern languages can be done systematically. Design that wishes to connect to human beings needs the information contained in a pattern language. This paper describes how to validate existing pattern languages, how to develop them, and how they evolve. The connective geometry of urban interfaces is derived from the architectural patterns of Christopher Alexander.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barney, Christopher Aaron. „Application of Pattern Language for Game Design in Pedagogy and Design Practice“. Information 12, Nr. 10 (23.09.2021): 393. http://dx.doi.org/10.3390/info12100393.

Der volle Inhalt der Quelle

Annotation:

Existing implementations of game design patterns have largely been confined to theoretical or research settings. Weaknesses in these implementations have prevented game design patterns from being properly evaluated as an educational and practical development tool. This paper examines these weaknesses, describes a method of developing and applying patterns that overcome the weaknesses, and evaluates use of the method for game design education and practice. Weaknesses in existing pattern implementations are: the omission of design problems, presumption of functional completeness at the level of pattern languages, narrow topical focus, and lack of a concise, repeatable method for pattern production. Several features of the proposed method were specifically built to address these weaknesses, namely the pattern template, the process for connecting patterns into a language and assessing the language’s scope, a rubric for assessing pattern confidence and interconnectivity confidence, and pattern-building exercises. This method was applied in a classroom setting. Results as assessed by the evaluation of student work suggest that creating patterns/pattern languages is an effective pedagogical approach. Designs produced using designer-created patterns closely align with existing design theory and are clearly understood by students. The above results may indicate that the path to gaining wider acceptance of pattern theory as a design framework within game design is not to produce a universal pattern language, but to facilitate the creation of case-specific languages by students and professional designers that use a shared ontology, and thus can be combined easily to solve the diverse sets of problems faced by these groups.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kari, Lila, Alexandru Mateescu, Gheorghe Pǎun und Arto Salomaa. „Multi-pattern languages“. Theoretical Computer Science 141, Nr. 1-2 (April 1995): 253–68. http://dx.doi.org/10.1016/0304-3975(94)00087-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akmal, Saiful, Fera Busfina Zalha, Rita Hermida, Satria Juni und Lianita Ali Nasution. „Sentence Pattern Contrastive Analysis of English and Sigulai Language“. Eralingua: Jurnal Pendidikan Bahasa Asing dan Sastra 4, Nr. 2 (27.07.2020): 198. http://dx.doi.org/10.26858/eralingua.v4i2.13960.

Der volle Inhalt der Quelle

Annotation:

This study focuses on analyzing and contrasting sentence pattern differences in both English and Sigulai languages. The study intends to find out the differences in sentence pattern between English and Sigulai language and how the sentence pattern of two languages are different. This current study was conducted by employing the qualitative method by using the contrastive analysis approach. Purposive sampling was used to select samples comprising two native-Simeulue students studying in Banda who speaks Sigulai. The findings show that there were contrast differences in verbal and nominal sentence patterns between English and Sigulai. Moreover, it can be concluded that Sigulai language has a non-configurational sentence pattern as many other Austronesian languages in Aceh and Indonesia in general.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ellaway, Rachel H., und Joanna Bates. „Exploring patterns and pattern languages of medical education“. Medical Education 49, Nr. 12 (27.11.2015): 1189–96. http://dx.doi.org/10.1111/medu.12836.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Helfman, Jonathan. „Dotplot patterns: A literal look at pattern languages“. Theory and Practice of Object Systems 2, Nr. 1 (1996): 31–41. http://dx.doi.org/10.1002/(sici)1096-9942(1996)2:1<31::aid-tapo3>3.0.co;2-a.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Brugali, Davide, und Katia Sycara. „Frameworks and pattern languages“. ACM Computing Surveys 32, Nr. 1es (März 2000): 2. http://dx.doi.org/10.1145/351936.351938.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Iran Adhiti, Ida Ayu. „KAJIAN LINGUISTIK HISTORIS KOMPARATIF PADA POLA PERUBAHAN BUNYI“. KULTURISTIK: Jurnal Bahasa dan Budaya 3, Nr. 2 (08.07.2019): 75. http://dx.doi.org/10.22225/kulturistik.3.2.1203.

Der volle Inhalt der Quelle

Annotation:

[Title: Linguistic Study of Comparative Historis on Sound Change Patterns] The local languages in Nusa Tenggara Timur need to be observed, analysed, constructed, and conserved. Data research phenomena is done deeply approaching especially the local languages, which exist and develop in Alor Island. The observer analyses language phenomena on pattern of sound change in the languages of Kabola, Hamap, and Klon in Alor Island. The complete data of the three language are analysed by the study of comparative historic linguistic. The observation that analyses the languages in Alor Island use the synchronous approach, to know the language development in a period. The theory is used to analyse the pattern of sound change in the languages of Kabola, Hamap, and Klon in Alor Island is Blust (2013). Hock, (1988), Crowley (1987), Chomsky (1968), Dyen (1978), Schane (1973), Bynon (1979), Antila (1972), Jeffers and Lehiste (1979), and Keraf (1996). The result of observation is hoped that the young generation as local language speaker realize and understand that their languages are the same origin of languages so they are reconstructed, developed, and conserved so that they can support national language.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Colle, Andi Tenry Lawangen Aspat. „A CONTRASTIVE ANALYSIS OF ENGLISH AND BUGINESE DECLARATIVE SENTENCES PATTERN“. JOURNAL OF ADVANCED ENGLISH STUDIES 3, Nr. 1 (29.02.2020): 16. http://dx.doi.org/10.47354/jaes.v3i1.79.

Der volle Inhalt der Quelle

Annotation:

This study aimed at investigating the differences and similarities of sentences pattern in English and Buginese and the approach of this study used namely qualitative, where the contrastive analysis was chosen as the method of the study in comparing and analyzing sentence patterns of both languages. From the analysis, it revealed that the similarities of two languages were: (1) both languages have similar sentences pattern, especially for the verbal simple present tense and verbal and nominal future tense, (2) both languages, have the same elements to construct a sentence (S+V+O). Meanwhile, the differences between both of them were (1) declarative sentence pattern for the nominal simple present tense, and verbal and nominal past tense between two languages is different. (2) There is no such pattern S + Vlinking + Subject Complement in Buginese since Buginese has no verb tobe. (3) In making past sentences in Buginese, it would involve Ergative Pronoun, namely -na, -no, -ni, and their position attached at the end of word pura. Hopefully, these findings can predict the interference would happen during teaching English as a target language with the student who has Buginese as their mother tongue. Furthermore, it is suggested that future researchers could conduct a Buginese language study in different settings, such as pragmatics analysis, morphological system, and phonology system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rouhi, Alireza, und Bahman Zamani. „Towards a formal model of patterns and pattern languages“. Information and Software Technology 79 (November 2016): 1–16. http://dx.doi.org/10.1016/j.infsof.2016.06.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Pattern languages"

Mikkonen, S. (Samu). „Requirements of the interaction design pattern languages for the web development:a pattern language delivery platform“. Master's thesis, University of Oulu, 2016. http://urn.fi/URN:NBN:fi:oulu-201512312312.

Der volle Inhalt der Quelle

Annotation:

Purpose: Previous studies of pattern languages have been focused HCI pattern languages or presented them in the context web development before advent of touchscreen mobile devices. This study looks at potential and evolvement of pattern languages in general and then evaluates the effects and challenges that modern Web environment brings to development of pattern languages for the web development. Methodology: This research was conducted as design science research by following the process of recognized design science research methodology. Experiment including qualitative survey was conducted in evaluation phase. Narrative literature review was conducted summarizing the most relevant and highest quality knowledge available to answer the research questions as part of the background research. Findings: This research points to that pattern languages have untapped potential in web technology based user interfaces. This study didn’t yet provide definitive answer to how to untap this potential, but instead provided set of requirements to build upon. Research limitations: Study focuses on only developing user interface patterns as front-end elements that can be paired with desired backend implementations. Artifacts developed in this study should also be evaluated in larger qualitative research in order to better evaluate the impact. Practical implications: Delivery platform for pattern language was developed and documented as artifact. Basic pattern language was also developed and documented to enable evaluation of the delivery platform. Insights of this paper aims to provide basis for the building pattern languages for the web development. Value of the paper comes also from discussing the role of recent tools and techniques that have been recently adopted in the web development or are just being developed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barwell, Adam David. „Pattern discovery for parallelism in functional languages“. Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/15641.

Der volle Inhalt der Quelle

Annotation:

No longer the preserve of specialist hardware, parallel devices are now ubiquitous. Pattern-based approaches to parallelism, such as algorithmic skeletons, simplify traditional low-level approaches by presenting composable high-level patterns of parallelism to the programmer. This allows optimal parallel configurations to be derived automatically, and facilitates the use of different parallel architectures. Moreover, parallel patterns can be swap-replaced for sequential recursion schemes, thus simplifying their introduction. Unfortunately, there is no guarantee that recursion schemes are present in all functional programs. Automatic pattern discovery techniques can be used to discover recursion schemes. Current approaches are limited by both the range of analysable functions, and by the range of discoverable patterns. In this thesis, we present an approach based on program slicing techniques that facilitates the analysis of a wider range of explicitly recursive functions. We then present an approach using anti-unification that expands the range of discoverable patterns. In particular, this approach is user-extensible; i.e. patterns developed by the programmer can be discovered without significant effort. We present prototype implementations of both approaches, and evaluate them on a range of examples, including five parallel benchmarks and functions from the Haskell Prelude. We achieve maximum speedups of 32.93x on our 28-core hyperthreaded experimental machine for our parallel benchmarks, demonstrating that our approaches can discover patterns that produce good parallel speedups. Together, the approaches presented in this thesis enable the discovery of more loci of potential parallelism in pure functional programs than currently possible. This leads to more possibilities for parallelism, and so more possibilities to take advantage of the potential performance gains that heterogeneous parallel systems present.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schmid, Markus L. „On the membership problem for pattern languages and related topics“. Thesis, Loughborough University, 2012. https://dspace.lboro.ac.uk/2134/10304.

Der volle Inhalt der Quelle

Annotation:

In this thesis, we investigate the complexity of the membership problem for pattern languages. A pattern is a string over the union of the alphabets A and X, where X := {x_1, x_2, x_3, ...} is a countable set of variables and A is a finite alphabet containing terminals (e.g., A := {a, b, c, d}). Every pattern, e.g., p := x_1 x_2 a b x_2 b x_1 c x_2, describes a pattern language, i.e., the set of all words that can be obtained by uniformly substituting the variables in the pattern by arbitrary strings over A. Hence, u := cacaaabaabcaccaa is a word of the pattern language of p, since substituting cac for x_1 and aa for x_2 yields u. On the other hand, there is no way to obtain the word u' := bbbababbacaaba by substituting the occurrences of x_1 and x_2 in p by words over A. The problem to decide for a given pattern q and a given word w whether or not w is in the pattern language of q is called the membership problem for pattern languages. Consequently, (p, u) is a positive instance and (p, u') is a negative instance of the membership problem for pattern languages. For the unrestricted case, i.e., for arbitrary patterns and words, the membership problem is NP-complete. In this thesis, we identify classes of patterns for which the membership problem can be solved efficiently. Our first main result in this regard is that the variable distance, i.e., the maximum number of different variables that separate two consecutive occurrences of the same variable, substantially contributes to the complexity of the membership problem for pattern languages. More precisely, for every class of patterns with a bounded variable distance the membership problem can be solved efficiently. The second main result is that the same holds for every class of patterns with a bounded scope coincidence degree, where the scope coincidence degree is the maximum number of intervals that cover a common position in the pattern, where each interval is given by the leftmost and rightmost occurrence of a variable in the pattern. The proof of our first main result is based on automata theory. More precisely, we introduce a new automata model that is used as an algorithmic framework in order to show that the membership problem for pattern languages can be solved in time that is exponential only in the variable distance of the corresponding pattern. We then take a closer look at this automata model and subject it to a sound theoretical analysis. The second main result is obtained in a completely different way. We encode patterns and words as relational structures and we then reduce the membership problem for pattern languages to the homomorphism problem of relational structures, which allows us to exploit the concept of the treewidth. This approach turns out be successful, and we show that it has potential to identify further classes of patterns with a polynomial time membership problem. Furthermore, we take a closer look at two aspects of pattern languages that are indirectly related to the membership problem. Firstly, we investigate the phenomenon that patterns can describe regular or context-free languages in an unexpected way, which implies that their membership problem can be solved efficiently. In this regard, we present several sufficient conditions and necessary conditions for the regularity and context-freeness of pattern languages. Secondly, we compare pattern languages with languages given by so-called extended regular expressions with backreferences (REGEX). The membership problem for REGEX languages is very important in practice and since REGEX are similar to pattern languages, it might be possible to improve algorithms for the membership problem for REGEX languages by investigating their relationship to patterns. In this regard, we investigate how patterns can be extended in order to describe large classes of REGEX languages.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Meng, Ziyuan. „Two-Bit Pattern Analysis For Quantitative Information Flow“. FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1326.

Der volle Inhalt der Quelle

Annotation:

Protecting confidential information from improper disclosure is a fundamental security goal. While encryption and access control are important tools for ensuring confidentiality, they cannot prevent an authorized system from leaking confidential information to its publicly observable outputs, whether inadvertently or maliciously. Hence, secure information flow aims to provide end-to-end control of information flow. Unfortunately, the traditionally-adopted policy of noninterference, which forbids all improper leakage, is often too restrictive. Theories of quantitative information flow address this issue by quantifying the amount of confidential information leaked by a system, with the goal of showing that it is intuitively “small” enough to be tolerated. Given such a theory, it is crucial to develop automated techniques for calculating the leakage in a system. This dissertation is concerned with program analysis for calculating the maximum leakage, or capacity, of confidential information in the context of deterministic systems and under three proposed entropy measures of information leakage: Shannon entropy leakage, min-entropy leakage, and g-leakage. In this context, it turns out that calculating the maximum leakage of a program reduces to counting the number of possible outputs that it can produce. The new approach introduced in this dissertation is to determine two-bit patterns, the relationships among pairs of bits in the output; for instance we might determine that two bits must be unequal. By counting the number of solutions to the two-bit patterns, we obtain an upper bound on the number of possible outputs. Hence, the maximum leakage can be bounded. We first describe a straightforward computation of the two-bit patterns using an automated prover. We then show a more efficient implementation that uses an implication graph to represent the two- bit patterns. It efficiently constructs the graph through the use of an automated prover, random executions, STP counterexamples, and deductive closure. The effectiveness of our techniques, both in terms of efficiency and accuracy, is shown through a number of case studies found in recent literature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kavanagh, Maria Joy. „Foci and centres in the design and use of pattern languages“. Thesis, De Montfort University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.414930.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hoffmann, Ruth. „On dots in boxes, or permutation pattern classes and regular languages“. Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/7034.

Der volle Inhalt der Quelle

Annotation:

This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of a regular pattern class under the rank encoding are also regular languages under that encoding. Further we investigated the sets of permutations, which in their block-decomposition have the same simple permutation, and again we found that these sets of permutations are regular languages under the rank encoding. This natural progression from plus- and minus-decomposable to simple decomposable permutations led us further to the set of simple permutations under the rank encoding, which we have also shown to be regular under the rank encoding. This regular language enables us to find the set of simple permutations of any class, independent of whether the class is regular under the rank encoding. Furthermore the regularity of the languages of some types of classes is discussed. Under the rank encoding we show that in general the skew-sum of classes, separable classes and wreath classes are not regular languages; but that the direct-sum of classes, and with some restrictions on the cardinality of the input classes the skew-sum and wreath sum of classes in fact are regular under this encoding. Other encodings such as the insertion encoding and the geometric grid encoding are discussed and in the case of the geometric grid encoding alternative and constructive ways of retrieving the basis of a geometric grid class are suggested. The aforementioned results of the rank encoding have been implemented, amongst other previously shown results, and tested. The program is available and accessible to everyone. We show that the implementation for finding the block-decomposition of a permutation has cubic time complexity with respect to the length of the permutation. The code for constructing the automaton that accepts the language of all plus-indecomposable permutations of a regular class under the rank encoding has quadratic time complexity with respect to the alphabet of the language. The procedure to find the automaton that accepts the language of minus-decomposable permutations has complexity O(k⁵) and we show that the implementation of the automaton to find the language of simple permutations under the rank encoding has time complexity O(k⁵ 2ᵏ), where k is the size of the alphabet. Further we show benchmark testing on previous important results involving the rank encoding on classes and their bases.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Antohe, Diana. „Parallel Pattern: A Familial Legacy of Care“. VCU Scholars Compass, 2019. https://scholarscompass.vcu.edu/etd/5837.

Der volle Inhalt der Quelle

Annotation:

My work revolves around exploring identity of the in-between, occupying the Venn diagram middle of two cultures. As a Romanian-born, American-raised artist, I want to preserve and broadcast links to the cultures of my upbringing and birthplace. In attempts to ground and define my own “in-between” identity, I look to my parents and grandparents for cues on how they made home for themselves wherever they went, reflecting their experiences with voluntary and involuntary displacement. This text connects the research and influential family practices that shaped its companion exhibition, ranging from the role of portability in emotional transnationalism to the lasting mythology the soap opera “Dallas” holds in Romania.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Freydenberger, Dominik D. [Verfasser], und Nicole [Akademischer Betreuer] Schweikardt. „Inclusion of pattern languages and related problems / Dominik D. Freydenberger. Gutachter: Nicole Schweikardt“. Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2011. http://d-nb.info/1044274719/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Freydenberger, Dominik [Verfasser], und Nicole [Akademischer Betreuer] Schweikardt. „Inclusion of pattern languages and related problems / Dominik D. Freydenberger. Gutachter: Nicole Schweikardt“. Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2011. http://nbn-resolving.de/urn:nbn:de:hebis:30-109912.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ulus, Dogan. „Pattern Matching with Time : Theory and Applications“. Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM003/document.

Der volle Inhalt der Quelle

Annotation:

Les systèmes dynamiques présentent des comportements temporels qui peuvent être exprimés sous diverses formes séquentielles telles que des signaux, des ondes, des séries chronologiques et des suites d'événements. Détecter des motifs sur de tels comportements temporels est une tâche fondamentale pour comprendre et évaluer ces systèmes. Étant donné que de nombreux comportements du système impliquent certaines caractéristiques temporelles, le besoin de spécifier et de détecter des motifs de comportements qui implique des exigences de synchronisation, appelées motifs temporisés, est évidente.Cependant, il s'agit d'une tâche non triviale due à un certain nombre de raisons, notamment la concomitance des sous-systèmes et la densité de temps.La contribution principale de cette thèse est l'introduction et le développement du filtrage par motif temporisé, c'est-à-dire l'identification des segments d'un comportement donné qui satisfont un motif temporisé. Nous proposons des expressions rationnelles temporisées (TRE) et la logique de la boussole métrique (MCL) comme langages de spécification pour motifs temporisés. Nous développons d'abord un nouveau cadre qui abstraite le calcul des aspects liés au temps appelé l'algèbre des relations temporisées. Ensuite, nous fournissons des algorithmes du filtrage hors ligne pour TRE et MCL sur des comportements à temps dense à valeurs discrètes en utilisant ce cadre et étudions quelques extensions pratiques.Il est nécessaire pour certains domaines d'application tels que le contrôle réactif que le filtrage par motif doit être effectué pendant l'exécution réelle du système. Pour cela, nous fournissons un algorithme du filtrage en ligne pour TREs basé sur la technique classique des dérivées d'expressions rationnelles. Nous croyons que la technique sous-jacente qui combine les dérivées et les relations temporisées constitue une autre contribution conceptuelle majeure pour la recherche sur les systèmes temporisés.Nous présentons un logiciel libre Montre qui implémente nos idées et algorithmes. Nous explorons diverses applications du filtrage par motif temporisé par l'intermédiaire de plusieurs études de cas. Enfin, nous discutons des orientations futures et plusieurs questions ouvertes qui ont émergé à la suite de cette thèse
Dynamical systems exhibit temporal behaviors that can be expressed in various sequential forms such as signals, waveforms, time series, and event sequences. Detecting patterns over such temporal behaviors is a fundamental task for understanding and assessing these systems. Since many system behaviors involve certain timing characteristics, the need to specify and detect patterns of behaviors that involves timing requirements, called timed patterns, is evident. However, this is a non-trivial task due to a number of reasons including the concurrency of subsystems and density of time.The key contribution of this thesis is in introducing and developing emph{timed pattern matching}, that is, the act of identifying segments of a given behavior that satisfy a timed pattern. We propose timed regular expressions (TREs) and metric compass logic (MCL) as timed pattern specification languages. We first develop a novel framework that abstracts the computation of time-related aspects called the algebra of timed relations. Then we provide offline matching algorithms for TRE and MCL over discrete-valued dense-time behaviors using this framework and study some practical extensions.It is necessary for some application areas such as reactive control that pattern matching needs to be performed during the actual execution of the system. For that, we provide an online matching algorithm for TREs based on the classical technique of derivatives of regular expressions. We believe the underlying technique that combines derivatives and timed relations constitutes another major conceptual contribution for timed systems research.Furthermore, we present an open-source tool Montre that implements our ideas and algorithms. We explore diverse applications of timed pattern matching over several case studies using Montre. Finally we discuss future directions and several open questions emerged as a result of this thesis

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Pattern languages"

O, Coplien James, und Schmidt Douglas C, Hrsg. Pattern languages of program design. Reading, Mass: Addison-Wesley, 1995.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

C, Martin Robert, Riehle Dirk 1969- und Buschmann Frank, Hrsg. Pattern languages of program design 3. Reading, Mass: Addison-Wesley, 1998.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

M, Vlissides John, Coplien James O und Kerth Norman L, Hrsg. Pattern languages of program design, 2. Reading, Mass: Addison-Wesley, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James, Ralph Johnson, Paris Avgeriou, Neil B. Harrison und Uwe Zdun, Hrsg. Transactions on Pattern Languages of Programming II. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19432-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James, Ralph Johnson, Uwe Zdun und Eugene Wallingford, Hrsg. Transactions on Pattern Languages of Programming IV. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14291-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James, und Ralph Johnson, Hrsg. Transactions on Pattern Languages of Programming I. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10832-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James, Ralph Johnson, Uwe Zdun und Eugene Wallingford, Hrsg. Transactions on Pattern Languages of Programming III. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38676-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James. Transactions on Pattern Languages of Programming III. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noble, James, und Johnson Ralph E. Transactions on pattern languages of Programming I. Berlin: Springer, 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Purpose, pattern, and process. 8. Aufl. Dubuque, Iowa: Kendall/Hunt Pub., 2008.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Pattern languages"

Dersanambika, K. S., K. Krithivasan, C. Martin-Vide und K. G. Subramanian. „Hexagonal Pattern Languages“. In Lecture Notes in Computer Science, 52–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30503-3_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mailund, Thomas. „Pattern Matching“. In Domain-Specific Languages in R, 183–213. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3588-1_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sekar, R. C., R. Ramesh und I. V. Ramakrishnan. „Adaptive pattern matching“. In Automata, Languages and Programming, 247–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55719-9_78.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Faust, Sebastian, Carmit Hazay und Daniele Venturi. „Outsourced Pattern Matching“. In Automata, Languages, and Programming, 545–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39212-2_48.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jay, Barry, und Delia Kesner. „Pure Pattern Calculus“. In Programming Languages and Systems, 100–114. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11693024_8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kirchner, Claude, Radu Kopetz und Pierre-Etienne Moreau. „Anti-pattern Matching“. In Programming Languages and Systems, 110–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71316-6_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Flajolet, Philippe, Yves Guivarc’h, Wojciech Szpankowski und Brigitte Vallée. „Hidden Pattern Statistics“. In Automata, Languages and Programming, 152–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Siromoney, R., K. G. Subramanian und Abisha Jeyanthi. „Cryptosystems for Picture Languages“. In Syntactic and Structural Pattern Recognition, 315–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-83462-2_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Augustsson, Lennart. „Compiling pattern matching“. In Functional Programming Languages and Computer Architecture, 368–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15975-4_48.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Revuz, Dominique, und Marc Zipstein. „DZ A text compression algorithm for natural languages“. In Combinatorial Pattern Matching, 193–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56024-6_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Pattern languages"

Motohashi, Masanari, Hiroshi Nakano, Eiiti Hanyuda, Takeshi Kakeda und Koichiro Eto. „From pattern languages to a project language“. In the 2nd Asian Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2524629.2524648.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akado, Yuma, Sakurako Kogure, Alice Sasabe, Jei-Hee Hong, Keishi Saruwatari und Takashi Iba. „Five patterns for designing pattern mining workshops“. In EuroPLoP 2015: 20th European Conference on Pattern Languages of Programs. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2855321.2855331.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kawabe, Yuki, Haruka Mori, Aimi Burgoyne und Takashi Iba. „Pattern Experience Chart Generator function on a pattern language platform Patterns We Live By“. In EuroPLoP '18: 23rd European Conference on Pattern Languages of Programs. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3282308.3282337.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khail, Waheedullah Sulaiman, und Valentino Vranić. „Treating Pattern Sublanguages as Patterns with an Application to Organizational Patterns“. In EuroPLoP '17: European Conference on Pattern Languages of Programs. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3147704.3147710.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Griffiths, Richard, Lyn Pemberton, Jan Borchers und Adam Stork. „Pattern languages for interaction design“. In CHI '00 extended abstracts. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/633292.633510.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wania, Christine E., und Michael E. Atwood. „Pattern languages in the wild“. In the 4th International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1555619.1555635.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Todd, E., E. Kemp und C. Phillips. „Validating user interface pattern languages“. In the 4th Annual Conference of the ACM Special Interest Group. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/2331829.2331853.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Díaz, Paloma, Ignacio Aedo, Mary Beth Rosson und John M. Carroll. „A visual tool for using design patterns as pattern languages“. In the International Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1842993.1843005.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Suzuki, Ryohei, Takashi Watanabe und Takashi Iba. „Music Composition Patterns: A Pattern Language for Touching Music“. In EuroPLop '22: 27th European Conference on Pattern Languages of Programs. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3551902.3565071.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guerra, Eduardo, und Clovis Fernandes. „An evaluation process for pattern languages“. In the 8th Latin American Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/2581507.2581525.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Pattern languages"

Appelt, Douglas E., und Boyan Onyshkevych. The Common Pattern Specification Language. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1998. http://dx.doi.org/10.21236/ada631525.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Siri Ming, Siri Ming. Can children with autism learn more flexible language patterns? Experiment, Juli 2014. http://dx.doi.org/10.18258/2920.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Waters, Anna. Understanding Pervasive Language Impairment in Young Children: Exploring Patterns in Narrative Language and Functional Communication. Portland State University Library, Januar 2000. http://dx.doi.org/10.15760/etd.1030.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, und Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Der volle Inhalt der Quelle

Annotation:

An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, und Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Der volle Inhalt der Quelle

Annotation:

APA, Harvard, Vancouver, ISO und andere Zitierweisen

NIKITINA, IRINA. THE LANGUAGE OF CORRUPTION IN ENGLISH BUSINESS DISCOURSE. Science and Innovation Center Publishing House, 2020. http://dx.doi.org/10.12731/2077-1770-2020-4-3-163-169.

Der volle Inhalt der Quelle

Annotation:

This article is devoted to identifying the patterns of the use of the language of corruption in English business discourse. In the course of the research, the author analyzes functional features of the language of corruption in English business discourse and describes in detail the various techniques underlying the replacement of the direct naming of “bribe, to give a bribe” to the euphemistic one in English. The analysis allows identifying language strategies characteristic of the modern English business communication.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hoinkes, Ulrich. Indexicality and Enregisterment as Theoretical Approaches to the Sociolinguistic Analysis of Romance Languages. Universitatsbibliothek Kiel, November 2019. http://dx.doi.org/10.21941/hoinkesindexenregromlang.

Der volle Inhalt der Quelle

Annotation:

Social indexicality and enregisterment are basic notions of a theoretical model elaborated in the United States, the aim of which is to describe the relationship between the use of language variation and patterns of social behavior at the level of formal classification. This analytical approach is characterized by focusing on the interrelation of social performance and language awareness. In my contribution, I want to show how this modern methodology can give new impetus to the study of today’s problem areas in Europe, such as migration and language or urban life and language use. In particular, I am interested in the case of Catalan, which has been studied for some time by proponents of the North American enregisterment theory. This leads me to indicate that explicit forms of social conduct, such as language shift or the emblematic use of linguistic forms, can be interpreted with regard to the social indexicality of Catalan. I thus analyze them in a way which shows that authenticity and integration in Catalan society can be achieved to a considerable extent by practicing forms of linguistic enregisterment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, und Ralf Küsters. Matching Concept Descriptions with Existential Restrictions. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.93.

Der volle Inhalt der Quelle

Annotation:

Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of description logics, originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. Previous work has concentrated on (sub-)languages of CLASSIC, which in particular do not allow for existential restrictions. In this work, we present sound and complete decision algorithms for the solvability of matching problems and for computing sets of matchers for matching problems in description logics with existential restrictions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, und Ralf Küsters. Matching Concept Descriptions with Existential Restrictions. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.93.

Der volle Inhalt der Quelle

Annotation:

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hernández, Ana, Magaly Lavadenz und JESSEA YOUNG. Mapping Writing Development in Young Bilingual Learners. CEEL, 2012. http://dx.doi.org/10.15365/ceel.article.2012.2.

Der volle Inhalt der Quelle

Annotation:

A growing interest in Two-Way Bilingual Immersion (TWBI) programs has led to increased attention to bilingualism, biliteracy, and biculturalism. This article describes the writing development in Spanish and English for 49 kindergarten students in a 50/50 Two-Way Bilingual Immersion program. Over the course of an academic year, the authors collected writing samples to analyze evidence of cross-linguistic resource sharing using a grounded theoretical approach to compare and contrast writing samples to determine patterns of cross-linguistic resource sharing in English and Spanish. The authors identified four patterns: phonological, syntactic, lexical, and metalinguistic awareness. Findings indicated that emergent writers applied similar strategies as older bilingual students, including lexical level code-switching, applied phonological rules of L1 to their respective L2s, and used experiential and content knowledge to write in their second language. These findings have instructional implications for both English Learners and native English speakers as well as for learning from students for program improvement.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!