Object-oriented Applications Research Articles

Open source tool for Micro-CT aided meso-scale modeling and meshing of complex textile composite structures

Volumetric image-based modeling of textile reinforcements and composites is favored over ideal geometric modeling because of its ability to represent complex structures in sufficient detail. Although several approaches were devised, there is still a scarcity of dedicated tools capable of effectively transferring pertinent information from images to high-fidelity models. This work presents the open source project, PolyTex, a Python-based object-oriented application that establishes a streamlined and reproducible workflow for such tasks. Dual kriging serves as the foundational theory for the parametric approach developed to represent, simplify, and approximate the morphology and topology of fiber tows. The code takes two types of input, either an explicit representation of tow geometry using point clouds or implicit representations, such as image masks representing fiber tows separately with grayscale values. Tailored APIs allow for smooth integration between PolyTex’s modeling capabilities and the simulation environments offered by OpenFOAM and Abaqus. Case studies on virtual testing of textile permeability were presented to demonstrate this capability. The modular and object-oriented design makes PolyTex a highly reusable and extensible tool that allows users to create a customized pipeline.

SAM: A Modern System Code for Advanced Non-LWR Safety Analysis

The System Analysis Module (SAM), developed at Argonne National Laboratory and by collaborators at other organizations, is for advanced non–light water reactor safety analysis. SAM aims to provide fast-running, modest-fidelity, whole-plant transient analysis capabilities that are essential for fast-turnaround design scoping and engineering analyses of advanced reactor concepts. To facilitate code development, SAM utilizes the MOOSE object-oriented application framework, its underlying finite element library, and linear and nonlinear solvers to leverage modern advanced software environments and numerical methods. SAM aims to solve tightly coupled physical phenomena, including fission reaction, heat transfer, fluid dynamics, and thermal-mechanical responses in advanced reactor structures, systems, and components with high accuracy and efficiency. This paper gives an overview of the SAM code development, including goals and functional requirements, physical models, current capabilities, verification and validation, software quality assurance, and examples of simulations for advanced nuclear reactor applications.

Soft Computing-Based System for Performance Modeling of Object-Oriented Programming (OOP) Software

Performance is a vital attribute for most software, making performance investigation an essential software engineering task. The problem is that modern applications are challenging to analyse for performance. The advancement of Software engineering has seen the application of scientific approach at various stages of Software Development Life Cycle (SDLC). New technique is available for implementation known as soft computing. This approach is a synergistic combination of artificial intelligence methodologies to model and solve real world problems that are either impossible or challenging to be modeled mathematically. The complexity, the commercial constraints and the expectation for high quality software demand, measuring the quality performance of an Object-Oriented Software (OOS). This work presents a set of testing metric (criteria) which hold the potential for ensuring remarkable improvements in quality performance of Object-Oriented software (OOS). A Prediction Model focused on identifying and evaluating the quality of the performance model based on the data set of software design components. The software design properties are comprehensive elucidated and integrating concepts of fuzzy logic and software engineering. The system enables the performance of modeling of Object-Oriented software using Fuzzy Inference System (FIS) to accurately predict the quality Object Oriented Software based on quality performance criteria such as reliability, efficiency, functionality and maintainability. Empirical validation of the results using checking data set is made to prove the usefulness of the design metrics and design quality attributes on the software prediction models. The purpose of this work is to provide development tool to solves practical problems, and focus on identifying and evaluating the quality performance of software design components. Again, the results demonstrate that, despite the research including approaches explicitly aimed at object-oriented software, there are substantial challenges in providing realistic feedback on the performance of large-scale object-oriented applications accordingly.

Использование IS-THE-графов для анализа иерархических структур данных

The article defines the general principles for representing hierarchical structures, such as specializations and categorizations in data models, and class hierarchies in OOP. This representation allows a deeper analysis of the semantics of the subject area and solving the problem of optimal universal implementation of these structures in database systems and object-oriented applications. The possibility for such a generalization is provided by IS-THE relations and IS-THE mappings, on the basis of which IS-THE graphs are constructed. The selection of subgraphs of these graphs according to certain rules generates types of hierarchical structures known in computer science: a single inheritance hierarchy (a specialization hierarchy), a selective inheritance graph (a two-level categorization graph), a two-level multiple inheritance graph.

Implementasi Extreme Programming Pada Perancangan Sistem Informasi Penjualan Buku Menggunakan Java

Technology is needed by humans to facilitate all activities carried out so that they are fast and practical, besides that technology is used as a solution to problems in conventional systems. Conventional sales activities experience several problems such as recording activities, insecure archiving, manual calculations and loss of transaction data. From these problems, the purpose of this study is to design a sales information system, namely object-based book sales transactions in order to minimize errors and produce the information needed by users effectively and efficiently. The method used is Extreme Programming which is very suitable for developing and building object-oriented applications. This method has stages in the method including planning carried out problem finding and needs analysis, the design consists of system design with UML (Unified Modeling Language) and ERD (Entity Relationship Diagram) database design, coding in the form of application menu displays, testing with blackbox testing and software increase. The design of an OOP-based book sales information system using the Extreme Programming method is expected to help and facilitate users in managing data, sales transactions and reports.
 

Bidirectional Object-Oriented Programming: Towards Programmatic and Direct Manipulation of Objects

Many bidirectional programming languages, which are mainly functional and relational, have been designed to support writing programs that run in both forward and backward directions. Nevertheless, there is little study on the bidirectionalization of object-oriented languages that are more popular in practice. This paper presents the first bidirectional object-oriented language that supports programmatic and direct manipulation of objects. Specifically, we carefully extend a core object-oriented language, which has a standard forward evaluation semantics, with backward updating semantics for class inheritance hierarchies and references. We formally prove that the bidirectional evaluation semantics satisfies the round-tripping properties if the output is altered consistently. To validate the utility of our approach, we have developed a tool called BiOOP for generating HTML documents through bidirectional GUI design. We evaluate the expressiveness and effectiveness of BiOOP for HTML webpage development by reproducing ten classic object-oriented applications from a Java Swing tutorial and one large project from GitHub. The experimental results show the response time of direct manipulation programming on object-oriented programs that produce HTML webpages is acceptable for developers.

FUNOff: Offloading Applications At Function Granularity for Mobile Edge Computing

Mobile edge computing (MEC) offers a promising technology that deploys computing resources closer to mobile devices for improving performance. Most of the existing studies support on-demand remote execution of the computing tasks in applications through program transformation, but they commonly assume that mobile devices merely resort a single server for computation offloading, which cannot make full use of the scattered and changeable computing resources. Thus, for object-oriented applications, we propose a novel approach, called FUNOff to support dynamic offloading of applications in MEC at the function granularity. First, we extract a call tree via code analysis and locate the function invocations that are suitable for offloading. Next, we refactor the code of related object functions according to a specific program structure. Finally, we make offloading decisions referring to the context at runtime and send function invocations to multiple remote servers for execution. We evaluate the proposed FUNOff on two real-world applications. The results show that, compared with other approaches, FUNOff better supports the computation offloading of object-oriented applications in MEC, which reduces the response time by 10.7%-58.2%.

Computation offloading for object-oriented applications in a UAV-based edge-cloud environment

Computation offloading for object-oriented applications in a UAV-based edge-cloud environment

An efficient fully Lagrangian solver for modeling wave interaction with oscillating wave surge converter

In this paper, we present an efficient, accurate and fully Lagrangian numerical solver for modeling wave interaction with oscillating wave surge converter (OWSC). The key idea is to couple SPHinXsys, an open-source multi-physics library in unified smoothed particle hydrodynamic (SPH) framework, with Simbody which presents an object-oriented application programming interface for multi-body dynamics. More precisely, the wave dynamics and its interaction with OWSC is resolved by a Riemann-based weakly-compressible SPH method in SPHinXsys, and the solid-body kinematics is computed by Simbody library. Numerical experiments demonstrate that the proposed solver can accurately predict the wave elevations, flap rotation and wave loading on the flap in comparison with laboratory experiment and numerical investigation. In particularly, the new solver shows optimized computational performance through CPU cost analysis and comparison with commercial software package ANSYS FLUENT and other SPH-based solvers in literature. Furthermore, a linear damper is applied for imitating the power take-off system to study its effects on the hydrodynamics properties of OWSC and efficiency of energy harvesting. In addition, the present solver is used to model extreme wave condition using the focused wave approach to investigate the extreme loads and motions of OWSC under such extreme wave conditions. It is also worth noting that though the model validation used herein is a bottom hinged oscillating wave energy converter (WEC), the obtained numerical results show promising potential of the proposed solver to future applications in the design of high-performance WECs.

Scrambling Keypad for Secure Pin Entry to Defeat Shoulder Surfing and Inference Attacks

Personal identification number (PIN) is a common user authentication method widely used especially for automated teller machines and point-of-sales devices. The user's PIN entry is susceptible to shoulder-surfing and inference attacks, where the attacker can obtain the PIN by looking over the user's shoulder. The conventional keypad with a fixed layout makes it easy for the attacker to infer the PIN entered by casual observation. This paper proposes a method of authentication to address these challenges. The paper develops a prototype numeric keypad with a layout akin to the conventional keypad, with the keys randomized for each PIN entry. The shuffle algorithm, Durstenfeld shuffle algorithm, is implemented in an application developed using JavaScript, which is a prototype-based object-oriented programming application that conforms to the ECMAScript specification. The prototype is implemented on three computing platforms for evaluation. The test proves the effectiveness of the system to mitigate shoulder-surfing and inference attacks.

Reactor Design Pattern

In object-oriented (OO) applications, objects collaborate through message passing, which results in these objects being coupled and mutually dependent. These dependencies can be reactive, i.e. such that, for example, the state change of one object, requires automatic reaction in all dependent objects. Examples of such reactive dependencies can be found in various software systems, including rich graphical interfaces, spreadsheet systems, animation, robotics, etc. Unlike the reactive paradigm which natively provides abstractions and mechanisms for the management of reactive dependencies, the OO paradigm lacks proper support. Object-oriented applications developers often resort to the use of ad-hoc solutions or design patterns such as the well-known Observer pattern, which are not suitable for managing more complex scenarios. In this paper we offer a novel design pattern (REACTOR), which utilizes a graph data structure to improve the management of reactive dependencies in OO applications.

Cyclomatic Complexity-Based Encapsulation, Data Hiding, and Separation of Concerns

Three design principles are prominent in software development-encapsulation, data hiding, and separation of concerns. These principles are used as subjective quality criteria for both procedural and object-oriented applications. The purpose of research is to quantify encapsulation, data hiding, and separation of concerns is quantified using cyclomatic-based metrics. As a result of this research, the derived design metrics, coefficient of encapsulation, coefficient of data hiding, and coefficient of separation of concerns, are defined and applied to production software indicating whether the software has low or high encapsulation, data hiding, and separation of concerns.

High-Performance Prototyping of Decomposition Methods in GAMS

Prototyping algorithms in algebraic modeling languages has a long tradition. Despite the convenient prototyping platform that modeling languages offer, they are typically seen as rather inefficient with regard to repeatedly solving mathematical programming problems, a concept on which many algorithms are based. The most prominent examples of such algorithms are decomposition methods, such as the Benders decomposition, column generation, and the Dantzig–Wolfe decomposition. In this work, we discuss the underlying reasons for repeated solve deficiency with regard to speed in detail and provide an insider’s look into the algebraic modeling language GAMS. Further, we present recently added features in GAMS that mitigate some of the efficiency drawbacks inherent to the way modeling languages represent model data and ultimately solve a model. In particular, we demonstrate the grid-enabled gather-update-solve-scatter facility and the GAMS object-oriented application programming interface on a large-scale case study that involves a Benders decomposition–type algorithm for a power-expansion planning problem.

An integrated approach of class testing using firefly and moth flame optimization algorithm

Path testing is an extensively used approach of software testing. Generation of test paths is the core concept of path testing. The recent approaches of software test paths generation are based on the nature-inspired metaheuristic algorithms. An amalgamated approach constructed on the glaring arrangement of fireflies together with the attractive conduct of moths with respect to a flame has been presented in this article. The proposed algorithm combines the individual aspects of two metaheuristics, namely, Moth Flame Optimization Algorithm (MFO) and Firefly Algorithm (FA) for test paths generation. The hybrid algorithm selects a starting node, traverses the connected path and iteratively evolves the complete test path after applying a series of operations. The enactment of the proposed algorithm is verified on the five object-oriented benchmark applications. The proposed algorithm is compared with both MFO and FA. Results confirm full coverage of the path which is the main motive of path testing. Also, reduced and less redundant test paths have been generated via proposed hybrid algorithm as compared to MFO and FA.

Recovering Android Bad Smells from Android Applications

The demand for Android mobile software applications is continuously increasing with the evolution of technology and new enriching features to make the life of people easy and comfortable. The mobile-based software applications are frequently updated as compared to other web and desktop applications. Due to these frequent updating cycles, the developers sometimes make changes in a rush which leads to poor design choices known as antipatterns or code bad smells. Code bad smells degrade the performance of applications and make evolution difficult. The recovery of bad smells from mobile software applications is still at infancy but it is a very important research realm that requires the attention of researchers and practitioners. The results of recovery may be used for comprehension, maintenance, reengineering, evolution and refactoring of these applications. Most state-of-the-art approaches focused on the detection of code bad smells from object-oriented applications and they target only a few code smells. We present a novel approach supplemented with tool support to recover 25 Android code bad smells from Android-specific software applications. We evaluate our approach by performing experiments on 4 open source and 3 industrial Android-specific software applications and measure accuracy using standard metrics.

Identification of critical test paths using firefly algorithm for object oriented software

Software testing is a cost-effective process, hence every-time it is not practically feasible to test all the test paths of the entire software application. In this paper, we propose a technique which helps in optimizing the process of software testing. The proposed technique identifies those test paths which are more crucial and fault-prone and ranked them accordingly. In this paper, firefly algorithm is used for the determination of critical test paths. The proposed algorithm generates a random factor to capture the motion of fireflies, when no brighter firefly is present in the search space. The proposed algorithm has been applied on five case studies of object-oriented applications. First the test paths are created for these case studies and then the criticality of generated test paths is calculated using firefly algorithm. Results indicate that those test paths which contain predicate nodes and recursive nodes are more critical i.e. they are more error prone and need to be tested first. Using the proposed technique, critical paths are recognized and arranged in the order of their criticality which further increases the testing effectiveness.

CAPre: Code-Analysis based Prefetching for Persistent Object Stores

Data prefetching aims to improve access times to data storage systems by predicting data records that are likely to be accessed by subsequent requests and retrieving them into a memory cache before they are needed. In the case of Persistent Object Stores, previous approaches to prefetching have been based on predictions made through analysis of the store’s schema, which generates rigid predictions, or monitoring access patterns to the store while applications are executed, which introduces memory and/or computation overhead.In this paper, we present CAPre, a novel prefetching system for Persistent Object Stores based on static code analysis of object-oriented applications. CAPre generates the predictions at compile-time and does not introduce any overhead to the application execution. Moreover, CAPre is able to predict large amounts of objects that will be accessed in the near future, thus enabling the object store to perform parallel prefetching if the objects are distributed, in a much more aggressive way than in schema-based prediction algorithms. We integrate CAPre into a distributed Persistent Object Store and run a series of experiments that show that it can reduce the execution time of applications from 9% to over 50%, depending on the nature of the application and its persistent data model.

Who is to Blame? Runtime Verification of Distributed Objects with Active Monitors

Since distributed software systems are ubiquitous, their correct functioning is crucially important. Static verification is possible in principle, but requires high expertise and effort which is not feasible in many eco-systems. Runtime verification can serve as a lean alternative, where monitoring mechanisms are automatically generated from property specifications, to check compliance at runtime. This paper contributes a practical solution for powerful and flexible runtime verification of distributed, object-oriented applications, via a combination of the runtime verification tool Larva and the active object framework ProActive. Even if Larva supports in itself only the generation of local, sequential monitors, we empower Larva for distributed monitoring by connecting monitors with active objects, turning them into active, communicating monitors. We discuss how this allows for a variety of monitoring architectures. Further, we show how property specifications, and thereby the generated monitors, provide a model that splits the blame between the local object and its environment. While Larva itself focuses on monitoring of control-oriented properties, we use the Larva front-end StaRVOOrS to also capture data-oriented (pre/post) properties in the distributed monitoring. We demonstrate this approach to distributed runtime verification with a case study, a distributed key/value store.

Elaboração de um programa para dimensionamento de lajes retangulares de concreto armado submetidas a um carregamento uniforme, com bordos apoiados, engastados ou livres, conforme a NBR 6118:2014

Ao longo dos anos, estamos vivenciando uma revolução na área da informática, onde o aumento da capacidade de armazenamento de dados e o desenvolvimento de sistemas computacionais são exemplos bons dessa evolução. Porém, o custo elevado de softwares desenvolvidos para o dimensionamento de estruturas de concreto armado, acarreta no distanciamento deles com os estudantes do curso de engenharia civil e a falta de vivência com os mesmos. Desta forma, o presente trabalho tem como objetivo automatizar e sistematizar através de uma rotina computacional, o dimensionamento de lajes maciças em concreto armado, em formato retangular, submetidas a um carregamento uniformemente distribuídos, podendo estarem apoiadas em bordos apoiados, engastados ou livres, de acordo com o proposto pela norma NBR 6118:2014. Para isto, se utilizou a linguagem de programação Visual Basic, desenvolvida para compilar aplicações orientadas a objeto, possibilitando a utilização do software em ambiente Windows através de uma interface gráfica muito prática e acessível. A partir dos dados de entrada introduzidos pelo usuário, o programa executa o dimensionamento de lajes usuais em edifícios de concreto armado com as características descritas.

Ant Lion optimizer for state based object oriented testing

Object-oriented paradigm is the most widely exploited design paradigm in the IT industry. The great functionalities of object-orientation not only improve the developed software but also introduce a wide variety of problems in testing. For instance, not only the object but also the state of object impacts testing. Various other serious issues of testing come along with object orientation. Thus, this has always been a major concern of software testers. Hence, it is very important to optimize this whole process of object-oriented software testing. Numerous meta-heuristic algorithms have been exploited in the past to accomplish this goal. In this paper, we are presenting a novel nature-inspired algorithm, AntLion Optimization (ALO) to generate optimal test paths for object-oriented software. Here, we are accompanying model based testing instead of code based testing as, this helps in reducing the testing effort and cost by identifying the error and bugs in the design phase itself. The main goal of model based software testing is to cover all the transitions present in the system i.e. full path coverage must be there. ALO is a novel meta-heuristic algorithm based on the random movement of ants in search of food, constructing traps by antlions, tricking the ants in trap, catching preys and reconstruction of traps. We introduces a random factor in the fitness function to capture the random motion of ants in the search space in search of food. This algorithm has been applied on three object-oriented software applications and the result guarantees complete path coverage which is a primary goal of software testing.