text
null | inputs
dict | prediction
null | prediction_agent
null | annotation
list | annotation_agent
null | multi_label
bool 1
class | explanation
null | id
stringlengths 1
5
| metadata
null | status
stringclasses 2
values | event_timestamp
null | metrics
null |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
null |
{
"abstract": " This article presents the parallel implementation of the coupled harmonic\noscillator. From the analytical solution of the coupled harmonic oscillator,\nthe design parameters are obtained. After that, a numerical integration of the\nsystem with MATLAB, which is used as a tool of benchmark evaluation, is\nperformed. Next, parallel implementation is performed using a well-known\napproach like OpenMP and WinAPI. Taking into account the errors of basic\nparameters of the simulated process, the generated oscillations of the proposed\nparallel realization are almost identical to the actual solution of the\nharmonic oscillator model. Test ways to optimize the parallel architecture of\ncomputing processes for software implementations of the considered application\nis carried out. The developed model is used to study a fixed priority\nscheduling algorithm for real-time parallel threads execution. The proposed\nparallel implementation of the considered dynamic system has an independent\nvalue and can be considered as a test for determining the characteristics of\nmulti-core systems for time-critical simulation problems. Keywords: Harmonic\noscillator, model, SMP, parallel programming, OpenMP;\n",
"title": "Parallel implementation of the coupled harmonic oscillator"
}
| null | null | null | null | true | null |
12301
| null |
Default
| null | null |
null |
{
"abstract": " TiEV is an autonomous driving platform implemented by Tongji University of\nChina. The vehicle is drive-by-wire and is fully powered by electricity. We\ndevised the software system of TiEV from scratch, which is capable of driving\nthe vehicle autonomously in urban paths as well as on fast express roads. We\ndescribe our whole system, especially novel modules of probabilistic perception\nfusion, incremental mapping, the 1st and the 2nd planning and the overall\nsafety concern. TiEV finished 2016 and 2017 Intelligent Vehicle Future\nChallenge of China held at Changshu. We show our experiences on the development\nof autonomous vehicles and future trends.\n",
"title": "TiEV: The Tongji Intelligent Electric Vehicle in the Intelligent Vehicle Future Challenge of China"
}
| null | null | null | null | true | null |
12302
| null |
Default
| null | null |
null |
{
"abstract": " We propose a novel decoding approach for neural machine translation (NMT)\nbased on continuous optimisation. We convert decoding - basically a discrete\noptimization problem - into a continuous optimization problem. The resulting\nconstrained continuous optimisation problem is then tackled using\ngradient-based methods. Our powerful decoding framework enables decoding\nintractable models such as the intersection of left-to-right and right-to-left\n(bidirectional) as well as source-to-target and target-to-source (bilingual)\nNMT models. Our empirical results show that our decoding framework is\neffective, and leads to substantial improvements in translations generated from\nthe intersected models where the typical greedy or beam search is not feasible.\nWe also compare our framework against reranking, and analyse its advantages and\ndisadvantages.\n",
"title": "Towards Decoding as Continuous Optimization in Neural Machine Translation"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12303
| null |
Validated
| null | null |
null |
{
"abstract": " The classical Halpern-Läuchli theorem states that for any finite coloring\nof a finite product of finitely branching perfect trees of height $\\omega$,\nthere exist strong subtrees sharing the same level set such that tuples\nconsisting of elements lying on the same level get the same color. Relative to\nlarge cardinals, we establish the consistency of a tail cone version of the\nHalpern-Läuchli theorem at large cardinal, which, roughly speaking, deals\nwith many colorings simultaneously and diagonally. Among other applications, we\ngeneralize a polarized partition relation on rational numbers due to Laver and\nGalvin to one on linear orders of larger saturation.\n",
"title": "A tail cone version of the Halpern-Läuchli theorem at a large cardinal"
}
| null | null | null | null | true | null |
12304
| null |
Default
| null | null |
null |
{
"abstract": " We conduct an in depth study on the performance of deep learning based radio\nsignal classification for radio communications signals. We consider a rigorous\nbaseline method using higher order moments and strong boosted gradient tree\nclassification and compare performance between the two approaches across a\nrange of configurations and channel impairments. We consider the effects of\ncarrier frequency offset, symbol rate, and multi-path fading in simulation and\nconduct over-the-air measurement of radio classification performance in the lab\nusing software radios and compare performance and training strategies for both.\nFinally we conclude with a discussion of remaining problems, and design\nconsiderations for using such techniques.\n",
"title": "Over the Air Deep Learning Based Radio Signal Classification"
}
| null | null | null | null | true | null |
12305
| null |
Default
| null | null |
null |
{
"abstract": " We identify conditional parity as a general notion of non-discrimination in\nmachine learning. In fact, several recently proposed notions of\nnon-discrimination, including a few counterfactual notions, are instances of\nconditional parity. We show that conditional parity is amenable to statistical\nanalysis by studying randomization as a general mechanism for achieving\nconditional parity and a kernel-based test of conditional parity.\n",
"title": "On conditional parity as a notion of non-discrimination in machine learning"
}
| null | null | null | null | true | null |
12306
| null |
Default
| null | null |
null |
{
"abstract": " We consider caching in cellular networks in which each base station is\nequipped with a cache that can store a limited number of files. The popularity\nof the files is known and the goal is to place files in the caches such that\nthe probability that a user at an arbitrary location in the plane will find the\nfile that she requires in one of the covering caches is maximized.\nWe develop distributed asynchronous algorithms for deciding which contents to\nstore in which cache. Such cooperative algorithms require communication only\nbetween caches with overlapping coverage areas and can operate in asynchronous\nmanner. The development of the algorithms is principally based on an\nobservation that the problem can be viewed as a potential game. Our basic\nalgorithm is derived from the best response dynamics. We demonstrate that the\ncomplexity of each best response step is independent of the number of files,\nlinear in the cache capacity and linear in the maximum number of base stations\nthat cover a certain area. Then, we show that the overall algorithm complexity\nfor a discrete cache placement is polynomial in both network size and catalog\nsize. In practical examples, the algorithm converges in just a few iterations.\nAlso, in most cases of interest, the basic algorithm finds the best Nash\nequilibrium corresponding to the global optimum. We provide two extensions of\nour basic algorithm based on stochastic and deterministic simulated annealing\nwhich find the global optimum.\nFinally, we demonstrate the hit probability evolution on real and synthetic\nnetworks numerically and show that our distributed caching algorithm performs\nsignificantly better than storing the most popular content, probabilistic\ncontent placement policy and Multi-LRU caching policies.\n",
"title": "A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12307
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper, we consider the numerical approximations for solving a\nhydrodynamics coupled phase field model consisting of incompressible\nNavier-Stokes equations with generalized Navier boundary conditions, and the\nCahn-Hilliard equation with dynamic moving contact line boundary conditions.\nThe main challenging issue for solving this model numerically is the time\nmarching problem, i.e., how to develop suitable higher order temporal schemes\nwhile preserving the unconditional energy stability at the discrete level. We\nsolve this issue by developing two linear, second-order schemes based on the\n\"Invariant Energy Quadratization\" method for the nonlinear terms in the bulk\nand on the boundary, the projection method for the Navier-Stokes equations, and\na subtle implicit-explicit treatment for the stress and convective terms.\nRigorous proofs of the well-posedness of the linear system and the\nunconditional energy stabilities are provided. A spectral-Galerkin spatial\ndiscretization is implemented and various numerical results are presented to\nverify the second order accuracy and the efficiency of the proposed schemes.\n",
"title": "Linear, Second order and Unconditionally Energy Stable schemes for a phase-field moving contact line Model"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12308
| null |
Validated
| null | null |
null |
{
"abstract": " Machine-learning techniques are widely used in security-related applications,\nlike spam and malware detection. However, in such settings, they have been\nshown to be vulnerable to adversarial attacks, including the deliberate\nmanipulation of data at test time to evade detection. In this work, we focus on\nthe vulnerability of linear classifiers to evasion attacks. This can be\nconsidered a relevant problem, as linear classifiers have been increasingly\nused in embedded systems and mobile devices for their low processing time and\nmemory requirements. We exploit recent findings in robust optimization to\ninvestigate the link between regularization and security of linear classifiers,\ndepending on the type of attack. We also analyze the relationship between the\nsparsity of feature weights, which is desirable for reducing processing cost,\nand the security of linear classifiers. We further propose a novel octagonal\nregularizer that allows us to achieve a proper trade-off between them. Finally,\nwe empirically show how this regularizer can improve classifier security and\nsparsity in real-world application examples including spam and malware\ndetection.\n",
"title": "On Security and Sparsity of Linear Classifiers for Adversarial Settings"
}
| null | null | null | null | true | null |
12309
| null |
Default
| null | null |
null |
{
"abstract": " The sharp-interface limits of a phase-field model with a generalized Navier\nslip boundary condition for moving contact line problem are studied by\nasymptotic analysis and numerical simulations. The effects of the {mobility}\nnumber as well as a phenomenological relaxation parameter in the boundary\ncondition are considered. In asymptotic analysis, we focus on the case that the\n{mobility} number is the same order of the Cahn number and derive the\nsharp-interface limits for several setups of the boundary relaxation parameter.\nIt is shown that the sharp interface limit of the phase field model is the\nstandard two-phase incompressible Navier-Stokes equations coupled with several\ndifferent slip boundary conditions. Numerical results are consistent with the\nanalysis results and also illustrate the different convergence rates of the\nsharp-interface limits for different scalings of the two parameters.\n",
"title": "Sharp-interface limits of a phase-field model with a generalized Navier slip boundary condition for moving contact lines"
}
| null | null | null | null | true | null |
12310
| null |
Default
| null | null |
null |
{
"abstract": " The first part of this notes provides a new characterization for discrete\ncompound Poisson point process (proposed by {Acz{é}l}\n[Acta~Math.~Hungar.~3(3)(1952), 219-224.]), which extends the characterization\nof Poisson point process given by Copeland and Regan [Ann.~Math.~(1936):\n357-362.]. Next, we derive some concentration inequalities for discrete\ncompound Poisson random variable and discrete compound Poisson point process\n(Poisson and negative binomial are the special cases). These concentration\ninequalities are potentially useful. In high-dimensional negative binomial\nregression with weighted Lasso penalty, we give the application that KKT\nconditions of penalized likelihood holds with high probability.\n",
"title": "Notes on Discrete Compound Poisson Point Process and Its Concentration Inequalities"
}
| null | null | null | null | true | null |
12311
| null |
Default
| null | null |
null |
{
"abstract": " Characteristic cycles and leading term cycles of irreducible highest weight\nHarish-Chandra modules of regular integral infinitesimal character are\ndetermined. In the simply laced cases they are irreducible, but in the\nnonsimply laced cases they are more complicated.\n",
"title": "Characteristic cycles of highest weight Harish-Chandra modules"
}
| null | null | null | null | true | null |
12312
| null |
Default
| null | null |
null |
{
"abstract": " We propose a robust implementation of the Nerlove--Arrow model using a\nBayesian structural time series model to explain the relationship between\nadvertising expenditures of a country-wide fast-food franchise network with its\nweekly sales. Thanks to the flexibility and modularity of the model, it is well\nsuited to generalization to other markets or situations. Its Bayesian nature\nfacilitates incorporating \\emph{a priori} information (the manager's views),\nwhich can be updated with relevant data. This aspect of the model will be used\nto present a strategy of budget scheduling across time and channels.\n",
"title": "Assessing the effect of advertising expenditures upon sales: a Bayesian structural time series model"
}
| null | null | null | null | true | null |
12313
| null |
Default
| null | null |
null |
{
"abstract": " Statistical Relational Models and, more recently, Probabilistic Programming,\nhave been making strides towards an integration of logic and probabilistic\nreasoning. A natural expectation for this project is that a probabilistic logic\nreasoning algorithm reduces to a logic reasoning algorithm when provided a\nmodel that only involves 0-1 probabilities, exhibiting all the advantages of\nlogic reasoning such as short-circuiting, intelligibility, and the ability to\nprovide proof trees for a query answer. In fact, we can take this further and\nrequire that these characteristics be present even for probabilistic models\nwith probabilities \\emph{near} 0 and 1, with graceful degradation as the model\nbecomes more uncertain. We also seek inference that has amortized constant time\ncomplexity on a model's size (even if still exponential in the induced width of\na more directly relevant portion of it) so that it can be applied to huge\nknowledge bases of which only a relatively small portion is relevant to typical\nqueries. We believe that, among the probabilistic reasoning algorithms, Belief\nPropagation is the most similar to logic reasoning: messages are propagated\namong neighboring variables, and the paths of message-passing are similar to\nproof trees. However, Belief Propagation is either only applicable to tree\nmodels, or approximate (and without guarantees) for precision and convergence.\nIn this paper we present work in progress on an Anytime Exact Belief\nPropagation algorithm that is very similar to Belief Propagation but is exact\neven for graphical models with cycles, while exhibiting soft short-circuiting,\namortized constant time complexity in the model size, and which can provide\nprobabilistic proof trees.\n",
"title": "Anytime Exact Belief Propagation"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12314
| null |
Validated
| null | null |
null |
{
"abstract": " We theoretically investigate a spin-orbit coupled $s$-wave superfluid Fermi\ngas, to examine the time evolution of the system, after an $s$-wave pairing\ninteraction is replaced by a $p$-wave one at $t=0$. In our recent paper, we\nproposed that this manipulation may realize a $p$-wave superfluid Fermi gas,\nbecause the $p$-wave pair amplitude that is induced in the $s$-wave superfluid\nstate by a parity-broken antisymmetric spin-orbit interaction gives a\nnon-vanishing $p$-wave superfluid order parameter, immediately after the\n$p$-wave interaction is turned on. In this paper, using a time-dependent\nBogoliubov-de Gennes theory, we assess this idea under various conditions with\nrespect to the $s$-wave and $p$-wave interaction strengths, as well as the\nspin-orbit coupling strength. From these, we clarify that the momentum\ndistribution of Fermi atoms in the initial $s$-wave state ($t<0$) is a key to\nproduce a large $p$-wave superfluid order parameter. Since the realization of a\n$p$-wave superfluid state is one of the most exciting and difficult challenges\nin cold Fermi gas physics, our results may provide a possible way to accomplish\nthis.\n",
"title": "Appropriate conditions to realize a $p$-wave superfluid state starting from a spin-orbit coupled $s$-wave superfluid Fermi gas"
}
| null | null |
[
"Physics"
] | null | true | null |
12315
| null |
Validated
| null | null |
null |
{
"abstract": " The celebrated Auslander-Reiten Conjecture, on the vanishing of self\nextensions of a module, is one of the long-standing conjectures in ring theory.\nAlthough it is still open, there are several results in the literature that\nestablish the conjecture over Gorenstein rings under certain conditions. The\npurpose of this article is to obtain extensions of such results over\nCohen-Macaulay local rings that admit canonical modules. In particular, our\nmain result recovers theorems of Araya, and Ono and Yoshino simultaneously.\n",
"title": "On the vanishing of self extensions over Cohen-Macaulay local rings"
}
| null | null | null | null | true | null |
12316
| null |
Default
| null | null |
null |
{
"abstract": " We explore the temperature effects in the superconducting phases of a\nhybridized two-band system. We show that for zero hybridization between the\nbands, there are two different critical temperatures. However, for any finite\nhybridization there are only one critical temperature at which the two gaps\nvanish simultaneously. We construct the phase diagrams of the critical\ntemperature versus hybridization parameter $\\alpha$ and critical temperature\nversus critical chemical potential asymmetry $\\delta \\mu$ between the bands,\nidentifying the superconductor and normal phases in the system. We find an\ninteresting reentrant behavior in the superconducting phase as the parameters\n$\\alpha$ or $\\delta \\mu$, which drive the phase transitions, increase. We also\nfind that for optimal values of both $\\alpha$ and $\\delta \\mu$ there is a\nsignificant enhancement of the critical temperature of the model.\n",
"title": "Finite Temperature Phase Diagrams of a Two-band Model of Superconductivity"
}
| null | null | null | null | true | null |
12317
| null |
Default
| null | null |
null |
{
"abstract": " Time series, as frequently the case in neuroscience, are rarely stationary,\nbut often exhibit abrupt changes due to attractor transitions or bifurcations\nin the dynamical systems producing them. A plethora of methods for detecting\nsuch change points in time series statistics have been developed over the\nyears, in addition to test criteria to evaluate their significance. Issues to\nconsider when developing change point analysis methods include computational\ndemands, difficulties arising from either limited amount of data or a large\nnumber of covariates, and arriving at statistical tests with sufficient power\nto detect as many changes as contained in potentially high-dimensional time\nseries. Here, a general method called Paired Adaptive Regressors for Cumulative\nSum is developed for detecting multiple change points in the mean of\nmultivariate time series. The method's advantages over alternative approaches\nare demonstrated through a series of simulation experiments. This is followed\nby a real data application to neural recordings from rat medial prefrontal\ncortex during learning. Finally, the method's flexibility to incorporate useful\nfeatures from state-of-the-art change point detection techniques is discussed,\nalong with potential drawbacks and suggestions to remedy them.\n",
"title": "Detecting Multiple Change Points Using Adaptive Regression Splines with Application to Neural Recordings"
}
| null | null | null | null | true | null |
12318
| null |
Default
| null | null |
null |
{
"abstract": " We study the automorphism group of Hall's universal locally finite group $H$.\nWe show that in $Aut(H)$ every subgroup of index $< 2^\\omega$ lies between the\npointwise and the setwise stabilizer of a unique finite subgroup $A$ of $H$,\nand use this to prove that $Aut(H)$ is complete. We further show that $Inn(H)$\nis the largest locally finite normal subgroup of $Aut(H)$. Finally, we observe\nthat from the work of [Sh:312] it follows that for every countable locally\nfinite $G$ there exists $G \\cong G' \\leq H$ such that every $f \\in Aut(G')$\nextends to an $\\hat{f} \\in Aut(H)$ in such a way that $f \\mapsto \\hat{f}$\nembeds $Aut(G')$ into $Aut(H)$. In particular, we solve the three open\nquestions of Hickin on $Aut(H)$ from [3], and give a partial answer to Question\nVI.5 of Kegel and Wehrfritz from [6].\n",
"title": "The Automorphism Group of Hall's Universal Group"
}
| null | null | null | null | true | null |
12319
| null |
Default
| null | null |
null |
{
"abstract": " A linear or multi-linear valuation on a finite abstract simplicial complex\ncan be expressed as an analytic index dim(ker(D)) -dim(ker(D^*)) of a\ndifferential complex D:E -> F. In the discrete, a complex D can be called\nelliptic if a McKean-Singer spectral symmetry applies as this implies\nstr(exp(-t D^2)) is t-independent. In that case, the analytic index of D is the\nsum of (-1)^k b_k(D), where b_k(D) is the k'th Betti number, which by Hodge is\nthe nullity of the (k+1)'th block of the Hodge operator L=D^2. It can also be\nwritten as a topological index summing K(v) over the set of zero-dimensional\nsimplices in G and where K is an Euler type curvature defined by G and D. This\ncan be interpreted as a Atiyah-Singer type correspondence between analytic and\ntopological index. Examples are the de Rham differential complex for the Euler\ncharacteristic X(G) or the connection differential complex for Wu\ncharacteristic w_k(G). Given an endomorphism T of an elliptic complex, the\nLefschetz number X(T,G,D) is defined as the super trace of T acting on\ncohomology defined by E. It is equal to the sum i(v) over V which are contained\nin fixed simplices of T, and i is a Brouwer type index. This Atiyah-Bott result\ngeneralizes the Brouwer-Lefschetz fixed point theorem for an endomorphism of\nthe simplicial complex G. In both the static and dynamic setting, the proof is\ndone by heat deforming the Koopman operator U(T) to get the cohomological\npicture str(exp(-t D^2) U(T)) in the limit t to infinity and then use Hodge,\nand then by applying a discrete gradient flow to the simplex data defining the\nvaluation to push str(U(T)) to V, getting curvature K(v) or the Brouwer type\nindex i(v).\n",
"title": "On Atiyah-Singer and Atiyah-Bott for finite abstract simplicial complexes"
}
| null | null | null | null | true | null |
12320
| null |
Default
| null | null |
null |
{
"abstract": " The evolution of structure in biology is driven by accretion and change.\nAccretion brings together disparate parts to form bigger wholes. Change\nprovides opportunities for growth and innovation. Here we review patterns and\nprocesses that are responsible for a 'double tale' of evolutionary accretion at\nvarious levels of complexity, from proteins and nucleic acids to high-rise\nbuilding structures in cities. Parts are at first weakly linked and associate\nvariously. As they diversify, they compete with each other and are selected for\nperformance. The emerging interactions constrain their structure and\nassociations. This causes parts to self-organize into modules with tight\nlinkage. In a second phase, variants of the modules evolve and become new parts\nfor a new generative cycle of higher-level organization. Evolutionary genomics\nand network biology support the 'double tale' of structural module creation and\nvalidate an evolutionary principle of maximum abundance that drives the gain\nand loss of modules.\n",
"title": "Evolution of macromolecular structure: a 'double tale' of biological accretion"
}
| null | null | null | null | true | null |
12321
| null |
Default
| null | null |
null |
{
"abstract": " Let $f$ be a band-limited function in $L^2({\\mathbb{R}})$. Fix $T >0$ and\nsuppose $f^{\\prime}$ exists and is integrable on $[-T, T]$. This paper gives a\nconcrete estimate of the error incurred when approximating $f$ in the root mean\nsquare by a partial sum of its Hermite series.\nSpecifically, we show, for $K=2n, \\quad n \\in Z_+,$\n$$\n\\left[\\frac{1}{2T}\\int_{-T}^T[f(t)-(S_Kf)(t)]^2dt\\right]^{1/2}\\leq\n\\left(1+\\frac 1K\\right)\\left(\\left[ \\frac{1}{2T}\\int_{|t|>\nT}f(t)^2dt\\right]^{1/2} +\\left[\\frac{1}{2T} \\int_{|\\omega|>N}|\\hat\nf(\\omega)|^2d\\omega\\right]^{1/2} \\right)\n+\\frac{1}{K}\\left[\\frac{1}{2T}\\int_{|t|\\leq T}f_N(t)^2dt\\right]^{1/2}\n+\\frac{1}{\\pi}\\left(1+\\frac{1}{2K}\\right)S_a(K,T), $$ in which $S_Kf$ is the\n$K$-th partial sum of the Hermite series of $f, \\hat f $ is the Fourier\ntransform of $f$, $\\displaystyle{N=\\frac{\\sqrt{2K+1}+% \\sqrt{2K+3}}{2}}$ and\n$f_N=(\\hat f\n\\chi_{(-N,N)})^\\vee(t)=\\frac{1}{\\pi}\\int_{-\\infty}^{\\infty}\\frac{\\sin\n(N(t-s))}{t-s}f(s)ds$. An explicit upper bound is obtained for $S_{a}(K,T)$.\n",
"title": "An estimate of the root mean square error incurred when approximating an $f \\in L^2({\\mathbb{R}})$ by a partial sum of its Hermite series"
}
| null | null | null | null | true | null |
12322
| null |
Default
| null | null |
null |
{
"abstract": " Distributed word representations are widely used for modeling words in NLP\ntasks. Most of the existing models generate one representation per word and do\nnot consider different meanings of a word. We present two approaches to learn\nmultiple topic-sensitive representations per word by using Hierarchical\nDirichlet Process. We observe that by modeling topics and integrating topic\ndistributions for each document we obtain representations that are able to\ndistinguish between different meanings of a given word. Our models yield\nstatistically significant improvements for the lexical substitution task\nindicating that commonly used single word representations, even when combined\nwith contextual information, are insufficient for this task.\n",
"title": "Learning Topic-Sensitive Word Representations"
}
| null | null | null | null | true | null |
12323
| null |
Default
| null | null |
null |
{
"abstract": " We present a new oblivious walking strategy for convex subdivisions. Our walk\nis faster than the straight walk and more generally applicable than the\nvisibility walk. To prove termination of our walk we use a novel monotonically\ndecreasing distance measure.\n",
"title": "Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12324
| null |
Validated
| null | null |
null |
{
"abstract": " Energy statistics was proposed by Székely in the 80's inspired by\nNewton's gravitational potential in classical mechanics, and it provides a\nmodel-free hypothesis test for equality of distributions. In its original form,\nenergy statistics was formulated in Euclidean spaces. More recently, it was\ngeneralized to metric spaces of negative type. In this paper, we consider a\nformulation for the clustering problem using a weighted version of energy\nstatistics in spaces of negative type. We show that this approach leads to a\nquadratically constrained quadratic program in the associated kernel space,\nestablishing connections with graph partitioning problems and kernel methods in\nunsupervised machine learning. To find local solutions of such an optimization\nproblem, we propose an extension of Hartigan's method to kernel spaces. Our\nmethod has the same computational cost as kernel k-means algorithm, which is\nbased on Lloyd's heuristic, but our numerical results show an improved\nperformance, especially in high dimensions.\n",
"title": "Kernel k-Groups via Hartigan's Method"
}
| null | null |
[
"Computer Science",
"Mathematics",
"Statistics"
] | null | true | null |
12325
| null |
Validated
| null | null |
null |
{
"abstract": " A finite-support constraint on the parameter space is used to derive a lower\nbound on the error of an estimator of the correlation coefficient in the\nbivariate exponential distribution. The bound is then exploited to examine\noptimality of three estimators, each being a nonlinear function of moments of\nexponential or Rayleigh observables. The estimator based on a measure of cosine\nsimilarity is shown to be highly efficient for values of the correlation\ncoefficient greater than 0.35; for smaller values, however, it is the\ntransformed Pearson correlation coefficient that exhibits errors closer to the\nderived bound.\n",
"title": "Estimators of the correlation coefficient in the bivariate exponential distribution"
}
| null | null | null | null | true | null |
12326
| null |
Default
| null | null |
null |
{
"abstract": " Neural circuits in the retina divide the incoming visual scene into more than\na dozen distinct representations that are sent on to central brain areas, such\nas the lateral geniculate nucleus and the superior colliculus. The retina can\nbe viewed as a parallel image processor made of a multitude of small\ncomputational devices. Neural circuits of the retina are constituted by various\ncell types that separate the incoming visual information in different channels.\nVisual information is processed by retinal neural circuits and several\ncomputations are performed extracting distinct features from the visual scene.\nThe aim of this article is to understand the computational basis involved in\nprocessing visual information which finally leads to several feature detectors.\nTherefore, the elements that form the basis of retinal computations will be\nexplored by explaining how oscillators can lead to a final output with\ncomputational meaning. Linear versus nonlinear systems will be presented and\nthe retina will be placed in the context of a nonlinear system. Finally,\nsimulations will be presented exploring the concept of the retina as a\nnonlinear system which can perform understandable computations converting a\nknown input into a predictable output.\n",
"title": "A theoretical framework for retinal computations: insights from textbook knowledge"
}
| null | null | null | null | true | null |
12327
| null |
Default
| null | null |
null |
{
"abstract": " We develop an approach for unsupervised learning of associations between\nco-occurring perceptual events using a large graph. We applied this approach to\nsuccessfully solve the image captcha of China's railroad system. The approach\nis based on the principle of suspicious coincidence. In this particular\nproblem, a user is presented with a deformed picture of a Chinese phrase and\neight low-resolution images. They must quickly select the relevant images in\norder to purchase their train tickets. This problem presents several\nchallenges: (1) the teaching labels for both the Chinese phrases and the images\nwere not available for supervised learning, (2) no pre-trained deep\nconvolutional neural networks are available for recognizing these Chinese\nphrases or the presented images, and (3) each captcha must be solved within a\nfew seconds. We collected 2.6 million captchas, with 2.6 million deformed\nChinese phrases and over 21 million images. From these data, we constructed an\nassociation graph, composed of over 6 million vertices, and linked these\nvertices based on co-occurrence information and feature similarity between\npairs of images. We then trained a deep convolutional neural network to learn a\nprojection of the Chinese phrases onto a 230-dimensional latent space. Using\nlabel propagation, we computed the likelihood of each of the eight images\nconditioned on the latent space projection of the deformed phrase for each\ncaptcha. The resulting system solved captchas with 77% accuracy in 2 seconds on\naverage. Our work, in answering this practical challenge, illustrates the power\nof this class of unsupervised association learning techniques, which may be\nrelated to the brain's general strategy for associating language stimuli with\nvisual objects on the principle of suspicious coincidence.\n",
"title": "Learning to Associate Words and Images Using a Large-scale Graph"
}
| null | null | null | null | true | null |
12328
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we prove the Dichotomy Conjecture on the complexity of\nnonuniform constraint satisfaction problems posed by Feder and Vardi.\n",
"title": "A dichotomy theorem for nonuniform CSPs"
}
| null | null | null | null | true | null |
12329
| null |
Default
| null | null |
null |
{
"abstract": " We report an experimental investigation of the effect of finite depth on the\nstatistical properties of wave turbulence at the surface of water in the\ngravity-capillary range. We tune the wave dispersion and the level of\nnonlinearity by modifying the depth of water and the forcing respectively. We\nuse space-time resolved profilometry to reconstruct the deformed surface of\nwater. When decreasing the water depth, we observe a drastic transition between\nweak turbulence at the weakest forcing and a solitonic regime at stronger\nforcing. We characterize the transition between both states by studying their\nFourier Spectra. We also study the efficiency of energy transfer in the weak\nturbulence regime. We report a loss of efficiency of angular transfer as the\ndispersion of the wave is reduced until the system bifurcates into the\nsolitonic regime.\n",
"title": "Transition from Weak Wave Turbulence to Soliton-Gas"
}
| null | null | null | null | true | null |
12330
| null |
Default
| null | null |
null |
{
"abstract": " A model-based approach to forecasting chaotic dynamical systems utilizes\nknowledge of the physical processes governing the dynamics to build an\napproximate mathematical model of the system. In contrast, machine learning\ntechniques have demonstrated promising results for forecasting chaotic systems\npurely from past time series measurements of system state variables (training\ndata), without prior knowledge of the system dynamics. The motivation for this\npaper is the potential of machine learning for filling in the gaps in our\nunderlying mechanistic knowledge that cause widely-used knowledge-based models\nto be inaccurate. Thus we here propose a general method that leverages the\nadvantages of these two approaches by combining a knowledge-based model and a\nmachine learning technique to build a hybrid forecasting scheme. Potential\napplications for such an approach are numerous (e.g., improving weather\nforecasting). We demonstrate and test the utility of this approach using a\nparticular illustrative version of a machine learning known as reservoir\ncomputing, and we apply the resulting hybrid forecaster to a low-dimensional\nchaotic system, as well as to a high-dimensional spatiotemporal chaotic system.\nThese tests yield extremely promising results in that our hybrid technique is\nable to accurately predict for a much longer period of time than either its\nmachine-learning component or its model-based component alone.\n",
"title": "Hybrid Forecasting of Chaotic Processes: Using Machine Learning in Conjunction with a Knowledge-Based Model"
}
| null | null | null | null | true | null |
12331
| null |
Default
| null | null |
null |
{
"abstract": " Heavy metal/ferromagnetic layers with perpendicular magnetic anisotropy (PMA)\nhave potential applications for high-density information storage in racetrack\nmemories and nonvolatile magnetic random access memories. Writing and erasing\nof information in these devices are carried out by domain wall (DW) motion and\ndeterministic magnetization switching via electric current generated spin\norbital torques (SOTs) with an assistance of in-plane bias field to break the\nsymmetry. Improvements in energy efficiency could be obtained when the\nswitching of perpendicular magnetization is controlled by an electric current\ngenerated SOTs without the in-plane bias fields. Here, we report on reversible\nelectric-current-driven magnetization switching through DW motion in Pt/Co/Cr\ntrilayers with PMA at room temperature due to the formation of homochiral\nNeel-type domain, in which an in-plane effective Dzyaloshinskii-Moriya\ninteraction field exists. Fully deterministic magnetic magnetization switching\nin this trilayers is based on the enhancement of SOTs from a dedicated design\nof Pt/Co/Cr structures with two heavy metals Pt and Cr which show the opposite\nsign of spin Hall angles. We also demonstrated that the simultaneously\naccompanying Joule heating effect also plays a key role for field-free\nmagnetization switching through the decrease of the propagation field.\n",
"title": "Field-free perpendicular magnetization switching through domain wall motion in Pt/Co/Cr racetracks by spin orbit torques with the assistance of accompanying Joule heating effect"
}
| null | null | null | null | true | null |
12332
| null |
Default
| null | null |
null |
{
"abstract": " Recently, the separated fragment (SF) of first-order logic has been\nintroduced. Its defining principle is that universally and existentially\nquantified variables may not occur together in atoms. SF properly generalizes\nboth the Bernays-Schönfinkel-Ramsey (BSR) fragment and the relational monadic\nfragment. In this paper the restrictions on variable occurrences in SF\nsentences are relaxed such that universally and existentially quantified\nvariables may occur together in the same atom under certain conditions. Still,\nsatisfiability can be decided. This result is established in two ways: firstly,\nby an effective equivalence-preserving translation into the BSR fragment, and,\nsecondly, by a model-theoretic argument.\nSlight modifications to the described concepts facilitate the definition of\nother decidable classes of first-order sentences. The paper presents a second\nfragment which is novel, has a decidable satisfiability problem, and properly\ncontains the Ackermann fragment and---once more---the relational monadic\nfragment. The definition is again characterized by restrictions on the\noccurrences of variables in atoms. More precisely, after certain\ntransformations, Skolemization yields only unary functions and constants, and\nevery atom contains at most one universally quantified variable. An effective\nsatisfiability-preserving translation into the monadic fragment is devised and\nemployed to prove decidability of the associated satisfiability problem.\n",
"title": "On Generalizing Decidable Standard Prefix Classes of First-Order Logic"
}
| null | null | null | null | true | null |
12333
| null |
Default
| null | null |
null |
{
"abstract": " We survey the theory of Poisson traces (or zeroth Poisson homology) developed\nby the authors in a series of recent papers. The goal is to understand this\nsubtle invariant of (singular) Poisson varieties, conditions for it to be\nfinite-dimensional, its relationship to the geometry and topology of symplectic\nresolutions, and its applications to quantizations. The main technique is the\nstudy of a canonical D-module on the variety. In the case the variety has\nfinitely many symplectic leaves (such as for symplectic singularities and\nHamiltonian reductions of symplectic vector spaces by reductive groups), the\nD-module is holonomic, and hence the space of Poisson traces is\nfinite-dimensional. As an application, there are finitely many irreducible\nfinite-dimensional representations of every quantization of the variety.\nConjecturally, the D-module is the pushforward of the canonical D-module under\nevery symplectic resolution of singularities, which implies that the space of\nPoisson traces is dual to the top cohomology of the resolution. We explain many\nexamples where the conjecture is proved, such as symmetric powers of du Val\nsingularities and symplectic surfaces and Slodowy slices in the nilpotent cone\nof a semisimple Lie algebra. We compute the D-module in the case of surfaces\nwith isolated singularities, and show it is not always semisimple. We also\nexplain generalizations to arbitrary Lie algebras of vector fields, connections\nto the Bernstein-Sato polynomial, relations to two-variable special polynomials\nsuch as Kostka polynomials and Tutte polynomials, and a conjectural\nrelationship with deformations of symplectic resolutions. In the appendix we\ngive a brief recollection of the theory of D-modules on singular varieties that\nwe require.\n",
"title": "Poisson traces, D-modules, and symplectic resolutions"
}
| null | null | null | null | true | null |
12334
| null |
Default
| null | null |
null |
{
"abstract": " We report on results of nonequilibrium transport measurements made on thin\nfilms of germanium-telluride (Ge_xTe) at cryogenic temperatures. Owing to a\nrather large deviation from stoichiometry (app. 10% of Ge vacancies), these\nfilms exhibit p-type conductivity with carrier-concentration N>10^20cm^(-3) and\ncan be made either in the diffusive or strongly-localized regime by a judicious\nchoice of preparation and post-treatment conditions. In both regimes the system\nshows persistent photoconductivity following excitation by a brief exposure to\ninfrared radiation. Persistent photoconductivity is also observed in GexTe\nsamples alloyed with Mn. However, in both Ge_xTe and GeMn_xTe_y the effect is\nmuch weaker than that observable in GeSb_xTe_y alloys suggesting that antimony\nplays an important role in the phenomenon. Structural studies of these films\nreveal an unusual degree of texture that is rarely realized in\nstrongly-disordered systems with high carrier-concentrations.\nAnderson-localized samples of Ge_xTe exhibit non-ergodic transport which are\ncharacteristic of intrinsic electron-glasses, including a well developed\nmemory-dip and slow relaxation of the excess conductance created in the excited\nstate. These results support the conjecture that electron-glass effects with\ninherently long relaxation times is a generic property of all\nAnderson-localized systems with large carrier-concentration.\n",
"title": "Nonequilibrium transport and Electron-Glass effects in thin GexTe films"
}
| null | null | null | null | true | null |
12335
| null |
Default
| null | null |
null |
{
"abstract": " When performing a time series analysis of continuous data, for example from\nclimate or environmental problems, the assumption that the process is Gaussian\nis often violated. Therefore, we introduce two non-Gaussian autoregressive time\nseries models that are able to fit skewed and heavy-tailed time series data.\nOur two models are based on the Tukey g-and-h transformation. We discuss\nparameter estimation, order selection, and forecasting procedures for our\nmodels and examine their performances in a simulation study. We demonstrate the\nusefulness of our models by applying them to two sets of wind speed data.\n",
"title": "Non-Gaussian Autoregressive Processes with Tukey g-and-h Transformations"
}
| null | null | null | null | true | null |
12336
| null |
Default
| null | null |
null |
{
"abstract": " The frequency responses of the K-Rb-$^{21}$Ne co-magnetometer to magnetic\nfield and exotic spin dependent forces are experimentally studied and simulated\nin this paper. Both the relationship between the output amplitude, the phase\nshift and frequencies are studied. The responses of magnetic field are\nexperimentally investigated. Due to a lack of input methods, others are\nnumerically simulated.\n",
"title": "Frequency responses of the K-Rb-$^{21}$Ne co-magnetometer"
}
| null | null | null | null | true | null |
12337
| null |
Default
| null | null |
null |
{
"abstract": " Coded caching scheme is a technique which reduce the load during peak traffic\ntimes in a wireless network system. Placement delivery array (PDA in short) was\nfirst introduced by Yan et al.. It can be used to design coded caching scheme.\nIn this paper, we prove some lower bounds of PDA on the element and some lower\nbounds of PDA on the column. We also give some constructions for optimal PDA.\n",
"title": "Some new bounds of placement delivery arrays"
}
| null | null | null | null | true | null |
12338
| null |
Default
| null | null |
null |
{
"abstract": " Previously published admissibility conditions for an element of\n$\\{0,1\\}^{\\mathbb{Z}}$ to be the itinerary of a point of the inverse limit of a\ntent map are expressed in terms of forward orbits. We give necessary and\nsufficient conditions in terms of backward orbits, which is more natural for\ninverse limits. These backward admissibility conditions are not symmetric\nversions of the forward ones: in particular, the maximum backward itinerary\nwhich can be realised by a tent map mode locks on intervals of kneading\nsequences.\n",
"title": "Itineraries for Inverse Limits of Tent Maps: a Backward View"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12339
| null |
Validated
| null | null |
null |
{
"abstract": " Grading in embedded systems courses typically requires a face-to-face\nappointment between the student and the instructor because of experimental\nsetups that are only available in laboratory facilities. Such a manual grading\nprocess is an impediment to both students and instructors. Students have to\nwait for several days to get feedback, and instructors may spend valuable time\nevaluating trivial aspects of the assignment. As seen with software courses, an\nautomated grading system can significantly improve the insights available to\nthe instructor and encourage students to learn quickly with iterative testing.\nWe have designed and implemented EmbedInsight, an automated grading system for\nembedded system courses that accommodates a wide variety of experimental setups\nand is scalable to MOOC-style courses. EmbedInsight employs a modular web\nservices design that separates the user interface and the experimental setup\nthat evaluates student assignments. We deployed and evaluated EmbedInsight for\nour university embedded systems course. We show that our system scales well to\na large number of submissions, and students are satisfied with their overall\nexperience.\n",
"title": "EmbedInsight: Automated Grading of Embedded Systems Assignments"
}
| null | null | null | null | true | null |
12340
| null |
Default
| null | null |
null |
{
"abstract": " Let $p$ be a prime number. In this article we study the restriction to\n$\\mathfrak{S}_{n-1}$ of irreducible characters of degree coprime to $p$ of\n$\\mathfrak{S}_n$. In particular, we study the combinatorial properties of the\nsubgraph $\\mathbb{Y}_{p'}$ of the Young graph $\\mathbb{Y}$. This is an\nextension to odd primes of the work done by Ayyer, Prasad and Spallone for\n$p=2$.\n",
"title": "On the $p'$-subgraph of the Young graph"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12341
| null |
Validated
| null | null |
null |
{
"abstract": " Group I elements - alkali metals Li, Na, K, Rb and Cs - are examples of\nsimple metals with one s electron in the valence band. Under pressure these\nelements display unusually complex structural behaviour transforming from\nclose-packed to low symmetry open structures. Unexpectedly complex form was\nfound for melting curves of alkalis under compression with initial increasing\nin accordance to Lindemann criterion and further decreasing to very low melting\npoint. To understand complex and low symmetry structures in compressed alkalis\na transformation of the electron energy levels was suggested which involves an\noverlap between the valence band and outer core electrons. Within the model of\nthe Fermi sphere - Brillouin zone interaction one can understand the complex\nmelting curve of alkalis.\n",
"title": "Electronic origin of melting T-P curves of alkali metals with negative slope and minimum"
}
| null | null | null | null | true | null |
12342
| null |
Default
| null | null |
null |
{
"abstract": " Identifying significant subsets of the genes, gene shaving is an essential\nand challenging issue for biomedical research for a huge number of genes and\nthe complex nature of biological networks,. Since positive definite kernel\nbased methods on genomic information can improve the prediction of diseases, in\nthis paper we proposed a new method, \"kernel gene shaving (kernel canonical\ncorrelation analysis (kernel CCA) based gene shaving). This problem is\naddressed using the influence function of the kernel CCA. To investigate the\nperformance of the proposed method in a comparison of three popular gene\nselection methods (T-test, SAM and LIMMA), we were used extensive simulated and\nreal microarray gene expression datasets. The performance measures AUC was\ncomputed for each of the methods. The achievement of the proposed method has\nimproved than the three well-known gene selection methods. In real data\nanalysis, the proposed method identified a subsets of $210$ genes out of $2000$\ngenes. The network of these genes has significantly more interactions than\nexpected, which indicates that they may function in a concerted effort on colon\ncancer.\n",
"title": "Gene Shaving using influence function of a kernel method"
}
| null | null |
[
"Statistics",
"Quantitative Biology"
] | null | true | null |
12343
| null |
Validated
| null | null |
null |
{
"abstract": " New model-independent compact representations of imaginary-time data are\npresented in terms of the intermediate representation (IR) of analytical\ncontinuation. This is motivated by a recent numerical finding by the authors\n[J. Otsuki et al., arXiv:1702.03056]. We demonstrate the efficiency of the IR\nthrough continuous-time quantum Monte Carlo calculations of an Anderson\nimpurity model. We find that the IR yields a significantly compact form of\nvarious types of correlation functions. The present framework will provide\ngeneral ways to boost the power of cutting-edge diagrammatic/quantum Monte\nCarlo treatments of many-body systems.\n",
"title": "Compressing Green's function using intermediate representation between imaginary-time and real-frequency domains"
}
| null | null | null | null | true | null |
12344
| null |
Default
| null | null |
null |
{
"abstract": " Geosciences is a field of great societal relevance that requires solutions to\nseveral urgent problems facing our humanity and the planet. As geosciences\nenters the era of big data, machine learning (ML) -- that has been widely\nsuccessful in commercial domains -- offers immense potential to contribute to\nproblems in geosciences. However, problems in geosciences have several unique\nchallenges that are seldom found in traditional applications, requiring novel\nproblem formulations and methodologies in machine learning. This article\nintroduces researchers in the machine learning (ML) community to these\nchallenges offered by geoscience problems and the opportunities that exist for\nadvancing both machine learning and geosciences. We first highlight typical\nsources of geoscience data and describe their properties that make it\nchallenging to use traditional machine learning techniques. We then describe\nsome of the common categories of geoscience problems where machine learning can\nplay a role, and discuss some of the existing efforts and promising directions\nfor methodological development in machine learning. We conclude by discussing\nsome of the emerging research themes in machine learning that are applicable\nacross all problems in the geosciences, and the importance of a deep\ncollaboration between machine learning and geosciences for synergistic\nadvancements in both disciplines.\n",
"title": "Machine Learning for the Geosciences: Challenges and Opportunities"
}
| null | null | null | null | true | null |
12345
| null |
Default
| null | null |
null |
{
"abstract": " It is well known that the affine matrix rank minimization problem is NP-hard\nand all known algorithms for exactly solving it are doubly exponential in\ntheory and in practice due to the combinational nature of the rank function. In\nthis paper, a generalized singular value thresholding operator is generated to\nsolve the affine matrix rank minimization problem. Numerical experiments show\nthat our algorithm performs effectively in finding a low-rank matrix compared\nwith some state-of-art methods.\n",
"title": "Generalized singular value thresholding operator to affine matrix rank minimization problem"
}
| null | null | null | null | true | null |
12346
| null |
Default
| null | null |
null |
{
"abstract": " The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) can\nbe viewed as information inequalities concerning entropies of linear\ntransformations of random variables. The EPI provides lower bounds for the\nentropy of linear transformations of random vectors with independent\ncomponents. The BLI, on the other hand, provides upper bounds on the entropy of\na random vector in terms of the entropies of its linear transformations. In\nthis paper, we present a new entropy inequality that generalizes both the BLI\nand EPI by considering a variety of independence relations among the components\nof a random vector. Our main technical contribution is in the proof strategy\nthat leverages the \"doubling trick\" to prove Gaussian optimality for certain\nentropy expressions under independence constraints.\n",
"title": "Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality"
}
| null | null | null | null | true | null |
12347
| null |
Default
| null | null |
null |
{
"abstract": " The risk ratio is a popular tool for summarizing the relationship between a\nbinary covariate and outcome, even when outcomes may be dependent.\nInvestigations of infectious disease outcomes in cohort studies of individuals\nembedded within clusters -- households, villages, or small groups -- often\nreport risk ratios. Epidemiologists have warned that risk ratios may be\nmisleading when outcomes are contagious, but the nature and severity of this\nerror is not well understood. In this study, we assess the epidemiologic\nmeaning of the risk ratio when outcomes are contagious. We first give a\nstructural definition of infectious disease transmission within clusters, based\non the canonical susceptible-infective epidemic model. From this standard\ncharacterization, we define the individual-level ratio of instantaneous risks\n(hazard ratio) as the inferential target, and evaluate the properties of the\nrisk ratio as an estimate of this quantity. We exhibit analytically and by\nsimulation the circumstances under which the risk ratio implies an effect whose\ndirection is opposite that of the true individual-level hazard ratio. In\nparticular, the risk ratio can be greater than one even when the covariate of\ninterest reduces both individual-level susceptibility to infection, and\ntransmissibility once infected. We explain these findings in the epidemiologic\nlanguage of confounding and relate the direction bias to Simpson's paradox.\n",
"title": "Risk ratios for contagious outcomes"
}
| null | null | null | null | true | null |
12348
| null |
Default
| null | null |
null |
{
"abstract": " The technical skill of surgeons directly impacts patient outcomes. Advanced\ntracking systems enable the development of objective motion-based metrics for\nskill evaluation, but these metrics are not sufficient to evaluate the\nperformance in complex surgical tasks. In this study, we developed metrics for\nsurgical skill evaluation that are based on the orientation of the surgical\ninstruments. Experienced robotic surgeons and novice users performed\nteleoperated (using the da Vinci Research Kit) and open needle-driving. Task\ntime and the rate of orientation change successfully distinguished between\nexperienced surgeons and novice users. Path length and the normalized angular\ndisplacement allowed for a good separation only in part of the experiment. Our\nnew promising metrics for surgical skill evaluation captured technical aspects\nthat are taught during surgeons' training. They provide complementing\nevaluation to those of classical metrics. Orientation-based metrics add value\nto skill assessment and may be an adjunct to classic objective metrics\nproviding more granular discrimination of skills.\n",
"title": "Instrument Orientation-Based Metrics for Surgical Skill Evaluation in Robot-Assisted and Open Needle Driving"
}
| null | null | null | null | true | null |
12349
| null |
Default
| null | null |
null |
{
"abstract": " We develop a method to control discrete-time systems with constant but\ninitially unknown parameters from linear temporal logic (LTL) specifications.\nWe introduce the notions of (non-deterministic) parametric and adaptive\ntransition systems and show how to use tools from formal methods to compute\nadaptive control strategies for finite systems. For infinite systems, we first\ncompute abstractions in the form of parametric finite quotient transition\nsystems and then apply the techniques for finite systems. Unlike traditional\nadaptive control methods, our approach is correct by design, does not require a\nreference model, and can deal with a much wider range of systems and\nspecifications. Illustrative case studies are included.\n",
"title": "Formal Methods for Adaptive Control of Dynamical Systems"
}
| null | null | null | null | true | null |
12350
| null |
Default
| null | null |
null |
{
"abstract": " The aim of this paper is to investigate the stability of Prandtl boundary\nlayers in the vanishing viscosity limit: $\\nu \\to 0$. In \\cite{Grenier}, one of\nthe authors proved that there exists no asymptotic expansion involving one\nPrandtl's boundary layer with thickness of order $\\sqrt\\nu$, which describes\nthe inviscid limit of Navier-Stokes equations. The instability gives rise to a\nviscous boundary sublayer whose thickness is of order $\\nu^{3/4}$. In this\npaper, we point out how the stability of the classical Prandtl's layer is\nlinked to the stability of this sublayer. In particular, we prove that the two\nlayers cannot both be nonlinearly stable in $L^\\infty$. That is, either the\nPrandtl's layer or the boundary sublayer is nonlinearly unstable in the sup\nnorm.\n",
"title": "Sublayer of Prandtl boundary layers"
}
| null | null | null | null | true | null |
12351
| null |
Default
| null | null |
null |
{
"abstract": " This paper investigates the effects of a price limit change on the volatility\nof the Korean stock market's (KRX) intraday stock price process. Based on the\nmost recent transaction data from the KRX, which experienced a change in the\nprice limit on June 15, 2015, we examine the change in realized variance after\nthe price limit change to investigate the overall effects of the change on the\nintraday market volatility. We then analyze the effects in more detail by\napplying the discrete Fourier transform (DFT) to the data set. We find evidence\nthat the market becomes more volatile in the intraday horizon because of the\nincrease in the amplitudes of the low-frequency components of the price\nprocesses after the price limit change. Therefore, liquidity providers are in a\nworse situation than they were prior to the change.\n",
"title": "Effects of a Price limit Change on Market Stability at the Intraday Horizon in the Korean Stock Market"
}
| null | null | null | null | true | null |
12352
| null |
Default
| null | null |
null |
{
"abstract": " Recent research has demonstrated the brittleness of machine learning systems\nto adversarial perturbations. However, the studies have been mostly limited to\nperturbations on images and more generally, classification that does not deal\nwith temporally varying inputs. In this paper we ask \"Are adversarial\nperturbations possible in real-time video classification systems and if so,\nwhat properties must they satisfy?\" Such systems find application in\nsurveillance applications, smart vehicles, and smart elderly care and thus,\nmisclassification could be particularly harmful (e.g., a mishap at an elderly\ncare facility may be missed). We show that accounting for temporal structure is\nkey to generating adversarial examples in such systems. We exploit recent\nadvances in generative adversarial network (GAN) architectures to account for\ntemporal correlations and generate adversarial samples that can cause\nmisclassification rates of over 80% for targeted activities. More importantly,\nthe samples also leave other activities largely unaffected making them\nextremely stealthy. Finally, we also surprisingly find that in many scenarios,\nthe same perturbation can be applied to every frame in a video clip that makes\nthe adversary's ability to achieve misclassification relatively easy.\n",
"title": "Adversarial Perturbations Against Real-Time Video Classification Systems"
}
| null | null |
[
"Statistics"
] | null | true | null |
12353
| null |
Validated
| null | null |
null |
{
"abstract": " Uniformity testing and the more general identity testing are well studied\nproblems in distributional property testing. Most previous work focuses on\ntesting under $L_1$-distance. However, when the support is very large or even\ncontinuous, testing under $L_1$-distance may require a huge (even infinite)\nnumber of samples. Motivated by such issues, we consider the identity testing\nin Wasserstein distance (a.k.a. transportation distance and earthmover\ndistance) on a metric space (discrete or continuous).\nIn this paper, we propose the Wasserstein identity testing problem (Identity\nTesting in Wasserstein distance). We obtain nearly optimal worst-case sample\ncomplexity for the problem. Moreover, for a large class of probability\ndistributions satisfying the so-called \"Doubling Condition\", we provide nearly\ninstance-optimal sample complexity.\n",
"title": "Wasserstein Identity Testing"
}
| null | null | null | null | true | null |
12354
| null |
Default
| null | null |
null |
{
"abstract": " It is known that connected sums of positive torus knots are not concordant to\n$L$-space knots. Here we consider differences of torus knots. The main result\nstates that the subgroup of the concordance group generated by two positive\ntorus knots contains no nontrivial $L$-space knots other than the torus knots\nthemselves. Generalizations to subgroups generated by more than two torus knots\nare also considered.\n",
"title": "Concordances from differences of torus knots to $L$-space knots"
}
| null | null | null | null | true | null |
12355
| null |
Default
| null | null |
null |
{
"abstract": " We study flows on C*-algebras with the Rokhlin property. We show that every\nKirchberg algebra carries a unique Rokhlin flow up to cocycle conjugacy, which\nconfirms a long-standing conjecture of Kishimoto. We moreover present a\nclassification theory for Rokhlin flows on C*-algebras satisfying certain\ntechnical properties, which hold for many C*-algebras covered by the Elliott\nprogram. As a consequence, we obtain the following further classification\ntheorems for Rokhlin flows. Firstly, we extend the statement of Kishimoto's\nconjecture to the non-simple case: Up to cocycle conjugacy, a Rokhlin flow on a\nseparable, nuclear, strongly purely infinite C*-algebra is uniquely determined\nby its induced action on the prime ideal space. Secondly, we give a complete\nclassification of Rokhlin flows on simple classifiable $KK$-contractible\nC*-algebras: Two Rokhlin flows on such a C*-algebra are cocycle conjugate if\nand only if their induced actions on the cone of lower-semicontinuous traces\nare affinely conjugate.\n",
"title": "The classification of Rokhlin flows on C*-algebras"
}
| null | null | null | null | true | null |
12356
| null |
Default
| null | null |
null |
{
"abstract": " Recently we reported an enhanced superconductivity in restacked monolayer\nTaS_2 nanosheets compared with the bulk TaS_2, pointing to the exotic physical\nproperties of low dimensional systems. Here we tune the superconducting\nproperties of this system with magnetic field along different directions, where\na strong Pauli paramagnetic spin-splitting effect is found in this system.\nImportantly, an unusual enhancement as high as 3.8 times of the upper critical\nfield B_{c2}, as compered with the Ginzburg-Landau (GL) model and Tinkham\nmodel, is observed under the inclined external magnetic field. Moreover, with\nthe out-of-plane field fixed, we find that the superconducting transition\ntemperature T_c can be enhanced by increasing the in-plane field and forms a\ndome-shaped phase diagram. An extended GL model considering the special\nmicrostructure with wrinkles was proposed to describe the results. The\nrestacked crystal structure without inversion center along with the strong\nspin-orbit coupling may also play an important role for our observations.\n",
"title": "Unusual evolution of B_{c2} and T_c with inclined fields in restacked TaS_2 nanosheets"
}
| null | null |
[
"Physics"
] | null | true | null |
12357
| null |
Validated
| null | null |
null |
{
"abstract": " We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus.\nOur so-called bounded GTS replaces parity games with novel alternative\nevaluation games where only finite paths arise. Infinite paths are not needed\neven when the considered transition system is infinite.\n",
"title": "Bounded game-theoretic semantics for modal mu-calculus"
}
| null | null | null | null | true | null |
12358
| null |
Default
| null | null |
null |
{
"abstract": " We report on thermodynamic, magnetization, and muon spin relaxation\nmeasurements of the strong spin-orbit coupled iridate Ba$_3$IrTi$_2$O$_9$,\nwhich constitutes a new frustration motif made up a mixture of edge- and\ncorner-sharing triangles. In spite of strong antiferromagnetic exchange\ninteraction of the order of 100~K, we find no hint for long-range magnetic\norder down to 23 mK. The magnetic specific heat data unveil the $T$-linear and\n-squared dependences at low temperatures below 1~K. At the respective\ntemperatures, the zero-field muon spin relaxation features a persistent spin\ndynamics, indicative of unconventional low-energy excitations. A comparison to\nthe $4d$ isostructural compound Ba$_3$RuTi$_2$O$_9$ suggests that a concerted\ninterplay of compass-like magnetic interactions and frustrated geometry\npromotes a dynamically fluctuating state in a triangle-based iridate.\n",
"title": "Putative spin liquid in the triangle-based iridate Ba$_3$IrTi$_2$O$_9$"
}
| null | null |
[
"Physics"
] | null | true | null |
12359
| null |
Validated
| null | null |
null |
{
"abstract": " There are no solid arguments to sustain that digital currencies are the\nfuture of online payments or the disruptive technology that some of its former\nparticipants declared when used to face critiques. This paper aims to solve the\ncryptocurrency puzzle from a behavioral finance perspective by finding the\nparallelism between biases present in financial markets that could be applied\nto cryptomarkets. Moreover, it is suggested that cryptocurrencies' prices are\ndriven by herding, hence this study test herding behavior under asymmetric and\nsymmetric conditions and the existence of different herding regimes by\nemploying the Markov-Switching approach.\n",
"title": "Herding behavior in cryptocurrency markets"
}
| null | null | null | null | true | null |
12360
| null |
Default
| null | null |
null |
{
"abstract": " We describe the main scientific developments that lead LIGO project to the\ndetection of the gravitational waves: general relativity, black holes and\ngravitational waves predictions; numerical relativity and the collision and\ncoalescence simulations of binary black holes and the development of different\nkind of gravitational wave detectors. Most important, this detection is\nconfirming the existence of the enigmatic black holes.\n",
"title": "Los agujeros negros y las ondas del Doctor Einstein"
}
| null | null | null | null | true | null |
12361
| null |
Default
| null | null |
null |
{
"abstract": " We obtain a sufficient and necessary condition for a finite group that could\nact effectively on closed flat manifolds. Let $G=E_{n}(R)$ the elementary\nsubgroup of a linear group, $EU_{n}(R,\\Lambda )$ the elementary subgroup of a\nunitary group, $\\mathrm{SAut}(F_{n})$ the special automorphism group of a free\ngroup or $\\mathrm{SOut}(F_{n})$ the special outer automorphism group of a free\ngroup. As applications, we prove that when $n\\geq 3$ every group action of $G$\non a closed flat manifold $M^{k}$ ($k<n$) by homeomorphisms is trivial. This\nconfirms a conjecture related to Zimmer's program for flat manifolds. Moreover,\nit is also proved that the group of homeomorphisms of closed flat manifolds are\nJordan with Jordan constants depending only on dimensions.\n",
"title": "Symmetries of flat manifolds, Jordan property and the general Zimmer program"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12362
| null |
Validated
| null | null |
null |
{
"abstract": " The fate of exotic spin liquid states with fractionalized excitations at\nfinite temperature ($T$) is of great interest, since signatures of\nfractionalization manifest in finite-temperature ($T$) dynamics in real\nsystems, above the tiny magnetic ordering scales. Here, we study a\nJordan-Wigner fermionized Kitaev spin liquid at finite $T$ employing combined\nExact diagonalization and Monte Carlo simulation methods. We uncover $(i)$\ncheckerboard or stripy-ordered flux crystals depending on density of flux, and\n$(ii)$ establish, surprisingly, that: $(a)$ the finite-$T$ version of the $T=0$\ntransition from a gapless to gapped phases in the Kitaev model is a Mott\ntransition of the fermions, belonging to the two-dimensional Ising universality\nclass. These transitions correspond to a topological transition between a\nstring condensate and a dilute closed string state $(b)$ the Mott \"insulator\"\nphase is a precise realization of Laughlin's gossamer (here, p-wave)\nsuperconductor (g-SC), and $(c)$ the Kitaev Toric Code phase (TC) is a {\\it\nfully} Gutzwiller-projected p-wave SC. These findings establish the finite-$T$\nQSL phases in the $d = 2$ to be {\\it hidden} Fermi liquid(s) of neutral\nfermions.\n",
"title": "Hidden Fermi Liquidity and Topological Criticality in the Finite Temperature Kitaev Model"
}
| null | null | null | null | true | null |
12363
| null |
Default
| null | null |
null |
{
"abstract": " Purpose: The goal of this study is to show the advantage of a collaborative\nwork in the annotation and evaluation of prostate cancer tissues from\nT2-weighted MRI compared to the commonly used double blind evaluation.\nMethods: The variability of medical findings focused on the prostate gland\n(central gland, peripheral and tumoural zones) by two independent experts was\nfirstly evaluated, and secondly compared with a consensus of these two experts.\nUsing a prostate MRI database, experts drew regions of interest (ROIs)\ncorresponding to healthy prostate (peripheral and central zones) and cancer\nusing a semi-automated tool. One of the experts then drew the ROI with\nknowledge of the other expert's ROI.\nResults: The surface area of each ROI as the Hausdorff distance and the Dice\ncoefficient for each contour were evaluated between the different experiments,\ntaking the drawing of the second expert as the reference. The results showed\nthat the significant differences between the two experts became non-significant\nwith a collaborative work.\nConclusions: This study shows that collaborative work with a dedicated tool\nallows a better consensus between expertise than using a double blind\nevaluation. Although we show this for prostate cancer evaluation in T2-weighted\nMRI, the results of this research can be extrapolated to other diseases and\nkind of medical images.\n",
"title": "Semi-automated labelling of medical images: benefits of a collaborative work in the evaluation of prostate cancer in MRI"
}
| null | null |
[
"Computer Science",
"Physics"
] | null | true | null |
12364
| null |
Validated
| null | null |
null |
{
"abstract": " Lexical features are a major source of information in state-of-the-art\ncoreference resolvers. Lexical features implicitly model some of the linguistic\nphenomena at a fine granularity level. They are especially useful for\nrepresenting the context of mentions. In this paper we investigate a drawback\nof using many lexical features in state-of-the-art coreference resolvers. We\nshow that if coreference resolvers mainly rely on lexical features, they can\nhardly generalize to unseen domains. Furthermore, we show that the current\ncoreference resolution evaluation is clearly flawed by only evaluating on a\nspecific split of a specific dataset in which there is a notable overlap\nbetween the training, development and test sets.\n",
"title": "Lexical Features in Coreference Resolution: To be Used With Caution"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12365
| null |
Validated
| null | null |
null |
{
"abstract": " The tourism industry has a significant impact on the world's economy,\ncontributes 10.2% of the world's gross domestic product in 2016. It becomes a\nvery competitive industry, where having a strong online presence is an\nessential aspect for business success. To achieve this goal, the proper usage\nof latest Web technologies, particularly schema.org annotations is crucial. In\nthis paper, we present our effort to improve the online visibility of touristic\nservice providers in the region of Tyrol, Austria, by creating and deploying a\nsubstantial amount of semantic annotations according to schema.org, a widely\nused vocabulary for structured data on the Web. We started our work from\nTourismusverband (TVB) Mayrhofen-Hippach and all touristic service providers in\nthe Mayrhofen-Hippach region and applied the same approach to other TVBs and\nregions, as well as other use cases. The rationale for doing this is\nstraightforward. Having schema.org annotations enables search engines to\nunderstand the content better, and provide better results for end users, as\nwell as enables various intelligent applications to utilize them. As a direct\nconsequence, the region of Tyrol and its touristic service increase their\nonline visibility and decrease the dependency on intermediaries, i.e. Online\nTravel Agency (OTA).\n",
"title": "Complete Semantics to empower Touristic Service Providers"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12366
| null |
Validated
| null | null |
null |
{
"abstract": " Covariate shift classification problems can in principle be tackled by\nimportance-weighting of training samples. However, the sampling variance of the\nrisk estimator is often scaled up dramatically by employing such weighting. One\nof the consequences of this is that during cross-validation -- when the\nimportance-weighted risk is repeatedly estimated -- suboptimal hyperparameter\nestimates are produced. We study the sampling variance of the\nimportance-weighted risk estimator as a function of the width of the source\ndistribution. We show that introducing a control variate can reduce its\nsampling variance, which leads to improved regularization parameter estimates\nwhen the training data is smaller in scale than the test data.\n",
"title": "Reducing variance in importance-weighted cross-validation under covariate shift"
}
| null | null | null | null | true | null |
12367
| null |
Default
| null | null |
null |
{
"abstract": " Relational probabilistic models have the challenge of aggregation, where one\nvariable depends on a population of other variables. Consider the problem of\npredicting gender from movie ratings; this is challenging because the number of\nmovies per user and users per movie can vary greatly. Surprisingly, aggregation\nis not well understood. In this paper, we show that existing relational models\n(implicitly or explicitly) either use simple numerical aggregators that lose\ngreat amounts of information, or correspond to naive Bayes, logistic\nregression, or noisy-OR that suffer from overconfidence. We propose new simple\naggregators and simple modifications of existing models that empirically\noutperform the existing ones. The intuition we provide on different (existing\nor new) models and their shortcomings plus our empirical findings promise to\nform the foundation for future representations.\n",
"title": "Comparing Aggregators for Relational Probabilistic Models"
}
| null | null | null | null | true | null |
12368
| null |
Default
| null | null |
null |
{
"abstract": " The entrepreneurial scene suffers from a sick venture capital industry, a\nnumber of imponderable illogics, and, maybe, misplaced adulation from students\nand the public. The paper details these problems, finds root causes, and\nprescribes action for higher education professionals and institutions.\n",
"title": "The Sad State of Entrepreneurship in America: What Educators Can Do About It"
}
| null | null |
[
"Computer Science"
] | null | true | null |
12369
| null |
Validated
| null | null |
null |
{
"abstract": " When used as a surrogate objective for maximum likelihood estimation in\nlatent variable models, the evidence lower bound (ELBO) produces\nstate-of-the-art results. Inspired by this, we consider the extension of the\nELBO to a family of lower bounds defined by a particle filter's estimator of\nthe marginal likelihood, the filtering variational objectives (FIVOs). FIVOs\ntake the same arguments as the ELBO, but can exploit a model's sequential\nstructure to form tighter bounds. We present results that relate the tightness\nof FIVO's bound to the variance of the particle filter's estimator by\nconsidering the generic case of bounds defined as log-transformed likelihood\nestimators. Experimentally, we show that training with FIVO results in\nsubstantial improvements over training the same model architecture with the\nELBO on sequential data.\n",
"title": "Filtering Variational Objectives"
}
| null | null | null | null | true | null |
12370
| null |
Default
| null | null |
null |
{
"abstract": " We study the annealing stability of bottom-pinned perpendicularly magnetized\nmagnetic tunnel junctions based on dual MgO free layers and thin fixed systems\ncomprising a hard [Co/Ni] multilayer antiferromagnetically coupled to thin a Co\nreference layer and a FeCoB polarizing layer. Using conventional magnetometry\nand advanced broadband ferromagnetic resonance, we identify the properties of\neach sub-unit of the magnetic tunnel junction and demonstrate that this\nmaterial option can ensure a satisfactory resilience to the 400$^\\circ$C\nthermal annealing needed in solid-state magnetic memory applications. The dual\nMgO free layer possesses an anneal-robust 0.4 T effective anisotropy and\nsuffers only a minor increase of its Gilbert damping from 0.007 to 0.010 for\nthe toughest annealing conditions. Within the fixed system, the ferro-coupler\nand texture-breaking TaFeCoB layer keeps an interlayer exchange above 0.8\nmJ/m$^2$, while the Ru antiferrocoupler layer within the synthetic\nantiferromagnet maintains a coupling above -0.5 mJ/m$^2$. These two strong\ncouplings maintain the overall functionality of the tunnel junction upon the\ntoughest annealing despite the gradual degradation of the thin Co layer\nanisotropy that may reduce the operation margin in spin torque memory\napplications. Based on these findings, we propose further optimization routes\nfor the next generation magnetic tunnel junctions.\n",
"title": "Annealing stability of magnetic tunnel junctions based on dual MgO free layers and [Co/Ni] based thin synthetic antiferromagnet fixed system"
}
| null | null |
[
"Physics"
] | null | true | null |
12371
| null |
Validated
| null | null |
null |
{
"abstract": " Eigenoptions (EOs) have been recently introduced as a promising idea for\ngenerating a diverse set of options through the graph Laplacian, having been\nshown to allow efficient exploration. Despite its initial promising results, a\ncouple of issues in current algorithms limit its application, namely: (1) EO\nmethods require two separate steps (eigenoption discovery and reward\nmaximization) to learn a control policy, which can incur a significant amount\nof storage and computation; (2) EOs are only defined for problems with discrete\nstate-spaces and; (3) it is not easy to take the environment's reward function\ninto consideration when discovering EOs. To addresses these issues, we\nintroduce an algorithm termed eigenoption-critic (EOC) based on the\nOption-critic (OC) framework [Bacon17], a general hierarchical reinforcement\nlearning (RL) algorithm that allows learning the intra-option policies\nsimultaneously with the policy over options. We also propose a generalization\nof EOC to problems with continuous state-spaces through the Nyström\napproximation. EOC can also be seen as extending OC to nonstationary settings,\nwhere the discovered options are not tailored for a single task.\n",
"title": "The Eigenoption-Critic Framework"
}
| null | null | null | null | true | null |
12372
| null |
Default
| null | null |
null |
{
"abstract": " We study some regularity properties in locally stationary Markov models which\nare fundamental for controlling the bias of nonparametric kernel estimators. In\nparticular, we provide an alternative to the standard notion of derivative\nprocess developed in the literature and that can be used for studying a wide\nclass of Markov processes. To this end, for some families of V-geometrically\nergodic Markov kernels indexed by a real parameter u, we give conditions under\nwhich the invariant probability distribution is differentiable with respect to\nu, in the sense of signed measures. Our results also complete the existing\nliterature for the perturbation analysis of Markov chains, in particular when\nexponential moments are not finite. Our conditions are checked on several\noriginal examples of locally stationary processes such as integer-valued\nautoregressive processes, categorical time series or threshold autoregressive\nprocesses.\n",
"title": "A perturbation analysis of some Markov chains models with time-varying parameters"
}
| null | null | null | null | true | null |
12373
| null |
Default
| null | null |
null |
{
"abstract": " Understanding patterns of demand is fundamental for fleet management of bike\nsharing systems. In this paper we analyze data from the Divvy system of the\ncity of Chicago. We show that the demand of bicycles can be modeled as a\nmultivariate temporal point process, with each dimension corresponding to a\nbike station in the network. The availability of daily replications of the\nprocess allows nonparametric estimation of the intensity functions, even for\nstations with low daily counts, and straightforward estimation of pairwise\ncorrelations between stations. These correlations are then used for clustering,\nrevealing different patterns of bike usage.\n",
"title": "Exploring patterns of demand in bike sharing systems via replicated point process models"
}
| null | null | null | null | true | null |
12374
| null |
Default
| null | null |
null |
{
"abstract": " The realization of high-performance, small-footprint, on-chip inductors\nremains a challenge in radio-frequency and power microelectronics, where they\nperform vital energy transduction in filters and power converters. Modern\nplanar inductors consist of metallic spirals that consume significant chip\narea, resulting in low inductance densities. We present a novel method for\nmagnetic energy transduction that utilizes ferromagnetic islands (FIs) on the\nsurface of a 3D time-reversal-invariant topological insulator (TI) to produce\nparadigmatically different inductors. Depending on the chemical potential, the\nFIs induce either an anomalous or quantum anomalous Hall effect in the\ntopological surface states. These Hall effects direct current around the FIs,\nconcentrating magnetic flux and producing a highly inductive device. Using a\nnovel self-consistent simulation that couples AC non-equilibrium Green\nfunctions to fully electrodynamic solutions of Maxwell's equations, we\ndemonstrate excellent inductance densities up to terahertz frequencies, thus\nharnessing the unique properties of topological materials for practical device\napplications.\n",
"title": "High-performance nanoscale topological energy transduction"
}
| null | null |
[
"Physics"
] | null | true | null |
12375
| null |
Validated
| null | null |
null |
{
"abstract": " This study concentrates on advancing mathematical and computational\nmethodology for radar tomography imaging in which the unknown volumetric\nvelocity distribution of a wave within a bounded domain is to be reconstructed.\nOur goal is to enable effective simulation and inversion of a large amount of\nfull-wave data within a realistic 2D or 3D geometry. For propagating and\ninverting the wave, we present a rigorous multigrid-based forward approach\nwhich utilizes the finite-difference time-domain method and a nested finite\nelement grid structure. Based on the multigrid approach, we introduce and\nvalidate a multiresolution algorithm which allows regularization of the unknown\ndistribution through a coarse-to-fine inversion scheme. In this approach,\nsparse signals can be effectively inverted, as the coarse fluctuations are\nreconstructed before the finer ones. Furthermore, the number of nonzero entries\nin the system matrix can be compressed and thus the inversion procedure can be\nspeeded up. As a test scenario we investigate satellite-based asteroid interior\nreconstruction. We use both full-wave and projected wave data and estimate the\naccuracy of the inversion under different error sources: noise and positioning\ninaccuracies. The results suggest that the present full-wave inversion approach\nallows recovering the interior with a single satellite recording backscattering\ndata. It seems that robust results can be achieved, when the peak-to-peak\nsignal-to-noise ratio is above 10 dB. Furthermore, it seems that reconstructing\nthe deep interior can be enhanced if two satellites can be utilized in the\nmeasurements.\n",
"title": "Multigrid-based inversion for volumetric radar imaging with asteroid interior reconstruction as a potential application"
}
| null | null |
[
"Physics"
] | null | true | null |
12376
| null |
Validated
| null | null |
null |
{
"abstract": " Diving induces large pressures during water entry, accompanied by the\ncreation of cavity and water splash ejected from the free water surface. To\nminimize impact forces, divers streamline their shape at impact. Here, we\ninvestigate the impact forces and splash evolution of diving wedges as a\nfunction of the wedge opening angle. A gradual transition from impactful to\nsmooth entry is observed as the wedge angle decreases. After submersion, diving\nwedges experience significantly smaller drag forces (two-fold smaller) than\nimmersed wedges. Our experimental findings compare favorably with existing\nforce models upon the introduction of empirically-based corrections. We\nexperimentally characterize the shapes of the cavity and splash created by the\nwedge and find that they are independent of the entry velocity at short times,\nbut that the splash exhibits distinct variations in shape at later times. We\npropose a one-dimensional model of the splash that takes into account gravity,\nsurface tension and aerodynamics forces. The model shows, in conjunction with\nexperimental data, that the splash shape is dominated by the interplay between\na destabilizing Venturi-suction force due to air rushing between the splash and\nthe water surface and a stabilizing force due to surface tension. Taken\ntogether, these findings could direct future research aimed at understanding\nand combining the mechanisms underlying all stages of water entry in\napplication to engineering and bio-related problems, including naval\nengineering, disease spreading or platform diving.\n",
"title": "Fluid dynamics of diving wedges"
}
| null | null | null | null | true | null |
12377
| null |
Default
| null | null |
null |
{
"abstract": " Synthetic data has proved increasingly useful in both training and testing\nmachine learning models such as neural networks. The major problem in synthetic\ndata generation is producing meaningful data that is not simply random but\nreflects properties of real-world data or covers particular cases of interest.\nIn this paper, we show how a probabilistic programming language can be used to\nguide data synthesis by encoding domain knowledge about what data is useful.\nSpecifically, we focus on data sets arising from \"scenes\", configurations of\nphysical objects; for example, images of cars on a road. We design a\ndomain-specific language, Scenic, for describing \"scenarios\" that are\ndistributions over scenes. The syntax of Scenic makes it easy to specify\ncomplex relationships between the positions and orientations of objects. As a\nprobabilistic programming language, Scenic allows assigning distributions to\nfeatures of the scene, as well as declaratively imposing hard and soft\nconstraints over the scene. A Scenic scenario thereby implicitly defines a\ndistribution over scenes, and we formulate the problem of sampling from this\ndistribution as \"scene improvisation\". We implement an improviser for Scenic\nscenarios and apply it in a case study generating synthetic data sets for a\nconvolutional neural network designed to detect cars in road images. Our\nexperiments demonstrate the usefulness of our approach by using Scenic to\nanalyze and improve the performance of the network in various scenarios.\n",
"title": "Scenic: Language-Based Scene Generation"
}
| null | null | null | null | true | null |
12378
| null |
Default
| null | null |
null |
{
"abstract": " We introduce a solvable model of driven fermions that elucidates the role of\nthe localization transition in driven disordered magnets, as used in the\ncontext of dynamic nuclear polarization. Instead of spins, we study a set of\nnon-interacting fermions that are coupled locally to nuclear spins and tend to\nhyperpolarize them. The induced hyperpolarization is a fingerprint of the\ndriven steady state of the fermions, which undergo an Anderson Localization\n(AL) transition upon increasing the disorder. Our central result is that the\nmaximal hyperpolarization level is always found close to the localization\ntransition. In the limit of small nuclear moments the maximum is pinned to the\ntransition, and the hyperpolarization is strongly enhanced by multi-fractal\ncorrelations in the critical state of the nearly localized driven system, its\nmagnitude reflecting multi-fractal scaling.\n",
"title": "An exactly solvable model for Dynamic Nuclear polarization"
}
| null | null | null | null | true | null |
12379
| null |
Default
| null | null |
null |
{
"abstract": " The Research Data Alliance is an international organization which aims at\nbuilding the technical and sociological bridges that enable the open sharing of\nscientific data. It is a remarkable forum to discuss all the aspects of\nscientific data sharing with colleagues from all around the world: in November\n2016, it has 4 500 members from 115 countries. The biannual Plenary meetings,\nwhich gather several hundred participants, are rotating between different\nregions. The March 2017 one will be held in Barcelona and the September 2017\none in Montreal, after Tokyo and Denver in 2016. The RDA work is organized\nbottom-up, with Working Groups which have 18 months to produce implementable\ndeliverables and Interest Groups which serve as platforms of communication and\ndiscussion and also produce important outputs such as surveys and\nrecommendations. There are currently 27 Working Groups and 45 Interest Groups,\ntackling a wide diversity of subjects, including community needs, reference for\nsharing, data stewardship and services, and topics related to the base\ninfrastructure of data sharing. Some scientific communities use the RDA as a\nneutral forum to define their own disciplinary data sharing framework, with\nmajor successes such as the Wheat Data Interoperability Working Group which\nworked in coordination with the International Wheat Initiative. Astronomy has\nthe IVOA to define its interoperability standards, and so we do not need to\ncreate a Group for that purpose in the RDA. But many topics discussed in the\nRDA have a strong interest for us, for instance on data citation or\ncertification of data repositories. We have a lot to share from what we have\nlearnt in building our disciplinary global data infrastructure; we also have a\nlot to learn from others. The paper discusses RDA current themes or results of\ninterest for astronomy data providers, and current liaisons with astronomy.\n",
"title": "The Research Data Alliance: Building Bridges to Enable Scientific Data Sharing"
}
| null | null | null | null | true | null |
12380
| null |
Default
| null | null |
null |
{
"abstract": " The paper reports new results of the 57Fe Mössbauer measurements on\nFe3PO4O3 powder sample recorded at various temperatures including the point of\nmagnetic phase transition TN ~ 163K. The spectra measured above TN consist of\nquadrupole doublet with high quadrupole splitting of D300K ~ 1.10 mm/s,\nemphasizing that Fe3+ ions are located in crystal positions with a strong\nelectric field gradient (EFG). In order to predict the sign and orientation of\nthe main components of the EFG tensor we calculated monopole lattice\ncontributions to the EFG. In the temperature range T < TN, the experimental\nspectra were fitted assuming that the electric hyperfine interactions are\nmodulated when the Fe3+ spin (S) rotates with respect to the EFG axis and\nemergence of spatial anisotropy of the hyperfine field Hhf = SÃI at 57Fe\nnuclei. These data were analyzed to estimate the components of the anisotropic\nhyperfine coupling tensor (Ã). The large anharmonicity parameter, m ~ 0.94,\nof the spiral spin structure results from easy-axis anisotropy in the plane of\nthe iron spin rotation. The temperature evolution of the hyperfine field Hhf(T)\nwas described by Bean-Rodbell model that takes into account that the exchange\nmagnetic interactions are strong function of the lattice spacing. The obtained\nMössbauer data are in qualitative agreement with previous neutron diffraction\ndata for a modulated helical magnetic structure in strongly frustrated\nFe3PO4O3.\n",
"title": "Modulated magnetic structure of Fe3PO7 as seen by 57Fe Mössbauer spectroscopy"
}
| null | null |
[
"Physics"
] | null | true | null |
12381
| null |
Validated
| null | null |
null |
{
"abstract": " We show that the zeroth coefficient of the cables of the HOMFLY polynomial\n(colored HOMFLY polynomials) does not distinguish mutants. This makes a sharp\ncontrast with the total HOMFLY polynomial whose 3-cables can distinguish\nmutants.\n",
"title": "Mutation invariance for the zeroth coefficients of the colored HOMFLY polynomial"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12382
| null |
Validated
| null | null |
null |
{
"abstract": " The Daya Bay Experiment consists of eight identically designed detectors\nlocated in three underground experimental halls named as EH1, EH2, EH3, with\n250, 265 and 860 meters of water equivalent vertical overburden, respectively.\nCosmic muon events have been recorded over a two-year period. The underground\nmuon rate is observed to be positively correlated with the effective\natmospheric temperature and to follow a seasonal modulation pattern. The\ncorrelation coefficient $\\alpha$, describing how a variation in the muon rate\nrelates to a variation in the effective atmospheric temperature, is found to be\n$\\alpha_{\\text{EH1}} = 0.362\\pm0.031$, $\\alpha_{\\text{EH2}} = 0.433\\pm0.038$\nand $\\alpha_{\\text{EH3}} = 0.641\\pm0.057$ for each experimental hall.\n",
"title": "Seasonal Variation of the Underground Cosmic Muon Flux Observed at Daya Bay"
}
| null | null | null | null | true | null |
12383
| null |
Default
| null | null |
null |
{
"abstract": " Ordinary least square (OLS) estimation of a linear regression model is\nwell-known to be highly sensitive to outliers. It is common practice to first\nidentify and remove outliers by looking at the data then to fit OLS and form\nconfidence intervals and p-values on the remaining data as if this were the\noriginal data collected. We show in this paper that this \"detect-and-forget\"\napproach can lead to invalid inference, and we propose a framework that\nproperly accounts for outlier detection and removal to provide valid confidence\nintervals and hypothesis tests. Our inferential procedures apply to any outlier\nremoval procedure that can be characterized by a set of quadratic constraints\non the response vector, and we show that several of the most commonly used\noutlier detection procedures are of this form. Our methodology is built upon\nrecent advances in selective inference (Taylor & Tibshirani 2015), which are\nfocused on inference corrected for variable selection. We conduct simulations\nto corroborate the theoretical results, and we apply our method to two classic\ndata sets considered in the outlier detection literature to illustrate how our\ninferential results can differ from the traditional detect-and-forget strategy.\nA companion R package, outference, implements these new procedures with an\ninterface that matches the functions commonly used for inference with lm in R.\n",
"title": "Valid Inference Corrected for Outlier Removal"
}
| null | null | null | null | true | null |
12384
| null |
Default
| null | null |
null |
{
"abstract": " Under the Riemann Hypothesis, we improve the error term in the asymptotic\nformula related to the counting lattice problem studied in a first part of this\nwork. The improvement comes from the use of Weyl's bound for exponential sums\nof polynomials and a device due to Popov allowing us to get an improved main\nterm in the sums of certain fractional parts of polynomials.\n",
"title": "On the error term of a lattice counting problem, II"
}
| null | null |
[
"Mathematics"
] | null | true | null |
12385
| null |
Validated
| null | null |
null |
{
"abstract": " Extragalactic cosmic ray populations are important diagnostic tools for\ntracking the distribution of energy in nuclei and for distinguishing between\nactivity powered by star formation versus active galactic nuclei (AGNs). Here,\nwe compare different diagnostics of the cosmic ray populations of the nuclei of\nArp 220 based on radio synchrotron observations and the recent gamma-ray\ndetection. We find the gamma-ray and radio emission to be incompatible; a joint\nsolution requires at minimum a factor of 4 - 8 times more energy coming from\nsupernovae and a factor of 40 - 70 more mass in molecular gas than is observed.\nWe conclude that this excess of gamma-ray flux in comparison to all other\ndiagnostics of star-forming activity indicates that there is an AGN present\nthat is providing the extra cosmic rays, likely in the western nucleus.\n",
"title": "Gamma-Ray Emission from Arp 220: Indications of an Active Galactic Nucleus"
}
| null | null | null | null | true | null |
12386
| null |
Default
| null | null |
null |
{
"abstract": " It has been widely accepted that electric field alone is the fundamental\nfactor for optical interference, since Wiener's experiments in 1890 proved that\nthe electric field plays such a dominant role. A group of experiments were\ndemonstrated against Wiener's experiments under the condition that the\ninterference fringes made by optical standing waves could have been\ndistinguished from the fringes of equal thickness between the inner surface of\nemulsion and the plane mirror used to build the optical standing waves. It was\nfound that the Bragg diffraction from the interference fringes formed by the\nstanding waves did not exist. This means optical standing waves did not blacken\nthe photographic emulsion, or the electric field did not play such a dominant\nrole. Therefore, instead of the electric-field energy density solely in\nproportion to the electric-field square, Energy Flux in Interference was\nproposed to represent the intensity of optical interference-field and approved\nin the derivation of equations for the interference. The derived equations\nindicate that both the electric-field vector and the magnetic-field vector are\nin phase and have equal amount of energy densities at the interference maxima\nof two light beams. Thus, the magnetic-field vector acts the same role as the\nelectric-field vector on light interacting with substance. The fundamental\nfactor of optical interference is electromagnetic energy flux densities rather\nthan electric-field alone, or the intensity of optical interference fringes\nshould be the energy flux density, not electric-field energy density.\n",
"title": "The fundamental factor of optical interference"
}
| null | null |
[
"Physics"
] | null | true | null |
12387
| null |
Validated
| null | null |
null |
{
"abstract": " We report the $4 \\, \\sigma$ detection of a faint object with a flux of ~ 0.3\nmJy, in the vicinity of the quadruply lensed QSO MG0414+0534 using the Atacama\nLarge Millimeter/submillimeter array (ALMA) Band 7. The object is most probably\na dusty dark dwarf galaxy, which has not been detected in either the optical,\nnear-infrared (NIR) or radio (cm) bands. An anomaly in the flux ratio of the\nlensed images observed in Band 7 and the mid-infrared (MIR) band and the\nreddening of the QSO light color can be simultaneously explained if we consider\nthe object as a lensing substructure with an ellipticity ~ 0.7 at a redshift of\n$0.5 \\lesssim z \\lesssim 1$. Using the best-fit lens models with three lenses,\nwe find that the dark matter plus baryon mass associated with the object is\n$\\sim 10^9\\, M_{\\odot}$, the dust mass is $\\sim 10^7\\,M_{\\odot}$ and the linear\nsize is $\\gtrsim 5\\,$kpc. Thus our findings suggest that the object is a dusty\ndark dwarf galaxy. A substantial portion of faint submillimeter galaxies (SMGs)\nin the universe may be attributed to such dark objects.\n",
"title": "Evidence for a Dusty Dark Dwarf Galaxy in the Quadruple Lens MG0414+0534"
}
| null | null | null | null | true | null |
12388
| null |
Default
| null | null |
null |
{
"abstract": " We exhibit an equivalence between the model-theoretic framework of universal\nclasses and the category-theoretic framework of locally multipresentable\ncategories. We similarly give an equivalence between abstract elementary\nclasses (AECs) admitting intersections and locally polypresentable categories.\nWe use these results to shed light on Shelah's presentation theorem for AECs.\n",
"title": "Universal abstract elementary classes and locally multipresentable categories"
}
| null | null | null | null | true | null |
12389
| null |
Default
| null | null |
null |
{
"abstract": " We propose new type of $q$-diffusive heat equation with nonsymmetric\n$q$-extension of the diffusion term. Written in relative gradient variables\nthis system appears as the $q$- viscous Burgers' equation. Exact solutions of\nthis equation in polynomial form as generalized Kampe de Feriet polynomials,\ncorresponding dynamical symmetry and description in terms of Bell polynomials\nare derived. We found the generating function for these polynomials by\napplication of dynamical symmetry and the Zassenhaus formula. We have\nconstructed and analyzed shock solitons and their interactions with different\n$q$. We obtain modification of the soliton relative speeds depending on value\nof $q$.For $q< 1$ the soliton speed becomes bounded from above and as a result\nin addition to usual Burgers soliton process of fusion, we found a new\nphenomena, when soliton with higher amplitude but smaller velocity is fissing\nto two solitons. q-Semiclassical expansion of these equations are found in\nterms of Bernoulli polynomials in power of $\\ln q$.\n",
"title": "q-Viscous Burgers' Equation: Dynamical Symmetry, Shock Solitons and q-Semiclassical Expansion"
}
| null | null | null | null | true | null |
12390
| null |
Default
| null | null |
null |
{
"abstract": " We prove that for a strongly pseudoconvex domain $D\\subset\\mathbb C^n$, the\ninfinitesimal Carathéodory metric $g_C(z,v)$ and the infinitesimal Kobayashi\nmetric $g_K(z,v)$ coincide if $z$ is sufficiently close to $bD$ and if $v$ is\nsufficiently close to being tangential to $bD$. Also, we show that every two\nclose points of $D$ sufficiently close to the boundary and whose difference is\nalmost tangential to $bD$ can be joined by a (unique up to reparameterization)\ncomplex geodesic of $D$ which is also a holomorphic retract of $D$.\nThe same continues to hold if $D$ is a worm domain, as long as the points are\nsufficiently close to a strongly pseudoconvex boundary point. We also show that\na strongly pseudoconvex boundary point of a worm domain can be globally\nexposed, this has consequences for the behavior of the squeezing function.\n",
"title": "Comparison of invariant metrics and distances on strongly pseudoconvex domains and worm domains"
}
| null | null | null | null | true | null |
12391
| null |
Default
| null | null |
null |
{
"abstract": " We define a ring R of geometric objects G generated by finite abstract\nsimplicial complexes. To every G belongs Hodge Laplacian H as the square of the\nDirac operator determining its cohomology and a unimodular connection matrix\nL). The sum of the matrix entries of the inverse of L is the Euler\ncharacteristic. The spectra of H as well as inductive dimension add under\nmultiplication while the spectra of L multiply. The nullity of the Hodge of H\nare the Betti numbers which can now be signed. The map assigning to G its\nPoincare polynomial is a ring homomorphism from R the polynomials. Especially\nthe Euler characteristic is a ring homomorphism. Also Wu characteristic\nproduces a ring homomorphism. The Kuenneth correspondence between cohomology\ngroups is explicit as a basis for the product can be obtained from a basis of\nthe factors. The product in R produces the strong product for the connection\ngraphs and leads to tensor products of connection Laplacians. The strong ring R\nis also a subring of the full Stanley-Reisner ring S Every element G can be\nvisualized by its Barycentric refinement graph G1 and its connection graph G'.\nGauss-Bonnet, Poincare-Hopf or the Brouwer-Lefschetz extend to the strong ring.\nThe isomorphism of R with a subring of the strong Sabidussi ring shows that the\nmultiplicative primes in R are the simplicial complexes and that every\nconnected element in the strong ring has a unique prime factorization. The\nSabidussi ring is dual to the Zykov ring, in which the Zykov join is the\naddition. The connection Laplacian of the d-dimensional lattice remains\ninvertible in the infinite volume limit: there is a mass gap in any dimension.\n",
"title": "The strong ring of simplicial complexes"
}
| null | null | null | null | true | null |
12392
| null |
Default
| null | null |
null |
{
"abstract": " We prove that a representation of the fundamental group of a quasi-projective\nmanifold into the group of formal diffeomorphisms of one variable either is\nvirtually abelian or, after taking the quotient by its center, factors through\nan orbicurve.\n",
"title": "Holonomy representation of quasi-projective leaves of codimension one foliations"
}
| null | null | null | null | true | null |
12393
| null |
Default
| null | null |
null |
{
"abstract": " From a super extension of the Wadati, Konno and Ichikawa scheme for\nintegrable systems and using a $\\mathrm{osp(1,2)}$ valued connection 1-form we\nobtain super generalizations for the Short Pulse equation as well for the\nElastic Beam equation.\n",
"title": "Super Extensions of the Short Pulse Equation"
}
| null | null | null | null | true | null |
12394
| null |
Default
| null | null |
null |
{
"abstract": " We introduce a combinatorial criterion for verifying whether a formula is not\nthe conjunction of an equation and a co-equation. Using this, we give a\ntransparent proof for the nonequationality of the free group, which was\noriginally proved by Sela. Furthermore, we extend this result to arbitrary free\nproducts of groups (except $\\mathbb{Z}_2*\\mathbb{Z}_2$), providing an abundance\nof new stable nonequational theories.\n",
"title": "Nonequational Stable Groups"
}
| null | null | null | null | true | null |
12395
| null |
Default
| null | null |
null |
{
"abstract": " Deep neural networks (DNNs) transform stimuli across multiple processing\nstages to produce representations that can be used to solve complex tasks, such\nas object recognition in images. However, a full understanding of how they\nachieve this remains elusive. The complexity of biological neural networks\nsubstantially exceeds the complexity of DNNs, making it even more challenging\nto understand the representations that they learn. Thus, both machine learning\nand computational neuroscience are faced with a shared challenge: how can we\nanalyze their representations in order to understand how they solve complex\ntasks?\nWe review how data-analysis concepts and techniques developed by\ncomputational neuroscientists can be useful for analyzing representations in\nDNNs, and in turn, how recently developed techniques for analysis of DNNs can\nbe useful for understanding representations in biological neural networks. We\nexplore opportunities for synergy between the two fields, such as the use of\nDNNs as in-silico model systems for neuroscience, and how this synergy can lead\nto new hypotheses about the operating principles of biological neural networks.\n",
"title": "Analyzing biological and artificial neural networks: challenges with opportunities for synergy?"
}
| null | null | null | null | true | null |
12396
| null |
Default
| null | null |
null |
{
"abstract": " Even though the evolution of an isolated quantum system is unitary, the\ncomplexity of interacting many-body systems prevents the observation of\nrecurrences of quantum states for all but the smallest systems. For large\nsystems one can not access the full complexity of the quantum states and the\nrequirements to observe a recurrence in experiments reduces to being close to\nthe initial state with respect to the employed observable. Selecting an\nobservable connected to the collective excitations in one-dimensional\nsuperfluids, we demonstrate recurrences of coherence and long range order in an\ninteracting quantum many-body system containing thousands of particles. This\nopens up a new window into the dynamics of large quantum systems even after\nthey reached a transient thermal-like state.\n",
"title": "Recurrences in an isolated quantum many-body system"
}
| null | null | null | null | true | null |
12397
| null |
Default
| null | null |
null |
{
"abstract": " We tackle the issue of classifier combinations when observations have\nmultiple views. Our method jointly learns view-specific weighted majority vote\nclassifiers (i.e. for each view) over a set of base voters, and a second\nweighted majority vote classifier over the set of these view-specific weighted\nmajority vote classifiers. We show that the empirical risk minimization of the\nfinal majority vote given a multiview training set can be cast as the\nminimization of Bregman divergences. This allows us to derive a parallel-update\noptimization algorithm for learning our multiview model. We empirically study\nour algorithm with a particular focus on the impact of the training set size on\nthe multiview learning results. The experiments show that our approach is able\nto overcome the lack of labeled information.\n",
"title": "Multiview Learning of Weighted Majority Vote by Bregman Divergence Minimization"
}
| null | null | null | null | true | null |
12398
| null |
Default
| null | null |
null |
{
"abstract": " We consider the problem of scheduling \"serverless computing\" instances such\nas Amazon Lambda functions. Instead of a quota per tenant/customer, we assume\ndemand for Lambda functions is modulated by token-bucket mechanisms per tenant.\nBased on an upper bound on the stationary number of active \"Lambda servers\"\nconsidering the execution-time distribution of Lambda functions, we describe an\napproach that the cloud could use to overbook Lambda functions for improved\nutilization of IT resources. An earlier bound for a single service tier is\nextended to the case of multiple service tiers.\n",
"title": "Temporal Overbooking of Lambda Functions in the Cloud"
}
| null | null | null | null | true | null |
12399
| null |
Default
| null | null |
null |
{
"abstract": " Degeneracy loci of morphisms between vector bundles have been used in a wide\nvariety of situations. We introduce a vast generalization of this notion, based\non orbit closures of algebraic groups in their linear representations. A\npreferred class of our orbital degeneracy loci is characterized by a certain\ncrepancy condition on the orbit closure, that allows to get some control on the\ncanonical sheaf. This condition is fulfilled for Richardson nilpotent orbits,\nand also for partially decomposable skew-symmetric three-forms in six\nvariables. In order to illustrate the efficiency and flexibility of our\nmethods, we construct in both situations many Calabi--Yau manifolds of\ndimension three and four, as well as a few Fano varieties, including some new\nFano fourfolds.\n",
"title": "Orbital degeneracy loci and applications"
}
| null | null | null | null | true | null |
12400
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.