bluuebunny/crossref_metadata_2025 huggingface dataset:
Asymptotic expansions for membranes subjected to a lifting force in a part of their boundary
Authors: Amar Micol , Berrone Lucio R. , Gianni Roberto
Published: December 2024

The framework of this paper is given by the mixed boundary‐value problem [Formula: see text] where Ω is a plane domain bounded by a regular curve composed by two arcs Γ0 and Γ1. Assuming that |Γ1|=ε and denoting by u[ε] the solution to this problem, we study some asymptotic expansions in terms of ε which are related to u[ε]. Some connections are presented among these expansions, on one hand, and the geometry of the domain Ω, on the other. In addition, a systematic way is found for computing at the boundary the Ghizzetti's integral that solves the problem.
A minimization problem related to the Ginzburg–Landau model
Authors: Khenissy Saïma
Published: December 2024

We consider the minimization of the Dirichlet integral ∫Ω|∇u|2 with the constraint ∫Ω(1−|u|2)2≤λ, for maps u∈H1(Ω; $\mathbb{R} ^{2})$ , where Ω⊂ $\mathbb{R} ^{2}$ is a smooth, bounded and simply connected domain, u=g on ∂Ω with g :∂Ω→S1 unit circle in $\mathbb{R} ^{2}$ , and λ is a positive small parameter. Denoting by d the topological degree of g, we study the asymptotic behavior of a minimizer uλ when λ goes to zero, for d=0 and d≠0. When d=0, we show the convergence of uλ in various norms to a smooth harmonic map u*  :Ω→S1. When d≠0 (d>0) we show that uλ converges to a smooth harmonic map u0  :Ω\{a1,a2,…,ad}→S1, where a1,a2,…,ad are the vortices where the energy of a minimizer ∫Ω|∇uλ|2 concentrates, when λ→0.
Local existence and blow‐up criterion for the Euler equations in the Besov spaces
Authors: Chae Dongho
Published: December 2024

We prove the local in time existence and a blow‐up criterion of solutions in the Besov spaces for the Euler equations of inviscid incompressible fluid flows in Rn, n≥2. As a corollary we obtain the persistence of Besov space regularity for the solutions of the 2‐D Euler equations with initial velocity belonging to the Besov spaces. For the proof of the results we establish a logarithmic inequality of the Beale–Kato–Majda type and a Moser type of inequality in the Besov spaces.
Homogenization of some variational inequalities for elasto‐plastic torsion problems
Authors: Piat V. Chiadò , Sandrakov G.V.
Published: December 2024

Methods of homogenization for variational inequalities with gradient constraints are presented. The variational inequalities are defined by a monotone operator of second order with periodic rapidly oscillating coefficients. The macroscopic homogenized (limiting) variational inequality satisfied by the limit of the solutions of the variational inequalities is deduced. Methods of variational inequalities theory and the notion of two‐scale convergence are used for passage to the limit. The relevant feature of the homogenized variational inequality is its twice‐nonlinear form, which is different from that of the initial variational inequality. A comparison with the homogenization for constrained minimization problems is given.
On a singularly perturbed, coupled parabolic–parabolic problem
Authors: Barbu Luminiţa , Moroşanu Gheorghe
Published: December 2024

In this paper we study a model for convection–diffusion processes in which (1) the characters of both diffusion and convection change discontinuously at an internal domain point, (2) there is a small parameter ε, making it a singular perturbation problem, and (3) one of the boundary conditions is nonlinear. Specifically, the problem is (Sε), (BCε), (ICε), (TCε) formulated below. The problem is singularly perturbed with respect to the uniform convergence topology, with an internal transition layer. An asymptotic expansion of order zero for the solution is determined formally. Then some estimates for the remainder components are established to validate our expansion.
Nonlinear Maxwell‐equations in the thin‐film limit
Authors: Jochmann F.
Published: December 2024

This paper is concerned the transient Landau Lifschitz equations for the magnetic moment without exchange interaction coupled with Maxwell's equations as well as the equations for a nonlinear dielectric polarization. The main goals is the thin film limit for very flat domains. In this limit one obtains ordinary differential equations for the magnetic moment and the dielectric polarization respectively.
Diffusive relaxation 3×3 model for a system of viscoelasticity
Authors: Di Francesco Marco , Lattanzio Corrado
Published: December 2024

In this paper we study the global existence and the relaxation limit for a 3×3 hyperbolic system of conservation laws with globally Lipschitz relaxation term. In particular, the convergence for solutions in Sobolev spaces toward the solutions to the equilibrium system, which is a 2×2 incompletely parabolic system, is proved. This is the first example of a semilinear relaxation approximation for an incompletely parabolic system. Thanks to the scaling we use, such convergence can also be viewed as the passage from the viscosity of the memory type to the viscosity of the rate type in the study of viscoelastic materials. Finally, a result of convergence for travelling waves is also provided.
Behaviour of the Landau–Lifschitz equation in a periodic thin layer
Authors: Sanchez David
Published: December 2024

In this paper we study the behaviour of the Landau–Lifschitz equation in a thin layer. As the thickness of the domain and the exchange coefficient of the equation simultaneously tend to zero we perform an asymptotic expansion to precise the solution for well prepared initial condition.
Homogenization of the Robin problem for the Poisson equation in a thick multi‐structure of type 3:2:2
Authors: De Maio U. , Mel'nyk T.A.
Published: December 2024

In this paper we study a mixed boundary value problem for the Poisson equation in a multi‐structure Ωε, which is the union of a domain Ω0 and a large number N of ε‐periodically situated thin rings with variable thickness of order ε=𝒪(N−1). By using some special extension operator, we prove a convergence theorem as ε→0 and investigate the asymptotic behaviour of the solution under the Robin conditions on the boundaries of the thin rings.
Boundary layer techniques for deriving the effective properties of composite materials
Authors: Ammari Habib , Kang Hyeonbae , Touibi Karim
Published: December 2024

In this paper we present mathematically rigorous derivations of asymptotic expansions of the effective electrical conductivity of periodic dilute composites in terms of the volume fraction occupied by the inclusions. Our derivations are based on layer potential techniques, and valid for high contrast mixtures and inclusions with Lipschitz boundaries. They are motivated by the practically important inverse problem of determining the volume fraction of a suspension of complicated shaped particles from boundary measurements of voltage potentials.
Thue Specifications, Infinite Graphs and Synchronized Product
Authors: Payet Étienne
Published: December 2024

This paper presents some formal verification-oriented results about the class of graphs associated with Thue specifications. It is shown that this class is closed, up to isomorphism, under synchronized product. It is also established that every rational graph with no edge labeled by the empty word is isomorphic to the graph of a Thue specification. A consequence of this result is that the first-order theory of the graphs of Thue specifications is undecidable. Connections between graphs of Thue specifications and those of Turing machines are finally investigated. The main result is that the graph of each Thue specification is observationally equivalent to that of a Turing machine but the reverse does not hold.
Complexity of Fuzzy Probability Logics
Authors: Hájek Petr , Tulipani Sauro
Published: December 2024

The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.
Skeptical Reasoning in FC-Normal Logic Programs is Π^1_1-complete
Authors: Milnikel Robert Saxon
Published: December 2024

FC-normal logic programs are a generalization by Marek, Nerode, and Remmel of Reiter's normal default theories. They have the property that, unlike most logic programs, they are guaranteed to have simple stable models. In this paper it is shown that the problem of skeptical reasoning in FC-normal programs is Π^1_1-complete, the same complexity as for logic programs without the restriction of FC-normality. FC-normal programs are defined in such a way as to make testing a program for FC-normality very difficult in general. A large subclass of FC-normal programs, locally FC-normal programs, is defined, shown to be recursive, and shown to have skeptical consequence as expressive as the entire class of FC-normal programs.
Valences in Lindenmayer Systems
Authors: Fernau Henning , Stiebe Ralf
Published: December 2024

We investigate four variants of valence regulations incorporated in (limited) Lindenmayer systems, focussing on hierarchical relations and closure properties. Strong connections to well-known families of languages obtained by regulated rewriting are established. We prove several new results on valence transducers and valence generalized sequential machines (gsm). In this way, we can show new properties of ET0L languages, namely the non-closure under quasiintersection, valence gsm mappings and intersection with regular valence languages. Moreover, we solve a question marked as open in [36] by proving that the uniformly k-limited ET0L languages form a full semi-AFL for all k≥1.
A Fragment of Intuitionistic Dynamic Logic
Authors: Celani Sergio A.
Published: December 2024

We present a fragment of Propositional Dynamic Logic based on the Intuitionistic Propositional Logic. We show that this logic has the finite model property, and therefore, is frame-complete.
A Note on SE-Systems and Regular Canonical Systems
Authors: Ţiplea Ferucio Laurenţiu , Mäkinen Erkki
Published: December 2024

A synchronized extension system is a 4-tuple G=(V,L_1,L_2,S), where V is an alphabet and L_1, L_2 and S are languages over V. Such systems generate languages extending L_1 by L_2 to the left or to the right, and synchronizing on words in S. In this note we consider the relationship between synchronized extension systems and regular canonical systems. We are able to give a simplified and generalized proof for the classical result concerning the regularity of the languages defined by regular canonical systems.
On Variants of Communicating Distributed H Systems
Authors: Frisco Pierluigi , Zandron Claudio
Published: December 2024

A recent result shows that a variant of communicating distributed H system with two components can generate recursive enumerable languages. In this variant the filters are a finite union of sets whose number depends upon the simulated system. We prove here that it is possible to obtain the same result using filters testing the presence of couples of symbols. The number of the couples does not depend upon the simulated systems. Moreover we investigate variants of communicating distributed H systems with limitations in the redistribution process.
Behaviour Abstraction for Communicating Sequential	Processes
Authors: Koutny Maciej , Pappalardo Giuseppe
Published: December 2024

We investigate the notion that a system is an acceptable implementation of another base or target system, in the case that the two systems (or processes) have different interfaces. For instance, the base processes can be thought of as specifications, or ideal processes operating in an error-free environment, while the implementations model their actual realisations, operating in an error-prone environment and possibly employing a variety of fault-tolerant techniques. Using the CSP model, we relate implementations and base systems in terms of their observable behaviours. We obtain two fundamental results, viz. realisability and compositionality. The former ensures that implementations may be put to good use, while the latter guarantees that a target composed of several connected subsystems may be implemented by connecting their respective implementations.
On Efficient Handling of Continuous Attributes in Large Data	Bases
Authors: Nguyen Hung Son
Published: December 2024

Some data mining techniques, like discretization of continuous attributes or decision tree induction, are based on searching for an optimal partition of data with respect to some optimization criteria. We investigate the problem of searching for optimal binary partition of continuous attribute domain in case of large data sets stored in relational data bases (RDB). The critical for time complexity of algorithms solving this problem is the number of I/O database operations necessary to construct such partitions. In our approach the basic operators are defined by queries on the number of objects characterized by means of real value intervals of continuous attributes. We assume the answer time for such queries does not depend on the interval length. The straightforward approach to the optimal partition selection (with respect to a given measure) requires O(N) basic queries, where N is the number of preassumed partition parts in the searching space. We show properties of the basic optimization measures making possible to reduce the size of searching space. Moreover, we prove that using only O(\log N) simple queries, one can construct a partition very close to optimal.
Using Distance Functions to Solve Representation Choice	Problems
Authors: Nguyen Ngoc Thanh
Published: December 2024

A representation choice problem is based on the selection of an object (or objects), which should at best represent a given set of objects. In this paper we propose to solve this problem by using distance functions between objects. These distance functions are used to define representation choice functions. Six postulates for representation choice functions are given and their analysis is presented. The theoretical results provide us with some interesting relationships between classes of choice functions specified by the accepted postulates. They also make it possible to specify essential properties of considered choice functions. In particular, it has been proved that in practical settings it is suggested to use functions from two particular classes, for they preserve important features. Less popular representation choice functions are also pointed at and analyzed.
Effective Procedures for Handling Possible Equivalence Relations	in Non-deterministic Information Systems
Authors: Sakai Hiroshi
Published: December 2024

This paper presents a tool for handling equivalence relations in non-deterministic information systems. Some applications of equivalence relations are also shown. In a deterministic information system, it is possible to define an equivalence relation for any set of attributes. However, in a non-deterministic information system, some kinds of equivalence relations which we call possible equivalence relations are definable. This paper proposes two effective procedures producing all possible equivalence relations for any non-deterministic information system and any set of attributes. The details of algorithms, the implementation of algorithms and applications to the rule extraction, etc. are presented.
A Complete Axiomatization of Process Temporal Logic
Authors: Kacprzak Magdalena
Published: December 2024

In this paper is introduced a proof system for branching time temporal logic, called PTL. It allows to verify static and dynamic properties of nondeterministic programs, which are expressed as a temporal formulas of PTL language. The strong completeness theorem of this system is presented.
Analytic sets in Descriptive Set Theory and NP sets in Complexity	Theory
Authors: Sureson Claude
Published: December 2024

Motivated by the analogy ``(NP/Poly)∼analytic'', we propose a co-analytic set W whose finite equivalent W_finite is coNP-complete. The complement of W is in fact a variant of ``infinite clique''. A combinatorial proof of the non-analyticity of W is produced and studied in order to be (eventually) ``finitized'' into a probabilistic proof of ``W_finite ∉ NP/Poly (this would imply NP≠CoNP). A reasonable objective could be to determine a specific class of nondeterministic circuits which allow a finitization of the arguments of the infinite case, and thus which cannot compute W_finite.
Automata-Theoretic Decision Procedures for Information	Logics
Authors: Demri Stéphane , Sattler Ulrike
Published: December 2024

Automata-theoretic decision procedures for solving model-checking and satisfiability problems for temporal, dynamic, and description logics have flourished during the past decades. In the paper we define an EXPTIME decision procedure based on the emptiness problem of Büchi automata on infinite trees for the very expressive information logic SIM designed for reasoning about information systems. This logic involves modal parameters satisfying certain properties to capture the relevant nominals at the formula level, Boolean expressions and nominals at the modal level, an implicit intersection operation for relations, and a universal modality. The original combination of known techniques allows us to solve the open question related to the EXPTIME-completeness of SIM. Furthermore, we discuss how variants of SIM can be treated similarly although the decidability status of some of them is still unknown.
On the Structure of Rough Approximations
Authors: Järvinen Jouni
Published: December 2024

We study rough approximations based on indiscernibility relations which are not necessarily reflexive, symmetric or transitive. For this, we define in a lattice-theoretical setting two maps which mimic the rough approximation operators and note that this setting is suitable also for other operators based on binary relations. Properties of the ordered sets of the upper and the lower approximations of the elements of an atomic Boolean lattice are studied.
A Rough Set Approach to Estimating the Game Value and the Shapley	Value from Data
Authors: Polkowski Lech , Araszkiewicz Bolesław
Published: December 2024

A value of a game v is a function which to each coalition S assigns the value v(S) of this coalition, meaning the expected pay-off for players in that coalition. A classical approach of von Neumann and Morgenstern [6] had set some formal requirements on v which contemporary theories of value adhere to. A Shapley value of the game with a value v [14] is a functional Φ giving for each player p the value Φ_p(v) estimating the expected pay–off of the player p in the game. Game as well as conflict theory have been given recently much attention on the part of rough and fuzzy set communities [11, 8, 1, 4, 7, 2]. In particular, problems of plausible strategies in conflicts as well as problems related to Shapley's value [3,2] have been addressed. We confront here the problem of estimating a value as well as Shapley's value of a game from a partial data about the game. We apply to this end the rough set ideas of approximations, defining the lower and the upper value of the game and, respectively, the lower and the upper Shapley value. We also define a notion of an exact coalition, on which both values coincide giving the true value of the game; we investigate the structure of the family of exact sets showing its closeness on complements, disjoint sums, and intersections of coalitions covering the set of players. This work sets open a new area of rough set applications in mining constructs from data. The constructs mined in this case are values as well as Shapley values of games.
A logical approach to control. The concept of Inner	Implication
Authors: Terlikowski Tomasz
Published: December 2024

In this paper, continuing our research in [7], we introduce a logical notion of inner implication. This notion is aimed at a formalization of some concepts of control theory. The respective notion of control structure and the concept of risk will be discussed in the following parts of the work. The reader will find all relevant notions in [7].
Nonmonotonic Proof Systems: Algebraic Foundations
Authors: Ghosh Sujata , Chakraborty Mihir Kr.
Published: December 2024

A general framework for the algebraization of a category of nonmonotonic logics has been suggested. This method has been applied to the systems of Gabbay, and to Cumulative, Preferential and Ranked systems. The minimal logics required to serve as the base logics for the above systems are investigated. MAK triples and KLM triples are formed in ways similar to MAK models and KLM models but now on the algebraic structures for the nonmonotonic systems, thereby a new type of semantics is given to these systems.
Tree Operations in P Systems and λ-Calculus
Authors: Jonoska Nataša , Margenstern Maurice
Published: December 2024

In this paper we introduce a membrane system (named λP systems) in which the computation is performed through certain operations on the tree structure of the membranes. The objects within the membranes play the role of catalysts for the operations. The result of the computation is the final configuration of the system. We show that λP systems can simulate pure λ-calculus and so they have universal computational power. We also show that NP-complete problems can be solved in polynomial time in this way by showing that 3SAT is solvable in linear time with linear input.
A Set-Theoretic Framework for Component Composition
Authors: Moschoyiannis Sotiris , Shields Michael W.
Published: December 2024

Modern software systems become increasingly complex as they are expected to support a large variety of different functions. We need to create more software in a shorter time, and without compromising the quality of the software. In order to build such systems efficiently, a compositional approach is required. This entails some formal technique for analysis and reasoning on local component properties as well as on properties of the composite. In this paper, we present a mathematical framework for the composition of software components, at a semantic modelling level. We describe a mathematical concept of a component and identify properties that ensure its potential behaviour can be captured. Based on that, we give a formal definition of composition and examine its effect on the individual components. We argue that properties of the individual components can, under certain conditions, be preserved in the composite. The proposed framework can be used for guiding the composition of components as it advocates formal reasoning about the composite before the actual composition takes place.
Conjoinability in Pregroups
Authors: Kiślak-Malinowska Aleksandra
Published: December 2024

Pregroups are introduced by Lambek [8] as a framework for syntactic analysis of Natural Language; they are algebraic models of Compact Bilinear Logic. In the present paper we consider the problem of conjoinability in the calculus of pregroups. We show that two types are conjoinable in a pregroup iff they are equal in a free group. This result is analogous to Pentus' characterization of conjoinability in the Lambek calculus [11].
A Refined VQ-Based Image Compression Method
Authors: Chan Yung-Kuan , Wang Her-Fa , Lee Chin-Fan
Published: December 2024

This paper presents a refined VQ-based image compression method which modifies the traditional VQ-based image compression method. The refined VQ-based image compression method further lossless encodes the compression data which is generated by the traditional VQ-based image compression method into a set of compression codes. The index image generated by the refined method is a contracted image of the compressed image, which can be used as the preview of the compressed image on image management. Although the PSNRs of the reconstructed images that are decoded by the refined VQ-based image compression method and the traditional VQ-based image compression method are the same, the refined VQ-based image compression method provides a better storage efficiency.
A Method to Prove Non-Reachability in Priority Duration Petri	Nets
Authors: Werner Matthias , Popova-Zeugmann Louchka , Richling Jan
Published: December 2024

Times and priorities are important concepts that are frequently used to model real-world systems. Thus, there exist extensions for Petri nets which allow to model times and priorities. In contrast, many proof techniques are based on classical (time-less and priority-less) Petri nets. However, this approach fails frequently for timed and prioritized Petri nets. In this paper, we present an approach to prove non-reachability in a Priority Duration Petri net. We use for this proving technique a state equation as well as conditions for firing that include a priority rule and a maximal step rule. Our approach leads to a system of equations and inequalities, which provide us with a sufficient condition of non-reachability. We demonstrate the application of our approach with an example.
The Compactness of Belief Revision and Update Operators
Authors: Liberatore Paolo , Schaerf Marco
Published: December 2024

A propositional knowledge base can be seen as a compact representation of a set of models. When a knowledge base T is updated with a formula P, the resulting set of models can be represented in two ways: either by a theory T' that is equivalent to T*P or by the pair 〈T,P〉. The second representation can be super-polinomially more compact than the first. In this paper, we prove that the compactness of this representation depends on the specific semantics of *, e.g., Winslett's semantics is more compact than Ginsberg's.
Tracing Relations Probabilistically
Authors: Doberkat Ernst-Erich
Published: December 2024

We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We show that the construction of traces for both kinds of relations follows the same principles of construction. Representations of measurable trees in terms of probabilistic relations are given. This shows that stochastic relations may serve as refinements of their non-deterministic counterparts. A convexity argument formalizes the observation that non-deterministic system descriptions are underspecified when compared to probabilistic ones. The mathematical tools come essentially from the theory of measurable selections.
Data Compressor for VQ Index Tables
Authors: Lu Tzu-Chuen , Chang Chin-Chen
Published: December 2024

The vector quantization (VQ) compression scheme has been well accepted as an efficient image compression technique. However, the compression bit rate of the VQ scheme is limited. In order to improve its efficiency, in this paper, we shall propose a new lossless data compression scheme to further condense the VQ index table. The proposed scheme exploits the inter-block correlations in the index table to re-encode the indices. Unlike the well known existing re-encoding schemes such as SOC and STC, the proposed scheme uses a smaller number of compression codes to encode every index that coincides with another on the predefined path. Compared with VQ, SOC and STC, the proposed scheme performs better in terms of compression bit rate.
Tabular Expressions and Their Relational Semantics
Authors: Janicki Ryszard , Wassyng Alan
Published: December 2024

Tabular Expressions (Parnas et al. [20, 28, 32, 33]) are means to represent the complex relations that are used to specify or document software systems. A formal model and a semantics for tabular expressions are presented. The model covers most known types of tables used in software engineering, and admits precise classification and definition of new types of tables. The practical importance of the semantics of tabular expressions is also discussed.
The Open Calculus of Constructions (Part I): 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.
An Inverse Halftoning Technique Using Modified Look-Up	Tables
Authors: Chang Chin-Chen , Chan Chi-Shiang
Published: December 2024

In this paper, we shall propose a method to invert halftone images. We shall use a modified look-up table to reconstruct gray level images from halftone images. In the modified look-up table training phase, we shall use a sliding window to get halftone patterns and their corresponding gray-level lists. The modified look-up table can be obtained by calculating the centroid of the gray-level lists. In the image reconstruction phase, we shall use the sliding window to slide around the pixel to reconstruct so that we can get candidate gray values. The reconstructed gray value can be obtained by calculating the centroid of the candidate gray values. Experimental results have shown that our method indeed can get satisfied results.
Efficient Parallel Query Processing by Graph Ranking
Authors: Dereniowski Dariusz , Kubale Marek
Published: December 2024

In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to Makino et al. for designing query execution plans with almost optimal number of parallel steps. This algorithm is based on the concept of edge ranking of graphs. We use a new upper bound for the edge ranking number of a tree to derive a better worst-case performance guarantee for this algorithm. We also present some experimental results obtained during the tests of the algorithm on random graphs in order to compare the quality of both approximation ratios on average. Both theoretical analysis and experimental results indicate the superiority of our approach.
Spatial Domain Image Hiding Scheme Using Pixel-Values	Differencing
Authors: Chang Chin-Chen , Chuang Jun-Chou , Hu Yu-Chen
Published: December 2024

In this paper, we present a spatial domain Image hiding scheme that embeds secret data in a gray-level image. Our scheme is inspired from Wu and Tsai's scheme that embeds secret bits in the difference values of consecutive pixels. To improve the hiding capacity of their scheme, the overlapping concept is proposed to produce more difference values from the cover image in this paper. Experimental results show that our scheme provides an average hiding capacity gain of 84.16% over Wu and Tsai's scheme while maintaining satisfactory image quality.
Petri Net Semantics of the Finite π-calculus Terms
Authors: Devillers Raymond , Klaudel Hanna , Koutny Maciej
Published: December 2024

In this paper we propose a translation into high level Petri nets of the terms of a finite fragment of the π-calculus. Our construction renders in a compositional way the control flow aspects present in π-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscriptions of places, transitions and arcs, together with a suitable choice of the initial marking.
On the Influence of Confluence in Modal Logics
Authors: Gasquet Olivier
Published: December 2024

In this paper we prove that adding a confluence axiom to a modal logic which behaves rather well from the viewpoint of complexity of the satisfaction problem, drastically increases its complexity and blows it up from PSPACE-completeness to NEXPTIME-completeness. More precisely, we investigate here both monomodal K + confluence and bimodal K with confluence between the two modalities.
A Novel Color Image Hiding Scheme Using Block Truncation	Coding
Authors: Hu Yu-Chen , Lin Min-Hui , Jiang Ji-Han
Published: December 2024

In this paper, a novel color image hiding scheme that is capable of hiding two color secret images into a color host image is proposed. The secret images to be embedded are first compressed by the single bit map block truncation coding. DES encryption is then conducted on the compressed message before the secret image is embedded into the rightmost 3, 2, 3 bits of the R, G, B channels of every pixel in the host image.

The experimental results show that our scheme provides an average secret image quality of 29.220 dB. In addition to the improved quality of both host images and retrieved secret images, our scheme further strengthens the protection of the secret images by conducting image compression and DES encryption on the secret image in advance. Therefore, our scheme not only extends the hiding capability of host images, but also is practical and secure.
Di-Algebraic Semantics of Logics
Authors: Mani A.
Published: December 2024

In [22] the problem of the logics corresponding to topological quasi-boolean algebras [27, 1] has been recently solved by the present author. The semantics provided involved convex amalgams of boolean algebras with additional total and partial operations. Canonical extensions of the structure was also investigated. In the present research, this semantics is generalized to a wide class of logics including distributive logics. It is also shown that the semantics is a proper generalization of the general theory of algebraizable logics due to Blok-Pigozzi [5] and Czelakowski [7].
Negative Ordered Hyper-Resolution as a Proof Procedure for	Disjunctive Logic Programming
Authors: Nguyen Linh Anh
Published: December 2024

We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem proving systems.
Reinforcement Learning with Approximation Spaces
Authors: Peters James F. , Henry Christopher
Published: December 2024

This paper introduces a rough set approach to reinforcement learning by swarms of cooperating agents. The problem considered in this paper is how to guide reinforcement learning based on knowledge of acceptable behavior patterns. This is made possible by considering behavior patterns of swarms in the context of approximation spaces. Rough set theory introduced by Zdzisław Pawlak in the early 1980s provides a ground for deriving pattern-based rewards within approximation spaces. Both conventional and approximation space-based forms of reinforcement comparison and the actor-critic method as well as two forms of the off-policy Monte Carlo learning control method are investigated in this article. The study of swarm behavior by collections of biologically-inspired bots is carried out in the context of an artificial ecosystem testbed. This ecosystem has an ethological basis that makes it possible to observe and explain the behavior of biological organisms that carries over into the study of reinforcement learning by interacting robotic devices. The results of ecosystem experiments with six forms of reinforcement learning are given. The contribution of this article is the presentation of several viable alternatives to conventional reinforcement learning methods defined in the context of approximation spaces.
Probability and Program-Size for Functions
Authors: Chaitin Gregory
Published: December 2024

We show that unlike the general case of the relationship between algorithmic probability and program-size for enumerating sets, in the case of the graphs of total functions these two quantities are closely related.
A Novel Image Ownership Protection Scheme Based on Rehashing	Concept and Vector Quantization
Authors: Lin Chia-Chen , Hu Yu Chen , Chang Chin-Chen
Published: December 2024

A novel watermarking scheme that is capable of hiding authorization data in a gray-level image is proposed in this letter. The proposed scheme generates a key stream to be the key to connect the authorized image and its watermark. The key stream is extra data rather than data being embedded into the authorized image. Such arrangement can guarantee the integrity of the image. To reduce the complexity in computing the key stream for the authorized gray-level image, two techniques are employed in the proposed scheme. One is the concept of rehashing, and the other is the vector quantization. The benefits of the proposal are to provide a key stream to prove the gray-level's ownership, and to keep the authorized image in its original state without any modification.
Rough Relation Algebras Revisited
Authors: Düntsch Ivo , Winter Michael
Published: December 2024

Rough relation algebras arise from Pawlak's information systems by considering as object ordered pairs on a fixed set X. Thus, the subsets to be approximated are binary relations over X, and hence, we have at our disposal not only the set theoretic operations, but also the relational operators; ˘, and the identity relation 1'. In the present paper, which is a continuation of [6], we further investigate the structure of abstract rough relation algebras.
Process-Specific Information for Learning Electronic Negotiation	Outcomes
Authors: Shah Mohak , Sokolova Marina , Szpakowicz Stan
Published: December 2024

We introduce Process-Specific Feature Selection, an innovative procedure of feature selection for textual data. The procedure applies to data gathered in person-to-person communication. The procedure relies on the knowledge of the processes that govern such communication. It is general enough to represent data in a wide variety of domains. We present a case study of electronic negotiation, in which participants exchange text messages. We present the empirical results of classifying the outcomes of electronic negotiations based on such texts. The results achieved using process-specific feature selection are marginally better than those afforded by several traditional feature selection methods. We show that this tendency is consistent across several learning paradigms.
Full-Searching-Equivalent Vector Quantization Using Two-Bounds	Triangle Inequality
Authors: Chang Chin-Chen , Chen Chang-Chu
Published: December 2024

The encoding process of vector quantization (VQ) is indeed computational complex and time consuming. Compared with actual Euclidean distance computation, some inequalities can generate estimations with less computation to filter out the impossible codevectors as well as to reduce the computation time. In this paper, we introduce a new estimation for the Euclidean distance using two-bounds triangle inequality. The experimental results show that our proposed scheme can reduce Euclidean distance computation by 71% to 94% for full search. Having been proved, our proposed scheme can reduce the computing time by 42% to 51%.
A Co-processor for Computing the Euler Number of a Binary Image	using Divide-and-Conquer Strategy
Authors: Dey Sabyasachi , Bhattacharya Bhargab B. , Kundu Malay K. , Bishnu Arijit , Acharya Tinku
Published: December 2024

Euler number is a fundamental topological feature of an image. The efficiency of computation of topological features of an image is critical for many digital imaging applications such as image matching, database retrieval, and computer vision that require real time response. In this paper, a novel algorithm for computing the Euler number of a binary image based on divide-andconquer paradigm, is proposed, which outperforms significantly the conventional techniques used in image processing tools. The algorithm can be easily parallelized for computing the Euler number of an N × N image in O(N) time, with O(N) processors. Using a simple architecture, the proposed method can be implemented as a special purpose VLSI chip to be used as a co-processor.
New Metrics for Phylogenies
Authors: Bolikowski Łukasz , Gambin Anna
Published: December 2024

In this paper we propose two new metrics defined on the space of phylogenetic trees. The problem of determining how distant two trees are from each other is crucial because many various methods exist for reconstructing phylogenetic trees from molecular data. These techniques (in fact often heuristics) applied to the same data set result in significantly different trees.

We investigate the basic properties of new metrics and present efficient algorithms approximating the distance between two trees for partition metric. Computational experiments, which has been performed for large family of trees justify the applicability of our algorithms.

The interesting application of our framework is the identification of the ancestral paralog position in the paralog families. We propose to select the set of genes (exemplars) that minimize the partition metric distance between gene tree and species tree.
Davis-Putnam Style Rules for Deciding Property S
Authors: Cowen Robert , Kolany Adam
Published: December 2024

Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ∩ e ≠Ø, for all e ∈ E and f ⊈σ, for all f ∈ F (see [8], [9]]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.
Composition Theorem for Generalized Sum
Authors: Rabinovich Alexander
Published: December 2024

Composition theorems are tools which reduce sentences about some compound structure to sentences about its parts. A seminal example of such a theorem is the Feferman-Vaught Theorem [3] which reduces the first-order theory of generalized products to the first order theory of its factors and the monadic second-order theory of index structure.

Shelah [23] used the composition theorem for linear orders as one of the main tools for obtaining very strong decidability results for the monadic second-order theory of linear orders.

The main technical contribution of our paper is (1) a definition of a generalized sum of structures and (2) a composition theorem for first-order logic over the generalized sum. One of our objectives is to emphasize the work-out of the composition method.
Optimal Proof Systems, Optimal Acceptors and Recursive	Presentability
Authors: Sadowski Zenon
Published: December 2024

We advocate the thesis that the following general statements are equivalent: the existence of an optimal proof system, the existence of an optimal acceptor (an algorithm with optimality property stated only for input strings which are accepted), and the existence of a suitable recursive presentation of the class of all easy (polynomial-time recognizable) subsets of TAUT (SAT). We prove three concrete versions of this thesis with different variants of notions appearing in it. These versions give alternative characterizations of the following problems: the existence of a p-optimal proof system for SAT, the existence of an optimal proof system for TAUT, and the existence of an optimal and automatizable proof system for TAUT.
Predicate Introduction for Logics with a Fixpoint Semantics. Part	I: Logic Programming
Authors: Vennekens Joost , Wittocx Johan , Mariën Maarten , Denecker Marc
Published: December 2024

We study the transformation of "predicate introduction" in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certain inference programs or theorems. In this paper, we study predicate introduction in the algebraic framework of "approximation theory"; this is a fixpoint theory for nonmonotone operators that generalizes all main semantics of various non-monotonic logics, including logic programming, default logic and autoepistemic logic. We prove an abstract, algebraic equivalence result in this framework. This can then be used to show that, in logic programming, certain transformations are equivalence preserving under, among others, both the stable and well-founded semantics. Based on this result, we develop a general method of eliminating universal quantifiers in the bodies of rules. Our work is, however, also applicable beyond logic programming. In a companion paper, we demonstrate this, by using the same algebraic results to derive a transformation which reduces the nesting depth of the modal operator K in autoepistemic logic.
Tense Operators on MV-Algebras and Łukasiewicz-Moisil Algebras
Authors: Diaconescu Denisa , Georgescu George
Published: December 2024

We introduce tense LM _n -algebras and tense MV-algebras as algebraic structures for some tense many-valued logics. A representation theorem for tense LM _n -algebras is proved and the polynomial equivalence between tense LM _3 -algebras (resp. tense LM _4 -algebras) and tense MV _3 -algebras (resp. tense MV _4 -algebras) is established. We study the pairs of dually-conjugated operations on MV-algebras and we use their properties in order to investigate how the axioms of tense operators are preserved by the Dedekind-MacNeille completion of an Archimedean MV-algebra. A tense many-valued propositional calculus is developed and a completeness theorem is proved.
Binary Search Trees, Recurrent Properties andWave Equations
Authors: Fernández-Camacho María-Inés , Sánchez-Couso José-Ramón
Published: December 2024

We give a generic framework to analyze the average-case running time for computing the so called recurrent properties for pairs of binary search trees. Recurrent properties are algorithms that operate on pairs of trees testing some characteristic on nodes by performing a preorder traversal on both trees. Analysis of recurrent properties using the probability model associated with randomly grown binary search trees leads to wave equations. We use a "normalized" integral equation as a pattern to model a specific wave equation and investigate the asymptotic behavior of its solution. This methodology is applied to some particular cases of recurrent properties like testing equality, detecting direct occurrences and clashes or pattern matching.
Codebook Partition Based Steganography without Member Restriction
Authors: Chiang Yung-Kuei , Tsai Piyu , Huang Feng-Long
Published: December 2024

The practice of concealing secret messages into index-based images has generally suffered from problems of image quality degradation and hiding capacity restriction. A steganographic scheme using an improved codebook partition is proposed in this paper. The proposed scheme partitions the codebook into different member sub-clusters in terms of their similarity between the codewords for increasing the hiding capacity and reducing the image distortion. Any size of a subcluster was allowed in the proposed scheme, so as to improve the traditional approaches in which the size of a sub-cluster was restricted to the power of two.

As a result of this revised scheme, an increased hiding capacity and a reduction in image distortion are obtained, as indicated from experimental results. The average performance of the proposed scheme is superior to that of those standard methods.
Products of Tree Automata with an Application to Temporal	Logic
Authors: Ésik Zoltán , Iván Szabolcs
Published: December 2024

We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.