A PBL-Based, Integrated Learning Experience of Object-Oriented Programming, Data Structures and Software Design

Author(s):  
Ayala L. Ribeiro ◽  
Roberto A. Bittencourt
2011 ◽  
Vol 128-129 ◽  
pp. 1329-1333
Author(s):  
Ai Wu Zheng ◽  
Jian Ping Zhou ◽  
Yong Ping Ma ◽  
Yu Hui Ga

Operational simulator is a simulated training system used in a flight control center to train and improve mission operators’ ability to control and track spacecrafts, constructing a realistic mission-like circumstance for the system drilling. But previous simulator had not a centralized monitor. It must be operated and monitored at different terminals. Usually several operators are required to operate at the same time with a demanded order. It is very inconvenient to use. So, the centralized monitor software is specially designed for Chang’E-1 operational simulator. It is used for operations, status setting, Data management and monitors of the simulator. This paper introduces functional requirements, network structure, and design scheme of modules of the software. The object-oriented programming of plug-ins is adopted in the program development. The practice proves that it is very convenient for a single user to operate the Chang’E-1 operational simulator by using the centralized monitor software, and it also saves manpower and cut expense. The software architecture can be applied in centralized monitor software of future simulators.


2021 ◽  
Author(s):  
◽  
David Friggens

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>


2020 ◽  
Vol 14 (1) ◽  
pp. 57-63
Author(s):  
Andrés Armando Sánchez Martin ◽  
Luis Eduardo Barreto Santamaría ◽  
Juan José Ochoa Ortiz ◽  
Sebastián Enrique Villanueva Navarro

One of the difficulties for the development and testing of data analysis applications used by IoT devices is the economic and temporary cost of building the IoT network, to mitigate these costs and expedite the development of IoT and analytical applications, it is proposed NIOTE, an IoT network emulator that generates sensor and actuator data from different devices that are easy to configure and deploy over TCP/IP and MQTT protocols, this tool serves as support in academic environments and conceptual validation in the design of IoT networks. The emulator facilitates the development of this type of application, optimizing the development time and improving the final quality of the product. Object-oriented programming concepts, architecture, and software design patterns are used to develop this emulator, which allows us to emulate the behavior of IoT devices that are inside a specific network, where you can add the number of necessary devices, model and design any network. Each network sends data that is stored locally to emulate the process of transporting the data to a platform, through a specific format and will be sent to perform Data Analysis.


Author(s):  
Michael Metcalf ◽  
John Reid ◽  
Malcolm Cohen

The object-oriented approach to programming and design is characterized by its focus on the data structures of a program rather than the procedures. Often, invoking a procedure with a data object as its principal argument is thought of as ‘sending a message’ to the object. Special language support is typically available for collecting these procedures (sometimes known as ‘methods’) together with the definition of the type of the object. This approach is supported in Fortran by type extension, polymorphic variables, type-bound procedures, abstract types, and finalization.


2012 ◽  
Vol 6-7 ◽  
pp. 15-19
Author(s):  
De Ren Yang ◽  
Min Liu ◽  
Zhao Hua Gu

The sequence diagram can be used to design object-oriented software; however, its modeling principles are lack of research. In this paper, its application in software design was studied, and its inherent linkage with object-oriented programming was discussed, and the interactive mechanism among its elements was explored. The modeling principles for it were proposed; and its application in Model Driven Architecture (MDA) software paradigm was analyzed; and finally the model represented with it, especially the transformation and traceability of models in MDA software paradigm were analyzed. This research is useful to optimize software modeling and to automate model transformation in MDA software paradigm.


Author(s):  
Wendy Lucas

The object-oriented programming paradigm has gained popularity in both industry and academia, and Java is becoming the language of choice. Yet, it can be a difficult language to learn, with many hurdles for novice programmers. This overview describes how Java was successfully introduced as the first programming language in an information technology master’s program at Bentley College. Careful consideration was given to a variety of factors, including when to introduce object-oriented concepts, which integrated development environment to use, and how to support students with minimal prior programming experience. The impact of these choices on the learning experience and the factors that led to the successful implementation of Java as a first programming language are described.


2021 ◽  
Author(s):  
◽  
David Friggens

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>


Sign in / Sign up

Export Citation Format

Share Document