Miracle-dz/UniFAR-FTUs huggingface dataset:
A Case for CXL-Centric Server Processors

The memory system is a major performance determinant for server processors. Ever-growing core counts and datasets demand higher bandwidth and capacity as well as lower latency from the memory system. To keep up with growing demands, DDR--the dominant processor interface to memory over the past two decades--has offered higher bandwidth with every generation. However, because each parallel DDR interface requires a large number of on-chip pins, the processor's memory bandwidth is ultimately restrained by its pin-count, which is a scarce resource. With limited bandwidth, multiple memory requests typically contend for each memory channel, resulting in significant queuing delays that often overshadow DRAM's service time and degrade performance. We present CoaXiaL, a server design that overcomes memory bandwidth limitations by replacing \textit{all} DDR interfaces to the processor with the more pin-efficient CXL interface. The widespread adoption and industrial momentum of CXL makes such a transition possible, offering $4\times$ higher bandwidth per pin compared to DDR at a modest latency overhead. We demonstrate that, for a broad range of workloads, CXL's latency premium is more than offset by its higher bandwidth. As CoaXiaL distributes memory requests across more channels, it drastically reduces queuing delays and thereby both the average value and variance of memory access latency. Our evaluation with a variety of workloads shows that CoaXiaL improves the performance of manycore throughput-oriented servers by $1.52\times$ on average and by up to $3\times$.
An Algorithm For Adversary Aware Decentralized Networked MARL

Decentralized multi-agent reinforcement learning (MARL) algorithms have become popular in the literature since it allows heterogeneous agents to have their own reward functions as opposed to canonical multi-agent Markov Decision Process (MDP) settings which assume common reward functions over all agents. In this work, we follow the existing work on collaborative MARL where agents in a connected time varying network can exchange information among each other in order to reach a consensus. We introduce vulnerabilities in the consensus updates of existing MARL algorithms where agents can deviate from their usual consensus update, who we term as adversarial agents. We then proceed to provide an algorithm that allows non-adversarial agents to reach a consensus in the presence of adversaries under a constrained setting.
Magnetic helicity as a probe of magnetic flux-tube dynamics in the solar interior

Abstract Magnetic helicity (volume integral of the product of the magnetic field vector B and the vector potential A ), or its proxy, the current helicity at the surface (surface integral of B · J or B z J z ), is an important quantity which characterizes the helical nature of solar magnetic fields. The current helicity on the Sun shows a tendency, though with large dispersion, that it is positive in the southern hemisphere and negative in the northern hemisphere (the helicity sign rule). However, there are indications that the helicity sign rule may be reversed at activity minimum periods. We will discuss the significance of this property by focusing on the statistical distributions of helicity whether its dispersion follows Gaussian distribution or not.
The Multi-cluster Two-Wave Fading Model

We introduce and characterize a natural generalization of the Two-Wave with Diffuse Power (TWDP) fading model, by allowing that the incident waves arrive in different clusters. The newly proposed model, referred to as the Multi-cluster Two-Wave (MTW) fading model, generalizes both the TWDP and the kappa-mu models under a common umbrella. The special case on which the model parameters reach extreme values is also analyzed, aimed to model harsh fading conditions reported in experimental measurements obtained in enclosed environments. The chief probability functions of both the MTW and the MTW Extreme fading models are obtained, including the probability density function, the cumulative distribution function and the generalized moment-generating function. A number of applications for these models are exemplified, including outage probability in interference-limited scenarios, energy detection, and composite fading modeling.
A sharp phase transition in linear cross-entropy benchmarking

Demonstrations of quantum computational advantage and benchmarks of quantum processors via quantum random circuit sampling are based on evaluating the linear cross-entropy benchmark (XEB). A key question in the theory of XEB is whether it approximates the fidelity of the quantum state preparation. Previous works have shown that the XEB generically approximates the fidelity in a regime where the noise rate per qudit $\varepsilon$ satisfies $\varepsilon N \ll 1$ for a system of $N$ qudits and that this approximation breaks down at large noise rates. Here, we show that the breakdown of XEB as a fidelity proxy occurs as a sharp phase transition at a critical value of $\varepsilon N$ that depends on the circuit architecture and properties of the two-qubit gates, including in particular their entangling power. We study the phase transition using a mapping of average two-copy quantities to statistical mechanics models in random quantum circuit architectures with full or one-dimensional connectivity. We explain the phase transition behavior in terms of spectral properties of the transfer matrix of the statistical mechanics model and identify two-qubit gate sets that exhibit the largest noise robustness.
Application of Artificial Intelligence in the Classification of Microscopical Starch Images for Drug Formulation

Starches are important energy sources found in plants with many uses in the pharmaceutical industry such as binders, disintegrants, bulking agents in drugs and thus require very careful physicochemical analysis for proper identification and verification which includes microscopy. In this work, we applied artificial intelligence techniques (using transfer learning and deep convolution neural network CNNs to microscopical images obtained from 9 starch samples of different botanical sources. Our approach obtained an accuracy of 61% when the machine learning model was pretrained on microscopic images from MicroNet dataset. However the accuracy jumped to 81% for model pretrained on random day to day images obtained from Imagenet dataset. The model pretrained on the imagenet dataset also showed a better precision, recall and f1 score than that pretrained on the imagenet dataset.
A 3D constrained hybrid linear-pseudo hyperbolic Radon transform

Summary Radon transform (RT) has been a popular tool in seismic data processing and image analysis in recent years. It represents a process that maps events with different curvatures into a model space. The most commonly used types of RT in seismic data processing include the linear, parabolic and hyperbolic ones. One problem in the RT is that when the data contains events with different shapes, such as that the strong linear events are superimposed on the hyperbolic reflections, the performance of the RT would be greatly diminished. Accordingly, a combined RT with two or more operators may serve to mitigate the problem. Another problem is that the 2D RT might fail for seismic data acquired in a 3D recording system. In this paper, we present a 3D constrained hybrid linear-pseudo hyperbolic RT. We first extend the 2D time-invariant pseudo hyperbolic RT to 3D cases, and then combine it with the linear one to perform a hybrid representation in the 3D Radon domain. To make the solution of the 3D hybrid RT approximate the form of the real model, we adopt a constrained iterative-shrinkage algorithm. The proposed method is evaluated its effectiveness for the removal of 3D ground roll.
Functional Equivalence and Path Connectivity of Reducible Hyperbolic Tangent Networks

Understanding the learning process of artificial neural networks requires clarifying the structure of the parameter space within which learning takes place. A neural network parameter's functional equivalence class is the set of parameters implementing the same input--output function. For many architectures, almost all parameters have a simple and well-documented functional equivalence class. However, there is also a vanishing minority of reducible parameters, with richer functional equivalence classes caused by redundancies among the network's units. In this paper, we give an algorithmic characterisation of unit redundancies and reducible functional equivalence classes for a single-hidden-layer hyperbolic tangent architecture. We show that such functional equivalence classes are piecewise-linear path-connected sets, and that for parameters with a majority of redundant units, the sets have a diameter of at most 7 linear segments.
Distributed Detection Over Blockchain-Aided Internet of Things in the Presence of Attacks

Distributed detection over a blockchain-aided Internet of Things (BIoT) network in the presence of attacks is considered, where the integrated blockchain is employed to secure data exchanges over the BIoT as well as data storage at the agents of the BIoT. We consider a general adversary model where attackers jointly exploit the vulnerability of IoT devices and that of the blockchain employed in the BIoT. The optimal attacking strategy which minimizes the Kullback-Leibler divergence is pursued. It can be shown that this optimization problem is nonconvex, and hence it is generally intractable to find the globally optimal solution to such a problem. To overcome this issue, we first propose a relaxation method that can convert the original nonconvex optimization problem into a convex optimization problem, and then the analytic expression for the optimal solution to the relaxed convex optimization problem is derived. The optimal value of the relaxed convex optimization problem provides a detection performance guarantee for the BIoT in the presence of attacks. In addition, we develop a coordinate descent algorithm which is based on a capped water-filling method to solve the relaxed convex optimization problem, and moreover, we show that the convergence of the proposed coordinate descent algorithm can be guaranteed.
ArgU: A Controllable Factual Argument Generator

Effective argumentation is essential towards a purposeful conversation with a satisfactory outcome. For example, persuading someone to reconsider smoking might involve empathetic, well founded arguments based on facts and expert opinions about its ill-effects and the consequences on one’s family. However, the automatic generation of high-quality factual arguments can be challenging. Addressing existing controllability issues can make the recent advances in computational models for argument generation a potential solution. In this paper, we introduce ArgU: a neural argument generator capable of producing factual arguments from input facts and real-world concepts that can be explicitly controlled for stance and argument structure using Walton’s argument scheme-based control codes. Unfortunately, computational argument generation is a relatively new field and lacks datasets conducive to training. Hence, we have compiled and released an annotated corpora of 69,428 arguments spanning six topics and six argument schemes, making it the largest publicly available corpus for identifying argument schemes; the paper details our annotation and dataset creation framework. We further experiment with an argument generation strategy that establishes an inference strategy by generating an “argument template” before actual argument generation. Our results demonstrate that it is possible to automatically generate diverse arguments exhibiting different inference patterns for the same set of facts by using control codes based on argument schemes and stance.
DeepTree: Modeling Trees with Situated Latents

In this paper, we propose DeepTree, a novel method for modeling trees based on learning developmental rules for branching structures instead of manually defining them. We call our deep neural model "situated latent" because its behavior is determined by the intrinsic state -encoded as a latent space of a deep neural model- and by the extrinsic (environmental) data that is "situated" as the location in the 3D space and on the tree structure. We use a neural network pipeline to train a situated latent space that allows us to locally predict branch growth only based on a single node in the branch graph of a tree model. We use this representation to progressively develop new branch nodes, thereby mimicking the growth process of trees. Starting from a root node, a tree is generated by iteratively querying the neural network on the newly added nodes resulting in the branching structure of the whole tree. Our method enables generating a wide variety of tree shapes without the need to define intricate parameters that control their growth and behavior. Furthermore, we show that the situated latents can also be used to encode the environmental response of tree models, e.g., when trees grow next to obstacles. We validate the effectiveness of our method by measuring the similarity of our tree models and by procedurally generated ones based on a number of established metrics for tree form.
Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level

In order to implement a quantum computing application, problem instances must be encoded into a quantum circuit and then compiled for a specific platform. The lengthy compilation process is a key bottleneck in this workflow, especially for problems that arise repeatedly with a similar yet distinct structure (each of which requires a new compilation run thus far). In this paper, we aim to overcome this bottleneck by proposing a comprehensive pre-compilation technique that tries to minimize the time spent for compiling recurring problems while preserving the solution quality as much as possible. The following concepts underpin the proposed approach: Beginning with a problem class and a corresponding quantum algorithm, a predictive encoding scheme is applied to encode a representative problem instance into a general-purpose quantum circuit for that problem class. Once the real problem instance is known, the previously constructed circuit only needs to be adjusted-with (nearly) no compilation necessary. Experimental evaluations on QAOA for the MaxCut problem as well as a case study involving a satellite mission planning problem show that the proposed approach significantly reduces the compilation time by several orders of magnitude compared to Qiskit's compilation schemes while maintaining comparable compiled circuit quality. All implementations are available on GitHub (https://github.com! cda-tum! mqt-problemsolver) as part of the Munich Quantum Toolkit (MQT).
Semantic Embedded Deep Neural Network: A Generic Approach to Boost Multi-Label Image Classification Performance

Fine-grained multi-label classification models have broad applications in e-commerce, such as visual based label predictions ranging from fashion attribute detection to brand recognition. One challenge to achieve satisfactory performance for those classification tasks in real world is the wild visual background signal that contains irrelevant pixels which confuses model to focus onto the region of interest and make prediction upon the specific region. In this paper, we introduce a generic semantic-embedding deep neural network to apply the spatial awareness semantic feature incorporating a channel-wise attention based model to leverage the localization guidance to boost model performance for multi-label prediction. We observed an Avg.relative improvement of 15.27% in terms of AUC score across all labels compared to the baseline approach. Core experiment and ablation studies involve multi-label fashion attribute classification performed on Instagram fashion apparels' image. We compared the model performances among our approach, baseline approach, and 3 alternative approaches to leverage semantic features. Results show favorable performance for our approach.
A short survey of $Z$-matrices and new results on the subclass of $F_0$-matrices

A real square matrix $A$ of order $n \times n~ (n \geq 3)$ is called an $F_0$-matrix, if it is a $Z$-matrix (off-diagonal entries nonpositive), all of whose principal submatrices of orders at most $n-2$ are $M$-matrices while there is at least one principal submatrix of order $n-1$, which is an $N_0$-matrix. An $M$-matrix is a $Z$-matrix with the property that the real parts of all its eigenvalues are nonnegative. An $N_0$-matrix, in turn, is characterized by the fact that it is an invertible $Z$-matrix whose inverse is (entrywise) nonpositive. The first aim of this article is to present a short survey of some subclasses of $Z$-matrices, pertinent to the second objective, where new results concerning $F_0$-matrices are presented.
ANALOGICAL - A New Benchmark for Analogy of Long Text for Large Language Models

Over the past decade, analogies, in the form of word-level analogies, have played a signiﬁ-cant role as an intrinsic measure of evaluating the quality of word embedding methods such as word2vec. Modern large language models (LLMs), however, are primarily evaluated on extrinsic measures based on benchmarks such as GLUE and SuperGLUE, and there are only a few investigations on whether LLMs can draw analogies between long texts. In this paper, we present ANALOGICAL, a new benchmark to intrinsically evaluate LLMs across a taxonomy of analogies of long text with six levels of complexity – (i) word, (ii) word vs. sentence, (iii) syntactic, (iv) negation, (v) entailment, and (vi) metaphor. Using thirteen datasets and three different distance measures, we evaluate the abilities of eight LLMs in identifying analogical pairs in the semantic vector space. Our evaluation ﬁnds that it is increasingly challenging for LLMs to identify analogies when going up the analogy taxonomy.
A new residual fusion classification method for hyperspectral images

ABSTRACT In this paper, we propose a novel residual fusion classification method for hyperspectral image using spatial–spectral information, abbreviated as RFC-SS. The RFC-SS method first uses the Gabor texture features and the non-parametric weighted spectral features to describe the hyperspectral image from both aspects of spatial and spectral information. Then it applies the residual fusion method to save the useful information from different classification methods, which can greatly improve the classification performance. Finally, the test sample is assigned to the class that has the minimal fused residuals. The RFC-SS classification method is tested on two classical hyperspectral images (i.e. Indian Pines, Pavia University). The theoretical analysis and experimental results demonstrate that the RFC-SS classification method can achieve a better performance in terms of overall accuracy, average accuracy, and the Kappa coefficient when compared to the other classification methods.
Causal Discovery with Unobserved Variables: A Proxy Variable Approach

Discovering causal relations from observational data is important. The existence of unobserved variables, such as latent confounders or mediators, can mislead the causal identification. To address this issue, proximal causal discovery methods proposed to adjust for the bias with the proxy of the unobserved variable. However, these methods presumed the data is discrete, which limits their real-world application. In this paper, we propose a proximal causal discovery method that can well handle the continuous variables. Our observation is that discretizing continuous variables can can lead to serious errors and comprise the power of the proxy. Therefore, to use proxy variables in the continuous case, the critical point is to control the discretization error. To this end, we identify mild regularity conditions on the conditional distributions, enabling us to control the discretization error to an infinitesimal level, as long as the proxy is discretized with sufficiently fine, finite bins. Based on this, we design a proxy-based hypothesis test for identifying causal relationships when unobserved variables are present. Our test is consistent, meaning it has ideal power when large samples are available. We demonstrate the effectiveness of our method using synthetic and real-world data.
The EarlyBIRD Catches the Bug: On Exploiting Early Layers of Encoder Models for More Efficient Code Classification

The use of modern Natural Language Processing (NLP) techniques has shown to be beneficial for software engineering tasks, such as vulnerability detection and type inference. However, training deep NLP models requires significant computational resources. This paper explores techniques that aim at achieving the best usage of resources and available information in these models. We propose a generic approach, EarlyBIRD, to build composite representations of code from the early layers of a pre-trained transformer model. We empirically investigate the viability of this approach on the CodeBERT model by comparing the performance of 12 strategies for creating composite representations with the standard practice of only using the last encoder layer. Our evaluation on four datasets shows that several early layer combinations yield better performance on defect detection, and some combinations improve multi-class classification. More specifically, we obtain a +2 average improvement of detection accuracy on Devign with only 3 out of 12 layers of CodeBERT and a 3.3x speed-up of fine-tuning. These findings show that early layers can be used to obtain better results using the same resources, as well as to reduce resource usage during fine-tuning and inference.
Fluctuations in the New Inflationary Universe

The spectrum of density perturbations is calculated in the new-inflationary-universe scenario. The main source is the quantum fluctuations of the Higgs field, which lead to fluctuations in the time at which the false vacuum energy is released. The value of δρρ on any given length scale l, at the time when the Hubble radius ≫l, is estimated. This quantity is nearly scale invariant (as desired), but is unfortunately about 105 times too large.
Muonium state exchange dynamics in n-type Gallium Arsenide

Muonium (Mu), a pseudo-isotope atom of hydrogen with a positively charged muon at the place of the proton, can form in a wide range of semiconductor materials. They can appear in different states, depending on their charge state and microscopic site within a crystal lattice. After the Mu formation, they undergo interactions with free charge carriers, electronic spins, and other Mu sites, and form a dynamic network of state exchange. We identified the model of Mu dynamics in n-type Gallium Arsenide using the density matrix simulation and photoexcited muon spin spectroscopy technique. Fitting to the dark and illuminated $\mu$SR data provided transition rates between Mu states, which in turn showed the underlying mechanism of the $\mu$SR time spectra. Deduced capture/scattering cross sections of the Mu states reflected the microscopic dynamics of Mu. Illumination studies enable us to measure interactions between Mu and generated minority carriers, which are unavailable in dark measurements. The methodology we developed in this study can be applied to other semiconductor systems for a deeper microscopic understanding of the Mu state exchange dynamics.
Refining Human-Centered Autonomy Using Side Information

Data-driven algorithms for human-centered autonomy use observed data to compute models of human behavior in order to ensure safety, correctness, and to avoid potential errors that arise at runtime. However, such algorithms often neglect useful a priori knowledge, known as side information, that can improve the quality of data-driven models. We identify several key challenges in human-centered autonomy, and identify possible approaches to incorporate side information in data-driven models of human behavior.