Search

Hyperbolic complex numbers are used in the description of hyperbolic spaces. One of the well-known examples of such spaces is the Minkowski space, which plays a leading role in the problems of the special theory of relativity and electrodynamics. However, such numbers are not very common in different programming languages. Of interest is the implementation of hyperbolic complex in scientific programming languages, in particular, in the Julia language. The Julia language is based on the concept of multiple dispatch. This concept is an extension of the concept of polymorphism for object-oriented programming languages. To implement hyperbolic complex numbers, the multiple dispatching approach of the Julia language was used. The result is a library that implements hyperbolic numbers. Based on the results of the study, we can conclude that the concept of multiple dispatching in scientific programming languages is convenient and natural.

We discuss integrating abstract data types (ADTs) in the KeY theorem prover by a new approach to model data types using Isabelle/HOL as an interactive back-end, and represent Isabelle theorems as user-defined taclets in KeY. As a case study of this new approach, we reason about Java's Collection interface using histories, and we prove the correctness of several clients that operate on multiple objects, thereby significantly improving the state-of-the-art of history-based reasoning. Open Science. Includes video material (Bian and Hiep in FigShare, 2021. https://doi.org/10.6084/m9.figshare.c.5413263) and a source code artifact (Bian et al. in Zenodo, 2022. https://doi.org/10.5281/zenodo.7079126). [ABSTRACT FROM AUTHOR]

The aim of the work is to develop an algorithm functioning by a face recognition system using object-oriented databases. The system provides automatic identification of the desired object or identifies someone using a digital photo or video frame from a video source. The technology includes comparing pre-scanned face elements from the resulting image with prototypes of faces stored in the database. Modern packages of object-oriented databases give the user the opportunity to create a new class with the specified attributes and methods, obtain classes that inherit attributes and methods from super classes, create instances of the class, each of which has a unique object identifier, extract these instances one by one or in groups, and also download and perform these procedures. Using a convolutional neural network in the algorithm allows the transition from specific features of the image to more abstract details.

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer's RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of "review scheme" is defined, which is like the concept of "bypassing" trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on "stroke-operation" (pointer dereference), which was hardware implemented in the command system of computer "Kyiv". Group operations of modernization of computer "Kyiv" addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer "Kyiv", due to operations with indirect addressing, have more capabilities than the first high-level programming language - Plankalkül. Machine commands of the computer "Kyiv" allow direct access to the i-th element of the "list" by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expediency of partial inclusion of Address Programming in modern programming languages. [ABSTRACT FROM AUTHOR]

Formation of notion is a fundamental process in education, and for that reason it is excessively studied in both psychology and pedagogy. The application of the pedagogical techniques has a key role in education in informatics (Asenova, 1990) and has significantly improved the results in introduction of complex notions in our practice. Such complex notion is abstract data type (ADT) which is a key concept in computer programming for developing data structures, data types, and have vast influence on the algorithms applied on them. In order to introduce the notion ADT we adopt a system of tasks that develop the needed knowledge through the important data structures of linked lists, queues and stacks. [ABSTRACT FROM AUTHOR]

We give an equational specification of the field operations on the rational numbers under initial algebra semantics using just total field operations and 12 equations. A consequence of this specification is that 0-1 = 0, an interesting equation consistent with the ring axioms and many properties of division. The existence of an equational specification of the rationals without hidden functions was an open question. We also give an axiomatic examination of the divisibility operator, from which some interesting new axioms emerge along with equational specifications of algebras of rationals, including one with the modulus function. Finally, we state some open problems, including: Does there exist an equational specification of the field operations on the rationals without hidden functions that is a complete term rewriting system? [ABSTRACT FROM AUTHOR]

Abstract Linearizability is a well-known consistency condition for shared objects in concurrent systems. We focus on the problem of implementing linearizable objects of arbitrary data types in message-passing systems with bounded, but uncertain, message delay and bounded, but non-zero, clock skew. We present an algorithm that exploits axiomatic properties of different operations to reduce the running time of each operation below that obtainable with previously known algorithms. We also prove lower bounds on the time complexity of various kinds of operations, specified by the axioms they satisfy, resulting in reduced gaps in some cases and tight bounds in others. [ABSTRACT FROM AUTHOR]

For over a decade, a declarative approach to problem solving based on the use of abstract data types (ADTs) has been taught to high-school students as part of the logic programming instructional unit. We conducted a study aimed at assessing students' problem-solving processes when utilizing ADTs. The findings indicated that students' strategies that diverged from the conceptual model often cause the students to develop incorrect programs. Specifically, students have difficulties in establishing correct mapping between the problem and its abstract model - the corresponding ADT, and in establishing proper connectivity between layers of abstraction related to different stages of the problem-solving processes (e.g., between distinct programming modules). These difficulties are apparently associated with general difficulties that novices encounter when learning programming, and with the cognitive load encountered when dealing with high levels of abstraction. With the intention to reduce student difficulties, we suggest using an instructional approach designed to gradually educate the students toward attaining proficiency as ``problem solvers'' through the use of integrative knowledge and autonomous problem-solving techniques. This approach should be further evaluated regarding its feasibility and applicability to reducing students' difficulties in dealing with abstraction processes.

Data Structures is an integral topic for any Computer Science or Software Engineering degree, identified as a Core Tier-1 topic of the ACM/IEEE Computer Science Curricula. The underlying concepts are inherently abstract, making them especially difficult to understand for novice programmers. This paper proposes a cognitively challenging technique to help students understand the thought process that the learning outcomes of fundamental data structure units aim to achieve. The development of this thought process is using a technique we term Visual Kinesthetic Pseudocode, with the overarching goal of helping students code without coding, yet providing the necessary scaffold to guide them in implementing the data structures with real code. This was implemented in the form of I NTERACTIVEDS, an app for students and teachers to guide the learning of fundamental data structure concepts. The evaluations demonstrate that students strongly credited I NTERACTIVEDS in aiding their understanding of concepts and confidence in applying data structure concepts in practice. The study is also a step forward in revealing potential threshold concepts pertaining to data structure modules. © 2016 Wiley Periodicals, Inc. Comput Appl Eng Educ 24:926-933, 2016; View this article online at ; DOI [ABSTRACT FROM AUTHOR]

In our contemporary society, phatic technologies routinely establish, develop and maintain personal and emotional relationships across time and space. This phenomenon is reminiscent of Giddens’ 1990 concept of abstract systems – made of symbolic tokens and expert systems – that disembed and re-embed public and professional life. In this paper, we develop social theory that aims to provide a better understanding of the prominent role of phatic technologies in society. We proceed in three stages: first, we critique and revise Giddens’ vague concept of symbolic tokens and its implications for time space distanciation by introducing novel concepts from measurement science. This focuses on forms of information that are relatively precise and communal. Secondly, building on our new formulation of abstract systems, we propose new sociological concepts, phatic systems and symbolic indicators , to enable social theory to explore and analyse the rise of phatic technologies. The concepts focus on the personal and emotional. Thirdly, reflecting on the fact that our digital society is held together by software, we introduce concepts from theoretical computer science to relate the abstract sociological idea of phatic systems and symbolic indicators to the concrete nature of digital data. [ABSTRACT FROM AUTHOR]

This paper describes a study aimed at identifying different profiles of students' project development processes. Specifically, we assessed the use of abstract data types for the development of knowledge-based projects. The concept of abstract data types was introduced to high school students who took the course ``Computer Science-Logic Programming''. During their studies the students learned and practiced various tools and methods of project development, one of which was based on the use of abstract data types as tools for problem solving and knowledge representation. To this end, a one-day workshop for team development of mini-projects was organized, and the whole development process was audio and video documented, categorized and analyzed. The profiles of team behavior in the project development process were specified. The analysis of the profiles resulted in identifying four types of project development teams, all of which employed some organizing tool in developing their projects. Two types of the developing teams used abstract data types and two used other methods. The findings indicated that the process of project development of those who used abstract data types was more structured and more organized than others.