arxiv_id
stringlengths 11
18
| title
stringlengths 10
217
| abstract
stringlengths 9
2.1k
| subjects
stringclasses 150
values | scrubbed_comments
stringlengths 2
1.33k
| category
stringclasses 1
value | __index_level_0__
int64 1
14.6k
|
|---|---|---|---|---|---|---|
2312.07076v2 | CSI-Based Cross-Domain Activity Recognition via Zero-Shot Prototypical Networks | The cross-domain capability of wireless sensing is currently one of the major challenges on human activity recognition (HAR) based on the channel state information (CSI) of wireless signals. The difficulty of labeling samples from new domains has encouraged the use of few and zero shot strategies. In this context, prototype networks have attracted attention due to their reasonable cross-domain transferability. This paper presents a novel zero-shot prototype recurrent convolutional network that implements a zero-shot learning strategy for HAR via CSI. This method extracts the prototypes from an available source domain to classify unseen and unlabeled data from the target domain for the same or similar classes. The experiments have been developed using three datasets with real measurements, and the results include an inter-datasets evaluation. Overall, the results improve the state of the art and make it a promising solution for cross-domain HAR. | Signal Processing (eess.SP) | The authors have identified a significant error in the neural network configuration, specifically related to the addition of the LSTM layer after the CNN blocks and the method used to input data into the network. As a result, we have verified that the outcomes are inconsistent with what would be expected from a correctly configured neural network | factual/methodological/other critical errors in manuscript | 13,816 |
2312.07418v2 | Attention Based Encoder Decoder Model for Video Captioning in Nepali (2023) | Video captioning in Nepali, a language written in the Devanagari script, presents a unique challenge due to the lack of existing academic work in this domain. This work develops a novel encoder-decoder paradigm for Nepali video captioning to tackle this difficulty. LSTM and GRU sequence-to-sequence models are used in the model to produce related textual descriptions based on features retrieved from video frames using CNNs. Using Google Translate and manual post-editing, a Nepali video captioning dataset is generated from the Microsoft Research Video Description Corpus (MSVD) dataset created using Google Translate, and manual post-editing work. The efficacy of the model for Devanagari-scripted video captioning is demonstrated by BLEU, METOR, and ROUGE measures, which are used to assess its performance. | Computer Vision and Pattern Recognition (cs.CV) | Result are wrong and took some time | factual/methodological/other critical errors in manuscript | 13,819 |
2312.07726v2 | Optimal lower bound for the variance of hitting times for simple random walks on graphs | We study hitting times in simple random walks on graphs, which measure the time required to reach specific target vertices. Our main result establishes a sharp lower bound for the variance of hitting times. For a simple random walk on a graph with $n$ vertices, we prove that the variance of the hitting time from a vertex $x$ to a vertex $y$, denoted $\tau_y$, is at least of the order $\mathbb{E}_x(\tau_y)^2 / \log n$. When the graph is a tree, we show that $n$ can be replaced by the graph's distance between vertices $x$ and $y$. | Probability (math.PR) | There is an error in the Proof of Theorem 1.2 | factual/methodological/other critical errors in manuscript | 13,820 |
2312.07986v3 | On Diophantine equations with Fibonacci and Lucas sequences associated to Hardy-Ramanujan problem | In this paper, we deal with Diophantine equations $N = {F_k}^3 + {F_\ell }^3 = {F_m}^3 + {F_n}^3$ and $M = {L_k}^3 + {L_\ell }^3 = {L_m}^3 + {L_n}^3$. In other words, we discover the Fibonacci and Lucas numbers that are also Hardy-Ramanujan numbers. | Number Theory (math.NT) | It contains some errors and so it will be developed more | factual/methodological/other critical errors in manuscript | 13,821 |
2312.08926v2 | Modeling Complex Mathematical Reasoning via Large Language Model based MathAgent | Large language models (LLMs) face challenges in solving complex mathematical problems that require comprehensive capacities to parse the statements, associate domain knowledge, perform compound logical reasoning, and integrate the intermediate rationales. Tackling all these problems once could be arduous for LLMs, thus leading to confusion in generation. In this work, we explore the potential of enhancing LLMs with agents by meticulous decomposition and modeling of mathematical reasoning process. Specifically, we propose a formal description of the mathematical solving and extend LLMs with an agent-based zero-shot framework named $\bf{P}$lanner-$\bf{R}$easoner-$\bf{E}$xecutor-$\bf{R}$eflector (PRER). We further provide and implement two MathAgents that define the logical forms and inherent relations via a pool of actions in different grains and orientations: MathAgent-M adapts its actions to LLMs, while MathAgent-H aligns with humankind. Experiments on miniF2F and MATH have demonstrated the effectiveness of PRER and proposed MathAgents, achieving an increase of $12.3\%$($53.9\%\xrightarrow{}66.2\%$) on the MiniF2F, $9.2\%$ ($49.8\%\xrightarrow{}59.0\%$) on MATH, and $13.2\%$($23.2\%\xrightarrow{}35.4\%$) for level-5 problems of MATH against GPT-4. Further analytical results provide more insightful perspectives on exploiting the behaviors of LLMs as agents. | Artificial Intelligence (cs.AI) | There are unfair comparisons on miniF2F. This will be fixed in the future | factual/methodological/other critical errors in manuscript | 13,825 |
2312.10993v2 | Realistic Human Motion Generation with Cross-Diffusion Models | We introduce the Cross Human Motion Diffusion Model (CrossDiff), a novel approach for generating high-quality human motion based on textual descriptions. Our method integrates 3D and 2D information using a shared transformer network within the training of the diffusion model, unifying motion noise into a single feature space. This enables cross-decoding of features into both 3D and 2D motion representations, regardless of their original dimension. The primary advantage of CrossDiff is its cross-diffusion mechanism, which allows the model to reverse either 2D or 3D noise into clean motion during training. This capability leverages the complementary information in both motion representations, capturing intricate human movement details often missed by models relying solely on 3D information. Consequently, CrossDiff effectively combines the strengths of both representations to generate more realistic motion sequences. In our experiments, our model demonstrates competitive state-of-the-art performance on text-to-motion benchmarks. Moreover, our method consistently provides enhanced motion generation quality, capturing complex full-body movement intricacies. Additionally, with a pretrained model,our approach accommodates using in the wild 2D motion data without 3D motion ground truth during training to generate 3D motion, highlighting its potential for broader applications and efficient use of available data resources. Project page: this https URL . | Computer Vision and Pattern Recognition (cs.CV) | Some conclusion is incorrect. We're going to do some additional experiments | factual/methodological/other critical errors in manuscript | 13,830 |
2312.11153v2 | Research on Multilingual Natural Scene Text Detection Algorithm | Natural scene text detection is a significant challenge in computer vision, with tremendous potential applications in multilingual, diverse, and complex text scenarios. We propose a multilingual text detection model to address the issues of low accuracy and high difficulty in detecting multilingual text in natural scenes. In response to the challenges posed by multilingual text images with multiple character sets and various font styles, we introduce the SFM Swin Transformer feature extraction network to enhance the model's robustness in detecting characters and fonts across different languages. Dealing with the considerable variation in text scales and complex arrangements in natural scene text images, we present the AS-HRFPN feature fusion network by incorporating an Adaptive Spatial Feature Fusion module and a Spatial Pyramid Pooling module. The feature fusion network improvements enhance the model's ability to detect text sizes and orientations. Addressing diverse backgrounds and font variations in multilingual scene text images is a challenge for existing methods. Limited local receptive fields hinder detection performance. To overcome this, we propose a Global Semantic Segmentation Branch, extracting and preserving global features for more effective text detection, aligning with the need for comprehensive information. In this study, we collected and built a real-world multilingual natural scene text image dataset and conducted comprehensive experiments and analyses. The experimental results demonstrate that the proposed algorithm achieves an F-measure of 85.02\%, which is 4.71\% higher than the baseline model. We also conducted extensive cross-dataset validation on MSRA-TD500, ICDAR2017MLT, and ICDAR2015 datasets to verify the generality of our approach. The code and dataset can be found at this https URL . | Computer Vision and Pattern Recognition (cs.CV) | Sorry, we discovered certain mistake and asked that the current version be removed in order to perform a thorough reanalysis | factual/methodological/other critical errors in manuscript | 13,831 |
2312.12135v2 | Object Detection for Automated Coronary Artery Using Deep Learning | In the era of digital medicine, medical imaging serves as a widespread technique for early disease detection, with a substantial volume of images being generated and stored daily in electronic patient records. X-ray angiography imaging is a standard and one of the most common methods for rapidly diagnosing coronary artery diseases. The notable achievements of recent deep learning algorithms align with the increased use of electronic health records and diagnostic imaging. Deep neural networks, leveraging abundant data, advanced algorithms, and powerful computational capabilities, prove highly effective in the analysis and interpretation of images. In this context, Object detection methods have become a promising approach, particularly through convolutional neural networks (CNN), streamlining medical image analysis by eliminating manual feature extraction. This allows for direct feature extraction from images, ensuring high accuracy in results. Therefore, in our paper, we utilized the object detection method on X-ray angiography images to precisely identify the location of coronary artery stenosis. As a result, this model enables automatic and real-time detection of stenosis locations, assisting in the crucial and sensitive decision-making process for healthcare professionals. | Image and Video Processing (eess.IV) | The results in the article need fundamental corrections | factual/methodological/other critical errors in manuscript | 13,835 |
2312.12173v3 | A Globally Convergent Policy Gradient Method for Linear Quadratic Gaussian (LQG) Control | We present a model-based globally convergent policy gradient method (PGM) for linear quadratic Gaussian (LQG) control. Firstly, we establish equivalence between optimizing dynamic output feedback controllers and designing a static feedback gain for a system represented by a finite-length input-output history (IOH). This IOH-based approach allows us to explore LQG controllers within a parameter space defined by IOH gains. Secondly, by considering a control law comprising the IOH gain and a sufficiently small random perturbation, we show that the cost function, evaluated through the control law over IOH gains, is gradient-dominant and locally smooth, ensuring the global linear convergence of the PGM. Numerical simulations show that the dynamic controller learned by the proposed PGM is almost same as the LQG optimal controller, indicating promising results even in a reduced-order controller design. | Optimization and Control (math.OC) | Due to a technical issue discovered in the paper | factual/methodological/other critical errors in manuscript | 13,837 |
2312.12562v2 | Almost automorphic systems have invariant measures | Let $G$ be a non-amenable countable group. We show that every almost automorphic $G$-action on a compact Hausdorff space, with a maximal equicontinuous factor whose phase space is a Cantor set, admits invariant probability measures (this partially answers a question posed by Veech). In particular, every Toeplitz $G$-subshift has a non-empty space of invariant measures, meaning that this family of subshifts is not a test for amenability for countable groups. We prove that almost one-to-one extensions without measures ensure the existence of symbolic almost one-to-one extensions with equal characteristics. As a consequence, we obtain the most general result of this paper. Finally, as a corollary of our results, we deduce that the class of Toeplitz subshifts is not dense in the space of infinite transitive subshifts of $\Sigma^G$, unlike $G=\mathbb{Z}$. | Dynamical Systems (math.DS) | There is an error in theorem 14, which we believe cannot be corrected. We are working on a new version of this topic, which may take a little longer | factual/methodological/other critical errors in manuscript | 13,839 |
2312.13215v2 | Asymptotic Homology of Brownian motion on a Riemannian manifold | We prove, using the celebrated result by Spitzer about winding of planar Brownian motion, and the existence of harmonic morphisms $f:M\to{\mathbb S}^1$ representing cohomology classes in $\text{H}^1(M,\mathbb Z)$, that there is a stochastic process $H_t:{\mathcal C}(M)\to{\text{Hom}(\text{H}^1(M;\mathbb R), \mathbb R)}\simeq{\text{H}_1(M;\mathbb R)}$ ($t\in[0,\infty)$), where ${\mathcal C}(M)= \{ \alpha:[0, \infty) \to M :\alpha \,\, \text{is continuous} \}$, which has a multivariate Cauchy distribution i.e. such that for each nontrivial cohomology class $[\omega]\in{\text{H}^1(M;\mathbb R), \mathbb R)}$, represented by a closed 1-form $\omega$, in the de Rham cohomology, the process $A^\omega_t:{\mathcal C}(M)\to\mathbb R\,$ ($t\in[0,\infty)$) with $A^\omega_t(B)=H_t(B)([\omega]),\, B\in{\mathcal C}(M)$ converges in distribution, with respect to Wiener measure on ${\mathcal C}(M)$, to a Cauchy's distribution, with parameter 1. The process describes the ``homological winding" of the Brownian paths in $M$, thus it can be regarded as a generalization of Spitzer result. The last section discusses the asymptotic behavior of holonomy along Brownian paths. | Probability (math.PR) | The principal result is incorrect. The distributions proposed are properly normalized Normal distributions and it leaves open the fascinating question of the asymptotic behavior of homology classes of Brownian paths | factual/methodological/other critical errors in manuscript | 13,840 |
2312.14310v2 | High fidelity two-qubit quantum state tomography of Electron-14N hybrid spin register in diamond | We report here on a major improvement of the control and characterization capabilities of 14N nuclear spin of single NV centers in diamond, as well as on a new method that we have devised for characterizing quantum states, i.e. quantum state tomography using Rabi experiments. Depending on whether we use amplitude information or phase information from Rabi experiments, we define two sub-methods namely Rabi amplitude quantum state tomography (RAQST) and Rabi phase quantum state tomography (RPQST). The advantage of Rabi-based tomography methods is that they lift the requirement of unitary operations used in other methods in general and standard methods in particular. On one hand, this does not increase the complexity of the tomography experiments in large registers, and on the other hand, it decreases the error induced by MW irradiation. We used RAQST and RPQST to investigate the quality of various two-qubit pure states in our setup. As expected, test quantum states show very high fidelity with the theoretical counterpart. | Quantum Physics (quant-ph) | The reviewing process has revealed some inconsistencies in this version | factual/methodological/other critical errors in manuscript | 13,842 |
2312.15490v2 | Diffusion-EXR: Controllable Review Generation for Explainable Recommendation via Diffusion Models | Denoising Diffusion Probabilistic Model (DDPM) has shown great competence in image and audio generation tasks. However, there exist few attempts to employ DDPM in the text generation, especially review generation under recommendation systems. Fueled by the predicted reviews explainability that justifies recommendations could assist users better understand the recommended items and increase the transparency of recommendation system, we propose a Diffusion Model-based Review Generation towards EXplainable Recommendation named Diffusion-EXR. Diffusion-EXR corrupts the sequence of review embeddings by incrementally introducing varied levels of Gaussian noise to the sequence of word embeddings and learns to reconstruct the original word representations in the reverse process. The nature of DDPM enables our lightweight Transformer backbone to perform excellently in the recommendation review generation task. Extensive experimental results have demonstrated that Diffusion-EXR can achieve state-of-the-art review generation for recommendation on two publicly available benchmark datasets. | Information Retrieval (cs.IR) | I request to withdraw my paper due to the discovery of significant errors in terms of experimental results in the manuscript that affect the validity of the paper. These errors are necessary to correct, and the current version should not be used or cited in its present form | factual/methodological/other critical errors in manuscript | 13,844 |
2312.15634v2 | Incorporating Feature Signal Transmission with Block-based Haptic Data Reduction for Time-delayed Teleoperation | This paper presents an innovative feature signal transmission approach incorpo-rating block-based haptic data reduction to address time-delayed teleoperation. Numerous data reduction techniques rely on perceptual deadband (DB). In the preceding block-based approaches, the whole block within the DB is discarded. However, disregarding all signals within the DB loses too much information and hinders effective haptic signal tracking, as these signals contain valuable infor-mation for signal reconstruction. Consequently, we propose a feature signal transmission approach based on the block algorithm that aggregates samples as a unit, enabling high-quality haptic data reduction. In our proposed approach, we employ max-pooling to extract feature signals from the signals within the DB. These feature signals are then transmitted by adjusting the content of the trans-mission block. This methodology enables the transmission of more useful infor-mation without introducing additional delay, aside from the inherent algorithmic delay. Experimental results demonstrate the superiority of our approach over oth-er state-of-the-art (SOTA) methods on various assessment measures under dis-tinct channel delays. | Human-Computer Interaction (cs.HC) | The paper contains some fundamental errors that need to be withdrawn | factual/methodological/other critical errors in manuscript | 13,846 |
2312.15675v2 | Limiting absorption principle and absence of eigenvalues for massless Klein-Gordon operators on perturbations of the Minkowski spacetime | We prove a uniform weighted resolvent estimate for the massless Klein-Gordon operator on a curved spacetime which is sufficiently close to the Minkowski spacetime. This particularly implies the existence and Hölder continuity of the limiting resolvents at all energies, as well as the absolute continuity, of the massless Klein-Gordon operator. The proof is based on a simple version of Mourre's commutator method and does not rely on microlocal analysis. We also prove the absence of eigenvalues via the Virial theorem under an ellipticity condition on the commutator of the massless Klein-Gordon operator against the generator of a wick-rotated dilation, which is weaker than the smallness condition for the metric perturbation. | Mathematical Physics (math-ph) | There is a gap in the proof of Hölder continuities of weighted resolvents near zero energy, which strongly diminishes the interest of the paper | factual/methodological/other critical errors in manuscript | 13,847 |
2312.16584v2 | Dual theory of decaying turbulence. 2. Numerical simulation and continuum limit | This is the second paper in a cycle investigating the exact solution of loop equations in decaying turbulence. We perform numerical simulations of the Euler ensemble, suggested in the previous work, as a solution to the loop equations. We designed novel algorithms for simulation, which take a small amount of computer RAM so that only the CPU time grows linearly with the size of the system and its statistics. This algorithm allows us to simulate systems with billions of discontinuity points on our fractal curve, dual to the decaying turbulence. For the vorticity correlation function, we obtain \textbf{quantum fractal laws} with regime changes between universal discrete values of indexes. The traditional description of turbulence with fractal or multifractal scaling laws does not apply here. The measured conditional probabilities of fluctuating variables are smooth functions of the logarithm of scale, with statistical errors being negligible at our large number of random samples $T = 167,772,160$ with $N = 200,000,000$ points on a fractal curve. The quantum jumps arise from the analytical distribution of scaling variable $X = \frac{\cot^2(\pi p/q)}{q^2}$ where $\frac{p}{q}$ is a random fraction. This distribution is related to the totient summatory function and is a discontinuous function of $X$. In particular, the energy spectrum is a devil's staircase with tilted uneven steps with slopes between $-1$ and $-2.03$. The logarithmic derivative of energy decay $n(t)$ as a function of time is jumping down the stairs of universal levels between $1.50$ and $1.53$. The quantitative verification of this quantization would require more precise experimental data. | Fluid Dynamics (physics.flu-dyn) | The local limit $N \to \infty$ turned out unachievable at available computer resources. The results of simulation are unreliable and must be discarded. Instead, an analytic approach to the local limit must be found | factual/methodological/other critical errors in manuscript | 13,850 |
2401.00394v2 | Dynamics for the corotational energy-critical wave map equation with quantized blow-up rates | We consider the wave maps from $\mathbb{R}^{1+2}$ into $\mathbb{S}^2\subset \mathbb{R}^3.$ Under an additional assumption of $k$-corotational symmetry, the problem reduces to the one dimensional semilinear wave equation: \begin{equation*} \partial_t^2 u-\partial_r^2 u-\frac{\partial_r u}{r}+k^2 \frac{\sin(2u)}{2r^2}=0. \end{equation*} Given any integer $k\ge 1$ and any integer $m\ge 2k,$ we exhibit a set of initial data $(u_0,u_1)$ with energy arbitrarily close to that of the ground state solution $Q$, such that the corresponding solution $u$ blows up in finite time by concentrating its energy. To be precise, the solution $u$ satisfies \begin{equation*} \lim\limits_{t\rightarrow T} \left\|\left(u(t,r)-Q\left(\frac{r}{\lambda(t)}\right)-u_1^*(r), \partial_t u-u_2^*(r)\right)\right\|_{H\times L^2}=0 \end{equation*} with a quantized speed \begin{equation*} \lambda(t)=c(u_0,u_1)(1+o_{t\to T}(1))\frac{(T-t)^{\frac{m}{k}}}{|\log(T-t)|^{\frac{m}{k(m-k)}}}, \end{equation*} where $\|u\|_{H}:=\int_{\mathbb{R}^2}\left(|\partial_r u|^2+\frac{|u|^2}{r^2}\right).$ | Analysis of PDEs (math.AP) | There are computational errors in section 2.3 on the blow-up profiles, thus the whole proof and the main results for the cases k greater than 1 are incorrect. We thank professors Kihyun KIM, [REDACTED-NAME] and [REDACTED-NAME] for pointing out the mistakes | factual/methodological/other critical errors in manuscript | 13,853 |
2401.00547v2 | On Learning for Ambiguous Chance Constrained Problems | We study chance constrained optimization problems $\min_x f(x)$ s.t. $P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision maker (DM). When the DM has access to a set of distributions $\mathcal{U}$ such that $P$ is contained in $\mathcal{U}$, then the problem is known as the ambiguous chance-constrained problem \cite{erdougan2006ambiguous}. We study ambiguous chance-constrained problem for the case when $\mathcal{U}$ is of the form $\left\{\mu:\frac{\mu (y)}{\nu(y)}\leq C, \forall y\in\Theta, \mu(y)\ge 0\right\}$, where $\nu$ is a ``reference distribution.'' We show that in this case the original problem can be ``well-approximated'' by a sampled problem in which $N$ i.i.d. samples of $\theta$ are drawn from $\nu$, and the original constraint is replaced with $g(x,\theta_i)\le 0,~i=1,2,\ldots,N$. We also derive the sample complexity associated with this approximation, i.e., for $\epsilon,\delta>0$ the number of samples which must be drawn from $\nu$ so that with a probability greater than $1-\delta$ (over the randomness of $\nu$), the solution obtained by solving the sampled program yields an $\epsilon$-feasible solution for the original chance constrained problem. | Machine Learning (cs.LG) | We have "not considered the uniform bound" for violation probabilities corresponding to the set of distributions in the ambiguity set | factual/methodological/other critical errors in manuscript | 13,854 |
2401.01167v2 | Hörmander properties of discrete time Markov processes | We present an abstract framework for establishing smoothing properties within a specific class of inhomogeneous discrete-time Markov processes. These properties, in turn, serve as a basis for demonstrating the existence of a density function for our process or more precisely for a regularized version of it. They can also be exploited to show its total variation convergence towards the solution of a Stochastic Differential Equation as the time step between two observations of our discrete time Markov process tends to zero. The distinctive feature of our methodology lies in the exploration of smoothing properties under a local weak Hörmander type condition satisfied by the discrete-time Markov process. Our Hörmander property is demonstrated to align with the standard local weak Hörmander associated to the Stochastic Differential Equation which is the total variation limit of our discrete time Markov process. | Probability (math.PR) | The results in the paper have changed | factual/methodological/other critical errors in manuscript | 13,855 |
2401.01246v2 | Analysis of quantum Krylov algorithms with errors | This work provides an error analysis of quantum Krylov algorithms based on real-time evolutions, subject to generic errors in the outputs of the quantum circuits. We establish a collective noise rate to summarize those errors, and prove that the resulting errors in the ground state energy estimates are leading-order linear in that noise rate. This resolves a misalignment between known numerics, which exhibit this linear scaling, and prior theoretical analysis, which only provably obtained square-root scaling. Our main technique is expressing generic errors in terms of an effective target Hamiltonian studied in an effective Krylov space. These results provide a theoretical framework for understanding the main features of quantum Krylov errors. | Quantum Physics (quant-ph) | There is an error in eq. (26) of v1 that invalidates the main result. A new version is being prepared, but in the meantime the paper is withdrawn | factual/methodological/other critical errors in manuscript | 13,856 |
2401.02488v3 | The Hilden Double Coset Problem in Braid Groups | In this paper we provide a solution to the double coset problem for the braid group $B_n$ modulo the Hilden subgroup $H_n.$ This result demonstrates that, as in the case of braid closures, the Link Problem for plat closures is "stably equivalent" to a solvable algebraic problem. A particularly interesting feature of the proof is that, like Garside's solutions to the Word and Conjugacy Problems, it too relies on Garside's decomposition of braids in $B_n.$ | Geometric Topology (math.GT) | Lemma 3.4 on page 7 is incorrect. This is crucial to the argument. The problem that could not be fixed is if there are parts of hilden subgroup elements that contain parts of powers of the garside element | factual/methodological/other critical errors in manuscript | 13,861 |
2401.06401v3 | DevEval: Evaluating Code Generation in Practical Software Projects | How to evaluate Large Language Models (LLMs) in code generation is an open question. Many benchmarks have been proposed but are inconsistent with practical software projects, e.g., unreal program distributions, insufficient dependencies, and small-scale project contexts. Thus, the capabilities of LLMs in practical projects are still unclear. In this paper, we propose a new benchmark named DevEval, aligned with Developers' experiences in practical projects. DevEval is collected through a rigorous pipeline, containing 2,690 samples from 119 practical projects and covering 10 domains. Compared to previous benchmarks, DevEval aligns to practical projects in multiple dimensions, e.g., real program distributions, sufficient dependencies, and enough-scale project contexts. We assess five popular LLMs on DevEval (e.g., gpt-4, gpt-3.5-turbo, CodeLLaMa, and StarCoder) and reveal their actual abilities in code generation. For instance, the highest Pass@1 of gpt-3.5-turbo only is 42 in our experiments. We also discuss the challenges and future directions of code generation in practical projects. We open-source DevEval and hope it can facilitate the development of code generation in practical projects. | Software Engineering (cs.SE) | There are mistakes in the dataset. We need to re-check the dataset and repeat our experiments | factual/methodological/other critical errors in manuscript | 13,873 |
2401.06455v2 | Multiplicative Chow-Künneth decomposition and homology splitting of configuration spaces | We construct a splitting of the cohomology of configuration spaces of points on a smooth proper variety with a multiplicative Chow--Künneth decomposition. Applied to hyperelliptic curves, this shows that the hyperelliptic Torelli group acts trivially on the rational cohomology of ordered configuration spaces of points. Moreover, if $H_{g,n}$ denotes the moduli space of $n$-pointed hyperelliptic curves, the Leray spectral sequence for the forgetful map $H_{g,n} \to H_g$ degenerates immediately, in sharp contrast to the forgetful map from $M_{g,n}$ to $M_g$. This allows for new detailed calculations of the cohomology of $M_{2,n}$ for $n \leq 5$, and the stable cohomology of $H_{g,n}$ for $n \leq 5$. We also give a detailed study of the cohomology of symplectic local systems on $M_2$. | Algebraic Geometry (math.AG) | [REDACTED-NAME] has communicated to us that Corollary 1.10 contradicts known statements in the literature | factual/methodological/other critical errors in manuscript | 13,874 |
2401.06819v2 | Supersymmetry in Quantum Mechanics by Generalized Uncertainty Principle | In this paper, we study supersymmetry in quantum mechanics using the generalized uncertainty principle (GUP), or in other words, generalized supersymmetry in quantum mechanics. We construct supersymmetry in the generalized form of the momentum operator, which is derived from GUP. By generalizing the creation and annihilation operators, we can transform the supersymmetry into a generalized state. In the following, we address the challenge of solving the Schrödinger equation for the generalized Hamiltonian. To overcome this difficulty, we employ perturbation theory to establish a relationship between the creation and annihilation operators. By solving this equation analytically and utilizing wave functions and energy levels, we can generate new potentials using the creation and annihilation operators of the wave functions and energy levels for the newer potentials. | Quantum Physics (quant-ph) | I have not published correct and updated information | factual/methodological/other critical errors in manuscript | 13,875 |
2401.07510v2 | Developing ChatGPT for Biology and Medicine: A Complete Review of Biomedical Question Answering | ChatGPT explores a strategic blueprint of question answering (QA) in delivering medical diagnosis, treatment recommendations, and other healthcare support. This is achieved through the increasing incorporation of medical domain data via natural language processing (NLP) and multimodal paradigms. By transitioning the distribution of text, images, videos, and other modalities from the general domain to the medical domain, these techniques have expedited the progress of medical domain question answering (MDQA). They bridge the gap between human natural language and sophisticated medical domain knowledge or expert manual annotations, handling large-scale, diverse, unbalanced, or even unlabeled data analysis scenarios in medical contexts. Central to our focus is the utilizing of language models and multimodal paradigms for medical question answering, aiming to guide the research community in selecting appropriate mechanisms for their specific medical research requirements. Specialized tasks such as unimodal-related question answering, reading comprehension, reasoning, diagnosis, relation extraction, probability modeling, and others, as well as multimodal-related tasks like vision question answering, image caption, cross-modal retrieval, report summarization, and generation, are discussed in detail. Each section delves into the intricate specifics of the respective method under consideration. This paper highlights the structures and advancements of medical domain explorations against general domain methods, emphasizing their applications across different tasks and datasets. It also outlines current challenges and opportunities for future medical domain research, paving the way for continued innovation and application in this rapidly evolving field. | Computation and Language (cs.CL) | There are some mistakes in introducing medical language question answering Models and medical multimodal question answering models, such as their dataset should be displayed for pretraining | factual/methodological/other critical errors in manuscript | 13,876 |
2401.08441v2 | On the Gaussian Moat Problem | The Gaussian Moat Problem asks whether it is possible to walk from the origin to infinity in the complex plane using only Gaussian primes as stepstones and steps of bounded length. We prove that this is not possible. | Number Theory (math.NT) | The width of the moat was not correctly computed | factual/methodological/other critical errors in manuscript | 13,879 |
2401.09495v2 | IPR-NeRF: Ownership Verification meets Neural Radiance Field | Neural Radiance Field (NeRF) models have gained significant attention in the computer vision community in the recent past with state-of-the-art visual quality and produced impressive demonstrations. Since then, technopreneurs have sought to leverage NeRF models into a profitable business. Therefore, NeRF models make it worth the risk of plagiarizers illegally copying, re-distributing, or misusing those models. This paper proposes a comprehensive intellectual property (IP) protection framework for the NeRF model in both black-box and white-box settings, namely IPR-NeRF. In the black-box setting, a diffusion-based solution is introduced to embed and extract the watermark via a two-stage optimization process. In the white-box setting, a designated digital signature is embedded into the weights of the NeRF model by adopting the sign loss objective. Our extensive experiments demonstrate that not only does our approach maintain the fidelity (\ie, the rendering quality) of IPR-NeRF models, but it is also robust against both ambiguity and removal attacks compared to prior arts. | Computer Vision and Pattern Recognition (cs.CV) | Error on the paper | factual/methodological/other critical errors in manuscript | 13,884 |
2401.09543v2 | Token Jumping in Planar Graphs has Linear Sized Kernels | Let $G$ be a planar graph and $I_s$ and $I_t$ be two independent sets in $G$, each of size $k$. We begin with a "token" on each vertex of $I_s$ and seek to move all tokens to $I_t$, by repeated "token jumping", removing a single token from one vertex and placing it on another vertex. We require that each intermediate arrangement of tokens again specifies an independent set of size $k$. Given $G$, $I_s$, and $I_t$, we ask whether there exists a sequence of token jumps that transforms $I_s$ to $I_t$. When $k$ is part of the input, this problem is known to be PSPACE-complete. However, it was shown by Ito, Kamiński, and Ono to be fixed-parameter tractable. That is, when $k$ is fixed, the problem can be solved in time polynomial in the order of $G$. Here we strengthen the upper bound on the running time in terms of $k$ by showing that the problem has a kernel of size linear in $k$. More precisely, we transform an arbitrary input problem on a planar graph into an equivalent problem on a (planar) graph with order $O(k)$. | Discrete Mathematics (cs.DM) | There is an error in the proof of Claim 7. This general approach can be salvaged to give a kernel that is quadratic in k (rather than linear). This has been done, with two coauthors, in the more general context of graphs on arbitrary surfaces in arXiv:2408.04743 [cs.DS] | factual/methodological/other critical errors in manuscript | 13,885 |
2401.10519v2 | A Wind-Aware Path Planning Method for UAV-Asisted Bridge Inspection | In response to the gap in considering wind conditions in the bridge inspection using unmanned aerial vehicle (UAV) , this paper proposes a path planning method for UAVs that takes into account the influence of wind, based on the simulated annealing algorithm. The algorithm considers the wind factors, including the influence of different wind speeds and directions at the same time on the path planning of the UAV. Firstly, An environment model is constructed specifically for UAV bridge inspection, taking into account the various objective functions and constraint conditions of UAVs. A more sophisticated and precise mathematical model is then developed based on this environmental model to enable efficient and effective UAV path planning. Secondly, the bridge separation planning model is applied in a novel way, and a series of parameters are simulated, including the adjustment of the initial temperature value. The experimental results demonstrate that, compared with traditional local search algorithms, the proposed method achieves a cost reduction of 30.05\% and significantly improves effectiveness. Compared to path planning methods that do not consider wind factors, the proposed approach yields more realistic and practical results for UAV applications, as demonstrated by its improved effectiveness in simulations. These findings highlight the value of our method in facilitating more accurate and efficient UAV path planning in wind-prone environments. | Systems and Control (eess.SY) | After carefully analysis, there is a bit design flaws in Algorithm 1. The experimental work of the paper is not comprehensive,which lacks an evaluation of the algorithm's running time | factual/methodological/other critical errors in manuscript | 13,888 |
2401.10747v2 | Multimodal Sentiment Analysis with Missing Modality: A Knowledge-Transfer Approach | Multimodal sentiment analysis aims to identify the emotions expressed by individuals through visual, language, and acoustic cues. However, most of the existing research efforts assume that all modalities are available during both training and testing, making their algorithms susceptible to the missing modality scenario. In this paper, we propose a novel knowledge-transfer network to translate between different modalities to reconstruct the missing audio modalities. Moreover, we develop a cross-modality attention mechanism to retain the maximal information of the reconstructed and observed modalities for sentiment prediction. Extensive experiments on three publicly available datasets demonstrate significant improvements over baselines and achieve comparable results to the previous methods with complete multi-modality supervision. | Sound (cs.SD) | I request to withdraw my paper due to the discovery of significant errors in the manuscript that affect the validity of the experimental results. These errors necessitate a substantial revision, and the current version should not be used or cited in its present form | factual/methodological/other critical errors in manuscript | 13,890 |
2401.12516v2 | Conservation Principles in AQUAL | We consider conservation of momentum in AQUAL, a field-theoretic extension to Modified Newtonian Dynamics (MOND). We show that while there is a sense in which momentum is conserved, it is only if momentum is attributed to the gravitational field, and thus Newton's third law fails as usually understood. We contrast this situation with that of Newtonian gravitation on a field theoretic formulation. We then briefly discuss the situation in TeVeS, a relativistic theory that has AQUAL as a classical limit. | History and Philosophy of Physics (physics.hist-ph) | We have become aware of a serious error in the arguments of section III.B. This error is such that the main claim of that section does not follow. Since these arguments are integral to the thesis of the manuscript, we withdraw the manuscript at this time while working on corrections. The authors are grateful to [REDACTED-NAME] for kindly pointing out the error | factual/methodological/other critical errors in manuscript | 13,892 |
2401.12648v3 | Consistency Enhancement-Based Deep Multiview Clustering via Contrastive Learning | Multiview clustering (MVC) segregates data samples into meaningful clusters by synthesizing information across multiple views. Moreover, deep learning-based methods have demonstrated their strong feature learning capabilities in MVC scenarios. However, effectively generalizing feature representations while maintaining consistency is still an intractable problem. In addition, most existing deep clustering methods based on contrastive learning overlook the consistency of the clustering representations during the clustering process. In this paper, we show how the above problems can be overcome and propose a consistent enhancement-based deep MVC method via contrastive learning (CCEC). Specifically, semantic connection blocks are incorporated into a feature representation to preserve the consistent information among multiple views. Furthermore, the representation process for clustering is enhanced through spectral clustering, and the consistency across multiple views is improved. Experiments conducted on five datasets demonstrate the effectiveness and superiority of our method in comparison with the state-of-the-art (SOTA) methods. The code for this method can be accessed at this https URL . | Machine Learning (cs.LG) | There are multiple errors that need to be corrected, including some formulas and concept descriptions. We will re upload the paper after the modifications are completed | factual/methodological/other critical errors in manuscript | 13,893 |
2401.13321v2 | Temperature Compensation Method of Fluxgate Sensor Based on Polynomial Fitting | Fluxgate sensors are widely used in the field of low frequency and weak vector magnetic field measurement because of their good performance, such as high resolution and low power consumption. However, during the long-term continuous observation, the drift errors of the fluxgate sensor will occur due to the variable ambient temperature. This paper proposes a temperature compensation method for fluxgate sensors based on polynomial fitting. First, a physical model of the temperature & fluxgate sensor was established on the COMSOL Multiphysics simulation platform, and the influence of temperature on the measurement performance of the fluxgate sensor was analyzed. Second, according to the existing temperature-magnetic field data, a temperature compensation model of the fluxgate sensor was constructed. And compared it with other temperature compensation method, the result shows that the proposed temperature compensation method is relatively simple and can better achieve real-time compensation for sensor application scenarios. Finally, to verify the effectiveness of the proposed method, numerous laboratory experiments were implemented. The temperature drift is reduced from more than 500 nT before compensation to about 1 nT. The results show that the proposed method has a good temperature compensation effect on the data measured by the fluxgate sensor within a variable temperature background. | Instrumentation and Detectors (physics.ins-det) | An error occurred in the model section | factual/methodological/other critical errors in manuscript | 13,899 |
2401.13487v3 | Reversible out-of-plane to in-plane magnetic transition by electrical and thermal cycling in Ni$_{90}$Fe$_{10}$/BaTiO$_3$(001) | The study investigates the manipulation of the magnetic anisotropy in a thick (1 $\mu$m) Ni$_{90}$Fe$_{10}$ layer electrodeposited on a ferroelectric BaTiO$_3$(001) substrate, using a combination of Magneto-optical Kerr Effect, Photoemission Electron Microscopy with X-ray circular magnetic dichroism and X-ray diffraction. In the as-grown state, the system shows weak perpendicular magnetic anisotropy and characteristic stripe domains. Upon out-of-plane electrical poling of the BaTiO$_3$ substrate, the magnetic anisotropy switches to in-plane with a strong uniaxial behavior. This change is ascribed to the magnetoelastic effect due to the switching of the BaTiO$_3$ ferroelectric [001] axis into the sample plane, as evidenced by XRD. The strong mechanical interaction with the thick Ni$_{90}$Fe$_{10}$ overlayer prevents the full inversion of the substrate. The perpendicular magnetic anisotropy can be recovered by a mild thermal annealing above the BaTiO$_3$ tetrahedral to cubic phase transition and can be cycled by repeated electrical poling/thermal annealing. This method opens the path to a reversible control of the magnetic anisotropy in Ni$_{90}$Fe$_{10}$/BaTiO$_3$ heterostructures from perpendicular to in-plane. | Materials Science (cond-mat.mtrl-sci) | Possibly an erroneous interpretation of the data | factual/methodological/other critical errors in manuscript | 13,900 |
2401.14182v2 | Harnack inequalities for kinetic integral equations | We deal with a wide class of kinetic equations, $$ \big[ \partial_t + v\cdot\nabla_x\big] f = \mathcal{L}_v f. $$ Above, the diffusion term $\mathcal{L}_v$ is an integro-differential operator, whose nonnegative kernel is of fractional order $s\in(0,1)$ having merely measurable coefficients. Amongst other results, we are able to prove that nonnegative weak solutions $f$ do satisfy $$ \sup_{Q^-} f \ \leq \ c\inf_{Q^+} f, $$ where $Q^{\pm}$ are suitable slanted cylinders. No a-priori boundedness is assumed, as usually in the literature, since we are also able to prove a general interpolation inequality in turn giving local boundedness which is valid even for weak subsolutions with no sign assumptions. To our knowledge, this is the very first time that a strong Harnack inequality is proven for kinetic integro-differential-type equations. A new independent result, a Besicovitch-type covering argument for very general kinetic geometries, is also stated and proved. | Analysis of PDEs (math.AP) | The last part of the proof of the strong Harnack result is incorrect, because of estimate (7.9) on Page 37. For this, a strong Harnack inequality cannot be deduced in such a framework, as indeed pointed out by Kassmann and Weidner in their paper arXiv:2405.05223 | factual/methodological/other critical errors in manuscript | 13,905 |
2401.14245v3 | Counting rational points in non-singular curves | In this paper, we will give a uniform upper bound of the number of rational points of bounded height in non-singular curves by applying the global determinant method. | Number Theory (math.NT) | An unrepairable mistake is found | factual/methodological/other critical errors in manuscript | 13,906 |
2401.14251v2 | On quasi-local angular momentum and the construction of axial vector fields | A method is introduced which, for the first time, allows us to construct axial vector fields without which formal definitions of quasi-local angular momentum, in general, would remain empty. The introduced method is practical, it can be used to construct all such axial vector fields, and it allows the quasi-local angular momentum to be represented by a triple vector in three-dimensional Euclidean space. We also derive balance relations which allow us to monitor the variation of the magnitude and direction of this vector, and also to monitor the angular momentum transports in generic spacetimes without symmetries. | General Relativity and Quantum Cosmology (gr-qc) | The suggested angular momentum expression is gauge-dependent | factual/methodological/other critical errors in manuscript | 13,907 |
2401.15100v2 | Symmetry and classification of solutions to an integral equation in the Heisenberg group $\mathbb{H}^n$ | In this paper we prove symmetry of nonnegative solutions of the integral equation \[ u (\zeta ) = \int\limits_{{\mathbb H}^n} |\zeta^{-1} \xi|^{-(Q-\alpha)} u(\xi)^{p} d\xi \quad 1< p \leq \frac{Q+\alpha}{Q-\alpha},\quad 0< \alpha <Q \] on the Heisenberg group ${\mathbb H}^n = {\mathbb C}^n \times {\mathbb R}$, $Q= 2n +2$ using the moving plane method and the Hardy-Littlewood-Sobolev inequality proved by Frank and Lieb for the Heisenberg group. For $p$ subcritical, i.e., $1< p < \frac{Q+\alpha}{Q-\alpha}$ we show nonexistence of positive solution of this integral equation, while for the critical case, $p = \frac{Q+\alpha}{Q-\alpha}$ we prove that the solutions are cylindrical and are unique upto Heisenberg translation and suitable scaling of the function \[ u_0 (z,t) = \left( (1+ |z|^2)^2 + t^2 \right)^{- \frac{Q-\alpha}{4}} \quad (z,t ) \in {\mathbb H}^n. \] As a consequence, we also obtain the symmetry and classification of nonnegative $C^2$ solution of the equation \[ \Delta_{\mathbb H} u + u^{p} = 0 \quad \mbox{for } 1< p \leq \frac{Q+\alpha}{Q-\alpha} \mbox{ in } {\mathbb H}^n \] without any partial symmetry assumption on the function $u$. | Differential Geometry (math.DG) | Errors in the proof | factual/methodological/other critical errors in manuscript | 13,910 |
2401.15613v2 | Towards Arbitrary-Scale Histopathology Image Super-resolution: An Efficient Dual-branch Framework via Implicit Self-texture Enhancement | High-quality whole-slide scanners are expensive, complex, and time-consuming, thus limiting the acquisition and utilization of high-resolution pathology whole-slide images in daily clinical work. Deep learning-based single-image super-resolution techniques are an effective way to solve this problem by synthesizing high-resolution images from low-resolution ones. However, the existing super-resolution models applied in pathology images can only work in fixed integer magnifications, significantly decreasing their applicability. Though methods based on implicit neural representation have shown promising results in arbitrary-scale super-resolution of natural images, applying them directly to pathology images is inadequate because they have unique fine-grained image textures different from natural images. Thus, we propose an Implicit Self-Texture Enhancement-based dual-branch framework (ISTE) for arbitrary-scale super-resolution of pathology images to address this challenge. ISTE contains a pixel learning branch and a texture learning branch, which first learn pixel features and texture features, respectively. Then, we design a two-stage texture enhancement strategy to fuse the features from the two branches to obtain the super-resolution results, where the first stage is feature-based texture enhancement, and the second stage is spatial-domain-based texture enhancement. Extensive experiments on three public datasets show that ISTE outperforms existing fixed-scale and arbitrary-scale algorithms at multiple magnifications and helps to improve downstream task performance. To the best of our knowledge, this is the first work to achieve arbitrary-scale super-resolution in pathology images. Codes will be available. | Image and Video Processing (eess.IV) | The previously submitted version of the paper had some errors | factual/methodological/other critical errors in manuscript | 13,913 |
2401.15857v3 | Leadership Dynamics in Social Multiplex Networks with Mono and Bi-directional Interactions | We explored the dynamics of opinions within a multiplex network, where agents engage in one-way or two-way communication, and the network may have a designated leader. Additionally, we demonstrated that, under specific conditions, opinions tend to converge despite non-positive diagonal elements in transition probability matrices or decomposable layers. Lastly, we contrasted the convergence rates of opinion dynamics in networks with one-way interactions against those with two-way interactions, revealing that one-way interactions may facilitate faster convergence outcomes. Additionally, we shed light on the pivotal role of designated leaders in steering opinion convergence within the network. | Systems and Control (eess.SY) | This submission has not been submitted to any conference or journal. There are serious technical problems in the submission which is being revised and the replacement is a going to be completely different from the previous versions. In addition, there are new contributors who are not ok for the previous versions to be shown | factual/methodological/other critical errors in manuscript | 13,914 |
2401.16116v4 | Quantum Cheques | Publicly-verifiable quantum money has been a central and challenging goal in quantum cryptography. To this day, no constructions exist based on standard assumptions. In this study, we propose an alternative notion called quantum cheques (QCs) that is more attainable and technologically feasible. A quantum cheque can be verified using a public-key but only by a single user. Specifically, the payer signs the quantum cheque for a particular recipient using their ID, and the recipient can validate it without the assistance of the bank, ensuring that the payer cannot assign the same cheque to another user with a different ID. Unlike quantum money, QCs only necessitate quantum communication when a cheque is issued by the bank, meaning all payments and deposits are entirely classical! We demonstrate how to construct QCs based on the well-studied learning-with-errors (LWE) assumption. In the process, we build two novel primitives which are of independent interest. Firstly, we construct signatures with publicly-verifiable deletion under LWE. This primitive enables the signing of a message $m$ such that the recipient can produce a classical string that publicly proves the inability to reproduce a signature of $m$. We then demonstrate how this primitive can be used to construct 2-message signature tokens. This primitive enables the production of a token that can be used to sign a single bit and then self-destructs. Finally, we show that 2-message signature tokens can be used to construct QCs. | Quantum Physics (quant-ph) | Construction 1 is insecure which is the building block for the rest of the paper. Therefore, we decided to withdraw it | factual/methodological/other critical errors in manuscript | 13,915 |
2401.16135v2 | The Bishop-Phelps-Bollobas property for certain Banach spaces | Let $X$ be a complex Banach space. We prove that if $L$ is an extremally disconnected compact Hausdorff topological space, then the pair $(X, C(L))$ satisfies the Bishop-Phelps-Bollobás property (BPBp for short). As a byproduct, we obtain the BPBp for the pair $(X, L^\infty(\nu))$ for any measure $\nu$. In particular, this settles an unresolved question regarding the BPBp for the pair $(L^\infty(\mu), L^\infty(\nu) )$ for any two measures $\mu$ and $\nu$. Finally, we show that $(X,H^\infty(\Omega)$ has the BPBp when $\Omega$ is a multi-connected planar domain bounded by finitely many disjoint analytic simple closed curves. | Functional Analysis (math.FA) | There is an error in Lemma 3.1. So we withdraw the paper | factual/methodological/other critical errors in manuscript | 13,916 |
2401.16191v2 | From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg | As an alternative to previously existing planar graph product structure theorems, we prove that every planar graph $G$ is a subgraph of the strong product of $K_2$, a path and a planar subgraph of a $4$-tree. As an application, we show that the queue number of planar graphs is at most $38$ whereas the queue number of planar bipartite graphs is at most $25$. | Discrete Mathematics (cs.DM) | The presented decomposition technique (Theorems 1.2/1.3) has been already independently shown by T. Ueckerdt, D.R. Wood, W. Yi (this https URL a circumstance that I missed due to the result not being advertised in the corresponding abstract. Moreover, Lemma 4.2 is wrong, thus new technical details are necessary. I would like to thank [REDACTED-NAME] for pointing this out | factual/methodological/other critical errors in manuscript | 13,918 |
2401.17112v2 | On the Mod-6 Town Rules | This note presents an upper bound of $1.252 n$ on the size of a set system that satisfies the mod-6 town rules. Under these rules the sizes of the sets are not congruent to $0\bmod 6$ while the sizes of all pairwise intersections are congruent to $ 0\bmod 6$. | Combinatorics (math.CO) | Bug. Lemma 1 is incorrect. The lemma needs the sets to be closed under subtraction which they are not | factual/methodological/other critical errors in manuscript | 13,922 |
2402.01549v2 | Quantum advantage in zero-error function computation with side information | We consider the problem of zero-error function computation with side information. Alice has a source $X$ and Bob has correlated source $Y$ and they can communicate via either classical or a quantum channel. Bob wants to calculate $f(X,Y)$ with zero error. We aim to characterize the minimum amount of information that Alice needs to send to Bob for this to happen with zero-error. In the classical setting, this quantity depends on the asymptotic growth of $\chi(G^{(m)})$, the chromatic number of an appropriately defined $m$-instance "confusion graph". In this work we present structural characterizations of $G^{(m)}$ and demonstrate two function computation scenarios that have the same single-instance confusion graph. However, in one case there a strict advantage in using quantum transmission as against classical transmission, whereas there is no such advantage in the other case. | Information Theory (cs.IT) | We have realized an error in Claim 3 | factual/methodological/other critical errors in manuscript | 13,929 |
2402.02752v2 | Fast single pixel modal wavefront sensing using neural networks | Dynamic wavefront aberrations negatively impact a wide range of optical applications including astronomy, optical free-space telecommunications and bio-imaging. Wavefront errors can be compensated by an adaptive optics system comprised of a deformable mirror and wavefront sensor connected by a control loop. For satellite optical communications (SatCom), wavefront sensing is particularly challenging due to the rapid wavefront fluctuations induced by strong turbulence and movement of the transmitting satellite across the sky. Existing wavefront sensing techniques require fast cameras (>kHz) that are not widely available at wavelengths suitable for SatCom (e.g., 1550nm and mid-to-long wave infrared). Here, we propose a new wavefront sensing technique that uses a single photodiode and a fast mirror to make phase-diverse intensity measurements of the incoming wavefront. We train neural networks to accurately estimate the input phase given this phase-diverse sub-millisecond intensity trace. Our simulations show that our technique is robust in cases of strong turbulence where previous modal wavefront sensors fail due to modal crosstalk, achieving 99% of the optimal Strehl ratio from a 50-mode correction at a sensing rate of 2kHz. We explore typical cases of turbulence magnitude, sensing speed and noise that might be encountered by such a system. | Optics (physics.optics) | We discovered issues with the training data that biased the results in this manuscript. This work is being updated and a revised manuscript will be posted at a later date | factual/methodological/other critical errors in manuscript | 13,933 |
2402.02974v2 | Appearance of neutrino asymmetries in the process of expansion of the Universe, hierarchy of neutrino masses and CP violation | In this work, we study the appearance of neutrino asymmetries during the expansion of the Universe. A mathematical model based on differential equations was used to describe the processes of neutrino oscillations considering CP violation and neutrino collisions. An analysis of the emergence of neutrino asymmetry due to collisions of neutrinos with each other and due to CP violation during neutrino oscillations is presented. It was discovered that the asymmetry bifurcates into two states with positive and negative asymmetry for the inverse hierarchy of neutrino masses. A state with a normal hierarchy of neutrino masses is unstable and is not realized. It is shown that the maximum CP violation is realized. The influence of this process on the dispersion of the primordial $^4\text{He}$ mass fraction is calculated, which is confirmed by astrophysical observations. Thus, the inverse hierarchy of neutrino masses is realized. The CP violation in neutrino oscillations is maximum and the phase is $\delta_{13}=270^\circ (-\pi/2)$ | High Energy Physics - Phenomenology (hep-ph) | An error was discovered in the calculations when estimating the collision frequency for various types of neutrinos. It turned out that the same coefficient value was used in an uncontrolled manner, which is correct only for electron neutrinos | factual/methodological/other critical errors in manuscript | 13,935 |
2402.03817v2 | Improvement of Frequency Source Phase Noise Reduction Design under Vibration Condition | Reasonable vibration reduction design is an important way to achieve low phase noise index of airborne frequency source output signal. Aiming at the problem of phase noise deterioration of an airborne frequency source under random condition, this paper proposes to improve the vibration reduction mode crystal oscillator and reduce the distance between the barycenter of frequency source and crystal oscillator vibration based on the analysis of the relationship between the frequency source and the phase noise of output signal. Experimental results show that the active noise control system achieves 62dB phase noise compensation under the random vibration of 0.04-0.1g*g/Hz amplitude range and 5-2000 Hz frequency range. | Systems and Control (eess.SY) | There are many errors. this http URL. 2 [REDACTED-NAME] of [REDACTED-NAME] Circuit is not correct. 2.C-band C1 signal 6000MHz continuous wave signal is error. this http URL. 4 [REDACTED-NAME] [REDACTED-NAME] and Spectrum of 2400MHz before Improvement is error. this http URL 1 [REDACTED-NAME] [REDACTED-NAME] at each [REDACTED-NAME] of the Output of the [REDACTED-NAME] before Improvement is error. 5. Frequency range is error | factual/methodological/other critical errors in manuscript | 13,937 |
2402.04633v2 | A stability result for Riemannian foliations | We show that a Riemannian foliation F on a compact manifold M is stable, provided that the cohomology group H^1(F,NF) vanishes. Stability means that any foliation on M close enough to F is conjugate to F by means of a diffeomorphism. | Differential Geometry (math.DG) | An auxiliary result (Theorem 2.4) turns out to be wrong. This invalidates the proof of the main result | factual/methodological/other critical errors in manuscript | 13,941 |
2402.05504v2 | Friendship theorem: A combinatorial proof | We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction. | Combinatorics (math.CO) | This short proof is flawed. The result (which is a well known theorem) is still true. Please ignore the paper | factual/methodological/other critical errors in manuscript | 13,943 |
2402.07001v2 | Dimension of equilibrium measures for complex maps | For certain families of complex maps, we give a formula for the Hausdorff dimension of the equilibrium measure. In particular, given an endomorphism $f$ of $\mathbb C\mathbb P^k$ of algebraic degree $d \ge2$, and given the equilibrium measure $\mu$ with Lyapunov exponents $\chi_1\geq \ldots\geq \chi_k$, we show $\dim_\mathrm{H}(\mu) = \log d\sum_{i\leq k}\frac{1}{\chi_i}$ where $\dim_\mathrm{H}(\mu)$ is the Hausdorff dimension of the measure $\mu$. This gives an answer to the question of Fornæss and Sibony, and proves the Binder-DeMarco Conjecture. | Dynamical Systems (math.DS) | We found a gap in the proof of one of the lemmas, on which we are working to fix | factual/methodological/other critical errors in manuscript | 13,949 |
2402.10285v2 | The affect of Some Meteorological Parameters on Particulate Matters Concentration Over Iraq using Remote Sensing dataset | Numerous countries have built urban stations for monitoring the amount of PM2.5 in the atmosphere. In Iraq, there aren't enough stations to monitor PM2.5 pollution levels across all governorates. As a result, satellite remote sensing data is used in the majority of studies aimed at monitoring PM2.5 and the impact of other factors on it. The current study aimed to analyze the spatial and temporal distribution of (PM2.5) and its relationship with the meteorological parameters.(Air temperature, Relative humidity, Precipitation and wind speed) in Iraq during two periods (2001 and 2022). The dataset adopted in the study were downloaded from the Giovanni user interface which is based on satellite remote sensing data and reanalysis by MERRA-2model which produce by NASA. The output results shows that, the seasonal and annual PM2.5 concentration values increased from 2001 to 2022 due especially in the center and south of Iraq with the highest values of PM2.5 concentration recorded in the summers of 2001 and 2022 being 172.41 micro.g/m3 and 190.06 micro.g/m3 (increased 10.24%), respectively. Because of the low average temperature and the influence of northeasterly winds bringing continental air from Central Asia, PM2.5 values in northern and northeastern Iraq are lower than those in the center and southern regions. in 2001, they ranged from 8.41 to 12.6 micro.g/m3, whereas in 2022, they ranged from 9.02 to 15.98 micro.g/m3 throughout the year. Rainfall during the cold months in the north and northeast is an essential factor in cleaning the air of PM2.5. Also, study results indicate that the max. of PM 2.5 values have consistently exceeded the upper limits of PM2.5 quarterly standards set by both the US and Iraqi regulations, for the years 2001 and 2022, but the min. PM2.5 values are within both standards. | Atmospheric and Oceanic Physics (physics.ao-ph) | there are a scientific errors in the result and discussion related to climate in the west and east of Iraq | factual/methodological/other critical errors in manuscript | 13,952 |
2402.10307v2 | A New Radio to Overcome Critical Link Budgets | We propose Multi-Antenna (MA) Towards Inband Shift Keying (TISK): a new multi-carrier radio concept to cope with critical link budgets. In contrast to common proposals that rely on analog beamforming at both transmitter and receiver, MA-TISK does not require beam alignment. The transmitted signals have all constant envelope in continuous time, which allows for efficient, low-cost power amplification and up-conversion. The concept is compatible with any linear PSK-modulation as well as pulse position modulation. Each sub-carrier is sent over a separate antenna that is equipped with a voltage-controlled oscillator. The phases of these oscillators are controlled by digital baseband. Temporal signal combining makes up for the lack of beamforming gain at the transmitter. A common message may be broadcast to many receivers, simultaneously. Demodulation can be efficiently implemented by means of fast Fourier transform. MA-TISK does not suffer from spectral re-growth issues plaguing other constant envelope modulations like GMSK. Almost rectangular signal spectra similar to those for linear modulation with root-raised-cosine pulse shaping are possible. For the 100 MHz-wide spectral mask of 5G downlink, QPSK-modulation allows for 160 MBit/s with 5.74 MHz subcarrier spacing when using 16 transmit antennas. The wide carrier spacing makes the signals insensitive to Doppler effects. There is no loss in link budget gain compared to spatial beamforming at the transmitter. | Information Theory (cs.IT) | The paper is not correct. The paper calculates the beamforming gain of transmit beamforming for N antennas as N, but it should be N^2 | factual/methodological/other critical errors in manuscript | 13,953 |
2402.10318v2 | Multi-Antenna Towards Inband Shift Keying | Multi-antenna towards inband shift keying is a new continuous phase frequency shift keying that is particularly suited for multi-antenna communications when the link budget is critical. It combines the constant envelope of frequency modulation with low-rate repetition coding in order to make transmit beamforming dispensable. Although it is a frequency modulation, its transmit signal shows close to rectangular spectral shape. Similar to GSM's Gaussian minimum shift keying, it can be well approximated by linear modulation, when combined with differential precoding. This allows for easy coherent demodulation by means of a windowed fast Fourier transform. | Information Theory (cs.IT) | The paper is incorrect. It calculates the beamforming gain of transmit beamforming for N antennas as N, but it should be N^2 | factual/methodological/other critical errors in manuscript | 13,954 |
2402.11246v4 | Theory of the linewidth-power product of photonic-crystal surface-emitting lasers | A general theory for the intrinsic (Lorentzian) linewidth of photonic-crystal surface-emitting lasers (PCSELs) is presented. The effect of spontaneous emission is modeled by a classical Langevin force entering the equation for the slowly varying waves. The solution of the coupled-wave equations, describing the propagation of four basic waves within the plane of the photonic crystal, is expanded in terms of the solutions of the associated spectral problem, i.e. the laser modes. Expressions are given for photon number, rate of spontaneous emission into the laser mode, Petermann factor and effective Henry factor entering the general formula for the linewidth. The theoretical framework is applied to the calculation of the linewidth-power product of air-hole and all-semiconductor PCSELs. For output powers in the Watt range, intrinsic linewidths of a few tens of Hertz are predicted if stable single mode operation is ensured | Optics (physics.optics) | Error in numerical code detected. Calculated spectral linewidth product is too small. A corrected version will be published | factual/methodological/other critical errors in manuscript | 13,957 |
2402.11787v2 | Spherical two-distance sets and graph eigenvalues | Let $N_{\alpha,\beta}(d)$ denote the maximum size of a spherical two-distance set in $\mathbb{R}^d$ such that the inner products of distinct vectors only take $\alpha$ and $\beta$. By considering the correspondence between spherical two-distance sets and graphs with specific spectral properties, we determine $N_{\alpha,\beta}(d)$ for fixed $-1\leq\beta<0\leq\alpha<1$ and sufficiently large $d$, which extends the work in [Equiangular lines with a fixed angle, Ann. Math. 194 (2021) 729-743] and [Spherical two-distance sets and eigenvalues of signed graphs, Combinatorica 43 (2023) 203-232]. The limit $\lim_{d\rightarrow\infty}N_{\alpha,\beta}(d)/d$ is also derived from our work, that is, the problem of determining $\lim_{d\rightarrow\infty}N_{\alpha,\beta}(d)/d$ for any fixed $-1\leq\beta<0\leq\alpha<1$ is completely solved in the spherical $\{\alpha,\beta\}$-code setting. | Combinatorics (math.CO) | There are some errors in the proof of Theorem 5.3 (Page 16, line 5) | factual/methodological/other critical errors in manuscript | 13,958 |
2402.13809v2 | NeuralDiffuser: Controllable fMRI Reconstruction with Primary Visual Feature Guided Diffusion | Reconstructing visual stimuli from functional Magnetic Resonance Imaging (fMRI) based on Latent Diffusion Models (LDM) provides a fine-grained retrieval of the brain. A challenge persists in reconstructing a cohesive alignment of details (such as structure, background, texture, color, etc.). Moreover, LDMs would generate different image results even under the same conditions. For these, we first uncover the neuroscientific perspective of LDM-based methods that is top-down creation based on pre-trained knowledge from massive images but lack of detail-driven bottom-up perception resulting in unfaithful details. We propose NeuralDiffuser which introduces primary visual feature guidance to provide detail cues in the form of gradients, extending the bottom-up process for LDM-based methods to achieve faithful semantics and details. We also developed a novel guidance strategy to ensure the consistency of repeated reconstructions rather than a variety of results. We obtain the state-of-the-art performance of NeuralDiffuser on the Natural Senses Dataset (NSD), which offers more faithful details and consistent results. | Neural and Evolutionary Computing (cs.NE) | The implementation error lead to incorrect results in experiment | factual/methodological/other critical errors in manuscript | 13,961 |
2402.14546v2 | Algebraic description of complex conjugation on cohomology of a smooth projective hypersurface | We describe complex conjugation on the primitive middle-dimensional algebraic de Rham cohomology of a smooth projective hypersurface defined over a number field that admits a real embedding. We use Griffiths' description of the cohomology in terms of a Jacobian ring. The resulting description is algebraic up to transcendental factors explicitly given by certain periods. | Algebraic Geometry (math.AG) | The statement and proof of Theorem 2.3 is not correct. What was described in the paper is an order 2 operation which swaps the Hodge components, which gives the complex conjugation only when the Hodge component has dimensions 1. But our description does not give the complex conjugation in the general case where the Hodge component has a bigger dimension | factual/methodological/other critical errors in manuscript | 13,965 |
2402.15454v2 | Non-Markovian bath-induced coupling revealed by two-dimensional spectroscopy | Problems in the field of open quantum systems often involve an environment that greatly impacts excitation dynamics. Here we show that there can be coherent coupling between different system states of a form that only occurs in a non-Markovian treatment of the bath. Because this involves entangled system-bath states, we demonstrate that there are distinct signatures of this physics in simple absorption spectra and two-dimensional electronic spectroscopy. To do this we introduce a numerical method to simulate optical spectra of non-Markovian open quantum systems. The method employs a process tensor framework to efficiently compute multi-time correlation in a numerically exact way. | Quantum Physics (quant-ph) | Paper withdrawn due to an error in interpretation. The weak coupling master equation to which we compared neglected the Lamb shift, and including this the agreement between exact results and weak coupling master equations are better than reported | factual/methodological/other critical errors in manuscript | 13,968 |
2402.16847v2 | The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time | We study the fundamental scheduling problem $1\|\sum p_jU_j$. Given a set of $n$ jobs with processing times $p_j$ and deadlines $d_j$, the problem is to select a subset of jobs such that the total processing time is maximized without violating the deadlines. In the midst of a flourishing line of research, Fischer and Wennmann have recently devised the sought-after $\widetilde O(P)$-time algorithm, where $P = \sum p_j$ is the total processing time of all jobs. This running time is optimal as it matches conditional lower bounds based on popular conjectures. However, $P$ is not the sole parameter one could parameterize the running time by. Indeed, they explicitly leave open the question of whether a running time of $\widetilde O(n + \max d_j)$ or even $\widetilde O(n + \max p_j)$ is possible. In this work, we show, somewhat surprisingly, that by a refined implementation of their original algorithm, one can obtain the asked-for $\widetilde O(n + \max d_j)$-time algorithm. | Data Structures and Algorithms (cs.DS) | The runtime analysis is incorrect: the contribution of the processing times in [d_j - p_j, d_{j - 1}] is not taken into account. We thank N. Fischer for pointing this out | factual/methodological/other critical errors in manuscript | 13,970 |
2402.17012v4 | Pandora's White-Box: Precise Training Data Detection and Extraction in Large Language Models | In this paper we develop state-of-the-art privacy attacks against Large Language Models (LLMs), where an adversary with some access to the model tries to learn something about the underlying training data. Our headline results are new membership inference attacks (MIAs) against pretrained LLMs that perform hundreds of times better than baseline attacks, and a pipeline showing that over 50% (!) of the fine-tuning dataset can be extracted from a fine-tuned LLM in natural settings. We consider varying degrees of access to the underlying model, pretraining and fine-tuning data, and both MIAs and training data extraction. For pretraining data, we propose two new MIAs: a supervised neural network classifier that predicts training data membership on the basis of (dimensionality-reduced) model gradients, as well as a variant of this attack that only requires logit access to the model by leveraging recent model-stealing work on LLMs. To our knowledge this is the first MIA that explicitly incorporates model-stealing information. Both attacks outperform existing black-box baselines, and our supervised attack closes the gap between MIA attack success against LLMs and the strongest known attacks for other machine learning models. In fine-tuning, we find that a simple attack based on the ratio of the loss between the base and fine-tuned models is able to achieve near-perfect MIA performance; we then leverage our MIA to extract a large fraction of the fine-tuning dataset from fine-tuned Pythia and Llama models. Our code is available at this http URL . | Cryptography and Security (cs.CR) | Found software bug in experiments, withdrawing in order to address and update results | factual/methodological/other critical errors in manuscript | 13,971 |
2402.17539v2 | The optimizing mode classification stabilization of sampled stochastic jump systems via an improved hill-climbing algorithm based on Q-learning | This paper addresses the stabilization problem of stochastic jump systems (SJSs) closed by a generally sampled controller. Because of the controller's switching and state both sampled, it is challenging to study its stabilization. A new stabilizing method deeply depending on the mode classifications is proposed to deal with the above sampling situation, whose quantity is equal to a Stirling number of the second kind. For the sake of finding the best stabilization effect among all the classifications, a convex optimization problem is developed, whose globally solution is proved to be existent and can be computed by an augmented Lagrangian function. More importantly, in order to further reduce the computation complexity but retaining a better performance as much as possible, a novelly improved hill-climbing algorithm is established by applying the Q-learning technique to provide an optimal attenuation coefficient. A numerical example is offered so as to verify the effectiveness and superiority of the methods proposed in this study. | Optimization and Control (math.OC) | I want to withdraw it, because I find there are some important errors, but I cannot correct at the current moment | factual/methodological/other critical errors in manuscript | 13,975 |
2402.17632v2 | Securing OPEN-RAN Equipment Using Blockchain-Based Supply Chain Verification | The disaggregated and multi-vendor nature of OPEN-RAN networks introduces new supply chain security risks, making equipment authenticity and integrity crucial challenges. Robust solutions are needed to mitigate vulnerabilities in manufacturing and integration. This paper puts forth a novel blockchain-based approach to secure OPEN-RAN equipment through its lifecycle. By combining firmware authentication codes, a permissioned blockchain ledger, and equipment node validators, we architect a tamper-resistant ecosystem to track provenance. The outlined design, while conceptual, establishes a foundation and roadmap for future realization. Through careful implementation planning, development of core components like firmware signed hashes and smart contracts, and rigorous performance evaluation, this paper can evolve from concept to practice. There is a vivid potential to make OPEN-RAN supply chains corner to corner secure, igniting further research and real-world deployment. | Cryptography and Security (cs.CR) | It has technical ambiguity and error in the methodology section that needs more work and major revision | factual/methodological/other critical errors in manuscript | 13,976 |
2403.01085v2 | A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications | We revisit the algorithmic problem of finding a triangle in a graph: We give a randomized combinatorial algorithm for triangle detection in a given $n$-vertex graph with $m$ edges running in $O(n^{7/3})$ time, or alternatively in $O(m^{4/3})$ time. This may come as a surprise since it invalidates several conjectures in the literature. In particular, - the $O(n^{7/3})$ runtime surpasses the long-standing fastest algorithm for triangle detection based on matrix multiplication running in $O(n^\omega) = O(n^{2.372})$ time, due to Itai and Rodeh (1978). - the $O(m^{4/3})$ runtime surpasses the long-standing fastest algorithm for triangle detection in sparse graphs based on matrix multiplication running in $O(m^{2\omega/(\omega+1)})= O(m^{1.407})$ time due to Alon, Yuster, and Zwick (1997). - the $O(n^{7/3})$ time algorithm for triangle detection leads to a $O(n^{25/9} \log{n})$ time combinatorial algorithm for $n \times n$ Boolean matrix multiplication, by a reduction of V. V. Williams and R.~R.~Williams (2018).This invalidates a conjecture of A.~Abboud and V. V. Williams (FOCS 2014). - the $O(m^{4/3})$ runtime invalidates a conjecture of A.~Abboud and V. V. Williams (FOCS 2014) that any combinatorial algorithm for triangle detection requires $m^{3/2 - o(1)}$ time. - as a direct application of the triangle detection algorithm, we obtain a faster exact algorithm for the $k$-clique problem, surpassing an almost $40$ years old algorithm of Ne{š}et{ř}il and Poljak (1985). This result strongly disproves the combinatorial $k$-clique conjecture. - as another direct application of the triangle detection algorithm, we obtain a faster exact algorithm for the \textsc{Max-Cut} problem, surpassing an almost $20$ years old algorithm of R.~R.~Williams (2005). | Data Structures and Algorithms (cs.DS) | The triangle detection algorithm may fail. The analysis of Case 2.1 (in Subsection 2.1) is invalid. Thanks to [REDACTED-NAME] for pointing this out | factual/methodological/other critical errors in manuscript | 13,983 |
2403.01120v2 | Symmetry-breaking-dependent electronic structures and strain regulation in ReSeS monolayer | Electronic devices for information storages and processes can be further optimized by introducing the degree of freedom of anisotropy, which is strongly dependent of their structural symmetry. Herein, a ReSeS monolayer with asymmetrical double-faces are proposed to disclose the anisotropic electronic structure. Meanwhile infrared fingerprint based on the lattice vibration is also adopted to demonstrate the symmetry-breaking-dependent structural transformation. First-principles calculations demonstrate that the geometry deformation will induce the reconstruction of electronic structure. Ulteriorly, both the dynamic properties of carrier and spectroscopic response can be regulated by external strain and displays anisotropic behaviors. Our idea provides threads for designing new regulable optoelectronic devices. | Materials Science (cond-mat.mtrl-sci) | At present, the calculations and interpretations of defect properties, Raman spectroscopic properties, and electronic effective masses involved in this paper are unreliable | factual/methodological/other critical errors in manuscript | 13,984 |
2403.01184v2 | Controllable Subspaces in Structured Networks of Hierarchical Directed Acyclic Graphs: Controllability of Individual Nodes | Within the context of structured networks, this paper introduces the concept of the Fixed Strongly Structurally Controllable Subspace (FSSCS), enabling a comprehensive characterization of controllable subspaces. From a graph-theoretical viewpoint, the paper defines Fixed Strongly Structurally Controllable (FSSC) nodes based on the FSSCS concept and establishes the necessary and sufficient conditions for their identification. This paper proposes a method for determining the exact dimension of the Strongly Structurally Controllable Subspace (SSCS) in hierarchical directed acyclic graphs, employing a blend of graph-theoretical approaches and controllability matrix analyses. This approach not only facilitates the identification of FSSC nodes but also enhances our understanding of the robustness of node controllability against variations in network parameters within structured networks, marking a significant advancement in the field of strong structural controllability of individual nodes. | Algebraic Topology (math.AT) | The proofs of Lemma 1 and Theorem 3 have errors | factual/methodological/other critical errors in manuscript | 13,985 |
2403.01719v3 | Vortex formation and exotic superconducting states in field-cooled Sn-Pb solders | Formation of vortices is a typical phenomenon of type-II superconductors under magnetic fields (H). In contrast, type-I superconductors do not host vortices because of their Meissner state. As rare cases, vortices have been observed in intermediate states of type-I superconductors; in addition, the recent observation of type-II superconductivity with vortices in a (originally type-I) Pb crystal film at extremely low temperature (T) under H has opened new pathway to study vortex physics. However, thermodynamic characteristics of such type-II-like superconducting states with vortices in originally type-I element superconductors have not been detected because of the lack of bulk example. In this study, we investigated superconducting states of phase-separated Sn-Pb solders using specific heat and magnetization to reveal magnetic-flux-trapping mechanisms. Here, we show that Sn islands in the Sn-Pb solders exhibit type-II-like superconducting states with vortices when the solders host extremely high magnetic fluxes after field cooling. Furthermore, with increasing T, the amount of trapped flux decreases, and the driving force of the magnetic flux changes from type-II superconducting states of Sn to supercurrent of Pb regions surrounding the Sn islands. The field-cooled Sn-Pb solders are rich in physics of bulk vortex formation and anomalously enhanced supercurrent in element (originally type-I) superconductors. | Superconductivity (cond-mat.supr-con) | We found a problem on the analysis of specific heat data because of possible self-heating of the measured solders when flux reduction. We will resubmit the data after careful analyses | factual/methodological/other critical errors in manuscript | 13,988 |
2403.01937v3 | Examining the critical phenomenon of pion parton distribution: Insights from the Moment Problem | A recent study by Wang {\it et al.}( arXiv:2309.01417 ) proposed a novel connection between the nature of the parton distribution function (PDF) and the characteristics of its moments. In this study, we apply these findings to analyze the evolution of the pion valence quark PDF, garnering valuable qualitative insights. Firstly, we validate the non-negativity and continuity of the PDF across a wide range of scales, indicating the logical consistency of our chosen evolution scheme. Subsequently, we examine the unimodality of both the PDF and its transformed counterpart, the xPDF, i.e., the parton distribution function multiplied by the momentum fraction. We observe a smooth evolution of the peak position of the xPDF towards the small-$x$ region with increasing scale, while intriguingly, the PDF undergoes a phase of bimodal competition as the energy scale evolves. | High Energy Physics - Phenomenology (hep-ph) | The judgment made based on finite-order moments information about the distribution function (DF) is insufficient | factual/methodological/other critical errors in manuscript | 13,990 |
2403.02639v2 | False Positive Sampling-based Data Augmentation for Enhanced 3D Object Detection Accuracy | Recent studies have focused on enhancing the performance of 3D object detection models. Among various approaches, ground-truth sampling has been proposed as an augmentation technique to address the challenges posed by limited ground-truth data. However, an inherent issue with ground-truth sampling is its tendency to increase false positives. Therefore, this study aims to overcome the limitations of ground-truth sampling and improve the performance of 3D object detection models by developing a new augmentation technique called false-positive sampling. False-positive sampling involves retraining the model using point clouds that are identified as false positives in the model's predictions. We propose an algorithm that utilizes both ground-truth and false-positive sampling and an algorithm for building the false-positive sample database. Additionally, we analyze the principles behind the performance enhancement due to false-positive sampling and propose a technique that applies the concept of curriculum learning to the sampling strategy that encompasses both false-positive and ground-truth sampling techniques. Our experiments demonstrate that models utilizing false-positive sampling show a reduction in false positives and exhibit improved object detection performance. On the KITTI and Waymo Open datasets, models with false-positive sampling surpass the baseline models by a large margin. | Computer Vision and Pattern Recognition (cs.CV) | There was an error in the experiment settings | factual/methodological/other critical errors in manuscript | 13,994 |
2403.02902v2 | Demonstrating Mutual Reinforcement Effect through Information Flow | The Mutual Reinforcement Effect (MRE) investigates the synergistic relationship between word-level and text-level classifications in text classification tasks. It posits that the performance of both classification levels can be mutually enhanced. However, this mechanism has not been adequately demonstrated or explained in prior research. To address this gap, we employ information flow analysis to observe and substantiate the MRE theory. Our experiments on six MRE hybrid datasets revealed the presence of MRE in the model and its impact. Additionally, we conducted fine-tuning experiments, whose results were consistent with those of the information flow experiments. The convergence of findings from both experiments corroborates the existence of MRE. Furthermore, we extended the application of MRE to prompt learning, utilizing word-level information as a verbalizer to bolster the model's prediction of text-level classification labels. In our final experiment, the F1-score significantly surpassed the baseline in five out of six datasets, further validating the notion that word-level information enhances the language model's comprehension of the text as a whole. | Computation and Language (cs.CL) | The co-authors have requested that the manuscript be withdrawn. And the paper has major flaws | factual/methodological/other critical errors in manuscript | 13,997 |
2403.03655v3 | Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead | Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. As an introduced new transaction type, cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. Currently, there is a lack of a generic sharding consensus pattern that achieves both security and low overhead. In this paper, we present Kronos, a secure sharding blockchain consensus achieving optimized overhead. In particular, we propose a new secure sharding consensus pattern, based on a buffer managed jointly by shard members. Valid transactions are transferred to the payee via the buffer, while invalid ones are rejected through happy or unhappy paths. Kronos is proved to achieve security with atomicity under malicious clients with optimal intra-shard overhead $kB$ ($k$ for involved shard number and $B$ for a Byzantine fault tolerance (BFT) cost). Besides, we propose secure cross-shard certification methods based on batch certification and reliable cross-shard transfer. The former combines hybrid trees or vector commitments, while the latter integrates erasure coding. Handling $b$ transactions, Kronos is proved to achieve reliability with low cross-shard overhead $O(n b \lambda)$ ($n$ for shard size and $\lambda$ for the security parameter). Notably, Kronos imposes no restrictions on BFT and does not rely on time assumptions, offering optional constructions in various modules. We implement Kronos using two prominent BFT protocols: asynchronous Speeding Dumbo and partial synchronous Hotstuff. Extensive experiments demonstrate Kronos scales the consensus nodes to thousands, achieving a substantial throughput of 320 ktx/sec with 2.0 sec latency. Compared with the past solutions, Kronos outperforms, achieving up to a 12* improvement in throughput and a 50% reduction in latency. | Cryptography and Security (cs.CR) | The algorithms in Section 4 contain defects and inaccurate descriptions that require correction | factual/methodological/other critical errors in manuscript | 13,999 |
2403.03740v2 | Self-supervised Photographic Image Layout Representation Learning | In the domain of image layout representation learning, the critical process of translating image layouts into succinct vector forms is increasingly significant across diverse applications, such as image retrieval, manipulation, and generation. Most approaches in this area heavily rely on costly labeled datasets and notably lack in adapting their modeling and learning methods to the specific nuances of photographic image layouts. This shortfall makes the learning process for photographic image layouts suboptimal. In our research, we directly address these challenges. We innovate by defining basic layout primitives that encapsulate various levels of layout information and by mapping these, along with their interconnections, onto a heterogeneous graph structure. This graph is meticulously engineered to capture the intricate layout information within the pixel domain explicitly. Advancing further, we introduce novel pretext tasks coupled with customized loss functions, strategically designed for effective self-supervised learning of these layout graphs. Building on this foundation, we develop an autoencoder-based network architecture skilled in compressing these heterogeneous layout graphs into precise, dimensionally-reduced layout representations. Additionally, we introduce the LODB dataset, which features a broader range of layout categories and richer semantics, serving as a comprehensive benchmark for evaluating the effectiveness of layout representation learning methods. Our extensive experimentation on this dataset demonstrates the superior performance of our approach in the realm of photographic image layout representation learning. | Computer Vision and Pattern Recognition (cs.CV) | The authors of the paper believe that there is an error in the measurement of the F1 curve in the metrics description | factual/methodological/other critical errors in manuscript | 14,000 |
2403.04003v2 | The Maslov index, degenerate crossings and the stability of pulse solutions to the Swift-Hohenberg equation | In the scalar Swift-Hohenberg equation with quadratic-cubic nonlinearity, it is known that symmetric pulse solutions exist for certain parameter regions. In this paper we develop a method to determine the spectral stability of these solutions. We first associate a Maslov index to each solution and then argue that this index coincides with the number of unstable eigenvalues for the linearized evolution equation. This requires extending the method of computing the Maslov index introduced by Robbin and Salamon to so-called degenerate crossings. We extend their formulation of the Maslov index to degenerate crossings of general order. Furthermore, we develop a numerical method to compute the Maslov index associated to symmetric pulse solutions. Finally, we consider several solutions to the Swift-Hohenberg equation and use our method to characterize their stability. | Analysis of PDEs (math.AP) | There is a mistake in Remark 1.4, which affects the proof of Lemma 3.13 | factual/methodological/other critical errors in manuscript | 14,001 |
2403.05039v3 | Gain-Loss-Induced Bipolar Non-Hermitian Skin Effect With Purely Imaginary Eigenenergies | We study one-dimensional non-Hermitian lattices characterized by $\mathcal{PT}$-symmetric gain and loss, where the real-gap transforms into an imaginary-gap with increasing strength of gain/loss. The energy spectrum, under open boundary conditions, consists of real eigenenergies in the presence of $\mathcal{PT}$-symmetry, and the corresponding eigenstates are bulk modes. As the gain/loss is increased, $\mathcal{PT}$-symmetry breaks, leading to an increase in the proportion of imaginary eigenenergies and the appearance of bipolar Non-Hermitian skin effect (NHSE). Notably, the NHSE depending on the sign of their imaginary energy components. For Im$(E_{OBC})>(<)0$, the eigenstates localize at the right (left) boundary. These findings not only affirm the validity of our theoretical framework but also showcase the capability of engineered circuit systems to replicate intricate non-Hermitian phenomena. Our study unveils the unique characteristics of gain/loss-induced bipolar NHSE, shedding light on the exotic properties of non-Hermitian systems. | Applied Physics (physics.app-ph) | After further consideration and review, we've identified significant errors in our analysis that impact the conclusions of the paper. To ensure the integrity of the scientific record, we're withdrawing this submission for comprehensive revision. We plan to resubmit once these issues have been addressed. We appreciate the understanding of the community and apologize for any inconvenience | factual/methodological/other critical errors in manuscript | 14,003 |
2403.05347v2 | Attempting to Prove the Riemann Hypothesis through the Reflection Formula | The Riemann Hypothesis, originally proposed by the eminent mathematician Bernard Riemann in 1859, remains one of the most profound challenges in number theory. It posits that all non-trivial zeros of the Riemann zeta function {\zeta}(s) are concentrated precisely along the critical line where the real part equals 1/2. In this paper, our aim is to present an attempt to prove this conjecture. Our approach relies on the use of the reflection formula. By applying this tool with precision and insight, we can conclusively establish that {\xi}(s)^2 (Riemann's {\xi}-function) is valid only when Re(s)=1/2. As a direct consequence of this determination, we can assert that every zero of both {\xi}(s)^2 and {\xi}(s) has a real part equal to 1/2. This, in turn, leads us to the tentative conclusion that the real part of all non-trivial zeros of the zeta function is consistently 1/2. | General Mathematics (math.GM) | An expert from the Annals of Mathematics confirmed that proving the [REDACTED-NAME] using only the functional equation is not feasible. The expert referenced H. Davenport and H. Heilbronn's 1936 paper, "On the Zeros of [REDACTED-NAME] Series," which shows that functions can be constructed that meet the properties used in this paper but do not satisfy the [REDACTED-NAME] | factual/methodological/other critical errors in manuscript | 14,005 |
2403.06681v2 | Trustworthy Partial Label Learning with Out-of-distribution Detection | Partial Label Learning (PLL) grapples with learning from ambiguously labelled data, and it has been successfully applied in fields such as image recognition. Nevertheless, traditional PLL methods rely on the closed-world assumption, which can be limiting in open-world scenarios and negatively impact model performance and generalization. To tackle these challenges, our study introduces a novel method called PLL-OOD, which is the first to incorporate Out-of-Distribution (OOD) detection into the PLL framework. PLL-OOD significantly enhances model adaptability and accuracy by merging self-supervised learning with partial label loss and pioneering the Partial-Energy (PE) score for OOD detection. This approach improves data feature representation and effectively disambiguates candidate labels, using a dynamic label confidence matrix to refine predictions. The PE score, adjusted by label confidence, precisely identifies OOD instances, optimizing model training towards in-distribution data. This innovative method markedly boosts PLL model robustness and performance in open-world settings. To validate our approach, we conducted a comprehensive comparative experiment combining the existing state-of-the-art PLL model with multiple OOD scores on the CIFAR-10 and CIFAR-100 datasets with various OOD datasets. The results demonstrate that the proposed PLL-OOD framework is highly effective and effectiveness outperforms existing models, showcasing its superiority and effectiveness. | Computer Vision and Pattern Recognition (cs.CV) | There are many errors in the Abstract, Introduction, [REDACTED-NAME], [REDACTED-NAME], Experiment and References of this paper, which need to be further corrected to avoid misleading. Therefore, it needs to be withdrawn | factual/methodological/other critical errors in manuscript | 14,009 |
2403.06831v2 | HDRTransDC: High Dynamic Range Image Reconstruction with Transformer Deformation Convolution | High Dynamic Range (HDR) imaging aims to generate an artifact-free HDR image with realistic details by fusing multi-exposure Low Dynamic Range (LDR) images. Caused by large motion and severe under-/over-exposure among input LDR images, HDR imaging suffers from ghosting artifacts and fusion distortions. To address these critical issues, we propose an HDR Transformer Deformation Convolution (HDRTransDC) network to generate high-quality HDR images, which consists of the Transformer Deformable Convolution Alignment Module (TDCAM) and the Dynamic Weight Fusion Block (DWFB). To solve the ghosting artifacts, the proposed TDCAM extracts long-distance content similar to the reference feature in the entire non-reference features, which can accurately remove misalignment and fill the content occluded by moving objects. For the purpose of eliminating fusion distortions, we propose DWFB to spatially adaptively select useful information across frames to effectively fuse multi-exposed features. Extensive experiments show that our method quantitatively and qualitatively achieves state-of-the-art performance. | Computer Vision and Pattern Recognition (cs.CV) | We request to withdraw our manuscript due to identified issues: inaccuracies in the description of a submodule's composition, principles, and functionality in Section 3.2, and potential problems in metric calculation in Sections 4.2 and 4.3. To prevent the spread of misleading information, we believe it is necessary to temporarily withdraw the manuscript for further research and verification | factual/methodological/other critical errors in manuscript | 14,010 |
2403.07020v3 | Remarks on the integrabililty of the Lorenz System | In this work, we study the integrability, as well as the dynamics of the Lorenz System. This include a very useful identity:\[ \beta z^2(\sigma t)+y^2(\beta\sigma t)=\rho x^2(\beta t)+\nu e^{-2\beta\sigma t}, \]where $\nu\in\mathbb{R}$ is a constant. And we will see some applications of this identity. | Dynamical Systems (math.DS) | A lot of mathematical errors, decided to correct them and withdraw it now | factual/methodological/other critical errors in manuscript | 14,011 |
2403.07798v2 | A Fourier Transform Framework for Domain Adaptation | By using unsupervised domain adaptation (UDA), knowledge can be transferred from a label-rich source domain to a target domain that contains relevant information but lacks labels. Many existing UDA algorithms suffer from directly using raw images as input, resulting in models that overly focus on redundant information and exhibit poor generalization capability. To address this issue, we attempt to improve the performance of unsupervised domain adaptation by employing the Fourier method (FTF).Specifically, FTF is inspired by the amplitude of Fourier spectra, which primarily preserves low-level statistical information. In FTF, we effectively incorporate low-level information from the target domain into the source domain by fusing the amplitudes of both domains in the Fourier domain. Additionally, we observe that extracting features from batches of images can eliminate redundant information while retaining class-specific features relevant to the task. Building upon this observation, we apply the Fourier Transform at the data stream level for the first time. To further align multiple sources of data, we introduce the concept of correlation alignment. To evaluate the effectiveness of our FTF method, we conducted evaluations on four benchmark datasets for domain adaptation, including Office-31, Office-Home, ImageCLEF-DA, and Office-Caltech. Our results demonstrate superior performance. | Computer Vision and Pattern Recognition (cs.CV) | The paper contains significant errors and the experimental methodology is not rigorous. The experimental section and methodology need to be rewritten | factual/methodological/other critical errors in manuscript | 14,014 |
2403.09400v2 | ConDiSR: Contrastive Disentanglement and Style Regularization for Single Domain Generalization | Medical data often exhibits distribution shifts, which cause test-time performance degradation for deep learning models trained using standard supervised learning pipelines. This challenge is addressed in the field of Domain Generalization (DG) with the sub-field of Single Domain Generalization (SDG) being specifically interesting due to the privacy- or logistics-related issues often associated with medical data. Existing disentanglement-based SDG methods heavily rely on structural information embedded in segmentation masks, however classification labels do not provide such dense information. This work introduces a novel SDG method aimed at medical image classification that leverages channel-wise contrastive disentanglement. It is further enhanced with reconstruction-based style regularization to ensure extraction of distinct style and structure feature representations. We evaluate our method on the complex task of multicenter histopathology image classification, comparing it against state-of-the-art (SOTA) SDG baselines. Results demonstrate that our method surpasses the SOTA by a margin of 1% in average accuracy while also showing more stable performance. This study highlights the importance and challenges of exploring SDG frameworks in the context of the classification task. The code is publicly available at this https URL | Computer Vision and Pattern Recognition (cs.CV) | A flaw was found in the results acquisition | factual/methodological/other critical errors in manuscript | 14,018 |
2403.12708v2 | On the openness of the idempotent barycenter map related to a t-norm | We demonstrate that the idempotent barycenter map, associated with a t-norm $\ast$, is open if and only if the map of max-$\ast$ convex combination is open. As a corollary, we deduce that the idempotent barycenter map is open for spaces of idempotent measures associated with any t-norm $\ast$. Nevertheless, we illustrate that the characteristics of the idempotent barycenter map, in general, depend on the specific t-norm being employed. | General Topology (math.GN) | There are some mistakes. Lemma 3.2 is false | factual/methodological/other critical errors in manuscript | 14,026 |
2403.15082v3 | Cell Variational Information Bottleneck Network | In this work, we propose Cell Variational Information Bottleneck Network (cellVIB), a convolutional neural network using information bottleneck mechanism, which can be combined with the latest feedforward network architecture in an end-to-end training method. Our Cell Variational Information Bottleneck Network is constructed by stacking VIB cells, which generate feature maps with uncertainty. As layers going deeper, the regularization effect will gradually increase, instead of directly adding excessive regular constraints to the output layer of the model as in Deep VIB. Under each VIB cell, the feedforward process learns an independent mean term and an standard deviation term, and predicts the Gaussian distribution based on them. The feedback process is based on reparameterization trick for effective training. This work performs an extensive analysis on MNIST dataset to verify the effectiveness of each VIB cells, and provides an insightful analysis on how the VIB cells affect mutual information. Experiments conducted on CIFAR-10 also prove that our cellVIB is robust against noisy labels during training and against corrupted images during testing. Then, we validate our method on PACS dataset, whose results show that the VIB cells can significantly improve the generalization performance of the basic model. Finally, in a more complex representation learning task, face recognition, our network structure has also achieved very competitive results. | Computer Vision and Pattern Recognition (cs.CV) | Found errors in the article, therefore postponing publication for now | factual/methodological/other critical errors in manuscript | 14,031 |
2403.15603v2 | Forward Learning for Gradient-based Black-box Saliency Map Generation | Gradient-based saliency maps are widely used to explain deep neural network decisions. However, as models become deeper and more black-box, such as in closed-source APIs like ChatGPT, computing gradients become challenging, hindering conventional explanation methods. In this work, we introduce a novel unified framework for estimating gradients in black-box settings and generating saliency maps to interpret model decisions. We employ the likelihood ratio method to estimate output-to-input gradients and utilize them for saliency map generation. Additionally, we propose blockwise computation techniques to enhance estimation accuracy. Extensive experiments in black-box settings validate the effectiveness of our method, demonstrating accurate gradient estimation and explainability of generated saliency maps. Furthermore, we showcase the scalability of our approach by applying it to explain GPT-Vision, revealing the continued relevance of gradient-based explanation methods in the era of large, closed-source, and black-box models. | Computer Vision and Pattern Recognition (cs.CV) | The evaluation is based on small datasets and limited models, of which bias leads to misleading conclusions | factual/methodological/other critical errors in manuscript | 14,032 |
2403.17372v3 | An Empirical Study of Training ID-Agnostic Multi-modal Sequential Recommenders | Sequential Recommendation (SR) aims to predict future user-item interactions based on historical interactions. While many SR approaches concentrate on user IDs and item IDs, the human perception of the world through multi-modal signals, like text and images, has inspired researchers to delve into constructing SR from multi-modal information without using IDs. However, the complexity of multi-modal learning manifests in diverse feature extractors, fusion methods, and pre-trained models. Consequently, designing a simple and universal \textbf{M}ulti-\textbf{M}odal \textbf{S}equential \textbf{R}ecommendation (\textbf{MMSR}) framework remains a formidable challenge. We systematically summarize the existing multi-modal related SR methods and distill the essence into four core components: visual encoder, text encoder, multimodal fusion module, and sequential architecture. Along these dimensions, we dissect the model designs, and answer the following sub-questions: First, we explore how to construct MMSR from scratch, ensuring its performance either on par with or exceeds existing SR methods without complex techniques. Second, we examine if MMSR can benefit from existing multi-modal pre-training paradigms. Third, we assess MMSR's capability in tackling common challenges like cold start and domain transferring. Our experiment results across four real-world recommendation scenarios demonstrate the great potential ID-agnostic multi-modal sequential recommendation. Our framework can be found at: this https URL . | Information Retrieval (cs.IR) | A significant error in our methodology was discovered, which impacts the reliability of the findings. We are revising the study to correct these issues and will submit a corrected version in the future | factual/methodological/other critical errors in manuscript | 14,035 |
2403.17444v2 | Quantum accelerated cross regression algorithm for multiview feature extraction | Multi-view Feature Extraction (MvFE) has wide applications in machine learning, image processing and other fields. When dealing with massive high-dimensional data, the performance of classical computer faces severe challenges due to MvFE involves expensive matrix calculation. To address this challenge, a quantum-accelerated cross-regression algorithm for MvFE is proposed. The main contributions are as follows:(1) a quantum version algorithm for MvFE is proposed for the first time, filling the gap of quantum computing in the field of MvFE;(2) a quantum algorithm is designed to construct the block-encoding of the target data matrix, so that the optimal Hamiltonian simulation technology based on the block-encoding framework can be used to efficiently realize the quantum simulation of the target data matrix. This approach reduces the dependence of the algorithm's on simulation errors to enhance algorithm performance;(3) compared with the classical counterpart algorithm, the proposed quantum algorithm has a polynomial acceleration in the number of data points, the dimension of data points and the number of view data. | Quantum Physics (quant-ph) | The author found some flaws in the algorithm designed in this paper, and chose to withdraw the paper to correct these problems in order to maintain academic rigor | factual/methodological/other critical errors in manuscript | 14,036 |
2403.17489v2 | Adaptive Bayesian Structure Learning of DAGs With Non-conjugate Prior | Directed Acyclic Graphs (DAGs) are solid structures used to describe and infer the dependencies among variables in multivariate scenarios. Having a thorough comprehension of the accurate DAG-generating model is crucial for causal discovery and estimation. Our work suggests utilizing a non-conjugate prior for Gaussian DAG structure learning to enhance the posterior probability. We employ the idea of using the Bessel function to address the computational burden, providing faster MCMC computation compared to the use of conjugate priors. In addition, our proposal exhibits a greater rate of adaptation when compared to the conjugate prior, specifically for the inclusion of nodes in the DAG-generating model. Simulation studies demonstrate the superior accuracy of DAG learning, and we obtain the same maximum a posteriori and median probability model estimate for the AML data, using the non-conjugate prior. | Methodology (stat.ME) | The content is not correct and there are fundamental errors | factual/methodological/other critical errors in manuscript | 14,038 |
2403.17701v4 | Rotate to Scan: UNet-like Mamba with Triplet SSM Module for Medical Image Segmentation | Image segmentation holds a vital position in the realms of diagnosis and treatment within the medical domain. Traditional convolutional neural networks (CNNs) and Transformer models have made significant advancements in this realm, but they still encounter challenges because of limited receptive field or high computing complexity. Recently, State Space Models (SSMs), particularly Mamba and its variants, have demonstrated notable performance in the field of vision. However, their feature extraction methods may not be sufficiently effective and retain some redundant structures, leaving room for parameter reduction. Motivated by previous spatial and channel attention methods, we propose Triplet Mamba-UNet. The method leverages residual VSS Blocks to extract intensive contextual features, while Triplet SSM is employed to fuse features across spatial and channel dimensions. We conducted experiments on ISIC17, ISIC18, CVC-300, CVC-ClinicDB, Kvasir-SEG, CVC-ColonDB, and Kvasir-Instrument datasets, demonstrating the superior segmentation performance of our proposed TM-UNet. Additionally, compared to the previous VM-UNet, our model achieves a one-third reduction in parameters. | Image and Video Processing (eess.IV) | Experimental method encountered errors, undergoing experiment again | factual/methodological/other critical errors in manuscript | 14,040 |
2403.17704v2 | Prioritize Team Actions: Multi-Agent Temporal Logic Task Planning with Ordering Constraints | In this paper, we investigate the problem of linear temporal logic (LTL) path planning for multi-agent systems, introducing the new concept of \emph{ordering constraints}. Specifically, we consider a generic objective function that is defined for the path of each individual agent. The primary objective is to find a global plan for the team of agents, ensuring they collectively meet the specified LTL requirements. Simultaneously, we aim to maintain a pre-determined order in the values of the objective function for each agent, which we refer to as the ordering constraints. This new requirement stems from scenarios like security-aware planning, where relative orders outweigh absolute values in importance. We present an efficient algorithm to solve this problem, supported by proofs of correctness that demonstrate the optimality of our solution. Additionally, we provide a case study in security-aware path planning to illustrate the practicality and effectiveness of our proposed approach. | Systems and Control (eess.SY) | This article is withdrawn due to errors in the methodology section, specifically concerning the insufficient explanation of the data collection process. Upon review, it's clear that the data sampling methods were not adequately described, potentially leading to misinterpretations of the results | factual/methodological/other critical errors in manuscript | 14,041 |
2403.18113v2 | $\ell_1$ spreading models and the FPP for Cesàro mean nonexpansive maps | Let $K$ be a nonempty set in a Banach space $X$. A mapping $T\colon K\to K$ is called {\it $\mathfrak{cm}$-nonexpansive} if for any sequence $(x_i)_{i=1}^n$ and $y$ in $K$, one has $\|(1/n) \sum_{i=1}^n Tx_i -Ty\|\leq \|(1/n)\sum_{i=1}^n x_i - y\|$. As a subsclass of nonexpansive maps, the FPP for such maps is well-established in a great variety of spaces. The main result of this paper is a fixed point result relating $\mathfrak{cm}$-nonexpansiveness, $\ell_1$ spreading models and Schauder bases with not-so-large basis constants. As a result, we deduce that every Banach space with weak Banach-Saks property has the fixed point property for $\mathfrak{cm}$-nonexpansive maps. | Functional Analysis (math.FA) | The calculations contain a flaw, unfortunately | factual/methodological/other critical errors in manuscript | 14,042 |
2403.18567v2 | The effect of Relativistic Aberration on Cosmological Distances | Aims: we propose that the condition of relative motion between us and the objects that we observe in the Universe should generate relativistic aberration on the photons that such objects emit, varying the observed flux similarly to the cases of blazars and neutron stars, with instead a decrease of this radiative flux. Methods: we follow some important papers and textbook used in modern cosmology, adding the effects of relativistic aberration in the theoretical description of the Cosmos. Results: New definitions for the luminosity distance and the angular distance arise, with the consequence of changing the cosmological parameters measured in the last years. A qualitative description of all of this is also performed on the multipole analysis of the CMB. | Cosmology and Nongalactic Astrophysics (astro-ph.CO) | It was rejected by the journal, which means that this paper is wrong; the paper is based on the false assumption that galaxies are in a different reference frame in which we are, and this error is present in the "computations" section of the paper. Following this, all the results presented are wrong | factual/methodological/other critical errors in manuscript | 14,045 |
2403.18613v2 | Scalable Lipschitz Estimation for CNNs | Estimating the Lipschitz constant of deep neural networks is of growing interest as it is useful for informing on generalisability and adversarial robustness. Convolutional neural networks (CNNs) in particular, underpin much of the recent success in computer vision related applications. However, although existing methods for estimating the Lipschitz constant can be tight, they have limited scalability when applied to CNNs. To tackle this, we propose a novel method to accelerate Lipschitz constant estimation for CNNs. The core idea is to divide a large convolutional block via a joint layer and width-wise partition, into a collection of smaller blocks. We prove an upper-bound on the Lipschitz constant of the larger block in terms of the Lipschitz constants of the smaller blocks. Through varying the partition factor, the resulting method can be adjusted to prioritise either accuracy or scalability and permits parallelisation. We demonstrate an enhanced scalability and comparable accuracy to existing baselines through a range of experiments. | Machine Learning (cs.LG) | An inconsistency between the input of the flattened convolutional block and the flattened, partitioned input impacts the validity of the proposed Lipschitz bound | factual/methodological/other critical errors in manuscript | 14,046 |
2403.19188v2 | Nonexistence of invariant nodal line and improved $L^2$ restriction bounds for Neumann data on negatively curved surface | The problem of obtaining the lower bounds on the restriction of Laplacian eigenfunctions to hypersurfaces inside a compact Riemannian manifold $(M,g)$ is challenging and has been attempted by many authors \cite{BR, GRS, Jun, ET}. This paper aims to show that if $(M,g)$ is assumed to be a negatively curved surface then one can get the corresponding restricted lower bounds, as well as quantitative improvement of restricted bounds for Neumann data. | Analysis of PDEs (math.AP) | The results of this paper are false. There is a counter example: the odd eigenfunctions vanish on a curve which is fixed by an isometric involution | factual/methodological/other critical errors in manuscript | 14,049 |
2403.19285v2 | Going Beyond Word Matching: Syntax Improves In-context Example Selection for Machine Translation | In-context learning (ICL) is the trending prompting strategy in the era of large language models (LLMs), where a few examples are demonstrated to evoke LLMs' power for a given task. How to select informative examples remains an open issue. Previous works on in-context example selection for machine translation (MT) focus on superficial word-level features while ignoring deep syntax-level knowledge. In this paper, we propose a syntax-based in-context example selection method for MT, by computing the syntactic similarity between dependency trees using Polynomial Distance. In addition, we propose an ensemble strategy combining examples selected by both word-level and syntax-level criteria. Experimental results between English and 6 common languages indicate that syntax can effectively enhancing ICL for MT, obtaining the highest COMET scores on 11 out of 12 translation directions. | Computation and Language (cs.CL) | Some reported baselines are not comparable in Section 5 and could be misleading and confusing | factual/methodological/other critical errors in manuscript | 14,050 |
2403.19685v2 | A necessary condition for $2p$ to be congruent for a prime $p \equiv 5 \pmod 8$ | In this article, we consider primes $p \equiv 5 \pmod 8$ and are able to prove that $p \equiv 5 \pmod {16}$ if $2p$ is a congruent number. | Number Theory (math.NT) | There is some problem in this calculation which I learned just now. I request you to withdraw this paper | factual/methodological/other critical errors in manuscript | 14,052 |
2403.19848v2 | A Review of Sustainable Practices in Road Freight Transport | Sustainable road freight transport becomes indispensable in the field of transportation and logistics. The new technological change, the environmental impacts, and social responsibility laid freight road transport in front of various challenges, which makes the sustainable practices a vital solution in the sector. This paper aims to provide a theoretical research findings in sustainable road freight transport. The methodology discusses the road freight transport sustainability indicators among the literature studies realized in different countries in the world. The review analysis the studies and practical applications from various countries. The result exposes that the sustainability dimensions such as economic, social, environment was discussed in different cases, which prove the efforts of many countries to reduce environmental impact, improve economic efficiency, support social well-being, and expand technological innovations to achieve a sustainable transport system. | Physics and Society (physics.soc-ph) | We're withdrawing our paper from arXiv due to a critical error in our review methodology, which excluded key studies on sustainable road freight transport. This oversight could mislead the scientific community. We plan to correct this, ensuring comprehensive study inclusion, and will resubmit our paper for a more accurate review | factual/methodological/other critical errors in manuscript | 14,054 |
2404.00206v2 | Random Reed-Solomon Codes are List Recoverable with Optimal List Size | We prove that Reed-Solomon (RS) codes with random evaluation points are list recoverable up to capacity with optimal output list size, for any input list size. Namely, given an input list size $\ell$, a designated rate $R$, and any $\varepsilon > 0$, we show that a random RS code is list recoverable from $1-R-\varepsilon$ fraction of errors with output list size $L = O(\ell/\varepsilon)$, for field size $q=\exp(\ell,1/\varepsilon) \cdot n^2$. In particular, this shows that random RS codes are list recoverable beyond the "list recovery Johnson bound". Such a result was not even known for arbitrary random linear codes. Our technique follows and extends the recent line of work on list decoding of random RS codes, specifically the works of Brakensiek, Gopi, and Makam (STOC 2023), and of Guo and Zhang (FOCS 2023). | Information Theory (cs.IT) | Error in Proposition 4.6 | factual/methodological/other critical errors in manuscript | 14,055 |
2404.00686v2 | Utilizing Maximum Mean Discrepancy Barycenter for Propagating the Uncertainty of Value Functions in Reinforcement Learning | Accounting for the uncertainty of value functions boosts exploration in Reinforcement Learning (RL). Our work introduces Maximum Mean Discrepancy Q-Learning (MMD-QL) to improve Wasserstein Q-Learning (WQL) for uncertainty propagation during Temporal Difference (TD) updates. MMD-QL uses the MMD barycenter for this purpose, as MMD provides a tighter estimate of closeness between probability measures than the Wasserstein distance. Firstly, we establish that MMD-QL is Probably Approximately Correct in MDP (PAC-MDP) under the average loss metric. Concerning the accumulated rewards, experiments on tabular environments show that MMD-QL outperforms WQL and other algorithms. Secondly, we incorporate deep networks into MMD-QL to create MMD Q-Network (MMD-QN). Making reasonable assumptions, we analyze the convergence rates of MMD-QN using function approximation. Empirical results on challenging Atari games demonstrate that MMD-QN performs well compared to benchmark deep RL algorithms, highlighting its effectiveness in handling large state-action spaces. | Machine Learning (cs.LG) | We found some flaws in our analysis and we are in the process of rectifying those | factual/methodological/other critical errors in manuscript | 14,059 |
2404.01980v6 | A Simple Ricci Flow Proof of the Uniformization Theorem | In this note, we provide a very simple proof of the uniformization theorem of Riemann surfaces by Ricci flow. The argument builds on a refinement of Hamilton's isoperimetric estimate for the Ricci flow on the two-sphere. | Differential Geometry (math.DG) | There is a flaw in the proof of Theorem 3.3 that the A at t=0 and A at t=T cannot be guaranteed to be identical, thus the key inequality fails | factual/methodological/other critical errors in manuscript | 14,062 |
2404.03463v2 | A Characterization of Adequate Links | We show that a link is adequate if the breadth of its Jones polynomial equals the difference between its crossing number and its Turaev genus. Combining this result with its converse obtained by Abe [1, Theorem 3.2], we get a simple characterization of adequate links based on these numerical link invariants. As an application, we provide a simple obstruction for a link to be quasi-alternating. Moreover, we use this result to give a lower bound for the crossing number of some classes of links which would be very useful to determine the crossing number in certain cases. | Geometric Topology (math.GT) | We have found a gap in one of the lemmas that was used to prove the main result | factual/methodological/other critical errors in manuscript | 14,064 |
2404.04502v2 | The interplay between additive and symmetric large sets and their combinatorial applications | The study of symmetric structures is a new trend in Ramsey theory. Recently Di Nasso introduced a systematic study of symmetrization of classical Ramsey theoretical results and proved a symmetric version of several Ramsey theoretic results. In this paper Di Nasso asked if his method could be adapted to find new non-linear Diophantine equations that are partition regular. By analyzing additive, multiplicative, and symmetric large sets, we construct new partition regular equations that give a first affirmative answer to this question. Then we draw several new monochromatic patterns involving additive, multiplicative, and symmetric structures. Throughout our work, we use tools from the Algebra of the Stone-Čech Compactifications of discrete semigroups. | Combinatorics (math.CO) | In page 4, the expression of p\odot_t q is wrong. This was the crucial part of this paper | factual/methodological/other critical errors in manuscript | 14,065 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.