Introduction: There are currently no established guidelines to determine which cases general practitioners should refer to an endodontist for root canal treatment. The American Association of Endodontists (AAE) has developed the EndoCase mobile application (ECA), which utilizes either a full or abridged rubric to assign case difficulty level and provide referral guidelines to general practitioners and dental students. Objective: The objective of this study was to determine whether the abridged criteria of the EndoCase application can help predict the incidence of procedural errors in nonsurgical root canal treatment of mandibular molars in an undergraduate dental clinic based on the difficulty level. Methods: A list of patients who received primary root canal treatment on mandibular first molars in the undergraduate dental clinic from 2015-2020 was obtained. Ninety patients qualified for inclusion. Case difficulty level was assessed using the ECA by three providers with differing levels of experience. Incidence of procedural errors was determined from post-operative radiographs by two calibrated independent observers. Results: The most common endodontic mishaps were errors during access cavity preparation followed by the presence of voids in the root filling, with an incidence of 54.4% and 45.6%, respectively. There were no significant differences regarding case difficulty level and the incidence of total procedural errors nor number of treatment visits. Of the individual error types, the presence of obturation >2mm short of the radiographic apex was weakly correlated with case difficulty level (r = 0.226, pConclusion: There is minimal correlation between the difficulty level of mandibular molars determined by the ECA and the number of treatment visits or overall incidence of procedural errors.

This Master’s thesis deals with analysis of available identification chips and the design electronic attendance book that these chips will use and store the measured information to a file on a memory card. One of the tasks is to compare different kinds of identification cards and chips, and select the most appropriate type for the implementation process. Additionally, the work described the FAT file system, which is used for data storage card.

This work relates to problematics of FAT32 file system metadata recovery from damaged flash drive or memory card and design of program capable of such recovery and comparision with existing solution for this task.

Modern disk-storage systems have to accomplish the requirements of a variety of application classes. Applications that process continuous-media data such as video and audio streams require the storage system to guarantee sustained bandwidths. Interactive applications demand the storage system to ensure bounded response times, posing timing constraints on the execution of individual disk requests. Traditional timesharing applications may require both high throughput or overall short response times. With the described applications being more and more used together in todays computing systems, the disk-storage subsystems have to efficiently combine the different requirements of this application mix. In this thesis, I develop the design of a storage system that comprehensively addresses the various challenges posed by including the support for quality-of-service guarantees in disk-storage systems. The presented storage system provides three main properties. First, the admission control includes the support for statistical guarantees to increase the share of the disk bandwidth that can be utilized by the admission control. Second, the disk-request scheduling clearly separates the enforcement of real-time guarantees from the task to establish the optimal execution order of the requests, and it provides a flexible mechanism to combine the execution of requests with different quality-of-service requirements. Finally, the file system addresses both the needs of the former two elements of the storage system and of the various file types used by the applications by providing a flexible block-allocation policy and customized client interfaces. I show the implementation of the presented designs with the DROPS Disk-Storage System and I provide a detailed evaluation based on this implementation.

The goal of this work is proposal and implementation of the revision system that can control whole development process of a project. It shows alternatives of the implementation of its parts. The main is a persistent data storage and the system architecture. The expected result is a application that is able to present basic solved problems as are project branching and distributed data storage.

Author concerns with SD memory cards and microcontroller Atmel ATmega128. He describes their architecture, features, properties and technology used in devices. He is mentioning principle of communication protocols used by SD card, through that cards can communicate with other connected devices. He analyzes the functionality of FAT file system. He describes the design and implementation of interfaces to connect the SD cards to microcontroller. He explains software solutions of this project and gives impartial view to usage and comparisons of implemented modes of communication witch card.

No description available.

The thesis consists of three parts. In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk subsystems have many megabytes of memory for various purposes such as prefetching and caching. Current disk scheduling algorithms make decisions oblivious of the underlying device cache algorithms. In this thesis, we propose a scheduler architecture that is aware of underlying device cache. We also describe how the underlying device cache parameters can be automatically deduced and incorporated into the scheduling algorithm. In this thesis, we have only considered adaptive caching algorithms as modern high end disk subsystems are by default configured to use such algorithms. We implemented a prototype for Linux anticipatory scheduler, where we observed, compared with the anticipatory scheduler, upto 3 times improvement in query execution times with Benchw benchmark and upto 10 percent improvement with Postmark benchmark. The second part deals with implementing cooperative caching for the Redhat Global File System. The Redhat Global File System (GFS) is a clustered shared disk file system. The coordination between multiple accesses is through a lock manager. On a read, a lock on the inode is acquired in shared mode and the data is read from the disk. For a write, an exclusive lock on the inode is acquired and data is written to the disk; this requires all nodes holding the lock to write their dirty buffers/pages to disk and invalidate all the related buffers/pages. A DLM (Distributed Lock Manager) is a module that implements the functions of a lock manager. GFS’s DLM has some support for range locks, although it is not being used by GFS. While it is clear that a data sourced from a memory copy is likely to have lower latency, GFS currently reads from the shared disk after acquiring a lock (just as in other designs such as IBM’s GPFS) rather than from remote memory that just recently had the correct contents. The difficulties are mainly due to the circular relationships that can result between GFS and the generic DLM architecture while integrating DLM locking framework with cooperative caching. For example, the page/buffer cache should be accessible from DLM and yet DLM’s generality has to be preserved. The symmetric nature of DLM (including the SMP concurrency model) makes it even more difficult to understand and integrate cooperative caching into it (note that GPFS has an asymmetrical design). In this thesis, we describe the design of a cooperative caching scheme in GFS. To make it more effective, we also have introduced changes to the locking protocol and DLM to handle range locks more efficiently. Experiments with micro benchmarks on our prototype implementation reveal that, reading from a remote node over gigabit Ethernet can be upto 8 times faster than reading from a enterprise class SCSI disk for random disk reads. Our contributions are an integrated design for cooperative caching and lock manager for GFS, devising a novel method to do interval searches and determining when sequential reads from a remote memory perform better than sequential reads from a disk. The third part deals with selecting a primary network partition in a clustered shared disk system, when node/network failures occur. Clustered shared disk file systems like GFS, GPFS use methods that can fail in case of multiple network partitions and also in case of a 2 node cluster. In this thesis, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speaking, a leader election algorithm is proactive if it can tolerate failure of nodes even after a leader is elected, and (stable) leader election happens periodically. This is needed in systems where a leader is required after every failure to ensure the availability of the system and there might be no explicit events such as messages in the (shared memory) system. Previous algorithms like DiskPaxos are not proactive. In our model, individual nodes can fail and reincarnate at any point in time. Each node has a counter which is incremented every period, which is same across all the nodes (modulo a maximum drift). Different nodes can be in different epochs at the same time. Our algorithm ensures that per epoch there can be at most one leader. So if the counter values of some set of nodes match, then there can be at most one leader among them. If the nodes satisfy certain timeliness constraints, then the leader for the epoch with highest counter also becomes the leader for the next epoch (stable property). Our algorithm uses shared memory proportional to the number of processes, the best possible. We also show how our protocol can be used in clustered shared disk systems to select a primary network partition. We have used the state machine approach to represent our protocol in Isabelle HOL logic system and have proved the safety property of the protocol.

Eine effektive Reinigung und die Formung des Wurzelkanals sind wesentliche Faktoren der Wurzelkanalbehandlung. In den Jahren seit Entwicklung der maschinellen Präparation der Wurzelkanäle wurden viele verschiedene Techniken und Instrumente entwickelt. Die Techniken sollten die Handhabung erleichtern und die Instrumente - durch ihr Design und Material - eine sichere und effiziente Präparation ermöglichen. Die ständige Weiter- und Neuentwicklung machen standardisierte Untersuchungsmethoden zum Vergleich der Instrumente notwendig. In dieser Arbeit wurden folgende Parameter untersucht: Veränderungen des anatomischen Kanalverlaufs durch die Präparation, insbesondere Begradigung gekrümmter Wurzelkanäle, qualitative und quantitative Veränderung der Form des Wurzelquerschnittes im apikalen, medialen und koronalen Kanalanteil, Bewertung der Reinigungsqualität an der Wurzelkanalwand in Bezug auf Smear Layer und Debris, Arbeitssicherheit, bezogen auf Art und Häufigkeit von Zwischenfällen, wie z.B. Instrumentenfrakturen, apikale Blockaden, Perforationen und Arbeitslängenverlusten, Zeitaufwand der Arbeitsschritte Der standardisierte Versuchsaufbau gewährleistete die simultane Analyse dieser Präparations-parameter. An 45 Unterkiefermolaren mit einem Krümmungswinkel zwischen 20° und 40° wurden die mesialen Wurzelkanäle mit den Single-File-Systemen RECIPROC®, Wave One™ und One Shape® aufbereitet und untersucht. Auch eine Anwendung in stark gekrümmten Wurzelkanälen führt nur zu einer geringen Wurzelkanalbegradigung. Es konnten keine signifikanten Unterschiede zwischen den Sys-temen festgestellt werden. Die mittleren Werte der Begradigung sind bei allen Systemen als gering einzustufen. Sie lagen zwischen 1.20° und 1,28°. Die Systeme RECIPROC® und Wave One™ zeigen im Vergleich zu One Shape® kleinere Werte bei der Kanalbegradigung. Die drei Systeme respektieren den originalen Kanalverlauf sehr gut. Die Konizität des One Shape®-Systems scheint bei der qualitativen Präparationsform nach-teilig zu sein. Es lässt sich ein signifikanter Unterschied im medialen Kanalbereich feststellen. Die quantitative Querschnittsanalyse zeigt Mängel im apikalen Bereich. Es wurden vermehrt unbearbeitete Anteile der Kanalwand dokumentiert. Die Systeme unterscheiden sich jedoch nicht. Die Sauberkeit der Kanalwand nach der Präparation lässt bei allen Systemen ein Defizit im apikalen Bereich erkennen. Sowohl beim Debris und auch beim Smear Layer ist die Reinigung in ca. 50% der Wurzelkanäle nicht ausreichend. Der Zeitbedarf für die reine Präparation ist deutlich reduziert. Die reinen Instrumentierungs-zeiten lagen konzentriert bei weniger als 40 sec pro Kanal. Das System One Shape® unter-scheidet sich signifikant. Mit einer Präparationszeit von 36,3 sec ist es das schnellere der drei untersuchten Systeme. Alle Systeme sind als sicher einzustufen. Die Zwischenfälle waren gering und zum größten Teil der verwendeten Methode der Studie zuzuschreiben. Die Fraktur des RECIPROC®-In-struments wurde durch den Spalt zwischen den Sägefragmenten verursacht. Die Untersuchung der drei neuen Single-File-Systeme RECIPROC®, Wave One™ und One Shape® zeigt, dass eine adäquate Präparation des Wurzelkanals mit einer Feile möglich ist. Hinsichtlich der Verschleppung von Keimen in sterile Bereiche der Pulpa und der nicht vertretbaren Kreuzkontamination mit Prionen und anderen Erregern sind die Single-File-Systeme eine ernsthafte Alternative zu Multi-Use-Systemen.

Orientador: Roberta Spolon / Banca: João Paulo Papa / Banca: Regina Helena Carlucci Santana / Resumo: O maior custo de propriedade de computadores não é o hardware ou o software, mas sim o tempo que os profissionais de informática gastam em suporte e manutenção dos ambientes computacionais. Em um conglomerado de computadores em rede, cada computador torna- se uma entidade gerenciada individualmente, o que gera contínuas solicitações de alterações de configuração, como instalação de atualizações de software, conexão e configuração de periféricos, criação de perfis de e-mail e aplicação de patches. Além disso, existe ainda o risco de furto de dados e invasão por hackers quando os computadores dos usuários não estão protegidos. Aliado a este cenário, a constante evolução dos sistemas computacionais e seu potencial de processamento, a cada dia são necessárias novas técnicas de aproveitamento destes recursos. Soluções que visam facilitar o gerenciamento de ambientes com grande massa de computadores de forma a tirar o máximo proveito do poder computacional concentrado em servidores já se tornaram necessidades reais, não só em grandes corporações, mas também em pequenas e médias empresas, além de outros tipos organizações, como por exemplo, instituições de ensino. Frente esta necessidade, focando uma ferramenta compatível neste cenário de crescimento, este trabalho apresenta um modelo de gerenciamento centralizado, nomeado WSE-OS (Wireless Sharing Environment - Operating Systems), baseado em técnicas de virtualização e acesso remoto seguro combinadas a um sistema de arquivos remotos em espaço de usuário. Esta solução elimina a necessidade da instalação e configuração de aplicativos "máquina a máquina", além de tirar maior proveito do poder computacional existente nos servidores. A principal característica deste modelo que o destaca das soluções atuais é que ele é especificamente elaborado para operar sobre redes... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: The largest cost of desktop ownership is not the hardware or software, but the time that administrators spend on support and maintenance of computing environments. In a conglomerate of computers in a network, each computer becomes an entity managed individually, which generates continuous requests for configuration changes, such as installing software updates, configuration and connection of peripherals, profiling email and applying patches. Moreover, there is the risk of data theft and hacking when users' computers are not protected. Allied to this scenario, the constant evolution of computer systems and their potential for processing, each day requires new techniques for exploitation of these resources. Solutions aimed facilitating the management of environments with large mass of computers to take maximum advantage of computing power concentrated on servers have become real needs, not only in large corporations but also small and medium enterprises, besides other types organizations, such as educational institutions. Facing this need, focusing on a tool that supported this growth scenario, this work presents a centralized management model, named WSE-OS (Wireless Sharing Environment - Operating Systems) based on virtualization techniques and secure remote access combined with a remote file system in user space. This solution eliminates the need for installing and configuring applications "machine to machine", besides take greater advantage of existing computing power on the servers . The main feature of this model that highlights the current solutions is that it is specifically designed to operate on networks with low transmission rates, such as wireless networks. The WSE-OS is able to perform the replication of operating system images in an environment with WLAN communication, which makes management more flexible and independent of physical connections, besides offer... (Complete abstract click electronic access below) / Mestre