The thesis focuses on comparison of different technological solutions for a new production hall in Gabon s.r.o. company. The thesis includes history of board production which is used in the company s production and analysis current production hall. The company produces furniture from the boards focusing on kitchens production. Part of the production relates to contracts with public institutions such as schools, kindergartens, and public offices. The company produces furniture for households as well.

L’objectif de cette thèse est d’obtenir des algorithmes sous linéaire permettant de répondre à des problèmes de décision dans les bases de données XML. Plus précisément, on s’inspire du property testing, pour décider approximativement si un arbre d’arité non bornée est valide par rapport à une DTD ; ou plus généralement si un tel arbre est reconnu par un automate d’arbre.Nous avons d’abord étudié le cas simple des mots, c’est-à-dire l’appartenance approchée d’un mot à un langage régulier défini par un automate non-déterministe. Sous la distance d’édition entres les mots, nous proposons un algorithme (ou tester) résolvant l’appartenance approchée en un temps polynomial : en la taille de l’automate aussi bien qu’en la précision (où le paramètre d’erreur). Nous avons aussi amélioré le précédent algorithme d’Alon, Krivelevich, Newman, et Szegedy, (2000) pour l’approximation de l’appartenance à un langage régulier modulo la distance de Hamming. Notre amélioration consiste à rendre cet algorithme polynomial en la taille de l’automate non-déterministe. Ensuite nous avons considéré l’appartenance approchée d’un arbre à un automate d’arbre sous la distance d’édition standard. Notre algorithme résout ce problème avec une complexité en temps exponentielle en la hauteur de l’arbre. Enfin nous avons considéré la validation approchée de DTD par rapport à la « strong edit distance » ; et nous obtenons dans ce cas un algorithme polynomial en la hauteur de l’arbre. Nous complétons nos résultats en prouvant une borne inférieure linéaire en la taille de l’arbre, pour la complexité de tout algorithme décidant l’appartenance approchée d’un arbre à une DTD, sous la strong edit distance. / Inspired by property testing, our objective is to obtain sublinear algorithms for deciding properties of XML databases approximatively. More precisely, we investigate the properties of whether an unranked tree is valid for a DTD, or more generally, whether it is recognized by a tree automaton. We start our studies by the simpler case of words and we considered the approximate membership problem for word non-deterministic automata. For this problem, we provide an efficient tester that runs in polynomial time in the size of the input automata and the error precision. We also improve the previous [Alon, Krivelevich, Newman, and Szegedy, 2000b] approximate membership tester for regular languages modulo the Hamming distance, so that it runs in polynomial time in the size of the input automata. Secondly, we study approximate membership testing for tree automata modulo the standard edit distance, and obtain a tester with run time exponential in the input tree depth. Next we consider approximate DTD validity modulo the strong edit distance. We then provide a tester that depends polynomially on the height of the tree. Finally, modulo the strong edit distance, we prove a linear lower bound on the depth of the input tree.

The rapid growth of technology in recent decades has changed the whole dimension of communications. Today people are more interested in hands-free communication. In such a situation, the use a regular loudspeaker and a high-gain microphone, in place of a telephone receiver, might seem more appropriate. This would allow more than one person to participate in a conversation at the same time such as a teleconference environment. Another advantage is that it would allow the person to have both hands free and to move freely in the room. However, the presence of a large acoustic coupling between the loudspeaker and microphone would produce a loud echo that would make conversation difficult. Furthermore, the acoustic system could become instable, which would produce a loud howling noise to occur. The solution to these problems is the elimination of the echo with an echo suppression or echo cancellation algorithm. The echo suppressor offers a simple but effective method to counter the echo problem. However, the echo suppressor possesses a main disadvantage since it supports only half-duplex communication. Half-duplex communication permits only one speaker to talk at a time. This drawback led to the invention of echo cancellers. An important aspect of echo cancellers is that full-duplex communication can be maintained, which allows both speakers to talk at the same time. This objective of this research was to produce an improved echo cancellation algorithm, which is capable of providing convincing results. The three basic components of an echo canceller are an adaptive filter, a doubletalk detector and a nonlinear processor. The adaptive filter creates a replica of the echo and subtracts it from the combination of the actual echo and the near-end signal. The doubletalk detector senses the doubletalk. Doubletalk occurs when both ends are talking, which stops the adaptive filter in order to avoid divergence. Finally, the nonlinear processor removes the residual echo from the error signal. Usually, a certain amount of speech is clipped in the final stage of nonlinear processing. In order to avoid clipping, a noise gate was used as a nonlinear processor in this research. The noise gate allowed a threshold value to be set and all signals below the threshold were removed. This action ensured that only residual echoes were removed in the final stage. To date, the real time implementation of echo an cancellation algorithm was performed by utilizing both a VLSI processor and a DSP processor. Since there has been a revolution in the field of personal computers, in recent years, this research attempted to implement the acoustic echo canceller algorithm on a natively running PC with the help of the MATLAB software.

The aim of the thesis was to develop an algorithm to generate synthetic XML documents to cover the resolution of an XPath query with test cases, with a special emphasis on the ease of configuration. We have also implemented a prototype, optimized its performance and demonstrated its properties by running it on sample data. Powered by TCPDF (www.tcpdf.org)

The purpose of this thesis is to develop a software application based on previous studies by 1997 Oak Ridge Design Studio Team that matches students' progress with major requirements in their college career. This study addresses the problems of previous studies and suggests a solution. A powerful new technique, XML, is used to model, store and process the data of major requirements and student records. This application produces an HTML file that provides detailed information of a student's academic progress towards graduation.

Garbage collectors (GCs) automate the problem of deciding when objects are no longer reachable and therefore should be reclaimed, however, there currently exists no automated process for the design of a correct garbage collector. Formal models exist that prove the correctness of individual GCs; more general models describe a wider range of GCs but do not prove their correctness or provide a concrete instantiation process. The lack of a formal model means that GCs have been designed in an ad-hoc manner, published without proof of correctness and with bugs; it also means that it is difficult to apply experience gained from one implementation to the design of another. This thesis presents Surf, an abstract model of distributed garbage collection that bridges the gap between expressibility and specificity: it can describe a wide range of GCs and contains a proof of correctness that defines a list of requirements that must be fulfilled. Surf’s design space and its requirements for correctness provide a process that may be followed to analyse an existing collector or create a new GC. Surf predicts the abstract behaviour of GCs; this thesis evaluates those predictions in light of the understood behaviour of published GCs to confirm the accuracy of the model. A distributed persistent implementation of the Train Algorithm is created as an instantiation of Surf and the model is used to analyse progress in the GC and drive the design of a partition selection policy that provides a lower bound on progress and therefore reduces the GC’s complexity to completeness. Tests with mesh data structures from finite element analysis confirm the progress predictions from Surf. Published GCs cluster mostly in one corner of the Surf design space so this thesis explores the design of a GC at an unoccupied design point: the Tram Algorithm. Analysis via Surf leads to the prediction that Trams are capable of discovering topology in the live object graph that approximately identifies the strongly connected components, permitting O(1) timeliness that is unique to the Tram Algorithm. / Thesis (Ph.D.) -- University of Adelaide, School of Computer Science, 2008

Nous proposons une méthode pour aider les administrateurs des applications XML dans la tâche de faire évoluer des schémas en préservant la cohérence de la base de données sans la modifier.<br />L'utilisateur donne au système ce qu'il souhaite comme nouveau document devant être accepté par le schéma.<br />À partir de ce document, le système construit des schémas candidats, qui d'une part préservent la validité de la base de documents et, d'autre part augmentent la classe de documents acceptée par le schéma.<br />L'approche est implantée par un algorithme appelé GREC. <br />Cet algorithme utilise l'automate d'arbre A qui accepte le langage défini par le schéma pour trouver les informations nécessaires à la modification. <br />Plus précisément, il utilise les expressions régulières des règles de transitions de A pour proposer les candidats.<br />Ainsi, les modifications sont faites sur les graphes qui représentent les automates d'états finis construits à partir des expressions régulières concernées.<br />Les expressions régulières engendrées par GREC représentent des schémas présentés à l'utilisateur afin qu'il choisisse le plus adapté à la sémantique de son application.

Flexible internetbasierte Ausbildungskonzepte werden sowohl für Hochschulen als auch für die berufliche Aus- und Weiterbildung in Unternehmen zunehmend nachgefragt. Im Gegensatz zum traditionellen Unterricht ist jedoch mit einem bis zu zehnfachen Zeitaufwand für die Entwicklung von elektronischen Lernmaterialien für Electronic Learning (E-Learning) zu rechnen. Aufgrund der kostenintensiven aufwendigen Entwicklung von multimedialen Lerninhalten zählt die Wiederverwendung zu den wichtigsten Forderungen aus Sicht der Wirtschaftsinformatik (vgl. Pawlowski &amp;amp; Adelsberger, 2001). Ziel ist die Entwicklung von Lerninhalten, die unabhängig von der Systemumgebung, dem Autorensystem und dem Kontext einsetzbar und flexibel austauschbar sind. Eine aufwandsarme Aufbereitung für verschiedene Zwecke soll ermöglicht werden. Die vorliegende Arbeit befasst sich mit der mehrfachen Verwendung von elektronischen Lerninhalten für das selbstgesteuerte individuelle Lernen aus Sicht der Wirtschaftsinformatik. Zielgruppe sind informationstechnisch und pädagogisch interessierte Leser, denen das Thema der Gestaltung von Lerninhalten als interdisziplinäre Fragestellung vorgestellt wird. Unter Einbezug von pädagogischen Erkenntnissen wird analysiert, wodurch Lerninhalte gekennzeichnet sind und wie diese informationstechnisch gestaltet werden können, um eine pädagogisch angemessene Wiederverwendung zu ermöglichen. Anhand dieser Vorgehensweise wird deutlich, dass sich der Aspekt der Wiederverwendung von Lerninhalten nur im Spannungsfeld von Informationstechnik (IT) und Pädagogik diskutieren lässt. Die detaillierte Auseinandersetzung mit pädagogischen Konzepten führt im Rahmen der Arbeit zu einem wesentlichen Erkenntnisfortschritt und einer Sensibilisierung für das Thema der Wiederverwendung. Als Ergebnis liegt ein Konzept für die Entwicklung wiederverwendbarer Lerninhalte in Form eines E-Learning-Redaktionsleitstandes vor. Dieser dient der systemunterstützten Planung, Steuerung und Qualitätskontrolle bei der Entwicklung von wiederverwendbaren Lerninhalten. Darüber hinaus erfolgt die Einordnung der Lösung sowie bestehender Ansätze in einem Reifegradmodell für die Bewertung wiederverwendbarer Lerninhalte.

Title from PDF of title page. / Document formatted into pages; contains 66 pages. / Thesis (M.S.E.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: The rapid growth of technology in recent decades has changed the whole dimension of communications. Today people are more interested in hands-free communication. In such a situation, the use a regular loudspeaker and a high-gain microphone, in place of a telephone receiver, might seem more appropriate. This would allow more than one person to participate in a conversation at the same time such as a teleconference environment. Another advantage is that it would allow the person to have both hands free and to move freely in the room. However, the presence of a large acoustic coupling between the loudspeaker and microphone would produce a loud echo that would make conversation difficult. Furthermore, the acoustic system could become instable, which would produce a loud howling noise to occur. The solution to these problems is the elimination of the echo with an echo suppression or echo cancellation algorithm. / ABSTRACT: The echo suppressor offers a simple but effective method to counter the echo problem. However, the echo suppressor possesses a main disadvantage since it supports only half-duplex communication. Half-duplex communication permits only one speaker to talk at a time. This drawback led to the invention of echo cancellers. An important aspect of echo cancellers is that full-duplex communication can be maintained, which allows both speakers to talk at the same time. This objective of this research was to produce an improved echo cancellation algorithm, which is capable of providing convincing results. The three basic components of an echo canceller are an adaptive filter, a doubletalk detector and a nonlinear processor. The adaptive filter creates a replica of the echo and subtracts it from the combination of the actual echo and the near-end signal. The doubletalk detector senses the doubletalk. / ABSTRACT: Doubletalk occurs when both ends are talking, which stops the adaptive filter in order to avoid divergence. Finally, the nonlinear processor removes the residual echo from the error signal. Usually, a certain amount of speech is clipped in the final stage of nonlinear processing. In order to avoid clipping, a noise gate was used as a nonlinear processor in this research. The noise gate allowed a threshold value to be set and all signals below the threshold were removed. This action ensured that only residual echoes were removed in the final stage. To date, the real time implementation of echo an cancellation algorithm was performed by utilizing both a VLSI processor and a DSP processor. Since there has been a revolution in the field of personal computers, in recent years, this research attempted to implement the acoustic echo canceller algorithm on a natively running PC with the help of the MATLAB software. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

Konstanz, FH, Diplomarb., 2004.