Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Pattern.
Dissertationen zum Thema „Pattern“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Pattern" 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.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
SAEKI, Motoshi, Takashi KOBAYASHI, Ryota SAKAMOTO, Junya KATADA und Shinpei HAYASHI. „Design Pattern Detection by Using Meta Patterns“. Institute of Electronics, Information and Communication Engineers, 2008. http://hdl.handle.net/2237/14977.
Der volle Inhalt der Quelle
2
Hallstrom, Jason Olof. „Design Pattern Contracts“. The Ohio State University, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=osu1090010266.
Der volle Inhalt der Quelle
3
Walton, James Jonathan. „Pattern-equivariant homology of finite local complexity patterns“. Thesis, University of Leicester, 2014. http://hdl.handle.net/2381/28923.
Der volle Inhalt der QuelleAnnotation:
This thesis establishes a generalised setting with which to unify the study of finite local complexity (FLC) patterns. The abstract notion of a pattern is introduced, which may be seen as an analogue of the space group of isometries preserving a tiling but where, instead, one considers partial isometries preserving portions of it. These inverse semigroups of partial transformations are the suitable analogue of the space group for patterns with FLC but few global symmetries. In a similar vein we introduce the notion of a collage, a system of equivalence relations on the ambient space of a pattern, which we show is capable of generalising many constructions applicable to the study of FLC tilings and Delone sets, such as the expression of the tiling space as an inverse limit of approximants. An invariant is constructed for our abstract patterns, the so called patternequivariant (PE) homology. These homology groups are defined using infinite singular chains on the ambient space of the pattern, although we show that one may define cellular versions which are isomorphic under suitable conditions. For FLC tilings these cellular PE chains are analogous to the PE cellular cochains [47]. The PE homology and cohomology groups are shown to be related through Poincare duality. An efficient and highly geometric method for the computation of the PE homology groups for hierarchical tilings is presented. The rotationally invariant PE homology groups are shown not to be a topological invariant for the associated tiling space and seem to retain extra information about global symmetries of tilings in the tiling space. We show how the PE homology groups may be incorporated into a spectral sequence converging to the Cech cohomology of the rigid hull of a tiling. These methods allow for a simple computation of the Cech cohomology of the rigid hull of the Penrose tilings.
4
Kristensen, Johnstone Tonje. „Surface patterns, spatiality and pattern relations in textile design“. Licentiate thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-12987.
Der volle Inhalt der QuelleAnnotation:
This licentiate thesis focuses on surface patterns, spatiality, and pattern relations in textile design, and aims to explore surface patterns as spatial definers and what they mean in the context of surface patterns. A secondary focus relates to applying conceptual spatial determinations as alternative design variables in design processes, and exploring how these could be used to define and analyse pattern relations. Through a series of exploratory design experiments that used printed and projected surface patterns in a three-dimensional setting, which were documented using photographs and film, the notion of pattern relations, wherein scale was used as a design variable, was explored. The outcome of the experiments showed the expressional possibilities that surface patterns may provide in a defined space, and how these are connected to pattern relations. In order to encourage an accompanying discussion regarding alternative methods of analysing surface patterns, the construction of a theoretical model was initiated. Workshops with design students were used as another practical method in this work. The results showed that there is great potential in using conceptual spatial determinations to define pattern relations by viewing surface patterns as spatial definers, rather than taking a traditional perspective on their functions. Another outcome is the theoretical model, which proposes a specific approach to pattern relations. This research demonstrates how conceptual spatial determinations can benefit the textile design process, as well as design teaching, which could in turn provide the field with new expressions that may lead to a change in or fruitful addition to the practice.
5
Charalampidis, Orestis Kosmas. „Patterns in the city : A tool for pattern correlation“. Thesis, KTH, Urbana och regionala studier, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279944.
Der volle Inhalt der QuelleAnnotation:
Beboeliga städer är i frontlinjen i arkitekters och stadsdesigners arbete och beboeliga gator är en stor och viktig del av var stadslivet sker. Studerandet av befintliga gator och livet på dem, en del av urban morfologins forskningsområde, skulle kunna få fram aspekter som kommer att utveckla designprocessen. Den här avhandlingen föreslår en metod som syftar till att bidra till en bättre förståelse av hur vi upplever gatumiljöer. Det är ett försök att analysera och kvantifiera rytmer som uppstår genom vår dagliga livsupplevelse längs gatorna. Mönstren i elementen i vår byggda miljö bidrar till skapandet av sådana urbana rytmer. Metoden består av en kartläggningsprocess för datainsamling och en matematisk modell som analyserar data och ger kvantitativa resultat vilka används som jämförande index för korrelation av mönster längs fasaderna på utvalda gator. Metoden testas på ett urval av tre gator i Stockholms stad. Resultaten av testet anses vara tillfredsställande för att tekniken kan anses vara funktionell. Testet begränsar sig dock till fysiska, synliga element. Därför skulle metodens bidrag vara mer värdefullt i ett bredare sammanhang samt i kombination med metoder och data av en mer inkluderande studie - vilket kommer att ge en större helhetsanalys. Huvudhinder för metodens implementering är dels bristen på information om samband mellan befintliga mönster och urbana spatiala kvaliteter och även de ineffektiva tillvägagångssätten att kartlägga mönster i stor skala. Tekniska framsteg och ytterligare forskning kan emellertid skapa en god grund för vidare utveckling.Livable cities are in the frontline of the work of architects and urban designers and livable streets occupy a large and important part of where city life happens. The study of existing streets and the life on them, a part of urban morphology's field of research, could bring light to aspects that will evolve the design process. This thesis suggests a method that aims to contribute to a better understanding of how we experience street environments. It is an effort to analyze and quantify the rhythms that occur through our every day life experience along the streetscapes. The patterns of our built environment's elements contribute to the creation of such urban rhythms. The method is comprised by a mapping process for data collection and a mathematical model which analyzes the data and provides with quantitative results that are used as comparative indexes for the correlation of patterns along the facades of selected paths. The method is tested on a sample of three paths in the city of Stockholm. The results of the test are considered satisfying for the technique to be considered functional. The test, though, limits itself to physical, perceptible objects. Therefore, the method's contribution would be more valuable inside a broader context and in combination with methods and data of a more inclusive study, which will provide a more holistic analysis. Main obstacles for the method's implementation are the lack of information about connection of existing patterns to urban space qualities and the inefficient ways of mapping patterns in a large scale. However, technological advancements and further research might create a fertile ground for development.
6
Hakeem, Hossam Hassan. „A compositional framework for determining pattern applicability“. Thesis, De Montfort University, 2010. http://hdl.handle.net/2086/4401.
Der volle Inhalt der QuelleAnnotation:
The notion of ‘pattern’ originates in the work of Christopher Alexander and, in recent years, patterns have become a popular part of software development. A pattern is defined as a ‘three-part rule’: a relationship between a given context, a recurring system of forces peculiar to that context, and a specific spatial configuration that permits resolution of these forces. In essence, the ‘context’ of a pattern is the whole system under construction and its state in the construction process at the point at which the pattern is being applied. The nature of the context, therefore, changes at every step of the process and this has significant implications for how patterns should be used. Specifically, applying each pattern changes the context by changing the state of the system under construction and creates both a new design problem and a new context for the next pattern to be applied. The next picked pattern must have a certain criteria in order for it to be applied successfully and this is will be determined by the characteristics of the new context just created. The issue of composing pattern sequences is therefore more temporal than it is static and structural (as provided currently via pattern maps). The decision as to which one to use is temporally constrained in the sense that the choice is made only at a particular point in the construction process of some specific system, and may well be determined, or at least further constrained, by the current state of that system. The fundamental research question that is addressed here is: how is this dynamically changing context to be presented to guide pattern applications? In this thesis, a framework is presented to provide a systematic analysis of composition of pattern applications in terms of the properties of their context. Such an approach will reveal the ordering of patterns in space and time dimensions. Examples of composition of pattern applications include: - One pattern contains or generalises another smaller-scale pattern (this will be called in thesis refinement); - Two patterns are complementary, i.e., one pattern needs the other to be applied before (Sequential Order); - Two patterns solve different problems that overlap and coexist on the same level (Parallel Order); - Two patterns solve the same problem in alternative, but equally valid ways (Choice in Order). At the design phase, the framework provides mechanisms for analysing the choice of composition to ensure the correctness of a design or to compare between two different designs or to modify an existing design. This framework describes a pattern's context via a pair of constraints, known as Assumption and Commitment. In general, the Assumption is a constraint placed on the context and the Commitment is what the solution provided by the pattern commits to after the pattern's application. In addition, the thesis provides a set of composition rules that can be applied to aid in the analysis of the application of pattern sequences. The approach is domain independent as it does not depend on the nature of the catalogue from which the patterns originate. The work has been evaluated using various existing patterns from Ian Graham’s web usability (WU) pattern bank and the User Interface (UI) patterns of Welie.
7
Bruinink, C. M. „Pattern strategies in nanofabrication from periodic patterns to functional nanostructures /“. Enschede : University of Twente [Host], 2009. http://doc.utwente.nl/60764.
Der volle Inhalt der Quelle
8
Blais, Pascal. „Pattern compression“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ38737.pdf.
Der volle Inhalt der Quelle
9
Mputa, Thozama. „Pattern Place“. Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/28142.
Der volle Inhalt der QuelleAnnotation:
Cape Town's solitary fired power station was commissioned in 1961 and opened in 1962 and demolished on the 22 February 2010. A landmark to the city that was not protected under the Heritage Act as it was 48 years old. The power station is the last coalfired power station still standing in Cape Town. The site is well located between movement routes and local communities, large buildings and structures are present on site. The site offers an exciting redevelopment opportunity that can result in a variety of land uses for local and visitors, residential commercial, retail and community facilities. Although site is well located within movement routes these are boundaries, which are barriers between three distinct yet historical neighbourhoods Athlone, Pinelands and Lange. The design will use pattern from site to break down the barriers, promote connectivity through access and movement routes and create place for economic activity, recreational activity and housing.
10
Jones, Mary Elizabeth Song Il-Yeol. „Dimensional modeling : identifying patterns, classifying patterns, and evaluating pattern impact on the design process /“. Philadelphia, Pa. : Drexel University, 2006. http://dspace.library.drexel.edu/handle/1860/743.
Der volle Inhalt der Quelle
11
Wu, Sheng-Tang. „Knowledge discovery using pattern taxonomy model in text mining“. Queensland University of Technology, 2007. http://eprints.qut.edu.au/16675/.
Der volle Inhalt der QuelleAnnotation:
In the last decade, many data mining techniques have been proposed for fulfilling various knowledge discovery tasks in order to achieve the goal of retrieving useful information for users. Various types of patterns can then be generated using these techniques, such as sequential patterns, frequent itemsets, and closed and maximum patterns. However, how to effectively exploit the discovered patterns is still an open research issue, especially in the domain of text mining. Most of the text mining methods adopt the keyword-based approach to construct text representations which consist of single words or single terms, whereas other methods have tried to use phrases instead of keywords, based on the hypothesis that the information carried by a phrase is considered more than that by a single term. Nevertheless, these phrase-based methods did not yield significant improvements due to the fact that the patterns with high frequency (normally the shorter patterns) usually have a high value on exhaustivity but a low value on specificity, and thus the specific patterns encounter the low frequency problem. This thesis presents the research on the concept of developing an effective Pattern Taxonomy Model (PTM) to overcome the aforementioned problem by deploying discovered patterns into a hypothesis space. PTM is a pattern-based method which adopts the technique of sequential pattern mining and uses closed patterns as features in the representative. A PTM-based information filtering system is implemented and evaluated by a series of experiments on the latest version of the Reuters dataset, RCV1. The pattern evolution schemes are also proposed in this thesis with the attempt of utilising information from negative training examples to update the discovered knowledge. The results show that the PTM outperforms not only all up-to-date data mining-based methods, but also the traditional Rocchio and the state-of-the-art BM25 and Support Vector Machines (SVM) approaches.
12
Zhu, Jia Jun. „A language for financial chart patterns and template-based pattern classification“. Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950603.
Der volle Inhalt der Quelle
13
Wu, Sheng-Tang. „Knowledge discovery using pattern taxonomy model in text mining“. Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/16675/1/Sheng-Tang_Wu_Thesis.pdf.
Der volle Inhalt der QuelleAnnotation:
In the last decade, many data mining techniques have been proposed for fulfilling various knowledge discovery tasks in order to achieve the goal of retrieving useful information for users. Various types of patterns can then be generated using these techniques, such as sequential patterns, frequent itemsets, and closed and maximum patterns. However, how to effectively exploit the discovered patterns is still an open research issue, especially in the domain of text mining. Most of the text mining methods adopt the keyword-based approach to construct text representations which consist of single words or single terms, whereas other methods have tried to use phrases instead of keywords, based on the hypothesis that the information carried by a phrase is considered more than that by a single term. Nevertheless, these phrase-based methods did not yield significant improvements due to the fact that the patterns with high frequency (normally the shorter patterns) usually have a high value on exhaustivity but a low value on specificity, and thus the specific patterns encounter the low frequency problem.
This thesis presents the research on the concept of developing an effective Pattern Taxonomy Model (PTM) to overcome the aforementioned problem by deploying discovered patterns into a hypothesis space. PTM is a pattern-based method which adopts the technique of sequential pattern mining and uses closed patterns as features in the representative. A PTM-based information filtering system is implemented and evaluated by a series of experiments on the latest version of the Reuters dataset, RCV1. The pattern evolution schemes are also proposed in this thesis with the attempt of utilising information from negative training examples to update the discovered knowledge. The results show that the PTM outperforms not only all up-to-date data mining-based methods, but also the traditional Rocchio and the state-of-the-art BM25 and Support Vector Machines (SVM) approaches.
14
Zhou, Philip Yuanping. „Array pattern synthesis and adaptive beamforming with pattern control“. Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/13725.
Der volle Inhalt der Quelle
15
Lu, Jing. „From sequential patterns to concurrent branch patterns : a new post sequential patterns mining approach“. Thesis, University of Bedfordshire, 2006. http://hdl.handle.net/10547/556399.
Der volle Inhalt der QuelleAnnotation:
Sequential patterns mining is an important pattern discovery technique used to identify frequently observed sequential occurrence of items across ordered transactions over time. It has been intensively studied and there exists a great diversity of algorithms. However, there is a major problem associated with the conventional sequential patterns mining in that patterns derived are often large and not very easy to understand or use. In addition, more complex relations among events are often hidden behind sequences. A novel model for sequential patterns called Sequential Patterns Graph (SPG) is proposed. The construction algorithm of SPG is presented with experimental results to substantiate the concept. The thesis then sets out to define some new structural patterns such as concurrent branch patterns, exclusive patterns and iterative patterns which are generally hidden behind sequential patterns. Finally, an integrative framework, named Post Sequential Patterns Mining (PSPM), which is based on sequential patterns mining, is also proposed for the discovery and visualisation of structural patterns. This thesis is intended to prove that discrete sequential patterns derived from traditional sequential patterns mining can be modelled graphically using SPG. It is concluded from experiments and theoretical studies that SPG is not only a minimal representation of sequential patterns mining, but it also represents the interrelation among patterns and establishes further the foundation for mining structural knowledge (i.e. concurrent branch patterns, exclusive patterns and iterative patterns). from experiments conducted on both synthetic and real datasets, it is shown that Concurrent Branch Patterns (CBP) mining is an effective and efficient mining algorithm suitable for concurrent branch patterns.
16
Robinson, Daniel D. „Applications of pattern recognition and pattern analysis to molecule design“. Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343465.
Der volle Inhalt der Quelle
17
Bendiuga, Volodymyr. „Multi-Core Pattern“. Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-16484.
Der volle Inhalt der Quelle
18
Yao, Xiaoqiang. „Pattern-recognition scheduling“. Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1177698616.
Der volle Inhalt der Quelle
19
Petheram, R. J. „Automatic pattern recognition“. Thesis, University of Nottingham, 1989. http://eprints.nottingham.ac.uk/28974/.
Der volle Inhalt der QuelleAnnotation:
In this thesis the author presents a new method for the location, extraction and normalisation of discrete objects found in digital images. The extraction is by means of sub-pixcel contour following around the object. The normalisation obtains and removes the information concerning size, orientation and location of the object within an image. Analyses of the results are carried out to determine the confidence in recognition of patterns, and methods of cross correlation of object descriptions using Fourier transforms are demonstrated.
20
Choakjarernwanit, Naruetep. „Statistical pattern recognition“. Thesis, University of Surrey, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306586.
Der volle Inhalt der Quelle
21
Neou, Both Emerite. „Permutation pattern matching“. Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1239/document.
Der volle Inhalt der QuelleAnnotation:
Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En particulier, le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 2413 et 3142 (appelé permutation séparable) et le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 213 et 231 sont considérés. Des problèmes dérivés de la recherche de motif et le problème de la recherche de motif bivinculaire sont aussi étudiésThis thesis focuses on permutation pattern matching problem, which askswhether a pattern occurs in a text where both the pattern and text are permutations.In other words, we seek to determine whether there exist elements ofthe text such that they are sorted and appear in the same order as the elementsof the pattern. The problem is NP-complete. This thesis examines particularcases of the problem that are polynomial-time solvable.For this purpose, we study the problem by giving constraints on the permutationstext and/or pattern. In particular, the cases in which the text and/orpattern are permutations in which the patterns 2413 and 3142 do not occur(also known as separable permutations) and in which the text and/or patternare permutations in which the patterns 213 and 231 do not occur (also known aswedge permutations) are also considered. Some problems related to the patternmatching and the permutation pattern matching with bivincular pattern arealso studied
22
Placide, Eustache. „Hybrid pattern recognition“. DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1987. http://digitalcommons.auctr.edu/dissertations/3018.
Der volle Inhalt der QuelleAnnotation:
There are two basic approaches to pattern recognition: decision-theoretic and syntactic. However, in actual applications, a combination of both may be needed. One such hybrid technique consists of syntactic method coupled with stochasticity in its grammar. Randomness in the syntactic case is caused due to noise and insufficient information about characteristics of pattern classes. To absorb the effect of this randomness, the grammar must be generalized to include the probabilities of production rules.
In this paper, a preliminary discussion of issues involved with hybrid techniques, in general, and stochastic grammars, in particular, is provided. An efficient algorithm for an automatic learning of production probabilities is devised. Concepts are illustrated via examples.
23
Patel, Arushi Mukesh. „Modular Pattern Installation“. Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/83566.
Der volle Inhalt der QuelleAnnotation:
Traditional Indian screens utilize beautiful intricate patterns derived from nature to attain
spatial definition. Even though we utilize them as static objects with rigid boundaries, the
beauty of a screen provokes wonder as to what's on the other side. This sparked a question
of What if the screen itself was modular? This question became the basis of my thesis
exploration. The work is divided into two distinct studies. The first being the exploration of
making rigid materials flexible via pattern developed from basic geometry. The second being
the application of the first process on a 1:1 scale resulting in an interactive instillation. The final
installation demonstrates modularity of pattern in creating a rigid material flexible by defining
an urban landscape on Virginia Techs campus.Master of Architecture
24
Barascud, Nicolas. „Auditory pattern detection“. Thesis, University College London (University of London), 2014. http://discovery.ucl.ac.uk/1458387/.
Der volle Inhalt der QuelleAnnotation:
The work presented in this doctoral thesis uses behavioural methods and neuroimaging to investigate how human listeners detect patterns and statistical regularities in complex sound sequences. Temporal pattern analysis is essential to sensory processing, especially listening, since most auditory signals only have meaning as sequences over time. Previous evidence suggests that the brain is sensitive to the statistics of sensory stimulation. However, the process through which this sensitivity arises is largely unknown. This dissertation is organised as follows: Chapter 1 reviews fundamental principles of auditory scene analysis and existing models of regularity processing to constrain the scientific questions being addressed. Chapter 2 introduces the two neuroimaging techniques used in this work, magnetoencephalography (MEG) and functional Magnetic Resonance Imaging (fMRI). Chapters 3-6 are experimental sections. In Chapter 3, a novel stimulus is presented that allows probing listeners’ sensitivity to the emergence and disappearance of complex acoustic patterns. Pattern detection performance is evaluated behaviourally, and systematically compared with the predictions of an ideal observer model. Chapters 4 and 5 describe the brain responses measured during processing of those complex regularities using MEG and fMRI, respectively. Chapter 6 presents an extension of the main behavioural task to the visual domain, which allows pattern detection to be compared in audition and vision. Chapter 7 concludes with a general discussion of the experimental results and provides directions for future research. Overall, the results are consistent with predictive coding accounts of perceptual inference and provide novel neurophysiological evidence for the brain's exquisite sensitivity to stimulus context and its capacity to encode high-order structure in sensory signals.
25
Brown, Roberto A. „Shadow Pattern Simulator“. DigitalCommons@USU, 1988. https://digitalcommons.usu.edu/etd/5080.
Der volle Inhalt der QuelleAnnotation:
This paper describes an interactive computer program that can be used as a design tool in assessing the shading effects of trees in relation to buildings. The program determines the area and position of the shadow cast by a tree or group of trees on a surface of a building which can have any orientation. The program outputs numerical and · graphical hourly results at any time of the day, for any day of the year, at any location on the earth, for any relative positioning between the tree and building, and estimates percent irradiation reductions on building surfaces resulting from tree shade. The program allows three different shapes of tree (elliptical, cylindrical, and parabolic) to be used. This program is being interfaced with a commercially available building energy analysis program.
26
Broms, Engblom Jacob. „Pattern Extraction : Scenarios“. Thesis, Kungl. Konsthögskolan, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kkh:diva-505.
Der volle Inhalt der QuelleAnnotation:
"Pattern Extraction - Scenarios" is a documentation of experiences inside of the collective subconscious that is the internet and an attempt at understanding and highlighting mechanisms and effects of algorithmic governance and cultural automation.
27
Ruzza, Daniel <1993>. „Business model pattern“. Master's Degree Thesis, Università Ca' Foscari Venezia, 2018. http://hdl.handle.net/10579/13174.
Der volle Inhalt der QuelleAnnotation:
Temi strategici
Fase 1
1. Fare ricerca per parole chiave su questi tre journal pratictioner su BUSINESS SOURCE COMPLETE
a. Harvard Business Review
b. MIT Sloan Management Review
c. California Management Review
Fase 2
1. Analisi su SCOPUS con parola chiave "business model pattern" e incrocio dei risultati (articoli) con quelli del paper Business Model Pattern Database
a. Obiettivo: aggiornamento references del paper fondamentale (Business Model Pattern Database)
b. Risultato: elenco paper da aggiungere all'analisi (rispetto a quelli di Business Model Pattern Database)
Fase 3
1. Incrocio paper Business Model Pattern Database con gli altri paper per redigere una lista completa di business model pattern
a. Obiettivo: creare la lista dei BM pattern
b. Risultato: File Excel con lista e indicazione dei temi strategici non inclusi
Fase 4
1. Ricerca su SCOPUS dei principali paper per ciascun pattern. Ad esempio "Freemium" AND "Business model" o "Strategy" e vedere quanti/quali paper
Fase 5
1. Codifica per ogni Tema strategico sulla base della struttura di codifica creata.
28
Sudhir, Arun. „Tree Component Alternatives to the Composite Design Pattern“. Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/36206.
Der volle Inhalt der QuelleAnnotation:
The Composite design pattern is commonly employed in object-oriented languages to design a system of objects that form a part-whole hierarchical structure with composite objects formed out of primitive objects. The client does not differentiate between a composite object and a primitive object. The composite hierarchy effectively forms a tree-like hierarchical grouping of objects. From a software engineering perspective, there are at least two problems with the Composite pattern. First, it does not maintain a separation of concerns between the structure of the objects in a system and the objects themselves. The objects that comprise the system contain information about their relationship to other objects. This limits the ability of programmers to reuse the systemâ s structural information. Secondly, there is no mechanism for encapsulating the system as a whole. This makes it difficult to specify and reason about global system properties. This thesis presents two tree components that can be used as alternatives to the Composite design pattern in systems that are traditionally implemented with the pattern. Both components are data structures that can contain arbitrary objects and maintain the structure of those objects as an ordered-tree. Since the components encapsulate only the tree structure, they only need to be specified and verified once, and they are available for black-box reuse. The first component is a traversable tree that maintains a conceptual â cursorâ position. Methods are provided for inserting and removing objects at the cursor position, and for moving the cursor throughout the tree. The second component extends the traversable tree. A formal specification for each tree component is presented in the Tako language â a Java-like language with alias avoidance that is designed to facilitate specification and verification. A case study is presented that shows how the indexed tree can be used and reasoned about in an application â a text-based adventure game. Finally, a similar application is developed in Java, once using the composite pattern and once using the indexed tree data structure, and object-oriented metrics are given for both systems.Master of Science
29
Brooks, Matthew Bryan. „Multistability in bursting patterns in a model of a multifunctional central pattern generator“. Atlanta, Ga. : Georgia State University, 2009. http://digitalarchive.gsu.edu/math_theses/73/.
Der volle Inhalt der QuelleAnnotation:
Thesis (M.S.)--Georgia State University, 2009.Title from title page (Digital Archive@GSU, viewed July 20, 2010) Andrey Shilnikov, Robert Clewley, Gennady Cymbalyuk, committee co-chairs; Igor Belykh, Vladimir Bondarenko, Mukesh Dhamala, Michael Stewart, committee members. Includes bibliographical references (p. 65-67).
30
Leatherwood, Daniel Aaron. „Plane wave, pattern subtraction, range compensation for spherical surface antenna pattern measurements“. Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/14683.
Der volle Inhalt der Quelle
31
Algarni, Abdulmohsen. „Relevance feature discovery for text analysis“. Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/48230/1/Abdulmohsen_Algarni_Thesis.pdf.
Der volle Inhalt der QuelleAnnotation:
It is a big challenge to guarantee the quality of discovered relevance features in text documents for describing user preferences because of the large number of terms, patterns, and noise. Most existing popular text mining and classification methods have adopted term-based approaches. However, they have all suffered from the problems of polysemy and synonymy. Over the years, people have often held the hypothesis that pattern-based methods should perform better than term- based ones in describing user preferences, but many experiments do not support this hypothesis. This research presents a promising method, Relevance Feature Discovery (RFD), for solving this challenging issue. It discovers both positive and negative patterns in text documents as high-level features in order to accurately weight low-level features (terms) based on their specificity and their distributions in the high-level features. The thesis also introduces an adaptive model (called ARFD) to enhance the exibility of using RFD in adaptive environment. ARFD automatically updates the system's knowledge based on a sliding window over new incoming feedback documents. It can efficiently decide which incoming documents can bring in new knowledge into the system. Substantial experiments using the proposed models on Reuters Corpus Volume 1 and TREC topics show that the proposed models significantly outperform both the state-of-the-art term-based methods underpinned by Okapi BM25, Rocchio or Support Vector Machine and other pattern-based methods.
32
YOUSSIF, ROSHDY S. „HYBRID INTELLIGENT SYSTEMS FOR PATTERN RECOGNITION AND SIGNAL PROCESSING“. University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1085714219.
Der volle Inhalt der Quelle
33
Smeraldi, Fabrizio. „Attention-driven pattern recognition /“. [S.l.] : [s.n.], 2000. http://library.epfl.ch/theses/?nr=2153.
Der volle Inhalt der Quelle
34
Angstenberger, Larisa. „Dynamic fuzzy pattern recognition“. [S.l.] : [s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=962701106.
Der volle Inhalt der Quelle
35
Chang, Charles Chung 1962. „Partial discharge pattern analysis“. Monash University, Dept. of Electrical and Computer Systems Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8400.
Der volle Inhalt der Quelle
36
Tuckey, Charles E. „Pattern matching in charity“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq24702.pdf.
Der volle Inhalt der Quelle
37
Jagannath, Sandhya. „Utility Guided Pattern Mining“. NCSU, 2003. http://www.lib.ncsu.edu/theses/available/etd-11262003-131929/.
Der volle Inhalt der QuelleAnnotation:
This work is an initial exploration of the use of the decision-theoretic concept of utility to guide pattern mining. We present the use of utility functions as against thresholds and constraints as the mechanism to express user preferences and formulate several pattern mining problems that use utility functions. Utility guided pattern mining provides the twin benefits of capturing user preferences precisely using utility functions and of expressing user focus by choosing an appropriate utility guided pattern mining problem. It addresses the drawbacks of threshold guided pattern mining, the specification of threshold and the assumption of a fixed level of interest. We examine the problem of mining patterns with the best utility values in detail. We examine monotonicity properties of utility functions and the composition of utility functions from sub-utility functions as mechanisms to prune the search space. We also present a top-down approach for generating projected databases from FP-Trees, which is an order of magnitude faster than methods proposed in the literature.
38
Cecchetto, Benjamin Thomas. „Nonlinear blood pattern reconstruction“. Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/29394.
Der volle Inhalt der QuelleAnnotation:
We present a method of reconstructing the area of origin for blood droplets given the position and directions of impact stains. This method works for
nonlinear trajectories, such as parabolic motion or motion with drag. A model for fitting ellipses to the stains, obtaining impact velocities, blood drop mass and drag coefficient from blood splatter image densities, impact angle and pattern is also provided. We also show how to use this extra data to aid with our estimation. We validate our method in several experiments involving blood splatters at varying velocities and angles.
39
Gold, Ian. „Picture, process, and pattern :“. Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66148.
Der volle Inhalt der Quelle
40
Taylor, Moira Ann. „Meal pattern and obesity“. Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.309303.
Der volle Inhalt der Quelle
41
Parrott, J. A. „Pattern formation in soils“. Thesis, University of Bristol, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.520596.
Der volle Inhalt der Quelle
42
Weir, D. K. „Pattern recognition of electrocardiograms“. Thesis, University of Ulster, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355922.
Der volle Inhalt der Quelle
43
Atcha, Hashim. „Optoelectronic speckle pattern interferometry“. Thesis, Cranfield University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282405.
Der volle Inhalt der Quelle
44
Sumner, Robert Walker 1975. „Pattern formation in lichen“. Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86757.
Der volle Inhalt der QuelleAnnotation:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.Includes bibliographical references (p. 73-76).
by Robert Walker Sumner.
S.M.
45
Malitsky, Nikolay. „Mutable Class Design Pattern“. NSUWorks, 2016. http://nsuworks.nova.edu/gscis_etd/956.
Der volle Inhalt der QuelleAnnotation:
The dissertation proposes, presents and analyzes a new design pattern, the Mutable Class pattern, to support the processing of large-scale heterogeneous data models with multiple families of algorithms. Handling data-algorithm associations represents an important topic across a variety of application domains. As a result, it has been addressed by multiple approaches, including the Visitor pattern and the aspect-oriented programming (AOP) paradigm. Existing solutions, however, bring additional constraints and issues. For example, the Visitor pattern freezes the class hierarchies of application models and the AOP-based projects, such as Spring AOP, introduce significant overhead for processing large-scale models with fine-grain objects. The Mutable Class pattern addresses the limitations of these solutions by providing an alternative approach designed after the Class model of the UML specification. Technically, it extends a data model class with a class mutator supporting the interchangeability of operations.
Design patterns represent reusable solutions to recurring problems. According to the design pattern methodology, the definition of these solutions encompasses multiple topics, such as the problem and applicability, structure, collaborations among participants, consequences, implementation aspects, and relation with other patterns. The dissertation provides a formal description of the Mutable Class pattern for processing heterogeneous tree-based models and elaborates on it with a comprehensive analysis in the context of several applications and alternative solutions. Particularly, the commonality of the problem and reusability of this approach is demonstrated and evaluated within two application domains: computational accelerator physics and compiler construction. Furthermore, as a core part of the Unified Accelerator Library (UAL) framework, the scalability boundary of the pattern has been challenged and explored with different categories of application architectures and computational infrastructures including distributed three-tier systems.
The Mutable Class pattern targets a common problem arising from software engineering: the evolution of type systems and associated algorithms. Future research includes applying this design pattern in other contexts, such as heterogeneous information networks and large-scale processing platforms, and examining variations and alternative design patterns for solving related classes of problems.
46
Lundin, Gustav. „Pattern Matching in Encore“. Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-294513.
Der volle Inhalt der QuelleAnnotation:
Encore is a young object-oriented programming language. The standard object-oriented model which embraces encapsulation works well for many kinds of problems but not all; it does not perform well when the algorithm inherently demands many objects to be decomposed at once. To address the need for an elegant way to write programs that solve such problems we have extended Encore with a pattern matching construct capable of decomposing objects. This thesis recounts how we designed and implemented pattern matching in Encore and presents some examples of how it can be used. We found that for problems that are not well suited for fully encapsulated objects, pattern matching leads to much more concise and clean code. However, this comes at the cost of additional run-time.
47
Vilo, Jaak. „Pattern discovery from biosequences“. Helsinki : University of Helsinki, 2002. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/vilo/.
Der volle Inhalt der Quelle
48
Bowman, Christopher 1969. „Pattern formation and wavelets“. Diss., The University of Arizona, 1997. http://hdl.handle.net/10150/288741.
Der volle Inhalt der QuelleAnnotation:
This thesis is a collection of results associated with pattern formation, and consists of several novel results. A multi-scale analysis is carried out near the lasing bifurcation on equations which model the free carrier semiconductor laser. This analysis produces an amplitude equation which resembles the Swift-Hohenberg equation derived for the simpler two level laser, but with extra terms arising from the more complicated semiconductor system. New results are also presented in the analysis of phase equations for patterns, showing that defects are weak solutions of the phase diffusion equation, and that the Gaussian curvature of the phase surface condenses onto point and line defects. This latter fact allows for considerable simplification of the phase diffusion equation, and this analysis is presented as well. Finally, and most importantly, an algorithm is presented, based on the continuous wavelet transform, for the extraction of local phase and amplitude information from roll patterns. This algorithm allows a precise detection of phase grain boundaries and point defects, as well as the computation of soft modes like the mean flow. Several tests are conducted on numerically generated signals to demonstrate the applicability and precision of the algorithm. The algorithm is then applied to actual experimental convection patterns, and conclusions about the nature of the wave director field in such patterns are presented.
49
Egbert, Jessica Amber. „Pattern, Ritual and Thresholds“. BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/5683.
Der volle Inhalt der QuelleAnnotation:
The work in this show reflects my interest in the role of the ceramic vessel historically as well as its place in the dialogue of contemporary art. Traditionally thought of as an object of craft and function, the vessel has found footing also as a conceptual container of ideas and artistic expression. It teeters on the threshold between craft and art, between art and life. Because of its strong association with the domestic, I find the vessel to be a fitting form on which to paint ornamental patterns and imagery associated with my own home life and to put into question its role as a strictly functional object.
50
Shie, Bai-En, und 謝百恩. „Mining Sequential Patterns with Pattern Constraints“. Thesis, 2006. http://ndltd.ncl.edu.tw/handle/4yw437.
Der volle Inhalt der QuelleAnnotation:
碩士銘傳大學
資訊工程學系碩士班
94
Sequential pattern mining is to find sequential behaviors which most customers frequently do in a transaction database. These behaviors are called sequential patterns. There were many papers proposed algorithms for finding all sequential patterns. However, there is a new problem: users may only need some special sequential patterns, for example, the sequential patterns which include certain items or behaviors. If we let users set the items or patterns which they are interested in before mining process, we will save much execution time and the sequential patterns we found can fit the users'' need. The items or patterns which are preset by users are "pattern constraints." We propose an effective algorithm to find all sequential patterns which fit the constraint from the transaction database. In the experimental results cheaper, we use real dataset and synthetic dataset to compare our algorithm with SPIRIT(R) algorithm and Bit-String algorithm. The results show that although our algorithm used more memory than SPIRIT(R) algorithm during the mining process, our algorithm was faster than SPIRIT(R) algorithm. The results also show that our method not only used less memory space than Bit-String algorithm but also was faster than Bit-String algorithm.