Dissertations / Theses on the topic 'Computer programmer'
To see the other types of publications on this topic, follow the link: Computer programmer.
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 'Computer programmer.'
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
Murphy-Hill, Emerson. "Programmer Friendly Refactoring Tools." PDXScholar, 2009. https://pdxscholar.library.pdx.edu/open_access_etds/2672.
Full textAbstract:
Tools that perform semi-automated refactoring are currently under-utilized by programmers. If more programmers adopted refactoring tools, software projects could make enormous productivity gains. However, as more advanced refactoring tools are designed, a great chasm widens between how the tools must be used and how programmers want to use them. This dissertation begins to bridge this chasm by exposing usability guidelines to direct the design of the next generation of programmer-friendly refactoring tools, so that refactoring tools fit the way programmers behave, not vice-versa.
2
Naeem, Nomair A. "Programmer-friendly decompiled Java." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101644.
Full textAbstract:
Java decompilers convert Java class files to Java source. Common Java decompilers are javac-specific decompilers since they target bytecode produced from a particular javac compiler. We present work carried out on Dava, a tool-independent decompiler that decompiles bytecode produced from any compiler. A known deficiency of tool-independent decompilers is the generation of complicated decompiled Java source which does not resemble the original source as closely as output produced by javac-specific decompilers. This thesis tackles this short-coming, for Dava, by introducing a new back-end consisting of simplifying transformations.The work presented can be broken into three major categories: transformations using tree traversals and pattern matching to simplify the control flow, the creation of a flow analysis framework for an Abstract Syntax Tree (AST) representation of Java source code and the implementation of flow analyses with their use in complicated transformations.
The pattern matching transformations rewrite the ASTs to semantically-equivalent ASTs that correspond to code that is easier for programmers to understand. The targeted Java constructs include If and If-Else aggregation, for-loop creation and the removal of abrupt control flow. Pattern matching using tree traversals has its limitations. Thus, we introduce a new structure-based data flow analysis framework that can be used to gather information required by more complex transformations. Popular compiler analyses e.g., reaching definitions, constant propagation etc. were implemented using the framework. Information from these analyses is then leveraged to perform more advanced AST transformations.
We performed experiments comparing different decompiler outputs for different sources of bytecode. The results from these experiments indicate that the new Dava back-end considerably improves code comprehensibility and readability.
3
Revelle, Meghan Kathleen. "An Investigation of Programmer-Identified Concerns." W&M ScholarWorks, 2005. https://scholarworks.wm.edu/etd/1539626844.
Full text
4
Nevins, Cole. "The effect of correspondence highlighting on novice programmer instruction." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/c_nevins_042409.pdf.
Full textAbstract:
Thesis (M.S. in computer science)--Washington State University, May 2009.Title from PDF title page (viewed on May 26, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 64-72).
5
Kenyon, John L. "CHIMP the C/C++ hybrid imperative meta-programmer /." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453647.
Full text
6
Raley, John B. "Factors Affecting the Programming Performance of Computer Science Students." Thesis, Virginia Tech, 1996. http://hdl.handle.net/10919/36716.
Full textAbstract:
Two studies of factors affecting the programming performance of first- and second year Computer Science students were conducted. In one study students used GIL, a simple application framework, for their programming assignments in a second-semester programming course. Improvements in student performance were realized. In the other study, students submitted detailed logs of how time was spent on projects, along with their programs. Software metrics were computed on the students' source code. Correlations between student performance and the log data and software metric data were sought. No significant indicators of performance were found, even with factors that are commonly expected to indicate performance. However, results from previous research concerning variations in individual programmer performance and relationships between software metrics were obtained.Master of Science
7
Kasu, Velangani Deepak Reddy. "Programmer Difficulties within a Software Development Environment." University of Cincinnati / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1544002452972811.
Full text
8
Hollar, Ashby Brooks. "Cowboy : an agile programming methodology for a solo programmer /." VCU Scholars Compass, 2006. http://hdl.handle.net/10156/1400.
Full text
9
Jenkins, Joseph A. "Facilitating software reuse by structuring the SPS user interface management system's software library according to programmer mental models." Diss., This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-06062008-164519/.
Full text
10
Gimenez, Stéphane. "Programmer, calculer et raisonner avec les réseaux de la Logique Linéaire." Phd thesis, Université Paris-Diderot - Paris VII, 2009. http://tel.archives-ouvertes.fr/tel-00629013.
Full textAbstract:
La première partie propose divers systèmes de réseaux d'interaction (calcul par réécriture muni d'une réduction atomique, locale et parallèle) qui simulent l'exécution des preuves de la logique linéaire (considérées comme des programmes). Les différents fragments de cette logique sont abordés, on y ajoute aussi une récursion pour atteindre l'expressivité des langages de programmation usuels. Ce procédé de simulation permet d'exécuter certains langages à l'aide d'une petite machine d'exécution multi-processeurs. Il s'appuie sur des représentations localisées de boîtes issues des réseaux de preuve ; certaines utilisent avantageusement un canal de contrôle pour ne rien perdre de la structure des preuves représentées. La deuxième partie s'articule autour de la logique linéaire différentielle et de ses ressources à usage unique. On la munit d'une super-promotion, qui se distingue notamment d'une promotion ordinaire parce qu'elle préserve la symétrie originelle de ce formalisme. C'est la pendante côté logique de la réplication qu'on trouve parfois dans les algèbres de processus. On arrive à isoler l'un de ses composants plus primitifs, le co-enfouissement, responsable de leur dynamique incontrôlée (pour l'instant). Cette construction peut être exprimée dans la syntaxe du λ-calcul avec ressources ou dans un système de réseaux. La séquentialisation de ces derniers requiert une présentation originale de la logique, fondée sur un calcul de structures, et qui a potentiellement d'autres intérêts. Il est aussi question de réalisabilité pour les systèmes différentiels et de sémantique relationnelle pour les divers réseaux présentés.
11
Silcock, Jackie, and mikewood@deakin edu au. "Programmer friendly and efficient distributed shared memory integrated into a distributed operating system." Deakin University. School of Computing and Mathematics, 1998. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051114.110240.
Full textAbstract:
Distributed Shared Memory (DSM) provides programmers with a shared memory environment in systems where memory is not physically shared. Clusters of Workstations (COWs), an often untapped source of computing power, are characterised by a very low cost/performance ratio. The combination of Clusters of Workstations (COWs) with DSM provides an environment in which the programmer can use the well known approaches and methods of programming for physically shared memory systems and parallel processing can be carried out to make full use of the computing power and cost advantages of the COW.
The aim of this research is to synthesise and develop a distributed shared memory system as an integral part of an operating system in order to provide application programmers with a convenient environment in which the development and execution of parallel applications can be done easily and efficiently, and which does this in a transparent manner. Furthermore, in order to satisfy our challenging design requirements we want to demonstrate that the operating system into which the DSM system is integrated should be a distributed operating system.
In this thesis a study into the synthesis of a DSM system within a microkernel and client-server based distributed operating system which uses both strict and weak consistency models, with a write-invalidate and write-update based approach for consistency maintenance is reported. Furthermore a unique automatic initialisation system which allows the programmer to start the parallel execution of a group of processes with a single library call is reported. The number and location of these processes are determined by the operating system based on system load information.
The DSM system proposed has a novel approach in that it provides programmers with a complete programming environment in which they are easily able to develop and run their code or indeed run existing shared memory code. A set of demanding DSM system design requirements are presented and the incentives for the placement of the DSM system with a distributed operating system and in particular in the memory management server have been reported. The new DSM system concentrated on an event-driven set of cooperating and distributed entities, and a detailed description of the events and reactions to these events that make up the operation of the DSM system is then presented. This is followed by a pseudocode form of the detailed design of the main modules and activities of the primitives used in the proposed DSM system.
Quantitative results of performance tests and qualitative results showing the ease of programming and use of the RHODOS DSM system are reported. A study of five different application is given and the results of tests carried out on these applications together with a discussion of the results are given. A discussion of how RHODOS DSM allows programmers to write shared memory code in an easy to use and familiar environment and a comparative evaluation of RHODOS DSM with other DSM systems is presented. In particular, the ease of use and transparency of the DSM system have been demonstrated through the description of the ease with which a moderately inexperienced undergraduate programmer was able to convert, write and run applications for the testing of the DSM system. Furthermore, the description of the tests performed using physically shared memory shows that the latter is indistinguishable from distributed shared memory; this is further evidence that the DSM system is fully transparent. This study clearly demonstrates that the aim of the research has been achieved; it is possible to develop a programmer friendly and efficient DSM system fully integrated within a distributed operating system.
It is clear from this research that client-server and microkernel based distributed operating system integrated DSM makes shared memory operations transparent and almost completely removes the involvement of the programmer beyond classical activities needed to deal with shared memory. The conclusion can be drawn that DSM, when implemented within a client-server and microkernel based distributed operating system, is one of the most encouraging approaches to parallel processing since it guarantees performance improvements with minimal programmer involvement.
12
Erazo, Jorge G. "An emulator system for the MC146805F2/G2 microprocessors." Ohio : Ohio University, 1985. http://www.ohiolink.edu/etd/view.cgi?ohiou1184001657.
Full text
13
Öhrström, Fredrik. "The Indie Developer’s guide to immersive tweens and animation : What you need to know as a programmer to animate and increase immersion." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129777.
Full textAbstract:
Some games are grabbing your attention more than others. Some even do it so well people even lose track of time and their surroundings. Why does this happen? And how can the effect be harnessed for your own game? This report studies what immersion is and subjects related to it, such as richness and flow, and then how and what kind of easy animations and effects that build on these concepts that you can create in a 2D puzzle game. Most of the effects, animations and ideas can probably be carried over to other game types without much difficulty if you want a more immersive product. In the end, the player experience is tested by two surveys to see if players were immersed, PANAS and IEQ. The results go over what kind of effects were implemented and the surveys showed that most players were a bit immersed and that they enjoyed the graphics of the game.
14
Do, Khoa Tat. "Universal Engineering Programmer - An In-house Development Tool For Developing and Testing Implantable Medical Devices In St. Jude Medical." DigitalCommons@CalPoly, 2011. https://digitalcommons.calpoly.edu/theses/488.
Full textAbstract:
During development and testing of the functionality of the pacemaker and defibrillator device, engineers in the St. Jude Medical Cardiac Rhythm Management Division use an in-house development tool called Universal Engineering Programmer (UEP) to ensure the device functions as expected, before it can be used to test on an animal or a human during the implantation process. In addition, some applications of UEP are incorporated into the official releases of the device product. UEP has been developed and used by engineers across departments in the St. Jude Medical Cardiac Rhythm Management Division (CRMD). This thesis covers the flexible and reusable design and implementation of UEP features, to allow engineers to easily and effectively develop and test the devices.
15
Pouillard, Nicolas. "Une approche unifiante pour programmer sûrement avec de la syntaxe du premier ordre contenant des lieurs." Phd thesis, Université Paris-Diderot - Paris VII, 2012. http://tel.archives-ouvertes.fr/tel-00759059.
Full textAbstract:
Cette thèse décrit une nouvelle approche pour la méta-programmation sûre. Un méta-programme est un programme qui manipule des programmes ou assimilés. Les compilateurs et systèmes de preuves sont de bons exemples de méta-programmes qui bénéficieraient de cette approche. Dans ce but, ce travail se concentre sur la représentation des noms et des lieurs dans les structures de données. Les erreurs de programmation étant courantes avec les techniques usuelles, nous proposons une interface abstraite pour les noms et les lieurs qui élimine ces erreurs. Cette interface est implémentée sous forme d'une bibliothèque en Agda. Elle permet de définir et manipuler des représentations de termes dans le style nominal. Grâce à l'abstraction, d'autres styles sont aussi disponibles : le style de De Bruijn, les combinaisons de ces styles, et d'autres encore. Nous indiçons les noms et les termes par des mondes. Les mondes sont en même temps précis et abstraits. Via les relations logiques et la paramétricité, nous pouvons démontrer dans quel sens notre bibliothèque est sûre, et obtenir des "théorèmes gratuits" à propos des fonctions monde-polymorphiques. Ainsi une fonction monde-polymorphique de transformation de termes doit commuter avec n'importe quel renommage des variables libres. La preuve est entièrement conduite en Agda. Notre technique se montre utile sur plusieurs exemples, dont la normalisation par évaluation qui est connue pour être un défi. Nous montrons que notre approche indicée par des mondes permet d'exprimer un large panel de type de données grâce a des langages de définition embarqués.
16
Dronamraj, Rakesh. "Tools and Versioning for GUI text in SDP3 : Rakesh Dronamraj." Thesis, Linköpings universitet, MDALAB - Human Computer Interfaces, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60080.
Full textAbstract:
Scania, one of the heavy engines manufacturers, produces Scania Diagnos Programmer 3 (SDP3) to facilitate repair process in their workshops. SDP3 is localizable software which challenges to separate User Interface strings (UI strings) during development process and later combine with the localized strings for local user access. The objective of this report is to provide knowledgeable solution for Graphical User Interface (GUI) development, especially with respect to synchronization of UI strings in SDP3.The migration of SDP3 from .NET 3.0v framework to .NET 3.5v framework satisfies modern standards and needs. With regards to migration of SDP3’s localization process, I have attempted to summarize major .NET 3.5v framework methods that can be used for localization of GUI text in SDP3. Experiments show that tools used to facilitate the localization process also lack important features. Although pre-build process and post-build process provide promising solutions for localization, using them along with some proprietary localization tool should result in more features, better and faster production cycle. However, proprietary localization tool have to be used with anyone of the localization methods.
17
Coull, Natalie J. "SNOOPIE : development of a learning support tool for novice programmers within a conceptual framework." Thesis, St Andrews, 2008. http://hdl.handle.net/10023/522.
Full text
18
Montagu, Benoît. "Programmer avec des modules de première classe dans un langage noyau pourvu de sous-typage, sortes singletons et types existentiels ouverts." Phd thesis, Ecole Polytechnique X, 2010. http://tel.archives-ouvertes.fr/tel-00550331.
Full textAbstract:
Cette thèse décrit comment l'ajout de trois ingrédients à Système Fω permet d'écrire des programmes de façon modulaire dans un système explicite à la Church, tout en gardant un style proche des modules de ML. Le premier chapitre s'intéresse aux types existentiels ouverts, qui confèrent la possibilité d'utiliser des types existentiels sans restriction de portée : cela offre une plus grande flexibilité dans l'organisation des programmes. Le deuxième chapitre est consacré à l'étude des kinds singletons, qui modélisent les définitions de types : dans ce cadre, on donne une caractérisation simple de l'équivalence de types, fondée sur une relation de réduction confluente et fortement normalisante. Le dernier chapitre intègre les deux notions précédentes dans un langage noyau muni d'une relation de sous-typage : cela apporte à Fω un gain de modularité important, de niveau comparable à celui des modules de ML. Une traduction des modules vers ce langage est esquissée, permettant une comparaison précise des deux langages.
19
Gérard, Léonard. "Programmer le parallélisme avec des futures en Heptagon un langage synchrone flot de données et étude des réseaux de Kahn en vue d'une compilation synchrone." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00929932.
Full textAbstract:
Les langages synchrones ont été fondés pour modéliser et implémenter les systèmes réactifs temps-réels critiques. Avec la complexité toujours croissante des systèmes contrôlés, la vitesse d'exécution devient un critère important. Nous sommes donc à la recherche d'une exécution parallèle, combinant efficacité et sûreté.Les langages synchrones ont toujours intégré la notion de parallélisme, mais ce, pour l'expressivité de la modélisation. Leurs compilations visent principalement les circuits ou la génération de code séquentiel. Tous ont une sémantique formelle, qui rend possible la distribution correcte du code. Mais la préservation de cette sémantique peut être un obstacle à l'efficacité du code généré, particulièrement s'il est nécessaire de préserver une notion d'instant global au système.Le modèle sémantique qui nous intéresse est celui des réseaux de Kahn. Ces réseaux modélisent des calculateurs distribués, communiquant au travers de files de taille non bornée. Dans ce cadre, la distribution ne demande aucune communication ni synchronisation supplémentaire. En considérant l'histoire des files de communication, la sémantique de Kahn permet de s'abstraire de l'exécution effective, tout en garantissant le déterminisme du calcul. Pour cela, chaque nœud du réseau doit avoir une sémantique fonctionnelle continue.Le langage que nous développons est Heptagon, un langage synchrone fonctionnel du premier ordre, déscendant de Lustre. Son compilateur est un prototype universitaire, apparenté à l'outil industriel Scade. Grâce à sa sémantique de Kahn, la distribution d'un programme Heptagon ne pose pas de question, son efficacité beaucoup plus.L'efficacité requiert de minimiser les synchronisations. Cela revêt deux aspects non indépendants. Avoir un découplage suffisant des calculs : il y a des délais dans les dépendances entre calculs. Avoir une granularité importante des calculs : un fort ratio temps de calcul sur fréquence de communication. Or la sémantique synchrone et les horloges d'un programme Heptagon reflètent exactement l'inverse. Elles permettent au programmeur de se contenter d'un découplage d'un instant et à chaque instant, au maximum une valeur est calculée. De plus, les instants sont typiquement courts, pour assurer que le système réagit rapidement.Des précédents travaux sur le sujet, nous tirons deux constats.Le premier est que nous souhaitons le contrôle du parallélisme par le programmeur, directement dans le code source. Il doit pouvoir maîtriser à quels instants il y a communication ou synchronisation. La solution que nous proposons dans ce manuscrit est l'utilisation des futures dans Heptagon. Ils fournissent ce pouvoir au programmeur, tout en restant des annotations qui peuvent être supprimées sans changer la sémantique dénotationnelle du programme.Le deuxième constat est que la question de la granularité des calculs est une question profonde, touchant en particulier aux questions de dépendance de données, de choix des horloges et de compilation modulaire. Heptagon, comme ses parents, restreint les réseaux de Kahn qui peuvent être écrits, de telle sorte que ces trois questions se traitent séparément. Pour mieux comprendre le lien entre ces éléments, nous revenons aux réseaux de Kahn. Notre principal résultat est la définition de la sous-classe des réseaux ordonnés réactifs. Ceux-ci sont les seuls pour lesquels nous pouvons décrire modulairement le comportement avec des horloges, sans restreindre les contextes d'appels. Ces réseaux ont une signature d'horloge en forme normale, qui maximise la granularité. Pour l'exprimer, nous introduisons les horloges entières, décrivant la communication de plusieurs valeurs en un seul instant. Nous appliquons ensuite nos résultats pour voir sous un nouveau jour Heptagon, Signal, les politiques des objets de Lucid Synchrone, mais aussi proposer une analyse pleinement modulaire de Lucy-n langage synchrone le plus fidèle aux réseaux de Kahn.
20
Lockwood, Susan M. Yohnk. "A comparison of academic success in web-based versus campus-based courses in the Computer Information Systems-Programmer/Analyst Associate Degree program at Wisconsin Indianhead Technical College New Richmond." Online version, 2002. http://www.uwstout.edu/lib/thesis/2002/2002yohnkls.pdf.
Full text
21
Delorey, Daniel Pierce. "Observational Studies of Software Engineering Using Data from Software Repositories." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1716.pdf.
Full text
22
Anderson, Steven Schuyler. "Is there a shortage of computer programmers/systems analysts? an examination of the empirical evidence /." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA240588.
Full textAbstract:
Thesis (M.S. in Information Systems)--Naval Postgraduate School, September1990.Thesis Advisor(s): Haga, William J. Second Reader: Mehay, Stephen L. "September 1990." Description based on title screen viewed on December 16, 2009. DTIC Descriptor(s): Computer personnel, shortages, programmers, analysts, systems analysis, theses, computers, specialists. DTIC Identifier(s): Computer programs, systems analysis, specialists, shortages, theses. Author(s) subject terms: Programmer, systems analysis, shortage, shortfall. Includes bibliographical references (p. 29-30). Also available in print.
23
Buchhalter-Thomas, Edith. "Das Entwerfen von Computer-Programmen : eine psychologische Untersuchung zu seelischen Produktionsprozessen beim Entwerfen von Computer-Programmen /." Köln : Druck, 1996. http://catalogue.bnf.fr/ark:/12148/cb40037628t.
Full text
24
Citron, Judith Linda. "Cognitive processes of novice computer programmers." Thesis, University College London (University of London), 1985. http://discovery.ucl.ac.uk/10019556/.
Full text
25
Jacobi, Darlene Marion. "Gender and grade similarities and differences in elementary school students in language referring to computers and computer programmes." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/28243.
Full textAbstract:
A four month qualitative study was conducted to investigate gender and grade similarities and differences in language; spoken, written and other symbols (art), referring to computers and computer programmes, among elementary school students.
The subjects were a heterogeneous intact grade one class of twenty-five students and a heterogeneous intact grade six/seven class of twenty-one students from a small, lower socio-economic school in a large urban centre in British Columbia.
Data was gathered over a period of four months through individual and group interviews and, from student responses to broad general questions, in the form of art, journal entries and creative writing.
The study took place in the classrooms and in the computer laboratory which consisted of fifteen Commodore 64 computers and three printers. Programmes used were LOGO, KIDWRITER and two district developed programmes, EDITOR (word processing) and MUSIC SHOP.
From the analysis of the data clear categories emerged. Findings suggest that: (1) students viewed the world of technology as largely a male domain/ (2) students did not view the use of computers as extraordinary but as a normal part of the everyday school experience/ (3) girls were dissatisfied with the limitations of the programmes, desiring those which featured the Arts and stressed creativity/ (4) Grade Six/Seven boys desired programmes with highly competitive, video-game formats in Mathematics and Spelling/ (5) boys realized the potential of the computer to be used to perform aggressive/violent acts/ (6) Grade One girls desired a computer laboratory environment resembling a spring garden/ (7) Grade Six/Seven girls believed they would be doing word processing as a part of their future jobs/ (8) Grade Six/Seven boys viewed word processing as a tool which would enable them to perform their "real" careers more effectively/and (9) Grade One students preferred typing stories on the computer to printing them by hand.Education, Faculty of
Curriculum and Pedagogy (EDCP), Department of
Graduate
26
Anderson, Gabrielle. "Behavioural properties and dynamic software update for concurrent programmes." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/353281/.
Full textAbstract:
Software maintenance is a major part of the development cycle. The traditional methodology for rolling out an update to existing programs is to shut down the system, modify the binary, and restart the program. Downtime has significant disadvantages. In response to such concerns, researchers and practitioners have investigated how to perform update on running programs whilst maintaining various desired properties. In a multi-threaded setting this is further complicated by the interleaving of different threads' actions. In this thesis we investigate how to prove that safety and liveness are preserved when updating a program. We present two possible approaches; the main intuition behind each of these is to find quiescent points where updates are safe. The first approach requires global synchronisation, and is more generally applicable, but can delay updates indefinitely. The second restricts the class of programs that can be updated, but permits update without global synchronisation, and guarantees application of update. We provide full proofs of all relevant properties.
27
Warley, John. "The selection of computer programmers : an assessment of fairness." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/15979.
Full textAbstract:
Bibliography: pages 87-91.The shortage of skilled computer staff in South Africa has reached critical proportions. Not only is commerce unable to recruit enough manpower with the required experience and expertise, they are also posed with the problem of high turnover and remunerating a small number of people in excess of their market value. In contrast to this phenomena, South Africa has a vastly under-utilised "other than "white" population of Matriculants and Technikon diplomates. It is hypothesised that the skilled shortage in computer programming could be overcome if more applicants out of this labour segment were given entry level jobs and trained to be productive and competent. This study attempts to address the difficulties of the under-utilised manpower resources by looking at the entry level requirements for computer programmers. Since for industry as a whole, aptitude tests are used on applicants for entry level programmers, one of these tests, viz. the National Institute of Personnel Research General Aptitude Battery was investigated. It was hypothesised that the instrument was an unfair selection tool· as most "other than white" applicants evaluated did not perform as well as the white applicants. The sample comprised of technikon students who had passed at least their first year of the Computer Data Processing Diploma. Thirty five were selected and matched from a white and forty three from a so-called "coloured" institution. The results of this cross cultural research design in a field setting were statistically analysed and findings were that the "coloured" group scored far lower than that of the white group. Therefore, the researcher concluded that the test battery was not a good predictor of success and should not be used across population groups, as it could lead to an unfair labour practice. It was proposed instead that a biographical structured interview guide based on the accomplishments of applicants ·be used to supplement the test results. In so doing the researcher suggested that dimensions of success for a programmer be probed for, during the interview rather than concentrating purely on an aptitude test which could be seen as unfair.
28
Chozos, Nick. "An investigation into error detection and recovery in UK National Health Service screening programmes." Thesis, University of Glasgow, 2009. http://theses.gla.ac.uk/1094/.
Full textAbstract:
The purpose of this thesis is to gain an understanding of the problems that may impede detection and recovery of NHS laboratory screening errors. This is done by developing an accident analysis technique that isolates and further analyzes error handling activities, and applying it in four case studies; four recent incidents where laboratory errors in NHS screening programmes resulted in multiple misdiagnoses over months or even years. These errors resulted in false yet plausible test results, thus being masked and almost impossible to detect in isolated cases. This technique is based on a theoretical framework that draws upon cognitive science and systems engineering, in order to explore the impact of plausibility on the entire process of error recovery. The four analyses are then integrated and compared, in order to produce a set of conclusions and recommendations. The main output of this work is the “Screening Error Recovery Model”; a model which captures and illustrates the different kinds of activities that took place during the organizational incident response of these four incidents. The model can be used to analyze and design error recovery procedures in complex, inter-organizational settings, such as the NHS, and its Primary/Secondary care structure.
29
Elter, Matthias. "Computer-aided diagnosis of breast cancer." Tönning Lübeck Marburg Der Andere-Verl, 2010. http://d-nb.info/1001110773/04.
Full text
30
Cunningham, Lynn T. "A comparison of the organizational strategies of multilingual computer programmers." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43839.
Full textAbstract:
see documentThe objective of this study was to determine whether computer programmers would organize reserved words by programming language or by conceptual category, when given an opportunity to use either strategy. Twenty-seven participants, stratified by programming experience level (novice, intermediate, and expert), were given sixteen reserved words on index cards. The words were taken from four programming languages, as well as six conceptual categories. Participants were given both a recognition and a recall task. Organizing the words by conceptual category enabled the expert programmers to perform significantly better on the recall task than experts who organized by language. In addition, they made fewer recognition errors, and had more structured recall, in terms of recalling the words by the categories in which they were studied. Expert computer programmers, similar to natural language multilinguals, can recall more (reserved) words when they are organized by conceptual categories rather than by (programming) language. It is hypothesized that this is because human memory is organized in a fundamentally interdependent (across languages) manner in many domains other than natural language, such as computer programming.
Master of Arts
31
Kurt, Mehmet Can. "Fault-tolerant Programming Models and Computing Frameworks." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1437390499.
Full text
32
Oberem, Graham Edmund. "An intelligent computer-based tutor for elementary mechanics problems." Thesis, Rhodes University, 1987. http://hdl.handle.net/10962/d1001997.
Full textAbstract:
ALBERT, an intelligent problem-solving monitor and coach, has been developed to assist students solving problems in one-dimensional kinematics. Students may type in kinematics problems directly from their textbooks. ALBERT understands the problems, knows how to solve them, and can teach students how to solve them. The program is implemented in the TUTOR language and runs on the Control Data mainframe PLATO system. A natural language interface was designed to understand kinematics problems stated in textbook English. The interface is based on a pattern recognition system which is intended to parallel a cognitive model of language processing. The natural language system has understood over 60 problems taken directly from elementary Physics textbooks. Two problem-solving routines are included in ALBERT. One is goal-directed and solves the problems using the standard kinematic equations. The other uses the definition of acceleration and the relationship between displacement and average velocity to solve the problems. It employs a forward-directed problem-solving strategy. The natural language interface and both the problem-solvers are fast and completely adequate for the task. The tutorial dialogue system uses a modified version of the natural language interface which operates in a two-tier fashion. First an attempt is made to understand the input with the pattern recognition system, and if that fails, a keyword matching system is invoked. The result has been a fairly robust language interface. The tutorial is driven by a tutorial management system (embodying a tutorial model) and a context model. The context model consists of a student model, a tutorial status model and a dynamic dialogue model. ALBERT permits a mixed initiative dialogue in the discussion of a problem. The system has been tested by Physics students in more than 80 problemsolving sessions and the results have been good. The response of the students has been very favourable
33
Milner, Walter William. "Concept development in novice programmers learning Java." Thesis, University of Birmingham, 2011. http://etheses.bham.ac.uk//id/eprint/1670/.
Full textAbstract:
It is hypothesised that the development of concepts in formal education can be understood through the ideas of non-literal language and conceptual integration networks. The notions of concept, understanding and meaning are examined in some depth from philosophical, psychological and linguistic standpoints. The view that most concepts are grasped through non-literal means such as metaphor and conceptual blend is adopted. The central contention is that this applies both to everyday ideas and to those presented to students in formal educational contexts, and that consequently such learning is best seen in those terms. Such learning is not founded upon literal language, but a construction by the student of a complex network of metaphor and conceptual blends. This is examined in the context of students learning programming, in particular in the language Java. The hypothesis is tested by analysing transcribed interviews with a wide range of students, triangulated with an examination of teaching materials, and the data is shown to be consistent with the hypothesis. However the approach is fundamental and is not concerned with specific features of programming or Java, so that conclusions are relevant across a wide range of disciplines, especially mathematics, science and engineering. The thesis provides a new way of examining course design and learning materials including lectures and textbooks. Discourse which might seem to be literal is in fact metaphorical and blended, since it is in that way that the expert community understands the ideas. The students’ construction of corresponding blends is on the basis of their learning experience, and course design features such as examples can be explained and evaluated in such terms.
34
Tula, Naveen. "An Empirical Study of How Novice Programmers Use the Web." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc849754/.
Full textAbstract:
Students often use the web as a source of help for problems that they encounter on programming assignments.In this work, we seek to understand how students use the web to search for help on their assignments.We used a mixed methods approach with 344 students who complete a survey and 41 students who participate in a focus group meetings and helped in recording data about their search habits.The survey reveals data about student reported search habits while the focus group uses a web browser plug-in to record actual search patterns.We examine the results collectively and as broken down by class year.Survey results show that at least 2/3 of the students from each class year rely on search engines to locate resources for help with their programming bugs in at least half of their assignments;search habits vary by class year;and the value of different types of resources such as tutorials and forums varies by class year.Focus group results exposes the high frequency web sites used by the students in solving their programming assignments.
35
Srirangarajan, Ananth Lall Pradeep Umphress David A. "The scrum process for independent programmers." Auburn, Ala, 2009. http://hdl.handle.net/10415/1617.
Full text
36
Yellen, Richard Emerson. "Increasing the propensity to use computer application software." Diss., The University of Arizona, 1987. http://hdl.handle.net/10150/184286.
Full textAbstract:
The use of computer application software could be increased. The goal of this research was to uncover a design for a module which instructs the potential user how to use software. This type of module, called an instructional module, would, when incorporated on software such as decision support tools, increase the willingness of novices to use the software more frequently. Four instructional modules designs, which were the result of combining two states of two variables of instructional module design, were examined. The four designs are (1) an automated programmed learning module; (2) an automated help facility; (3) a manual programmed learning module and; (4) a manual help facility. A financial decision support tool was developed, and each of the four instructional modules designs was placed separately on the decision support tool. This created, in effect, four different tools. Subjects in the experiment were business school students with no formal experience using a decision support tool. Each subject was exposed to two of the four instructional module designs during a training session which lasted one hour. One month after the training session, the subjects were reassembled for a second session. During this session, the subjects selected one of the two tools, with its instructional module, which they had been exposed to previously. The subjects were to use the selected tool to solve problems which would likely require them to access the instructional module. In addition to these behavioral selection data, attitudinal data concerning the instructional module designs were also collected throughout both sessions of the experiment. Based on their selection and their attitudinal responses, the subjects indicated that the tool with the automated programmed learning module was the module of choice. The research methodology successfully provided input for instructional module design for computer application software such as decision support tools.
37
Stach, Heike. "Zwischen Organismus und Notation : zur kulturellen Konstruktion des Computer-Programms /." Wiesbaden : Dt. Univ.-Verl, 2001. http://www.gbv.de/dms/bs/toc/323688373.pdf.
Full text
38
Vogts, Dieter. "The evaluation of a pedagogical-program development environment for Novice programmers : a comparative study." Thesis, Nelson Mandela Metropolitan University, 2007. http://hdl.handle.net/10948/638.
Full textAbstract:
It is an acknowledged fact that many novice programmers experience difficulty in the process of learning to program. One of the contributing factors to this difficulty is the Program Development Environment (PDE). Professional-PDEs are those developed specifically for professional programmers, but are often used by educational institutions in the instruction of programming. It has long been accepted that such environments are inappropriate in the instruction of programming due to unnecessary complexity and lack of support for novice programmers in the learning process. Numerous pedagogical-PDEs supporting the mechanics of programming have been developed in response to this. A review of literature, however, indicates that very limited empirical studies comparing pedagogical-PDEs and professional-PDEs have been conducted. The current study investigates whether there are measurable benefits to using a pedagogical-PDE supporting the mechanics of programming in the instruction of programming instead of a professional-PDE. A comparative study of this nature requires a representative pedagogical-PDE and representative professional-PDE be compared with one another. The first part of the current study determines a set of requirements that a pedagogical- PDE should adhere to based on literature. A set of representative features for a pedagogical-PDE is derived by examining the features of existing PDEs in conjunction with the set of requirements. Based on these features, a pedagogical-PDE, known as SimplifIDE, is developed that implements the representative set of features and that meets are the requirements for a pedagogical-PDE. The second part of the current study is the specification and administration of an empirical experiment in which SimplifIDE and Borland© DelphiTM are compared with one another. A holistic approach in determining the differences between the PDEs is taken and three main areas are examined, namely academic performance, perceptions and programming behavior.
39
daSilva, Amanda L. "When Education Matters Less: Estimating the Relative Return to Education for Computer Programmers." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/cmc_theses/550.
Full textAbstract:
Many argue that formal degrees are not necessary to be successful in the technology industry, and further argue that self-taught computer programmers are more productive than formally taught computer programmers. This sentiment is supported by the examples of industry leaders such as Bill Gates, Steve Jobs, and Mark Zuckerberg. This study examines the possible effects of this attitude on the returns to education for computer programmers. The empirical analysis finds that the wage return to formal education for computer programmers is less than for most other occupations including STEM and degree-dominated professions. These differences are attributed to the smaller impact of signaling through educational attainment on wages in the technology industry as well as the perceived ability to substitute the human capital accumulated through formal education with self-teaching and experience.
40
Case, Desmond Robert. "An animated pedagogical agent for assisting novice programmers within a desktop computer environment." Thesis, Staffordshire University, 2012. http://eprints.staffs.ac.uk/1979/.
Full textAbstract:
Learning to program for the first time can be a daunting process, fraught with difficulty and setback. The novice learner is faced with learning two skills at the same time each that depends on the other; they are how a program needs to be constructed to solve a problem and how the structures of a program work towards solving a problem. In addition the learner has to develop practical skills such as how to design a solution, how to use the programming development environment, how to recognise errors, how to diagnose their cause and how to successfully correct them. The nature of learning how to program a computer can cause frustration to many and some to disengage before they have a chance to progress. Numerous authorities have observed that novice programmers make the same mistakes and encounter the same problems when learning their first programming language. The learner errors are usually from a fixed set of misconceptions that are easily corrected by experience and with appropriate guidance. This thesis demonstrates how a virtual animated pedagogical agent, called MRCHIPS, can extend the Beliefs-Desires-Intentions model of agency to provide mentoring and coaching support to novice programmers learning their first programming language, Python. The Cognitive Apprenticeship pedagogy provides the theoretical underpinning of the agent mentoring strategy. Case-Based Reasoning is also used to support MRCHIPS reasoning, coaching and interacting with the learner. The results indicate that in a small controlled study when novice learners are assisted by MRCHIPS they are more productive than those working without the assistance, and are better at problem solving exercises, there are also manifestations of higher of degree of engagement and learning of the language syntax.
41
Atkinson-Hope, Gary. "An integrated programme for power systems simulation using personal computers (PC's)." Thesis, Cape Technikon, 1993. http://hdl.handle.net/20.500.11838/1147.
Full textAbstract:
Thesis (Masters Diploma (Technology)--Cape Technikon, Cape Town, 1993The research objectives were to: Formulate a training structure covering conventional power systems topics; Research existing PC based power systems software resources; Develop a structure for a PC based power systems course; Research the capabilities of the software resources chosen; Develop a structure for a modern PC based power systems course taking into account the capabilities and limitations of the selected software programs; Develop for the PC based power systems course, task orientated computer based laboratory set-ups. The set-ups provide: An introduction into the topics concerned; An explanation of the usage of each program applied, where usage means an explanation of the Input and Output Data of each program; User friendly simulation experiments. These set-ups, together with software programs and a personal computer integrate into a training programme and realize a power systems simulation course.
42
Collett, Philip Godfrey. "Computer assisted language learning for academic development programmes : an appraisal of needs, resources and approaches." Thesis, Rhodes University, 1994. http://hdl.handle.net/10962/d1003338.
Full textAbstract:
A major objective of Academic Development Programmes is to support the student in acquiring a level of language competence which is sufficient to enable the student to cope with the linguistic demands of academic courses. Language teaching programmes in the Academic Development context in South Africa suffer from a number of constraints: staffing, time on task, relevance, and difficulty of integration with learning in other coUrses. A review of developments in the field of Computer Assisted Language Learning (CALL) shows that computers can be used to support language learning. CALL materials range from simple instructional programs to powerful linguistic research tools and need to be integrated into wider language programmes so as to support and enhance other teaching and learning activities. However, relatively little research has been done to investigate the feasibility and effectiveness of CALL in language development courses within Academic Development programmes in South Africa. The development of a system designed to enable students to practise proof-reading and editing is described and evaluated. Suggestions are made for using this system with other CALL materials within a computer assisted language development environment. It is argued that CALL can be used feasibly and effectively in this environment to enhance learning and to counteract constraints.
43
Bertholf, Christopher Forrest. "Comprehension of Literate Programs by Novice and Intermediate Programmers." PDXScholar, 1993. https://pdxscholar.library.pdx.edu/open_access_etds/4572.
Full textAbstract:
The studies reported herein compare comprehension of Ut style literate programs to that of traditional modular programs documented by embedded comments. Novice and intermediate programmers participated in three experiments designed to determine the comprehensibility of literate programs written using a language-independent system for abstraction-oriented literate programming compared with programs written using traditional modular programming techniques (traditional modular programs). Programs were written in either the C or FORTRAN programming language. Half of the subjects in each group received a literate program, while the other half received a traditional modular program with embedded documentation. Subjects received a problem specification, input and output specifications, and a language reference for use in the study. Subjects were asked to perform a program maintenance task (complete an incomplete program). The maintenance task was used as a measure of comprehension; it simulates an actual task in the software engineering industry that requires program comprehension in order to be completed. The elapsed time to effect a solution was recorded. The completed programs were judged as correct, functionally correct with syntax errors, or incorrect; several reconstructive program comprehension measures were also collected and analyzed_ The clear overall result was that subjects using the literate programs found a solution (correct or functionally correct with syntax errors) more often than did subjects using the traditional modular programs with embedded comments. In fact, none of the subjects in this study who modified the traditional programs were able to effect a solution that was totally correct, nor even one that was functionally correct with syntax errors.
44
Delaval, Gwenaël. "Répartition modulaire de programmes synchrones." Phd thesis, Grenoble INPG, 2008. http://www.theses.fr/2008INPG0059.
Full textAbstract:
Nous nous intéressons à la conception sûre de systèmes répartis. Nous proposons une méthode permettant de concevoir un système réparti défini comme un programme unique, dont la structure fonctionnelle est indépendante de l'architecture du système. Cette méthode est basée sur l'ajout de primitives de répartition à un langage flots de données synchrone permettant le placement par le programmeur de certains calculs sur les ressources de l'architecture. Un système d'inférence de types est utilisé pour vérifier la cohérence de ces annotations, ainsi que pour inférer la localisation des valeurs non annotées. Ce système de types est ensuite utilisé pour la définition d'une opération de répartition modulaire, conservant la structure fonctionnelle du programme. La sémantique du programme obtenu par cette méthode est équivalente à la sémantique du programme initial. Le système de types et l'opération de répartition automatique ont été implémentés dans le compilateur du langage Lucid SynchroneWe address the design of distributed systems with synchronous dataflow programming languages. As modular design entails handling both architectural and functional modularity, the first contribution is to extend an existing synchronous dataflow programming language with primitives allowing the description of a distributed architecture and the localization of some values or computations. A type system is defined, in order to infer the localization of non-annotated values and to en sure, at compilation time, the consistency of the distribution. This type system is used to define a type-directed projection operation to obtain automatically, from a centralized typed program, the local program to be executed by each computing resource. The program obtained by mean of this operation is proved to be semantically equivalent to the initial one. The type system as weil as the automatic distribution mechanism has been fully implemented in the Lucid Synchrone compiler
45
Delaval, Gwenaël. "Répartition modulaire de programmes synchrones." Phd thesis, Grenoble INPG, 2008. http://tel.archives-ouvertes.fr/tel-00750832.
Full textAbstract:
Nous nous intéressons à la conception sûre de systèmes répartis. Nous montrons qu'avec la complexité et l'intégration croissante des systèmes embarqués, la structure fonctionnelle du système peut entrer en conflit avec la structure de son architecture. L'approche traditionnelle de conception par raffinement de cette architecture compromet alors la modularité fonctionnelle du système. Nous proposons donc une méthode permettant de concevoir un système réparti défini comme un programme unique, dont la structure fonctionnelle est indépendante de l'architecture du système. Cette méthode est basée sur l'ajout de primitives de répartition à un langage flots de données synchrone. Ces primitives permettent d'une part de déclarer l'architecture sous la forme d'un graphe définissant les ressources existantes et les liens de communication existant entre ces ressources, et d'autre part de spécifier par des annotations la localisation de certaines valeurs et calculs du programme. Nous définissons ensuite la sémantique formelle de ce langage étendu. Cette sémantique a pour but de rendre compte de manière formelle l'effet des annotations ajoutées par le programmeur. Un système de types à effets permet ensuite de vérifier la cohérence de ces annotations. Ce système de types est muni d'un mécanisme d'inférence, qui permet d'inférer, à partir des annotations du programmeur, la localisation des calculs non annotés. Nous définissons ensuite, à partir de ce système de types, une méthode de répartition automatique permettant d'obtenir, à partir d'un programme annoté, un fragment de programme par ressource de l'architecture. La correction du système de types avec la sémantique du langage est prouvée, ainsi que l'équivalence sémantique de l'exécution des fragments obtenus par la méthode de répartition automatique avec le programme initial. Cette méthode a été implémentée dans le compilateur du langage Lucid Synchrone, et testée sur un exemple de radio logicielle.
46
Smith, Paul. "A computer aided selection programme of additive manufacturing materials and processes for generative design." Thesis, Lancaster University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664456.
Full textAbstract:
This thesis documents the rules that were written to define the functionality of the selector tool, and the rules that constrain the pseudo random design programmes. To define the selector tool rules, a comprehensive survey of the current AM technology production systems was conducted. This documented the capabilities of each system in terms of build volume capacity, and minimum achievable geometric feature dimension. As AM materials are often specific to AM production systems, the survey also matched the AM materials to the corresponding AM production systems. The AM production system and material data gathered for this research was also used to define rues for the pseudo random design programme. The research concluded that the varying capabilities of AM systems can be used as a system of criteria for a rule based system, which could automate the process of analysing CAD parts for their suitability to be produced by certain AM systems. The research also finds that AM systems capabilities can also be used to constrain generative design programmes to certain AM systems, allowing the creation of pseudo random designs of object that are specific to certain AM systems. The key findings of the research have shown that gaps in empirical data regarding AM material characteristics prevent a material selection system based on comparative analysis. With current levels of available material knowledge, a more suitable system uses previous examples of AM applications in a case based structure as a metric for material suitability
47
Oosthuizen, Marita. "Integrating methodologies to develop a blended learning computer literacy programme for South African students." Thesis, [Welkom?] : Central University of Technology, Free State, 2004. http://hdl.handle.net/11462/55.
Full textAbstract:
Thesis (D. Tech.) - Central University of Technology, Free State, 2004For some years, proponents of distance and online learning have touted the efficacy of their methods, while traditionalists have argued the superiority of face-to-face learning environments. Each side in this debate has pointed to strengths in their own methodologies, while criticising the lack of comparable features in the methodologies of their opponents. Blended learning, as the name implies, allows practitioners to combine traditional education with a variety of instructional technologies – solving the argument by joining forces, and creating a better overall product as a result. With this study the researcher aims to explain the concepts of blended learning and discuss the factors that make each form of educational delivery successful. The thesis addresses the necessary components of a computer literacy programme and Outcomes-Based Education, as well as elaborate on good teaching principles. These strands of research are then combined into the foundations for a unique programme, to deliver a computer literacy course using blended learning techniques to South African students. The programme was developed, implemented and tested through three cycles of action research.
48
Sins, Patrick Henricus Maria. "Students' reasoning during scientific computer-based modeling the impact of epistemology, motivation and communication mode /." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2006. http://dare.uva.nl/document/22567.
Full text
49
Prather, James. "Beyond Automated Assessment: Building Metacognitive Awareness in Novice Programmers in CS1." Diss., NSUWorks, 2018. https://nsuworks.nova.edu/gscis_etd/1030.
Full textAbstract:
The primary task of learning to program in introductory computer science courses (CS1) cognitively overloads novices and must be better supported. Several recent studies have attempted to address this problem by understanding the role of metacognitive awareness in novices learning programming. These studies have focused on teaching metacognitive awareness to students by helping them understand the six stages of learning so students can know where they are in the problem-solving process, but these approaches are not scalable. One way to address scalability is to implement features in an automated assessment tool (AAT) that build metacognitive awareness in novice programmers. Currently, AATs that provide feedback messages to students can be said to implement the fifth and sixth learning stages integral to metacognitive awareness: implement solution (compilation) and evaluate implemented solution (test cases). The computer science education (CSed) community is actively engaged in research on the efficacy of compile error messages (CEMs) and how best to enhance them to maximize student learning and it is currently heavily disputed whether or not enhanced compile error messages (ECEMs) in AATs actually improve student learning. The discussion on the effectiveness of ECEMs in AATs remains focused on only one learning stage critical to metacognitive awareness in novices: implement solution. This research carries out an ethnomethodologically-informed study of CS1 students via think-aloud studies and interviews in order to propose a framework for designing an AAT that builds metacognitive awareness by supporting novices through all six stages of learning. The results of this study provide two important contributions. The first is the confirmation that ECEMs that are designed from a human-factors approach are more helpful for students than standard compiler error messages. The second important contribution is that the results from the observations and post-assessment interviews revealed the difficulties novice programmers often face to developing metacognitive awareness when using an AAT. Understanding these barriers revealed concrete ways to help novice programmers through all six stages of the problem-solving process. This was presented above as a framework of features, which when implemented properly, provides a scalable way to implicitly produce metacognitive awareness in novice programmers.
50
Clelland, Neil. "Use of computed tomography based predictors of meat quality in sheep breeding programmes." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/20379.
Full textAbstract:
One of the main drivers influencing consumers in the purchasing of red meat is the level of visible fat, and this is particularly important in lamb, with lamb often being perceived as fatty. Consumer-driven preference for leaner meat, coupled with the meat processing industries preference for a reduction in carcass fat, increasing lean meat yield and reducing waste, have led to continued selection for lean growth and reduced fatness in several meat producing species The perception of lamb being fatty could be directly targeted in isolation by reducing overall fat levels, however there are related effects on meat (eating) quality, and the combined improvement and consistency of meat (eating) quality and the reduction of overall fatness is more complicated. It is apparent that fat content plays a significant role in meat (eating) quality. Generally four major fat depots are recognised in animal carcasses, these are: subcutaneous (under the skin); internal organ associated; intermuscular (between muscles and surrounding muscle groups); and intramuscular (marbling, between muscle fibres), the latter generally regarded as having the greatest association with meat (eating) quality. X-ray computed tomography (CT) can measure fat, muscle and bone in vivo in sheep and CT predictions of carcass composition have been used in commercial UK sheep breeding programmes over the last two decades. Together with ultrasound measures of fat and muscle depth in the loin region, CT measured carcass fat and muscle weights have contributed much to the success of breeding for leaner carcasses and increased lean meat yield. Recently it has also been considered that x-ray computed tomography provides the means to simultaneously estimate IMF and carcass fat in vivo. Thus the aim of this project is to investigate the use of two and three-dimensional x-ray computed tomography techniques in the estimation of meat (eating) quality traits in sheep, and to further investigate the genetic basis of these traits and the possibility of their inclusion into current breeding programmes. The primary approach was the use of two-dimensional x-ray computed tomography, determining the most accurate combination of variables to predict IMF and mechanical shear force in the loin. The prediction of mechanical shear force was poor with accuracies ranging from Adj R2 0.03 – 0.14, however the prediction of IMF in the loin was more promising. CT predicted carcass fat weight accounted for a moderate amount of variation in IMF (R2 =0.51). These accuracies were significantly improved upon by including other information from the CT scans (i.e. fat and muscle densities, Adj R2 >0.65). Average muscle density in a single or multiple scans accounted for a moderate amount of the variation in IMF (Adj R2 = 0.51-0.60), and again accuracies R2 >0.65 were achieved, independent of CT-measured fat areas or predicted fat weights. Similar results were achieved with the use of three-dimensional CT scanning techniques (Adj R2 0.51 – 0.71), however, there was a dramatically increased requirement for image analysis when compared to two-dimensional techniques, and the increase in accuracy was not significant. This suggests that the current method of two-dimensional image capture is sufficient in the estimation of IMF in vivo in sheep. The prediction equations developed as part of this work were applied across divergent breed types (Texel, Scottish Blackface and Texel cross mule), to investigate the transferability of the prediction equations directly across to other breeds of sheep. As part of this study, the IMF levels across the breed types and sexes were also compared and found that IMF was significantly affected by breed type (P<0.001) with Scottish Blackface lambs having higher levels of IMF when compared to Texel cross mule lambs, and the lowest levels of IMF were in the purebred Texel lambs at the same liveweight or similar levels of carcass fatness. Sex also had a significant effect on IMF across breeds (P<0.001) with females having higher levels of IMF at similar levels of both carcass fat and liveweight, and within breed, females had significantly higher levels of IMF in both the purebred Texel and Scottish Blackface lambs, when compared at similar levels of carcass fat and liveweight (P<0.05). Using the models previously developed in purebred Texel to predict IMF in the Scottish Blackface and Texel cross mule, accuracies were found to be R2 = 0.57 – 0.64 and R2 = 0.37 – 0.38 respectively. Providing evidence that the equations are transferable across to some breeds more successfully than others, however, given that there is currently no method of accurately estimating IMF in vivo, accuracies across to both breeds are acceptable. The genetic parameter estimation was unsuccessful using the same research-derived dataset as previously employed in the study. However the ambition was always to investigate the genetic relationships between traits in a large industry dataset, exploiting the wealth of commercial CT information available. These investigations were considerably more successful, and among the first to present genetic parameters of novel CT-derived IMF estimates. The results found moderate heritability estimates of h2 0.31 and 0.36 for the final selected prediction equations, with clear indications that one model not including CT predicted carcass fat or any other fat measures, was more independent of these measures and the two separate prediction methods were highly genetically correlated with each other (rg = 0.89). The results from this study show that not only is it possible to accurately estimate IMF levels in the loin of Texel sheep using CT scanning, but that, until breed specific predictions are developed, the methods developed in this study are transferable across some breed types. The results also show that CT predicted IMF is heritable, independent of overall fatness and has the potential to be included in current breeding programmes. These findings can now be used to develop breeding programmes which enable breeders to make the best use of CT scanning technology to improve carcass composition while maintaining or possibly improving aspects of meat (eating) quality.