Search

Component-based software engineering is concerned with the development of software that can satisfy the customer prerequisites through reuse or independent development. Coupling and cohesion measurements are primarily used to analyse the better software design quality, increase the reliability and reduced system software complexity. The complexity measurement of cohesion and coupling component to analyze the relationship between the component module. In this paper, proposed the component selection framework of Hexa-oval optimization algorithm for selecting the suitable components from the repository. It measures the interface density modules of coupling and cohesion in a modular software system. This cohesion measurement has been taken into two parameters for analyzing the result of complexity, with the help of low cohesion and high cohesion. In coupling measures between the component of inside parameters and outside parameters. The final process of coupling and cohesion, the measured values were used for the average calculation of components parameter. This paper measures the complexity of direct and indirect interaction among the component as well as the proposed algorithm selecting the optimal component for the repository. The better result is observed for high cohesion and low coupling in component-based software engineering. [ABSTRACT FROM AUTHOR]

Background. In the modern world, component development methods are becoming increasingly popular. They allow not only to quickly solve the assigned tasks, but also to meet the high requirements for the performance and reliability of the created software products. The use of the block approach in machine learning is a breakthrough method that makes the development of complex neural network architectures several times easier. The purpose of this work is to study the methods of component development and the technology of graph-symbolic programming for solving the problem of visual programming of neural networks. Materials and methods. The work develops methods and algorithms for configuring neural network models based on software systems that implement a graphical interface for creating neural networks using graph-symbolic programming based on the JavaScript programming language. Results. Comprehensive research has been carried out in the field of visual programming of neural networks using component development methods. A graphical interface has been developed for configuring neural network architectures. Conclusions. The presented approach to visual programming of neural networks simplifies the development process, avoids errors and creates more efficient and reliable systems.

To bring the theoretical basis to the improvement of the methodic of carrying out laboratory works in physics and computer sciences, a study of psychological and cognitive processes that accompany the corresponding educational activity was held. The important moment of the work is the research of the mental side of educational activities in the terms of formal logic. The accompanying steps to these mental activities and the talk activity are considered. The content component of the talk activity was considered in the work as an important diagnostic factor that indicates the level of understanding of the nature of the new material or the completion of the corresponding cognitive structure. The original graphical ways of formalization of the cognitive scheme of the object activity and the logic of its formation in the context of mental and materialized education activities are presented. These ideas were used to consider the processes of educational activity on the example of the creation of a simple physical model that is realized through the Python talk with the help of Visual library. Educational activities are considered through the prism of the evolution of the structural organization of mental representation of the objects of this activity. The research demonstrates the cyclical nature of the corresponding cognitive processes, materialized activities, and hierarchical character of the structure of knowledge that is formed in the process of educational activities in physics and programming. The correlation of these processes with the dynamics of the evolution of knowledge is settled. The conceptual ideas that could be useful for modifications of the methodic of realization of laboratory knowledge in the direction of modeling of physical processes and phenomena are formulated. Individual algorithmic problems of modeling of physical processes are considered in the research as components of the holistic system of problems. According to the point of view of the authors, in the course of the preparation of highly professional specialists in the domain of natural sciences, it is necessary to devote a lot of time to the conscious, goal-oriented formation of protocols of abstract logical and causal thinking. The methodology of such work is well formulated, especially in the well-known methods of descending step-by-step detailing and in modular programming [ABSTRACT FROM AUTHOR]

This paper uses Interactive Data Language (IDL) as a development language to design and implement a lung tumor image processing system with a Client/Server (C/S) structure. During the development process, various business requirements related to the system have been analyzed and the system structure together with detailed business process were designed as a whole. In addition, we also established a database of patients’ lung tumor images to efficiently store and query Computed Tomography (CT) images of lung tumors at various stages of the patient and the images generated during the processing of the system. Finally, the paper elaborated the implementation of the IDL-based lung tumor image processing system, and conducted a performance test and experimental analysis of the system. The system consists of five functional modules: image preprocessing, image segmentation, image reconstruction, image measurement, and image management. This system can automatically calculate quantitative indicators in the delineated area. These features can be used for further tumor differentiation tests, tumor characterization, treatment monitoring, and prognosis assessment. The experimental results show that the system is effective, and also processing speed meets the real-time requirements, and has wide applicability, friendly human-computer interaction, convenient extensibility, good portability, and so on.

Plotkin and Pretnar's effect handlers offer a versatile abstraction for modular programming with user-defined effects. This paper focuses on foundations for implementing effect handlers, for the three different kinds of effect handlers that have been proposed in the literature: deep, shallow, and parameterised. Traditional deep handlers are defined by folds over computation trees and are the original construct proposed by Plotkin and Pretnar. Shallow handlers are defined by case splits (rather than folds) over computation trees. Parameterised handlers are deep handlers extended with a state value that is threaded through the folds over computation trees. We formulate the extensions both directly and via encodings in terms of deep handlers and illustrate how the direct implementations avoid the generation of unnecessary closures. We give two distinct foundational implementations of all the kinds of handlers we consider: a continuation-passing style (CPS) transformation and a CEK-style abstract machine. In both cases, the key ingredient is a generalisation of the notion of continuation to accommodate stacks of effect handlers. We obtain our CPS translation through a series of refinements as follows. We begin with a first-order CPS translation into untyped lambda calculus which manages a stack of continuations and handlers as a curried sequence of arguments. We then refine the initial CPS translation by uncurrying it to yield a properly tail-recursive translation and then moving towards more and more intensional representations of continuations in order to support different kinds of effect handlers. Finally, we make the translation higher order in order to contract administrative redexes at translation time. Our abstract machine design then uses the same generalised continuation representation as the CPS translation. We have implemented both the abstract machine and the CPS transformation (plus extensions) as backends for the Links web programming language. [ABSTRACT FROM AUTHOR]

Copyright of Revista Espacios is the property of Talleres de Impresos Oma and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Considers the design and structure of software which allows robot operating and programming systems to be configured for modular robots with user defined articulation. Implementation of such software systems as part of a Science and Engineering Research Council supported project to produce an autonomous family of mechanical and control system elements.

Modular multiplication forms the basis of many cryptographic functions such as RSA, Diffie-Hellman key exchange, and ElGamal encryption. For large RSA moduli, combining the fast Fourier transform (FFT) with McLaughlin's Montgomery modular multiplication (MLM) has been validated to offer cost-effective implementation results. However, the conditional selections in McLaughlin's algorithm are considered to be inefficient and vulnerable to timing attacks, since extra long additions or subtractions may take place and the running time of MLM varies. In this work, we restrict the parameters of MLM by a set of new bounds and present a modified MLM algorithm involving no conditional selection. Compared to the original MLM algorithm, we inhibit extra operations caused by the conditional selections and accomplish constant running time for modular multiplications with different inputs. As a result, we improve both area-time efficiency and security against timing attacks. Based on the proposed algorithm, efficient FFT-based modular multiplication and exponentiation are derived. Exponentiation architectures with dual FFT-based multipliers are designed obtaining area-latency efficient solutions. The results show that our work offers a better efficiency compared to the state-of-the-art works from and above 2048-bit operand sizes. For single FFT-based modular multiplication, we have achieved constant running time and obtained area-latency efficiency improvements up to 24.3 percent for 1,024-bit and 35.5 percent for 4,096-bit operands, respectively. [ABSTRACT FROM AUTHOR]

This high-level toolbox for the calculus with Taylor polynomials is named after L.F.A. Arbogast (1759-1803), a French mathematician from Strasbourg (Alsace), for his pioneering work in derivation calculus. Arbogast is based on a well-defined extension of the C programming language, Modular C, and places itself between tools that proceed by operator overloading on one side and by rewriting, on the other. The approach is best described as contextualization of C code because it permits the programmer to place his code in different contexts—usual math or automatic differentiation (AD)—to reinterpret it as a usual C function or as a differential operator. Because of the type generic features of modern C, all specializations can be delegated to the compiler. The higher order AD with arbogast is exemplified on families of functions of mathematical physics and on models for complex dielectric functions used in optics. [ABSTRACT FROM AUTHOR]

Some of the theoretical aspects of continuation and bifurcation methods devoted to the solution for nonlinear parametric systems are presented in a higher order automatic differentiation (HOAD) framework. Besides, benefits in terms of generality and ease of use, HOAD is used to assess fold and simple bifurcations points. In particular, the formation of a geometric series in successive Taylor coefficients allows for the implementation of an efficient detection and branch switching method at simple bifurcation points. Some comparisons with the Auto and MatCont continuation software are proposed. Strengths are then exemplified on a classical case study in structural mechanics. [ABSTRACT FROM AUTHOR]

This paper investigates the stability of a modular multi-level converter (MMC) based HVDC system connected to a weak ac grid. Impedance analysis is used to study the interactions between the weak ac grid and the converter. For this, the impedance of the MMC is first derived considering various outer- and inner-loop controllers. The Nyquist-stability criterion is then used to analyze the stability of the MMC connected to the weak ac grid for various case studies. The impact of circulating current controller on the stability of the MMC connected to the weak ac grid is also validated for two different types of outer-loop controllers. Finally, time-domain simulations are carried out using MATLAB/Simscape Power System toolbox to validate the analytical results. [ABSTRACT FROM AUTHOR]

An important field in the process of unmanned aerial vehicles (UAV) operation is the system of training operators and technicians. The article presents methods for measuring and evaluating the effectiveness of training systems and their suitability for use in assessing the effectiveness of training of unmanned aircraft personnel. Based on the results of the research carried out in the actual training system, a model for adapting the program and organizing training of airline personnel to measure and evaluate training outcomes was developed. [ABSTRACT FROM AUTHOR]

Software coupling involves dependencies among pieces of software called modules. Different types of coupling will dictate the manner whereby software modules interact and will result in different approaches to mutual function calls and return values, which can affect software quality attributes. Undoubtedly, coupling has been one of the most critical factors for supporting software modularity because it affects such important software quality attributes as reusability, readability, and maintainability. It is no surprise that coupling can affect energy efficiency. Recently, energy efficiency has increasingly been recognized as a critical software quality attribute, particularly for embedded software, including smartphone applications. Unfortunately, few studies have been conducted to date concerning coupling in developing energy-efficient and modular software, other than general studies on energy consumption and resource overutilization in the context of modularity. In this study, we aim to investigate the relationship between energy consumption and software coupling. In particular, we aim to determine whether it is possible to control energy consumption by applying different types of software coupling and, if so, how this might be done. We have performed a large number of experiments from which we have gained insight, although that insight might not be applicable to all possible types of coupling that are feasible, to help guide software engineers in developing energy-efficient embedded software. From the experimental results, we observe that overall “data” coupling reduces energy consumption when a large amount of data must be passed from one module to another, whereas “common” coupling is preferred when continuous memory references are needed, although energy consumption can also be somewhat dependent upon the operating environment. We describe such insights into the relationship between energy consumption and software coupling. [ABSTRACT FROM AUTHOR]

Additive manufacturing (AM) can significantly reduce the development time for small batch parts or parts with complicated geometries. However, the accuracy of most metal AM processes requires parts to be subjected to secondary processing (typically machining) in order to obtain requisite tolerances. Process plan development for hybrid manufacturing, which is defined for the following as additive manufacturing followed by subtractive multi-axis computer numerical control (CNC) machining, typically takes weeks rather than hours or days. This paper outlines a feature-based advanced hybrid manufacturing process planning system (FAH-PS) that uses feature-specific geometric, tolerance, and material data inputs to generate four-automated process plans based on user-specified feature precedence for hybrid manufacturing. FAH-PS currently has the capability to identify manufacturing processes for critical pockets, flat surfaces, and hole features. Additional plans generated by FAH-PS minimize tool changes, orientation changes, etc., to improve process times. FAH-PS is modular and extensible to allow for additional feature types, materials, tool sizes, and/or optimization strategies to be included in future versions. A case study, using a custom patient-specific bone plate, demonstrated system capabilities and processing time reductions as compared to the current manual process planning for hybrid manufacturing methodologies. Using the generated FAH-PS process plan resulted in a 35% reduction in machining time from the current hybrid manufacturing strategy. Imploring a strategy of minimizing tool and orientation changes generated a process plan that demonstrated that even further improvements were possible. [ABSTRACT FROM AUTHOR]

This paper presents a genetic algorithm (GA) based approach for solving a multi-objective credibilistic model (MOCM) for commercial-off-the-shelf (COTS) product selection problem subject to many realistic constraints by using an exponential membership function. To solve this problem, a fuzzy technique is utilized to handle each uncertain parameter by a credibility-based model and finds a different efficient solution by taking various shape parameters in the exponential membership function subject to all resource constraints and for each objective function, aspiration level is specified by the decision maker (DM). A real-world example is provided to represent the importance of the proposed approach with data set from the realistic situation. [ABSTRACT FROM AUTHOR]

This article contains a new subnet training method for modular neural networks, proposed with the inspiration of the principle of "an expert with other capabilities". The key point of this method is that a subnet learns the neighbor data sets while fulfilling its main task: learning the objective data set. Additionally, a relative distance measure is proposed to replace the absolute distance measure used in the classical subnet learning method and its advantage in the general case is theoretically discussed. Both methodology and empirical study of this new method are presented. Two types of experiments respectively related with the approximation problem and the prediction problem in nonlinear dynamic systems are designed to verify the effectiveness of the proposed method. Compared with the classical subnet learning method, the average testing error of the proposed method is dramatically decreased and more stable. The superiority of the relative distance measure is also corroborated. [ABSTRACT FROM AUTHOR]

Summary: Function call interception (FCI), or method call interception (MCI) in the object‐oriented programming domain, is a technique of intercepting function calls at program runtime. Without directly modifying the original code, FCI enables to undertake certain operations before and/or after the called function or even to replace the intercepted call. Thanks to this capability, FCI has been typically used to profile programs, where functions of interest are dynamically intercepted by instrumentation code so that the execution control is transferred to an external module that performs execution time measurement or logging operations. In addition, FCI allows for manipulating the runtime behavior of program components at the fine‐grained function level, which can be useful in changing an application's original behavior at runtime to meet certain execution requirements such as maintaining performance characteristics for different input problem sets. Due to this capability, however, some FCI techniques can be used as a basis of many security exploits for vulnerable systems. In this paper, we survey a variety of FCI techniques and tools along with their applications to diverse areas in the computing and software domains. We describe static and dynamic FCI techniques at large and discuss the strengths and weaknesses of different implementations in this category. In addition, we also discuss aspect‐oriented programming implementation techniques for intercepting method calls. [ABSTRACT FROM AUTHOR]