相关论文: Weak Evolvability Equals Strong Evolvability

In cloud computing environments, a large number of users access data stored in highly available storage systems. To provide good performance to geographically disperse users and allow operation even in the presence of failures or network…

This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

Control of the living cell functions with remarkable reliability despite the stochastic nature of the underlying molecular networks -- a property presumably optimized by biological evolution. We here ask to what extent the property of a…

The Competition on Software Verification (SV-COMP) is a large computational experiment benchmarking many different software verification tools on a vast collection of C and Java benchmarks. Such experimental research should be reproducible…

Certain quasi-exactly solvable systems exhibit an energy reflection property that relates the energy levels of a potential or of a pair of potentials. We investigate two sister potentials and show the existence of this energy reflection…

Variational Bayesian (VB) methods produce posterior inference in a time frame considerably smaller than traditional Markov Chain Monte Carlo approaches. Although the VB posterior is an approximation, it has been shown to produce good…

A full accounting of biological robustness remains elusive; both in terms of the mechanisms by which robustness is achieved and the forces that have caused robustness to grow over evolutionary time. Although its importance to topics such as…

We give a new proof of the fact that each weakly reversible mass-action system with a single linkage class is permanent.

If E is an equivalence relation Borel reducible to E_1 \times E_3 then either E is Borel reducible to the equality of countable sets of reals or E_1 is Borel reducible to E. The "either" case admits further strengthening.

We study the detection capability of the weak-value amplification on the basis of the statistical hypothesis testing. We propose a reasonable testing method in the physical and statistical senses to find that the weak measurement with the…

We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak…

This is the old version of this project. Please find the new version at 1906.12233.

In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a…

The time evolution of the two-time conditional probability of the classical stochastic process is described in an analogous form of the quantum mechanical wave equations. By using it, we emulate the same strange behaviors as those of the…

The main purpose of this study is to introduce and study two new classes of continuity called eR-continuous functions and weakly eR-continuous functions via e-regular sets. Both of the forms of continuous functions we have described are…

Evolution Strategies (ES) emerged as a scalable alternative to popular Reinforcement Learning (RL) techniques, providing an almost perfect speedup when distributed across hundreds of CPU cores thanks to a reduced communication overhead.…

Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…

Many biological, ecological and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most network models studied so far are binary, the link strength being either 0…

When validated neural networks (NNs) are pruned (and retrained) before deployment, it is desirable to prove that the new NN behaves equivalently to the (original) reference NN. To this end, our paper revisits the idea of differential…