Дисертації з теми "Degree Discipline: Computer Science"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-36 дисертацій для дослідження на тему "Degree Discipline: Computer Science".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Hollingsworth, Joseph Eugene. "Software component design-for-reuse : a language-independent discipline applied to ada /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487778663285694.
Повний текст джерелаKong, Chiu Ming. "Generating rooted triangulations with minimum degree four." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23903.
Повний текст джерелаIn this thesis, we show that in the set of rooted triangulations on n points with minimum degree four, there exists a target triangulation $E sbsp{n}{ *}$ such that any other triangulation $E sb{n} not=E sbsp{n}{ *}$ in the set can be transformed to $E sbsp{n}{ *}$ via a finite sequence of single and double diagonal transformations. Using this result with the reverse search technique, we present an algorithm for generating all non-isomorphic rooted triangulations on n points with minimum degree four. The triangulations are produced without repetitions in $O(n sp2)$ time per triangulation. The algorithm uses $O(n)$ space.
Kornblum, Jesse Dan 1975. "Revising the MIT degree audit." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80247.
Повний текст джерелаYoshikawa, Chad O. "Galaxy: Adaptive Client-Server Load Balancing on Bounded-Degree Network Overlays." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1214500610.
Повний текст джерелаPetre, Marian. "Computing is not a spectator sport : rethinking how we introduce our discipline to students." Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6504/.
Повний текст джерелаZatloukal, Kevin C. (Kevin Chaffee). "A degree-optimal, ordered peer-to-peer overlay network." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34117.
Повний текст джерелаIncludes bibliographical references (leaves 93-96).
Peer-to-peer overlay networks are structures for organizing nodes, routing traffic, and searching for data in a distributed system. Two of the most important theoretical advancements in this area were the development of degree-optimal and ordered networks. Prior to this work, it was not known whether both properties could be achieved simultaneously. This thesis presents Family Trees, the first peer-to-peer overlay network that is both degree-optimal and ordered. We develop Family Trees theoretically, proving correctness and bounds on their performance. We also describe how Family Trees can be optimized to improve latency and discuss the results of an experimental study showing that Family Trees provide good performance in practice.
by Kevin C. Zatloukal.
S.M.
Massie, Thomas Harold. "Design of a three degree of freedom force-reflecting haptic interface." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/11281.
Повний текст джерелаRodkin, John J. (John Jay). "A wireless link to a six degree of freedom inertial tracker." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/38784.
Повний текст джерелаSrivastava, Vikesh. "Bias : bioinformatics integrated application software, design and implementation which was written as part of my masters degree requirements." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81442.
Повний текст джерелаHelmy, Ahmed. "Parallel processing and the dynamics and kinematics of a three degree of freedom planar manipulator." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=69796.
Повний текст джерелаParallel processing systems are introduced and analysed for this application. A parallel microcomputer system is used and a new method of direct kinematics for displacement analysis is implemented. The selected microcomputer system is integrated in an IBM 286 compatible personal computer.
Finally, a parallel software program is implemented, which allows for efficient control of three actuators driving the three degree of freedom planar manipulator. Hence, introducing a new processing method for the control of this manipulator.
Villora, Narasiman C. "Distributed degree-constrained application-level multicast tree: A partitioning approach." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1205964934.
Повний текст джерелаIngvast, Pelle. "Analysis of the online Swedishpolitical discourse Thesis report for Degree Project C in Computer Science." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-432152.
Повний текст джерелаHELMICK, MICHAEL T. "EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM." University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750.
Повний текст джерелаFlorén, Mikael. "Approximation of Max-Cut on Graphs of Bounded Degree." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189143.
Повний текст джерелаMax-Cut-problemet är ett välkänt NP-svårt problem, för vilket ett flertal olika approximationsalgoritmer har utvecklats över åren. I det här arbetet undersöks specialfallet då grafens noder har begränsat gradtal. Med mindre förändringar av existerande algoritmer lyckas vi uppnå en förbättrad approximationskvot för generella gradtals-begränsade grafer. Vi visar också ytterligare förbättringar för grafer med minst en konstant andel noder med udda gradtal. Vi identifierar också några andra möjliga områden för förbättring i det allmänna gradtals-begränsade fallet.
Farquhar, Cynthia Patrice. "An empirical study: Usage of the Unified Modeling Language in the Bachelor of Science and Master of Science degree programs at California State University, San Bernardino." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2929.
Повний текст джерелаWade, Eric R. (Eric Randolph) 1978. "DC powerline communication system using a transmission line transformer for high degree of freedom applications." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/27144.
Повний текст джерелаIncludes bibliographical references (leaf 51).
A new type of powerline communication is developed to reduce cable requirements for robotic, electromechanical, and vehicular systems. A DC power bus line connecting a DC power supply to motor drives and sensor units is used for transmitting both data and DC power. Unlike conventional AC powerline communication, the DC power bus provides amenable and predictable noise characteristics and desirable impedance characteristics that allow for large fanout and high bandwidth. First the basic architecture of DC powerline communication is presented, followed by verification of the feasibility of using a DC power bus as a communication medium. A high-fanout modem is then designed using a Guanella type transmission line transformer (TLT). The modem characteristics including high-frequency parasitic dynamics are analyzed, and the overall line impedance and signal attenuation are evaluated as the number of nodes goes to infinity. A prototype DC powerline communication system is then designed, built, and tested. The serial windings and special resonance characteristics of TLT coupled with a capacitor are exploited to minimize attenuation in high fanout systems. As a result the prototype modem can broadcast data to more than 100 nodes simultaneously.
by Eric R. Wade.
S.M.
Bhaduri, Sudipta. "Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783.
Повний текст джерелаMcDonald, Charles L. Jr. "Factors Affecting Student enrollment and Retention in the Master of Science in Management Information Systems Degree Offered by Nova Southeastern University." NSUWorks, 1996. http://nsuworks.nova.edu/gscis_etd/713.
Повний текст джерелаRagsdale, Scott. "Pursuing and Completing an Undergraduate Computing Degree from a Female Perspective| A Quantitative and Qualitative Analysis." Thesis, Nova Southeastern University, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3565811.
Повний текст джерелаThe computing profession in the United States would benefit from an increasingly diverse workforce, specifically a larger female presence, because a more gender-balanced workforce would likely result in better technological solutions to difficulties in many areas of American life. However, to achieve this balance, more women with a solid educational foundation in computing need to enter the computing workplace. Yet a common problem is most colleges and universities offering computer-related degrees have found it challenging to attract females to their programs. Also, the women who begin a computing major have shown a higher tendency than men to leave the major. The combination of these factors has resulted in a low percentage of females graduating with a computing degree, providing one plausible explanation for the current gender imbalance in the computing profession.
It is readily apparent that female enrollment and retention must be improved to increase female graduation percentages. Although recruiting women into computing and keeping them in it has been problematic, there are some who decide to pursue a computer-related degree and successfully finish. The study focused on this special group of women who provided their insight into the pursuit and completion of an undergraduate computing degree. It is hoped that the knowledge acquired from this research will inspire and encourage more women to consider the field of computing and to seek an education in it. Also, the information gathered in this study may prove valuable to recruiters, professors, and administrators in computing academia. Recruiters will have a better awareness of the factors that direct women toward computing, which may lead to better recruitment strategies. Having a better awareness of the factors that contribute to persistence will provide professors and administrators with information that can help create better methods of encouraging females to continue rather than leave. The investigation used a sequential explanatory methodology to explore how a woman determined to pursue an undergraduate computing major and to persevere within it until attaining a degree.
Xiong, Fanfan. "Resource Efficient Parallel VLDB with Customizable Degree of Redundancy." Diss., Temple University Libraries, 2009. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/43445.
Повний текст джерелаPh.D.
This thesis focuses on the practical use of very large scale relational databases. It leverages two recent breakthroughs in parallel and distributed computing: a) synchronous transaction replication technologies by Justin Y. Shi and Suntain Song; and b) Stateless Parallel Processing principle pioneered by Justin Y. Shi. These breakthroughs enable scalable performance and reliability of database service using multiple redundant shared-nothing database servers. This thesis presents a Functional Horizontal Partitioning method with customizable degree of redundancy to address practical very large scale database applications problems. The prototype VLDB implementation is designed for transparent non-intrusive deployments. The prototype system supports Microsoft SQL Servers databases. Computational experiments are conducted using industry-standard benchmark (TPC-E).
Temple University--Theses
Charbachi, Peter, and Linus Eklund. "Thesis for the Degree of Bachelor of Science in Computer Science by Peter Charbachi and Linus Eklund : PAIRWISE TESTING FOR PLC EMBEDDED SOFTWARE." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-32054.
Повний текст джерелаGordon, Donald James. "Encapsulation enforcement with dynamic ownership : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in Computer Science /." ResearchArchive@Victoria e-Thesis, 2008. http://hdl.handle.net/10063/624.
Повний текст джерелаNaparstek, Laurie Schwartz. "Comparing instructor self-perception versus student perceptions using the same teaching evaluation instrument: a study of computer science courses in an urban master's degree program." Thesis, Boston University, 2005. https://hdl.handle.net/2144/31989.
Повний текст джерелаPLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.
This study compares instructor self-perceptions with student perceptions of teaching quality using the same 16-item evaluation instrument. Three hypotheses were investigated: (1) Instructors' self-evaluations will be higher than those of their respective students; (2) The more similar student-instructor perceptions, the more likely instructors will receive a higher score compared to when student-instructor perceptions are more divergent; and (3) Students taking a course as a major requirement will be more critical of the instructor than those students taking the course as distribution requirement or an elective. A total of 1,524 individuals (1,452 graduate students and 72 instructors) in a part-time evening computer science program participated in the study of 79 courses over the spring and fall semesters of 1996. Overall, instructors generally perceived themselves more positively than their students, although statistically significant differences were observed for only three relevant items (involving grading fairness, presentation clarity and instructor enthusiasm) of the 16 items evaluated. Instructors whose perceptions were more similar to their students were generally rated higher than those instructors whose perceptions were more divergent from their students; however, the difference was not significant. Finally, contrary to the third hypothesis, the reason for taking a course did not have a significant effect on student ratings of the instructor.
2031-01-02
Levin, Anders, and Jörgen Johannesson. "Validation and verification of a third degree optimization method." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-25.
Повний текст джерелаDenna kombinerade magisteruppsats i matematik och datalogi handlar om en metod för att hitta ett lokalt minimum för en unimodal funktion inom ett intervall genom användning av ett femtegradspolynom. Femtegradspolynomet skapas med hjälp av interpolation baserad på funktionsvärdena samt första och andra derivatans värden i intervallets ändpunkter. I rapporten härleds matematiskt att metoden konvergerar, följt av ett bevis för att metoden konvergerar med en konvergenshastighet av tre. Slutligen testas metoden mot två referensmetoder för att se användningsbarheten. För detta beskrivs vissa mjukvaruutvecklingsmetoder och några teststrategier. Testen utförs med sex olika funktioner och med tre olika versioner av metoden. Slutsatserna från testen visar att metoden inte är bättre att använda än referensmetoderna även om den har högre konvergenshastighet samt att metoden måste ta hänsyn till när den bara hittar nya approximationer på ena sidan av intervallet. Vi kunde även se från testerna att ingen av metoderna var bra på att ge en korrekt approximation, utan det finns behov av säkrare metoder för detta. Det är därför föreslaget i uppsatsen att man borde försöka att hitta ett annat interpolations-polynom för att förbättra metoden. Man borde även testa mot en metod som har högre konvergenshastighet. För att kunna göra det behöver man titta på andra sätt att representera numeriska värden och det skulle kunna vara intressant för att se om man då skulle få ett annat resultat.
This combined master thesis in Mathematics and in Computer Science deals with a method for finding the local minimum of a unimodal function inside a given interval by using a fifth degree polynomial. This fifth degree polynomial is created from the function value and the first and second derivative values in the end-points of the interval. In this report the presented method is derived mathematically to converge and it is then proven that the method has a convergence rate of three. Last is the method tested against two reference methods to see the usefullness of the method. To do this some software development methods are described in the report and some test strategies are given. The tests are done with six different functions and with three different implementations of the method. The conclusions from the tests are that it is often better to use one of the referencemethods instead of the presented method, even if the presented method has a better convergence rate, and that the method needs to handle when the found approximation always is on one side of the interval. We could also see from the tests that none of the methods were good on finding a correct approximation. Therefore, there exist needs for more secure methods. It is therefore suggested in the report that a search for other interpolating functions ought to be carried out in order to improve the method. Also, it could be interesting to test against another method with even higher convergence rate. To do that, another numerical representation is needed and it would be interesting to see if that changes the outcome
Federici, Dominique. "Habilitation à Diriger des Recherches Discipline : Informatique Simulation Concurrente de Systèmes à Evénements Discret : Concepts et Applications." Habilitation à diriger des recherches, Université Pascal Paoli, 2006. http://tel.archives-ouvertes.fr/tel-00603867.
Повний текст джерелаBailey, Julian Donald. "The integration of hypermedia based learning applications into undergraduate engineering degree courses." Thesis, University of Southampton, 1996. https://eprints.soton.ac.uk/47544/.
Повний текст джерелаHargreaves, Megan H. "Evaluation of learning attributes of courseware for university science courses." Thesis, Queensland University of Technology, 2000. https://eprints.qut.edu.au/36646/1/36646_Digitised%20Thesis.pdf.
Повний текст джерелаWysoski, Simei Gomes. "Evolving spiking neural networks for adaptive audiovisual pattern recognition a thesis submitted to Auckland University of Technology in fulfilment of the requirements for the degree of Doctor of Philosophy (PhD), 2008." Click here to access this resource online, 2008. http://hdl.handle.net/10292/390.
Повний текст джерелаDuignan, Matthew. "Computer mediated music production : a study of abstraction and activity : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science /." ResearchArchive@Victoria e-Thesis, 2008. http://hdl.handle.net/10063/590.
Повний текст джерелаHuang, Bert. "Learning with Degree-Based Subgraph Estimation." Thesis, 2011. https://doi.org/10.7916/D8XG9Z41.
Повний текст джерелаLodha, Suresh Kumar. "Surface approximation by low degree patches with multiple representations." Thesis, 1993. http://hdl.handle.net/1911/16647.
Повний текст джерелаHowell, Kathy. "The culture of undergraduate computer science education : its role in promoting equity within the discipline." Thesis, 1996. http://hdl.handle.net/1957/37216.
Повний текст джерелаGraduation date: 1996
Boynton, James R. "Design and evaluation of a computer-simulated child patient submitted in partial fulfillment ... for the degree of Master of Science ... /." 2004. http://catalog.hathitrust.org/api/volumes/oclc/68962639.html.
Повний текст джерелаIrwin, Warwick. "Understanding and improving object-oriented software through static software analysis : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science in the University of Canterbury /." 2007. http://library.canterbury.ac.nz/etd/adt-NZCU20070628.161653.
Повний текст джерелаViolich, Stephen. "Fusing loopless algorithms for combinatorial generation : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science, University of Canterbury /." 2006. http://library.canterbury.ac.nz/etd/adt-NZCU20060331.165256.
Повний текст джерелаThompson, David. "Large-scale display interaction techniques to support face-to-face collaboration : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science in the University of Canterbury /." 2006. http://library.canterbury.ac.nz/etd/adt-NZCU20071015.124903.
Повний текст джерела