MODELLING THE ELECTRON WITH COSSERAT ELASTICITY

Interactions between a finite number of bodies and the surrounding fluid, in a channel for instance, are investigated theoretically. In the planar model here the bodies or modelled grains are thin solid bodies free to move in a nearly parallel formation within a quasi-inviscid fluid. The investigation involves numerical and analytical studies and comparisons. The three main features that appear are a linear instability about a state of uniform motion, a clashing of the bodies (or of a body with a side wall) within a finite scaled time when nonlinear interaction takes effect, and a continuum-limit description of the body–fluid interaction holding for the case of many bodies

Adaptive Measurement Network for CS Image Reconstruction

Conventional compressive sensing (CS) reconstruction is very slow for its characteristic of solving an optimization problem. Convolu- tional neural network can realize fast processing while achieving compa- rable results. While CS image recovery with high quality not only de- pends on good reconstruction algorithms, but also good measurements. In this paper, we propose an adaptive measurement network in which measurement is obtained by learning. The new network consists of a fully-connected layer and ReconNet. The fully-connected layer which has low-dimension output acts as measurement. We train the fully-connected layer and ReconNet simultaneously and obtain adaptive measurement. Because the adaptive measurement fits dataset better, in contrast with random Gaussian measurement matrix, under the same measuremen- t rate, it can extract the information of scene more efficiently and get better reconstruction results. Experiments show that the new network outperforms the original one.Comment: 11pages,8figure

Degree spectra for transcendence in fields

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed $\Delta^0_2$ degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary $\Sigma^0_2$ set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis

Comment on "Geometrothermodynamics of a Charged Black Hole of String Theory"

We comment on the conclusions found by Larra\~naga and Mojica regarding the consistency of the Geoemtrothermodynamics programme to describe the critical behaviour of a Gibbons-Maeda-Garfinkle-Horowitz-Strominger charged black hole. We argue that making the appropriate choice of metric for the thermodynamic phase space and, most importantly, considering the homogeneity of the thermodynamic potential we obtain consistent results for such a black hole.Comment: Comment on arXiv:1012.207

Comparison of the Near-Threshold Production of eta- and K-Mesons in Proton-Proton Collisions

The pp -> pp eta and pp -> pLambda K^+ reactions near threshold are dominated by the first and second S_11 resonance respectively. It is shown that a one-pion-exchange model exciting these isobars reproduces well the ratio of the production cross sections. The consequences for this and other channels are discussed.Comment: 10 pages, LaTeX2e, 1 eps-figur

Parameterized Complexity of the k-anonymity Problem

The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity. This approach requires that the rows of a table are partitioned in clusters of size at least $k$ and that all the rows in a cluster become the same tuple, after the suppression of some entries. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is known to be APX-hard even when the records values are over a binary alphabet and $k=3$, and when the records have length at most 8 and $k=4$ . In this paper we study how the complexity of the problem is influenced by different parameters. In this paper we follow this direction of research, first showing that the problem is W[1]-hard when parameterized by the size of the solution (and the value $k$). Then we exhibit a fixed parameter algorithm, when the problem is parameterized by the size of the alphabet and the number of columns. Finally, we investigate the computational (and approximation) complexity of the $k$-anonymity problem, when restricting the instance to records having length bounded by 3 and $k=3$. We show that such a restriction is APX-hard.Comment: 22 pages, 2 figure

Self-repair ability of evolved self-assembling systems in cellular automata

Self-repairing systems are those that are able to reconfigure themselves following disruptions to bring them back into a defined normal state. In this paper we explore the self-repair ability of some cellular automata-like systems, which differ from classical cellular automata by the introduction of a local diffusion process inspired by chemical signalling processes in biological development. The update rules in these systems are evolved using genetic programming to self-assemble towards a target pattern. In particular, we demonstrate that once the update rules have been evolved for self-assembly, many of those update rules also provide a self-repair ability without any additional evolutionary process aimed specifically at self-repair

Higher Spins in AdS and Twistorial Holography

In this paper we simplify and extend previous work on three-point functions in Vasiliev's higher spin gauge theory in AdS4. We work in a gauge in which the space-time dependence of Vasiliev's master fields is gauged away completely, leaving only the internal twistor-like variables. The correlation functions of boundary operators can be easily computed in this gauge. We find complete agreement of the tree level three point functions of higher spin currents in Vasiliev's theory with the conjectured dual free O(N) vector theory.Comment: 23 pages. v3: minor errors fixed, added comments and reference