• Refine Query
• Source
• Publication year
• to
• Language
• 3
• 2
• Tagged with
• 9
• 9
• 4
• 4
• 4
• 4
• 4
• 4
• 4
• 4
• 3
• 3
• 3
• 3
• 3
• The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

On the membership problem for pattern languages and related topics

Schmid, Markus L. January 2012 (has links)
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.
2

Um processo para construção e instanciação de frameworks baseados em uma linguagem de padrões para um domínio específico. / A process for construction and instantiation of frameworks based on a domain-specific pattern language.

Braga, Rosana Teresinha Vaccare 14 February 2003 (has links)
3

Um processo para construção e instanciação de frameworks baseados em uma linguagem de padrões para um domínio específico. / A process for construction and instantiation of frameworks based on a domain-specific pattern language.

Rosana Teresinha Vaccare Braga 14 February 2003 (has links)
4

Towards a knowledge management methodology for articulating the role of hidden knowledges

Smith, Simon Paul January 2012 (has links)
Knowledge Management Systems are deployed in organisations of all sizes to support the coordination and control of a range of intellectual assets, and the low cost infrastructures made available by the shift to ‘cloud computing’ looks to only increase the speed and pervasiveness of this move. However, their implementation has not been without its problems, and the development of novel interventions capable of supporting the mundane work of everyday organisational settings has ultimately been limited. A common source of trouble for those formulating such systems is said to be that some proportion of the knowledge held by a setting’s members is hidden from the undirected view of both The Organisation and its analysts - typically characterised as a tacit knowledge - and can therefore go unnoticed during the design and deployment of new technologies. Notwithstanding its utility, overuse of this characterisation has resulted in the inappropriate labelling of a disparate assortment of phenomena, some of which might be more appropriately re-specified as ‘hidden knowledges’: a standpoint which seeks to acknowledge their unspoken character without making any unwarranted claims regarding their cognitive status. Approaches which focus on the situated and contingent properties of the actual work carried out by a setting’s members - such as ethnomethodologically informed ethnography - have shown significant promise as a mechanism for transforming the role played by members’ practices into an explicit topic of study. Specifically they have proven particularly adept at noticing those aspects of members’ work that might ordinarily be hidden from an undirected view, such as the methodic procedures through which we can sometimes mean more than we can say in-just-so-many-words. Here - within the context of gathering the requirements for new Knowledge Management Systems to support the reuse of existing knowledge - the findings from the application of just such an approach are presented in the form of a Pattern Language for Knowledge Management Systems: a descriptive device that lends itself to articulating the role that such hidden knowledges are playing in everyday work settings. By combining these three facets, this work shows that it is possible to take a more meaningful approach towards noticing those knowledges which might ordinarily be hidden from view, and apply our new understanding of them to the design of Knowledge Management Systems that actively engage with the knowledgeable work of a setting’s members.
5

A contribution to the process of designing for learning in Massive Open Online Courses (MOOCs) / Uma contribuição ao processo de design de aprendizagem em Cursos Online Abertos e Massivos (MOOCs)

Fassbinder, Aracele Garcia de Oliveira 03 July 2018 (has links)
6

A contribution to the process of designing for learning in Massive Open Online Courses (MOOCs) / Uma contribuição ao processo de design de aprendizagem em Cursos Online Abertos e Massivos (MOOCs)

Aracele Garcia de Oliveira Fassbinder 03 July 2018 (has links)
7

Improving Networked Learning in Higher Education: Language Functions and Design Patterns

Yang, Dai Fei January 2007 (has links)
8

Improving Networked Learning in Higher Education: Language Functions and Design Patterns

Yang, Dai Fei January 2007 (has links)