Tootfinder

https://dinfuehr.github.io/blog/encoding-of-immediate-values-on-aarch64/ - Encoding of immediate values on AArch64.

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

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accom…

One Code Fits All: Strong stuck-at codes for versatile memory encoding
Roni Con, Ryan Gabrys, Eitan Yaakobi
https://arxiv.org/abs/2403.19061 https://

One Code Fits All: Strong stuck-at codes for versatile memory encoding
In this work we consider a generalization of the well-studied problem of coding for ``stuck-at'' errors, which we refer to as ``strong stuck-at'' codes. In the traditional framework of stuck-at codes, the task involves encoding a message into a one-dimensional binary vector. However, a certain number of the bits in this vector are 'frozen', meaning they are fixed at a predetermined value and cannot be altered by the encoder. The decoder, aware of the proportion of frozen bits but not their spec…

At Goodwill yesterday, scored a USB-C *36800mAh* power bank with 1.5W solar charging, 2x USB-A 3.1A outputs, waterproof (?), flashlight. 2023 model, brand new, unopened package. Paid just $2.25 (after discount on the already low price of $2.99).
Sells on Amazon for $19 (regularly $30 but who would pay that much?). Gets good reviews.
https://

Interesting blog post about using fractional GPUs with #Bottlerocket to speed up ready times for video encoding/transcoding work loads.
https://

Delivering video content with fractional GPUs in containers on Amazon EKS | Amazon Web Services
Video encoding and transcoding are critical workloads for media and entertainment companies. Delivering high-quality video content to viewers across devices and networks needs efficient and scalable encoding infrastructure. As video resolutions continue to increase to 4K and 8K, GPU acceleration is essential to real-time encoding workflows where parallel encoding tasks are necessary. Although encoding on […]

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

Structure-informed Positional Encoding for Music Generation
Music generated by deep learning methods often suffers from a lack of coherence and long-term organization. Yet, multi-scale hierarchical structure is a distinctive feature of music signals. To leverage this information, we propose a structure-informed positional encoding framework for music generation with Transformers. We design three variants in terms of absolute, relative and non-stationary positional information. We comprehensively test them on two symbolic music generation tasks: next-tim…

A Path Towards Legal Autonomy: An interoperable and explainable approach to extracting, transforming, loading and computing legal information using large language models, expert systems and Bayesian networks
Axel Constant, Hannes Westermann, Bryan Wilson, Alex Kiefer, Ines Hipolito, Sylvain Pronovost, Steven Swanson, Mahault Albarracin, Maxwell J. D. Ramstead

A Path Towards Legal Autonomy: An interoperable and explainable approach to extracting, transforming, loading and computing legal information using large language models, expert systems and Bayesian networks
Legal autonomy - the lawful activity of artificial intelligence agents - can be achieved in one of two ways. It can be achieved either by imposing constraints on AI actors such as developers, deployers and users, and on AI resources such as data, or by imposing constraints on the range and scope of the impact that AI agents can have on the environment. The latter approach involves encoding extant rules concerning AI driven devices into the software of AI agents controlling those devices (e.g., …

Metronome: tracing variation in poetic meters via local sequence alignment
Ben Nagy, Artjoms \v{S}e\c{l}a, Mirella De Sisto, Petr Plech\'a\v{c}
https://arxiv.org/abs/2404.17337

Metronome: tracing variation in poetic meters via local sequence alignment
All poetic forms come from somewhere. Prosodic templates can be copied for generations, altered by individuals, imported from foreign traditions, or fundamentally changed under the pressures of language evolution. Yet these relationships are notoriously difficult to trace across languages and times. This paper introduces an unsupervised method for detecting structural similarities in poems using local sequence alignment. The method relies on encoding poetic texts as strings of prosodic features…

Ambisonics Encoding For Arbitrary Microphone Arrays Incorporating Residual Channels For Binaural Reproduction
Yhonatan Gayer, Vladimir Tourbabin, Zamir Ben-Hur, Jacob Donley, Boaz Rafaely
https://arxiv.org/abs/2402.17362

Ambisonics Encoding For Arbitrary Microphone Arrays Incorporating Residual Channels For Binaural Reproduction
In the rapidly evolving fields of virtual and augmented reality, accurate spatial audio capture and reproduction are essential. For these applications, Ambisonics has emerged as a standard format. However, existing methods for encoding Ambisonics signals from arbitrary microphone arrays face challenges, such as errors due to the irregular array configurations and limited spatial resolution resulting from a typically small number of microphones. To address these limitations and challenges, a mat…

Corra: Correlation-Aware Column Compression
Hanwen Liu, Mihail Stoian, Alexander van Renen, Andreas Kipf
https://arxiv.org/abs/2403.17229 https://

Corra: Correlation-Aware Column Compression
Column encoding schemes have witnessed a spark of interest lately. This is not surprising -- as data volume increases, being able to keep one's dataset in main memory for fast processing is a coveted desideratum. However, it also seems that single-column encoding schemes have reached a plateau in terms of the compression size they can achieve. We argue that this is because they do not exploit correlations in the data. Consider for instance the column pair ($\texttt{city}$, $\texttt{zip-code}$…

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

Schur line defect correlators and giant graviton expansion
We consider Schur line defect correlators in four dimensional $\mathcal N=4$ $U(N)$ SYM and their giant graviton expansion encoding finite $N$ corrections to the large $N$ limit. We compute in closed form the single giant graviton contribution to correlators with general insertions of $\frac{1}{2}$-BPS charged Wilson lines. For the 2-point function with fundamental and anti-fundamental Wilson lines, we match the result from fluctuations of two half-infinite strings ending on the giant graviton,…

Nonsmooth, Nonconvex Optimization Using Functional Encoding and Component Transition Information
Fengqiao Luo
https://arxiv.org/abs/2404.16273 https://

Nonsmooth, Nonconvex Optimization Using Functional Encoding and Component Transition Information
We have developed novel algorithms for optimizing nonsmooth, nonconvex functions in which the nonsmoothness is caused by nonsmooth operators presented in the analytical form of the objective. The algorithms are based on encoding the active branch of each nonsmooth operator such that the active smooth component function and its code can be extracted at any given point, and the transition of the solution from one smooth piece to another can be detected via tracking the change of active branches o…

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

A unified effective approach to cosmological perturbations
A generalization of the momentum effective sound speed (MESS) is introduced to formulate a unified model independent effective approach for cosmological perturbations in terms of a quantity playing the role of effective speed, encoding the effects of the interaction among metric perturbations or with other fields, and inducing a modification of the friction term of the perturbations equation. This effective speed is conceptually equivalent to the modification of the speed of electromagnetic wav…

Schwarz Modular Operads Revisited: $\mathcal{SM}=\mathcal{S}\circ\mathcal{M}$
Ralph M. Kaufmann, Benjamin C. Ward
https://arxiv.org/abs/2404.17540 https://…

Schwarz Modular Operads Revisited: $\mathcal{SM}=\mathcal{S}\circ\mathcal{M}$
We prove that the Feynman category encoding Schwarz's variant of modular operads is Koszul. Our proof uses a generalization of the theory of distributive laws to the groupoid colored setting.

One Backpropagation in Two Tower Recommendation Models
Erjia Chen, Bang Wang
https://arxiv.org/abs/2403.18227 https://arxiv.org/pdf/2…

One Backpropagation in Two Tower Recommendation Models
Recent years have witnessed extensive researches on developing two tower recommendation models for relieving information overload. Four building modules can be identified in such models, namely, user-item encoding, negative sampling, loss computing and back-propagation updating. To the best of our knowledge, existing algorithms have researched only on the first three modules, yet neglecting the backpropagation module. They all adopt a kind of two backpropagation strategy, which are based on an …

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Klaus Jansen, Kai Kahler, Esther Zwanger
https://arxiv.org/abs/2404.17274 https://…

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Goemans and Rothvoss (SODA'14) gave a framework for solving problems in time $enc(P)^{2^{O(N)}}enc(Q)^{O(1)}$ that can be described as finding a point in $\text{int.cone}(P\cap\mathbb{Z}^N)\cap Q$, where $P,Q\subset\mathbb{R}^N$ are (bounded) polyhedra. This framework can be used to solve various scheduling problems, but the encoding length $enc(P)$ usually involves large parameters like the makespan. We describe three tools to improve the framework by Goemans and Rothvoss: Problem-specific pre…

Encoding Petri Nets into CCS (Technical Report)
Benjamin Bog{\o}, Andrea Burattin, Alceste Scalas
https://arxiv.org/abs/2404.14385 https://

Encoding Petri Nets into CCS (Technical Report)
This paper explores the problem of determining which classes of Petri nets can be encoded into behaviourally-equivalent CCS processes. Most of the existing related literature focuses on the inverse problem (i.e., encoding process calculi belonging to the CCS family into Petri nets), or extends CCS with Petri net-like multi-synchronisation (Multi-CCS). In this work, our main focus are free-choice and workflow nets (which are widely used in process mining to describe system interactions) and our …

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

Empirical Bayes factors for common hypothesis tests
Bayes factors for composite hypotheses have difficulty in encoding vague prior knowledge, as improper priors cannot be used and objective priors may be subjectively unreasonable. To address these issues I revisit the posterior Bayes factor, in which the posterior distribution from the data at hand is re-used in the Bayes factor for the same data. I argue that this is biased when calibrated against proper Bayes factors, but propose adjustments to allow interpretation on the same scale. In the im…

An Encoding for CLP Problems in SMT-LIB
Daneshvar Amrollahi, Hossein Hojjat, Philipp R\"ummer
https://arxiv.org/abs/2404.14924 https://

An Encoding for CLP Problems in SMT-LIB
The input language for today's CHC solvers are commonly the standard SMT-LIB format, borrowed from SMT solvers, and the Prolog format that stems from Constraint-Logic Programming (CLP). This paper presents a new front-end of the Eldarica CHC solver that allows inputs in the Prolog language. We give a formal translation of a subset of Prolog into the SMT-LIB commands. Our initial experiments show the effectiveness of the approach and the potential benefits to both the CHC solving and CLP communi…

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

Learning protocols for the fast and efficient control of active matter
We show that it is possible to learn protocols that effect fast and efficient state-to-state transformations in simulation models of active particles. By encoding the protocol in the form of a neural network we use evolutionary methods to identify protocols that take active particles from one steady state to another, as quickly as possible or with as little energy expended as possible. Our results show that protocols identified by a flexible neural-network ansatz, which allows the optimization …

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

Tackling Long Code Search with Splitting, Encoding, and Aggregating
Code search with natural language helps us reuse existing code snippets. Thanks to the Transformer-based pretraining models, the performance of code search has been improved significantly. However, due to the quadratic complexity of multi-head self-attention, there is a limit on the input token length. For efficient training on standard GPUs like V100, existing pretrained code models, including GraphCodeBERT, CodeBERT, RoBERTa (code), take the first 256 tokens by default, which makes them unabl…

Tokenization Is More Than Compression
Craig W. Schmidt, Varshini Reddy, Haoran Zhang, Alec Alameddine, Omri Uzan, Yuval Pinter, Chris Tanner
https://arxiv.org/abs/2402.18376

Tokenization Is More Than Compression
Tokenization is a foundational step in Natural Language Processing (NLP) tasks, bridging raw text and language models. Existing tokenization approaches like Byte-Pair Encoding (BPE) originate from the field of data compression, and it has been suggested that the effectiveness of BPE stems from its ability to condense text into a relatively small number of tokens. We test the hypothesis that fewer tokens lead to better downstream performance by introducing PathPiece, a new tokenizer that segment…

Searching Search Spaces: Meta-evolving a Geometric Encoding for Neural Networks
Tarek Kunze, Paul Templier, Dennis G Wilson
https://arxiv.org/abs/2403.14019

Searching Search Spaces: Meta-evolving a Geometric Encoding for Neural Networks
In evolutionary policy search, neural networks are usually represented using a direct mapping: each gene encodes one network weight. Indirect encoding methods, where each gene can encode for multiple weights, shorten the genome to reduce the dimensions of the search space and better exploit permutations and symmetries. The Geometric Encoding for Neural network Evolution (GENE) introduced an indirect encoding where the weight of a connection is computed as the (pseudo-)distance between the two l…

SongComposer: A Large Language Model for Lyric and Melody Composition in Song Generation
Shuangrui Ding, Zihan Liu, Xiaoyi Dong, Pan Zhang, Rui Qian, Conghui He, Dahua Lin, Jiaqi Wang
https://arxiv.org/abs/2402.17645

SongComposer: A Large Language Model for Lyric and Melody Composition in Song Generation
We present SongComposer, an innovative LLM designed for song composition. It could understand and generate melodies and lyrics in symbolic song representations, by leveraging the capability of LLM. Existing music-related LLM treated the music as quantized audio signals, while such implicit encoding leads to inefficient encoding and poor flexibility. In contrast, we resort to symbolic song representation, the mature and efficient way humans designed for music, and enable LLM to explicitly compos…

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

Quantum walk on simplicial complexes for simplicial community detection
Quantum walks have emerged as a transformative paradigm in quantum information processing and can be applied to various graph problems. This study explores discrete-time quantum walks on simplicial complexes, a higher-order generalization of graph structures. Simplicial complexes, encoding higher-order interactions through simplices, offer a richer topological representation of complex systems. Since the conventional classical random walk cannot directly detect community structures, we present …

A Novel Channel Coding Scheme for Digital Multiple Access Computing
Xiaojing Yan, Saeed Razavikia, Carlo Fischione
https://arxiv.org/abs/2404.16476 https:/…

A Novel Channel Coding Scheme for Digital Multiple Access Computing
In this paper, we consider the ChannelComp framework, which facilitates the computation of desired functions by multiple transmitters over a common receiver using digital modulations across a multiple access channel. While ChannelComp currently offers a broad framework for computation by designing digital constellations for over-the-air computation and employing symbol-level encoding, encoding the repeated transmissions of the same symbol and using the corresponding received sequence may signif…

Click-trackers in email "need" to rewrite rewritten links in order to properly determine who clicked it. In longer threads, this gets a bit hilarious.
Here's the final payload at the end of an 18,660-character re-re-re-…-rewrite:
http%25252525252525252525252525252525252525252525252525252525252525253A%25252525252525252525252525252525252525252525252525252525252525252F%25252525252525252525252525252525252525252525252525252525252525252Fwww.example.com%25252525252525252525252525252525252525252525252525252525252525252F
(anonymized)
URI percent encoding uses percents, so : is : and / is /. All of those 25s are from escaped percents; % is %, so unescape(unescape(unescape("%253A"))) gives you :.
That's three layers. The above example has 34 layers.

Event-Triggered Resilient Filtering for 2-D Systems with Asynchronous-Delay: Handling Binary Encoding Decoding with Probabilistic Bit Flips
Yu Chen, Wei Wang
https://arxiv.org/abs/2404.16408

Event-Triggered Resilient Filtering for 2-D Systems with Asynchronous-Delay: Handling Binary Encoding Decoding with Probabilistic Bit Flips
In this paper, the event-triggered resilient filtering problem is investigated for a class of two-dimensional systems with asynchronous-delay under binary encoding-decoding schemes with probabilistic bit flips. To reduce unnecessary communications and computations in complex network systems, alleviate network energy consumption, and optimize the use of network resources, a new event-triggered mechanism is proposed, which focuses on broadcasting necessary measurement information to update innova…

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

Schur line defect correlators and giant graviton expansion
We consider Schur line defect correlators in four dimensional $\mathcal N=4$ $U(N)$ SYM and their giant graviton expansion encoding finite $N$ corrections to the large $N$ limit. We compute in closed form the single giant graviton contribution to correlators with general insertions of $\frac{1}{2}$-BPS charged Wilson lines. For the 2-point function with fundamental and anti-fundamental Wilson lines, we match the result from fluctuations of two half-infinite strings ending on the giant graviton,…

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

An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase encoding and Intensity Detection
The photonic Ising machine is a new paradigm of optical computing that takes advantage of the unique properties of light wave propagation, parallel processing, and low-loss transmission. Thus, the process of solving combinatorial optimization problems can be accelerated through photonic/optoelectronic devices. In this work, we have proposed and demonstrated the Phase Encoding and Intensity Detection Ising Annealer (PEIDIA) capable of solving arbitrary Ising problems on demand. The PEIDIA employ…

Some amusing scenes from #Berlin in the early 2000s, in Sareeta Amrute's "Encoding Race, Encoding Class". So much has changed.

One Backpropagation in Two Tower Recommendation Models
Erjia Chen, Bang Wang
https://arxiv.org/abs/2403.18227 https://arxiv.org/pdf/2…

One Backpropagation in Two Tower Recommendation Models
Recent years have witnessed extensive researches on developing two tower recommendation models for relieving information overload. Four building modules can be identified in such models, namely, user-item encoding, negative sampling, loss computing and back-propagation updating. To the best of our knowledge, existing algorithms have researched only on the first three modules, yet neglecting the backpropagation module. They all adopt a kind of two backpropagation strategy, which are based on an …

Traditional Transformation Theory Guided Model for Learned Image Compression
Zhiyuan Li, Chenyang Ge, Shun Li
https://arxiv.org/abs/2402.15744 https://

Traditional Transformation Theory Guided Model for Learned Image Compression
Recently, many deep image compression methods have been proposed and achieved remarkable performance. However, these methods are dedicated to optimizing the compression performance and speed at medium and high bitrates, while research on ultra low bitrates is limited. In this work, we propose a ultra low bitrates enhanced invertible encoding network guided by traditional transformation theory, experiments show that our codec outperforms existing methods in both compression and reconstruction pe…

Shared Autonomy via Variable Impedance Control and Virtual Potential Fields for Encoding Human Demonstration
Shail Jadav, Johannes Heidersberger, Christian Ott, Dongheui Lee
https://arxiv.org/abs/2403.12720

Shared Autonomy via Variable Impedance Control and Virtual Potential Fields for Encoding Human Demonstration
This article introduces a framework for complex human-robot collaboration tasks, such as the co-manufacturing of furniture. For these tasks, it is essential to encode tasks from human demonstration and reproduce these skills in a compliant and safe manner. Therefore, two key components are addressed in this work: motion generation and shared autonomy. We propose a motion generator based on a time-invariant potential field, capable of encoding wrench profiles, complex and closed-loop trajectorie…

Fantastic illustration of a character encoding problem /from http://www.unicode.org/wg2/docs/n4796-CJKComplexSymbol.pdf /via @…

Atomistic Descriptor Optimization Using Complementary Euclidean and Geodesic Distance Information
Gopal R. Iyer, Brenda M. Rubenstein
https://arxiv.org/abs/2403.18090

Atomistic Descriptor Optimization Using Complementary Euclidean and Geodesic Distance Information
Descriptors are physically-inspired schemes for representing atomistic systems that play a central role in the construction of models of potential energy surfaces. Although physical intuition can be flexibly encoded into descriptor schemes, they are generally ultimately guided only by the spatial or topological arrangement of atoms in the system. Here, we propose a novel approach for the optimization of descriptors based on encoding information about geodesic distances along potential energy ma…

Energy-efficient Adaptive Video Streaming with Latency-Aware Dynamic Resolution Encoding
Vignesh V Menon, Amritha Premkumar, Prajit T Rajendran, Adam Wieckowski, Benjamin Bross, Christian Timmerer, Detlev Marpe
https://arXiv.org/abs/2401.15346 https://arXiv.org/pdf/2401.15346
Traditional per-title encoding schemes aim to optimize encoding resolutions to deliver the highest perceptual quality for each representation. However, keeping the encoding time within an acceptable threshold for a smooth user experience is important to reduce the carbon footprint and energy consumption on encoding servers in video streaming applications. Toward this realization, we introduce an encoding latency-a ware dynamic resolution encoding scheme (LADRE) for adaptive video streaming applications. LADRE determines the encoding resolution for each target bitrate by utilizing a random forest-based prediction model for every video segment based on spatiotemporal features and the acceptable target latency. Experimental results show that LADRE achieves an overall average quality improvement of 0.58 dB PSNR and 0.43 dB XPSNR while maintaining the same bitrate, compared to the HTTP Live Streaming (HLS) bitrate ladder encoding of 200 s segments using the VVenC encoder, when the encoding latency for each representation is set to remain below the 200 s threshold. This is accompanied by an 84.17 % reduction in overall encoding energy consumption.

A Facebook post indicates that Google Gemini does not quite get the distinction between soundscapes that encode 2D images (for blind people) and ambient soundscapes with natural sounds https://www.facebook.com/seeingwithsound/p

Flux Quantization
Hisham Sati, Urs Schreiber
https://arxiv.org/abs/2402.18473 https://arxiv.org/pdf/2402.18473

Flux Quantization
Flux- and charge-quantization laws for higher gauge fields of Maxwell type -- e.g. the common electromagnetic field (the "A-field") but also the B-, RR-, and C-fields considered in string/M-theory -- specify non-perturbative completions of these fields by encoding their solitonic behaviour and hence by specifying the discrete charges carried by the individual branes (higher-dimensional monopoles or solitons) that source the field fluxes. This article surveys the general (rational-)homotopy th…

On the Existence of Cyclic Lattice Codes
Chengpin Luo, Brian M. Kurkoski
https://arxiv.org/abs/2402.18094 https://arxiv.org/pdf/2402.…

On the Existence of Cyclic Lattice Codes
A coding lattice $Λ_c$ and a shaping lattice $Λ_s$ forms a nested lattice code $\mathcal{C}$ if $Λ_s \subseteq Λ_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This paper presents the conditions for the existence of such $\mathcal{C}$ and provides some designs. These designs correspond to solutions to linear Diophantine equations so that a cyclic lattice code $\mathcal C$ of arbitrary codebook size $M$ can possess group isomorphism, which i…

Cross-Modal Generative Semantic Communications for Mobile AIGC: Joint Semantic Encoding and Prompt Engineering
Yinqiu Liu, Hongyang Du, Dusit Niyato, Jiawen Kang, Zehui Xiong, Shiwen Mao, Ping Zhang, Xuemin Shen
https://arxiv.org/abs/2404.13898

Cross-Modal Generative Semantic Communications for Mobile AIGC: Joint Semantic Encoding and Prompt Engineering
Employing massive Mobile AI-Generated Content (AIGC) Service Providers (MASPs) with powerful models, high-quality AIGC services can become accessible for resource-constrained end users. However, this advancement, referred to as mobile AIGC, also introduces a significant challenge: users should download large AIGC outputs from the MASPs, leading to substantial bandwidth consumption and potential transmission failures. In this paper, we apply cross-modal Generative Semantic Communications (G-SemC…

A Novel Channel Coding Scheme for Digital Multiple Access Computing
Xiaojing Yan, Saeed Razavikia, Carlo Fischione
https://arxiv.org/abs/2404.16476 https:/…

A Novel Channel Coding Scheme for Digital Multiple Access Computing
In this paper, we consider the ChannelComp framework, which facilitates the computation of desired functions by multiple transmitters over a common receiver using digital modulations across a multiple access channel. While ChannelComp currently offers a broad framework for computation by designing digital constellations for over-the-air computation and employing symbol-level encoding, encoding the repeated transmissions of the same symbol and using the corresponding received sequence may signif…

On the complexity and approximability of Bounded access Lempel Ziv coding
Ferdinando Cicalese, Francesca Ugazio
https://arxiv.org/abs/2403.15871 https://…

On the complexity and approximability of Bounded access Lempel Ziv coding
We study the complexity of constructing an optimal parsing $φ$ of a string ${\bf s} = s_1 \dots s_n$ under the constraint that given a position $p$ in the original text, and the LZ76-like (Lempel Ziv 76) encoding of $T$ based on $φ$, it is possible to identify/decompress the character $s_p$ by performing at most $c$ accesses to the LZ encoding, for a given integer $c.$ We refer to such a parsing $φ$ as a $c$-bounded access LZ parsing or $c$-BLZ parsing of ${\bf s}.$ We show that for any cons…

Information encoding and decoding in in-vitro neural networks on micro electrode arrays through stimulation timing
Trym A. E. Lindell, Ola H. Ramstad, Ionna Sandvig, Axel Sandvig, Stefano Nichele
https://arxiv.org/abs/2404.10946

Information encoding and decoding in in-vitro neural networks on micro electrode arrays through stimulation timing
A primary challenge in utilizing in-vitro biological neural networks for computations is finding good encoding and decoding schemes for inputting and decoding data to and from the networks. Furthermore, identifying the optimal parameter settings for a given combination of encoding and decoding schemes adds additional complexity to this challenge. In this study we explore stimulation timing as an encoding method, i.e. we encode information as the delay between stimulation pulses and identify the…

https://kbd.news/A-brief-history-of-keyboard-encoding-2199.html - A brief history of keyboard encoding.

🏃‍♂️ More than the SRY: The Non-Coding Landscape of the Y Chromosome and Its Importance in Human Disease
#dna

More than the SRY: The Non-Coding Landscape of the Y Chromosome and Its Importance in Human Disease
Historically, the Y chromosome has presented challenges to classical methodology and philosophy of understanding the differences between males and females. A genetic unsolved puzzle, the Y chromosome was the last chromosome to be fully sequenced. With the advent of the Human Genome Project came a realization that the human genome is more than just genes encoding proteins, and an entire universe of RNA was discovered. This dark matter of biology and the black box surrounding the Y chromosome hav…

Laplace-HDC: Understanding the geometry of binary hyperdimensional computing
Saeid Pourmand, Wyatt D. Whiting, Alireza Aghasi, Nicholas F. Marshall
https://arxiv.org/abs/2404.10759

Laplace-HDC: Understanding the geometry of binary hyperdimensional computing
This paper studies the geometry of binary hyperdimensional computing (HDC), a computational scheme in which data are encoded using high-dimensional binary vectors. We establish a result about the similarity structure induced by the HDC binding operator and show that the Laplace kernel naturally arises in this setting, motivating our new encoding method Laplace-HDC, which improves upon previous methods. We describe how our results indicate limitations of binary HDC in encoding spatial informatio…

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

Resource-Efficient Real-Time Polarization Compensation for MDI-QKD with Rejected Data
Measurement-device-independent quantum key distribution (MDI-QKD) closes all the security loopholes in the detection system and is a promising solution for secret key sharing. Polarization encoding is the most common QKD encoding scheme, as it is straightforward to prepare and measure. However, implementing polarization encoding in MDI QKD imposes extra challenges, as polarization alignment must be maintained over both mutually unbiased bases and be maintained for both paths (Alice-Charlie and …

Exploratory Landscape Analysis for Mixed-Variable Problems
Raphael Patrick Prager, Heike Trautmann
https://arxiv.org/abs/2402.16467 https://arxiv.org/pdf/2402.16467
arXiv:2402.16467v1 Announce Type: new
Abstract: Exploratory landscape analysis and fitness landscape analysis in general have been pivotal in facilitating problem understanding, algorithm design and endeavors such as automated algorithm selection and configuration. These techniques have largely been limited to search spaces of a single domain. In this work, we provide the means to compute exploratory landscape features for mixed-variable problems where the decision space is a mixture of continuous, binary, integer, and categorical variables. This is achieved by utilizing existing encoding techniques originating from machine learning. We provide a comprehensive juxtaposition of the results based on these different techniques. To further highlight their merit for practical applications, we design and conduct an automated algorithm selection study based on a hyperparameter optimization benchmark suite. We derive a meaningful compartmentalization of these benchmark problems by clustering based on the used landscape features. The identified clusters mimic the behavior the used algorithms exhibit. Meaning, the different clusters have different best performing algorithms. Finally, our trained algorithm selector is able to close the gap between the single best and the virtual best solver by 57.5% over all benchmark problems.

Apple Mail doesn't support the auto-unsubscribe links provided by Sendgrid clients.
This is because Sendgrid has chosen to Q-encode (RFC 2047) the List-Unsubscribe: header, but since the header (RFC 2369) isn't defined using BNF, none of the criteria for encoding are met. So it's either fine, or it isn’t. Implementor’s choice.
Standards!

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

An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian
We present an efficient quantum circuit for block encoding pairing Hamiltonians studied in nuclear physics. The new block encoding scheme does not require mapping the creation and annihilation operators to Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode these operators directly using controlled swaps. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number o…

Encoding of linear kinetic plasma problems in quantum circuits via data compression
Ivan Novikau, Ilya Y. Dodin, Edward A. Startsev
https://arxiv.org/abs/2403.11989

Encoding of linear kinetic plasma problems in quantum circuits via data compression
We propose an algorithm for encoding of linear kinetic plasma problems in quantum circuits. The focus is made on modeling electrostatic linear waves in one-dimensional Maxwellian electron plasma. The waves are described by the linearized Vlasov-Ampère system with a spatially localized external current that drives plasma oscillations. This system is formulated as a boundary-value problem and cast in the form of a linear vector equation $Aψ= b$ to be solved by using the quantum signal processin…

Semantic Communication-Enabled Wireless Adaptive Panoramic Video Transmission
Haixiao Gao, Mengying Sun, Xiaodong Xu, Shujun Han
https://arxiv.org/abs/2402.16581

Semantic Communication-Enabled Wireless Adaptive Panoramic Video Transmission
In this paper, we propose an adaptive panoramic video semantic transmission (APVST) network built on the deep joint source-channel coding (Deep JSCC) structure for the efficient end-to-end transmission of panoramic videos. The proposed APVST network can adaptively extract semantic features of panoramic frames and achieve semantic feature encoding. To achieve high spectral efficiency and save bandwidth, we propose a transmission rate control mechanism for the APVST via the entropy model and the …

A newline in character encoding can be defined as CR and LF combined into one (commonly called CR LF or CRLF).

History becomes encoded. But what a carriage return and line feed looks like will be mostly lost in time.

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

A Robust Study of High-Redshift Galaxies: Unsupervised Machine Learning for Characterising morphology with JWST up to z ~ 8
Galaxy morphologies provide valuable insights into their formation processes, tracing the spatial distribution of ongoing star formation and encoding signatures of dynamical interactions. While such information has been extensively investigated at low redshift, it is crucial to develop a robust system for characterising galaxy morphologies at earlier cosmic epochs. Relying solely on the nomenclature established for low-redshift galaxies risks introducing biases that hinder our understanding of …

Tropicalization of curve arrangement complements and arroids
Edvard Aksnes
https://arxiv.org/abs/2404.14380 https://arxiv.org/pdf/240…

Tropicalization of curve arrangement complements and arroids
We define arroids as an abstract axiom set encoding the intersection properties of arrangements of curves. The tropicalization of the complement of arrangement of curves meeting pairwise transversely is shown to be determined by the associated arroid. We give conditions for when the cohomology of the complement of an arrangement is computable using tropical cohomology, and we give criteria for when the complement is a maximal variety in terms of tropical geometry.

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

Fuzzy Gauge Theory for Quantum Computers
Continuous gauge theories, because of their bosonic degrees of freedom, have an infinite-dimensional local Hilbert space. Encoding these degrees of freedom on qubit-based hardware demands some sort of ``qubitization'' scheme, where one approximates the behavior of a theory while using only finitely many degrees of freedom. We propose a novel qubitization strategy for gauge theories, called ``fuzzy gauge theory,'' building on the success of the fuzzy $σ$-model in earlier work. We provide argume…

Energy-efficient Adaptive Video Streaming with Latency-Aware Dynamic Resolution Encoding
Vignesh V Menon, Amritha Premkumar, Prajit T Rajendran, Adam Wieckowski, Benjamin Bross, Christian Timmerer, Detlev Marpe
https://arXiv.org/abs/2401.15346 https://arXiv.org/pdf/2401.15346
Traditional per-title encoding schemes aim to optimize encoding resolutions to deliver the highest perceptual quality for each representation. However, keeping the encoding time within an acceptable threshold for a smooth user experience is important to reduce the carbon footprint and energy consumption on encoding servers in video streaming applications. Toward this realization, we introduce an encoding latency-a ware dynamic resolution encoding scheme (LADRE) for adaptive video streaming applications. LADRE determines the encoding resolution for each target bitrate by utilizing a random forest-based prediction model for every video segment based on spatiotemporal features and the acceptable target latency. Experimental results show that LADRE achieves an overall average quality improvement of 0.58 dB PSNR and 0.43 dB XPSNR while maintaining the same bitrate, compared to the HTTP Live Streaming (HLS) bitrate ladder encoding of 200 s segments using the VVenC encoder, when the encoding latency for each representation is set to remain below the 200 s threshold. This is accompanied by an 84.17 % reduction in overall encoding energy consumption.

Spanning Matrices via Satisfiability Solving
Clemens Eisenhofer, Michael Rawson, Laura Kov\'acs
https://arxiv.org/abs/2402.10610 https://

Spanning Matrices via Satisfiability Solving
We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour of matrices, as we show that tree-like calculi have a number of drawbacks in the context of satisfiability solving. The matrix setting permits numerous global refinements of the basic connection calculus. We also show that a suitably-refined calculus is a decision procedure for the Bernays-Schönfinkel class.

A quantum algorithm for the Kalman filter using block encoding
Hao Shi, Guofeng Zhang, Ming Zhang
https://arxiv.org/abs/2404.04554 https://

A quantum algorithm for the Kalman filter using block encoding
Quantum algorithms offer significant speed-ups over their classical counterparts in various applications. In this paper, we develop quantum algorithms for the Kalman filter widely used in classical control engineering using the block encoding method. The entire calculation process is achieved by performing matrix operations on Hamiltonians based on the block encoding framework, including addition, multiplication, and inversion, which can be completed in a unified framework compared to previous …

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

SEINE: Structure Encoding and Interaction Network for Nuclei Instance Segmentation
Nuclei instance segmentation in histopathological images is of great importance for biological analysis and cancer diagnosis but remains challenging for two reasons. (1) Similar visual presentation of intranuclear and extranuclear regions of chromophobe nuclei often causes under-segmentation, and (2) current methods lack the exploration of nuclei structure, resulting in fragmented instance predictions. To address these problems, this paper proposes a structure encoding and interaction network, …

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

Explicit arithmetic Eisenstein cocycles: the toric case
We construct cocycles for $GL_n(\mathbb{Q})$ valued in cup products of units on the $n$-dimensional algebraic torus $\mathbb{G}_m^n$ over an arbitrary DVR, viewed in Milnor $K$-theory or motivic cohomology. We show how various combinatorially-defined complexes encoding linear algebraic data capture the structure of these cup products inside motivic complexes, and examine some properties of the resulting classes. This generalizes work of Sharifi and Venkatesh in the case $n=2$, in which case pul…

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

Sandi: A System for Accountability and Applications in Direct Communication
We construct a system, Sandi, to bring trust in online communication through accountability. Sandi is based on a unique "somewhat monotone" accountability score, with strong privacy and security properties. A registered sender can request from Sandi a cryptographic tag encoding its score. The score measures the sender's trustworthiness based on its previous communications. The tag is sent to a receiver with whom the sender wants to initiate a conversation and signals the sender's "endorsement" …

EulerFormer: Sequential User Behavior Modeling with Complex Vector Attention
Zhen Tian, Wayne Xin Zhao, Changwang Zhang, Xin Zhao, Zhongrui Ma, Ji-Rong Wen
https://arxiv.org/abs/2403.17729

EulerFormer: Sequential User Behavior Modeling with Complex Vector Attention
To capture user preference, transformer models have been widely applied to model sequential user behavior data. The core of transformer architecture lies in the self-attention mechanism, which computes the pairwise attention scores in a sequence. Due to the permutation-equivariant nature, positional encoding is used to enhance the attention between token representations. In this setting, the pairwise attention scores can be derived by both semantic difference and positional difference. However,…

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

Towards large-scale quantum optimization solvers with few qubits
We introduce a variational quantum solver for combinatorial optimizations over $m=\mathcal{O}(n^k)$ binary variables using only $n$ qubits, with tunable $k>1$. The number of parameters and circuit depth display mild linear and sublinear scalings in $m$, respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. This leads to unprecedented quantum-solver performances. For $m=7000$, num…

Learning Dynamical Systems Encoding Non-Linearity within Space Curvature
Bernardo Fichera, Aude Billard
https://arxiv.org/abs/2403.11948 https://

Learning Dynamical Systems Encoding Non-Linearity within Space Curvature
Dynamical Systems (DS) are an effective and powerful means of shaping high-level policies for robotics control. They provide robust and reactive control while ensuring the stability of the driving vector field. The increasing complexity of real-world scenarios necessitates DS with a higher degree of non-linearity, along with the ability to adapt to potential changes in environmental conditions, such as obstacles. Current learning strategies for DSs often involve a trade-off, sacrificing either …

🏃‍♂️ More than the SRY: The Non-Coding Landscape of the Y Chromosome and Its Importance in Human Disease
#dna

More than the SRY: The Non-Coding Landscape of the Y Chromosome and Its Importance in Human Disease
Historically, the Y chromosome has presented challenges to classical methodology and philosophy of understanding the differences between males and females. A genetic unsolved puzzle, the Y chromosome was the last chromosome to be fully sequenced. With the advent of the Human Genome Project came a realization that the human genome is more than just genes encoding proteins, and an entire universe of RNA was discovered. This dark matter of biology and the black box surrounding the Y chromosome hav…

Exploring the Dynamics of Data Transmission in 5G Networks: A Conceptual Analysis
Nikita Smirnov, Sven Tomforde
https://arxiv.org/abs/2404.16508 https://…

Exploring the Dynamics of Data Transmission in 5G Networks: A Conceptual Analysis
This conceptual analysis examines the dynamics of data transmission in 5G networks. It addresses various aspects of sending data from cameras and LiDARs installed on a remote-controlled ferry to a land-based control center. The range of topics includes all stages of video and LiDAR data processing from acquisition and encoding to final decoding, all aspects of their transmission and reception via the WebRTC protocol, and all possible types of network problems such as handovers or congestion tha…

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

Low-power SNN-based audio source localisation using a Hilbert Transform spike encoding scheme
Sound source localisation is used in many consumer electronics devices, to help isolate audio from individual speakers and to reject noise. Localization is frequently accomplished by "beamforming" algorithms, which combine microphone audio streams to improve received signal power from particular incident source directions. Beamforming algorithms generally use knowledge of the frequency components of the audio source, along with the known microphone array geometry, to analytically phase-shift mi…

Network Learning with Directional Sign Patterns
Anqi Dong, Can Chen, Tryphon T. Georgiou
https://arxiv.org/abs/2403.14915 https://arx…

Network Learning with Directional Sign Patterns
Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g., promotion/inhibition in gene regulatory networks, or encoding political of friendship differences in social networks. However, it is often the case that only an aggregate consequence of such edge weights that characterize relations may be directly observable, as in protein expression of in gene regulatory networks.…

Streaming IoT Data and the Quantum Edge: A Classic/Quantum Machine Learning Use Case
Sabrina Herbst, Vincenzo De Maio, Ivona Brandic
https://arxiv.org/abs/2402.15542

Streaming IoT Data and the Quantum Edge: A Classic/Quantum Machine Learning Use Case
With the advent of the Post-Moore era, the scientific community is faced with the challenge of addressing the demands of current data-intensive machine learning applications, which are the cornerstone of urgent analytics in distributed computing. Quantum machine learning could be a solution for the increasing demand of urgent analytics, providing potential theoretical speedups and increased space efficiency. However, challenges such as (1) the encoding of data from the classical to the quantum …

Apart from AI-based image decoding from brain activity, can the human brain learn to (internally) decode images from activity in its auditory cortex? I.e., mental imagery from images encoded in sound?
Meant here is the highly specific encoding of images through visual-to-auditory sensory substitution, such that mental images are in principle well-defined (after training), contrary to a brief verbal prompt for generating a mental image.

An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian
Diyi Liu, Weijie Du, Lin Lin, James P. Vary, Chao Yang
https://arxiv.org/abs/2402.11205

An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian
We present an efficient quantum circuit for block encoding pairing Hamiltonians studied in nuclear physics. The new block encoding scheme does not require mapping the creation and annihilation operators to Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode these operators directly using controlled swaps. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number o…

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

Height-bounded Lempel-Ziv encodings
We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations that are variants of Lempel-Ziv parsings with a focus on bounding the worst-case access time to arbitrary positions in the text directly via the compressed representation. An LZ-like encoding is a partitioning of the string into phrases of length $1$ which can be encoded literally, or phrases of length at least $2$ which have a previous occurrence in the string and can be encoded by its position and leng…

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

Deferred NAM: Low-latency Top-K Context Injection via DeferredContext Encoding for Non-Streaming ASR
Contextual biasing enables speech recognizers to transcribe important phrases in the speaker's context, such as contact names, even if they are rare in, or absent from, the training data. Attention-based biasing is a leading approach which allows for full end-to-end cotraining of the recognizer and biasing system and requires no separate inference-time components. Such biasers typically consist of a context encoder; followed by a context filter which narrows down the context to apply, improving…

Tropicalization of curve arrangement complements and arroids
Edvard Aksnes
https://arxiv.org/abs/2404.14380 https://arxiv.org/pdf/240…

Tropicalization of curve arrangement complements and arroids
We define arroids as an abstract axiom set encoding the intersection properties of arrangements of curves. The tropicalization of the complement of arrangement of curves meeting pairwise transversely is shown to be determined by the associated arroid. We give conditions for when the cohomology of the complement of an arrangement is computable using tropical cohomology, and we give criteria for when the complement is a maximal variety in terms of tropical geometry.

More Church-Rosser Proofs in BELUGA
Alberto Momigliano (Dipartimento di Informatica, Universit\`a degli Studi di Milano, Italy), Martina Sassella (Dipartimento di Matematica, Universit\`a degli Studi di Milano, Italy)
https://arxiv.org/abs/2404.14921

More Church-Rosser Proofs in BELUGA
We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta-eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly i…

Learning Dynamical Systems Encoding Non-Linearity within Space Curvature
Bernardo Fichera, Aude Billard
https://arxiv.org/abs/2403.11948 https://

Learning Dynamical Systems Encoding Non-Linearity within Space Curvature
Dynamical Systems (DS) are an effective and powerful means of shaping high-level policies for robotics control. They provide robust and reactive control while ensuring the stability of the driving vector field. The increasing complexity of real-world scenarios necessitates DS with a higher degree of non-linearity, along with the ability to adapt to potential changes in environmental conditions, such as obstacles. Current learning strategies for DSs often involve a trade-off, sacrificing either …

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

Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting
In this study, we apply 1D quantum convolution to address the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature, transforming the problem into a multidimensional one. Building on theoretical foundations from prior research, which demonstrated that Variational Quantum Circuits (VQCs) can be expressed as multidimensional Fourier series, we explore the capabilities of different architectures and ansatz. Th…

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

Height-bounded Lempel-Ziv encodings
We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations that are variants of Lempel-Ziv parsings with a focus on bounding the worst-case access time to arbitrary positions in the text directly via the compressed representation. An LZ-like encoding is a partitioning of the string into phrases of length $1$ which can be encoded literally, or phrases of length at least $2$ which have a previous occurrence in the string and can be encoded by its position and leng…

Quality-Aware Dynamic Resolution Adaptation Framework for Adaptive Video Streaming
Amritha Premkumar, Prajit T Rajendran, Vignesh V Menon, Adam Wieckowski, Benjamin Bross, Detlev Marpe
https://arxiv.org/abs/2403.10976

Quality-Aware Dynamic Resolution Adaptation Framework for Adaptive Video Streaming
Traditional per-title encoding schemes aim to optimize encoding resolutions to deliver the highest perceptual quality for each representation. XPSNR is observed to correlate better with the subjective quality of VVC-coded bitstreams. Towards this realization, we predict the average XPSNR of VVC-coded bitstreams using spatiotemporal complexity features of the video and the target encoding configuration using an XGBoost-based model. Based on the predicted XPSNR scores, we introduce a Quality-A wa…

Structure-informed Positional Encoding for Music Generation
Manvi AgarwalS2A_IDS, Changhong WangS2A_IDS, Ga\"el RichardS2A_IDS
https://arxiv.org/abs/2402.13301

Structure-informed Positional Encoding for Music Generation
Music generated by deep learning methods often suffers from a lack of coherence and long-term organization. Yet, multi-scale hierarchical structure is a distinctive feature of music signals. To leverage this information, we propose a structure-informed positional encoding framework for music generation with Transformers. We design three variants in terms of absolute, relative and non-stationary positional information. We comprehensively test them on two symbolic music generation tasks: next-tim…

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

Leggett-Garg Macrorealism and temporal correlations
Leggett and Garg formulated macrorealist models encoding our intuition on classical systems, i.e., physical quantities have a definite value that can be measured with minimal disturbance, and with the goal of testing macroscopic quantum coherence effects. The associated inequalities, involving the statistics of sequential measurements on the system, are violated by quantum mechanical predictions and experimental observations. Such tests, however, are subject to loopholes: a classical explanatio…

Top-down modulation of visual cortical stimulus encoding and gamma independent of firing rates (in cats) https://www.biorxiv.org/content/10.1101/2024.04.11.589006v1 via @…

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

An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian
We present an efficient quantum circuit for block encoding pairing Hamiltonians studied in nuclear physics. The new block encoding scheme does not require mapping the creation and annihilation operators to Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode these operators directly using controlled swaps. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number o…

Hybrid Intersection Types for PCF (Extended Version)
Pablo Barenbaum, Delia Kesner, Mariana Milicich
https://arxiv.org/abs/2404.14340 https://

Hybrid Intersection Types for PCF (Extended Version)
Intersection type systems have been independently applied to different evaluation strategies, such as call-by-name (CBN) and call-by-value (CBV). These type systems have been then generalized to different subsuming paradigms being able, in particular, to encode CBN and CBV in a unique unifying framework. However, there are no intersection type systems that explicitly enable CBN and CBV to cohabit together without making use of an encoding into a common target framework. This work proposes an in…

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

CT Liver Segmentation via PVT-based Encoding and Refined Decoding
Accurate liver segmentation from CT scans is essential for effective diagnosis and treatment planning. Computer-aided diagnosis systems promise to improve the precision of liver disease diagnosis, disease progression, and treatment planning. In response to the need, we propose a novel deep learning approach, \textit{\textbf{PVTFormer}}, that is built upon a pretrained pyramid vision transformer (PVT v2) combined with advanced residual upsampling and decoder block. By integrating a refined featu…

Quality-Aware Dynamic Resolution Adaptation Framework for Adaptive Video Streaming
Amritha Premkumar, Prajit T Rajendran, Vignesh V Menon, Adam Wieckowski, Benjamin Bross, Detlev Marpe
https://arxiv.org/abs/2403.10976

Quality-Aware Dynamic Resolution Adaptation Framework for Adaptive Video Streaming
Traditional per-title encoding schemes aim to optimize encoding resolutions to deliver the highest perceptual quality for each representation. XPSNR is observed to correlate better with the subjective quality of VVC-coded bitstreams. Towards this realization, we predict the average XPSNR of VVC-coded bitstreams using spatiotemporal complexity features of the video and the target encoding configuration using an XGBoost-based model. Based on the predicted XPSNR scores, we introduce a Quality-A wa…

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

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
Causal DAGs (also known as Bayesian networks) are a popular tool for encoding conditional dependencies between random variables. In a causal DAG, the random variables are modeled as vertices in the DAG, and it is stipulated that every random variable is independent of its ancestors conditioned on its parents. It is possible, however, for two different causal DAGs on the same set of random variables to encode exactly the same set of conditional dependencies. Such causal DAGs are said to be Marko…

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

Lattice Surgery for Dummies
Quantum error correction (QEC) plays a crucial role in correcting noise and paving the way for fault-tolerant quantum computing. This field has seen significant advancements, with new quantum error correction codes emerging regularly to address errors effectively. Among these, topological codes, particularly surface codes, stand out for their low error thresholds and feasibility for implementation in large-scale quantum computers. However, these codes are restricted to encoding a single qubit. …

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

Incremental Measurement of Structural Entropy for Dynamic Graphs
Structural entropy is a metric that measures the amount of information embedded in graph structure data under a strategy of hierarchical abstracting. To measure the structural entropy of a dynamic graph, we need to decode the optimal encoding tree corresponding to the best community partitioning for each snapshot. However, the current methods do not support dynamic encoding tree updating and incremental structural entropy computation. To address this issue, we propose Incre-2dSE, a novel increm…

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

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
Causal DAGs (also known as Bayesian networks) are a popular tool for encoding conditional dependencies between random variables. In a causal DAG, the random variables are modeled as vertices in the DAG, and it is stipulated that every random variable is independent of its ancestors conditioned on its parents. It is possible, however, for two different causal DAGs on the same set of random variables to encode exactly the same set of conditional dependencies. Such causal DAGs are said to be Marko…

MedKP: Medical Dialogue with Knowledge Enhancement and Clinical Pathway Encoding
Jiageng Wu, Xian Wu, Yefeng Zheng, Jie Yang
https://arxiv.org/abs/2403.06611

MedKP: Medical Dialogue with Knowledge Enhancement and Clinical Pathway Encoding
With appropriate data selection and training techniques, Large Language Models (LLMs) have demonstrated exceptional success in various medical examinations and multiple-choice questions. However, the application of LLMs in medical dialogue generation-a task more closely aligned with actual medical practice-has been less explored. This gap is attributed to the insufficient medical knowledge of LLMs, which leads to inaccuracies and hallucinated information in the generated medical responses. In t…

Encoding Majorana codes
Maryam Mudassar, Riley W. Chien, Daniel Gottesman
https://arxiv.org/abs/2402.07829 https://arxiv.org/pdf/2402…

Encoding Majorana codes
To implement a quantum error correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that transform such codes must preserve fermionic parity. In this paper, we present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes. We present two approaches, both of which use a version of Gaussian elimination with …

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

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
We show a projective Beth definability theorem for logic programs under the stable model semantics: For given programs $P$ and $Q$ and vocabulary $V$ (set of predicates) the existence of a program $R$ in $V$ such that $P \cup R$ and $P \cup Q$ are strongly equivalent can be expressed as a first-order entailment. Moreover, our result is effective: A program $R$ can be constructed from a Craig interpolant for this entailment, using a known first-order encoding for testing strong equivalence, whic…

Error correction of parity-encoding-based annealing through post-readout decoding
Yoshihiro Nambu
https://arxiv.org/abs/2402.08839 https://

Error correction of parity-encoding-based annealing through post-readout decoding
Lechner, Hauke, and Zoller proposed a parity-encoded spin-embedding scheme for quantum annealing (QA) with all-to-all connectivity to avoid the issue of limited connectivity in near-term QA hardware and to enable the implementation thereof using only geometrically local interactions between spins fabricated on the planar substrate. Nevertheless, the redundant encoding of logical information, i.e., using a large number of spins to embed the logical information, increases the computational cost a…

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

Encoding Majorana codes
To implement a quantum error correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that transform such codes must preserve fermionic parity. In this paper, we present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes. We present two approaches, both of which use a version of Gaussian elimination with …

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

Error correction of parity-encoding-based annealing through post-readout decoding
Lechner, Hauke, and Zoller proposed a parity-encoded spin-embedding scheme for quantum annealing (QA) with all-to-all connectivity to avoid the issue of limited connectivity in near-term QA hardware and to enable the implementation thereof using only geometrically local interactions between spins fabricated on the planar substrate. Nevertheless, the redundant encoding of logical information, i.e., using a large number of spins to embed the logical information, increases the computational cost a…

Piecewise Polynomial Tensor Network Quantum Feature Encoding
Mazen Ali, Matthias Kabel
https://arxiv.org/abs/2402.07671 https://arxiv…

Piecewise Polynomial Tensor Network Quantum Feature Encoding
This work introduces a novel method for embedding continuous variables into quantum circuits via piecewise polynomial features, utilizing low-rank tensor networks. Our approach, termed Piecewise Polynomial Tensor Network Quantum Feature Encoding (PPTNQFE), aims to broaden the applicability of quantum algorithms by incorporating spatially localized representations suited for numerical applications like solving partial differential equations and function regression. We demonstrate the potential o…

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

Piecewise Polynomial Tensor Network Quantum Feature Encoding
This work introduces a novel method for embedding continuous variables into quantum circuits via piecewise polynomial features, utilizing low-rank tensor networks. Our approach, termed Piecewise Polynomial Tensor Network Quantum Feature Encoding (PPTNQFE), aims to broaden the applicability of quantum algorithms by incorporating spatially localized representations suited for numerical applications like solving partial differential equations and function regression. We demonstrate the potential o…