To see the other types of publications on this topic, follow the link: Checkers.
Dissertations / Theses on the topic 'Checkers'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Checkers.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Menon, Jithu. "Soar Checkers - an intelligent checkers playing agent in Soar /." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1181251081/.
Full text
2
Sharan, Smita. "Checkers game app." Kansas State University, 2016. http://hdl.handle.net/2097/32920.
Full textAbstract:
Master of ScienceDepartment of Computing and Information Sciences
Daniel Andresen
Android Phones and Tablets are driven by apps and becoming more and more popular these days. Enthusiastic game players around the world are always looking for fun and exciting games which are easily accessible from their handheld devices like smartphones, tablets etc. Checkers is one such mobile game app based on the popular game American Checkers or Draughts and is developed on Android platform. This game is turn based in which players play against each other. The player capture the pieces of opponent and progresses diagonally, trying to become the winner by capturing all the pieces of opponent or blocking the opponent so that there is no legal moves left. There are various features in the game. Instant messaging allows players to chat during the game.. Saved Games feature lets users to play the incomplete games later. Leaderboards and Scores make the game competitive as players can see their rankings and scores after the game. Tournaments and Scheduling enables players to schedule matches. Tournament is scheduled with Round Robin process wherein each player plays with all other players in turn and finally winner is declared after end of the game.
3
Chrysostomou, Marina. "Prospective memory in sub-clinical checkers." Thesis, University of Reading, 2017. http://centaur.reading.ac.uk/78063/.
Full textAbstract:
People often fail to complete their future intended behaviours (prospective memory). Prospective memory research on individuals with checking behaviours is relatively recent. Studies have revealed impaired prospective memory performance in individuals with high checking behaviours. As a result, individuals report less confidence in their memory and use more prospective memory aiding strategies compared to the general population. The aim of the experiments reported in the current thesis was to investigate prospective memory performance in a sub-clinical checking population and improve confidence and vividness in their actions. In order to achieve this, two strategies, namely implementation intentions and imagery, were used. These self¬-regulatory strategies have been repeatedly found to improve prospective memory performance in the general population. The findings of the experiments reported in this thesis revealed that prospective memory performance was not always consistent with previous findings, as in some studies high checkers performed as well as low checkers. However, this could be due to methodological differences between these and earlier studies. Nevertheless, when participants were instructed to use implementation intentions and imagery during encoding, their performance was significantly improved, with the effect being more profound in low checkers. Consistent with the literature, high checkers experienced more metacognitive deficits, particularly increased lack of cognitive confidence. It can be concluded that individuals with checking tendencies can benefit from the use of implementation intentions and imagery when forming future intentions as it was found to improve prospective memory performance and cognitive confidence. These observations are discussed in relation to previous findings and experimental limitations are reported. Further studies should aim to replicate these findings using a clinical checking population.
4
Gaynor, Robert Lee. "Computer Grammar Checkers and ESL Writers." PDXScholar, 1994. https://pdxscholar.library.pdx.edu/open_access_etds/4796.
Full textAbstract:
The use of word processors has become common in writing instruction for students of English as a second language (ESL). Recent developments in microcomputer technology have increased the number of "tools" or writing aids that are incorporated into word processing programs. Among these are computer style and grammar checkers, programs that attempt to identify and diagnose stylistic, grammatical, and mechanical problems in writing. This study examines the suitability of commercial grammar checking programs for use by ESL writers through descriptive analysis of program features and evaluation of accuracy. The programs evaluated are Grammatik 5, Microsoft Word 6.0 and Correct Grammar (both using CorrecText as an underlying system), and Right Writer 6.0. The principal issues explored in the descriptive analysis are comparative ease-of-use, the nature of diagnostic advice and tutorial information, and modification capabilities of each program. The analysis shows that grammar checking programs that are part of word processing programs (e.g., Word Perfect and Microsoft Word) are easier to use, but lack key components that permit modification of advice messages and tutorial information, or addition of new error patterns. The evaluation of accuracy examines program performance in terms of error types the programs were designed to identify in relation to errors common in ESL writing. In a test of sample sentences, the overall accuracy rate for the most successful program, Grammatik 5, was only 50%. Microsoft Word and Correct Grammar were second with 42%; Right Writer 6.0 was the weakest, with a score of 25%. Program accuracy was substantially reduced in analysis of a sample student essay. Microsoft Word and Correct Grammar performed best, but with only 21% accuracy. The score of Grammatik 5 was reduced to 17%, and that of Right Writer 6.0 to 13%. This suggests that student writing contains a larger number of errors the programs cannot identify than do the test sentences. In addition, sentences in the essay contained multiple errors, while most of the test sentences contained only one error. Low accuracy rates might be improved by rule modification features of standalone versions of programs such as Grammatik 5 and Correct Grammar.
5
Liang, Hsuan Lorraine. "Spell checkers and correctors : a unified treatment." Diss., Pretoria : [s.n.], 2009. http://upetd.up.ac.za/thesis/available/etd-06252009-163007/.
Full text
6
Chee, Chong Hin. "Totally-self-checking balance checkers and window comparators." Thesis, University of Hull, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389293.
Full text
7
Lee, Chris Y. "Full Custom VLSI Design of On-Line Stability Checkers." DigitalCommons@CalPoly, 2011. https://digitalcommons.calpoly.edu/theses/607.
Full textAbstract:
A stability checker is a clocked storage element, much like a flip-flop, which detects unstable and late signals in the pipeline of a digital system. The On-line stability checker operates concurrently with its associated circuit-under-test (CUT). This thesis describes the full custom very-large-scale integration (VLSI) design and testing process of On-Line Stability Checkers. The goals of this thesis are to construct and test Stability Checker designs, and to create a design template for future class projects in the EE 431 Computer-Aided Design (CAD) of VLSI Devices course at Cal Poly.
A method for concurrent fault testing called On-line Stability Checking was introduced by Franco and McCluskey [10] to detect reliability failures. Reliability failures initially manifest themselves as delay faults and transient glitching, which become progressively larger over time due to the wearout of conducting metal lines, eventually leading to functional faults. Stability checkers periodically detect reliability failures by monitoring CUT output signals for unstable and late input signals over a time period after the sampling clock edge.
The checkers are tested by applying variable delayed input test patterns to emulate reliability failures. Consequently, configurable delay chains were incorporated into the system to provide variable delays on the input signal lines. The system also includes external test signal ports.
Circuit and layout designs were implemented in the Electric VLSI Design tool [12] and simulated with LTSPICE [13]. Electric provides Design Rule Checking (DRC) and Layout-versus-Schematic (LVS) utilities for verification. Each module was designed in a bottom-up, hierarchical cell-based approach. Functional simulation, DRC and LVS checks were performed at every subsequent higher cell layer in the design hierarchy. The final chip layout was taped out for fabrication on November 29, 2010 and finished parts were received on July 7, 2011 after two manufacturing delays.
Finished packaged parts were successfully verified for functionality based on SPICE simulations. The stability checkers were tested for flip-flop operation, glitch detection and late signal arrival detection. Configurable delay chains were tested to determine delay resolution and uniformity. Actual delay resolution and range measurements show a 3 to 4 times difference compared to simulated values.
The Electric design template created from this project includes basic CMOS logic gates with uniform standard cell heights. The template contains a 40-pin pad ring cell along with the individual pad ring components. EE 431 students would be able to create custom chips that are compatible for fabrication via the MOSIS MEP service. In future work, the template design library can be expanded to include more logic gate variants of various inputs and drive strengths as well as more complex functional modules.
8
Netterström, Jonna, and Amanda Persson. "“Do we rely need tradisional spelling instruction when their are spell checkers?” : The correlation between spell checkers and spelling acquisition of the L2 learner." Thesis, Högskolan i Halmstad, Akademin för lärande, humaniora och samhälle, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-42332.
Full textAbstract:
This study aimed to investigate in which ways spell checkers affect L2 learners’ spelling acquisition and whether or not they are suitable for educational purposes. A systematic literature review and a survey were conducted to retrieve data. Further, a phenomenographic approach was applied throughout the study. The results of the study showed that in order forspell checkers to function as an aid for the L2 learners’ spelling acquisition, the learner needs to consciously engage in explicit learning to be able to utilize the aid. Therefore, spell checkers require learners to use individual responsibility. The results also showed that spell checkers need improvements in order to fully function in educational purposes since current spell checkers have limitations as far as detecting errors.
9
Larsson, Fredrik. "Efficient implementation of model-checkers for networks of timed automata." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-226511.
Full textAbstract:
Since real-time systems often operate in safety-critical environments it is extremely important that they function correctly. UPPAAL is a tool that can be used for validation and verification of real-time systems. The user models the system using networks of timed automata and uses a simple logic to express safety requirements that the modelled system must satisfy to guarantee its correct behaviour. UPPAAL then performs reachability analysis using constraint solving techniques to check if the model satisfies the given requirements. In addition, the tool is also able to provide the user with a sample execution that explains why a requirement is (or is not) satisfied by the model. The analysis is fully automated. This thesis describes various techniques adopted when implementing UPPAAL. Some of the techniques have improved the performance of UPPAAL significantly. We have studied the techniques with performance measurements in several case-studies. One of the main contributions is the comparison of different strategies in implementing the basic data structures and searching algorithms. The measurements can be used as hints on what parts of the model-checker that are most important to optimise. Though the techniques are studied in the context of timed automata, we believe that they are applicable to the implementation of general software tools for automated analysis.
10
Bampovits, Stefanos, and Amelie Löwe. "Do Software Code Smell Checkers Smell Themselves? : A Self Reflection." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-97558.
Full textAbstract:
Code smells are defined as poor implementation and coding practices, and as a result decrease the overall quality of a source code. A number of code smell detection tools are available to automatically detect poor implementation choices, i.e., code smells. The detection of code smells is essential in order to improve the quality of the source code. This report aims to evaluate the accuracy and quality of seven different open-source code smell detection tools, with the purpose of establishing their level of trustworthiness.To assess the trustworthiness of a tool, we utilize a controlled experiment in which several versions of each tool are scrutinized using the most recent version of the same tool. In particular, we wanted to verify to what extent the code smell detection tools that reveal code smells in other systems, contain smells themselves. We further study the evolution of code smells in the tools in terms of number, types of code smells and code smell density.
11
Despinoy, Eva, and Danielsson Sarah Narrowe. "An Analysis of the Reliability of Internet-Based Symptom Checkers." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280350.
Full textAbstract:
Symptom checkers are online tools used for suggesting diagnoses and/or giving triage advice based on symptoms inputted by a person. The purpose of this study is to investigate if some specific symptom checkers are reliable by analyzing the diagnosis results and triage advice given when inputted with specific symptoms, and by comparing the questions asked by the different checkers. This was done by testing on four general symptom checkers by inputting them with symptoms for five different illnesses, and on four symptom checkers designed specifically for the disease covid-19, which were inputted with symptoms which corresponded to different severity levels of the illness. The tools used in the study are the Jaccard Index and Cosine Similarity for comparing the questions, and an implementation of the RAKE algorithm which transformed the lists of questions to arrays of keywords. Manual categorizing was used for analyzing the triage advice and the diagnosis results. The results generated were that the symptom checker’s questions were not very similar to each other. The manual categorizing of the general symptom checker’s triage advice showed that most of the general checkers gave advice recommending the patient to use hospital services even though it might not have been necessary. In contrast to this the covid-19 triage advice avoided to recommend the use of hospital services. The diagnosis result of the general symptoms checkers did not place any of the tested illnesses below fifth place in the list of the possible diagnoses. In most cases the correct illness was placed first. In conclusion, according to this study symptom checkers can be seen as quite reliable. However further studies are needed to address the weaknesses of thes study, such as little data and imperfect question comparison results.Självtester online är tester som utifrån ett antal inmatade symptom ger förslag på diagnoser och/eller rekommendationer för vad nästa steg i att hantera sina symptom borde vara. Det kan handla om att träffa en läkare eller behandla symptomen med egenvård. Syftet med den här studien är att undersöka huruvida vissa utvalda självtester är tillförlitliga, genom att undersöka diagnosförslagen, rekommendationerna och frågorna. Studien genomfördes på fyra generella självtester där symptom för fem olika sjukdomar inmatades, och på fyra självtester online som specifikt skapats för covid-19, där symptom för fyra olika fall som hade symptom för sjukdomen i olika grader inmatades. Strängjämförelseverktygen som användes för att jämföra testernas frågor var Jaccard Index och Cosine Similarity. Frågorna hade först transformerats till listor av nyckelord med RAKE-algoritmen. Diagnosförslagen och rekommendationerna jämfördes och kategoriserades manuellt. Resultatet visade att frågorna från de olika självtesterna var väldigt olika varandra. Den manuella kategoriseringen visade att de generella testerna oftast rekommenderade att uppsöka sjukvården även om det kanske inte alltid behövdes. Däremot undvek självtesterna för covid- 19 att rekommendera kontakt med sjukvården. Ingen av de generella hemsidorna satte rätt diagnos lägre än femteplats i listan på förslag på olika diagnoser. I de flesta fall var rätt diagnos på första plats. Slutligen visade resultatet från den här undersökningen att självtester online verkar vara tillförlitliga. Dock behöver fler studier göras för att hantera svagheterna i den här studien, såsom lite data och potentiellt bristfälliga resultat från frågejämförelserna
12
Harkin, Ben. "A cognitive examination of compulsive checkers' working memory and inhibitory performance." Thesis, University of Glasgow, 2012. http://theses.gla.ac.uk/3336/.
Full textAbstract:
Checking is one of the most common symptoms observed in Obsessive Compulsive Disorder (OCD) with 50-80% of patients (Antony, Downie, & Swinson, 1998; Henderson & Pollard, 1988; Rasmussen & Eisen, 1988) and an additional ~15% of the general population demonstrating subclinical checking compulsions (Stein et al., 1997). A common finding is that checking actually impairs the memory of those items checked (van den Hout & Kindt, 2003a, 2003b), even though the mechanism underlying checking-related memory impairment has remained elusive. This is a shortcoming that we presently address in a series of short-term memory experiments and attentional tasks comparing high and low checkers (see VOCI; Thordarson et al., 2004). Generally, our memory tasks required stimuli to be remembered in their locations, which was designed to engage the episodic buffer (EB) of working memory (WM) (Baddeley, 2000). The key manipulation was to present an intermediate probe (between encoding and recall) in the form of a resolvable or misleading challenge which questioned an aspect of the encoding set; this was either present or absent, respectively. As expected, misleading probes specifically (Exp. 1, 2, extreme meta-comparison 3 & 9; Harkin & Kessler, 2009; 2011a; Harkin, Rutherford, & Kessler, 2011) and intermediate probes generally (Exp. 4; Harkin & Kessler, 2011a) tap into the inhibitory impairments of high (not low) checkers, which hampers EB functionality and impairs their memory. Indeed, it was only during misleading trials that high checkers made more unnecessary eye movements specifically to empty locations (Exp. 5; Harkin & Kessler, subm). Furthermore, for ecologically valid stimuli high checkers were impaired in inhibiting attention to threatening ‘ON’ states (Tasks 6 & 7; Harkin & Kessler, in press) and in their ability to recall if an appliance was ‘ON’ or ‘OFF’ (Exp. 8; Harkin, Rutherford, & Kessler, 2011). High checkers’ intact performance on baseline no-probe-1 trials excludes a capacity-based explanation of their WM impairments. Overall, confidence measures revealed a general task-independent impairment which was attenuated by an intermediate probe. These findings were then used to create a classification system based upon Executive-Functioning, Binding Complexity and Memory Load (EBL) to explain otherwise discrepant findings from 58 memory studies (Harkin & Kessler, 2011b). Thus, the contribution of this research is not only to (Exp. 1-9) indicate an actual mechanism (i.e., episodic buffer of WM) of memory impairment in checking/OCD but it also provides a new research platform on which to base where we will and will not observe memory impairments in OCD participants. The conclusion summarizes the main findings with respect to the development and maintenance of OCD symptoms, highlights limitations and provides solutions to these through future research.
13
Bakir, Mehmet Emin. "Automatic selection of statistical model checkers for analysis of biological models." Thesis, University of Sheffield, 2017. http://etheses.whiterose.ac.uk/20216/.
Full textAbstract:
Statistical Model Checking (SMC) blends the speed of simulation with the rigorous analytical capabilities of model checking, and its success has prompted researchers to implement a number of SMC tools whose availability provides flexibility and fine-tuned control over model analysis. However, each tool has its own practical limitations, and different tools have different requirements and performance characteristics. The performance of different tools may also depend on the specific features of the input model or the type of query to be verified. Consequently, choosing the most suitable tool for verifying any given model requires a significant degree of experience, and in most cases, it is challenging to predict the right one. The aim of our research has been to simplify the model checking process for researchers in biological systems modelling by simplifying and rationalising the model selection process. This has been achieved through delivery of the various key contributions listed below. • We have developed a software component for verification of kernel P (kP) system models, using the NuSMV model checker. We integrated it into a larger software platform (www.kpworkbench.org). • We surveyed five popular SMC tools, comparing their modelling languages, external dependencies, expressibility of specification languages, and performance. To best of our knowledge, this is the first known attempt to categorise the performance of SMC tools based on the commonly used property specifications (property patterns) for model checking. • We have proposed a set of model features which can be used for predicting the fastest SMC for biological model verification, and have shown, moreover, that the proposed features both reduce computation time and increase predictive power. • We used machine learning algorithms for predicting the fastest SMC tool for verification of biological models, and have shown that this approach can successfully predict the fastest SMC tool with over 90% accuracy. • We have developed a software tool, SMC Predictor, that predicts the fastest SMC tool for a given model and property query, and have made this freely available to the wider research community (www.smcpredictor.com). Our results show that using our methodology can generate significant savings in the amount of time and resources required for model verification.
14
Chenard, Jean-Samuel. "Hardware-based temporal logic checkers for the debugging of digital integrated circuits." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106282.
Full textAbstract:
Integrated circuit complexity is ever increasing and the debug process of modern devices pose important technical challenges and cause delays in production. A comprehensive Design-for-Debug methodology is therefore rapidly becoming a necessity. This thesis presents a comprehensive system-level approach to debugging based on insilicon hardware checkers. The proposed approach leverages existing assertion-based verification libraries by translating useful temporal logic statements into efficient hardware circuits. Those checker circuits are then integrated in the device as part of the memory map, so they can provide on-line monitoring and debug assistance in addition to accelerating the integration of performance monitoring counters. The thesis presents a set of enhancements to the translation process from temporal language to hardware, targeted such that an eventual debug process is made more efficient. Automating the integration of the checker's output and control structures is covered along with a practical method that allow transparent access to the resulting registers within a modern (Linux) operating system. Finally, a method of integration of the hardware checkers in future Network-on-Chip systems is proposed. The use of a quality metric encompassing test, monitoring and debug considerations is defined along with the necessary tool flow required to support theprocess.La complexité des circuits intégrés augmente sans cesse et à un tel point que le procéssus de déboggage pose de nombreux problèmes techniques et engendre des retards dans la production. Une approche d'ensemble de conception pour le déboggage (Design-for-Debug) devient donc rapidement une nécessité. Cette thèse propose une approche détaillée de niveau système, intégrant des circuits de surveillance sur puce. L'approche proposée s'appuie sur la réutilisation de déclarations écrites en language de logique temporelle afin de les transformer en circuits digitaux efficaces. Ces derniers seront intégrés à la puce à travers son interface d'image mémoire afin qu'ils puissent servir au processus de déboggage ainsi qu'à une utilisation dans le système lorsque la puce est intégrée dans son environement. Cette thèse présente une série d'ajout au procéssus de transformation d'instructions de logique temporelle de manière à faciliter le procéssus de déboggage. Une méthode qui automatise l'intégration des sorties et du contrôle des circuits de surveillance est présentée ainsi que la manière dont une utilisation de ces circuits peut être accomplie dans le contexte d'un système d'exploitation moderne (Linux). Finalement, une méthode globale d'intégration des circuits de vérification dans le contexte de systèmes basés sur les réseaux-sur-puce est présentée, accompagnée de la chaine d'outils requise pour supporter ce nouveau processus de conception. Cette méthode propose l'utilisation de facteurs de qualité de test, de surveillance et de déboggage (Test, Monitoring and Debug) permettant une meilleure sélection des circuits ainsi qu'une intégration plus efficace au niveau des resources matérielles.
15
Gomes, Victorino Camila. "The investigation of reward-based learning in obsessive-compulsive sub-clinical checkers." Thesis, University of Surrey, 2017. http://epubs.surrey.ac.uk/845083/.
Full textAbstract:
People with Obsessive Compulsive Disorder (OCD) have deficits in decision making under ambiguity, also known as probabilistic reward-based learning (RBL). In these tasks participants are not aware about the target probabilities of each option and need to use trial-by-trial feedback to learn these probabilities during the task in order to improve their performance. An open question from the previous literature is why OCD participants present this specific deficit. The review of the limitations of previous RBL studies with OCD patients and the use of a new task paradigm allowed us to explore new directions in this research field. Firstly, previous studies had the following limitations: sometimes they did not control for the use of medication, for the presence of common comorbidities associated with OCD, or for differences between distinct OCD subtypes. In addition, previous tasks usually manipulated several factors at the same time, such as feedback direction (positive vs. negative feedback) and feedback magnitude (e.g. less vs. more positive feedback), for instance. Therefore, it is not possible to know which factor affected the RBL performance in OCD patients. Furthermore, previous studies did not consider the effect of symptom-related feedback on RBL. Secondly, task performance was only measured with accuracy, even though RBL involves the use of previous trials to make predictions for the current decision. Finally, while it is reported that participants do use distinct previous trials to perform these tasks, sequential effects were not previously investigated in OCD patients, neither for random-sequences nor for patterns sequences. Based on this, the presented PhD thesis addressed some of these gaps in the literature. The investigation was restricted to subclinical checkers which is the most common OCD subtype. A binary decision making task was designed that allowed us to separately manipulate feedback direction and feedback magnitude. In addition, the study compared probabilistic RBL performances between checkers and non-checkers for random and pattern sequences. New analyses techniques were employed to investigate the use of previous trial information for the current decision making, e.g. win-shift, lose-shift, and cross-correlations. Studies 2 and 3 examined the effect of feedback direction (positive vs. negative feedback) on decision making in subclinical checkers. Results showed that subclinical checkers were more biased towards exploitation when using negative feedback. Studies 4 and 5 examined the effect of the feedback magnitude for both the positive and the negative feedback direction. Results showed that subclinical checkers were able to change their bias towards exploitation within the positive direction experiments depending on the feedback magnitude of the experiment. They were more biased towards exploitation in the positive task presenting a higher error magnitude. In addition, checkers were always biased towards exploitation within the negative direction experiments, irrespectively of the feedback magnitude. Study 6 examined the effect of the manipulation of feedback magnitude when a symptom related feedback was added as an increment of the negative feedback. Results showed that subclinical checkers were not affected by the presence of the symptom-related feedback and, in terms of feedback magnitude, they continued to present a bias towards exploitation. The findings show that checkers were able to adapt towards exploitation in the positive experiments when higher feedback magnitudes are given. This strategic shift might be related to the higher error magnitude associated with the absence of reward, when the incorrect option was chosen. In contrast, checkers were not able to adapt their exploitation behaviour within the negative experiments when enhancing the feedback magnitude. In this way, this indicates that subclinical checkers present a deficit that bias their responses towards exploitation, when the magnitude associated with the error in the task surpasses a certain value of negative magnitude. This bias could reflect deficits regarding negative prediction errors in OCD or a hyperactivation of brain areas related with exploitation. Both explanations could be linked with a hyperactive dopaminergic system in OCD, so these results could encourage new research about the role of dopamine and prediction errors deficits associated with OCD. Additionally, heightened emotions and reward magnitudes might reduce treatment success because of the enhanced exploitation behaviour, so one crucial aspect of future therapies might be to carefully study the employment of stimuli with such higher error magnitudes.
16
Misra, Supratik Kumar. "Efficient Graph Techniques for Partial Scan Pattern Debug and Bounded Model Checkers." Thesis, Virginia Tech, 2012. http://hdl.handle.net/10919/31153.
Full textAbstract:
Continuous advances in VLSI technology have led to more complex digital designs and shrinking transistor sizes. Due to these developments, design verification and manufacturing test have gained more importance and 70 % of the design expenditure in on validation processes. Electronic Design Automation (EDA) tools play a huge role in the validation process with various verification and test tools. Their efficiency have a high impact in saving time and money in this competitive market. Direct Acyclic Graphs (DAGs) are the backbone for most of the EDA tools. DAG is the most efficient data structure to store circuit information and also have efficient backt traversing structure which help in developing reasoning/ debugging tools.
In this thesis, we focus on two such EDA tools using graphs as their underlying structure for circuit information storage
• Scan pattern Debugger for Partial Scan Designs
• Circuit SAT Bounded Model Checkers
We developed a complete Interactive Scan Pattern Debugger Suite currently being used in the industry for next generation microprocessor design. The back end is an implication graph based sequential logic simulator which creates a Debug Implication Graph during the logic simulation of the failing patterns. An efficient node traversal mechanism across time frames, in the DIG, is used to perform the root-cause analysis for the failing scan-cells. In addition, the debugger provides visibility into the circuit internals to understand and fix the root-cause. We integrated the proposed technique into the scan ATPG flow for industrial microprocessor designs. We were able to resolve the First Silicon logical pattern failures within hours, which would have otherwise taken a few days of manual effort for root-causing the failure, understanding the root-cause and fixing it.
For our circuit SAT implementation, we replace the internal implication graph used by the SAT solver with our debug implication graph (DIG). There is a high amount of circuit unrolling in circuit SAT/ BMC (Bounded Model Checking) problems which creates copies of the same combinational blocks in multiple time frames. This allows us to use the repetitive circuit structure and club it with the CNF database in the SAT solver. We propose a new data structure to store data in a circuit SAT solver which results up to 90% reduction in number of nodes.Master of Science
17
Vingen, David, and Elias J. Andrews. "Usability in Patient-Oriented Drug Interaction Checkers : A Scandinavian Sampling and Heuristic Evaluation." Thesis, Linnéuniversitetet, Institutionen för informatik (IK), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-96600.
Full textAbstract:
Drug interactions are an important source of medical error. Studies have also shown it as a topic of particular interest to patients. To allow patients to participate in decision-making regarding their own health, they need to be empowered with information. This information must be provided through usable information systems. This thesis explored availability of drug interaction checkers in Scandinavia. It also explored the prevalence and characteristics of usability issues preventing patients from benefiting from these. Drug interaction checkers were sampled and described. Issue-based qualitative and quantitative data were gathered through heuristic evaluations. Patterns in the data were identified through descriptive statistics. Single-case and cross-case analyses explored emergent patterns in-depth. The findings were then interpreted side by side using a mixed-methods approach. The results showed the Scandinavian public faced with drug interaction checkers addressing healthcare professionals. They also showed a multitude of usability issues in these checkers. The issues were predominantly minor, but major issues were also identified in all but one of the checkers. Catastrophic usability issues were found in two of the checkers. These had the potential to lead patients to serious medical error. Results moreover showed the checkers lacking adaptive design, patient-oriented content, and a lack of adherence to basic design principles. A positive correlation was observed between system complexity and number of usability issues. This was suggested to result from lack of user-centered design approaches, or losing track of user goals while adding features over time. The result was a handful of generally professionally oriented drug interaction checkers known to be used by patients for their utility, but failing to accommodate them in terms of information and system quality. Empowering patients to participate in decision-making affecting their health asserts the need for developing patient-oriented information databases where these do not yet exist. These need to be presented through usable interfaces acknowledging patient behaviors.Läkemedelsinteraktioner är en viktig orsak till medicinska misstag. Tidigare studier har även identifierat läkemedelsinteraktioner som ett område av särskilt personligt intresse för patienter. För att patienter ska kunna vara delaktiga i beslutsfattande beträffande sin egen hälsa, måste de ges tillgång till information genom användbara informationssystem. Denna uppsatsen undersökte tillgänglighet av interaktionsgranskare för läkemedel för den skandinaviska publiken. Den undersökte också förekomst och karakteristiker av användbarhetsproblem som förhindrar patienter från att dra nytta av dessa interaktionsgranskarna. Tillgängliga interaktionsgranskare listades och beskrevs. Kvalitativa och kvantitativa data samlades in genom heuristiska utvärderingar. Mönster identifierades genom beskrivande statistik, medan kvalitativa enkelfalls- och tvärfallsanalyser undersökte frambrytande mönster på djupet. Resultat från kvantitativa och kvalitativa metoder tolkades sedan sida vid sida. Resultaten visade att skandinaviska patienter huvudsakligen möter interaktionsgranskare riktade mot professionell vårdpersonal. Resultaten påvisade också en stor mängd användbarhetsproblem i dessa granskarna. Problemen var oftast av mindre vikt, men även stora problem identifierades i alla utom en av granskarna. Katastrofala användbarhetsproblem hittades i två av granskarna. Dessa hade potential att leda patienter till allvarliga medicinska misstag. Resultaten visade dessutom att granskarna saknade adaptiv design, patientorienterat innehåll och efterlevnad av grundläggande designprinciper. En positiv korrelation observerades mellan systemkomplexitet och antal användbarhetsproblem. Detta föreslogs vara ett resultat av brist på användarcentrerad designmetod eller att man har tappat fokus på användarmål över tid medan funktioner har lagts till. Resultatet var en handfull huvudsakligen professionellt inriktade granskare för läkemedelsinteraktioner som används av patienter för deras nyttja, men som inte lyckas med att ta hänsyn till dem när det gäller informations- och systemkvalitet. För att patienter ska få möjlighet att delta i beslutsfattande som påverkar deras hälsa, finns behov av att utveckla patientorienterade informationsdatabaser där dessa ännu inte finns. Dessa måste erbjudas genom användbara gränssnitt som tillgodoser patienters beteenden.
18
Aljaffan, Nouf. "Password security and usability : from password checkers to a new framework for user authentication." Thesis, University of Surrey, 2017. http://epubs.surrey.ac.uk/844980/.
Full textAbstract:
Passwords have been dominating user authentication for more than half a century, and many researchers believe that they will continue as a key part of the user authentication world in the foreseeable future. The well-known usability-security problem of textual passwords, i.e., the difficulty for human users to choose strong and easy-to-remember passwords, has received a considerable attention over many years. Many alternative solutions have been proposed to replace textual passwords, however, none of them can keep all advantages of textual passwords without bringing new problems. As a consequence, hybrid user authentication systems such as multi-factor authentication (MFA) has been widely suggested for security-critical applications such as e-banking systems. Such hybrid user authentication systems normally lead to higher usability costs, so are not ideal solutions for all applications. The hybrid nature also means organizations and service providers have to deploy and maintain different user authentication components, thus making reconfiguration of such systems more complicated. This thesis looks at several less-studies but still important areas of user authentication: how human users perceive objective ratings given by computer programs such as proactive password checkers (PPCs) and subjective ratings given by human experts, how human users can be better educated about password security, and how we can overcome the current drawbacks of hybrid user authentication systems to improve user experience and enhance reconfigurability of such systems. Our research led to some new insights on how human users perceive password strength ratings, a new password security education tool, and a novel ``all in one'' and backward compatible user authentication framework. For the first work, we conducted a user study with over 1,000 crowdsourcing workers to gather information about how they perceived their trusts on objective and subjective ratings of a number of given passwords. The results shed light on the influence of personalization and contextualization on users' perceived trusts on password ratings, implying human users' decisions on textual passwords depend on highly on their personal characteristics, individual passwords and their own subjective judgments on given passwords. We observed several typical behavioral patterns in terms of human users' perceived trust on subjective and objective ratings. These findings can help support better designs of PPCs and other password security tools. One finding of the above-mentioned user study is that many human users clearly trusted their own subjective judgments more than ratings given by others. This suggests better password educational tools are needed to help human users make better subjective judgments on password strength. We noticed PPCs have a natural side effect of educating users, but this effect has not been well studied and most designs are not optimal in terms of password security education. We therefore proposed Password Security Visualizer (PSV), an interactive visualization system specifically designed for password security education. PSV can provide many new features that do not exist in traditional PPCs, thus having a greater potential to achieve its goals of educating users. A 2-D prototype of PSV was implemented, and a number of user studies were conducted to investigate its performance as both a PPC and a password security education tool. The results showed that PSV was considered the most informative and recommended by most participants as a good educational tool. The personalization effect observed in our user studies on passwords led us to consider how we can generalize existing user authentication framework to allow personalization beyond textual passwords. This led us to discover Pass∞ , a novel ``all in one'' and backward compatible framework which can support all four authentication factors (knowledge-based, token-based, biometric-based and context-aware authentication) and many different schemes in each factor. Pass∞ enables users to freely combine diverse authentication actions while keeping compatibility with textual passwords so that a user can continue to use his/her old textual password even after Pass∞ is introduced. The diversity of different authentication actions supported by Pass∞ can help users to personalize their individual choices of passwords to reach a better trade-off between security and usability: a human user can define his/her password as a sequence of simple authentication actions that can be easily remembered, and Pass∞ will convert the simple hybrid password into a much more complicated password that a password cracker will find very difficult to guess. Being able to support many different user authentication actions in a single framework also helps make Pass∞ highly reconfigurable, e.g., different password policies can be defined for different user groups to allow different types of combinations of user authentication actions. A prototype of Pass∞ prototype was implemented which will be tested in a number of user studies we plan to conduct in near future.
19
Hill, Michella Gaye. "Appraisal of free online symptom checkers and applications for self-diagnosis and triage: An Australian evaluation." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2020. https://ro.ecu.edu.au/theses/2311.
Full textAbstract:
The internet has impacted society and changed the way companies and individuals operate on a daily basis. Seeking information online via computer or mobile device is common practice. The phrase ‘Google it’ is now part of modern vernacular and is a resource increasingly utilised by young and old alike. Around 80% of Australian’s search health-related information online as it is convenient, cheap, and available 24/7. Symptom checkers are one tool used by consumers to investigate their health issues. Symptom checkers are automated online programs which use computerised algorithms, asking a series of questions to help determine a potential diagnosis and/or provide suitable triage advice. Recent evidence suggests symptom checkers may not work the way they are intended. Inferior or incorrect healthcare information can potentially have serious consequences on the consumer’s wellbeing and may not have the desired effect of directing consumers to the appropriate point of care.
This research evaluated the clinical performance of 36 symptom checkers found on websites and smartphone applications that are freely available for use by the Australian general public. Symptom checkers were exposed to 48 clinical vignettes, generating 1858 symptom checker vignette tests (SCVT). Diagnosis was assessed on the inclusion of the correct diagnosis in the first, the top three or top ten differential diagnoses (n = 1,170 SCVT). Triage advice was assessed on whether the triage category recommended was concordant with our assessment (n = 688 SCVT).
The correct diagnosis was listed first in 36% (95% CI 31–42) of SCVT, within the top three in 52% (95% CI 47–59) and within the top ten in 58% (95% CI 53–65). Symptom checkers which claimed to utilise artificial intelligence (AI) outperformed non-AI with the first listed diagnosis being accurate in 46% (95% CI 40–57) versus 32% (95% CI 26–38) of SCVT. Individual symptom checker performance varied considerably, with the average rate of correct diagnosis provided first ranging between 12%–-61%. Triage advice provided was concordant with our assessment in 49% (95% CI 44–54) of SCVT. Appropriate triage advice was provided more frequently for emergency care SCVT at 63% (95% CI 52–71) than for non-urgent SCVT at 30% (95% CI 11–39).
Symptom checker performance varied considerably in relation to diagnosis. Triage advice was risk-averse, typically recommending more urgent care pathways than necessary. Given this, symptom checkers may not be working to alleviate demand for health services (particularly emergency services) within Australia—counter to marketing materials of some organisations’ symptom checkers. It is important that symptom checkers do not further burden the healthcare system with inappropriate referrals or incorrect care advice. Although, a balance must be struck as avoiding unsuitable triage advice could potentially result in life-threatening consequences for consumers. Nonetheless, the results of this research make clear that the accuracy of diagnosis and triage advice provided from readily available symptom checkers for the Australian public require improvements before everyday consumers can rely entirely on health information provided via these mediums.
20
Al-Khateeb, Belal. "Investigating evolutionary checkers by incorporating individual and social learning, N-tuple systems and a round robin tournament." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/12267/.
Full textAbstract:
In recent years, much research attention has been paid to evolving self-learning game players. Fogel's Blondie24 is just one demonstration of a real success in this field and it has inspired many other scientists. In this thesis, artificial neural networks are employed to evolve game playing strategies for the game of checkers by introducing a league structure into the learning phase of a system based on Blondie24. We believe that this helps eliminate some of the randomness in the evolution. The best player obtained is tested against an evolutionary checkers program based on Blondie24. The results obtained are promising. In addition, we introduce an individual and social learning mechanism into the learning phase of the evolutionary checkers system. The best player obtained is tested against an implementation of an evolutionary checkers program, and also against a player, which utilises a round robin tournament. The results are promising. N-tuple systems are also investigated and are used as position value functions for the game of checkers. The architecture of the n-tuple is utilises temporal difference learning. The best player obtained is compared with an implementation of evolutionary checkers program based on Blondie24, and also against a Blondie24 inspired player, which utilises a round robin tournament. The results are promising. We also address the question of whether piece difference and the look-ahead depth are important factors in the Blondie24 architecture. Our experiments show that piece difference and the look-ahead depth have a significant effect on learning abilities.
21
Bergqvist, Andreas. "Aesthetic Details and Player Behavior : a study on how the colors of checkers in backgammon affect players’ choices of action." Thesis, Högskolan på Gotland, Institutionen för speldesign, teknik och lärande, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hgo:diva-1968.
Full textAbstract:
Based upon earlier studies in the fields of psychology and game design by Frank and Gilovich (1988) and Yee (2007), this paper examines the influence of color on players of backgammon. The paper examines the probability of a player hitting an opponent’s piece when possible in backgammon depending on the color of the checkers. The data sample was compared using a t-test but showed no significant correlation. Based upon the results it was concluded that the Proteus Effect is not as effectively achieved through units in board games compared to avatars in virtual worlds.
22
Duminy, Willem Harklaas. "A learning framework for zero-knowledge game playing agents." Diss., University of Pretoria, 2007. http://hdl.handle.net/2263/28767.
Full textAbstract:
The subjects of perfect information games, machine learning and computational intelligence combine in an experiment that investigates a method to build the skill of a game-playing agent from zero game knowledge. The skill of a playing agent is determined by two aspects, the first is the quantity and quality of the knowledge it uses and the second aspect is its search capacity. This thesis introduces a novel representation language that combines symbols and numeric elements to capture game knowledge. Insofar search is concerned; an extension to an existing knowledge-based search method is developed. Empirical tests show an improvement over alpha-beta, especially in learning conditions where the knowledge may be weak. Current machine learning techniques as applied to game agents is reviewed. From these techniques a learning framework is established. The data-mining algorithm, ID3, and the computational intelligence technique, Particle Swarm Optimisation (PSO), form the key learning components of this framework. The classification trees produced by ID3 are subjected to new post-pruning processes specifically defined for the mentioned representation language. Different combinations of these pruning processes are tested and a dominant combination is chosen for use in the learning framework. As an extension to PSO, tournaments are introduced as a relative fitness function. A variety of alternative tournament methods are described and some experiments are conducted to evaluate these. The final design decisions are incorporated into the learning frame-work configuration, and learning experiments are conducted on Checkers and some variations of Checkers. These experiments show that learning has occurred, but also highlights the need for further development and experimentation. Some ideas in this regard conclude the thesis.Dissertation (MSc)--University of Pretoria, 2007.
Computer Science
MSc
Unrestricted
23
Fireš, Martin. "Demonstrační úloha pro robotický manipulátor EPSON." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219702.
Full textAbstract:
This work deals with design and construction of a robotics checkers player based on computer vision, a move solving algorithm Minimax and a industrial manipulator EPSON C3. Work also deals with design of robot communication protocol and C# communication library execution.
24
Bahtiyar, Muhammed Yasin. "Software Architecture Checker." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2294.
Full textAbstract:
By the increasing needs of software industry, software systems became more complex constructions than ever before. As a result of increasing complexity in software systems, functional decomposition of these systems gains the status of the most important aspect in the software development process. Dividing problems to sub-problems and producing specific solutions for divided parts makes it easier to solve the main problem.
Component Based Software Engineering is a way of developing software systems that consists of logically or functionally decomposed components which integrated to each other by the help of well-defined interfaces. CBSE relies on architectural design of a software system.
Planning phase and implementation of a software project may differ time to time. Because of the complexity of software systems, solving specific problems may affect the architecture of the whole system.
In spite of sophisticated software engineering processes and CASE tools there is still a large gap between the planned and implemented architecture of software systems. Finding deviations from architecture in source code is a non-trivial task requiring tool support.
Since, matching operation of designed software architecture and implemented software architecture needs to check design documents against implementation code. This manual checking operation is nearly impossible for major software systems. Software Architecture Checker provides a great approach to check the architecture of any software system.
This bachelor thesis examines the approach behind the Software Architecture Checker.
25
Bubeník, Martin. "RaspberryPI kamerový checker." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-402129.
Full textAbstract:
The diploma thesis deals with the industrial inspection of correctly made connectors based on computer recognition, and the detection and recognition application is implemented in Python on the Raspberry Pi platform.The work uses empirically known OpenCV library for recognition. The work also deals with the selection of suitable hardware devices, which are a camera with a lens and an illuminator, from which is created one compact device together with the Raspberry Pi microcomputer. The compact device is further mounted on the designed mechanical structure under which is created inspection zone. Finally, Raspberry Pi has a web-based user interface to check the inspection and the interface to write the data to the database.
26
GHOSH, SWAROOP. "SCAN CHAIN FAULT IDENTIFICATION USING WEIGHT-BASED CODES FOR SoC CIRCUITS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1085765670.
Full text
27
Kojovic, Ivana. "An automatic protocol composition checker." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-19105.
Full textAbstract:
Formal analysis is widely used to prove security properties of the protocols. There are tools to check protocols in isolation, but in fact we use many protocols in parallel or even vertically stacked, e.g. running an application protocol (like login) over a secure channel (like TLS) and in general it is unclear if that is safe. There are several works that give sufficient conditions for parallel and vertical composition, but there exists no program to check whether these conditions are actually met by a given suite of protocols.The aim of the master thesis project is to implement a protocol composition checker and present it as a service for registering protocols and checking compatibility of the protocols among each other. In order to establish the checker, it is necessary to collect and integrate different conditions defined through the literature. Also, we will define a framework based on Alice and Bob notation, so the checker can examine protocols in an unambiguous manner.Further we will develop a library of widely-used protocols like TLS that are provenly compatible with each other and define a set of negative example proto- cols to test the checker.We want to implement the checker as an extension of the existing Open-Source Fixed-Point Model-Checker OFMC to easily integrate our composition checker with a existing verification procedure that support Alice and Bob notation.
28
Ghribi, Brahim. "A model checker for LOTOS." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7536.
Full textAbstract:
LOTOS (Language Of Temporal Ordering Specification) is a Formal Description Technique (FDT) based on the temporal ordering of observational behaviour. It was developed by ISO (International Organization for Standardization) for the specification of OSI (Open Systems Interconnections) services and protocols. CTL (Computation Tree Logic) is a branching-time temporal logic, which can be used to express properties of the system being designed. Efficient algorithms were reported in the literature which make it possible to check whether a given behaviour tree enjoys a property expressed in CTL. Such algorithms constitute what is commonly called "model checking". The topic of this thesis is the design and implementation of a model checker for LOTOS specifications called LMC (LOTOS Model Checker). LMC allows users to check whether a specification behaves correctly. To do so, LMC requires a graph model obtained by expanding the LOTOS specification symbolically, and a set of correctness properties describing the requirements behaviour of the system to be checked. These properties are expressed in the branching temporal logic CTL. We present an introduction to formal description techniques along with a review of some relevant existing work. We then present the technical framework of the branching temporal logic CTL, and discuss some important aspects such as correctness properties of concurrent systems and their classification. We discuss the algorithms used in our model checker together with their application to LOTOS. Finally, we use two examples to illustrate the validation methodology.
29
Hedin, Rasmus. "Spell checker in CET Designer." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-131642.
Full textAbstract:
A common feature of text input tools is spell checking. It exists in search engines, email clients and of course in word processors like Microsoft Word. By having a spell checker when you are typing you can be more efficient than if you had to check the spelling with a separate proofing tool. Spell checking is a common request by the users of the room planning software CET Designer which is developed by Configura. In this thesis Windows Spell Checking API is evaluated and compared to alternative spell checkers. A prototype of an integrated spell checker in CET Designer text tool is then implemented with Windows Spell Checking API.
30
Viktorsson, Arvid, and Illya Kyrychenko. "Spell checker for a Java Application." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-78054.
Full textAbstract:
Many text-editor users depend on spellcheckers to correct their typographical errors. The absence of a spellchecker can create a negative experience for the user. In today's advanced technological environment spellchecking is an expected feature. 2Consiliate Business Solutions owns a Java application with a text-editor which does not have a spellchecker. This project aims to investigate and implement available techniques and algorithms for spellcheckers and automated word correction. During implementation, the techniques were tested for their performance and the best solutions were chosen for this project. All the techniques were gathered from earlier written literature on the topic and implemented in Java using default Java libraries. Analysis of the results proves that it is possible to create a complete spellchecker combining available techniques and that the quality of a spellchecker largely depends on a well defined dictionary.
31
Yoo, Joonhyuk. "Harnessing checker hierarchy for reliable microprocessors." College Park, Md.: University of Maryland, 2007. http://hdl.handle.net/1903/7688.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2007.Thesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
32
Gerber, Erick D. B. "A model checker for the LF system." Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/19597.
Full textAbstract:
Thesis (MSc)--University of Stellenbosch, 2007.ENGLISH ABSTRACT: Computer aided veri cation techniques, such as model checking, can be used to improve the reliability of software. Model checking is an algorithmic approach to illustrate the correctness of temporal logic speci cations in the formal description of hardware and software systems. In contrast to traditional testing tools, model checking relies on an exhaustive search of all the possible con gurations that these systems may exhibit. Traditionally model checking is applied to abstract or high level designs of software. However, often interpreting or translating these abstract designs to implementations introduce subtle errors. In recent years one trend in model checking has been to apply the model checking algorithm directly to the implementations instead. This thesis is concerned with building an e cient model checker for a small concurrent langauge developed at the University of Stellenbosch. This special purpose langauge, LF, is aimed at developement of small embedded systems. The design of the language was carefully considered to promote safe programming practices. Furthermore, the language and its runtime support system was designed to allow directly model checking LF programs. To achieve this, the model checker extends the existing runtime support infrastructure to generate the state space of an executing LF program.
AFRIKAANSE OPSOMMING: Rekenaar gebaseerde program toetsing, soos modeltoetsing, kan gebruik word om die betroubaarheid van sagteware te verbeter. Model toetsing is 'n algoritmiese benadering om die korrektheid van temporale logika spesi kasies in die beskrywing van harde- of sagteware te bewys. Anders as met tradisionlee program toetsing, benodig modeltoetsing 'n volledige ondersoek van al die moontlike toestande waarin so 'n beskrywing homself kan bevind. Model toetsing word meestal op abstrakte modelle van sagteware of die ontwerp toegepas. Indien die ontwerp of model aan al die spesi kasies voldoen word die abstrakte model gewoontlik vertaal na 'n implementasie. Die vertalings proses word gewoontlik met die hand gedoen en laat ruimte om nuwe foute, en selfs foute wat uitgeskakel in die model of ontwerp is te veroorsaak. Deesdae, is 'n gewilde benadering tot modeltoetsing om di e tegnieke direk op die implementasie toe te pas, en sodoende die ekstra moeite van model konstruksie en vertaling uit te skakel. Hierdie tesis handel oor die ontwerp, implementasie en toetsing van 'n e ektiewe modeltoetser vir 'n klein gelyklopende taal, LF, wat by die Universiteit van Stellenbosch ontwikkel is. Die enkeldoelige taal, LF, is gemik op die veilige ontwikkeling van ingebedde sagteware. Die taal is ontwerp om veilige programmerings praktyke aan te moedig. Verder is die taal en die onderliggende bedryfstelsel so ontwerp om 'n model toetser te akkomodeer. Om die LF programme direk te kan toets, is die model toetser 'n integrale deel van die bedryfstelsel sodat dit die program kan aandryf om alle moontlike toestande te besoek.
33
Hoyos, Jacob. "PLPrepare: A Grammar Checker for Challenging Cases." Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3898.
Full textAbstract:
This study investigates one of the Polish language’s most arbitrary cases: the genitive masculine inanimate singular. It collects and ranks several guidelines to help language learners discern its proper usage and also introduces a framework to provide detailed feedback regarding arbitrary cases. The study tests this framework by implementing and evaluating a hybrid grammar checker called PLPrepare. PLPrepare performs similarly to other grammar checkers and is able to detect genitive case usages and provide feedback based on a number of error classifications.
34
Eriksson, Marcus. "A CLP(FD)-based model checker for CTL." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-109.
Full textAbstract:
Model checking is a formal verification method where one tries to prove or disprove properties of a formal system. Typical systems one might want to prove properties within are network protocols and digital circuits. Typical properties to check for are safety (nothing bad ever happens) and liveness (something good eventually happens).
This thesis describes an implementation of a sound and complete model checker for Computation Tree Logic (CTL) using Constraint Logic Programming over Finite Domains (CLP(FD)). The implementation described uses tabled resolution to remember earlier computations, is parameterised by choices of computation strategies and can with slight modification support different constraint domains. Soundness under negation is maintained through a restricted form of constructive negation.
The computation process amounts to a fixpoint search, where a fixpoint is reached when no more extension operations has any effect. As results show, the choice of strategies does influence the efficiency of the computation. Soundness and completeness are of course independent of the choice of strategies. Strategies include how to choose the extension operation for the next step and whether to perform global or local rule instantiations, resulting in bottom-up or top-down computations respectively.
35
Thiruvillamalai, Varadarajan. "A type-checker for real-time Object-Z." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq23526.pdf.
Full text
36
Al-Mahmood, Saiyid Jami Islah Ahmad. "A distributed design rule checker for VLSI layouts." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-11012008-063423/.
Full text
37
Štěrba, Ondřej. "Robotický hráč dámy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220707.
Full textAbstract:
This thesis describes playing draughts game by 6 axis manipulator Lynxmotion AL5D controlled by ARM Cortex M3 MCU. It involves algorithms for image recognition, artificial intelligence and algorithms for controlling 6 axis manipulator in real-time.
38
Khorsandi, Aghai Majid. "Model Checking WOOL Parallel Library using SPIN Model Checker." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-159177.
Full text
39
Yuen, Adrienne L. "Gallicisms: An analysis leading towards a prototype gallicisms checker." Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/10340.
Full textAbstract:
The anglicization of French has long been perceived as a major problem and much effort has been made both in France and in Canada to minimize its effects. The gallicization of English, though a problem of much smaller magnitude, has also been observed, particularly in areas such as Quebec where French is the dominant language. However, gallicization his received much less attention than anglicization. In fact, there seems to be little concern among Quebec's anglophones over the gallicization of English, which many do not perceive as being a problem. This lack of interest is not without potential consequences, for, as several linguists have noted, if the current trend towards "Frenglish" is not halted, the English of Quebec's anglo-phone minority may eventually become unintelligible to other English-speaking Canadians. This thesis studies gallicization and has two main objectives: to provide a theoretical and historical background to the phenomenon, and to create a prototype checker of gallicisms. The study includes: a discussion of interference, borrowing and gallicisms, including a definition of the term "gallicism"; a brief history of the English language in Canada with an emphasis on the various influences that have shaped Canadian English; a discussion of Quebec English and its distinguishing feature--gallicisms; a classification system of the different types of gallicism; a set of procedures for verifying suspected gallicisms; the results of an informal experiment where commercially-available tools were applied to a test document containing known gallicisms; a description of a prototype gallicisms checker.
40
Kim, Kwanghyun. "An interactive design rule checker for integrated circuit layout." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/50034.
Full textAbstract:
An implementation of an interactive design rule checker is described in this thesis. Corner-based design rule checking algorithm is used for the implementation. Due to the locality of checking mechanism of the corner-based algorithm, it is suitable for hierarchical and interactive local design rule checking. It also allows the various design rules to be specified very easily.
Interactive operations are devised so that the design rule checker can be invoked from inside the layout editor. All the information about the violation, such as position, type of violation, and symbol definition name are provided in an interactive manner. In order to give full freedom to the user to choose the scope of checking, three options, "Flattening", "Unflattening" and "User-defined window" are implemented in creating the database to be checked. The "User-defined window" option allows hierarchical design rule checking on a design which contains global rectangles. Using these three options, very efficient hierarchical checking can be performed.Master of Science
incomplete_metadata
41
Neupane, Thakur. "STAMINA: Stochastic Approximate Model-Checker for Infinite-State Analysis." DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7607.
Full textAbstract:
Reliable operation of every day use computing system, from simple coffee machines to complex flight controller system in an aircraft, is necessary to save time, money, and in some cases lives. System testing can check for the presence of unwanted execution but cannot guarantee the absence of such. Probabilistic model checking techniques have demonstrated significant potential in verifying performance and reliability of various systems whose execution are defined with likelihood. However, its inability to scale limits its applicability in practice.
This thesis presents a new model checker, STAMINA, with efficient and scalable model truncation for probabilistic verification. STAMINA uses a novel model reduction technique generating a finite state representations of large systems that are amenable to existing probabilistic model checking techniques. The proposed method is evaluated on several benchmark examples. Comparisons with another state-of-art tool demonstrates both accuracy and efficiency of the presented method.
42
Johnson, Timothy E. "MOSSTAT An interactive static rule checker for MOS VLSI designs." Full text open access at:, 1986. http://content.ohsu.edu/u?/etd,109.
Full text
43
Sexton, John A. "Detecting errors in software using a parameter checker : an analysis /." Online version of thesis, 1989. http://hdl.handle.net/1850/10585.
Full text
44
Kopas, Robert George. "The design and implementation of a specification language type checker." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25822.
Full text
45
Unver, Evren R. (Evren Rifki). "Implementation of a design rule checker for silicon wafer fabrication." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35387.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (leaves 90-92).
by Evren R. Ünver.
M.Eng.
46
Esen, Zafer. "Extension of the ELDARICA C model checker with heap memory." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-397812.
Full textAbstract:
Model checking is a verification method which is used to detect bugs which would be extremely hard to detect using traditional testing, and ELDARICA is a state-of-the-art model checker which accepts a variety of formats as its input, including programs written in a fragment of the C language. This thesis aims to improve the C front-end of ELDARICA to a point where it can automatically model and verify C programs which contain pointers, heap memory interactions and structs, which are currently not supported. This work models the heap in a similar way to how it was done in JayHorn, a model checker for Java, by automatically finding quantified invariants which summarize the states of data structures that are on the heap. Support for structs is added by modeling them as algebraic data types, and limited support for stack pointers is added with some constraints on how they are declared and used. The initial experimental results are promising. The extended tool can now parse programs written in a larger fragment of the C language, with acceptable precision and performance in comparison to similar tools.
47
Cordis, Adriana S. "Judicial checks on corruption." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1211388402/.
Full text
48
Stratis, Athanasios. "Model-based Testing on Generated C Code." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28381.
Full textAbstract:
In this master thesis we investigated whether it is possible to use automatically generated C code from Function Block Diagram models as an input to the CPAchecker model checker in order to generate automated test cases. Function Block Diagram is a non-executable programming and modeling language. Consequently, we need to transform this language to an executable language that can be model checked. A tool that achieves this is the MITRAC tool, a proprietary development tool used in the embedded system domain, for engineering programmable logic controllers. The purpose of this research was to investigate to what extent the generated C code using MITRAC can be reused as an input to the CPAchecker tool for automated test case generation. In order to achieve this we needed to perform certain transformations steps on the existing code. In addition, necessary instrumentations were needed in order to trigger CPAtiger, an extension of CPAchecker which generates test cases, to achieve maximum condition coverage. We showed that by performing the required modifications it is feasible to reuse the generated C code as an input to CPAchecker tool. We also showed an approach for mapping the generated test cases with the actual Function Block Diagram. We performed mutation analysis in order to evaluate the quality of the generated test cases in terms of the number of injected faults they detect. Test case generation with CPAchecker could be improved in the future in terms of reducing the number of transformations and instrumentations that are currently needed. In order to achieve this we need to add to CPAchecker tool support for structures that are used in C, such as structs. Finally we can extend the type of logic coverage criteria we can use with CPAchecker by adding additional support of FQL language.
49
Leavengood, John Moeller. "The checkered beetles (Coleoptera: Cleridae) of Florida." [Gainesville, Fla.] : University of Florida, 2008. http://purl.fcla.edu/fcla/etd/UFE0023794.
Full text
50
Banda, Gourinath, and John P. Gallagher. "Constraint-based abstraction of a model checker for infinite state systems." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4151/.
Full textAbstract:
Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.