Related papers: NSR Superstring Measures Revisited
In the Shortest Superstring problem, we are given a set of strings and we are asking for a common superstring, which has the minimum number of characters. The Shortest Superstring problem is NP-hard and several constant-factor approximation…
In this note we confront the research conducted in \cite{Hoang:2017suc} with results previously obtained by the author, and critically examine some of their claimed findings.
A superstring of a set of strings correspond to a string which contains all the other strings as substrings. The problem of finding the Shortest Linear Superstring is a well-know and well-studied problem in stringology. We present here a…
Deep Neural Networks (DNN) have improved the quality of several non-safety related products in the past years. However, before DNNs should be deployed to safety-critical applications, their robustness needs to be systematically analyzed. A…
In the framework of the Neutronic and Nuclear Assessment Task Group of the MEGAPIE experiment we measured the delayed neutron (DN) flux at the top of the target. The measurement was proposed mainly for radioprotection purposes since the DN…
Superstring theory is one current, promising attempt at unifying gravity with the other three known forces: the electromagnetic force, and the weak and strong nuclear forces. Though this is still a work in progress, much effort has been put…
The combination of a deep neural network (DNN) -based speech enhancement (SE) front-end and an automatic speech recognition (ASR) back-end is a widely used approach to implement overlapping speech recognition. However, the SE front-end…
Neural Networks (NNs) can provide major empirical performance improvements for robotic systems, but they also introduce challenges in formally analyzing those systems' safety properties. In particular, this work focuses on estimating the…
For a calculation of divergent fermion string amplitudes a regularization procedure invariant under the supermodular group is constructed. By this procedure superstring amplitudes of an arbitrary genus are calculated using both partition…
Recent progress in the computation of one-loop gluon amplitudes is reviewed. These methods were originally derived from superstring theory and are significantly more efficient than conventional Feynman rules. With these methods, explicit…
In recent years numerous methods have been developed to formally verify the robustness of deep neural networks (DNNs). Though the proposed techniques are effective in providing mathematical guarantees about the DNNs behavior, it is not…
We consider the problem of tensor estimation from noisy observations with possibly missing entries. A nonparametric approach to tensor completion is developed based on a new model which we coin as sign representable tensors. The model…
The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This problem is proved to be NP-Complete and APX-hard. Guaranteed…
We give a new and short proof of a theorem on k-hypertournament losing scores due to Zhou et al. [G. Zhou, T. Yao, K. Zhang, On score sequences of k-tournaments, European J. Comb., 21, 8 (2000) 993-1000.]
The problem of estimating the number of sources and their angles of arrival from a single antenna array observation has been an active area of research in the signal processing community for the last few decades. When the number of sources…
The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one…
An extension of the regularized least-squares in which the estimation parameters are stretchable is introduced and studied in this paper. The solution of this ridge regression with stretchable parameters is given in primal and dual spaces…
At the present time, string theory (and its generalizations) remain relatively abstruse subjects to the particle phenomenologist and experimentalist. Yet, striking developments of the last two years offer hope that a fundamental…
The mean shift iterative algorithm was proposed in 2006, for using the entropy as a stopping criterion. From then on, a theoretical base has been developed and a group of applications has been carried out using this algorithm. This paper…
Measuring performance of an automatic speech recognition (ASR) system without ground-truth could be beneficial in many scenarios, especially with data from unseen domains, where performance can be highly inconsistent. In conventional ASR…