Dissertations / Theses on the topic 'Object-oriented programming (C'

Gameplay programming is vital for video game development and benefits from good tools and techniques. However, techniques are still used in the industry that involves describing how the computer operates. Reactive programming is a way to describe eventful and stateful computer programs declaratively, focusing on what the program should accomplish. This thesis uses the reactive library UniRx with the game engine Unity 5 to create an FPS with reactive techniques, and discusses the advantages and disadvantages of these. Object-oriented reactive programming is used to combine reactive objects with Unity’s component-based framework without using wrappers for non-reactive objects. The results include static methods for observable user input, patterns when defining game components with reactive content, and communication between game objects through interface components. It can be concluded that reactive programming for game programming enables the programmer to describe and understand game logic in a declarative manner. However, combining UniRx and Unity 5 led to complex patterns. Suggestion for future work is using reactive programming with game engines that allows to design game objects that are fully reactive.
Gameplay-programmering är avgörande för utveckling av videospel och har nytta av bra verktyg och tekniker. Dock används tekniker i spelbranschen som kräver att programmeraren beskriver hur datorn utför uppgifter. Reaktiv programmering är ett sätt att beskriva händelserika och föränderliga datorprogram med fokus på vad programmet ska utföra. Denna avhandling använder det reaktiva biblioteket UniRx med spelmotorn Unity 5 för att skapa en FPS med reaktiva tekniker, samt diskuterar fördelarna och nackdelarna med dessa. Objektorienterad reaktiv programmering används för att kombinera reaktiva objekt med Unity’s komponentbaserade ramverk utan att använda wrappers för icke-reaktiva objekt. Resultaten inkluderar statiska metoder för observerbar användarinput, programmeringsmönster för definition av spelkomponenter med reaktivt innehåll och kommunikation mellan spelobjekt via gränssnittskomponenter. Man kan dra slutsatsen att reaktiv programmering för spelprogrammering gör det möjligt för programmeraren att beskriva och förstå spellogik på ett deklarativt sätt. Kombinationen av UniRx och Unity 5 ledde emellertid till komplexa mönster. Förslag till framtida arbete är att använda reaktiv programmering med spelmotorer som gör det möjligt att designa spelobjekt som är helt reaktiva.

Im Rahmen der Arbeit in der damaligen DFG-Forschungsgruppe ¨Scientific Parallel Computing¨ wurde ein hierarchischer paralleler Netzgenerator fuer das Finite-Elemente- Programmpaket SPC-PM CFD unter dem Namen NETGEN69 entwickelt. Als Programmiersprache wurde seinerzeit - wie auch in den FEM-Programmen selbst - FORTRAN benutzt. Im Rahmen des Teilprojektes B2 im Sonderforschungsbereich 393 bestand nunmehr die Aufgabe, den Netzgenerator in ein objektorientiertes Layout zu fassen und in C++zu implementieren. Die Beschreibung von Ein- und Ausgabedaten kann in [3] nachgelesen werden. Die Form der Eingabedaten hat sich aus Kompatibilitaetsgruenden nicht geaendert und wird auch in Zukunft so beibehalten werden. Auch das der Assemblierung und FEM-Rechnung zuge- wandte Interface wurde vorerst nicht geaendert. Ein Wrapper, der fuer die Generierung der erwarteten Ausgabedaten aus den netzgeneratoreigenen Datenbestaenden sorgt, ist derzeit in Planung. Diese Lösung ist freilich nur voruebergehender Natur; sie ermoeglicht es uns, den Netzgenerator innerhalb der FEM-Bibliotheken zu testen.

The diploma thesis focuses on the development of an automated integration testing tool for a company. The tool is employed to detect and report data changes that may have been caused by the modification of a database schema during the development of a software. This automation of recognizing data changes brings many advantages to the company. The tool has been developed using the C# programming language, which supports object-oriented programming, using the Microsoft Visual Studio Community 2019 software. Since the tool works with the Microsoft SQL Server database, Entity Framework, an object-relational mapping framework, has been used during the implementation of the tool.

Bibliography: leaves 173-184. This thesis describes Visor++, a tool for visualising programs written in CC++, a task-parallel, object-orientated language derived from C++. Visor++ provides a framework of visualising task-parallel object-orientated programs in the absence of language support for visualisation, i.e. for programs such as CC++ which are written in languages which are not "visualisation-conscious". The development of techniques using a wide selection of language features are described and the effectiveness testified by experimentation.

Thesis (Ph. D.)--College of Computing, Georgia Institute of Technology, 2005. Directed by Yannis Smaragdakis.
Spencer Rugaber, Committee Member ; Olin Shivers, Committee Member ; Mary Jean Harrold, Committee Member ; Yannis Smaragdakis, Committee Chair ; Philip Wadler, Committee Member. Includes bibliographical references.

When exploring a verification approach for Komatsu Forest's control system regarding their forest machines (Valmet), the context of soft real-time systems is illuminated. Because of the nature of such context, the verification process is based on empirical corroboration of requirements fulfillment rather than being a formal proving process.

After analysis of the literature with respect to the software testing field, two paradigms have been defined in order to highlight important concepts for soft real-time systems. The paradigms are based on an abstract stimuli/response model, which conceptualize a system with inputs and output. Since the system is perceived as a black box, its internal details are hidden and thus focus is placed on a more abstract level.

The first paradigm, the “input data paradigm”, is concerned about what data to input to the system. The second paradigm, the “input data mechanism paradigm” is concerned about how the data is sent, i.e. the actual input mechanism is focused. By specifying different dimensions associated with each paradigm, it is possible to define their unique characteristics. The advantage of this kind of theoretical construction is that each paradigm creates an unique sub-field with its own problems and techniques.

The problems defined for this thesis is primarily focused on the input data mechanism paradigm, where devised dimensions are applied. New verification techniques are deduced and analyzed based on general software testing principles. Based on the constructed theory, a test system architecture for the control system is developed. Finally, an implementation is constructed based on the architecture and a practical scenario. Its automation capability is then assessed.

The practical context for the thesis is a new simulator under development. It is based upon LabVIEW and PXI technology and handles over 200 I/O. Real machine components are connected to the environment, together with artificial components that simulate the engine, hydraulic systems and a forest. Additionally, physical control sticks and buttons are connected to the simulator to enable user testing of the machine being simulated.

The results associated with the thesis is first of all that usable verification techniques were deduced. Generally speaking, some of these techniques are scalable and are possible to apply for an entire system, while other techniques may be appropriate for selected subsets that needs extra attention. Secondly, an architecture for an automated test system based on a selection of techniques has been constructed for the control system.

Last but not least, as a result of this, an implementation of a general test system has been possible and successful. The implemented test system is based on both C# and LabVIEW. What remains regarding the implementation is primarily to extend the system to include the full scope of features described in the architecture and to enable result analysis.

Då verifikationstekniker för Komatu Forests styrsystem utreds angående Valmet skogsmaskiner, hamnar det mjuka realtidssystemkontextet i fokus. Ett sådant kontext antyder en process där empirisk styrkning av kravuppfyllande står i centrum framför formella bevisföringsprocesser.

Efter en genomgång och analys av litteratur för mjukvarutestområdet har två paradigmer definierats med avsikten att belysa viktiga concept för mjuka realtidssystem. Paradigmerna är baserade på en abstrakt stimuli/responsmodell, som beskriver ett system med in- och utdata. Eftersom detta system betraktas som en svart låda är inre detaljer gömda, vilket medför att fokus hamnar på ett mer abstrakt plan.

Det första paradigmet benämns som “indata-paradigmet” och inriktar sig på vilket data som skickas in i systemet. Det andra paradigmet går under namnet “indatamekanism-paradigmet” och behandlar hur datat skickas in i systemet, dvs fokus placeras på själva inskickarmekanismen. Genom att definiera olika

dimensioner för de två paradigmen, är det möjligt att beskriva deras utmärkande drag. Fördelen med att använda denna teoretiska konstruktion är att ett paradigm skapar ett eget teoriområde med sina egna frågeställningar och tekniker.

De problem som definierats för detta arbete är främst fokuserade på indatamekanism-paradigmet, där framtagna dimensioner tillämpas. Nya verifikationstekniker deduceras och analyseras baserat på generella mjukvarutestprinciper. Utifrån den skapade teorin skapas en testsystemarkitektur för kontrollsystemet. Sedan utvecklas ett testsystem baserat på arkitekturen samt ett praktiskt scenario med syftet att utreda systemets automationsgrad.

Den praktiska miljön för detta arbete kretsar kring en ny simulator under utveckling. Den är baserad på LabVIEW och PXI-teknik och hanterar över 200 I/O. Verkliga maskinkomponenter ansluts till denna miljö tillsammans med konstgjorda komponenter som simulerar motorn, hydralik samt en skog. Utöver detta, ansluts styrspakar och knappar för att möjliggöra användarstyrning av maskinen som simuleras.

Resultatet förknippat med detta arbete är för det första användbara verifikationstekniker. Man kan generellt säga att några av dessa tekniker är skalbara och därmed möjliga att tillämpa för ett helt system. Andra tekniker är ej skalbara, men lämpliga att applicera på en systemdelmängd som behöver testas mer utförligt.

För det andra, en arkitektur har konstruerats för kontrollsystemet baserat på ett urval av tekniker. Sist men inte minst, som en följd av ovanstående har en lyckad implementation av ett generellt testsystem utförts. Detta system implementerades med hjälp av C# och LabVIEW. Det som återstår beträffande implementationen är att utöka systemet så att alla funktioner som arkitekturen beskriver är inkluderade samt att införa resultatanalys.

Cette these traite d'un modele de programmation dedie a la programmation orientee objet dans les systemes distribues. Le modele propose est appele d-hector et il permet d'etendre un langage oriente objet sequentiel a la programmation parallele et distribuee. Celui-ci apporte la notion de classes distribuables a partir desquelles il est possible d'instancier des objets distribues. Le modele d-hector a ete concu selon l'idee qu'il est possible de separer les classes distribuables en trois composants fondamentaux. Il s'agit des classes fonctionnelles (attributs et methodes), des classes de synchronisation et des classes de configuration. L'utilisation du concept d'objet avec heritage a permis de definir des hierarchies specifiques aux trois genres de composants. Les classes fonctionnelles sont les classes telles qu'elles sont connues dans les langages orientes objet imperatifs et servent a la description des fragments d'objets appeles representants. Les classes de synchronisation sont dediees a la synchronisation des objets distribues. Les classes de configuration sont l'originalite principale de ce travail. Les classes de configuration definissent la configuration dynamique d'objets distribues et leur routage associe a l'aide d'un systeme de regles d'evolution. Une implantation du modele d-hector s'appuyant sur le langage c++ est presentee. Cette implantation a necessite l'ecriture en c++ d'un noyau d'execution distribue utilisant un haut degre de parallelisme et de distribution

This MSc Thesis is focused on the multimodeling area, especially on the cooperation of the C++ language and the Prolog language. The recent research is established on my semester study, which also dealt with the multimodeling area. During this research a prototype of interconnection library for cooperation of above mentioned programming languages was developed. This prototype of the library was finished within the scope of this thesis and some case-studies were created, too, using also another simulation library - SIMLIB/C++. These case-studies have their focus in the problems of artificial intelligence. The main benefit of this thesis is the confrontation of methods with and without using artificial intelligence.

Cette thèse est une partie d’un projet français qui s’appelle AEROSTRIP, un partenariat entre l’Institut Pascal, Sigma, SAPPI et Air-France industries, il est financé par le gouvernement français par le programme FUI (20 eme appel). Le projet AEROSTRIP consiste à développer le premier système automatique qui nettoie écologiquement les surfaces des avions et les pièces de rechange en utilisant un abrasif écologique projeté à grande vitesse sur la surface des avions (maïs). Ma thèse consiste à optimiser les trajectoires du système robotique total de telle façon que le décapage de l’avion soit optimal. Le déplacement des robots est nécessaire pour assurer une couverture totale de la surface à décaper parce que ces surfaces sont trop grandes et elles ne peuvent pas être décapées d’une seule position. Le but de mon travail est de trouver le nombre optimal de robots avec leur positions optimales pour décaper totalement l’avion. Une fois ce nombre est déterminé, on cherche les trajectoires des robots entre ces différentes positions. Alors, pour atteindre ce but, j’ai défini un cadre général composant de quatre étapes essentiels: l’étape pre-processing, l’étape optimization algorithm, l’étape generation of the end-effector trajectories et l’étape robot scheduling, assignment and control.Dans ma thèse, j’ai deux contributions dans deux différentes étapes du cadre général: l’étape pre-processing et l’étape optimization algorithm. Le calcul de l’espace de travail du robot est nécessairedans l’étape pre-processing: on a proposé l’Analyse par Intervalles pour trouver cet espace de travail parce qu’il garantie le fait de trouver des solutions dans un temps de calcul raisonnable. Alors, ma première contribution est une nouvelle fonction d’inclusion qui réduit le pessimisme, la surestimation des solutions qui est le principal inconvénient de l’Analyse par Intervalles. La nouvelle fonction d’inclusion est évaluée sur des problèmes de satisfaction de contraintes et des problèmes d’optimisation des contraintes. En plus, on a proposé un algorithme d’optimisation hybride pour trouver le nombre optimal de robots avec leur positions optimales: c’est notre deuxième contribution qui est dans l’étape optimization algorithm. Pour évaluer l’algorithme d’optimisation, on a testé cet algorithme sur des surfaces régulières, comme un cylindre et un hémisphère, et sur un surface complexe: une voiture
This PHD is a part of a French project named AEROSTRIP, (a partnership between Pascal Institute,Sigma, SAPPI, and Air-France industries), it is funded by the French Government through the FUIProgram (20th call). The AEROSTRIP project aims at developing the first automated system thatecologically cleans the airplanes surfaces using a process of soft projection of ecological media onthe surface (corn). My PHD aims at optimizing the trajectory of the whole robotic systems in orderto optimally strip the airplane. Since a large surface can not be totally covered by a single robot base placement, repositioning of the robots is necessary to ensure a complete stripping of the surface. The goal in this work is to find the optimal number of robots with their optimal positions required to totally strip the air-plane. Once found, we search for the trajectories of the robots of the multi-robot system between those poses. Hence, we define a general framework to solve this problem having four main steps: the pre-processing step, the optimization algorithm step, the generation of the end-effector trajectories step and the robot scheduling, assignment and control step.In my thesis, I present two contributions in two different steps of the general framework: the pre-processing step, the optimization algorithm step. The computation of the robot workspace is required in the pre-processing step: we proposed Interval Analysis to find this workspace since it guarantees finding solutions in a reasonable computation time. Though, our first contribution is a new inclusion function that reduces the pessimism, the overestimation of the solution, which is the main disadvantage of Interval Analysis. The proposed inclusion function is assessed on some Constraints Satisfaction Problems and Constraints Optimization problems. Furthermore, we propose an hybrid optimization algorithm in order to find the optimal number of robots with their optimal poses: it is our second contribution in the optimization algorithm step. To assess our hybrid optimization algorithm, we test the algorithm on regular surfaces, such as a cylinder and a hemisphere, and on a complex surface: a car

碩士
國立中央大學
數學研究所
92
In this paper,we use c++ object-oriented programming to design our program. We use OOP to solve conjugate gradient method in sparse matrix. we introduce severn sparse matrix format in this paper . And using MPI libery to parallel our program in PC Cluster . Then we analysis these result of data.

碩士
臺灣大學
資訊工程學研究所
91
The increasing popularity of embedded systems and wireless communication device drives the need for low power design. Software has become one of the critical roles of these systems. In the past low power software design only focused on the optimization of C program, however, Object-Oriented Programming (OOP) provides significant improvement for programs writing and generality. But power analysis of object-oriented programming style has not yet been explored deeply. In this thesis, we propose a way to compute the energy cost of OOP. The purpose of this thesis is to explore the power analysis of OOP style. From the experimental results, C++ can save power dissipation up to 5.12% and 17.18% of execution time compared with the C language. This analysis can be used to guide the selecting low power software for embedded systems.

The purpose of this qualitative study was to describe how novice students solved computer programming problems in a beginning college level computer science (CS) course with an introduction to object-oriented programming (OOP) and what knowledge they obtained about OOP and computer problem solving (CPS) as a result of their experiences. Additionally, this descriptive study attempted to characterize the instruction provided to students in a beginning CS course as well as students' CPS strategies. An introduction to computer science class at the college level was selected for the sample. One experienced instructor and four students participated in this study. Data were collected through classroom observations, interviews with the instructor and students, classroom documents and researcher's journals. The analysis of the results revealed a teacher-centered instruction focused on syntactical details with an emphasis on the imperative paradigm and an introduction to object-oriented aspects of the C++ language. Results revealed that to develop the solution code for the given problems, students consistently approached them without a comprehensive written plan/design. The process students typically used in developing a solution for the given computer problem involved: (1) problem understanding, (2) preliminary problem analysis, (3) reliance on examples and (4) trial-and-error. Students typically approached debugging syntax and logic errors by (1) following the compiler generated messages, (2) using trial-and-error, (3) performing a desk-check strategy and (4) using the VISUAL C++ debugger. This study identified the features of CPS and OOP learning that can be studied for identifying how students approach CPS and OOP processes in other object-oriented languages (such as JAVA) and how their CPS and OOP processes develop as compared to C++. Differences in programming performances were found among males and females. Males in this study were more comfortable with the mechanical-orientation of programming as compared with their female counterparts. Future research is needed in CPS and OOP to explore gender issues in learning OOP languages. This study identified potential student CPS and OOP learning processes and factors using a qualitative approach. Future research should investigate the factors effecting introductory CS problem solving using a quantitative methodology or perhaps a combination of qualitative and quantitative approaches.
Graduation date: 2003

碩士
國立成功大學
資訊工程學系研究所
84
Developing A Fully OOPS (Object-Oriented Programming Style) -PreservedC omputing System for Distributed C++ Applications Fu-Jen Wang* Chih-Ping Ch u** Institute of Information Engineering National Chen Kung University Tainan, Taiwan, R.O.C . Abstract The rapid progress on computer te chnology has led to the large demand of distributed application systems. The distributed object-oriented computing environment provides the advantages of distributed computing and object- oriented programming, being especially usef ul for developing distributed application software. However, currently severa l existing distributed object- oriented computing systems at user level fail to fully support object*s features, such as encapsulation, polymorphism, inhe ritance and virtual function, in object-oriented programming. Programmers the refore cannot completely utilize the features of object to develop distribute d systems. In this thesis, we propose a fully OOPS(Object-Oriented Programm ing Style)- preserved computing system for Distributed C++ applications. The proposed system is developed at user level without the need to modify the ope rating system. We impose a virtual centralized computing environment and use multi- thread technique to preserve the object*s features in distributed envi ronment. The prototype of the system has shown the proposed techniques are ef fective. * author ** advisor

Based on our experience of working with different C++ front ends, this thesis identifies numerous problems that complicate the analysis of C++ programs along the entire spectrum of analysis applications. We utilize library, language, and tool extensions to address these problems and offer solutions to many of them. In particular, we present efficient, expressive and non-intrusive means of dealing with abstract syntax trees of a program, which together render the visitor design pattern obsolete. We further extend C++ with open multi-methods to deal with the broader expression problem. Finally, we offer two techniques, one based on refining the type system of a language and the other on abstract interpretation, both of which allow developers to statically ensure or verify various run-time properties of their programs without having to deal with the full language semantics or even the abstract syntax tree of a program. Together, the solutions presented in this thesis make ensuring properties of interest about C++ programs available to average language users.

This dissertation investigates the role of specification, refinement and implementation in the software development cycle. Both the structured and object-oriented paradigms are looked at. Particular emphasis is placed on the role of the refinement process. The requirements for the product (system) are determined, the specifications are drawn up, the product is designed, specified, implemented and tested. The stage between the (formal) specification of the system and the implementation of the system is the refinement stage. The refinement process consists out of data refinement, operation refinement, and operation decomposition. In this dissertation, Z, Object-Z and UML (Unified Modelling Language) are used as specification languages and C, C++, Cobol and Object-Oriented Cobol are used as implementation languages. As an illustration a small system, The ITEM System, is specified in Z and UML and implemented in Object-Oriented Cobol.
Computing
M. Sc. (Information Systems)