bluuebunny/crossref_metadata_2025 huggingface dataset:
Eliminating Introns in Ant Colony Programming
Authors: Boryczka Mariusz
Published: December 2024

Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problemof eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time.
On Finite Model Property of the Equational Theory of Kleene	Algebras
Authors: Palka Ewa
Published: December 2024

The finite model property of the equational fragment of the theory of Kleene algebras is a consequence of Kozen's [3] completeness theorem. We show that, conversely, this completeness theorem can be proved assuming the finite model property of this fragment.
The Open Calculus of Constructions (Part II): An Equational Type	Theory with Dependent Types for Programming, Specification, and Interactive	Theorem Proving
Authors: Stehr Mark-Oliver
Published: December 2024

The open calculus of constructions integrates key features of Martin-Löf's type theory, the calculus of constructions, membership equational logic, and rewriting logic into a single uniform language. The two key ingredients are dependent function types and conditional rewriting modulo equational theories. We explore the open calculus of constructions as a uniform framework for programming, specification and interactive verification in an equational higher-order style. By having equational logic and rewriting logic as executable sublogics we preserve the advantages of a first-order semantic and logical framework and we provide a foundation for a broad spectrum of applications ranging from what could be called executable mathematics, involving symbolic computations and logical proofs, to software and system engineering applications, involving symbolic execution and analysis of nondeterministic and concurrent systems.
A Comparative Study of Algebra Viewpoint and Information Viewpoint	in Attribute Reduction
Authors: Wang Guoyin Y. , Zhao Jun , An Jiujiang , Wu Yu
Published: December 2024

Attribute reduction is an important issue in rough set theory and has already been studied from the algebra viewpoint and information viewpoint of rough set theory respectively. However, the concepts of attribute reduction based on these two different viewpoints are not equivalent to each other. In this paper, we make a comparative study on the quantitative relationship between some basic concepts of rough set theory like attribute reduction, attribute significance and core defined from these two viewpoints. The results show that the relationship between these conceptions from the two viewpoints is rather an inclusion than an equivalence due to the fact that the rough set theory discussed from the information point of view restricts attributes and decision tables more specifically than it does when considered from the algebra point of view. The identity of the two viewpoints will hold in consistent information decision tables only. That is, the algebra viewpoint and information viewpoint are equivalent for a consistent decision table, while different for an inconsistent decision table. The results are significant for the design and development of methods for information reduction.
A Secure Strong-Password Authentication Protocol
Authors: Wu Hsien-Chu , Hwang Min-Shiang , Liu Chia-Hsin
Published: December 2024

Password authentication, which is widely used for authenticated method, also is important protocol by requiring a username and password before being allowed access to resources. In 2001, Lin et al. proposed the optimal strong-password authentication protocol, called (OSPA) which is a one-time password method by verifying with the different verifier every time for affirming its identity. However, Chen-Ku and Tsuji-Shimizu pointed respectively out that OSPA is vulnerable to the stolen-verifier attack and impersonation attack. In this paper, we shall propose the improved protocol secure against the known attacks to enhance the security
Supporting Action-at-a-distance in Situated Cellular Agents
Authors: Bandini Stefania , Mauri Giancarlo , Vizzari Giuseppe
Published: December 2024

The aim of this paper is to describe algorithms and structures required to support action-at-a-distance in Situated Cellular Agents (SCA). This model provides the possibility to define heterogeneous entities placed in regular or irregular spatial infrastructures. Different mechanisms supporting field diffusion within these structures will be described and analyzed, with reference to their performance. A sample application of SCA model (a variation of Conway's Game of Life) will also be illustrated, while a more complex usage of action-at-a-distance for pedestrian simulation will be sketched.
An Image Retrieval System Based on the Color, Areas, and	Perimeters of Objects
Authors: Wang Ching-Lin , Hwang Ren-Hung , Chan Yung-Kuan , Chen Chih-Ya , Cheng Chuan-Chung
Published: December 2024

Two different objects can be generally distinguished by their colors, areas, and perimeters. This paper hence proposes an image retrieval system which uses the colors, areas, and perimeters of objects in an image as the features of the image. The system is insensitive to the shift and rotation variations of objects in images, as well as to the scale and noise variations of images. The experimental results show that this system is capable of recognizing different images very well.
The Axiomatization of the Rough Set Upper Approximation	Operations
Authors: Liu Gui-Long
Published: December 2024

The theory of rough sets deals with the approximation of an arbitrary subset of a universe by two definable or observable subsets called, respectively, the lower and the upper approximation. There are at least two methods for the development of this theory, the constructive and the axiomatic approaches. The rough set axiomatic system is the foundation of rough sets theory. This paper proposes a new matrix view of the theory of rough sets, we start with a binary relation and we redefine a pair of lower and upper approximation operators using the matrix representation. Different classes of rough set algebras are obtained from different types of binary relations. Various classes of rough set algebras are characterized by different sets of axioms. Axioms of upper approximation operations guarantee the existence of certain types of binary relations (or matrices) producing the same operators. The upper approximation of the Pawlak rough sets, rough fuzzy sets and rough sets of vectors over an arbitrary fuzzy lattice are characterized by the same independent axiomatic system.
On k-NN Method with Preprocessing
Authors: Suraj Zbigniew , Delimata Pawel
Published: December 2024

The objective of this study is to introduce a new model of data classification based on preliminary reduction of the training set of examples (preprocessing) in order to facilitate the use of nearest neighbours (NN) techniques in near real-time applications. This study accordingly addresses the issue of minimising the computational resource requirements of NN techniques, memory as well as time. The approach proposed in the paper is a modification of the classical k-Nearest Neighbours (k-NN) method and the k-NN method with local metric induction. Generally, the k-NN method with local metric induction in comparison with the classical k-NN method gives better results in the classification of new examples. Nevertheless, for the large data sets the k-NN method with local metric induction is less time effective than the classical one. The time/space efficiency of classifying algorithms based on these two methods depends not only on a given metric but also on the size of training data. In the paper, we present three methods of preliminary reduction of the training set of examples. All reduction methods decrease the size of a given experimental data preserving the relatively high classification accuracy. Results of experiments conducted on well known data sets, demonstrate the potential benefits of such reduction methods.
Perfect Hashing Schemes for Mining Traversal Patterns
Authors: Chang Chin-Chen , Lin Chih-Yang , Chou Henry
Published: December 2024

Hashing schemes are a common technique to improve the performance in mining not only association rules but also sequential patterns or traversal patters. However, the collision problem in hash schemes may result in severe performance degradation. In this paper, we propose perfect hashing schemes for mining traversal patterns to avoid collisions in the hash table. The main idea is to transform each large itemsets into one large 2-itemset by employing a delicate encoding scheme. Then perfect hash schemes designed only for itemsets of length two, rather than varied lengths, are applied. The experimental results show that our method is more than twice as faster than FS algorithm. The results also show our method is scalable to database sizes. One variant of our perfect hash scheme, called partial hash, is proposed to cope with the enormous memory space required by typical perfect hash functions. We also give a comparison of the performances of different perfect hash variants and investigate their properties.
An Improved Tree-Structured Codebook Search Algorithm for	Grayscale Image Compression
Authors: Hu Yu-Chen , Chang Chin-Chen
Published: December 2024

In this paper, an improved tree-structured codebook search algorithm is proposed. It is called the two-level codebook search algorithm (TLCS). The goal of this method is to reduce the computation cost of the multi-path-searching algorithm for TSVQ. It speeds up the codebook search by searching only a two-level codebook tree instead of the whole TSVQ codebook tree. According to the experimental results, a significant time reduction can be achieved with this method, compared to the multi-path-searching algorithm. In other words, our TLCS outperforms the multi-path-searching algorithm.
Exact Computation of Minimum Feedback Vertex Sets with Relational	Algebra
Authors: Berghammer Rudolf , Fronk Alexander
Published: December 2024

A feedback vertex set of a graph is a subset of vertices containing at least one vertex from every cycle of the graph. Given a directed graph by its adjacency relation, we develop a relational algorithm for computing a feedback vertex set of minimum size. In combination with a BDD-implementation of relations, it allows to exactly solve this NP-hard problem for medium-sized graphs.
Thread Algebra with Multi-Level Strategies
Authors: Bergstra J.A. , Middelburg C.A.
Published: December 2024

In a previous paper, we developed an algebraic theory about threads and multi-threading based on the assumption that a deterministic interleaving strategy determines how threads are interleaved. The theory includes interleaving operators for a number of plausible deterministic interleaving strategies. The interleaving of different threads constitutes a multi-thread. Several multi-threads may exist concurrently on a single host in a network, several host behaviors may exist concurrently in a single network on the internet, etc. In the current paper, we assume that the above-mentioned kind of interleaving is also present at these other levels. We extend the theory developed so far with features to cover the multi-level case. We use the resulting theory to develop a simplified formal representation schema of systems that consist of several multi-threaded programs on various hosts in different networks. We also investigate the connections of the resulting theory with the algebraic theory of processes known as ACP.
Complexity of Searching for a Black Hole
Authors: Czyzowicz Jurek , Kowalski Dariusz , Markou Euripides , Pelc Andrzej
Published: December 2024

A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.
A Formal Language Analysis of DNA Hairpin Structures
Authors: Kari L. , Losseva E. , Konstantinidis S. , Sosík P. , Thierrin G.
Published: December 2024

The concept of hairpin structures in formal languages is motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form xuyθ(u)z, with certain additional conditions, for an involution θ (a function θ with the property that θ ^2 equals the identity function). A particular involution, the so-called Watson-Crick involution, can characterize binding of two DNA strands.

We study algebraic and decision properties, finiteness and descriptional complexity of hairpin (-free) languages. We show an existence of polynomial-time algorithms deciding hairpin-freeness of regular and context-free sets. Two related DNA secondary structures are considered, taking into the account imperfect bonds (bulges, mismatches) and multiple hairpins. Finally, effective methods for design of long hairpin-free DNA words are given.
Limits of Modularity
Authors: Bednarczyk Marek A.
Published: December 2024

It has been observed that various synchronisation operators underlying the modular design of concurrent systems can be explained as pullbacks in suitable categories of concurrent systems. Here, the boundaries of such approach are investigated. For this purpose we study the issue of completeness in categories of trace monoids. It turns out that (finite) completeness is achieved if trace monoids with concurrency preserving homomorphisms are considered. Taking arbitrary monoid homomorphisms leads, in general, to incompleteness.

The results obtained are used to reveal an area in which the code problem for trace monoids, undecidable in general, has always a positive answer.
A Categorical View on Algebraic Lattices in Formal Concept	Analysis
Authors: Hitzler Pascal , Krötzsch Markus , Zhang Guo-Qiang
Published: December 2024

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched with notions such as approximation by computation or representability. The latter are commonly studied in denotational semantics and domain theory and captured most prominently by the notion of algebraicity, e.g. of lattices. In this paper, we explore the notion of algebraicity in formal concept analysis from a category-theoretical perspective. To this end, we build on the notion of approximable concept with a suitable category and show that the latter is equivalent to the category of algebraic lattices. At the same time, the paper provides a relatively comprehensive account of the representation theory of algebraic lattices in the framework of Stone duality, relating well-known structures such as Scott information systems with further formalisms from logic, topology, domains and lattice theory.
Capabilities of Thoughtful Machines
Authors: Kalyanasundaram Bala , Velauthapillai Mahe
Published: December 2024

When learning a concept the learner produces conjectures about the concept he learns. Typically the learner contemplates, performs some experiments, make observations, does some computation, thinks carefully (that is not output a new conjecture for a while) and then makes a conjecture about the (unknown) concept. Any new conjecture of an intelligent learner should be valid for at least some "reasonable amount of time" before some evidence is found that the conjecture is false. Then maybe the learner can further study and explore the concept more and produce a new conjecture that again will be valid for some "reasonable amount of time". In this paper we formalize the idea of reasonable amount of time. The learners who obey the above constraint are called "Thoughtful learners" (TEX learners). We show that there are classes that can be learned using the above model. We also compare this leaning paradigm to other existing ones. The surprising result is that there is no capability intervals in team TEX-type learning. On the other hand, capability intervals exist in all other models. Also these learners are orthogonal to the learners that have been studied in the literature.
A New Approach to the Concepts of Boundary and Contact: Toward an	Alternative to Mereotopology
Authors: Breysse Olivia , De Glas Michel
Published: December 2024

Mereotopology is a class of formal theories devoted to the analysis of spatiotemporal entities and their interactions. It has produced important advances in the analysis of natural language, naive geography and computer vision, illustrating a broad range of applications. However, it has been shown that the modelling of interactions between spatiotemporal entities with mereotopology can lead to unsolvable problems, including disconnectedness of the representation space as well as a mixup of the relationships of contact and overlap. The origin of these problems, which fundamentally limit the usefulness of mereotopology, has not been fully identified. In this paper, we first formally demonstrate that these problems originate from the incompatibility of the concepts of boundary, continuity and contact within the framework of mereotopology, as suggested by previous studies. Secondly, we prove that this incompatibility stems from the formalization of these concepts through topology. We show that a solution can be found by substituting for topology an alternative theory, known as locology, which provides new mathematical tools for the modelling of spatiotemporal entities.
Maurer Computers with Single-Thread Control
Authors: Bergstra Jan A. , Middelburg Cornelis A.
Published: December 2024

We investigate basic issues concerning stored threads and their execution, building upon Maurer's model for computers and the thread algebra of Bergstra et al. We show among other things that a single thread can control the execution on a Maurer machine of any executable finite-state thread stored in the memory of the Maurer machine. We also relate stored threads with programs as considered in the program algebra of Bergstra et al. The work is intended as a preparation for the development of a formal approach to model micro-architectures and to verify their correctness and anticipated speed-up results.
Security Analysis of the Pomykala-Barabasz Scheme
Authors: Li Fagen , Hu Yupu
Published: December 2024

In 2006, Pomykala and Barabasz [Fundamenta Informaticae 69 (2006) 411–425] proposed an elliptic curve based threshold proxy signature scheme which requires shorter cryptographic keys. They claimed that their scheme satisfies the secrecy, the proxy protected, the unforgeability, the non-repudiation, and the known signers. However, in this paper, we show that their scheme cannot achieve the proxy protected, the unforgeability and the non-repudiation by demonstrating a conspiracy attack. In this attack, any t malicious proxy signers can collusively impersonate some other proxy signers to generate proxy signatures.
A Generalization of the Assignment Problem, and its Application to	the Rank Aggregation Problem
Authors: Manea Florin , Ploscaru Călina
Published: December 2024

In this paper we propose a generalization of the Assignment Problem. First, we describe an algorithm, based on network flow techniques, that obtains just one solution of the approached problem; further, we develop an algorithm that is able to find all the solutions. Finally, we discuss how this general form of the Assignment Problem can be applied in solving the Rank Aggregation Problem, in the case of rankings with ties.
Image Search using Dominant Colors
Authors: Galiński Grzegorz , Skarbek Władysław
Published: December 2024

In this paper, the use of the Dominant Color descriptor, one of the visual descriptors defined in MPEG-7 standard for image indexing and search, is discussed. Various similarity functions for matching the descriptors are presented. Next, the concept of dominant colors cumulative distribution function (CDF) is introduced and a new distance function for the descriptors matching is also proposed. The function is equivalent to the computing volume of space bounded by two dominant colors CDFs. Efficient algorithm for computing CDF-based distance which uses the properties of discrete CDF function, is also presented. Finally, various dominant colors matching methods are compared in a similarity image search scenario consisting of 'query-by-example' nearest neighbours search, and the experimental results are presented and discussed.
On the Controller Synthesis for Finite-State Markov Decision	Processes
Authors: Kučera Antonín , Stražovský Oldřich
Published: December 2024

We study the problem of effective controller synthesis for finite-state Markov decision processes (MDPs) and the class of properties definable in the logic PCTL extended with long-run average propositions. We show that the existence of such a controller is decidable, and we give an algorithm which computes the controller if it exists. We also address the issue of "controller robustness", i.e., the problem whether there is a controller which still guarantees the satisfaction of a given property when the probabilities in the considered MDP slightly deviate from their original values. From a practical point of view, this is an important aspect since the probabilities are often determined empirically and hence they are inherently imprecise. We show that the existence of robust controllers is also decidable, and that such controllers are effectively computable if they exist.
An Algorithmic Solution of a Birkhoff Type Problem
Authors: Simson Daniel , Wojewódzki Mariusz
Published: December 2024

We give an algorithmic solution in a simple combinatorial data of Birkhoff0s type problem studied in [22] and [25], for the category rep _{ft} (I,K[t]/(t ^m )) of filtered I-chains of modules over the K-algebra K[t]/(t ^m ) of K-dimension m <∞, where m ⩾ 2, I is a finite poset with a unique maximal element, and K is an algebraically closed field. The problem is to decide when the indecomposable objects of the category rep _{ft} (I,K[t]/(t ^m )) admit a classification by means of a suitable parametrisation.

A complete solution of this important problem of the modern representation theory is contained in Theorems 2.4 and 2.5. We show that rep _{ft} (I,K[t]/(t ^m )) admits such a classification if and only if (I,m) is one of the pairs of the finite list presented in Theorem 2.4, and such a classification does not exist for rep _{ft} (I,K[t]/(t ^m )) if and only if the pair (I,m) is bigger than or equal to one of the minimal pairs of the finite list presented in Theorem 2.5.

The finite lists are constructed by producing computer accessible algorithms and computational programs written in MAPLE and involving essentially the package CREP (see Section 4). On this way the lists are obtained as an effect of computer computations. In particular, the solution we get shows an importance of the computer algebra technique and computer computations in solving difficult and important problems of modern algebra.
A Relation-Algebraic Theory of Bisimulations
Authors: Winter Michael
Published: December 2024

In this paper we develop an algebraic/categorical theory of bisimulations using relational methods. We define a general notion, which is capable of handeling different version of bisimilarity in a common context. Furthermore, the approach relates bisimulations with the notion of a covering known from the theory of graphs and their applications in topology and complex analysis.
Some Alternatives to Parikh Matrices Using String Kernels
Authors: Clark Alexander , Watkins Chris
Published: December 2024

We describe methods of representing strings as real valued vectors or matrices; we show how to integrate two separate lines of enquiry: string kernels, developed in machine learning, and Parikh matrices [8], which have been studied intensively over the last few years as a powerful tool in the study of combinatorics over words. In the field of machine learning, there is widespread use of string kernels, which use analogous mappings into high dimensional feature spaces based on the occurrences of subwords or factors. In this paper we show how one can use string kernels to construct two alternatives to Parikh matrices, that overcome some of the limitations of the Parikh matrix construction. These are morphisms from the free monoid to rings of real-valued matrices under multiplication: one is based on the subsequence kernel and the other on the gap-weighted string kernel. For the latter kernel we demonstrate that for many values of the gap-weight hyperparameter the resulting morphism is injective.
Change Detection of Remote Sensing Images with Semi-supervised	Multilayer Perceptron
Authors: Patra Swarnajyoti , Ghosh Susmita , Ghosh Ashish
Published: December 2024

A context-sensitive change-detection technique based on semi-supervised learning with multilayer perceptron is proposed here. In order to take contextual information into account, input patterns are generated considering each pixel of the difference image along with its neighboring pixels. A heuristic technique is suggested to identify a few initial labeled patterns without using ground truth information. The network is initially trained using these labeled data. The unlabeled patterns are iteratively processed by the already trained perceptron to obtain a soft class label. Experimental results, carried out on two multispectral and multitemporal remote sensing images, confirm the effectiveness of the proposed approach.
Satisfiability of Formulas from the Standpoint of Object	Classification: The RST Approach
Authors: Gomolińska Anna
Published: December 2024

In this article we discuss judgment of satisfiability of formulas of a knowledge representation language as an object classification task. Our viewpoint is that of the rough set theory (RST), and the descriptor language for Pawlak's information systems of a basic kind is taken as the study case. We show how certain analogy-based methods can be employed to judge satisfiability of formulas of that language.
Case-based Planning of Treatment of Infants with Respiratory	Failure
Authors: Góra Grzegorz , Kruczek Piotr , Skowron Andrzej , Bazan Jan G. , Bazan-Socha Stanisława , Pietrzyk Jacek J.
Published: December 2024

We discuss medical treatment planning in the context of case-based planning, where plans (of treatment) are treated as complex decisions. A plan for a particular case is constructed from known plans for similar training examples. In order to evaluate and improve the prediction quality of complex decisions, we use a method for approximation of similarity measure between plans. The method makes it possible to transform the acquired domain knowledge about similarities of plans, expressed by medical experts in natural language, to a low level language understandable by the system. To accomplish this task, we developed a method for approximation of the ontology of concepts expressed by medical experts. We present two applications of the ontology approximation, namely, for approximation of similarity between patient histories and for approximation of compatibility of patient histories with planned therapies. Next, we use these concept approximations to define two measures on which are based two methods for (plan) therapy prediction. The article includes results of experiments with these methods performed on medical data obtained from Neonatal Intensive Care Unit, First Department of Pediatrics, Polish-American Institute of Pediatrics, Collegium Medicum, Jagiellonian University, Krak?ow, Poland. The experiments are pertained to the identification of infants' death risk caused by respiratory failure.
Token History Petri Nets
Authors: van Hee Kees , Serebrenik Alexander , Sidorova Natalia
Published: December 2024

State of the art information system commonly record events in log files, also known as audit trails. Moreover, business processes often go beyond the sole recording the events and base decisions on the events observed in the past. To model such processes we extend the basic Petri net framework with the notion of history by associating tokens with histories, adding guards evaluated on the history to the transitions and mapping arcs to expressions involving histories. Guards and arc expressions can involve data associated with the transitions.
Memory-Based State-Estimation
Authors: Jüngel Matthias , Mellmann Heinrich
Published: December 2024

In this paper we introduce a state-estimation method that uses a short-term memory to calculate the current state. A common way to solve state estimation problems is to use implementations of the Bayesian algorithmlike Kalman filters or particle filters. When implementing a Bayesian filter several problems can arise. One difficulty is to obtain error models for the sensors and for the state transitions. The other difficulty is to find an adequate compromise between the accuracy of the belief probability distribution and the computational costs that are needed to update it. In this paper we show how a short-term memory of perceptions and actions can be used to calculate the state. In contrast to the Bayesian filter, this method does not need an internal representation of the state which is updated by the sensor and motion information. It is shown that this is especially useful when information of sparse sensors (sensors with non-uniquemeasurements with respect of the state) has to be integrated.
Specification and Verification of Invariants by Exploiting Layers	in OO Designs
Authors: Middelkoop Ronald , Huizing Cornelis , Kuiper Ruurd , Luit Erik J.
Published: December 2024

The layering that is present in many OO designs is not accounted for in current interpretations of invariants. We propose to make layers explicit in specifications and introduce a new interpretation of invariants that exploits these layers. Furthermore, we present a sound, modular technique to statically verify that programs satisfy the new interpretation.
Some Aspects of Parsing Expression Grammar
Authors: Redziejowski Roman R.
Published: December 2024

Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a topdown processwith limited backtracking. It can be directly transcribed into a recursive-descent parser. The parser does not require a separate lexer, and backtracking removes the usual LL(1) constraint. This is convenient for many applications, but there are two problems: PEG is not well understood as a language specification tool, and backtracking may result in exponential processing time. The paper consists of two parts that address these problems. The first part is an attempt to find out the language actually defined by a given parsing expression. The second part reports measurements of backtracking activity in a PEG-derived parser for the programming language C.
Distance Measures Induced by Finite Approximation Spaces and	Approximation Operators
Authors: Wolski Marcin
Published: December 2024

In this paper we study metric properties of finite approximation spaces and approximation operators from Rough Set Theory. In the first part of the article we examine finite approximation spaces and finite approximation topological spaces regarded as particular instances of two basic types of information structures from the framework of Information Quanta: information quantum relational systems and property systems, respectively. In the second part of the paper is the Marczewski-Steinhaus metric discussed as a certain distance of sets defined with respect to the approximation operators. We propose two types of á la Marczewski-Steinhaus distance functions: the first type is based on the lower approximation operator; the second one is based on the upper approximation operator. These types can be defined with respect to both finite approximation spaces (information quantum relational systems) and finite approximation topological spaces (property systems), giving us four distancemeasure functions. In order to define a distance of sets which preserves their lower and upper approximations, one can take the sum of two respective functions.
Towards Verification of Java Programs in perICS
Authors: Zbrzezny Andrzej , Woźna Bożena
Published: December 2024

VerICS is a tool for the automated verification of timed automata and protocols written in both the Intermediate Language and the specification language Estelle. Recently, the tool has been extended to work with Timed Automata with Discrete Data and with multi-agent systems. This paper presents a prototype Timed Automata with Discrete Data model of Java programs. In addition, we show how to use the model together with the verification core of VerICS to validate the well-known alternating bit protocol written in Java.
On the Normalized Cut
Authors: Nadarajah Saralees
Published: December 2024

In the recent paper by Soundararajan and Sarkar (2003), the normalized cut, a graph partitioning measure for perceptual organization, was shown to be a sum of two beta distributed random variables and expressions derived for its mean and mode. Here, it is pointed out that the given expression for the mode is incorrect. The correct expression is derived and the implications of the error discussed.
High Capacity Data Hiding for Grayscale Images
Authors: Chang Chin-Chen , Chou Yung-Chen , Kieu The Duc
Published: December 2024

High embedding capacity and low image distortion factors are main concerns of information hiding researchers. No scheme can achieve these two factors simultaneously. The purpose of achieving either high embedding capacity or low image distortion varies from application to application. This paper presents a high embedding capacity information hiding method for grayscale images. The proposed method converts binary secret data into secret digits in the base-5 numeral system first. Next, one secret digit in the base-5 numeral system is embedded into one cover pixel. The experimental results show that the proposed method can be used to embed two secret bits into one cover pixel with the imperceptible image distortion. Comparing with some other works, we found that our method indeed outperforms all others in terms of embedding capacity.
Complete Process Semantics of Petri Nets
Authors: Juhás Gabriel , Lorenz Robert , Mauser Sebastian
Published: December 2024

In the first part of this paper we extend the semantical framework proposed in [22] for process and causality semantics of Petri nets by an additional aim, firstly mentioned in the habilitation thesis [15]. The aim states that causality semantics deduced from process nets should be complete w.r.t. step semantics of a Petri net in the sense that each causality structure which is enabled w.r.t. step semantics corresponds to some process net.

In the second part of this paper we examine several process semantics of different Petri net classes w.r.t. this aim. While it is well known that it is satisfied by the process semantics of place/transition Petri nets (p/t-nets), we show in particular that the process semantics of p/t-nets with weighted inhibitor arcs (PTI-nets) proposed in [22] does not satisfy the aim. We develop a modified process semantics of PTI-nets fulfilling the aim of completeness and also all remaining axioms of the semantical framework. Finally, we sketch results in literature concerning the aim of completeness for process definitions of various further Petri net classes.

The paper is a revised and extended version of the conference paper [18].
On Descriptional Complexity of Partially Parallel Grammars
Authors: Masopust Tomáš , Meduna Alexander
Published: December 2024

This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-nonterminalmulticontinuous grammar with no more than two selectors.
Robust User Password Change Scheme based on the Elliptic Curve	Cryptosystem
Authors: Yoon Eun-Jun , Yoo Kee-Young
Published: December 2024

In this paper, an efficient user password change scheme based on the elliptic curve discrete logarithm problem (ECDLP) is presented. In contrast to the existing password change schemes using a server's public key, the proposed scheme can securely update user passwords without a complicated process and server's public key, and also provides explicit key authentication in the case of a session key agreement.
Nondeterminism in Constructive Z
Authors: Haghighi Hassan , Mirian-Hosseinabadi Seyed-Hassan
Published: December 2024

The abstraction inherent in most specifications and the need to specify nondeterministic programs are two well-known sources of nondeterminism in formal specifications. In this paper, we present a Z-based formalism by which one can specify bounded, unbounded, erratic, angelic, demonic, loose, strict, singular, and plural nondeterminism. To interpret our specifications, we use a constructive set theory, called CZ set theory, instead of the classical set theory Z. We have chosen CZ since it allows us to investigate the notion of nondeterminism from the formal program development point of view. In this way, we formally construct functional programs from Z specifications and then probe the effects of the initially specified nondeterminism on final programs. Our investigation shows that without specifying nondeterminism explicitly, the effects of the nondeterminism involved in initial specifications will not be preserved in final programs. We prove that using the new formalism, proposed by this paper, for writing nondeterministic specifications leads to programs that preserve the initially specified modalities of nondeterminism.
Class Specific Fuzzy Decision Trees for Mining High Speed Data	Streams
Authors: Hashemi Sattar , Kangavari Mohammadreza , Yang Ying
Published: December 2024

In recent years, classification learning for data streams has become an important and active research topic. A major challenge posed by data streams is that their underlying concepts can change over time, which requires current classifiers to be revised accordingly and timely. To detect concept change, a common method is to observe the online classification accuracy. If accuracy drops below some threshold value, a concept change is deemed to have taken place. An implicit assumption behind this methodology is that any drop in accuracy can be interpreted as a symptom of concept change. Unfortunately however, this assumption is often violated in the real world where data streams carry noise and missing values that can also introduce a significant reduction in classification accuracy. To compound this problem, traditional noise cleansing methods are not applicable to data streams. These methods normally need to scan data multiple times whereas learning in data streams can only afford one-pass scan because of data's high speed and huge volume. To solve these problems, this paper proposes a novel classification algorithm, Class Specific Fuzzy Decision Trees (CSFDT), which utilizes fuzzy logic to classify data streams. The base classifier of CSFDT is a binary fuzzy decision tree. Whenever the problem of concern contains q classes (q > 2), CSFDT learns one binary classifier for each class to distinguish instances of this class from instances of the remaining (q − 1) classes. The CSFDT's advantages are three folds. First, it offers an adaptive structure to effectively and efficiently handle concept change. Second, it is robust to noise. Third, it deals with missing values in an elegant way. As a result, accuracy drop can be safely attributed to concept change. Extensive evaluations are conducted to compare CSFDT with representative existing data stream classification algorithms on a large variety of data. Experimental results suggest that CSFDT provides a significant benefit to data stream classification in real-world scenarios where concept changes, noise and missing values coexist.
Efficient Implementation of the Italiano Algorithms for Updating	the Transitive Closure on Associative Parallel Processors
Authors: Nepomniaschaya Anna
Published: December 2024

We propose a simple data structure for an efficient implementation of the Italiano algorithms for the dynamic updating of the transitive closure of a directed graph represented as adjacency matrix on a model of associative (or content addressable) parallel processors with vertical processing (the STAR–machine). Associative versions of the Italiano algorithms are represented as procedures DeleteArc1 and InsertArc1. We prove the correctness of these procedures and evaluate their time and space complexity. We also present the main advantages of associative versions of the Italiano algorithms.
On the Axiomatic System of SBL¬algebras
Authors: Švrček Filip
Published: December 2024

SBL¬-algebras were introduced as algebraic models for the basic strict fuzzy logic SBL extended with an involutive negation. The open problemof a minimal independent axiomatic system of the SBL¬-algebras is resolved in the paper.
Comparing Trade-off Based Models of the Internet
Authors: Spatharis Anthony , Foudalis Ilias , Sideri Martha , Papadimitriou Christos
Published: December 2024

We introduce and evaluate several new models of network growth. Our models are extensions of the FKP model, modifying and improving it in various dimensions. In all these models nodes arrive one by one, and each node is connected to previous nodes by optimizing a trade-off between a geometric objective ("last mile cost") and a topological objective ("position in the network"). Our new models differ from the original FKP model in directions inspired by the real Internet: two or more edges are attached to each arriving node (while the FKP model produces a tree); these edges are chosen according to various criteria such as robustness; edges may be added to the network between old nodes; or only certain "fertile" nodes (an attribute that changes dynamically) are capable of attracting new edges. We evaluate these models, and compare them with the graph of the Internet's autonomous systems, with respect to a suite of many test parameters (such as average degree, power law exponent, and local clustering rank) proposed in the literature; to this end we have developed the network generation and measurement system Pandora.
Genetic studies of normal tension glaucoma
Authors:   Kazan State Medical University, Kazan, Russian Federation, Plotnikov D.Yu. , Valeeva E.V. ,   Kazan State Medical University, Kazan, Russian Federation
Published: December 2024

The paper presents a review of literature on genetic studies of normal tension glaucoma (NTG). Actually, it is known that NTG is a multifactorial
disease whose development includes environmental and genetic factors. To date, a number of studies focused on NTG-associated genetic
factors was performed. Several of them reported that polymorphisms of the OPA1 and OPTN genes can be genetic markers of NTG risk. The
studies demonstrated that polymorphisms of genes encoding mitochondrial proteins including mitofusins 1 and 2, as well as the PARL gene,
are associated with an increased NTG risk. In addition, an association of single-nucleotide polymorphisms of the Toll-like receptor 4 gene with
NTG was revealed. Altered immune response and enhanced apoptosis may also play a role in NTG pathogenesis. Variations in a number of
TBK1 gene copies are also associated with NTG development in some populations. Among multiple genome-wide association studies (GWAS)
of the glaucoma, genetic architecture of NTG has been studied only in isolated cases. These studies identified several NTG-associated genes
such as SRBD1, ELOVL5, CDKN2B-AS1, FOXC1, TMCO1, CDKN1A and SIX1-SIX6. The genetic study results provide a better understanding
of the glaucoma development mechanisms, and the data can be used to design novel diagnostic and therapeutic methods.
KEYWORDS: glaucoma, normal tension glaucoma, genes, genetic studies, polymorphisms.
FOR CITATION: Plotnikov D.Yu., Valeeva E.V. Genetic studies of normal tension glaucoma. Russian Journal of Clinical Ophthalmology.
2024;24(4):193–199 (in Russ.). DOI: 10.32364/2311-7729-2024-24-4-5
Anomalous Scaling and Magnetization Temperature Dependence in Cubic Ferromagnetic Crystals
Authors: Kolokolov Igor , L'vov Victor S. , Pomyalov Anna
Published: December 2024

Recent developments in spintronics have drawn renewed attention to the spin dynamics of cubic ferromagnetic crystals EuO and EuS. These ferromagnets have the simplest possible magnetic structure, making them the most suitable systems for testing various theoretical models of magnetic materials. A commonly used Wess mean-field approximation (MFA) provides only a qualitative description of magnetization temperature dependence \(M(T)\). We develop a consistent theory for \(M(T)\), based on the perturbation diagrammatic technique for spin operators, leading to an excellent quantitative agreement with the experimental dependence of \(M(T)\) for EuO and EuS throughout the entire temperature range from \(T=0\) to Curie temperature \(T_C\). In particular, our theoretical dependence \(M(T)\) demonstrates an anomalous scaling behavior \(M(T) \propto (T_C-T)^\beta\) with the scaling index \(\beta \approx 1/3\) in a wide range of temperatures, in agreement with the experimentally observed scaling in EuO and EuS. This scaling index is principally different from the scaling index \(\beta = 1/2\) predicted by the MFA.
Model Contribution Rate Theory: An Empirical Examination
Authors: Bishop Vincil , Simske Steven
Published: December 2024

The paper presents a systematic methodology for analyzing software developer productivity by refining contribution rate metrics to distinguish meaningful development efforts from anomalies. Using the Mean-High Model Contribution Rate (mhMCR) method, the research introduces a statistical framework that focuses on continuous contributions, mitigating distortions caused by tool-assisted refactoring, delayed commits, or automated changes. The methodology integrates clustering techniques, commit time deltas, and contribution sizes to isolate natural, logical work patterns and supports the accurate imputation of effort for contributions outside these patterns. Through empirical validation across multiple commercial repositories, the mhMCR method demonstrates enhanced precision in productivity measurement in identifying sustained developer activity. The findings provide actionable insights for optimizing team performance and workflow management in modern software engineering practices.