Modern Object-oriented Programming Languages Research Articles

Development of an Expert System for Fixing and Maintaining Mine Workings in the Mining Industry

The article is devoted to the development of an expert system, the purpose of which is to optimize the processes of fixing and maintaining mine workings in the mining industry. The paper presents a comprehensive approach based on the application of theoretical, numerical-analytical and empirical research methods, as well as the systematization of primary data and in-depth analysis of the problem. The expert system is developed using modern object-oriented programming languages, which ensures high efficiency and flexibility of the system. The main objective of the system is to provide sound solutions for fixing and maintaining mine workings, depending on the types of rocks and mining conditions. Thus, the expert system allows to reduce the decision-making time in the process of fixing and maintaining mine workings. This is especially important in a dynamically changing mining industry. The development and implementation of an expert system allows you to increase the level of knowledge and skills of specialists in the industry. Interactive interaction with the system contributes to the exchange of experience and the accumulation of knowledge

Studies in object-oriented programming backbone implementations

This work is a combination of conceptual and hands on based study aimed at laying a foundation for practical Object-Oriented software construction. First it presents a conceptual study of a number of backbone concepts of modern Object-Oriented Programming (OOP) languages. Secondly, it attempts to demonstrate real-life implementations of these concepts using Python Programming Language. This work touches on practical issues on Class and Object Creation, especially on the syntax and creation, and demystifies the subject matter using a simple table of rules. The OOP concept of Inheritance was studied, with focus on the three major types of inheritance. The self-argument, and constructors were studied, with focus on the three constructors - default, parameterized, and non-parameterized constructors. A brief discussion, and pictorial illustration was also made on the disparity between normal mathematical functions and OOP method calls. Further areas of studies are the concept of overriding between the parent and child class, as well as the OOP puzzle commonly known as Diamond Problem, including code segment and diagrammatic illustration of Python-based solutions. There are a number of other back-bone concepts in OOP not covered in this study, such as Encapsulation, Abstraction, Meta-Programming, among others, which will form areas of focus in future studies. Effort was made to enhance the overall presentation through practical illustrations using source codes, annotated diagrams, and discussions. It is hoped that this work will be very useful to researchers and other practitioners in Object Oriented implementations.

A New Modern Object-Oriented Programming Languages

Industries evolve. Our thinking changes as well. Programming languages need evolvement too. “The thing is that ideas for new features with its ways of thinking will be flourished, and so perfectly designed those languages won’t be perfect anymore.” Where did logical programming go? “Notice that you can use this paradigm and just provide a set of constraints for a website and expect the website to develop automatically based on them.” It is possible to implement that. Likewise, new paradigms will sooner or later be born. It can’t be that we’ve explored everything. “Technologies are born likewise the old way of thinking, which represents by the previous programming languages might not be adequate. This project is an open-source modern object-oriented programming language that aims to bridge the gap between modern expressive programming paradigms like python and strictly typed rigid languages like Java and C#. Our goal is to provide the usefulness of an object-oriented programming language while holding the simplicity of an expressive programming language without having to sacrifice performance.

ВПОРЯДКУВАННЯ ТА ВПОРЯДКОВУВАННЯ В ДИСКРЕТНІЙ МАТЕМАТИЦІ ТА ІНФОРМАТИЦІ

The available means of ordering and sorting in some important sections of discrete mathematics and computer science are studied, namely: in the set theory, classical mathematical logic, proof theory, graph theory, POST method, system of algorithmic algebras, algorithmic languages of object-oriented and assembly programming. The Cartesian product of sets, ordered pairs and ordered n-s, the description by means of set theory of an ordered pair, which are performed by Wiener, Hausdorff and Kuratowski, are presented. The requirements as for the relations that order sets are described. The importance of ordering in classical mathematical logic and proof theory is illustrated by the examples of calculations of the truth values of logical formulas and formal derivation of a formula on the basis of inference rules and substitution rules. Ordering in graph theory is shown by the example of a block diagram of the Euclidean algorithm, designed to find the greatest common divisor of two natural numbers. The ordering and sorting of both the instructions formed by two, three and four ordered fields and the existing ordering of instructions in the program of Post method are described. It is shown that the program is formed by the numbered instructions with unique instruction numbers and the presence of the single instruction with number 1. The means of the system of algorithmic algebras, which are used to perform the ordering and sorting in the algorithm theory, are illustrated. The operations of the system of algorithmic algebras are presented, which include Boolean algebra operations generalized to the three-digit alphabet and operator operations of operator algebra. The properties of the composition operation are described, which is intended to describe the orderings of the operators of the operator algebra in the system of algorithmic algebras. The orderings executed by means of algorithmic programming languages are demonstrated by the hypothetical application of the modern object-oriented programming language C#. The program must contain only one method Main () from which the program execution begins. The ARM microprocessor assembly program must have only one ENTRY directive from which the program execution begins.

TFA: an efficient and precise virtual methodcall resolution for Java

Abstract The problem of statically resolving virtual method calls in object-oriented (OO) programming languages has been a long standing challenge, often due to the overly complicated class hierarchy structures in modern OO programming languages such as Java, C# and C++. Traditional ways of dealing with this problem include class hierarchy analysis (CHA), variable type analysis (VTA), and retrieval of type information after a sophisticated points-to analysis. In this paper, we tackle this problem by proposing a new approach called type flow analysis (TFA) which propagates type information as well as field access information through the syntactic structure of a program. Our methodology is purely algebraic and there is no need to explicitly construct a heap abstraction. We have assessed our methodology from two perspectives. Regarding its theoretical foundation, we have proved that in the context insensitive setting, our method is as precise as the standard Andersen’s subset based points-to analysis regarding the derived types for variables. For an experimental evaluation of TFA, we have implemented the algorithm in the Soot framework and used it to analyze the SPECjvm2008 benchmark suite. During the experiment, we have shown that our method is usually 30–100 times faster than the standard points-to analysis. We further conduct a range of detailed analysis based on the baseline data obtained by running a dynamic profiler, which is also implemented by us, on the SPECjvm2008. The experiment results confirm that TFA can achieve outstanding performance with acceptable accuracy when applied on real-world Java programs.

Earthquake vulnerability of ancient multi-drum columns with a single epistyle

In this research work the seismic behaviour of structures with multi-drum columns under a single epistyle is investigated. In particular, the Discrete Element Method (DEM) is applied in the study of ancient columns undergoing strong ground excitations, by simulating the individual rock blocks as distinct bodies. A specialized software application is developed and utilized, using a modern object-oriented programming language, in order to enable the effective simulation of multi-drum columns and colonnades. Parametric studies are implemented in order to investigate the effect of excitation characteristics on the behaviour of multi-drum columns under earthquake excitations.The analysis results indicate that the frequency and peak ground acceleration of an excitation, significantly affect the dynamic response of the columns. Particularly, for low frequency ground excitations, the exhibited response is dominated by rocking, while sliding prevails in cases of excitations with very high predominant frequencies. In between the two extremes, the response contains both rocking and sliding phenomena. Furthermore, according to the conducted simulations the acceleration that is needed to overturn multi-drum columns with a single epistyle also increases as the frequency increases.By examining the stability of multi-drum colonnades with a single epistyle under earthquake excitations that were selected from regions where these monuments are often found, such as the Eastern Mediterranean region, the simulations reveal that the columns have the capacity to withstand strong earthquakes without collapse. In addition, the epistyle seems to be the most vulnerable to failure part of the structure under these loads. Finally, the required acceleration to overturn such a system with a single epistyle seems to decrease as the predominant frequency of the earthquake decreases.

FEATURES OF THE NUMERICAL SOLUTION OF BOUNDARY VALUE PROBLEMS WITH THE USE OF PYTHON ALGORITHMIC PROGRAMMING LANGUAGE

The solution of the majority of the practical tasks arising at calculation of constructions demands a numerical solution of boundary value problems. In article on examples of a solution of specific boundary value problems possibilities of a modern object-oriented programming language of Python are described. This lan-guage possesses convenient syntax and opportunities of flexible use of the existing libraries of the numerical methods allowing the user to prepare a program code and to start studying of a task in the shortest terms. Rich opportunities of graphic library Matplotlib are allowed to have graphic display of results of calculation. The Numpy library used in article is standard library for carrying out any matrix and vector calculations in the Python language, its application turns the Python language on Wednesday for programming of numerical calculations, similar to such widely known software products as Matlab and GNU Octave. In article the method of finite differences has solved a task for Laplace's equation, the describing field distribution of temperature on rectangular area; problem of search of a minimum of functionality of Dirikhle by a variational-difference method; a dy-namic problem of vibration of weight on a visco-elastic element at vibrations of the basis and a three-dimensional task of the theory of elasticity by a variational-difference method.

Features of the numerical solution of boundary value problems on Python algorithmic programming language

The solution of most practical problems arising in the calculation of structures requires a numerical solution of boundary value problems. In the article, examples of solving specific boundary-value problems describe the capabilities of the modern object-oriented programming language Python.

Object equivalence: revisiting object equality profiling (an experience report)

Modern object-oriented programming languages greatly alleviate the memory management for programmers. Despite the efficiency of garbage collection and Just-In-Time program analyzes, memory still remains prone to be wasted. A bloated memory may have severe consequences, including frequent execution lags due to a high pressure on the garbage collector and suboptimal object dependencies. We found that dynamically monitoring object production sites and the equivalence of the produced objects is key to identify wasted memory consumption caused by redundant objects. We implemented optimizations for reducing the memory consumption of six applications, achieving a reduction over 40% in half of the applications without having any prior knowledge of these applications. Our results partially replicate the results obtained by Marinov and O'Callahan and explore new ways to identify redundant objects.

Lightweight, flexible object-oriented generics

The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanism that adds expressive power and strengthens static checking, while remaining lightweight and simple in common use cases. Like type classes and concepts, the mechanism allows existing types to model type constraints retroactively. For expressive power, we expose models as named constructs that can be defined and selected explicitly to witness constraints; in common uses of genericity, however, types implicitly witness constraints without additional programmer effort. Models are integrated into the object-oriented style, with features like model generics, model-dependent types, model enrichment, model multimethods, constraint entailment, model inheritance, and existential quantification further extending expressive power in an object-oriented setting. We introduce the new genericity features and show that common generic programming idioms, including current generic libraries, can be expressed more precisely and concisely. The static semantics of the mechanism and a proof of a key decidability property can be found in an associated technical report.

Numerical implementation of the S-matrix algorithm for modeling of relief diffraction gratings

A new numerical implementation is developed to calculate the diffraction efficiency of relief diffraction gratings. In the new formulation, vectors containing the expansion coefficients of electric and magnetic fields on boundaries of the grating layer are expressed by additional constants. An S-matrix algorithm has been systematically described in detail and adapted to a simple matrix form. This implementation is suitable for the study of optical characteristics of periodic structures by using modern object-oriented programming languages and different standard mathematical software. The modeling program has been developed on the basis of this numerical implementation and tested by comparison with other commercially available programs and experimental data. Numerical examples are given to show the usefulness of the new implementation.

Developing a Secure Programming Module to cope with Modern Vulnerabilities

In a society reliant on software, it is imperative that students are provided with appropriate skills in order to deal with ever increasing types of attack. Facilitators should provide students with an understanding both of the theoretical concepts underpinning vulnerabilities and also how to implement remediation strategies in modern object oriented programming languages. Facilities should be provided that allow pupils to demonstrate an understanding of software constructs and practices that can result in problems either from malicious or inadvertent intent, and demonstrate how to defensively program for these in an object oriented programming language. They also need to be able to evaluate security implications and issues relevant to creating secure software. Finally, students need to be able to design and implement applications that use security management techniques. Graduating with these core skills should prepare industry better to deal with the issues they are facing daily.

Static Class Elements for Object-Z

Static variables and methods are part of almost every modern object-oriented programming language. Static elements are for instance indispensable for certain kinds of design patterns applied during programming. Object-oriented specification formalisms on the other hand lack such concepts. This can prevent writing formal specifications close to the actual implementation, and can thus hamper a refinement-based stepwise development.In this paper, we extend the state-based object-oriented specification language Object-Z with a concept for static class elements. We furthermore show how refinement can introduce static elements into a specification.

X10

It is now well established that the device scaling predicted by Moore's Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the rate that had been sustained during the last two decades. As a result, future systems are rapidly moving from uniprocessor to multiprocessor configurations, so as to use parallelism instead of frequency scaling as the foundation for increased compute capacity. The dominant emerging multiprocessor structure for the future is a Non-Uniform Cluster Computing (NUCC) system with nodes that are built out of multi-core SMP chips with non-uniform memory hierarchies, and interconnected in horizontally scalable cluster configurations such as blade servers. Unlike previous generations of hardware evolution, this shift will have a major impact on existing software. Current OO language facilities for concurrent and distributed programming are inadequate for addressing the needs of NUCC systems because they do not support the notions of non-uniform data access within a node, or of tight coupling of distributed nodes.We have designed a modern object-oriented programming language, X10, for high performance, high productivity programming of NUCC systems. A member of the partitioned global address space family of languages, X10 highlights the explicit reification of locality in the form of places }; lightweight activities embodied in async , future , foreach , and ateach constructs; a construct for termination detection ( finish ); the use of lock-free synchronization ( atomic blocks ); and the manipulation of cluster-wide global data structures. We present an overview of the X10 programming model and language, experience with our reference implementation, and results from some initial productivity comparisons between the X10 and Java™ languages.

Managing Code Dependencies in C#.

Most modern object oriented programming languages do not offer constructs to specify dependencies among members of a class. Public interfaces are written using member types and method signatures only, which are not capable of expressing such kind of relationships. We show that stating which dependencies exist between class members, i.e. which methods could be affected by a change in the implementation of the others, constitutes a relevant information to be shipped to inheritors in order to help them in subclassing without inconsistencies. In this paper we present a tool that supports developers in this task by exploiting C# attributes, that are annotations accessible at runtime. The tool will be integrated in the popular developer environment Visual Studio .NET.

Integr8: Enhanced Inter-Operability of European Molecular Biology Databases

The increasing production of molecular biology data in the post-genomic era, and the proliferation of databases that store it, require the development of an integrative layer in database services to facilitate the synthesis of related information. The solution of this problem is made more difficult by the absence of universal identifiers for biological entities, and the breadth and variety of available data. Integr8 was modelled using UML (Universal Modelling Language). Integr8 is being implemented as an n-tier system using a modern object-oriented programming language (Java). An object-relational mapping tool, OJB, is being used to specify the interface between the upper layers and an underlying relational database. The European Bioinformatics Institute is launching the Integr8 project. Integr8 will be an automatically populated database in which we will maintain stable identifiers for biological entities, describe their relationships with each other (in accordance with the central dogma of biology), and store equivalences between identified entities in the source databases. Only core data will be stored in Integr8, with web links to the source databases providing further information. Integr8 will provide the integrative layer of the next generation of bioinformatics services from the EBI. Web-based interfaces will be developed to offer gene-centric views of the integrated data, presenting (where known) the links between genome, proteome and phenotype.

Advanced Object-Oriented Modeling Techniques for Large Scale Systems

Some basic concepts of Demeter kernel method, Object Modeling Technique and Unified Modeling Language and effective features of modern object-oriented programming languages (Ada'95, Java, C++) are discussed in this paper. Each mean is described as an opportunity analyze, design and implement a large scale systems by using an object-oriented approach.