-
Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems arXiv.cs.SC Pub Date : 2024-03-14 Tomoyuki Yamakami
We study the computational complexity of counting constraint satisfaction problems (#CSPs) whose constraints assign complex numbers to Boolean inputs when the corresponding constraint hypergraphs are acyclic. These problems are called acyclic #CSPs or succinctly, #ACSPs. We wish to determine the computational complexity of all such #ACSPs when arbitrary unary constraints are freely available. Depending
-
ArgMed-Agents: Explainable Clinical Decision Reasoning with Large Language Models via Argumentation Schemes arXiv.cs.SC Pub Date : 2024-03-10 Shengxin Hong, Liang Xiao, Xin Zhang, Jianxia Chen
There are two main barriers to using large language models (LLMs) in clinical reasoning. Firstly, while LLMs exhibit significant promise in Natural Language Processing (NLP) tasks, their performance in complex reasoning and planning falls short of expectations. Secondly, LLMs use uninterpretable methods to make clinical decisions that are fundamentally different from the clinician's cognitive processes
-
Learning Guided Automated Reasoning: A Brief Survey arXiv.cs.SC Pub Date : 2024-03-06 Lasse Blaauwbroek, David Cerna, Thibault Gauthier, Jan Jakubův, Cezary Kaliszyk, Martin Suda, Josef Urban
Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning. In practice, such systems however face large combinatorial explosion, and therefore include many heuristics and choice points that considerably influence their performance
-
Saturating Sorting without Sorts arXiv.cs.SC Pub Date : 2024-03-06 Pamina Georgiou, Márton Hajdu, Laura Kovács
We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formalize the semantics of recursive programs in many-sorted first-order logic and integrate sortedness/permutation properties within our first-order formalization. Rather than focusing on sorting lists of elements of specific
-
Deep Neural Network for Constraint Acquisition through Tailored Loss Function arXiv.cs.SC Pub Date : 2024-03-04 Eduardo Vyhmeister, Rocio Paez, Gabriel Gonzalez
The significance of learning constraints from data is underscored by its potential applications in real-world problem-solving. While constraints are popular for modeling and solving, the approaches to learning constraints from data remain relatively scarce. Furthermore, the intricate task of modeling demands expertise and is prone to errors, thus constraint acquisition methods offer a solution by automating
-
Communication Optimal Unbalanced Private Set Union arXiv.cs.SC Pub Date : 2024-02-26 Jean-Guillaume DumasUGA, LJK, CASC, Alexis GalanCASC, Bruno GrenetCASC, Aude MaignanCASC, Daniel S. Roche
We consider the private set union (PSU) problem, where two parties each hold a private set of elements, and they want one of the parties (the receiver) to learn the union of the two sets and nothing else. Our protocols are targeted for the unbalanced case where the receiver's set size is larger than the sender's set size, with the goal of minimizing the costs for the sender both in terms of communication
-
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields arXiv.cs.SC Pub Date : 2024-02-19 Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
We construct explicit pseudorandom generators that fool $n$-variate polynomials of degree at most $d$ over a finite field $\mathbb{F}_q$. The seed length of our generators is $O(d \log n + \log q)$, over fields of size exponential in $d$ and characteristic at least $d(d-1)+1$. Previous constructions such as Bogdanov's (STOC 2005) and Derksen and Viola's (FOCS 2022) had either suboptimal seed length
-
Fast interpolation and multiplication of unbalanced polynomials arXiv.cs.SC Pub Date : 2024-02-15 Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced polynomials. Writing s for the total bit-length and D for the degree, our new algorithms have expected running time $\tilde{O}(s \log D)$, whereas previous methods for (resp
-
Computing Krylov iterates in the time of matrix multiplication arXiv.cs.SC Pub Date : 2024-02-12 Vincent Neiger, Clément Pernet, Gilles Villard
Krylov methods rely on iterated matrix-vector products $A^k u_j$ for an $n\times n$ matrix $A$ and vectors $u_1,\ldots,u_m$. The space spanned by all iterates $A^k u_j$ admits a particular basis -- the \emph{maximal Krylov basis} -- which consists of iterates of the first vector $u_1, Au_1, A^2u_1,\ldots$, until reaching linear dependency, then iterating similarly the subsequent vectors until a basis
-
Ensuring trustworthy and ethical behaviour in intelligent logical agents arXiv.cs.SC Pub Date : 2024-02-12 Stefania Costantini
Autonomous Intelligent Agents are employed in many applications upon which the life and welfare of living beings and vital social functions may depend. Therefore, agents should be trustworthy. A priori certification techniques (i.e., techniques applied prior to system's deployment) can be useful, but are not sufficient for agents that evolve, and thus modify their epistemic and belief state, and for
-
Towards a Parallel Summation Algorithm arXiv.cs.SC Pub Date : 2024-02-07 Shaoshi Chen, Ruyong Feng, Manuel Kauers, Xiuyun Li
We propose a summation analog of the paradigm of parallel integration. Using this paradigm, we make some first steps towards an indefinite summation algorithm applicable to summands that rationally depend on the summation index and a P-recursive sequence and its shifts. Under the assumption that the corresponding difference field has no unnatural constants, we are able to compute a bound on the normal
-
SymbolicAI: A framework for logic-based approaches combining generative models and solvers arXiv.cs.SC Pub Date : 2024-02-01 Marius-Constantin Dinu, Claudiu Leoveanu-Condrei, Markus Holzleitner, Werner Zellinger, Sepp Hochreiter
We introduce SymbolicAI, a versatile and modular framework employing a logic-based approach to concept learning and flow management in generative processes. SymbolicAI enables the seamless integration of generative models with a diverse range of solvers by treating large language models (LLMs) as semantic parsers that execute tasks based on both natural and formal language instructions, thus bridging
-
Creative Telescoping for Hypergeometric Double Sums arXiv.cs.SC Pub Date : 2024-01-29 Peter Paule, Carsten Schneider
We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute
-
Open Source Prover in the Attic arXiv.cs.SC Pub Date : 2024-01-22 Zoltán KovácsThe Private University College of Education of the Diocese of Linz, Austria, Alexander VujicThe Private University College of Education of the Diocese of Linz, Austria
The well known JGEX program became open source a few years ago, but seemingly, further development of the program can only be done without the original authors. In our project, we are looking at whether it is possible to continue such a large project as a newcomer without the involvement of the original authors. Is there a way to internationalize, fix bugs, improve the code base, add new features?
-
Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD arXiv.cs.SC Pub Date : 2024-01-24 Tereso del Río, Matthew England
Symbolic Computation algorithms and their implementation in computer algebra systems often contain choices which do not affect the correctness of the output but can significantly impact the resources required: such choices can benefit from having them made separately for each problem via a machine learning model. This study reports lessons on such use of machine learning in symbolic computation, in
-
Symbolic Equation Solving via Reinforcement Learning arXiv.cs.SC Pub Date : 2024-01-24 Lennart Dabelow, Masahito Ueda
Machine-learning methods are gradually being adopted in a great variety of social, economic, and scientific contexts, yet they are notorious for struggling with exact mathematics. A typical example is computer algebra, which includes tasks like simplifying mathematical terms, calculating formal derivatives, or finding exact solutions of algebraic equations. Traditional software packages for these purposes
-
Solving with GeoGebra Discovery an Austrian Mathematics Olympiad problem: Lessons Learned arXiv.cs.SC Pub Date : 2024-01-22 Belén Ariño-MoreraDepartamento de Economía Financiera y Contabilidad, Universidad Rey Juan Carlos, Madrid, Spain, Zoltán KovácsThe Private University College of Education of the Diocese of Linz, Austria, Tomás RecioEscuela Politécnica Superior, Universidad Antonio de Nebrija, Madrid, Spain, Piedad TolmosDepartamento de Economía Financiera y Contabilidad, Universidad Rey Juan Carlos, Madrid, Spain
We address, through the automated reasoning tools in GeoGebra Discovery, a problem from a regional phase of the Austrian Mathematics Olympiad 2023. Trying to solve this problem gives rise to four different kind of feedback: the almost instantaneous, automated solution of the proposed problem; the measure of its complexity, according to some recent proposals; the automated discovery of a generalization
-
Showing Proofs, Assessing Difficulty with GeoGebra Discovery arXiv.cs.SC Pub Date : 2024-01-22 Zoltán KovácsThe Private University College of Education of the Diocese of Linz, Austria, Tomás RecioEscuela Politécnica Superior, Universidad Antonio de Nebrija, Madrid, Spain, M. Pilar VélezEscuela Politécnica Superior, Universidad Antonio de Nebrija, Madrid, Spain
In our contribution we describe some on-going improvements concerning the Automated Reasoning Tools developed in GeoGebra Discovery, providing different examples of the performance of these new features. We describe the new ShowProof command, that outputs both the sequence of the different steps performed by GeoGebra Discovery to confirm a certain statement, as well as a number intending to grade the
-
3D Space Trajectories and beyond: Abstract Art Creation with 3D Printing arXiv.cs.SC Pub Date : 2024-01-22 Thierry Dana-PicardJerusalem College of Technology, Matias TejeraJohannes Kepler University Linz, Austria, Eva UlbrichJohannes Kepler University Linz, Austria
We present simple models of trajectories in space, both in 2D and in 3D. The first examples, which model bicircular moves in the same direction, are classical curves (epicycloids, etc.). Then, we explore bicircular moves in reverse direction and tricircular moves in 2D and 3D, to explore complex visualisations of extraplanetary movements. These moves are studied in a plane setting. Then, adding increasing
-
The Locus Story of a Rocking Camel in a Medical Center in the City of Freistadt arXiv.cs.SC Pub Date : 2024-01-22 Anna KäferböckThe Private University College of Education of the Diocese of Linz, Austria, Zoltán KovácsThe Private University College of Education of the Diocese of Linz, Austria
We give an example of automated geometry reasoning for an imaginary classroom project by using the free software package GeoGebra Discovery. The project is motivated by a publicly available toy, a rocking camel, installed at a medical center in Upper Austria. We explain how the process of a false conjecture, experimenting, modeling, a precise mathematical setup, and then a proof by automated reasoning
-
Towards Automatic Transformations of Coq Proof Scripts arXiv.cs.SC Pub Date : 2024-01-22 Nicolas MagaudLab. ICube CNRS Université de Strasbourg, France
Proof assistants like Coq are increasingly popular to help mathematicians carry out proofs of the results they conjecture. However, formal proofs remain highly technical and are especially difficult to reuse. In this paper, we present a framework to carry out a posteriori script transformations. These transformations are meant to be applied as an automated post-processing step, once the proof has been
-
EFO: the Emotion Frame Ontology arXiv.cs.SC Pub Date : 2024-01-19 Stefano De Giorgis, Aldo Gangemi
Emotions are a subject of intense debate in various disciplines. Despite the proliferation of theories and definitions, there is still no consensus on what emotions are, and how to model the different concepts involved when we talk about - or categorize - them. In this paper, we propose an OWL frame-based ontology of emotions: the Emotion Frames Ontology (EFO). EFO treats emotions as semantic frames
-
Hypergeometric Solutions of Linear Difference Systems arXiv.cs.SC Pub Date : 2024-01-16 Moulay Barkatou, Mark van Hoeij, Johannes Middeke, Yi Zhou
We extend Petkov\v{s}ek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $\tau(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $\tau$ is the shift operator. Hypergeometric solutions are solutions of the form $\gamma P$ where $P \in C(x)^n$ and $\gamma$ is a hypergeometric term over $C(x)$, i.e. ${\tau(\gamma)}/{\gamma} \in C(x)$. Our
-
Submodule approach to creative telescoping arXiv.cs.SC Pub Date : 2024-01-16 Mark van Hoeij
This paper proposes ideas to speed up the process of creative telescoping, particularly when the telescoper is reducible. One can interpret telescoping as computing an annihilator $L \in D$ for an element $m$ in a $D$-module $M$. The main idea is to look for submodules of $M$. If $N$ is a non-trivial submodule of $M$, constructing the minimal operator $R$ of the image of $m$ in $M/N$ gives a right-factor
-
Interpretable Concept Bottlenecks to Align Reinforcement Learning Agents arXiv.cs.SC Pub Date : 2024-01-11 Quentin Delfosse, Sebastian Sztwiertnia, Wolfgang Stammer, Mark Rothermel, Kristian Kersting
Reward sparsity, difficult credit assignment, and misalignment are only a few of the many issues that make it difficult, if not impossible, for deep reinforcement learning (RL) agents to learn optimal policies. Unfortunately, the black-box nature of deep networks impedes the inclusion of domain experts who could interpret the model and correct wrong behavior. To this end, we introduce Successive Concept
-
Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials arXiv.cs.SC Pub Date : 2023-12-31 Hoon Hong, Jing Yang
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over each cell and constructing a uniform expression of gcd in each cell. We tackle the problem as follows. We begin by making a natural and obvious extension of subresultant
-
Hypergeometric-Type Sequences arXiv.cs.SC Pub Date : 2023-12-30 Bertrand Teguia Tabuguia
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of sequences in this class are those defined by trigonometric functions with linear arguments in the index and $\pi$, such as Chebyshev polynomials, $\left(\sin^2\left(n\
-
Joint symbolic aggregate approximation of time series arXiv.cs.SC Pub Date : 2023-12-30 Xinye Chen
The increasing availability of temporal data poses a challenge to time-series and signal-processing domains due to its high numerosity and complexity. Symbolic representation outperforms raw data in a variety of engineering applications due to its storage efficiency, reduced numerosity, and noise reduction. The most recent symbolic aggregate approximation technique called ABBA demonstrates outstanding
-
Adaptive Flip Graph Algorithm for Matrix Multiplication arXiv.cs.SC Pub Date : 2023-12-28 Yamato Arai, Yuma Ichikawa, Koji Hukushima
This study proposes the "adaptive flip graph algorithm", which combines adaptive searches with the flip graph algorithm for finding fast and efficient methods for matrix multiplication. The adaptive flip graph algorithm addresses the inherent limitations of exploration and inefficient search encountered in the original flip graph algorithm, particularly when dealing with large matrix multiplication
-
Symbolic Security Verification of Mesh Commissioning Protocol in Thread (extended version) arXiv.cs.SC Pub Date : 2023-12-20 Pankaj Upadhyay, Subodh Sharma, Guangdong Bai
The Thread protocol (or simply Thread ) is a popular networking protocol for the Internet of Things (IoT). It allows seamless integration of a set of applications and protocols, hence reducing the risk of incompatibility among different applications or user protocols. Thread has been deployed in many popular smart home products by the majority of IoT manufacturers, such as Apple TV, Apple HomePod mini
-
LoKit (revisited): A Toolkit for Building Distributed Collaborative Applications arXiv.cs.SC Pub Date : 2023-12-19 Uwe M. Borghoff
LoKit is a toolkit based on the coordination language LO. It allows to build distributed collaborative applications by providing a set of generic tools. This paper briefly introduces the concept of the toolkit, presents a subset of the LoKit tools, and finally demonstrates its power by discussing a sample application built with the toolkit.
-
Physical Symbolic Optimization arXiv.cs.SC Pub Date : 2023-12-06 Wassim Tenachi, Rodrigo Ibata, Foivos I. Diakogiannis
We present a framework for constraining the automatic sequential generation of equations to obey the rules of dimensional analysis by construction. Combining this approach with reinforcement learning, we built $\Phi$-SO, a Physical Symbolic Optimization method for recovering analytical functions from physical data leveraging units constraints. Our symbolic regression algorithm achieves state-of-the-art
-
Robust Clustering using Hyperdimensional Computing arXiv.cs.SC Pub Date : 2023-12-05 Lulu Ge, Keshab K. Parhi
This paper addresses the clustering of data in the hyperdimensional computing (HDC) domain. In prior work, an HDC-based clustering framework, referred to as HDCluster, has been proposed. However, the performance of the existing HDCluster is not robust. The performance of HDCluster is degraded as the hypervectors for the clusters are chosen at random during the initialization step. To overcome this
-
Here Is Not There: Measuring Entailment-Based Trajectory Similarity for Location-Privacy Protection and Beyond arXiv.cs.SC Pub Date : 2023-12-02 Zilong Liu, Krzysztof Janowicz, Kitty Currier, Meilin Shi, Jinmeng Rao, Song Gao, Ling Cai, Anita Graser
While the paths humans take play out in social as well as physical space, measures to describe and compare their trajectories are carried out in abstract, typically Euclidean, space. When these measures are applied to trajectories of actual individuals in an application area, alterations that are inconsequential in abstract space may suddenly become problematic once overlaid with geographic reality
-
${L}^{\infty}$-norm computation for linear time-invariant systems depending on parameters arXiv.cs.SC Pub Date : 2023-12-01 Alban Quadrat, Fabrice Rouillier, Grace Younes
This paper focuses on representing the $L^{\infty}$-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to finding the maximum $y$-projection of real solutions $(x, y)$ of a system of the form $\Sigma=\{P=0, \, \partial P/\partial x=0\}$, where $P \in \Z[x, y]$. To solve this
-
Nested Integrals and Rationalizing Transformations arXiv.cs.SC Pub Date : 2023-11-28 Clemens G. Raab
A brief overview of some computer algebra methods for computations with nested integrals is given. The focus is on nested integrals over integrands involving square roots. Rewrite rules for conversion to and from associated nested sums are discussed. We also include a short discussion comparing the holonomic systems approach and the differential field approach. For simplification to rational integrands
-
Hybrid Intervals and Symbolic Block Matrices arXiv.cs.SC Pub Date : 2023-11-28 Mike Ghesquiere, Stephen M. Watt
Structured matrices with symbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as computational objects, showing how to add matrices with blocks of different symbolic sizes in a general way while avoiding a combinatorial explosion of cases. The present article introduces
-
The Inverse of the Complex Gamma Function arXiv.cs.SC Pub Date : 2023-11-28 David J. Jeffrey, Stephen M. Watt
We consider the functional inverse of the Gamma function in the complex plane, where it is multi-valued, and define a set of suitable branches by proposing a natural extension from the real case.
-
Efficient Local Search for Nonlinear Real Arithmetic arXiv.cs.SC Pub Date : 2023-11-24 Zhonghan Wang, Bohua Zhan, Bohan Li, Shaowei Cai
Local search has recently been applied to SMT problems over various arithmetic theories. Among these, nonlinear real arithmetic poses special challenges due to its uncountable solution space and potential need to solve higher-degree polynomials. As a consequence, existing work on local search only considered fragments of the theory. In this work, we analyze the difficulties and propose ways to address
-
Geometric Fiber Classification of Morphisms and a Geometric Approach to Cylindrical Algebraic Decomposition arXiv.cs.SC Pub Date : 2023-11-17 Rizeng Chen
Cylindrical Algebraic Decomposition (CAD) is a classical construction in real algebraic geometry. The original cylindrical algebraic decomposition was proposed by Collins, using the classical elimination theory. In this paper, we first study the geometric fibers cardinality classification problem of morphisms of affine varieties (over a field of characteristic 0), using a constructive version of Grothendieck's
-
ACL2 Proofs of Nonlinear Inequalities with Imandra arXiv.cs.SC Pub Date : 2023-11-15 Grant PassmoreImandra Inc.
We present a proof-producing integration of ACL2 and Imandra for proving nonlinear inequalities. This leverages a new Imandra interface exposing its nonlinear decision procedures. The reasoning takes place over the reals, but the proofs produced are valid over the rationals and may be run in both ACL2 and ACL2(r). The ACL2 proofs Imandra constructs are extracted from Positivstellensatz refutations
-
Formal Verification of Zero-Knowledge Circuits arXiv.cs.SC Pub Date : 2023-11-15 Alessandro CoglioKestrel Institute and Aleo Systems Inc., Eric McCarthyKestrel Institute and Aleo Systems Inc., Eric W. SmithKestrel Institute
Zero-knowledge circuits are sets of equality constraints over arithmetic expressions interpreted in a prime field; they are used to encode computations in cryptographic zero-knowledge proofs. We make the following contributions to the problem of ensuring that a circuit correctly encodes a computation: a formal framework for circuit correctness; an ACL2 library for prime fields; an ACL2 model of the
-
Computing Implicitizations of Multi-Graded Polynomial Maps arXiv.cs.SC Pub Date : 2023-11-13 Joseph Cummings, Benjamin Hollering
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this problem, these methods can become infeasible as the number of variables increases. In the case when the map $\varphi$ is multigraded, we consider an alternative approach
-
On the Existence of Telescopers for P-recursive Sequences arXiv.cs.SC Pub Date : 2023-11-10 Lixin Du
We extend the criterion on the existence of telescopers for hypergeometric terms to the case of P-recursive sequences. This criterion is based on the concept of integral bases and the generalized Abramov-Petkovsek reduction for P-recursive sequences.
-
Stability Problems on D-finite Functions arXiv.cs.SC Pub Date : 2023-11-10 Shaoshi Chen, Ruyong Feng, Zewang Guo, Wei Lu
This paper continues the studies of symbolic integration by focusing on the stability problems on D-finite functions. We introduce the notion of stability index in order to investigate the order growth of the differential operators satisfied by iterated integrals of D-finite functions and determine bounds and exact formula for stability indices of several special classes of differential operators.
-
Reduction-based Creative Telescoping for P-recursive Sequences via Integral Bases arXiv.cs.SC Pub Date : 2023-11-09 Shaoshi Chen, Lixin Du, Manuel Kauers, Rong-Hua Wang
We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative telescoping algorithm based on the concept of integral bases.
-
Scene-Driven Multimodal Knowledge Graph Construction for Embodied AI arXiv.cs.SC Pub Date : 2023-11-07 Song Yaoxian, Sun Penglei, Liu Haoyu, Li Zhixu, Song Wei, Xiao Yanghua, Zhou Xiaofang
Embodied AI is one of the most popular studies in artificial intelligence and robotics, which can effectively improve the intelligence of real-world agents (i.e. robots) serving human beings. Scene knowledge is important for an agent to understand the surroundings and make correct decisions in the varied open world. Currently, knowledge base for embodied tasks is missing and most existing work use
-
On the dimension of the solution space of linear difference equations over the ring of infinite sequences arXiv.cs.SC Pub Date : 2023-11-03 Sergei Abramov, Gleb Pogudin
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior information on the dimension is available.
-
Linear difference operators with sequence coefficients having infinite-dimentional solution spaces arXiv.cs.SC Pub Date : 2023-11-03 Sergei Abramov, Gleb Pogudin
The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to the set R of infinite numerical sequences, a criterion (i.e., a necessary and sufficient condition) for the infinite dimensionality of its space $V_L$ of solutions belonging to R is the presence of a lacunary sequence in $V_L$.
-
Dissipative quadratizations of polynomial ODE systems arXiv.cs.SC Pub Date : 2023-11-04 Yubo Cai, Gleb Pogudin
Quadratization refers to a transformation of an arbitrary system of polynomial ordinary differential equations to a system with at most quadratic right-hand side. Such a transformation unveils new variables and model structures that facilitate model analysis, simulation, and control and offers a convenient parameterization for data-driven approaches. Quadratization techniques have found applications
-
Multi-Operational Mathematical Derivations in Latent Space arXiv.cs.SC Pub Date : 2023-11-02 Marco Valentino, Jordan Meadows, Lan Zhang, André Freitas
This paper investigates the possibility of approximating multiple mathematical operations in latent space for expression derivation. To this end, we introduce different multi-operational representation paradigms, modelling mathematical operations as explicit geometric transformations. By leveraging a symbolic engine, we construct a large-scale dataset comprising 1.7M derivation steps stemming from
-
Optimizing Logical Execution Time Model for Both Determinism and Low Latency arXiv.cs.SC Pub Date : 2023-10-30 Sen Wang, Dong Li, Ashrarul H. Sifat, Shao-Yu Huang, Xuanliang Deng, Changhee Jung, Ryan Williams, Haibo Zeng
The Logical Execution Time (LET) programming model has recently received considerable attention, particularly because of its timing and dataflow determinism. In LET, task computation appears always to take the same amount of time (called the task's LET interval), and the task reads (resp. writes) at the beginning (resp. end) of the interval. Compared to other communication mechanisms, such as implicit
-
A Novel Application of Polynomial Solvers in mmWave Analog Radio Beamforming arXiv.cs.SC Pub Date : 2023-10-27 Snehal Bhayani, Praneeth Susarla, S. S. Krishna Chaitanya Bulusu, Olli Silven, Markku Juntti, Janne Heikkila
Beamforming is a signal processing technique where an array of antenna elements can be steered to transmit and receive radio signals in a specific direction. The usage of millimeter wave (mmWave) frequencies and multiple input multiple output (MIMO) beamforming are considered as the key innovations of 5th Generation (5G) and beyond communication systems. The technique initially performs a beam alignment
-
Dimensionally Homogeneous Jacobian using Extended Selection Matrix for Performance Evaluation and Optimization of Parallel Manipulators arXiv.cs.SC Pub Date : 2023-10-27 Hassen Nigatu, Doik Kim
This paper proposes a new methodology for deriving a point-based dimensionally homogeneous Jacobian, intended for performance evaluation and optimization of parallel manipulators with mixed degrees of freedom. Optimal manipulator often rely on performance indices obtained from the Jacobian matrix. However, when manipulators exhibit mixed translational and rotational freedoms, the conventional Jacobian's
-
Accurate prediction of international trade flows: Leveraging knowledge graphs and their embeddings arXiv.cs.SC Pub Date : 2023-10-17 Diego Rincon-Yanez, Chahinez Ounoughi, Bassem Sellami, Tarmo Kalvet, Marek Tiits, Sabrina Senatore, Sadok Ben Yahia
Knowledge representation (KR) is vital in designing symbolic notations to represent real-world facts and facilitate automated decision-making tasks. Knowledge graphs (KGs) have emerged so far as a popular form of KR, offering a contextual and human-like representation of knowledge. In international economics, KGs have proven valuable in capturing complex interactions between commodities, companies
-
A computational model of serial and parallel processing in visual search arXiv.cs.SC Pub Date : 2023-10-16 Rachel F. Heaton
The following is a dissertation aimed at understanding what the various phenomena in visual search teach us about the nature of human visual representations and processes. I first review some of the major empirical findings in the study of visual search. I next present a theory of visual search in terms of what I believe these findings suggest about the representations and processes underlying ventral
-
Three Paths to Rational Curves with Rational Arc Length arXiv.cs.SC Pub Date : 2023-10-12 Hans-Peter Schröcker, Zbyněk Šìr
We solve the so far open problem of constructing all spatial rational curves with rational arc length functions. More precisely, we present three different methods for this construction. The first method adapts a recent approach of (Kalkan et al. 2022) to rational PH curves and requires solving a modestly sized and well structured system of linear equations. The second constructs the curve by imposing
-
What can knowledge graph alignment gain with Neuro-Symbolic learning approaches? arXiv.cs.SC Pub Date : 2023-10-11 Pedro Giesteira Cotovio, Ernesto Jimenez-Ruiz, Catia Pesquita
Knowledge Graphs (KG) are the backbone of many data-intensive applications since they can represent data coupled with its meaning and context. Aligning KGs across different domains and providers is necessary to afford a fuller and integrated representation. A severe limitation of current KG alignment (KGA) algorithms is that they fail to articulate logical thinking and reasoning with lexical, structural
-
Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs arXiv.cs.SC Pub Date : 2023-10-09 Máté L. Telek
We describe conditions on the signed support, that is, on the set of the exponent vectors and on the signs of the coefficients, of a multivariate polynomial $f$ ensuring that the semi-algebraic set $\{ f < 0 \}$ defined in the positive orthant has at most one connected component. These results generalize Descartes' rule of signs in the sense that they provide a bound which is independent of the values
-
Divide, Conquer and Verify: Improving Symbolic Execution Performance arXiv.cs.SC Pub Date : 2023-10-05 Christopher Scherb, Luc Bryan Heitz, Hermann Grieder, Olivier Mattmann
Symbolic Execution is a formal method that can be used to verify the behavior of computer programs and detect software vulnerabilities. Compared to other testing methods such as fuzzing, Symbolic Execution has the advantage of providing formal guarantees about the program. However, despite advances in performance in recent years, Symbolic Execution is too slow to be applied to real-world software.