Tootfinder

Constructing Data Transaction Chains Based on Opportunity Cost Exploration
Jie Liu, Tao Feng, Yan Jiang, Peizheng Wang, Chao Wu
https://arxiv.org/abs/2404.05272

Constructing Data Transaction Chains Based on Opportunity Cost Exploration
Data trading is increasingly gaining attention. However, the inherent replicability and privacy concerns of data make it challenging to directly apply traditional trading theories to data markets. This paper compares data trading markets with traditional ones, focusing particularly on how the replicability and privacy of data impact data markets. We discuss how data's replicability fundamentally alters the concept of opportunity cost in traditional microeconomics within the context of data mark…

Constructing hierarchical time series through clustering: Is there an optimal way for forecasting?
Bohan Zhang, Anastasios Panagiotelis, Han Li
https://arxiv.org/abs/2404.06064

Constructing hierarchical time series through clustering: Is there an optimal way for forecasting?
Forecast reconciliation has attracted significant research interest in recent years, with most studies taking the hierarchy of time series as given. We extend existing work that uses time series clustering to construct hierarchies, with the goal of improving forecast accuracy, in three ways. First, we investigate multiple approaches to clustering, including not only different clustering algorithms, but also the way time series are represented and how distance between time series is defined. We …

Coarse-grained quantum state tomography with optimal POVM construction
Donghun Jung, Young-Wook Cho, Yosep Kim, Junghyun Lee
https://arxiv.org/abs/2404.06285

Coarse-grained quantum state tomography with optimal POVM construction
Constructing an integrated large-scale qubit system of realistic size requires addressing the challenge of physical crowding among qubits. This constraint poses an issue of coarse-grained (CG) measurement, wherein information from the multi-qubit system is collectively gathered. In this work, we introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) using a Parameterized Quantum Circuit (PQC) under the constraint …

Partisans: Russia constructing barriers to prevent further strikes on Black Sea fleet: https://benborges.xyz/2024/03/27/partisans-russia-constructing.html

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Jio Oh, Soyeon Kim, Junseok Seo, Jindong Wang, Ruochen Xu, Xing Xie, Steven Euijong Whang
https://arxiv.org/abs/2403.05266

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Large language models (LLMs) have achieved unprecedented performance in various applications, yet their evaluation remains a critical issue. Existing hallucination benchmarks are either static or lack adjustable complexity for thorough analysis. We contend that utilizing existing relational databases is a promising approach for constructing benchmarks due to their accurate knowledge description via functional dependencies. We propose ERBench to automatically convert any relational database into…

🪚 Reflectively constructing enums at runtime
(… true Gonzo Java programming)
#java

Reflectively constructing enums at runtime - Highly Suspect Agency
Extending Java enums at runtime. What could go wrong?

This https://arxiv.org/abs/2311.14228 has been replaced.
link: https://scholar.google.com/scholar?q=a

Formulations to select assets for constructing sparse index tracking portfolios
In this paper, we study asset selection methods to construct a sparse index tracking portfolio. For its advantage over full replication portfolio, the concept of sparse index tracking portfolio has significant attention in the field of finance and investment management. We propose useful formulations to select assets for sparse index tracking portfolio. Our formulations are described as combinatorial optimization problems, and they can yield various asset selection methods, including some exist…

Control-Oriented Identification for the Linear Quadratic Regulator: Technical Report
Sean Anderson, Jo\~ao Pedro Hespanha
https://arxiv.org/abs/2403.05455 …

Control-Oriented Identification for the Linear Quadratic Regulator: Technical Report
Data-driven control benefits from rich datasets, but constructing such datasets becomes challenging when gathering data is limited. We consider an offline experiment design approach to gathering data where we design a control input to collect data that will most improve the performance of a feedback controller. We show how such a control-oriented approach can be used in a setting with linear dynamics and quadratic objective and, through design of a gradient estimator, solve the problem via stoc…

Variational Optimization for Constructing Inverse Potentials of Proton-Proton Scattering: A Phase Function Method Study
Lalit Kumar, Arushi Sharma, Anil Khachi, Ayushi Awasthi, O. S. K. S. Sastri
https://arxiv.org/abs/2404.06318

Variational Optimization for Constructing Inverse Potentials of Proton-Proton Scattering: A Phase Function Method Study
Background: The phase-shift analysis for proton-proton scattering has been studied by various research groups using the realistic potentials to be comprised of various internal interactions based on an exchange of pions and mesons, involving a large number of parameters. Purpose: The goal of the research is to construct inverse potentials for various l-channels of proton-proton (pp) elastic scattering using the 3-parameter Morse function in combination with atomic Hulthen by utilizing the phase…

This https://arxiv.org/abs/2403.04346 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDL_…

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
The vast accumulation of neuroscience knowledge presents a challenge for researchers to timely and accurately locate the specific information they require. Constructing a knowledge engine that automatically extracts and organizes information from academic papers can provide researchers with timely and accurate informational services. We present the Brain Knowledge Engine (BrainKnow), which extracts and integrates neuroscience knowledge from published papers from PubMed. BrainKnow comprises a su…

This https://arxiv.org/abs/2305.07163 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Lattice-preserving $\mathcal{ALC}$ ontology embeddings
Generating vector representations (embeddings) of OWL ontologies is a growing task due to its applications in predicting missing facts and knowledge-enhanced learning in fields such as bioinformatics. The underlying semantics of OWL ontologies is expressed using Description Logics (DLs). Initial approaches to generate embeddings relied on constructing a graph out of ontologies, neglecting the semantics of the logic therein. Recent semantic-preserving embedding methods often target lightweight D…

"Constructing ‘A Noble Library’: Enriqueta Rylands, a Woman Ahead of her Time": https://blogs.bodleian.ox.ac.uk/oxfordtrainees/constructing-a-noble-library-enriqueta-rylands-a-woman-ahead-of-her-time/

A pseudo-spectral approach to constructing rotating boson star spacetimes
Nikolay Sukhov
https://arxiv.org/abs/2404.03852 https://arx…

A pseudo-spectral approach to constructing rotating boson star spacetimes
We present a novel numerical solver for the systems of coupled non-linear elliptical differential equations. The solver partitions the computational domain into a set of rectangular pseudo-spectral collocation subdomains and is especially well-suited for working with stiff solutions such as almost shell-like solitonic boson stars. The method can be used in any number of dimensions although is practical for one- to three-dimensional problems. We apply the method to rotating and spherically symme…

Computer-Assisted Global Analysis for Vibro-Impact Dynamics: A Reduced Smooth Maps Approach
Lanjing Bao, Rachel Kuske, Daniil Yurchenko, Igor Belykh
https://arxiv.org/abs/2404.06291

Computer-Assisted Global Analysis for Vibro-Impact Dynamics: A Reduced Smooth Maps Approach
We present a novel approach for studying the global dynamics of a vibro-impact pair, that is, a ball moving in a harmonically forced capsule. Motivated by a specific context of vibro-impact energy harvesting, we develop the method with broader non-smooth systems in mind. The seeming complications of the impacts of the ball with the capsule are exploited as useful non-smooth features in selecting appropriate return maps. This choice yields a computationally efficient framework for constructing r…

"High work autonomy builds a free and relaxed working atmosphere, facilitating knowledge creation and self-determination."
Measuring the decent work of knowledge workers: Constructing and validating a new scale (Yan Geng Gao 2023)
https://www.sciencedirect.com/science/arti

Coarse-grained quantum state tomography with optimal POVM construction
Donghun Jung, Young-Wook Cho, Yosep Kim, Junghyun Lee
https://arxiv.org/abs/2404.06285

Coarse-grained quantum state tomography with optimal POVM construction
Constructing an integrated large-scale qubit system of realistic size requires addressing the challenge of physical crowding among qubits. This constraint poses an issue of coarse-grained (CG) measurement, wherein information from the multi-qubit system is collectively gathered. In this work, we introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) using a Parameterized Quantum Circuit (PQC) under the constraint …

Constructing $\omega$-free Hardy fields
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
https://arxiv.org/abs/2404.03695 https://

Constructing $ω$-free Hardy fields
We show that every Hardy field extends to an $ω$-free Hardy field. This result relates to classical oscillation criteria for second-order homogeneous linear differential equations. It is essential in [12], and here we apply it to answer questions of Boshernitzan, and to generalize a theorem of his.

On the approximation properties of fast Leja points
Sione Ma`u
https://arxiv.org/abs/2405.05436 https://arxiv.org/pdf/2405.05436

On the approximation properties of fast Leja points
Fast Leja points on an interval are points constructed using a discrete modification of the algorithm for constructing Leja points. Not much about fast Leja points has been proven theoretically. We present an asymptotic property of a triangular interpolation array, and under the assumption that fast Leja points satisfy this property, we prove that they are good for Lagrange interpolation.

Probabilistic Byzantine Fault Tolerance (Extended Version)
Diogo Avel\~as, Hasan Heydari, Eduardo Alchieri, Tobias Distler, Alysson Bessani
https://arxiv.org/abs/2405.04606

Probabilistic Byzantine Fault Tolerance (Extended Version)
Consensus is a fundamental building block for constructing reliable and fault-tolerant distributed services. Many Byzantine fault-tolerant consensus protocols designed for partially synchronous systems adopt a pessimistic approach when dealing with adversaries, ensuring safety in a deterministic way even under the worst-case scenarios that adversaries can create. Following this approach typically results in either an increase in the message complexity (e.g., PBFT) or an increase in the number o…

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Jio Oh, Soyeon Kim, Junseok Seo, Jindong Wang, Ruochen Xu, Xing Xie, Steven Euijong Whang
https://arxiv.org/abs/2403.05266

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Large language models (LLMs) have achieved unprecedented performance in various applications, yet their evaluation remains a critical issue. Existing hallucination benchmarks are either static or lack adjustable complexity for thorough analysis. We contend that utilizing existing relational databases is a promising approach for constructing benchmarks due to their accurate knowledge description via functional dependencies. We propose ERBench to automatically convert any relational database into…

This https://arxiv.org/abs/2402.07741 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Monodromy of elliptic logarithms: some topological methods and effective results
We present some effective approaches in studying the relative monodromy group of elliptic logarithms with respect to periods of elliptic schemes. We provide explicit ways of constructing explicit loops which leave periods unchanged but along which logarithms have non-trivial variations. We also get some topological methods and effective results which allow to manage the ramification locus of sections. The paper was inspired by a theorem of Corvaja and Zannier which abstractly determine the rela…

This https://arxiv.org/abs/2209.12578 has been replaced.
link: https://scholar.google.com/scholar?q=a

Every countable model of arithmetic or set theory has a pointwise-definable end extension
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of set theory, in which every individual is definable without parameters, challenges this conclusion. In this article, I introduce a flexible new method for constructing pointwise-definable models of arithmetic and set theory, showing furthermore that every coun…

Enhancing LLM-based Test Generation for Hard-to-Cover Branches via Program Analysis
Chen Yang, Junjie Chen, Bin Lin, Jianyi Zhou, Ziqi Wang
https://arxiv.org/abs/2404.04966

Enhancing LLM-based Test Generation for Hard-to-Cover Branches via Program Analysis
Automatic test generation plays a critical role in software quality assurance. While the recent advances in Search-Based Software Testing (SBST) and Large Language Models (LLMs) have shown promise in generating useful tests, these techniques still struggle to cover certain branches. Reaching these hard-to-cover branches usually requires constructing complex objects and resolving intricate inter-procedural dependencies in branch conditions, which poses significant challenges for existing test ge…

0-Hecke Modules, Domino Tableaux, and Type-$B$ Quasisymmetric Functions
Colin Defant, Dominic Searles
https://arxiv.org/abs/2404.04961 https://

0-Hecke Modules, Domino Tableaux, and Type-$B$ Quasisymmetric Functions
We extend the notion of ascent-compatibility from symmetric groups to all Coxeter groups, thereby providing a type-independent framework for constructing families of modules of $0$-Hecke algebras. We apply this framework in type $B$ to give representation-theoretic interpretations of a number of noteworthy families of type-$B$ quasisymmetric functions. Next, we construct modules of the type-$B$ $0$-Hecke algebra corresponding to type-$B$ analogues of Schur functions and introduce a type-$B$ ana…

This https://arxiv.org/abs/2310.01823 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Integrability of Large-Charge Sectors in Generic 2D EFTs
It is shown that integrability is an accidental property of generic two-dimensional $O(2)$-symmetric asymptotically-free theories in the regime where the charge density is much larger than the dynamical scale. We show this by constructing an infinite tower of higher-spin conserved currents in the most generic effective Lagrangian at large chemical potential to all orders in perturbative expansion in the renormalization-group invariant coupling constant.

This https://arxiv.org/abs/2401.17211 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Quantum dynamics in one and two dimensions via recursion method
We report an implementation of the recursion method that addresses quantum many-body dynamics in the nonperturbative regime. The method essentially amounts to constructing a Lanczos basis in the space of operators and solving coupled Heisenberg equations in this basis. The reported implementation has two key ingredients: a computer-algebraic routine for symbolic calculation of nested commutators and a procedure to extrapolate the sequence of Lanczos coefficients according to the universal opera…

Geometric Approach to Mirabolic Schur-Weyl Duality of Type A
Zhaobing Fan, Zhicheng Zhang, Haitao Ma
https://arxiv.org/abs/2404.05594 https://

Geometric Approach to Mirabolic Schur-Weyl Duality of Type A
We commence by constructing the mirabolic quantum Schur algebra, utilizing the convolution algebra defined on the variety of triples of two $n$-step partial flags and a vector. Subsequently, we employ a stabilization procedure to derive the mirabolic quantum $\mathfrak{gl}_n$. Then we present the geometric approach of the mirabolic Schur-Weyl duality of type $A$.

Fully Charmed Tetraquark States in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ Color Structure via QCD Sum Rules
Chun-Meng Tang, Chun-Gui Duan, Liang Tang
https://arxiv.org/abs/2405.05042

Fully Charmed Tetraquark States in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ Color Structure via QCD Sum Rules
Stimulated by the recent experimental results on the fully-charm tetraquark states, we systematically calculate the mass spectra of the fully-charm tetraquark states in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ color configuration via QCD sum rules. By constructing nine $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ type currents with quantum numbers $J^{PC}=0^{-+},0^{--},1^{-+},1^{+-},1^{--}$ and $2^{++}$, we perform analytic calculation up to dimension six in the Operator Product Expansion (OPE). We find …

This https://arxiv.org/abs/2110.02898 has been replaced.
link: https://scholar.google.com/scholar?q=a

Coresets for Kernel Clustering
We devise coresets for kernel $k$-Means with a general kernel, and use them to obtain new, more efficient, algorithms. Kernel $k$-Means has superior clustering capability compared to classical $k$-Means, particularly when clusters are non-linearly separable, but it also introduces significant computational challenges. We address this computational issue by constructing a coreset, which is a reduced dataset that accurately preserves the clustering costs. Our main result is a coreset for kernel…

This https://arxiv.org/abs/2405.02968 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning
Library-based methods are known to be very effective for fast motion planning by adapting an experience retrieved from a precomputed library. This article presents CoverLib, a principled approach for constructing and utilizing such a library. CoverLib iteratively adds an experience-classifier-pair to the library, where each classifier corresponds to an adaptable region of the experience within the problem space. This iterative process is an active procedure, as it selects the next experience ba…

This https://arxiv.org/abs/2401.09027 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Exact Homomorphic Encryption
Inspired by the concept of fault tolerance quantum computation, this article proposes a framework dubbed Exact Homomorphic Encryption, EHE, enabling exact computations on encrypted data without the need for pre-decryption. The introduction of quantum gates is a critical step for constructing the message encryption and the computation encryption within the framework. Of significance is that both encryptions are respectively accomplished in a multivariate polynomial set generated by quantum gates…

"Prompt Engineering" is the pseudoscience of constructing prompts for Asinine Inference programs like ChatGPT so as to obtain the desired results. It is today's instance of the Search Engine Optimization profession.
"Prompt Sabotage" is the more satisfying art of creating prompts for such AI programs so as to expose their inherent limitations. Some examples to follow. >>

Constructing Modular Tensor Categories with Hopf Algebras
Kun Zhou
https://arxiv.org/abs/2403.02643 https://arxiv.org/pdf/2403.02643<…

Constructing Modular Tensor Categories with Hopf Algebras
A modular tensor category is a non-degenerate ribbon finite tensor category. And a ribbon factorizable Hopf algebra is exactly the Hopf algebra whose finite-dimensional representations form a modular tensor category. The goal of this paper is to construct both semisimple and non-semisimple modular categories with Hopf algebras. In particular, we study central extensions of Hopf algebras and characterize some conditions for a quotient Hopf algebra to be a factorizable one. Then we give a special…

"High work autonomy builds a free and relaxed working atmosphere, facilitating knowledge creation and self-determination."
Measuring the decent work of knowledge workers: Constructing and validating a new scale (Yan Geng Gao 2023)
https://www.sciencedirect.com/science/arti

Good news from The David Suzuki Foundation
To save a world in a grain of sand
Storage systems ensure wind and solar energy is available 24/7. Lithium batteries are good, but come with their own problems. As Euronews Green points out, “Grains of sand, it turns out, are surprisingly roomy when it comes to energy storage.” Following up on a smaller power station it built in Kankaanpää, Finland, in 2022, Polar Night Energy is now constructing the world’s biggest sand battery in Porna…

Energy-superconvergent Runge-Kutta Time Discretizations
Jinjie Liu, Moysey Brio
https://arxiv.org/abs/2405.05448 https://arxiv.org/pd…

Energy-superconvergent Runge-Kutta Time Discretizations
In this paper, we investigate the energy accuracy of explicit Runge-Kutta (RK) time discretization for antisymmetric autonomous linear systems and present a framework for constructing RK methods with an order of energy accuracy much greater than the number of stages. For an $s$-stage, $p$th-order RK method, we show that the energy accuracy can achieve superconvergence with an order up to $2s-p+1$ if $p$ is even. Several energy-superconvergent methods, including five- to seven-stage fourth-order…

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
Topi Halme, Venugopal V. Veeravalli, Visa Koivunen
https://arxiv.org/abs/2404.05486

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
The problem of quickest change detection is studied in the context of detecting an arbitrary unknown mean-shift in multiple independent Gaussian data streams. The James-Stein estimator is used in constructing detection schemes that exhibit strong detection performance both asymptotically and non-asymptotically. First, a James-Stein-based extension of the recently developed windowed CuSum test is introduced. Our results indicate that the proposed scheme constitutes a uniform improvement over its…

Constructing equilibrium states for Smale spaces
David Parmenter, Mark Pollicott
https://arxiv.org/abs/2403.04646 https://arxiv.org/p…

Constructing equilibrium states for Smale spaces
There are several known constructions of equilibrium states for Hölder continuous potentials in the context of both subshifts of finite type and uniformly hyperbolic systems. In this article we present another method of building such measures, formulated in the unified and more general setting of Smale spaces. This simultaneously extends the authors' previous work for hyperbolic attractors (modelled after Sinai's classical approach for SRB-measures) and gives a new and original construction of…

This https://arxiv.org/abs/2309.09753 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Non-uniqueness in law of Leray solutions to 3D forced stochastic Navier-Stokes equations
This paper concerns the forced stochastic Navier-Stokes equation driven by additive noise in the three dimensional Euclidean space. By constructing an appropriate forcing term, we prove that there exist distinct Leray solutions in the probabilistically weak sense. In particular, the joint uniqueness in law fails in the Leray class. The non-uniqueness also displays in the probabilistically strong sense in the local time regime, up to stopping times. Furthermore, we discuss the optimality from tw…

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
Shikha Mehta, Shruthi Sai Chivukula, Colin M. Gray, Ritika Gairola
https://arxiv.org/abs/2405.03674

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
HCI and design researchers have designed, adopted, and customized a range of ethics-focused methods to inscribe values and support ethical decision making in a design process. In this work-in-progress, we add to this body of resources, constructing a method that surfaces the designer's intentions in an action-focused way, encouraging consideration of both manipulative and value-centered roles. Anti-Heroes is a card deck that allows a designer to playfully take on pairs of manipulative (Anti-Her…

On endotrivial complexes and the generalized Dade group
Sam K. Miller
https://arxiv.org/abs/2403.04088 https://arxiv.org/pdf/2403.040…

On endotrivial complexes and the generalized Dade group
Let $p$ be a prime, $G$ a $p$-group, and $k$ a field of characteristic $p$. We give a complete description of the group $\mathcal{E}_k(G)$ of endotrivial complexes, identifying $\mathcal{E}_k(G)$ with the additive subgroup of integer-valued class functions satisfying the Borel-Smith conditions. This is done by constructing a short exact sequence isomorphic to a short exact sequence of rational $p$-biset functors constructed by Bouc and Yalçin, endowing $\mathcal{E}_k$ with rational $p$-biset s…

Solving the bongard-logo problem by modeling a probabilistic model
Ruizhuo Song, Beiming Yuan
https://arxiv.org/abs/2403.03173 https://

Solving the bongard-logo problem by modeling a probabilistic model
Abstract reasoning problems challenge the perceptual and cognitive abilities of AI algorithms, demanding deeper pattern discernment and inductive reasoning beyond explicit image features. This study introduces PMoC, a tailored probability model for the Bongard-Logo problem, achieving high reasoning accuracy by constructing independent probability models. Additionally, we present Pose-Transformer, an enhanced Transformer-Encoder designed for complex abstract reasoning tasks, including Bongard-Lo…

A Nearly Finitary Matroid that is not $k$-Nearly Finitary
Patrick Tam
https://arxiv.org/abs/2404.04721 https://arxiv.org/pdf/2404.047…

A Nearly Finitary Matroid that is not $k$-Nearly Finitary
The class of $k$-nearly finitary matroids for some natural number $k$ is a subclass of the class of nearly finitary matroids. A natural question is whether this inclusion is proper. We answer this question affirmatively by constructing a nearly finitary matroid that is not $k$-nearly finitary for any $k \in \mathbb{N}$.

Certifying Phase Abstraction
Nils Froleyks, Emily Yu, Armin Biere, Keijo Heljanko
https://arxiv.org/abs/2405.04297 https://arxiv.org/…

Certifying Phase Abstraction
Certification helps to increase trust in formal verification of safety-critical systems which require assurance on their correctness. In hardware model checking, a widely used formal verification technique, phase abstraction is considered one of the most commonly used preprocessing techniques. We present an approach to certify an extended form of phase abstraction using a generic certificate format. As in earlier works our approach involves constructing a witness circuit with an inductive invar…

Generalized classical Yang-Baxter equation and regular decompositions
Raschid Abedin, Stepan Maximov, Alexander Stolin
https://arxiv.org/abs/2405.04440 htt…

Generalized classical Yang-Baxter equation and regular decompositions
The focus of the paper is on constructing new solutions of the generalized classical Yang-Baxter equation (GCYBE) that are not skew-symmetric. Using regular decompositions of finite-dimensional simple Lie algebras, we construct Lie algebra decompositions of $\mathfrak{g}(\!(x)\!) \times \mathfrak{g}[x]/x^m \mathfrak{g}[x]$. The latter decompositions are in bijection with the solutions to the GCYBE. Under appropriate regularity conditions, we obtain a partial classification of such solutions. Th…

This https://arxiv.org/abs/2404.15135 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Linear-Function Correcting Codes
In this paper, we study linear-function correcting codes, a class of codes designed to protect linear function evaluations of a message against errors. The work "Function-Correcting Codes" by Lenz et al. 2023 provides a graphical representation for the problem of constructing function-correcting codes. We use this graph to get a lower bound the on redundancy required for function correction. By considering the function to be a bijection, such an approach also provides a lower bound on the redun…

CVXSADes: a stochastic algorithm for constructing optimal exact regression designs with single or multiple objectives
Chi-Kuang Yeh, Julie Zhou
https://arxiv.org/abs/2405.02983

CVXSADes: a stochastic algorithm for constructing optimal exact regression designs with single or multiple objectives
We propose an algorithm to construct optimal exact designs (EDs). Most of the work in the optimal regression design literature focuses on the approximate design (AD) paradigm due to its desired properties, including the optimality verification conditions derived by Kiefer (1959, 1974). ADs may have unbalanced weights, and practitioners may have difficulty implementing them with a designated run size $n$. Some EDs are constructed using rounding methods to get an integer number of runs at each su…

Wikidata & AI, together again – Wikimedia Tech News https://tech-news.wikimedia.de/en/2024/02/19/wikidata-ai-together-again/

Wikidata & AI, together again - Wikimedia Tech News
The recently launched LangChain is an open-source framework for constructing applications with LLM backends; users can ask ChatGPT a question and have it reference data from the Wikidata knowledge graph before responding.

Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering
Long Shi, Lei Cao, Yunshan Ye, Yu Zhao, Badong Chen
https://arxiv.org/abs/2403.18393

Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering
Graph learning is widely recognized as a crucial technique in multi-view clustering. Existing graph learning methods typically involve constructing an adaptive neighbor graph based on probabilistic neighbors and then learning a consensus graph to for clustering, however, they are confronted with two limitations. Firstly, they often rely on Euclidean distance to measure similarity when constructing the adaptive neighbor graph, which proves inadequate in capturing the intrinsic structure among da…

On equivalence of the Mellin-Barnes and the Givental integral representations of the Whittaker functions
A. A. Gerasimov, D. R. Lebedev, S. V. Oblezin
https://arxiv.org/abs/2405.05152

On equivalence of the Mellin-Barnes and the Givental integral representations of the Whittaker functions
We construct an integral transformation intertwining the Gelfand-Tsetlin and the (modified) Gauss-Givental realizations of principle series representations of gl(3). This provides a direct identification of the corresponding integral representations for the gl(3)-Whittaker function. The construction essentially uses integral identities due to Barnes and Gustafson thus providing a basis for their representation theory interpretation. The result of this paper might be useful for constructing the …

https://www.theguardian.com/global-development/2024/mar/29/surajpura-rajasthan-india-drought-villagers-farmers-climate

Constructing abelian varieties from rank 3 Galois representations with real trace field
Raju Krishnamoorthy, Yeuk Hay Joshua Lam
https://arxiv.org/abs/2403.18138

Constructing abelian varieties from rank 3 Galois representations with real trace field
Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$ extends to an integral model such that the Frobenius traces are contained in a fixed totally real number field. Then, after potentially shrinking $U$, there exists an abelian scheme $f\colon B_U\rightarrow U$ such that $L$ is a summand of $R^2f_*\overline{\ma…

This https://arxiv.org/abs/2212.06977 has been replaced.
link: https://scholar.google.com/scholar?q=a

How Haag-tied is QFT, really?
Haag's theorem cries out for explanation and critical assessment: it sounds the alarm that something is (perhaps) not right in one of the standard way of constructing interacting fields to be used in generating predictions for scattering experiments. Viewpoints as to the precise nature of the problem, the appropriate solution, and subsequently-called-for developments in areas of physics, mathematics, and philosophy differ widely. In this paper, we develop and deploy a conceptual framework for c…

This https://arxiv.org/abs/2211.11940 has been replaced.
link: https://scholar.google.com/scholar?q=a

Decision-making with Speculative Opponent Models
Opponent modeling has benefited a controlled agent's decision-making by constructing models of other agents. Existing methods commonly assume access to opponents' observations and actions, which is infeasible when opponents' behaviors are unobservable or hard to obtain. We propose a novel multi-agent distributional actor-critic algorithm to achieve speculative opponent modeling with purely local information (i.e., the controlled agent's observations, actions, and rewards). Specifically, the act…

This https://arxiv.org/abs/2402.18180 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCY_…

Human Simulacra: A Step toward the Personification of Large Language Models
Large language models (LLMs) are recognized as systems that closely mimic aspects of human intelligence. This capability has attracted attention from the social science community, who see the potential in leveraging LLMs to replace human participants in experiments, thereby reducing research costs and complexity. In this paper, we introduce a framework for large language models personification, including a strategy for constructing virtual characters' life stories from the ground up, a Multi-Ag…

iSummary: Workload-based, Personalized Summaries for Knowledge Graphs
Giannis Vassiliou, Fanouris Alevizakis, Nikolaos Papadakis, Haridimos Kondylakis
https://arxiv.org/abs/2403.02934

iSummary: Workload-based, Personalized Summaries for Knowledge Graphs
The explosion in the size and the complexity of the available Knowledge Graphs on the web has led to the need for efficient and effective methods for their understanding and exploration. Semantic summaries have recently emerged as methods to quickly explore and understand the contents of various sources. However in most cases they are static not incorporating user needs and preferences and cannot scale. In this paper we present iSummary a novel scalable approach for constructing personalized su…

This https://arxiv.org/abs/2308.08064 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On Freedman's link packings
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that these bounds seemed far too large. We show that the smallest of these "extravagantly large" bounds is in fact sharp by constructing, for any link, a packing of exponentially many copies as a function of the available volume. We also produce improved and generaliz…

Association schemes arising from non-weakly regular bent functions
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
https://arxiv.org/abs/2404.05251 https://

Association schemes arising from non-weakly regular bent functions
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been extensively studied. Recently, in [13], {Ö}zbudak and Pelen constructed infinite families of symmetric association schemes of classes $5$ and $6$ by using ternary non-weakly regular bent functions.They also stated that constructing $2p$-class association schemes from…

This https://arxiv.org/abs/2403.08541 has been replaced.
link: https://scholar.google.com/scholar?q=a

On harvesting physical predictions from asymptotically safe quantum field theories
Asymptotic safety is a powerful mechanism for obtaining a consistent and predictive quantum field theory beyond the realm of perturbation theory. It hinges on an interacting fixed point of the Wilsonian renormalization group flow which controls the microscopic dynamics. Connecting the fixed point to observations requires constructing the set of effective actions compatible with this microscopic dynamics. Technically, this information is stored in the UV-critical surface of the fixed point. In t…

Birdtracks of Exotic SU(N) Color Structures
Thorsten Ohl
https://arxiv.org/abs/2403.04685 https://arxiv.org/pdf/2403.04685

Birdtracks of Exotic SU(N) Color Structures
I introduce a systematic procedure for constructing complete and independent sets of interactions of fields transforming under exotic representations of SU(N), in particular the SU(3) gauge group of QCD. It uncovers errors in previous results, starting with interactions of four fields including a single sextet.

Complex Scaling Method applied to the study of the Swanson Hamiltonian in the broken PT-symmetry phase
Viviano Fern\'andez, Romina Ram\'irez, Marta Reboiro
https://arxiv.org/abs/2405.04599

Complex Scaling Method applied to the study of the Swanson Hamiltonian in the broken PT-symmetry phase
In this work, we study the non-PT symmetry phase of the Swanson Hamiltonian in the framework of the Complex Scaling Method. By constructing a bi-orthogonality relation, we apply the formalism of the response function to analyse the time evolution of different initial wave packages. The Wigner Functions and mean value of operators are evaluated as a function of time. We analyse in detail the time evolution in the neighbourhood of Exceptional Points. We derive a continuity equation for the system…

This https://arxiv.org/abs/2401.13131 has been replaced.
initial toot: https://mastoxiv.page/@arXi…

The process of constructing new knowledge: an undergraduate laboratory exercise facilitated by a vacuum capacitor-resistor circuit
The process of constructing knowledge is typically taught to students by having them reproduce established results (e.g., homework problems). An alternative pedagogical strategy is to illustrate this process using an open problem, such as voltage decay in an RC circuit as described below. Analyzing data from this circuit in an undergraduate physics laboratory course reveals a discrepancy between the data and the exponential decay model found in textbooks. As students attempt to reconcile this d…

This https://arxiv.org/abs/2312.01209 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

A Method of Moments Approach to Asymptotically Unbiased Synthetic Controls
A common approach to constructing a Synthetic Control unit is to fit on the outcome variable and covariates in pre-treatment time periods, but it has been shown by Ferman and Pinto (2019) that this approach does not provide asymptotic unbiasedness when the fit is imperfect and the number of controls is fixed. Many related panel methods have a similar limitation when the number of units is fixed. I introduce and evaluate a new method in which the Synthetic Control is constructed using a General …

Projector-based efficient estimation of force constants
Atsuto Seko, Atsushi Togo
https://arxiv.org/abs/2403.03588 https://arxiv.org/…

Projector-based efficient estimation of force constants
Estimating force constants for crystal structures is a fundamental aspect of calculating various phonon-related properties. However, it can be a challenging task, particularly when dealing with a large number of atoms or when third and higher-order force constants are needed. In this study, we propose an efficient approach that involves constructing a complete orthonormal basis set of the force constants. We formulate this approach using projector matrices and their eigenvectors corresponding t…

This https://arxiv.org/abs/2311.17463 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCG_…

Constructing Optimal $L_{\infty}$ Star Discrepancy Sets
The $L_{\infty}$ star discrepancy is a very well-studied measure used to quantify the uniformity of a point set distribution. Constructing optimal point sets for this measure is seen as a very hard problem in the discrepancy community. Indeed, optimal point sets are, up to now, known only for $n\leq 6$ in dimension 2 and $n \leq 2$ for higher dimensions. We introduce in this paper mathematical programming formulations to construct point sets with as low $L_{\infty}$ star discrepancy as possible…

Logic Programming with Multiplicative Structures
Matteo Acclavio, Roberto Maieli
https://arxiv.org/abs/2403.03032 https://arxiv.org/p…

Logic Programming with Multiplicative Structures
In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can be elegantly represented using sequent calculi, in which each method is linked to an inference rule. In this context, proof search mirrors the program's execution. Previous works introduced a framework in which the process of constructing proof nets is employed to model executions…

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
Shikha Mehta, Shruthi Sai Chivukula, Colin M. Gray, Ritika Gairola
https://arxiv.org/abs/2405.03674

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
HCI and design researchers have designed, adopted, and customized a range of ethics-focused methods to inscribe values and support ethical decision making in a design process. In this work-in-progress, we add to this body of resources, constructing a method that surfaces the designer's intentions in an action-focused way, encouraging consideration of both manipulative and value-centered roles. Anti-Heroes is a card deck that allows a designer to playfully take on pairs of manipulative (Anti-Her…

Maximum of the Characteristic Polynomial of I.I.D. Matrices
Giorgio Cipolloni, Benjamin Landon
https://arxiv.org/abs/2405.05045 https://

Maximum of the Characteristic Polynomial of I.I.D. Matrices
We compute the leading order asymptotic of the maximum of the characteristic polynomial for i.i.d. matrices with real or complex entries. In particular, this result is new even for real Ginibre matrices, which was left as an open problem in [arXiv:2303.09912]; the complex Ginibre case was covered in [arXiv:1902.01983]. These are the first universality results for the non--Hermitian analog of the first order term of the Fyodorov--Hiary--Keating conjecture. Our methods are based on constructing a…

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
Cunqing Huangfu, Yi Zeng, Yuwei Wang, Dongsheng Wang, Zizhe Ruan
https://arxiv.org/abs/2403.04346

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
The vast accumulation of neuroscience knowledge presents a challenge for researchers to timely and accurately locate the specific information they require. Constructing a knowledge engine that automatically extracts and organizes information from academic papers can provide researchers with timely and accurate informational services. We present the Brain Knowledge Engine (BrainKnow), which extracts and integrates neuroscience knowledge from published papers from PubMed. BrainKnow comprises a su…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
Xinzijian Liu, Yanbo Han, Zhuoyuan Li, Jiahao Fan, Chengqian Zhang, Jinzhe Zeng, Yifan Shan, Yannan Yuan, Wei-Hong Xu, Yun-Pei Liu, Yuzhi Zhang, Tongqi Wen, Darrin M. York, Zhicheng Zhong, Hang Zheng, Jun Cheng, Linfeng Zhang, Han Wang
https://arxiv…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
In the AI-for-science era, scientific computing scenarios such as concurrent learning and high-throughput computing demand a new generation of infrastructure that supports scalable computing resources and automated workflow management on both cloud and high-performance supercomputers. Here we introduce Dflow, an open-source Python toolkit designed for scientists to construct workflows with simple programming interfaces. It enables complex process control and task scheduling across a distributed…

This https://arxiv.org/abs/2403.02643 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Constructing Modular Tensor Categories with Hopf Algebras
A modular tensor category is a non-degenerate ribbon finite tensor category. And a ribbon factorizable Hopf algebra is exactly the Hopf algebra whose finite-dimensional representations form a modular tensor category. The goal of this paper is to construct both semisimple and non-semisimple modular categories with Hopf algebras. In particular, we study central extensions of Hopf algebras and characterize some conditions for a quotient Hopf algebra to be a factorizable one. Then we give a special…

SCALE: Constructing Structured Natural Language Comment Trees for Software Vulnerability Detection
Xin-Cheng Wen, Cuiyun Gao, Shuzheng Gao, Yang Xiao, Michael R. Lyu
https://arxiv.org/abs/2403.19096

SCALE: Constructing Structured Natural Language Comment Trees for Software Vulnerability Detection
Recently, there has been a growing interest in automatic software vulnerability detection. Pre-trained model-based approaches have demonstrated superior performance than other Deep Learning (DL)-based approaches in detecting vulnerabilities. However, the existing pre-trained model-based approaches generally employ code sequences as input during prediction, and may ignore vulnerability-related structural information, as reflected in the following two aspects. First, they tend to fail to infer th…

An Essay concerning machine understanding
Herbert L. Roitblat
https://arxiv.org/abs/2405.01840 https://arxiv.org/pdf/2405.01840

An Essay concerning machine understanding
Artificial intelligence systems exhibit many useful capabilities, but they appear to lack understanding. This essay describes how we could go about constructing a machine capable of understanding. As John Locke (1689) pointed out words are signs for ideas, which we can paraphrase as thoughts and concepts. To understand a word is to know and be able to work with the underlying concepts for which it is an indicator. Understanding between a speaker and a listener occurs when the speaker casts his …

Special matrices over finite fields and their applications to quantum error-correcting codes
Meng Cao
https://arxiv.org/abs/2405.02285 https://

Special matrices over finite fields and their applications to quantum error-correcting codes
The matrix-product (MP) code $\mathcal{C}_{A,k}:=[\mathcal{C}_{1},\mathcal{C}_{2},\ldots,\mathcal{C}_{k}]\cdot A$ with a non-singular by column (NSC) matrix $A$ plays an important role in constructing good quantum error-correcting codes. In this paper, we study the MP code when the defining matrix $A$ satisfies the condition that $AA^†$ is $(D,τ)$-monomial. We give an explicit formula for calculating the dimension of the Hermitian hull of a MP code. We provide the necessary and sufficient co…

This https://arxiv.org/abs/2402.11445 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Balanced Truncation of Linear Systems with Quadratic Outputs in Limited Time and Frequency Intervals
Model order reduction involves constructing a reduced-order approximation of a high-order model while retaining its essential characteristics. This reduced-order model serves as a substitute for the original one in various applications such as simulation, analysis, and design. Often, there's a need to maintain high accuracy within a specific time or frequency interval, while errors beyond this limit can be tolerated. This paper addresses time-limited and frequency-limited model order reduction …

This https://arxiv.org/abs/2402.18180 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCY_…

Human Simulacra: A Step toward the Personification of Large Language Models
Large language models (LLMs) are recognized as systems that closely mimic aspects of human intelligence. This capability has attracted attention from the social science community, who see the potential in leveraging LLMs to replace human participants in experiments, thereby reducing research costs and complexity. In this paper, we introduce a framework for large language models personification, including a strategy for constructing virtual characters' life stories from the ground up, a Multi-Ag…

Military intelligence: Russia's railway to Crimea is 'important target' for Ukraine: https://benborges.xyz/2024/03/21/military-intelligence-russias.html

This https://arxiv.org/abs/2301.12933 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Constructing edge-disjoint Steiner trees in Cartesian product networks
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least two vertices, \emph{an $S$-Steiner tree} or \emph{a Steiner tree connecting $S$} (or simply, \emph{an $S$-tree}) is a subgraph $T=(V',E')$ of $F$ that is a tree with $S\subseteq V'$. For $S\subseteq V(F)$ and $|S|\geq 2$, the {\it generalized local …

This https://arxiv.org/abs/2305.12378 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Neutrino Mass Matrix in Neutrino-Related Processes
Techniques are developed for constructing amplitudes of neutrino-related processes in terms of the neutrino mass matrix, with no reference to the neutrino mixing matrix. The amplitudes of neutrino oscillations in vacuum and medium, quasi-elastic neutrino scattering, $β$ decays and double-$β$ decays are considered. The proposed approach makes extensive use of Frobenius covariants within the framework of Sylvester's theorem on matrix functions. The in-medium dispersion laws are found in terms o…

Data-Driven Permissible Safe Control with Barrier Certificates
Rayan Mazouz, John Skovbekk, Frederik Baymler Mathiesen, Eric Frew, Luca Laurenti, Morteza Lahijanian
https://arxiv.org/abs/2405.00136

Data-Driven Permissible Safe Control with Barrier Certificates
This paper introduces a method of identifying a maximal set of safe strategies from data for stochastic systems with unknown dynamics using barrier certificates. The first step is learning the dynamics of the system via Gaussian process (GP) regression and obtaining probabilistic errors for this estimate. Then, we develop an algorithm for constructing piecewise stochastic barrier functions to find a maximal permissible strategy set using the learned GP model, which is based on sequentially prun…

Dynamical and Static Structure Factors in Hedgehog-Antihedgehog Order in Icosahedral 1/1 Approximant Crystal
Shinji Watanabe
https://arxiv.org/abs/2405.03968

Dynamical and Static Structure Factors in Hedgehog-Antihedgehog Order in Icosahedral 1/1 Approximant Crystal
Recent discoveries of magnetic long-range orders in the icosahedral quasicrystal and topological magnetic structures on the icosahedron (IC) as the hedgehog state and the antihedgehog state have attracted great interest. Here, we report our theoretical analysis of the dynamical as well as static structure of the hedgehog-antihedgehog order in the 1/1 approximant crystal (AC). By constructing the effective magnetic model for the rare-earth based AC, on the basis of the linear spin-wave theory, t…

This https://arxiv.org/abs/2307.10560 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Post-variational quantum neural networks
Hybrid quantum-classical computing in the noisy intermediate-scale quantum (NISQ) era with variational algorithms can exhibit barren plateau issues, causing difficult convergence of gradient-based optimization techniques. In this paper, we discuss "post-variational strategies", which shift tunable parameters from the quantum computer to the classical computer, opting for ensemble strategies when optimizing quantum models. We discuss various strategies and design principles for constructing indi…

This https://arxiv.org/abs/2306.09443 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Free curves, Eigenschemes and Pencils of curves
Let $R=K[x,y,z]$. A reduced plane curve $C=V(f)\subset \mathbf P^2$ is $free \ $ if its associated module of tangent derivations $\mathrm{Der}(f)$ is a free $R$-module, or equivalently if the corresponding sheaf $T_ {\mathbf P^2 }(-\log C)$ of vector fields tangent to $C$ splits as a direct sum of line bundles on $\mathbf P^2$. In general, free curves are difficult to find, and in this note, we describe a new method for constructing free curves in $\mathbf P^2$. The key tools in our approach ar…

Normed modules and the categorization of Lebesgue integration
Yu-Zhe Liu, Shengda Liu, Zhaoyong Huang, Panyue Zhou
https://arxiv.org/abs/2405.02777 https:/…

Normed modules and the categorization of Lebesgue integration
We explore the assignment of norms to $Λ$-modules over a finite-dimensional algebra $Λ$, resulting in the establishment of normed $Λ$-modules. Our primary contribution lies in constructing a new category $\mathscr{N}\!\!or^p$ related to normed modules along with its full subcategory $\mathscr{A}^p$. By examining the objects and morphisms in these categories, we establish a framework for understanding the categorization of Lebesgue integration.

Uniform-in-time estimates for mean-field type SDEs and applications
Jianhai Bao, Jiaqing Hao
https://arxiv.org/abs/2405.04047 https://

Uniform-in-time estimates for mean-field type SDEs and applications
Via constructing an asymptotic coupling by reflection, in this paper we establish uniform-in-time estimates on probability distances for mean-field type SDEs, where the drift terms under consideration are dissipative merely in the long distance. As applications, we (i) explore the long time probability distance estimate between an SDE and its delay version; (ii) investigate the issue on uniform-in-time propagation of chaos for McKean-Vlasov SDEs, where the drifts might be singular with respect …

This https://arxiv.org/abs/2402.11445 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Balanced Truncation of Linear Systems with Quadratic Outputs in Limited Time and Frequency Intervals
Model order reduction involves constructing a reduced-order approximation of a high-order model while retaining its essential characteristics. This reduced-order model serves as a substitute for the original one in various applications such as simulation, analysis, and design. Often, there's a need to maintain high accuracy within a specific time or frequency interval, while errors beyond this limit can be tolerated. This paper addresses time-limited and frequency-limited model order reduction …

This https://arxiv.org/abs/2402.19282 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

WanJuan-CC: A Safe and High-Quality Open-sourced English Webtext Dataset
This paper presents WanJuan-CC, a safe and high-quality open-sourced English webtext dataset derived from Common Crawl data. The study addresses the challenges of constructing large-scale pre-training datasets for language models, which require vast amounts of high-quality data. A comprehensive process was designed to handle Common Crawl data, including extraction, heuristic rule filtering, fuzzy deduplication, content safety filtering, and data quality filtering. From approximately 68 billion …

Eternal Universes
Damien A. Easson, Joseph E. Lesnefsky
https://arxiv.org/abs/2404.03016 https://arxiv.org/pdf/2404.03016

Eternal Universes
We consider the possibility of a past and future eternal universe, constructing geodesically complete inflating, loitering, and bouncing spacetimes. We identify the constraints energy conditions in General Relativity place on the building of eternal cosmological models. Inflationary and bouncing behavior are shown to be essential ingredients in all significant examples. Non-trivial complete spacetimes are shown to violate the null energy condition (NEC) for at least some amount of time, althoug…

This https://arxiv.org/abs/2305.12378 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Neutrino Mass Matrix in Neutrino-Related Processes
Techniques are developed for constructing amplitudes of neutrino-related processes in terms of the neutrino mass matrix, with no reference to the neutrino mixing matrix. The amplitudes of neutrino oscillations in vacuum and medium, quasi-elastic neutrino scattering, $β$ decays and double-$β$ decays are considered. The proposed approach makes extensive use of Frobenius covariants within the framework of Sylvester's theorem on matrix functions. The in-medium dispersion laws are found in terms o…

Purposeful remixing with generative AI: Constructing designer voice in multimodal composing
Xiao Tan, Wei Xu, Chaoran Wang
https://arxiv.org/abs/2403.19095

Purposeful remixing with generative AI: Constructing designer voice in multimodal composing
Voice, the discursive construction of the writer's identity, has been extensively studied and theorized in composition studies. In multimodal writing, students are able to mobilize both linguistic and non linguistic resources to express their real or imagined identities. But at the same time, when students are limited to choose from available online resources, their voices might be compromised due to the incompatibility between their authorial intentions and the existing materials. This study, …

This https://arxiv.org/abs/2311.02771 has been replaced.
link: https://scholar.google.com/scholar?q=a

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensional RS-codes, it is known [CST23] that an $[n,2]_q$ RS-code that can correct from $n-3$ insdel errors satisfies that $q=Ω(n^3)$. On the other hand, there are several known constructions of $[n,2]_q$ RS-codes that can correct from $n-3$ insdel errors, where the smallest field size is $q=O(n^4)$. In this short paper, we …

This https://arxiv.org/abs/2404.03295 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

The power of a single Haar random state: constructing and separating quantum pseudorandomness
In this work, we focus on the following question: what are the cryptographic implications of having access to an oracle that provides a single Haar random quantum state? We show, perhaps surprisingly, that such an oracle is sufficient to construct quantum pseudorandomness. Pseudorandom states (PRS) are a family of states for which it is hard to distinguish between polynomially many copies of either a state sampled uniformly from the family or a Haar random state. A weaker notion, called singl…

Military intelligence: Russia's railway to Crimea is 'important target' for Ukraine: https://benborges.xyz/2024/03/21/military-intelligence-russias.html

This https://arxiv.org/abs/2402.03408 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Survey on Effective Invocation Methods of Massive LLM Services
Language models as a service (LMaaS) enable users to accomplish tasks without requiring specialized knowledge, simply by paying a service provider. However, numerous providers offer massive large language model (LLM) services with variations in latency, performance, and pricing. Consequently, constructing the cost-saving LLM services invocation strategy with low-latency and high-performance responses that meet specific task demands becomes a pressing challenge. This paper provides a comprehensi…

Constructing Bayesian Optimal Designs for Discrete Choice Experiments by Simulated Annealing
Yicheng Mao, Roselinde Kessels, Tom van der Zanden
https://arxiv.org/abs/2402.18533

Constructing Bayesian Optimal Designs for Discrete Choice Experiments by Simulated Annealing
Discrete Choice Experiments (DCEs) investigate the attributes that influence individuals' choices when selecting among various options. To enhance the quality of the estimated choice models, researchers opt for Bayesian optimal designs that utilize existing information about the attributes' preferences. Given the nonlinear nature of choice models, the construction of an appropriate design requires efficient algorithms. Among these, the Coordinate-Exchange (CE) algorithm is most commonly employe…

Data-Driven Permissible Safe Control with Barrier Certificates
Rayan Mazouz, John Skovbekk, Frederik Baymler Mathiesen, Eric Frew, Luca Laurenti, Morteza Lahijanian
https://arxiv.org/abs/2405.00136

Data-Driven Permissible Safe Control with Barrier Certificates
This paper introduces a method of identifying a maximal set of safe strategies from data for stochastic systems with unknown dynamics using barrier certificates. The first step is learning the dynamics of the system via Gaussian process (GP) regression and obtaining probabilistic errors for this estimate. Then, we develop an algorithm for constructing piecewise stochastic barrier functions to find a maximal permissible strategy set using the learned GP model, which is based on sequentially prun…

A method of constructing pairwise balanced designs containing parallel classes
Douglas R. Stinson
https://arxiv.org/abs/2403.17602 https://

A method of constructing pairwise balanced designs containing parallel classes
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD. However, after constructing such a PBD, it might be the case that we then want to identify a parallel class of blocks. In this short note, we explore some possible ways of doing this.

This https://arxiv.org/abs/2402.19282 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

WanJuan-CC: A Safe and High-Quality Open-sourced English Webtext Dataset
This paper presents WanJuan-CC, a safe and high-quality open-sourced English webtext dataset derived from Common Crawl data. The study addresses the challenges of constructing large-scale pre-training datasets for language models, which require vast amounts of high-quality data. A comprehensive process was designed to handle Common Crawl data, including extraction, heuristic rule filtering, fuzzy deduplication, content safety filtering, and data quality filtering. From approximately 68 billion …

This https://arxiv.org/abs/2404.00762 has been replaced.
link: https://scholar.google.com/scholar?q=a

Enchanting Program Specification Synthesis by Large Language Models using Static Analysis and Program Verification
Formal verification provides a rigorous and systematic approach to ensure the correctness and reliability of software systems. Yet, constructing specifications for the full proof relies on domain expertise and non-trivial manpower. In view of such needs, an automated approach for specification synthesis is desired. While existing automated approaches are limited in their versatility, i.e., they either focus only on synthesizing loop invariants for numerical programs, or are tailored for specifi…

This https://arxiv.org/abs/2402.01558 has been replaced.
link: https://scholar.google.com/scholar?q=a

Confinement in the Transverse Field Ising model on the Heavy Hex lattice
We study the emergence of confinement in the transverse field Ising model on a decorated hexagonal lattice. Using an infinite tensor network state optimised with belief propagation we show how a quench from a broken symmetry state leads to striking nonthermal behaviour underpinned by persistent oscillations and saturation of the entanglement entropy. We explain this phenomenon by constructing a minimal model based on the confinement of elementary excitations, which take the form of various flav…