Orientador: Franco Giuseppe Dedini / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica / Made available in DSpace on 2018-08-22T04:27:38Z (GMT). No. of bitstreams: 1 Eckert_JonyJavorski_M.pdf: 14458146 bytes, checksum: b2eb0f5d4618d1873858f49c66965bec (MD5) Previous issue date: 2013 / Resumo: Dinâmica veicular é o estudo das interações entre o veículo, condutor e o ambiente bem como as reações de carga, sendo esta dividida em 3 grandes áreas: dinâmica longitudinal, vertical e lateral. Existem variações entre os métodos propostos pela literatura para o cálculo da dinâmica longitudinal do veículo, sendo que o objetivo deste trabalho é, por meio de simulações, compararem os resultados obtidos pelas diversas metodologias. Por meio de um modelo gerado com auxílio do programa de análise dinâmica de multicorpos Adams®, juntamente com o Simulink Matlab®, foram implementados os métodos de cálculo propostos pela literatura de forma a simular o comportamento de um veículo em função de uma demanda de potência gerada por meio do padrão de velocidades imposto pelos ciclos das normas brasileiras NBR6601 e NBR7024. Os resultados encontrados foram comparados por meio da correlação linear entre as curvas de torque resultantes do modelo dinâmico, possibilitando uma avaliação entre os resultados encontrados pelos diferentes métodos. Também foram avaliados o consumo de combustível, a influência da variação da massa do veículo e da estratégia de condução no comportamento dinâmico do veículo, bem como modelos complementares referentes a veículos híbridos e o efeito da adição de um modelo de embreagem no conjunto simulado / Abstract: Vehicular dynamics is the study of interactions between vehicle, driver and load reactions. The vehicular dynamics is divided into three areas: longitudinal, vertical and lateral. There are variations between the methods proposed in the literature to calculate the longitudinal dynamics of the vehicle. The purpose of this study is, through simulations; compare the results obtained by different methods. By means of a model generated by Adams® (Software of Multibody Dynamics Analysis) together with Simulink Matlab® were implemented the calculation methods proposed by literature to simulate the behavior of a vehicle according to a power demand resulting from the default speeds cycles required by Brazilian Standards NBR6601 and NBR7024. The results were compared using linear correlation between the couple curves resulting from the dynamic model, allowing an evaluation of the results reported by different methods. Were also evaluated: the fuel consumption and the influence of the mass vehicle variation, the driving strategy in the vehicle dynamic behavior, some complementary models of hybrid vehicles and the effect of add a clutch model / Mestrado / Mecanica dos Sólidos e Projeto Mecanico / Mestre em Engenharia Mecânica

This study seeks to explore relationships between Logo turtle graphics and visual literacy by addressing two related questions: (a) can traditional visual literacy concepts, as found in the published literature, be synthesized in terms of Logo turtle graphics, and (b) do the literature and "hands-on" experience with turtle graphics indicate that visual competencies are pertinent to graphics-based electronic communications in computer culture? The findings of this research illustrate that Logo turtle graphics is a self-contained model to teach visual literacy skills pertinent to computer culture. This model is drawn from synthesizing published literature and the classroom experience of Logo learners, which is demonstrated through their visual solutions to Logo assignments. A visual analysis and interpretation of the subjects' work concludes that the principles and competencies associated with traditional visual literacy skills manifest during the Logo turtle graphics experience. The subjects of this study demonstrate that visual literacy pertinent to computer culture includes reading, writing, and drawing alphanumerics and pictographic information with linguistic equivalence. The logic for this symbolic metaphor is body-syntonic spatial experience explained in geometric terms. The Logo learner employs computational models for visual ideas and visual-verbal symbols for spatial ideas in the course of doing turtle graphics.

Traditionally, connection management applications (referred to as patchbays) for high-speed audio networking, are predominantly developed using third-generation languages such as C, C# and C++. Due to the rapid increase in distributed audio/video network usage in the world today, connection management applications that control signal routing over these networks have also evolved in complexity to accommodate more functionality. As the result, high-speed audio networking application developers require a tool that will enable them to develop complex connection management applications easily and within the shortest possible time. In addition, this tool should provide them with the reliability and flexibility required to develop applications controlling signal routing in networks carrying real-time data. High-speed audio networks are used for various purposes that include audio/video production and broadcasting. This investigation evaluates the possibility of using Adobe Flash Professional 8, using ActionScript 2.0, for developing connection management applications. Three patchbays, namely the Broadcast patchbay, the Project studio patchbay, and the Hospitality/Convention Centre patchbay were developed and tested for connection management in three sound installation networks, namely the Broadcast network, the Project studio network, and the Hospitality/Convention Centre network. Findings indicate that complex connection management applications can effectively be implemented using the Adobe Flash IDE and ActionScript 2.0.

Thesis (M.Tech.: Computer Studies)-Dept. of Computer Science, Durban Institute of Technology, 2002. / Computer programming has been a science for approximately 50 years. It this time there havebeen two major paradigm shifts that have taken place. The first was from “spaghetti code” to structured programs. The second paradigm shift is from procedural programs to object oriented programs. The change in paradigm involves a change in the way in which a problem is approached, can be solved, as well as a difference in the language that is used. The languages that were chosen to be studied, are COBOL and Java. These programming languages were identified as key languages, and the languages that software development are the most reliant on. COBOL, the procedural language for existing business systems, and Java the object oriented language, the most likely to be used for future development. To complete this study, both languages were studied in detail. The similarities and differences between the programming languages are discussed. Some key issues that a COBOL programmer has to keep in mind when moving to Java were identified.

Thesis (MSc)--Stellenbosch University, 2013. / ENGLISH ABSTRACT: In this dissertation we present a software tool, Artemis, that symbolically executes Java virtual machine bytecode to find bugs and automatically generate test cases to trigger the bugs found. Symbolic execution is a technique of static software analysis that entails analysing code over symbolic inputs—essentially, classes of inputs—where each class is formulated as constraints over some input domain. The analysis then proceeds in a path-sensitive way adding the constraints resulting from a symbolic choice at a program branch to a path condition, and branching non-deterministically over the path condition. When a possible error state is reached, the path condition can be solved, and if soluble, value assignments retrieved to be used to generate explicit test cases in a unit testing framework. This last step enhances confidence that bugs are real, because testing is forced through normal language semantics, which could prevent certain states from being reached. We illustrate and evaluate Artemis on a number of examples with known errors, as well as on a large, complex code base. A preliminary version of this work was successfully presented at the SAICSIT conference held on 1–3 October 2012, in Centurion, South Africa. / AFRIKAANSE OPSOMMING: In die dissertasie bied ons ’n stuk sagtewaregereedskap, Artemis, aan wat biskode van die Java virtuele masjien simbolies uitvoer om foute op te spoor en toetsgevalle outomaties voort te bring om die foute te ontketen. Simboliese uitvoering is ’n tegniek van statiese sagteware-analise wat behels dat kode oor simboliese toevoere—in wese, klasse van toevoer—geanaliseer word, waar elke klas geformuleer word as beperkinge oor ’n domein. Die analise volg dan ’n pad-sensitiewe benadering deur die domeinbeperkinge, wat volg uit ’n simboliese keuse by ’n programvertakking, tot ’n padvoorwaarde by te voeg en dan nie-deterministies vertakkings oor die padvoorwaarde te volg. Wanneer ’n moontlike fouttoestand bereik word, kan die padvoorwaarde opgelos word, en indien dit oplaasbaar is, kan waardetoekennings verkry word om eksplisiete toetsgevalle in ’n eenheidstoetsingsraamwerk te formuleer. Die laaste stap verhoog vertroue dat die foute gevind werklik is, want toetsing word deur die normale semantiek van die taal geforseer, wat sekere toestande onbereikbaar maak. Ons illustreer en evalueer Artemis met ’n aantal voorbeelde waar die foute bekend is, asook op ’n groot, komplekse versameling kode. ’n Voorlopige weergawe van die´ werk is suksesvol by die SAICSIT-konferensie, wat van 1 tot 3 Oktober 2012 in Centurion, Suid-Afrika, gehou is, aangebied.

The use of MEPLAN by the Metropolitan Transport Planning Branch of the Cape Town City Council since 1984 was not successful due to apartheid anomalies. EMME/2 was then introduced in 1991 in replacement of MEPLAN. The strengths and weaknesses of both MEPLAN and EMME/2 are recorded in this study.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaves 439-451. / by Robert Cregar Berwick. / Ph.D.

The purpose of this project is to implement an integrated piece of software consisting of a number of graphics programs that support mathematical computation and experimentation in dynamical systems.

Due to the significant limitations of static analysis and the dynamic nature of pointers in weakly typed programming languages like C and C++, the points-to sets obtained at compile time are quite conservative. Most static pointer analysis methods trade the precision for the analysis speed. The methods that perform the analysis in a reasonable amount of time are often context and/or flow insensitive. Other methods that are context, flow, and field sensitive have to perform the whole program inter-procedural analysis, and do not scale with respect to the program size. A large class of problems involving optimizations such as instruction prefetching, control and data speculation, redundant load/store instructions removal, instruction scheduling, and memory disambiguation suffer due to the imprecise and conservative points-to sets computed statically. One could possibly live without optimizations, but in domains involving memory security and safety, lack of the precise points-to sets can jeopardize the security and safety. In particular, the lack of dynamic points-to sets drastically reduce the ability to reason about a program's memory access behavior, and thus illegal memory accesses can go unchecked leading to bugs as well as security holes. On the other hand, the points-to sets can be very useful for other domains such as the heap shape analysis and garbage collection. The knowledge of precise points-to sets is therefore becoming very important, but has received little attention so far beyond a few studies, which have shown that the pointers exhibit very interesting behaviors during execution. How to track such behaviors dynamically and benefit from them is the topic covered by this research. In this work, we propose a technique to compute the precise points-to sets through dynamic pointer tracking. First, the compiler performs the pointer analysis to obtain the static points-to sets. Then, the compiler analyzes the program, and inserts the necessary instructions to refine the points-to sets. At runtime, the inserted instructions automatically update the points-to sets. Dynamic pointer tracking in software can be expensive and can be a barrier to the practicality of such methods. Several optimizations including removal of redundant update, post-loop update, special pattern driven update removal, pointer initialization update removal, update propagation, invariant removal, and on demand update optimization are proposed. Our experimental results demonstrate that our mechanism is able to compute the points-to sets dynamically with tolerable overheads. Finally, the memory protection and garbage collection work are presented as the consumers of dynamic pointer tracking to illustrate its importance. In particular, it is shown how different memory properties can be easily tracked using the dynamic points-to sets opening newer possibilities.

Low student success rates in introductory computer programming classes result in low student retention rates in computer science programs. For some sections of the course a traditional approach began using C# in the .Net development environment immediately. An experimental course redesign for one section was prepared that began with a study of HTML and JavaScript and focused on having students build web pages for several weeks; after that the experimental course used C# and the .Net development environment, covering all the material that was covered in the traditional sections. Students were more successful in the experimental section, with a higher percentage of the students passing the course and a higher percentage of the students continuing on to take at least one additional computer science course. / Department of Computer Science