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": " Taking an image and question as the input of our method, it can output the\ntext-based answer of the query question about the given image, so called Visual\nQuestion Answering (VQA). There are two main modules in our algorithm. Given a\nnatural language question about an image, the first module takes the question\nas input and then outputs the basic questions of the main given question. The\nsecond module takes the main question, image and these basic questions as input\nand then outputs the text-based answer of the main question. We formulate the\nbasic questions generation problem as a LASSO optimization problem, and also\npropose a criterion about how to exploit these basic questions to help answer\nmain question. Our method is evaluated on the challenging VQA dataset and\nyields state-of-the-art accuracy, 60.34% in open-ended task.\n",
"title": "VQABQ: Visual Question Answering by Basic Questions"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10301
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper, we examine the physical layer security for cooperative\nwireless networks with multiple intermediate nodes, where the\ndecode-and-forward (DF) protocol is considered. We propose a new joint relay\nand jammer selection (JRJS) scheme for protecting wireless communications\nagainst eavesdropping, where an intermediate node is selected as the relay for\nthe sake of forwarding the source signal to the destination and meanwhile, the\nremaining intermediate nodes are employed to act as friendly jammers which\nbroadcast the artificial noise for disturbing the eavesdropper. We further\ninvestigate the power allocation among the source, relay and friendly jammers\nfor maximizing the secrecy rate of proposed JRJS scheme and derive a\nclosed-form sub-optimal solution. Specificially, all the intermediate nodes\nwhich successfully decode the source signal are considered as relay candidates.\nFor each candidate, we derive the sub-optimal closed-form power allocation\nsolution and obtain the secrecy rate result of the corresponding JRJS scheme.\nThen, the candidate which is capable of achieving the highest secrecy rate is\nselected as the relay. Two assumptions about the channel state information\n(CSI), namely the full CSI (FCSI) and partial CSI (PCSI), are considered.\nSimulation results show that the proposed JRJS scheme outperforms the\nconventional pure relay selection, pure jamming and GSVD based beamforming\nschemes in terms of secrecy rate. Additionally, the proposed FCSI based power\nallocation (FCSI-PA) and PCSI based power allocation (PCSI-PA) schemes both\nachieve higher secrecy rates than the equal power allocation (EPA) scheme.\n",
"title": "Power-Constrained Secrecy Rate Maximization for Joint Relay and Jammer Selection Assisted Wireless Networks"
}
| null | null |
[
"Computer Science",
"Mathematics"
] | null | true | null |
10302
| null |
Validated
| null | null |
null |
{
"abstract": " Superconducting bulks, acting as high-field permanent magnets, are promising\nfor many applications. An important effect in bulk permanent magnets is\ncrossed-field demagnetization, which can reduce the magnetic field in\nsuperconductors due to relatively small transverse fields. Crossed-field\ndemagnetization has not been studied in sample shapes such as rectangular\nprisms or cubes. This contribution presents a study based on both 3D numerical\nmodelling and experiments. We study a cubic Gd-Ba-Cu-O bulk superconductor\nsample of size 6 mm magnetized by field cooling in an external field of around\n1.3 T, which is later submitted to crossed-field magnetic fields of up to 164\nmT. Modelling results agree with experiments, except at transverse fields 50\\%\nor above of the initial trapped field. The current paths present a strong 3D\nnature. For instance, at the mid-plane perpendicular to the initial magnetizing\nfield, the current density in this direction changes smoothly from the critical\nmagnitude, ${J_c}$, at the lateral sides to zero at a certain penetration\ndepth. This indicates a rotation of the current density with magnitude ${J_c}$,\nand hence force free effects like flux cutting are expected to play a\nsignificant role.\n",
"title": "Demagnetization of cubic Gd-Ba-Cu-O bulk superconductor by cross-fields: measurements and 3D modelling"
}
| null | null | null | null | true | null |
10303
| null |
Default
| null | null |
null |
{
"abstract": " The inability to efficiently tune the optical properties of waveguiding\nstructures has been one of the major hurdles for the future scalability of\nintegrated photonic systems. In silicon photonics, although dynamic tuning has\nbeen achieved with various mechanisms, even the most effective thermo-optic\neffect offers a refractive index change of only $1.86 \\times 10^{-4} K^{-1}$.\nTo enhance this small change, light recycling based on resonators has been\nemployed in order to realize efficient modulators, phase shifters, and optical\nswitches. However, the resonant enhancement comes at a great cost of optical\nbandwidth, fabrication tolerance and system scalability. Here we demonstrate a\nscalable light recycling approach based on spatial-mode multiplexing. Our\napproach offers a fabrication tolerance of ${\\pm}$ 15 nm, in stark contrast to\nthe non-scalable subnanometer tolerance in typical silicon resonators. We\nexperimentally demonstrate light recycling up to 7 passes with an optical\nbandwidth greater than 100 nm. We realize power-efficient thermo-optic phase\nshifters that require only 1.7 mW per ${\\pi}$, representing more than an 8-fold\nreduction in the power consumption.\n",
"title": "Resonance-Free Light Recycling"
}
| null | null | null | null | true | null |
10304
| null |
Default
| null | null |
null |
{
"abstract": " Traditionally, Blind Speech Separation techniques are computationally\nexpensive as they update the demixing matrix at every time frame index, making\nthem impractical to use in many Real-Time applications. In this paper, a robust\ndata-driven two-microphone sound source localization method is used as a\ncriterion to reduce the computational complexity of the Independent Vector\nAnalysis (IVA) Blind Speech Separation (BSS) method. IVA is used to separate\nconvolutedly mixed speech and noise sources. The practical feasibility of the\nproposed method is proved by implementing it on a smartphone device to separate\nspeech and noise in Real-World scenarios for Hearing-Aid applications. The\nexperimental results with objective and subjective tests reveal the practical\nusability of the developed method in many real-world applications.\n",
"title": "A Computationally Efficient and Practically Feasible Two Microphones Blind Speech Separation Method"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10305
| null |
Validated
| null | null |
null |
{
"abstract": " Inelastic neutron scattering has been used to study the magneto-elastic\nexcitations in the multiferroic manganite hexagonal YMnO$_3$. An avoided\ncrossing is found between magnon and phonon modes close to the Brillouin zone\nboundary in the $(a,b)$-plane. Neutron polarization analysis reveals that this\nmode has mixed magnon-phonon character. An external magnetic field along the\n$c$-axis is observed to cause a linear field-induced splitting of one of the\nspin wave branches. A theoretical description is performed, using a Heisenberg\nmodel of localized spins, acoustic phonon modes and a magneto-elastic coupling\nvia the single-ion magnetostriction. The model quantitatively reproduces the\ndispersion and intensities of all modes in the full Brillouin zone, describes\nthe observed magnon-phonon hybridized modes, and quantifies the magneto-elastic\ncoupling. The combined information, including the field-induced magnon\nsplitting, allows us to exclude several of the earlier proposed models and\npoint to the correct magnetic ground state symmetry, and provides an effective\ndynamic model relevant for the multiferroic hexagonal manganites.\n",
"title": "Magnetic ground state and magnon-phonon interaction in multiferroic h-YMnO$_3$"
}
| null | null | null | null | true | null |
10306
| null |
Default
| null | null |
null |
{
"abstract": " We present a novel methodology to enable control of a neuromorphic circuit in\nclose analogy with the physiological neuromodulation of a single neuron. The\nmethodology is general in that it only relies on a parallel interconnection of\nelementary voltage-controlled current sources. In contrast to controlling a\nnonlinear circuit through the parameter tuning of a state-space model, our\napproach is purely input-output. The circuit elements are controlled and\ninterconnected to shape the current-voltage characteristics (I-V curves) of the\ncircuit in prescribed timescales. In turn, shaping those I-V curves determines\nthe excitability properties of the circuit. We show that this methodology\nenables both robust and accurate control of the circuit behavior and resembles\nthe biophysical mechanisms of neuromodulation. As a proof of concept, we\nsimulate a SPICE model composed of MOSFET transconductance amplifiers operating\nin the weak inversion regime.\n",
"title": "Neuromodulation of Neuromorphic Circuits"
}
| null | null | null | null | true | null |
10307
| null |
Default
| null | null |
null |
{
"abstract": " We introduce a few variants on Frank-Wolfe style algorithms suitable for\nlarge scale optimization. We show how to modify the standard Frank-Wolfe\nalgorithm using stochastic gradients, approximate subproblem solutions, and\nsketched decision variables in order to scale to enormous problems while\npreserving (up to constants) the optimal convergence rate\n$\\mathcal{O}(\\frac{1}{k})$.\n",
"title": "Frank-Wolfe Style Algorithms for Large Scale Optimization"
}
| null | null | null | null | true | null |
10308
| null |
Default
| null | null |
null |
{
"abstract": " We theoretically investigate an ultrastrongly-coupled micromaser based on\nRydberg atoms interacting with a superconducting LC resonator, where the common\nrotating-wave approximation and slowly-varying-envelope approximation are no\nlonger applicable. The effect of counter-rotating terms on the masing dynamics\nis studied in detail. We find that the intraresonator electric energy declines\nand the microwave oscillation frequency shifts significantly in the regime of\nultrastrong coupling. Additionally, the micromaser phase fluctuation is\nsuppressed, resulting in a reduced spectral linewidth.\n",
"title": "Theoretical Description of Micromaser in the Ultrastrong-Coupling Regime"
}
| null | null |
[
"Physics"
] | null | true | null |
10309
| null |
Validated
| null | null |
null |
{
"abstract": " In his work of 1969, Merle E. Manis introduced valuations on commutative\nrings. Recently, the class of totally quasi-ordered rings was developped by the\nsecond author. In the present paper, we establish the notion of compatibility\nbetween valuations and quasi-orders on rings, leading to a definition of the\nrank of a quasi-ordered ring. Moreover, we prove a Baer-Krull Theorem for\nquasi-ordered rings: fixing a Manis valuation v on R, we characterize all\nv-compatible quasi-orders of R by lifting the quasi-orders from the residue\nclass ring to R itself.\n",
"title": "Compatibility of quasi-orderings and valuations; A Baer-Krull Theorem for quasi-ordered Rings"
}
| null | null | null | null | true | null |
10310
| null |
Default
| null | null |
null |
{
"abstract": " Electron Cryo-Tomography (ECT) allows 3D visualization of subcellular\nstructures at the submolecular resolution in close to the native state.\nHowever, due to the high degree of structural complexity and imaging limits,\nthe automatic segmentation of cellular components from ECT images is very\ndifficult. To complement and speed up existing segmentation methods, it is\ndesirable to develop a generic cell component segmentation method that is 1)\nnot specific to particular types of cellular components, 2) able to segment\nunknown cellular components, 3) fully unsupervised and does not rely on the\navailability of training data. As an important step towards this goal, in this\npaper, we propose a saliency detection method that computes the likelihood that\na subregion in a tomogram stands out from the background. Our method consists\nof four steps: supervoxel over-segmentation, feature extraction, feature matrix\ndecomposition, and computation of saliency. The method produces a distribution\nmap that represents the regions' saliency in tomograms. Our experiments show\nthat our method can successfully label most salient regions detected by a human\nobserver, and able to filter out regions not containing cellular components.\nTherefore, our method can remove the majority of the background region, and\nsignificantly speed up the subsequent processing of segmentation and\nrecognition of cellular components captured by ECT.\n",
"title": "Feature Decomposition Based Saliency Detection in Electron Cryo-Tomograms"
}
| null | null |
[
"Statistics",
"Quantitative Biology"
] | null | true | null |
10311
| null |
Validated
| null | null |
null |
{
"abstract": " Most of the existing characterizations of the integral input-to-state\nstability (iISS) property are not valid for time-varying or switched systems in\ncases where converse Lyapunov theorems for stability are not available. This\nnote provides a characterization that is valid for switched and time-varying\nsystems, and shows that natural extensions of some of the existing\ncharacterizations result in only sufficient but not necessary conditions. The\nresults provided also pinpoint suitable iISS gains and relate these to supply\nfunctions and bounds on the function defining the system dynamics.\n",
"title": "A Characterization of Integral ISS for Switched and Time-varying Systems"
}
| null | null |
[
"Computer Science",
"Mathematics"
] | null | true | null |
10312
| null |
Validated
| null | null |
null |
{
"abstract": " We introduce a new ferromagnetic model capable of reproducing one of the most\nintriguing properties of collective behaviour in starling flocks, namely the\nfact that strong collective order of the system coexists with scale-free\ncorrelations of the modulus of the microscopic degrees of freedom, that is the\nbirds' speeds. The key idea of the new theory is that the single-particle\npotential needed to bound the modulus of the microscopic degrees of freedom\naround a finite value, is marginal, that is has zero curvature. We study the\nmodel by using mean-field approximation and Monte Carlo simulations in three\ndimensions, complemented by finite-size scaling analysis. While at the standard\ncritical temperature, $T_c$, the properties of the marginal model are exactly\nthe same as a normal ferromagnet with continuous symmetry-breaking, our results\nshow that a novel zero-temperature critical point emerges, so that in its\ndeeply ordered phase the marginal model develops divergent susceptibility and\ncorrelation length of the modulus of the microscopic degrees of freedom, in\ncomplete analogy with experimental data on natural flocks of starlings.\n",
"title": "Low-temperature marginal ferromagnetism explains anomalous scale-free correlations in natural flocks"
}
| null | null | null | null | true | null |
10313
| null |
Default
| null | null |
null |
{
"abstract": " In this paper I will present a short scientific biography of Guido Altarelli,\nbriefly describing some of his most important seminal works. I will analyze in\ngreat details the paper of the $q^2$ evolution of the effective quark\ndistribution: I will put this paper in a historical perspective, describing our\ntheoretical understanding at that time and the reasons why the paper was so\nsuccessful.\n",
"title": "Historical and personal recollections of Guido Altarelli"
}
| null | null | null | null | true | null |
10314
| null |
Default
| null | null |
null |
{
"abstract": " This work addresses the problem of segmentation in time series data with\nrespect to a statistical parameter of interest in Bayesian models. It is common\nto assume that the parameters are distinct within each segment. As such, many\nBayesian change point detection models do not exploit the segment parameter\npatterns, which can improve performance. This work proposes a Bayesian\nmean-shift change point detection algorithm that makes use of repetition in\nsegment parameters, by introducing segment class labels that utilise a\nDirichlet process prior. The performance of the proposed approach was assessed\non both synthetic and real world data, highlighting the enhanced performance\nwhen using parameter labelling.\n",
"title": "Segment Parameter Labelling in MCMC Mean-Shift Change Detection"
}
| null | null | null | null | true | null |
10315
| null |
Default
| null | null |
null |
{
"abstract": " We propose in this article a M/G/c/c state dependent queuing model for road\ntraffic flow. The model is based on finite capacity queuing theory which\ncaptures the stationary density-flow relationships. It is also inspired from\nthe deterministic Godunov scheme for the road traffic simulation. We first\npresent a reformulation of the existing linear case of M/G/c/c state dependent\nmodel, in order to use flow rather than speed variables. We then extend this\nmodel in order to consider upstream traffic demand and downstream traffic\nsupply. After that, we propose the model for two road sections in tandem where\nboth sections influence each other. In order to deal with this mutual\ndependence, we solve an implicit system given by an algebraic equation.\nFinally, we derive some performance measures (throughput and expected travel\ntime). A comparison with results predicted by the M/G/c/c state dependent\nqueuing networks shows that the model we propose here captures really the\ndynamics of the road traffic.\n",
"title": "M/G/c/c state dependent queuing model for a road traffic system of two sections in tandem"
}
| null | null |
[
"Computer Science",
"Mathematics"
] | null | true | null |
10316
| null |
Validated
| null | null |
null |
{
"abstract": " This paper considers the Laplace method to derive approximate inference for\nthe Gaussian process (GP) regression in the location and scale parameters of\nthe Student-t probabilistic model. This allows both mean and variance of the\ndata to vary as a function of covariates with the attractive feature that the\nStudent-t model has been widely used as a useful tool for robustifying data\nanalysis. The challenge in the approximate inference for the GP regression with\nthe Student-t probabilistic model, lies in the analytical intractability of the\nposterior distribution and the lack of concavity of the log-likelihood\nfunction. We present the natural gradient adaptation for the estimation process\nwhich primarily relies on the property that the Student-t model naturally has\northogonal parametrization with respect to the location and scale paramaters.\nDue to this particular property of the model, we also introduce an alternative\nLaplace approximation by using the Fisher information matrix in place of the\nHessian matrix of the negative log-likelihood function. According to\nexperiments this alternative approximation provides very similar posterior\napproximations and predictive performance when compared to the traditional\nLaplace approximation. We also compare both of these Laplace approximations\nwith the Monte Carlo Markov Chain (MCMC) method. Moreover, we compare our\nheteroscedastic Student-t model and the GP regression with the heteroscedastic\nGaussian model. We also discuss how our approach can improve the inference\nalgorithm in cases where the probabilistic model assumed for the data is not\nlog-concave.\n",
"title": "Laplace approximation and the natural gradient for Gaussian process regression with the heteroscedastic Student-t model"
}
| null | null |
[
"Statistics"
] | null | true | null |
10317
| null |
Validated
| null | null |
null |
{
"abstract": " We study the fixed point theory of n-valued maps of a space X using the fixed\npoint theory of maps between X and its configuration spaces. We give some\ngeneral results to decide whether an n-valued map can be deformed to a fixed\npoint free n-valued map. In the case of surfaces, we provide an algebraic\ncriterion in terms of the braid groups of X to study this problem. If X is\neither the k-dimensional ball or an even-dimensional real or complex projective\nspace, we show that the fixed point property holds for n-valued maps for all n\n$\\ge$ 1, and we prove the same result for even-dimensional spheres for all n\n$\\ge$ 2. If X is the 2-torus, we classify the homotopy classes of 2-valued maps\nin terms of the braid groups of X. We do not currently have a complete\ncharacterisation of the homotopy classes of split 2-valued maps of the 2-torus\nthat contain a fixed point free representative, but we give an infinite family\nof such homotopy classes.\n",
"title": "Fixed points of n-valued maps, the fixed point property and the case of surfaces -- a braid approach"
}
| null | null | null | null | true | null |
10318
| null |
Default
| null | null |
null |
{
"abstract": " The Large Synoptic Survey Telescope (LSST) will enable revolutionary studies\nof galaxies, dark matter, and black holes over cosmic time. The LSST Galaxies\nScience Collaboration has identified a host of preparatory research tasks\nrequired to leverage fully the LSST dataset for extragalactic science beyond\nthe study of dark energy. This Galaxies Science Roadmap provides a brief\nintroduction to critical extragalactic science to be conducted ahead of LSST\noperations, and a detailed list of preparatory science tasks including the\nmotivation, activities, and deliverables associated with each. The Galaxies\nScience Roadmap will serve as a guiding document for researchers interested in\nconducting extragalactic science in anticipation of the forthcoming LSST era.\n",
"title": "Large Synoptic Survey Telescope Galaxies Science Roadmap"
}
| null | null |
[
"Physics"
] | null | true | null |
10319
| null |
Validated
| null | null |
null |
{
"abstract": " CO2 capture and storage is an important technology for mitigating climate\nchange. Design of efficient strategies for safe, long-term storage requires the\ncapability to efficiently simulate processes taking place on very different\ntemporal and spatial scales. The physical laws describing CO2 storage are the\nsame as for hydrocarbon recovery, but the characteristic spatial and temporal\nscales are quite different. Petroleum reservoirs seldom extend more than tens\nof kilometers and have operational horizons spanning decades. Injected CO2\nneeds to be safely contained for hundreds or thousands of years, during which\nit can migrate hundreds or thousands of kilometers. Because of the vast scales\ninvolved, conventional 3D reservoir simulation quickly becomes computationally\nunfeasible. Large density difference between injected CO2 and resident brine\nmeans that vertical segregation will take place relatively quickly, and\ndepth-integrated models assuming vertical equilibrium (VE) often represents a\nbetter strategy to simulate long-term migration of CO2 in large-scale aquifer\nsystems. VE models have primarily been formulated for relatively simple rock\nformations and have not been coupled to 3D simulation in a uniform way. In\nparticular, known VE simulations have not been applied to models of realistic\ngeology in which many flow compartments may exist in-between impermeable\nlayers. In this paper, we generalize the concept of VE models, formulated in\nterms of well-proven reservoir simulation technology, to complex aquifer\nsystems with multiple layers and regions. We also introduce novel formulations\nfor multi-layered VE models by use of both direct spill and diffuse leakage\nbetween individual layers. This new layered 3D model is then coupled to a\nstate-of-the-art, 3D black-oil type model.\n",
"title": "Multiresolution Coupled Vertical Equilibrium Model for Fast Flexible Simulation of CO$_2$ Storage"
}
| null | null | null | null | true | null |
10320
| null |
Default
| null | null |
null |
{
"abstract": " A GelSight sensor uses an elastomeric slab covered with a reflective membrane\nto measure tactile signals. It measures the 3D geometry and contact force\ninformation with high spacial resolution, and successfully helped many\nchallenging robot tasks. A previous sensor, based on a semi-specular membrane,\nproduces high resolution but with limited geometry accuracy. In this paper, we\ndescribe a new design of GelSight for robot gripper, using a Lambertian\nmembrane and new illumination system, which gives greatly improved geometric\naccuracy while retaining the compact size. We demonstrate its use in measuring\nsurface normals and reconstructing height maps using photometric stereo. We\nalso use it for the task of slip detection, using a combination of information\nabout relative motions on the membrane surface and the shear distortions. Using\na robotic arm and a set of 37 everyday objects with varied properties, we find\nthat the sensor can detect translational and rotational slip in general cases,\nand can be used to improve the stability of the grasp.\n",
"title": "Improved GelSight Tactile Sensor for Measuring Geometry and Slip"
}
| null | null | null | null | true | null |
10321
| null |
Default
| null | null |
null |
{
"abstract": " Our visual perception of our surroundings is ultimately limited by the\ndiffraction limit, which stipulates that optical information smaller than\nroughly half the illumination wavelength is not retrievable. Over the past\ndecades, many breakthroughs have led to unprecedented imaging capabilities\nbeyond the diffraction-limit, with applications in biology and nanotechnology.\nIn this context, nano-photonics has revolutionized the field of optics in\nrecent years by enabling the manipulation of light-matter interaction with\nsubwavelength structures. However, despite the many advances in this field, its\nimpact and penetration in our daily life has been hindered by a convoluted and\niterative process, cycling through modeling, nanofabrication and\nnano-characterization. The fundamental reason is the fact that not only the\nprediction of the optical response is very time consuming and requires solving\nMaxwell's equations with dedicated numerical packages. But, more significantly,\nthe inverse problem, i.e. designing a nanostructure with an on-demand optical\nresponse, is currently a prohibitive task even with the most advanced numerical\ntools due to the high non-linearity of the problem. Here, we harness the power\nof Deep Learning, a new path in modern machine learning, and show its ability\nto predict the geometry of nanostructures based solely on their far-field\nresponse. This approach also addresses in a direct way the currently\ninaccessible inverse problem breaking the ground for on-demand design of\noptical response with applications such as sensing, imaging and also for\nplasmon's mediated cancer thermotherapy.\n",
"title": "Deep Learning for Design and Retrieval of Nano-photonic Structures"
}
| null | null | null | null | true | null |
10322
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we consider the community detection problem under either the\nstochastic block model (SBM) assumption or the degree-correlated stochastic\nblock model (DCSBM) assumption. The modularity maximization formulation for the\ncommunity detection problem is NP-hard in general. In this paper, we propose a\nsparse and low-rank completely positive relaxation for the modularity\nmaximization problem, we then develop an efficient row-by-row (RBR) type block\ncoordinate descent (BCD) algorithm to solve the relaxation and prove an\n$\\mathcal{O}(1/\\sqrt{N})$ convergence rate to a stationary point where $N$ is\nthe number of iterations. A fast rounding scheme is constructed to retrieve the\ncommunity structure from the solution. Non-asymptotic high probability bounds\non the misclassification rate are established to justify our approach. We\nfurther develop an asynchronous parallel RBR algorithm to speed up the\nconvergence. Extensive numerical experiments on both synthetic and real world\nnetworks show that the proposed approach enjoys advantages in both clustering\naccuracy and numerical efficiency. Our numerical results indicate that the\nnewly proposed method is a quite competitive alternative for community\ndetection on sparse networks with over 50 million nodes.\n",
"title": "A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection"
}
| null | null | null | null | true | null |
10323
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we build upon previous work on designing informative and\nefficient Exploratory Landscape Analysis features for characterizing problems'\nlandscapes and show their effectiveness in automatically constructing algorithm\nselection models in continuous black-box optimization problems. Focussing on\nalgorithm performance results of the COCO platform of several years, we\nconstruct a representative set of high-performing complementary solvers and\npresent an algorithm selection model that - compared to the portfolio's single\nbest solver - on average requires less than half of the resources for solving a\ngiven problem. Therefore, there is a huge gain in efficiency compared to\nclassical ensemble methods combined with an increased insight into problem\ncharacteristics and algorithm properties by using informative features. Acting\non the assumption that the function set of the Black-Box Optimization Benchmark\nis representative enough for practical applications the model allows for\nselecting the best suited optimization algorithm within the considered set for\nunseen problems prior to the optimization itself based on a small sample of\nfunction evaluations. Note that such a sample can even be reused for the\ninitial population of an evolutionary (optimization) algorithm so that even the\nfeature costs become negligible.\n",
"title": "Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning"
}
| null | null | null | null | true | null |
10324
| null |
Default
| null | null |
null |
{
"abstract": " Vehicle-to-vehicle communications can change the driving behavior of drivers\nsignificantly by providing them rich information on downstream traffic flow\nconditions. This study seeks to model the varying car-following behaviors\ninvolving connected vehicles and human-driving vehicles in mixed traffic flow.\nA revised car-following model is developed using an intelligent driver model\n(IDM) to capture drivers' perceptions of their preceding traffic conditions\nthrough vehicle-to-vehicle communications. Stability analysis of the mixed\ntraffic flow is conducted for a specific case. Numerical results show that the\nstable region is apparently enlarged compared with the IDM.\n",
"title": "Car-following behavior of connected vehicles in a mixed traffic flow: modeling and stability analysis"
}
| null | null | null | null | true | null |
10325
| null |
Default
| null | null |
null |
{
"abstract": " We show that the two-weight estimate for the dyadic square function proved by\nLacey--Li in [2] is sharp.\n",
"title": "A note on a two-weight estimate for the dyadic square function"
}
| null | null | null | null | true | null |
10326
| null |
Default
| null | null |
null |
{
"abstract": " Observations of nine transits of WASP-107 during the {\\it K2} mission reveal\nthree separate occasions when the planet crossed in front of a starspot. The\ndata confirm the stellar rotation period to be 17 days --- approximately three\ntimes the planet's orbital period --- and suggest that large spots persist for\nat least one full rotation. If the star had a low obliquity, at least two\nadditional spot crossings should have been observed. They were not observed,\ngiving evidence for a high obliquity. We use a simple geometric model to show\nthat the obliquity is likely in the range 40-140$^\\circ$, i.e., both spin-orbit\nalignment and anti-alignment can be ruled out. WASP-107 thereby joins the small\ncollection of relatively low-mass stars hosting a giant planet with a high\nobliquity. Most such stars have been observed to have low obliquities; all the\nexceptions, including WASP-107, involve planets with relatively wide orbits\n(\"warm Jupiters\", with $a_{\\rm min}/R_\\star \\gtrsim 8$). This demonstrates a\nconnection between stellar obliquity and planet properties, in contradiction to\nsome theories for obliquity excitation.\n",
"title": "The Oblique Orbit of WASP-107b from K2 Photometry"
}
| null | null |
[
"Physics"
] | null | true | null |
10327
| null |
Validated
| null | null |
null |
{
"abstract": " In this article, we give some reviews concerning negative probabilities model\nand quasi-infinitely divisible at the beginning. We next extend Feller's\ncharacterization of discrete infinitely divisible distributions to signed\ndiscrete infinitely divisible distributions, which are discrete pseudo compound\nPoisson (DPCP) distributions with connections to the Lévy-Wiener theorem.\nThis is a special case of an open problem which is proposed by Sato(2014),\nChaumont and Yor(2012). An analogous result involving characteristic functions\nis shown for signed integer-valued infinitely divisible distributions. We show\nthat many distributions are DPCP by the non-zero p.g.f. property, such as the\nmixed Poisson distribution and fractional Poisson process. DPCP has some\nbizarre properties, and one is that the parameter $\\lambda $ in the DPCP class\ncannot be arbitrarily small.\n",
"title": "A characterization of signed discrete infinitely divisible distributions"
}
| null | null | null | null | true | null |
10328
| null |
Default
| null | null |
null |
{
"abstract": " Advances in virtual reality have generated substantial interest in accurately\nreproducing and storing spatial audio in the higher order ambisonics (HOA)\nrepresentation, given its rendering flexibility. Recent standardization for HOA\ncompression adopted a framework wherein HOA data are decomposed into principal\ncomponents that are then encoded by standard audio coding, i.e., frequency\ndomain quantization and entropy coding to exploit psychoacoustic redundancy. A\nnoted shortcoming of this approach is the occasional mismatch in principal\ncomponents across blocks, and the resulting suboptimal transitions in the data\nfed to the audio coder. Instead, we propose a framework where singular value\ndecomposition (SVD) is performed after transformation to the frequency domain\nvia the modified discrete cosine transform (MDCT). This framework not only\nensures smooth transition across blocks, but also enables frequency dependent\nSVD for better energy compaction. Moreover, we introduce a novel noise\nsubstitution technique to compensate for suppressed ambient energy in discarded\nhigher order ambisonics channels, which significantly enhances the perceptual\nquality of the reconstructed HOA signal. Objective and subjective evaluation\nresults provide evidence for the effectiveness of the proposed framework in\nterms of both higher compression gains and better perceptual quality, compared\nto existing methods.\n",
"title": "Frequency Domain Singular Value Decomposition for Efficient Spatial Audio Coding"
}
| null | null | null | null | true | null |
10329
| null |
Default
| null | null |
null |
{
"abstract": " Understanding the dynamical behavior of complex systems is of exceptional\nrelevance in everyday life, from biology to economy. In order to describe the\ndynamical organization of complex systems, existing methods require the\nknowledge of the network topology. By contrast, in this thesis we develop a new\nmethod based on Information Theory which does not require any topological\nknowledge. We introduce the Dynamical Cluster Index to detect those groups of\nsystem elements which have strong mutual interactions, named as Relevant\nSubsets. Among them, we identify those which exchange most information with the\nrest of the system, thus being the most influential for its dynamics. In order\nto detect such Functional Dynamical Structures, we introduce another\ninformation theoretic measure, called D-index. The experimental results make us\nconfident that our method can be effectively used to study both artificial and\nnatural complex systems.\n",
"title": "Functional Dynamical Structures in Complex Systems: an Information-Theoretic Approach"
}
| null | null |
[
"Physics"
] | null | true | null |
10330
| null |
Validated
| null | null |
null |
{
"abstract": " Quantum gas microscopes are a promising tool to study interacting quantum\nmany-body systems and bridge the gap between theoretical models and real\nmaterials. So far they were limited to measurements of instantaneous\ncorrelation functions of the form $\\langle \\hat{O}(t) \\rangle$, even though\nextensions to frequency-resolved response functions $\\langle \\hat{O}(t)\n\\hat{O}(0) \\rangle$ would provide important information about the elementary\nexcitations in a many-body system. For example, single particle spectral\nfunctions, which are usually measured using photoemission experiments in\nelectron systems, contain direct information about fractionalization and the\nquasiparticle excitation spectrum. Here, we propose a measurement scheme to\nexperimentally access the momentum and energy resolved spectral function in a\nquantum gas microscope with currently available techniques. As an example for\npossible applications, we numerically calculate the spectrum of a single hole\nexcitation in one-dimensional $t-J$ models with isotropic and anisotropic\nantiferromagnetic couplings. A sharp asymmetry in the distribution of spectral\nweight appears when a hole is created in an isotropic Heisenberg spin chain.\nThis effect slowly vanishes for anisotropic spin interactions and disappears\ncompletely in the case of pure Ising interactions. The asymmetry strongly\ndepends on the total magnetization of the spin chain, which can be tuned in\nexperiments with quantum gas microscopes. An intuitive picture for the observed\nbehavior is provided by a slave-fermion mean field theory. The key properties\nof the spectra are visible at currently accessible temperatures.\n",
"title": "Angle-resolved photoemission spectroscopy with quantum gas microscopes"
}
| null | null | null | null | true | null |
10331
| null |
Default
| null | null |
null |
{
"abstract": " For a multivariate normal set up, it is well known that the maximum\nlikelihood estimator of covariance matrix is neither admissible nor minimax\nunder the Stein loss function. For the past six decades, a bunch of researches\nhave followed along this line for Stein's phenomenon in the literature. In this\nnote, the results are two folds: Firstly, with respect to Stein type loss\nfunction we use the full Iwasawa decomposition to enhance the unpleasant\nphenomenon that the minimum risks of maximum likelihood estimators for the\ndifferent coordinate systems (Cholesky decomposition and full Iwasawa\ndecomposition) are different. Secondly, we introduce a new class of loss\nfunctions to show that the minimum risks of maximum likelihood estimators for\nthe different coordinate systems, the Cholesky decomposition and the full\nIwasawa decomposition, are of the same, and hence the Stein's paradox\ndisappears.\n",
"title": "A note on MLE of covariance matrix"
}
| null | null | null | null | true | null |
10332
| null |
Default
| null | null |
null |
{
"abstract": " Cloud Computing is a new era of remote computing / Internet based computing\nwhere one can access their personal resources easily from any computer through\nInternet. Cloud delivers computing as a utility as it is available to the cloud\nconsumers on demand. It is a simple pay-per-use consumer-provider service\nmodel. It contains large number of shared resources. So Resource Management is\nalways a major issue in cloud computing like any other computing paradigm. Due\nto the availability of finite resources it is very challenging for cloud\nproviders to provide all the requested resources. From the cloud providers\nperspective cloud resources must be allocated in a fair and efficient manner.\nResearch Survey is not available from the perspective of resource management as\na process in cloud computing. So this research paper provides a detailed\nsequential view / steps on resource management in cloud computing. Firstly this\nresearch paper classifies various resources in cloud computing. It also gives\ntaxonomy on resource management in cloud computing through which one can do\nfurther research. Lastly comparisons on various resource management algorithms\nhas been presented.\n",
"title": "Resource Management in Cloud Computing: Classification and Taxonomy"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10333
| null |
Validated
| null | null |
null |
{
"abstract": " The astrophysics community uses different tools for computational tasks such\nas complex systems simulations, radiative transfer calculations or big data.\nProgramming languages like Fortran, C or C++ are commonly present in these\ntools and, generally, the language choice was made based on the need for\nperformance. However, this comes at a cost: safety. For instance, a common\nsource of error is the access to invalid memory regions, which produces random\nexecution behaviors and affects the scientific interpretation of the results.\nIn 2015, Mozilla Research released the first stable version of a new\nprogramming language named Rust. Many features make this new language\nattractive for the scientific community, it is open source and it guarantees\nmemory safety while offering zero-cost abstraction.\nWe explore the advantages and drawbacks of Rust for astrophysics by\nre-implementing the fundamental parts of Mercury-T, a Fortran code that\nsimulates the dynamical and tidal evolution of multi-planet systems.\n",
"title": "What can the programming language Rust do for astrophysics?"
}
| null | null |
[
"Computer Science",
"Physics"
] | null | true | null |
10334
| null |
Validated
| null | null |
null |
{
"abstract": " Based on BCS model with the external pair potential formulated in a work\n\\emph{K.V. Grigorishin} arXiv:1605.07080, analogous model with electron-phonon\ncoupling and Coulomb coupling is proposed. The generalized Eliashberg equations\nin the regime of renormalization of the order parameter are obtained. High\ntemperature asymptotics and influence of Coulomb pseudopotential on them are\ninvestigated: as in the BCS model the order parameter asymptotically tends to\nzero as temperature rises, but the accounting of the Coulomb pseudopotential\nleads to existence of critical temperature. The effective Ginzburg-Landau\ntheory is formulated for such model, where the temperature dependencies near\n$T_{c}$ of the basic characteristics of a superconductor (coherence length,\nmagnetic penetration depth, GL parameter, the thermodynamical critical field,\nthe first and the second critical fields) recovers to the temperature\ndependencies as in the ordinary GL theory after the BCS model with the external\npair potential.\n",
"title": "Eliashberg theory with the external pair potential"
}
| null | null | null | null | true | null |
10335
| null |
Default
| null | null |
null |
{
"abstract": " We introduce \\emph{$p_n$-random $q_n$-proportion Bulgarian solitaire}\n($0<p_n,q_n\\le 1$), played on $n$ cards distributed in piles. In each pile, a\nnumber of cards equal to the proportion $q_n$ of the pile size rounded upward\nto the nearest integer are candidates to be picked. Each candidate card is\npicked with probability $p_n$, independently of other candidate cards. This\ngeneralizes Popov's random Bulgarian solitaire, in which there is a single\ncandidate card in each pile. Popov showed that a triangular limit shape is\nobtained for a fixed $p$ as $n$ tends to infinity. Here we let both $p_n$ and\n$q_n$ vary with $n$. We show that under the conditions $q_n^2 p_n n/{\\log\nn}\\rightarrow \\infty$ and $p_n q_n \\rightarrow 0$ as $n\\to\\infty$, the\n$p_n$-random $q_n$-proportion Bulgarian solitaire has an exponential limit\nshape.\n",
"title": "An exponential limit shape of random $q$-proportion Bulgarian solitaire"
}
| null | null |
[
"Mathematics"
] | null | true | null |
10336
| null |
Validated
| null | null |
null |
{
"abstract": " By introducing a simplified transport model of outer layers of white dwarfs\nwe derive an analytical semi-empirical relation which constrains effective\ntemperature-mass-radius for white dwarfs. This relation is used to classify\nrecent data of white dwarfs according to their time evolution in non-accretion\nprocess of cooling. This formula permit us to study the population map of white\ndwarfs in the central temperature and mass plane, and discuss the relation with\nthe ignition temperature for C-O material. Our effective\ntemperature-mass-radius relation provide a quick method to estimate the mass of\nnewly observed white dwarfs from their spectral measurements of effective\ntemperature and superficial gravity.\n",
"title": "Constraining Effective Temperature, Mass and Radius of Hot White Dwarfs"
}
| null | null | null | null | true | null |
10337
| null |
Default
| null | null |
null |
{
"abstract": " We present a novel approach for estimating conditional probability tables,\nbased on a joint, rather than independent, estimate of the conditional\ndistributions belonging to the same table. We derive exact analytical\nexpressions for the estimators and we analyse their properties both\nanalytically and via simulation. We then apply this method to the estimation of\nparameters in a Bayesian network. Given the structure of the network, the\nproposed approach better estimates the joint distribution and significantly\nimproves the classification performance with respect to traditional approaches.\n",
"title": "Hierarchical Multinomial-Dirichlet model for the estimation of conditional probability tables"
}
| null | null | null | null | true | null |
10338
| null |
Default
| null | null |
null |
{
"abstract": " This volume of EPTCS contains the proceedings of the Fifth Workshop on Proof\nExchange for Theorem Proving (PxTP 2017), held on September 23-24, 2017 as part\nof the Tableaux, FroCoS and ITP conferences in Brasilia, Brazil. The PxTP\nworkshop series brings together researchers working on various aspects of\ncommunication, integration, and cooperation between reasoning systems and\nformalisms, with a special focus on proofs. The progress in computer-aided\nreasoning, both automated and interactive, during the past decades, made it\npossible to build deduction tools that are increasingly more applicable to a\nwider range of problems and are able to tackle larger problems progressively\nfaster. In recent years, cooperation between such tools in larger systems has\ndemonstrated the potential to reduce the amount of manual intervention.\nCooperation between reasoning systems relies on availability of theoretical\nformalisms and practical tools to exchange problems, proofs, and models. The\nPxTP workshop series strives to encourage such cooperation by inviting\ncontributions on all aspects of cooperation between reasoning tools, whether\nautomatic or interactive.\n",
"title": "Proceedings of the Fifth Workshop on Proof eXchange for Theorem Proving"
}
| null | null | null | null | true | null |
10339
| null |
Default
| null | null |
null |
{
"abstract": " Transient quantum dynamics in an interacting fermion-phonon system are\ninvestigated. In particular, a charge order (CO) melting after a short\noptical-pulse irradiation and roles of the quantum phonons on the transient\ndynamics are focused on. A spinless-fermion model in a one-dimensional chain\ncoupled with local phonons is analyzed numerically. The infinite time-evolving\nblock decimation algorithm is adopted as a reliable numerical method for\none-dimensional quantum many-body systems. Numerical results for the\nphotoinduced CO melting dynamics without phonons are well interpreted by the\nsoliton picture for the CO domains. This interpretation is confirmed by the\nnumerical simulation for an artificial local excitation and the classical\nsoliton model. In the case of the large phonon frequency corresponding to the\nantiadiabatic condition, the CO melting is induced by propagations of the\npolaronic solitons with the renormalized soliton velocity. On the other hand,\nin the case of the small phonon frequency corresponding to the adiabatic\ncondition, the first stage of the CO melting dynamics occurs due to the energy\ntransfer from the fermionic to phononic systems, and the second stage is\nbrought about by the soliton motions around the bottom of the soliton band.\nPresent analyses provide a standard reference for the photoinduced CO melting\ndynamics in low-dimensional many-body quantum systems.\n",
"title": "Photoinduced charge-order melting dynamics in a one-dimensional interacting Holstein model"
}
| null | null | null | null | true | null |
10340
| null |
Default
| null | null |
null |
{
"abstract": " We prove that the automorphism group of a topological parallelism on real\nprojective 3-space is compact. In a preceding article it was proved that at\nleast the connected component of the identity is compact. The present proof\ndoes not depend on that earlier result.\n",
"title": "Compactness of the automorphism group of a topological parallelism on real projective 3-space: The disconnected case"
}
| null | null | null | null | true | null |
10341
| null |
Default
| null | null |
null |
{
"abstract": " This paper presents the first MD simulations of a model, which we have\ndesigned for understanding the development of electro-induced instability of a\nthin toluene emulsion film in contact with saline aqueous phase. This study\ndemonstrates the charge accumulation role in toluene film rupture when a DC\nelectric field is applied. The critical value of the external field at which\nfilm ruptures, thin film charge distribution, capacitance, number densities and\nfilm structure have been obtained in simulating the system within NVT and NPT\nensembles. A mechanism of thin film rupture driven by the electric discharge is\nsuggested.We show that NPT ensemble with a constant surface tension is a better\nchoice for further modeling of the systems that resemble more close the real\nfilms.\n",
"title": "A model provides insight into electric field-induced rupture mechanism of water-in-toluene emulsion films"
}
| null | null |
[
"Physics"
] | null | true | null |
10342
| null |
Validated
| null | null |
null |
{
"abstract": " Software as a Service cloud computing model favorites the Multi-Tenancy as a\nkey factor to exploit economies of scale. However Multi-Tenancy present several\ndisadvantages. Therein, our approach comes to assign instances to multi-tenants\nwith an optimal solution while ensuring more economies of scale and avoiding\ntenants hesitation to share resources. The present paper present the\narchitecture of our user-aware multi-tenancy SaaS approach based on the use of\nrich-variant components. The proposed approach seek to model services\nfunctional customization as well as automation of computing the optimal\ndistribution of instances by tenants. The proposed model takes into\nconsideration tenants functional requirements and tenants deployment\nrequirements to deduce an optimal distribution using essentially a specific\nvariability engine and a graph-based execution framework.\n",
"title": "A Rich-Variant Architecture for a User-Aware multi-tenant SaaS approach"
}
| null | null | null | null | true | null |
10343
| null |
Default
| null | null |
null |
{
"abstract": " Efficiently exploiting GPUs is increasingly essential in scientific\ncomputing, as many current and upcoming supercomputers are built using them. To\nfacilitate this, there are a number of programming approaches, such as CUDA,\nOpenACC and OpenMP 4, supporting different programming languages (mainly C/C++\nand Fortran). There are also several compiler suites (clang, nvcc, PGI, XL)\neach supporting different combinations of languages. In this study, we take a\ndetailed look at some of the currently available options, and carry out a\ncomprehensive analysis and comparison using computational loops and\napplications from the domain of unstructured mesh computations. Beyond runtimes\nand performance metrics (GB/s), we explore factors that influence performance\nsuch as register counts, occupancy, usage of different memory types,\ninstruction counts, and algorithmic differences. Results of this work show how\nclang's CUDA compiler frequently outperform NVIDIA's nvcc, performance issues\nwith directive-based approaches on complex kernels, and OpenMP 4 support\nmaturing in clang and XL; currently around 10% slower than CUDA.\n",
"title": "Comparison of Parallelisation Approaches, Languages, and Compilers for Unstructured Mesh Algorithms on GPUs"
}
| null | null | null | null | true | null |
10344
| null |
Default
| null | null |
null |
{
"abstract": " We study the height of a spanning tree $T$ of a graph $G$ obtained by\nstarting with a single vertex of $G$ and repeatedly selecting, uniformly at\nrandom, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to\n$T$.\n",
"title": "Notes on Growing a Tree in a Graph"
}
| null | null | null | null | true | null |
10345
| null |
Default
| null | null |
null |
{
"abstract": " We propose theoretically an effective scheme for braiding Majorana bound\nstates by manipulating the point potential. The vortex pinning effect is\ncarefully elucidated. This effect may be used to control the vortices and\nMajorana bound states in topological superconductors. The exchange of two\nvortices induced by moving the potentials is simulated numerically. The\nzero-energy state in the vortex core is robust with respect to the strength of\nthe potential. The Majorana bound states in a pinned vortex are identified\nnumerically.\n",
"title": "Vortex pinning by the point potential in topological superconductors: a scheme for braiding Majorana bound states"
}
| null | null | null | null | true | null |
10346
| null |
Default
| null | null |
null |
{
"abstract": " Motion planning is the core problem to solve for developing any application\ninvolving an autonomous mobile robot. The fundamental motion planning problem\ninvolves generating a trajectory for a robot for point-to-point navigation\nwhile avoiding obstacles. Heuristic-based search algorithms like A* have been\nshown to be extremely efficient in solving such planning problems. Recently,\nthere has been an increased interest in specifying complex motion plans using\ntemporal logic. In the state-of-the-art algorithm, the temporal logic motion\nplanning problem is reduced to a graph search problem and Dijkstra's shortest\npath algorithm is used to compute the optimal trajectory satisfying the\nspecification.\nThe A* algorithm when used with a proper heuristic for the distance from the\ndestination can generate an optimal path in a graph efficiently. The primary\nchallenge for using A* algorithm in temporal logic path planning is that there\nis no notion of a single destination state for the robot. In this thesis, we\npresent a novel motion planning algorithm T* that uses the A* search procedure\nin temporal logic path planning \\emph{opportunistically} to generate an optimal\ntrajectory satisfying a temporal logic query. Our experimental results\ndemonstrate that T* achieves an order of magnitude improvement over the\nstate-of-the-art algorithm to solve many temporal logic motion planning\nproblems.\n",
"title": "T* : A Heuristic Search Based Algorithm for Motion Planning with Temporal Goals"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10347
| null |
Validated
| null | null |
null |
{
"abstract": " Assume that $M$ is a c.t.m. of $ZFC+CH$ containing a simplified\n$(\\omega_1,2)$-morass, $P\\in M$ is the poset adding $\\aleph_3$ generic reals\nand $G$ is $P$-generic over $M$. In $M$ we construct a function between sets of\nterms in the forcing language, that interpreted in $M[G]$ is an $\\mathbb\nR$-linear order-preserving monomorphism from the finite elements of an\nultrapower of the reals, over a non-principal ultrafilter on $\\omega$, into the\nEsterle algebra of formal power series. Therefore it is consistent that\n$2^{\\aleph_0}=\\aleph_3$ and, for any infinite compact Hausdorff space $X$,\nthere exists a discontinuous homomorphism of $C(X)$, the algebra of continuous\nreal-valued functions on $X$. For $n\\in \\mathbb N$, If $M$ contains a\nsimplified $(\\omega_1,n)$-morass, then in the Cohen extension of $M$ adding\n$\\aleph_n$ generic reals there exists a discontinuous homomorphism of $C(X)$,\nfor any infinite compact Hausdorff space $X$.\n",
"title": "Discontinuous Homomorphisms of $C(X)$ with $2^{\\aleph_0}>\\aleph_2$"
}
| null | null | null | null | true | null |
10348
| null |
Default
| null | null |
null |
{
"abstract": " The use of resonant depolarization has been suggested for precise beam energy\nmeasurements (better than 100 keV) in the $e^{+}e^{-}$ Future Circular Collider\n(FCC-$e^{+}e^{-}$) for Z and WW physics at 45 and 80 GeV beam energy\nrespectively. Longitudinal beam polarization would benefit the Z peak physics\nprogram; however it is not essential and therefore it will be not investigated\nhere. In this paper the possibility of self-polarized leptons is considered.\nPreliminary results of simulations in presence of quadrupole misalignments and\nbeam position monitors (BPMs) errors for a simplified FCC-$e^{+}e^{-}$ ring are\npresented.\n",
"title": "Investigation of beam self-polarization in the future $e^{+}e^{-}$ circular collider"
}
| null | null | null | null | true | null |
10349
| null |
Default
| null | null |
null |
{
"abstract": " Learning-based approaches for robotic grasping using visual sensors typically\nrequire collecting a large size dataset, either manually labeled or by many\ntrial and errors of a robotic manipulator in the real or simulated world. We\npropose a simpler learning-from-demonstration approach that is able to detect\nthe object to grasp from merely a single demonstration using a convolutional\nneural network we call GraspNet. In order to increase robustness and decrease\nthe training time even further, we leverage data from previous demonstrations\nto quickly fine-tune a GrapNet for each new demonstration. We present some\npreliminary results on a grasping experiment with the Franka Panda cobot for\nwhich we can train a GraspNet with only hundreds of train iterations.\n",
"title": "Learning to Grasp from a Single Demonstration"
}
| null | null | null | null | true | null |
10350
| null |
Default
| null | null |
null |
{
"abstract": " We generalize the translation invariant tensor-valued Minkowski Functionals\nwhich are defined on two-dimensional flat space to the unit sphere. We apply\nthem to level sets of random fields. The contours enclosing boundaries of level\nsets of random fields give a spatial distribution of random smooth closed\ncurves. We obtain analytic expressions for the ensemble expectation values for\nthe matrix elements of the tensor-valued Minkowski Functionals for isotropic\nGaussian and Rayleigh fields. We elucidate the way in which the elements of the\ntensor Minkowski Functionals encode information about the nature and\nstatistical isotropy (or departure from isotropy) of the field. We then\nimplement our method to compute the tensor-valued Minkowski Functionals\nnumerically and demonstrate how they encode statistical anisotropy and\ndeparture from Gaussianity by applying the method to maps of the Galactic\nforeground emissions from the PLANCK data.\n",
"title": "Tensor Minkowski Functionals for random fields on the sphere"
}
| null | null | null | null | true | null |
10351
| null |
Default
| null | null |
null |
{
"abstract": " We develop a Maximum Likelihood estimator (MLE) to measure the masses of\ngalaxy clusters through the impact of gravitational lensing on the temperature\nand polarization anisotropies of the cosmic microwave background (CMB). We show\nthat, at low noise levels in temperature, this optimal estimator outperforms\nthe standard quadratic estimator by a factor of two. For polarization, we show\nthat the Stokes Q/U maps can be used instead of the traditional E- and B-mode\nmaps without losing information. We test and quantify the bias in the recovered\nlensing mass for a comprehensive list of potential systematic errors. Using\nrealistic simulations, we examine the cluster mass uncertainties from\nCMB-cluster lensing as a function of an experiment's beam size and noise level.\nWe predict the cluster mass uncertainties will be 3 - 6% for SPT-3G, AdvACT,\nand Simons Array experiments with 10,000 clusters and less than 1% for the\nCMB-S4 experiment with a sample containing 100,000 clusters. The mass\nconstraints from CMB polarization are very sensitive to the experimental beam\nsize and map noise level: for a factor of three reduction in either the beam\nsize or noise level, the lensing signal-to-noise improves by roughly a factor\nof two.\n",
"title": "Measuring galaxy cluster masses with CMB lensing using a Maximum Likelihood estimator: Statistical and systematic error budgets for future experiments"
}
| null | null | null | null | true | null |
10352
| null |
Default
| null | null |
null |
{
"abstract": " In this work, we highlight a connection between the incremental proximal\nmethod and stochastic filters. We begin by showing that the proximal operators\ncoincide, and hence can be realized with, Bayes updates. We give the explicit\nform of the updates for the linear regression problem and show that there is a\none-to-one correspondence between the proximal operator of the least-squares\nregression and the Bayes update when the prior and the likelihood are Gaussian.\nWe then carry out this observation to a general sequential setting: We consider\nthe incremental proximal method, which is an algorithm for large-scale\noptimization, and show that, for a linear-quadratic cost function, it can\nnaturally be realized by the Kalman filter. We then discuss the implications of\nthis idea for nonlinear optimization problems where proximal operators are in\ngeneral not realizable. In such settings, we argue that the extended Kalman\nfilter can provide a systematic way for the derivation of practical procedures.\n",
"title": "The Incremental Proximal Method: A Probabilistic Perspective"
}
| null | null |
[
"Statistics"
] | null | true | null |
10353
| null |
Validated
| null | null |
null |
{
"abstract": " List decoding of insertions and deletions in the Levenshtein metric is\nconsidered. The Levenshtein distance between two sequences is the minimum\nnumber of insertions and deletions needed to turn one of the sequences into the\nother. In this paper, a Johnson-like upper bound on the maximum list size when\nlist decoding in the Levenshtein metric is derived. This bound depends only on\nthe length and minimum Levenshtein distance of the code, the length of the\nreceived word, and the alphabet size. It shows that polynomial-time list\ndecoding beyond half the Levenshtein distance is possible for many parameters.\nFurther, we also prove a lower bound on list decoding of deletions with with\nthe well-known binary Varshamov-Tenengolts (VT) codes which shows that the\nmaximum list size grows exponentially with the number of deletions. Finally, an\nefficient list decoding algorithm for two insertions/deletions with VT codes is\ngiven. This decoder can be modified to a polynomial-time list decoder of any\nconstant number of insertions/deletions.\n",
"title": "List Decoding of Insertions and Deletions"
}
| null | null | null | null | true | null |
10354
| null |
Default
| null | null |
null |
{
"abstract": " We prove almost sure global existence and scattering for the energy-critical\nnonlinear Schrödinger equation with randomized spherically symmetric initial\ndata in $H^s(\\mathbb{R}^4)$ with $\\frac56<s<1$. We were inspired to consider\nthis problem by the recent work of Dodson--Lührmann--Mendelson, which treated\nthe analogous problem for the energy-critical wave equation.\n",
"title": "Almost sure scattering for the energy-critical NLS with radial data below $H^1(\\mathbb{R}^4)$"
}
| null | null | null | null | true | null |
10355
| null |
Default
| null | null |
null |
{
"abstract": " Boltzmann exploration is widely used in reinforcement learning to provide a\ntrade-off between exploration and exploitation. Recently, in (Cesa-Bianchi et\nal., 2017) it has been shown that pure Boltzmann exploration does not perform\nwell from a regret perspective, even in the simplest setting of stochastic\nmulti-armed bandit (MAB) problems. In this paper, we show that a simple\nmodification to Boltzmann exploration, motivated by a variation of the standard\ndoubling trick, achieves $O(K\\log^{1+\\alpha} T)$ regret for a stochastic MAB\nproblem with $K$ arms, where $\\alpha>0$ is a parameter of the algorithm. This\nimproves on the result in (Cesa-Bianchi et al., 2017), where an algorithm\ninspired by the Gumbel-softmax trick achieves $O(K\\log^2 T)$ regret. We also\nshow that our algorithm achieves $O(\\beta(G) \\log^{1+\\alpha} T)$ regret in\nstochastic MAB problems with graph-structured feedback, without knowledge of\nthe graph structure, where $\\beta(G)$ is the independence number of the\nfeedback graph. Additionally, we present extensive experimental results on real\ndatasets and applications for multi-armed bandits with both traditional bandit\nfeedback and graph-structured feedback. In all cases, our algorithm performs as\nwell or better than the state-of-the-art.\n",
"title": "Almost Boltzmann Exploration"
}
| null | null | null | null | true | null |
10356
| null |
Default
| null | null |
null |
{
"abstract": " Both GPS and WiFi based localization have been exploited in recent years, yet\nmost researches focus on localizing at home without environment context.\nBesides, the near home or workplace area is complex and has little attention in\nsmart home or IOT. Therefore, after exploring the realistic route in and out of\nbuilding, we conducted a time localization system (TLS) based on off-the-shelf\nsmart phones with WiFi identification. TLS can identify the received signal\nstrength indication (RSSI) of home and construct radio map of users' time route\nwithout site survey. As designed to service the smart devices in home, TLS\napplies the time interval as the distance of positions and as the variables of\nWiFi environment to mark time points. Experimental results with real users show\nthat TLS as a service system for timeline localization achieves a median\naccuracy of 70 seconds and is more robust compared with nearest neighbor\nlocalization approach.\n",
"title": "A Time Localization System in Smart Home Using Hierarchical Structure and Dynamic Frequency"
}
| null | null | null | null | true | null |
10357
| null |
Default
| null | null |
null |
{
"abstract": " Since the advent of online real estate database companies like Zillow, Trulia\nand Redfin, the problem of automatic estimation of market values for houses has\nreceived considerable attention. Several real estate websites provide such\nestimates using a proprietary formula. Although these estimates are often close\nto the actual sale prices, in some cases they are highly inaccurate. One of the\nkey factors that affects the value of a house is its interior and exterior\nappearance, which is not considered in calculating automatic value estimates.\nIn this paper, we evaluate the impact of visual characteristics of a house on\nits market value. Using deep convolutional neural networks on a large dataset\nof photos of home interiors and exteriors, we develop a method for estimating\nthe luxury level of real estate photos. We also develop a novel framework for\nautomated value assessment using the above photos in addition to home\ncharacteristics including size, offered price and number of bedrooms. Finally,\nby applying our proposed method for price estimation to a new dataset of real\nestate photos and metadata, we show that it outperforms Zillow's estimates.\n",
"title": "Vision-based Real Estate Price Estimation"
}
| null | null | null | null | true | null |
10358
| null |
Default
| null | null |
null |
{
"abstract": " Neuromorphic hardware tends to pose limits on the connectivity of deep\nnetworks that one can run on them. But also generic hardware and software\nimplementations of deep learning run more efficiently for sparse networks.\nSeveral methods exist for pruning connections of a neural network after it was\ntrained without connectivity constraints. We present an algorithm, DEEP R, that\nenables us to train directly a sparsely connected neural network. DEEP R\nautomatically rewires the network during supervised training so that\nconnections are there where they are most needed for the task, while its total\nnumber is all the time strictly bounded. We demonstrate that DEEP R can be used\nto train very sparse feedforward and recurrent neural networks on standard\nbenchmark tasks with just a minor loss in performance. DEEP R is based on a\nrigorous theoretical foundation that views rewiring as stochastic sampling of\nnetwork configurations from a posterior.\n",
"title": "Deep Rewiring: Training very sparse deep networks"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
10359
| null |
Validated
| null | null |
null |
{
"abstract": " In the Internet of Things (IoT) community, Wireless Sensor Network (WSN) is a\nkey technique to enable ubiquitous sensing of environments and provide reliable\nservices to applications. WSN programs, typically interrupt-driven, implement\nthe functionalities via the collaboration of Interrupt Procedure Instances\n(IPIs, namely executions of interrupt processing logic). However, due to the\ncomplicated concurrency model of WSN programs, the IPIs are interleaved\nintricately and the program behaviours are hard to predicate from the source\ncodes. Thus, to improve the software quality of WSN programs, it is significant\nto disentangle the interleaved executions and develop various IPI-based program\nanalysis techniques, including offline and online ones. As the common\nfoundation of those techniques, a generic efficient and real-time algorithm to\nidentify IPIs is urgently desired. However, the existing\ninstance-identification approach cannot satisfy the desires. In this paper, we\nfirst formally define the concept of IPI. Next, we propose a generic\nIPI-identification algorithm, and prove its correctness, real-time and\nefficiency. We also conduct comparison experiments to illustrate that our\nalgorithm is more efficient than the existing one in terms of both time and\nspace. As the theoretical analyses and empirical studies exhibit, our algorithm\nprovides the groundwork for IPI-based analyses of WSN programs in IoT\nenvironment.\n",
"title": "Analyzing and Disentangling Interleaved Interrupt-driven IoT Programs"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10360
| null |
Validated
| null | null |
null |
{
"abstract": " It is proved that replica symmetry is not broken in the transverse and\nlongitudinal random field Ising model. In this model, the variance of spin\noverlap of any component vanishes in any dimension almost everywhere in the\ncoupling constant space in the infinite volume limit. The weak\nFortuin-Kasteleyn-Ginibre property in this model and the Ghirlanda-Guerra\nidentities in artificial models in a path integral representation based on the\nLie-Trotter-Suzuki formula enable us to extend Chatterjee's proof for the\nrandom field Ising model to the quantum model.\n",
"title": "Absence of replica symmetry breaking in the transverse and longitudinal random field Ising model"
}
| null | null | null | null | true | null |
10361
| null |
Default
| null | null |
null |
{
"abstract": " We have implemented an optimization that specializes type-generic array\naccesses after inlining of polymorphic functions in the native-code OCaml\ncompiler. Polymorphic array operations (read and write) in OCaml require\nruntime type dispatch because of ad hoc memory representations of integer and\nfloat arrays. It cannot be removed even after being monomorphized by inlining\nbecause the intermediate language is mostly untyped. We therefore extended it\nwith explicit type application like System F (while keeping implicit type\nabstraction by means of unique identifiers for type variables). Our\noptimization has achieved up to 21% speed-up of numerical programs.\n",
"title": "Specialization of Generic Array Accesses After Inlining"
}
| null | null | null | null | true | null |
10362
| null |
Default
| null | null |
null |
{
"abstract": " We obtain the first polynomial-time algorithm for exact tensor completion\nthat improves over the bound implied by reduction to matrix completion. The\nalgorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal\ncomponents in $\\mathbb R^n$ from $r\\cdot \\tilde O(n^{1.5})$ randomly observed\nentries of the tensor. This bound improves over the previous best one of\n$r\\cdot \\tilde O(n^{2})$ by reduction to exact matrix completion. Our bound\nalso matches the best known results for the easier problem of approximate\ntensor completion (Barak & Moitra, 2015).\nOur algorithm and analysis extends seminal results for exact matrix\ncompletion (Candes & Recht, 2009) to the tensor setting via the sum-of-squares\nmethod. The main technical challenge is to show that a small number of randomly\nchosen monomials are enough to construct a degree-3 polynomial with precisely\nplanted orthogonal global optima over the sphere and that this fact can be\ncertified within the sum-of-squares proof system.\n",
"title": "Exact tensor completion with sum-of-squares"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
10363
| null |
Validated
| null | null |
null |
{
"abstract": " Outlier detection and cluster number estimation is an important issue for\nclustering real data. This paper focuses on spectral clustering, a time-tested\nclustering method, and reveals its important properties related to outliers.\nThe highlights of this paper are the following two mathematical observations:\nfirst, spectral clustering's intrinsic property of an outlier cluster\nformation, and second, the singularity of an outlier cluster with a valid\ncluster number. Based on these observations, we designed a function that\nevaluates clustering and outlier detection results. In experiments, we prepared\ntwo scenarios, face clustering in photo album and person re-identification in a\ncamera network. We confirmed that the proposed method detects outliers and\nestimates the number of clusters properly in both problems. Our method\noutperforms state-of-the-art methods in both the 128-dimensional sparse space\nfor face clustering and the 4,096-dimensional non-sparse space for person\nre-identification.\n",
"title": "Outlier Cluster Formation in Spectral Clustering"
}
| null | null | null | null | true | null |
10364
| null |
Default
| null | null |
null |
{
"abstract": " The most general expressions of the stored energies for time-harmonic\nelectromagnetic fields are derived from the time-domain Poynting theorem, and\nare valuable in characterizing the energy storage and transport properties of\ncomplex media. A new energy conservation law for the time-harmonic\nelectromagnetic fields, which involves the derived general expressions of the\nstored energies, is introduced. In contrast to the well-established Poynting\ntheorem for time-harmonic fields, the real part of the new energy conservation\nlaw gives an equation for the sum of stored electric and magnetic field\nenergies; the imaginary part involves an equation related to the difference\nbetween the dissipated electric and magnetic field energies. In a lossless\nisotropic and homogeneous medium, the new energy conservation law has a clear\nphysical implication: the stored electromagnetic field energy of a radiating\nsystem enclosed by a surface is equal to the total field energy inside the\nsurface subtracted by the field energy flowing out of the surface.\n",
"title": "Stored Electromagnetic Field Energies in General Materials"
}
| null | null | null | null | true | null |
10365
| null |
Default
| null | null |
null |
{
"abstract": " The inference of network topologies from relational data is an important\nproblem in data analysis. Exemplary applications include the reconstruction of\nsocial ties from data on human interactions, the inference of gene\nco-expression networks from DNA microarray data, or the learning of semantic\nrelationships based on co-occurrences of words in documents. Solving these\nproblems requires techniques to infer significant links in noisy relational\ndata. In this short paper, we propose a new statistical modeling framework to\naddress this challenge. It builds on generalized hypergeometric ensembles, a\nclass of generative stochastic models that give rise to analytically tractable\nprobability spaces of directed, multi-edge graphs. We show how this framework\ncan be used to assess the significance of links in noisy relational data. We\nillustrate our method in two data sets capturing spatio-temporal proximity\nrelations between actors in a social system. The results show that our\nanalytical framework provides a new approach to infer significant links from\nrelational data, with interesting perspectives for the mining of data on social\nsystems.\n",
"title": "From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles"
}
| null | null |
[
"Computer Science",
"Physics",
"Statistics"
] | null | true | null |
10366
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper, we introduce an iterative linearization scheme that allows to\napproximate the weak solution of the $p$-Poisson problem\n\\begin{align*}\n-\\operatorname{div}(|\\nabla u|^{p-2}\\nabla u) &= f\\quad\\text{in }\\Omega,\nu&= 0\\quad\\text{on}\\partial\\Omega\n\\end{align*} for $1 < p \\leq 2$. The algorithm can be interpreted as a\nrelaxed Kačanov iteration. We prove that the algorithm converges at least\nwith an algebraic rate.\n",
"title": "A Relaxed Kačanov Iteration for the $p$-Poisson Problem"
}
| null | null | null | null | true | null |
10367
| null |
Default
| null | null |
null |
{
"abstract": " An important class of real-world networks have directed edges, and in\naddition, some rank ordering on the nodes, for instance the \"popularity\" of\nusers in online social networks. Yet, nearly all research related to explosive\npercolation has been restricted to undirected networks. Furthermore,\ninformation on such rank ordered networks typically flows from higher ranked to\nlower ranked individuals, such as follower relations, replies and retweets on\nTwitter.\nHere we introduce a simple percolation process on an ordered, directed\nnetwork where edges are added monotonically with respect to the rank ordering.\nWe show with a numerical approach that the emergence of a dominant strongly\nconnected component appears to be discontinuous. Large scale connectivity\noccurs at very high density compared with most percolation processes, and this\nholds not just for the strongly connected component structure but for the\nweakly connected component structure as well. We present analysis with\nbranching processes which explains this unusual behavior and gives basic\nintuition for the underlying mechanisms. We also show that before the emergence\nof a dominant strongly connected component, multiple giant strongly connected\ncomponents may exist simultaneously. By adding a competitive percolation rule\nwith a small bias to link uses of similar rank, we show this leads to formation\nof two distinct components, one of high ranked users, and one of low ranked\nusers, with little flow between the two components.\n",
"title": "Explosive Percolation on Directed Networks Due to Monotonic Flow of Activity"
}
| null | null | null | null | true | null |
10368
| null |
Default
| null | null |
null |
{
"abstract": " We report an experimental observation of multiple co--rotating vortices in a\nextended dust column in the background of non--uniform diffused plasma.\nInductively coupled RF discharge is initiated in the background of argon gas in\nthe source region which later found to diffuse in the main experimental\nchamber. A secondary DC glow discharge plasma is produced to introduce the dust\nparticles into the plasma. These micron sized poly-disperse dust particles get\ncharged in the plasma environment and transported by the ambipolar electric\nfield of the diffused plasma and found to confine in the potential well, where\nthe resultant electric field of the diffused plasma (ambipolar E--field) and\nglass wall charging (sheath E--field) hold the micron sized particles against\nthe gravity. Multiple co--rotating (anti--clockwise) dust vortices are observed\nin the dust cloud for a particular discharge condition. The transition from\nmultiple to single dust vortex is observed when input RF power is lowered.\nOccurrence of these vortices are explained on the basis of the charge gradient\nof dust particles which is orthogonal to the ion drag force. The charge\ngradient is a consequence of the plasma inhomogeneity along the dust cloud\nlength. The detailed nature and the reason for multiple vortices are still\nunder investigation through further experiments, however, preliminary\nqualitative understanding is discussed based on characteristic scale length of\ndust vortex. There is a characteristic size of the vortex in the dusty plasma\nso that multiple vortices is possible to form in the extended dusty plasma with\ninhomogeneous plasma background. The experimental results on the vortex motion\nof particles are compared with a theoretical model and found some agreement.\n",
"title": "Experimental observation of self excited co--rotating multiple vortices in a dusty plasma with inhomogeneous plasma background"
}
| null | null |
[
"Physics"
] | null | true | null |
10369
| null |
Validated
| null | null |
null |
{
"abstract": " This paper presents results of topic modeling and network models of topics\nusing the International Conference on Computational Science corpus, which\ncontains domain-specific (computational science) papers over sixteen years (a\ntotal of 5695 papers). We discuss topical structures of International\nConference on Computational Science, how these topics evolve over time in\nresponse to the topicality of various problems, technologies and methods, and\nhow all these topics relate to one another. This analysis illustrates\nmultidisciplinary research and collaborations among scientific communities, by\nconstructing static and dynamic networks from the topic modeling results and\nthe keywords of authors. The results of this study give insights about the past\nand future trends of core discussion topics in computational science. We used\nthe Non-negative Matrix Factorization topic modeling algorithm to discover\ntopics and labeled and grouped results hierarchically.\n",
"title": "Analysis of Computational Science Papers from ICCS 2001-2016 using Topic Modeling and Graph Theory"
}
| null | null | null | null | true | null |
10370
| null |
Default
| null | null |
null |
{
"abstract": " We construct a countable bounded sublattice of the lattice of all subspaces\nof a vector space with two non-isomorphic maximal Boolean sublattice. We\nrepresent one of them as the range of a Banschewski function and we prove that\nthis is not the case of the other. Hereby we solve a problem of F. Wehrung.\n",
"title": "A maximal Boolean sublattice that is not the range of a Banaschewski function"
}
| null | null | null | null | true | null |
10371
| null |
Default
| null | null |
null |
{
"abstract": " In this work the issue of Bayesian inference for stationary data is\naddressed. Therefor a parametrization of a statistically suitable subspace of\nthe the shift-ergodic probability measures on a Cartesian product of some\nfinite state space is given using an inverse limit construction. Moreover, an\nexplicit model for the prior is given by taking into account an additional step\nin the usual stepwise sampling scheme of data. An update to the posterior is\ndefined by exploiting this augmented sample scheme. Thereby, its model-step is\nupdated using a measurement of the empirical distances between the model\nclasses.\n",
"title": "Bayesian inference for stationary data on finite state spaces"
}
| null | null | null | null | true | null |
10372
| null |
Default
| null | null |
null |
{
"abstract": " The aim of the study is to investigate the reason for the low productivity of\nhigh-energy SEPs in the present solar cycle. We employ scaling laws derived\nfrom diffusive shock acceleration theory and simulation studies including\nproton-generated upstream Alfvén waves to find out how the changes observed\nin the long-term average properties of the erupting and ambient coronal and/or\nsolar wind plasma would affect the ability of shocks to accelerate particles to\nthe highest energies. Provided that self-generated turbulence dominates\nparticle transport around coronal shocks, it is found that the most crucial\nfactors controlling the diffusive shock acceleration process are the number\ndensity of seed particles and the plasma density of the ambient medium.\nAssuming that suprathermal populations provide a fraction of the particles\ninjected to shock acceleration in the corona, we show that the lack of most\nenergetic particle events as well as the lack of low charge-to-mass ratio ion\nspecies in the present cycle can be understood as a result of the reduction of\naverage coronal plasma and suprathermal densities in the present cycle over the\nprevious one.\n",
"title": "Why is solar cycle 24 an inefficient producer of high-energy particle events?"
}
| null | null | null | null | true | null |
10373
| null |
Default
| null | null |
null |
{
"abstract": " Merging mobile edge computing with the dense deployment of small cell base\nstations promises enormous benefits such as a real proximity, ultra-low latency\naccess to cloud functionalities. However, the envisioned integration creates\nmany new challenges and one of the most significant is mobility management,\nwhich is becoming a key bottleneck to the overall system performance. Simply\napplying existing solutions leads to poor performance due to the highly\noverlapped coverage areas of multiple base stations in the proximity of the\nuser and the co-provisioning of radio access and computing services. In this\npaper, we develop a novel user-centric mobility management scheme, leveraging\nLyapunov optimization and multi-armed bandits theories, in order to maximize\nthe edge computation performance for the user while keeping the user's\ncommunication energy consumption below a constraint. The proposed scheme\neffectively handles the uncertainties present at multiple levels in the system\nand provides both short-term and long-term performance guarantee. Simulation\nresults show that our proposed scheme can significantly improve the computation\nperformance (compared to state of the art) while satisfying the communication\nenergy constraint.\n",
"title": "E2M2: Energy Efficient Mobility Management in Dense Small Cells with Mobile Edge Computing"
}
| null | null | null | null | true | null |
10374
| null |
Default
| null | null |
null |
{
"abstract": " Experimental Particle Physics has been at the forefront of analyzing the\nworlds largest datasets for decades. The HEP community was the first to develop\nsuitable software and computing tools for this task. In recent times, new\ntoolkits and systems collectively called Big Data technologies have emerged to\nsupport the analysis of Petabyte and Exabyte datasets in industry. While the\nprinciples of data analysis in HEP have not changed (filtering and transforming\nexperiment-specific data formats), these new technologies use different\napproaches and promise a fresh look at analysis of very large datasets and\ncould potentially reduce the time-to-physics with increased interactivity. In\nthis talk, we present an active LHC Run 2 analysis, searching for dark matter\nwith the CMS detector, as a testbed for Big Data technologies. We directly\ncompare the traditional NTuple-based analysis with an equivalent analysis using\nApache Spark on the Hadoop ecosystem and beyond. In both cases, we start the\nanalysis with the official experiment data formats and produce publication\nphysics plots. We will discuss advantages and disadvantages of each approach\nand give an outlook on further studies needed.\n",
"title": "Big Data in HEP: A comprehensive use case study"
}
| null | null | null | null | true | null |
10375
| null |
Default
| null | null |
null |
{
"abstract": " Guided by critical systems found in nature we develop a novel mechanism\nconsisting of inhomogeneous polynomial regularisation via which we can induce\nscale invariance in deep learning systems. Technically, we map our deep\nlearning (DL) setup to a genuine field theory, on which we act with the\nRenormalisation Group (RG) in momentum space and produce the flow equations of\nthe couplings; those are translated to constraints and consequently interpreted\nas \"critical regularisation\" conditions in the optimiser; the resulting\nequations hence prove to be sufficient conditions for - and serve as an elegant\nand simple mechanism to induce scale invariance in any deep learning setup.\n",
"title": "Criticality & Deep Learning II: Momentum Renormalisation Group"
}
| null | null | null | null | true | null |
10376
| null |
Default
| null | null |
null |
{
"abstract": " We introduce and analyze an extension to the matching problem on a weighted\nbipartite graph: Assignment with Type Constraints. The two parts of the graph\nare partitioned into subsets called types and blocks; we seek a matching with\nthe largest sum of weights under the constraint that there is a pre-specified\ncap on the number of vertices matched in every type-block pair. Our primary\nmotivation stems from the public housing program of Singapore, accounting for\nover 70% of its residential real estate. To promote ethnic diversity within its\nhousing projects, Singapore imposes ethnicity quotas: each new housing\ndevelopment comprises blocks of flats and each ethnicity-based group in the\npopulation must not own more than a certain percentage of flats in a block.\nOther domains using similar hard capacity constraints include matching\nprospective students to schools or medical residents to hospitals. Limiting\nagents' choices for ensuring diversity in this manner naturally entails some\nwelfare loss. One of our goals is to study the trade-off between diversity and\nsocial welfare in such settings. We first show that, while the classic\nassignment program is polynomial-time computable, adding diversity constraints\nmakes it computationally intractable; however, we identify a\n$\\tfrac{1}{2}$-approximation algorithm, as well as reasonable assumptions on\nthe weights that permit poly-time algorithms. Next, we provide two upper bounds\non the price of diversity -- a measure of the loss in welfare incurred by\nimposing diversity constraints -- as functions of natural problem parameters.\nWe conclude the paper with simulations based on publicly available data from\ntwo diversity-constrained allocation problems -- Singapore Public Housing and\nChicago School Choice -- which shed light on how the constrained maximization\nas well as lottery-based variants perform in practice.\n",
"title": "The Price of Diversity in Assignment Problems"
}
| null | null | null | null | true | null |
10377
| null |
Default
| null | null |
null |
{
"abstract": " We present a detailed spectral analysis of the brightest Active Galactic\nNuclei (AGN) identified in the 7Ms Chandra Deep Field South (CDF-S) survey over\na time span of 16 years. Using a model of an intrinsically absorbed power-law\nplus reflection, with possible soft excess and narrow Fe K$\\alpha$ line, we\nperform a systematic X-ray spectral analysis, both on the total 7Ms exposure\nand in four different periods with lengths of 2-21 months. With this approach,\nwe not only present the power-law slopes, column densities $N_H$, observed\nfluxes, and absorption-corrected 2-10~keV luminosities $L_X$ for our sample of\nAGNs, but also identify significant spectral variabilities among them on time\nscales of years. We find that the $N_H$ variabilities can be ascribed to two\ndifferent types of mechanisms, either flux-driven or flux-independent. We also\nfind that the correlation between the narrow Fe line EW and $N_H$ can be well\nexplained by the continuum suppression with increasing $N_H$. Accounting for\nthe sample incompleteness and bias, we measure the intrinsic distribution of\n$N_H$ for the CDF-S AGN population and present re-selected subsamples which are\ncomplete with respect to $N_H$. The $N_H$-complete subsamples enable us to\ndecouple the dependences of $N_H$ on $L_X$ and on redshift. Combining our data\nwith that from C-COSMOS, we confirm the anti-correlation between the average\n$N_H$ and $L_X$ of AGN, and find a significant increase of the AGN obscured\nfraction with redshift at any luminosity. The obscured fraction can be\ndescribed as $f_{obscured}\\thickapprox 0.42\\ (1+z)^{0.60}$.\n",
"title": "X-ray spectral analyses of AGNs from the 7Ms Chandra Deep Field-South survey: the distribution, variability, and evolution of AGN's obscuration"
}
| null | null |
[
"Physics"
] | null | true | null |
10378
| null |
Validated
| null | null |
null |
{
"abstract": " Nd2Hf2O7, belonging to the family of geometrically frustrated cubic rare\nearth pyrochlore oxides, was recently identified to order antiferromagnetically\nbelow T_N = 0.55 K with an all-in/all-out arrangement of Nd3+ moments, however\nwith a much reduced ordered state moment. Herein we investigate the spin\ndynamics and crystal field states of Nd2Hf2O7 using muon spin relaxation (muSR)\nand inelastic neutron scattering (INS) measurements. Our muSR study confirms\nthe long range magnetic ordering and shows evidence for coexisting persistent\ndynamic spin fluctuations deep inside the ordered state down to 42 mK. The INS\ndata show the crytal electric field (CEF) excitations due to the transitions\nboth within the ground state multiplet and to the first excited state\nmultiplet. The INS data are analyzed by a model based on CEF and crystal field\nstates are determined. Strong Ising-type anisotropy is inferred from the ground\nstate wavefunction. The CEF parameters indicate the CEF-split Kramers doublet\nground state of Nd3+ to be consistent with the dipolar-octupolar character.\n",
"title": "Muon spin relaxation and inelastic neutron scattering investigations of all-in/all-out antiferromagnet Nd2Hf2O7"
}
| null | null | null | null | true | null |
10379
| null |
Default
| null | null |
null |
{
"abstract": " Noncritical soft-faults and model deviations are a challenge for Fault\nDetection and Diagnosis (FDD) of resident Autonomous Underwater Vehicles\n(AUVs). Such systems may have a faster performance degradation due to the\npermanent exposure to the marine environment, and constant monitoring of\ncomponent conditions is required to ensure their reliability. This works\npresents an evaluation of Recurrent Neural Networks (RNNs) for a data-driven\nfault detection and diagnosis scheme for underwater thrusters with empirical\ndata. The nominal behavior of the thruster was modeled using the measured\ncontrol input, voltage, rotational speed and current signals. We evaluated the\nperformance of fault classification using all the measured signals compared to\nusing the computed residuals from the nominal model as features.\n",
"title": "Modeling and Soft-fault Diagnosis of Underwater Thrusters with Recurrent Neural Networks"
}
| null | null | null | null | true | null |
10380
| null |
Default
| null | null |
null |
{
"abstract": " We study SIS epidemic spreading processes unfolding on a recent\ngeneralisation of the activity-driven modelling framework. In this model of\ntime-varying networks each node is described by two variables: activity and\nattractiveness. The first, describes the propensity to form connections. The\nsecond, defines the propensity to attract them. We derive analytically the\nepidemic threshold considering the timescale driving the evolution of contacts\nand the contagion as comparable. The solutions are general and hold for any\njoint distribution of activity and attractiveness. The theoretical picture is\nconfirmed via large-scale numerical simulations performed considering\nheterogeneous distributions and different correlations between the two\nvariables. We find that heterogeneous distributions of attractiveness alter the\ncontagion process. In particular, in case of uncorrelated and positive\ncorrelations between the two variables, heterogeneous attractiveness\nfacilitates the spreading. On the contrary, negative correlations between\nactivity and attractiveness hamper the spreading. The results presented\ncontribute to the understanding of the dynamical properties of time-varying\nnetworks and their effects on contagion phenomena unfolding on their fabric.\n",
"title": "Epidemic Spreading on Activity-Driven Networks with Attractiveness"
}
| null | null | null | null | true | null |
10381
| null |
Default
| null | null |
null |
{
"abstract": " We present model for anisotropic compact star under the general theory of\nrelativity of Einstein. In the study a 4-dimensional spacetime has been\nconsidered which is embedded into the 5-dimensional flat metric so that the\nspherically symmetric metric has class 1 when the condition\n$e^{\\lambda}=\\left(\\,1+C\\,e^{\\nu} \\,{\\nu'}^2\\,\\right)$ is satisfied ($\\lambda$\nand $\\nu$ being the metric potentials along with a constant $C$). A set of\nsolutions for the field equations are found depending on the index $n$ involved\nin the physical parameters. The interior solutions have been matched smoothly\nat the boundary of the spherical distribution to the exterior Schwarzschild\nsolution which necessarily provides values of the unknown constants. We have\nchosen the values of $n$ as $n=2$ and $n$=10 to 20000 for which interesting and\nphysically viable results can be found out. The numerical values of the\nparameters and arbitrary constants for different compact stars are assumed in\nthe graphical plots and tables as follows: (i) LMC X-4 : $a=0.0075$,\n$b=0.000821$ for $n=2$ and $a=0.0075$, $nb=0.00164$ for $n\\ge 10$, (ii) SMC\nX-1: $a=0.00681$, $b=0.00078$ for $n=2$, and $a=0.00681$, $nb=0.00159$ for $n\n\\ge 10$. The investigations on the physical features of the model include\nseveral astrophysical issues, like (i) regularity behavior of stars at the\ncentre, (ii) well behaved condition for velocity of sound, (iii) energy\nconditions, (iv) stabilty of the system via the following three techniques -\nadiabatic index, Herrera cracking concept and TOV equation, (v) total mass,\neffective mass and compactification factor and (vi) surface redshift. Specific\nnumerical values of the compact star candidates LMC X-4 and SMC X-1 are\ncalculated for central and surface densities as well as central pressure to\ncompare the model value with actual observational data.\n",
"title": "A generalized family of anisotropic compact object in general relativity"
}
| null | null | null | null | true | null |
10382
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we describe and evaluate a mixed reality system that aims to\naugment users in task guidance applications by combining automated and\nunsupervised information collection with minimally invasive video guides. The\nresult is a self-contained system that we call GlaciAR (Glass-enabled\nContextual Interactions for Augmented Reality), that operates by extracting\ncontextual interactions from observing users performing actions. GlaciAR is\nable to i) automatically determine moments of relevance based on a head motion\nattention model, ii) automatically produce video guidance information, iii)\ntrigger these video guides based on an object detection method, iv) learn\nwithout supervision from observing multiple users and v) operate fully on-board\na current eyewear computer (Google Glass). We describe the components of\nGlaciAR together with evaluations on how users are able to use the system to\nachieve three tasks. We see this work as a first step toward the development of\nsystems that aim to scale up the notoriously difficult authoring problem in\nguidance systems and where people's natural abilities are enhanced via\nminimally invasive visual guidance.\n",
"title": "Automated capture and delivery of assistive task guidance with an eyewear computer: The GlaciAR system"
}
| null | null | null | null | true | null |
10383
| null |
Default
| null | null |
null |
{
"abstract": " Benefited from the widely deployed infrastructure, the LTE network has\nrecently been considered as a promising candidate to support the\nvehicle-to-everything (V2X) services. However, with a massive number of devices\naccessing the V2X network in the future, the conventional OFDM-based LTE\nnetwork faces the congestion issues due to its low efficiency of orthogonal\naccess, resulting in significant access delay and posing a great challenge\nespecially to safety-critical applications. The non-orthogonal multiple access\n(NOMA) technique has been well recognized as an effective solution for the\nfuture 5G cellular networks to provide broadband communications and massive\nconnectivity. In this article, we investigate the applicability of NOMA in\nsupporting cellular V2X services to achieve low latency and high reliability.\nStarting with a basic V2X unicast system, a novel NOMA-based scheme is proposed\nto tackle the technical hurdles in designing high spectral efficient scheduling\nand resource allocation schemes in the ultra dense topology. We then extend it\nto a more general V2X broadcasting system. Other NOMA-based extended V2X\napplications and some open issues are also discussed.\n",
"title": "V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G Enabled Vehicular Networks"
}
| null | null | null | null | true | null |
10384
| null |
Default
| null | null |
null |
{
"abstract": " Disagreement-based approaches generate multiple classifiers and exploit the\ndisagreement among them with unlabeled data to improve learning performance.\nCo-training is a representative paradigm of them, which trains two classifiers\nseparately on two sufficient and redundant views; while for the applications\nwhere there is only one view, several successful variants of co-training with\ntwo different classifiers on single-view data instead of two views have been\nproposed. For these disagreement-based approaches, there are several important\nissues which still are unsolved, in this article we present theoretical\nanalyses to address these issues, which provides a theoretical foundation of\nco-training and disagreement-based approaches.\n",
"title": "Theoretical Foundation of Co-Training and Disagreement-Based Algorithms"
}
| null | null | null | null | true | null |
10385
| null |
Default
| null | null |
null |
{
"abstract": " What if someone built a \"box\" that applies quantum superposition not just to\nquantum bits in the microscopic but also to macroscopic everyday \"objects\",\nsuch as Schrödinger's cat or a human being? If that were possible, and if the\ndifferent \"copies\" of a man could exploit quantum interference to synchronize\nand collapse into their preferred state, then one (or they?) could in a sense\nchoose their future, win the lottery, break codes and other security devices,\nand become king of the world, or actually of the many-worlds. We set up the\nplot-line of a new episode of Black Mirror to reflect on what might await us if\none were able to build such a technology.\n",
"title": "Schrödinger's Man"
}
| null | null | null | null | true | null |
10386
| null |
Default
| null | null |
null |
{
"abstract": " Unmanned aircraft have decreased the cost required to collect remote sensing\nimagery, which has enabled researchers to collect high-spatial resolution data\nfrom multiple sensor modalities more frequently and easily. The increase in\ndata will push the need for semantic segmentation frameworks that are able to\nclassify non-RGB imagery, but this type of algorithmic development requires an\nincrease in publicly available benchmark datasets with class labels. In this\npaper, we introduce a high-resolution multispectral dataset with image labels.\nThis new benchmark dataset has been pre-split into training/testing folds in\norder to standardize evaluation and continue to push state-of-the-art\nclassification frameworks for non-RGB imagery.\n",
"title": "High-Resolution Multispectral Dataset for Semantic Segmentation"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10387
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper, we present an approach to select a subset of requirement\nelicitation technique for an optimum result in the requirement elicitation\nprocess. Our approach consists of three steps. First, we identify various\nattribute in three important dimensions namely project, people and the process\nof software development that can influence the outcome of an elicitation\nprocess. Second, we construct three p matrix (3PM) separately for each\ndimension, that shows a relation between the elicitation techniques and three\ndimensions of a software. Third, we provide a mapping criteria and use them in\nthe selection of a subset of elicitation techniques. We demonstrate the\napplicability of the proposed approach using case studies to evaluate and\nprovide the contextual knowledge of selecting requirement elicitation\ntechnique.\n",
"title": "A Methodology for the Selection of Requirement Elicitation Techniques"
}
| null | null | null | null | true | null |
10388
| null |
Default
| null | null |
null |
{
"abstract": " In this chapter, we present the state-of-the-art in the generation of\nnonclassical states of light using semiconductor cavity quantum electrodynamics\n(QED) platforms. Our focus is on the photon blockade effects that enable the\ngeneration of indistinguishable photon streams with high purity and efficiency.\nStarting with the leading platform of InGaAs quantum dots in optical\nnanocavities, we review the physics of a single quantum emitter strongly\ncoupled to a cavity. Furthermore, we propose a complete model for photon\nblockade and tunneling in III-V quantum dot cavity QED systems. Turning toward\nquantum emitters with small inhomogeneous broadening, we propose a direction\nfor novel experiments for nonclassical light generation based on group-IV\ncolor-center systems. We present a model of a multi-emitter cavity QED\nplatform, which features richer dressed-states ladder structures, and show how\nit can offer opportunities for studying new regimes of high-quality photon\nblockade.\n",
"title": "Nonclassical Light Generation from III-V and Group-IV Solid-State Cavity Quantum Systems"
}
| null | null | null | null | true | null |
10389
| null |
Default
| null | null |
null |
{
"abstract": " In recent years, the number of biomedical publications has steadfastly grown,\nresulting in a rich source of untapped new knowledge. Most biomedical facts are\nhowever not readily available, but buried in the form of unstructured text, and\nhence their exploitation requires the time-consuming manual curation of\npublished articles. Here we present INtERAcT, a novel approach to extract\nprotein-protein interactions from a corpus of biomedical articles related to a\nbroad range of scientific domains in a completely unsupervised way. INtERAcT\nexploits vector representation of words, computed on a corpus of domain\nspecific knowledge, and implements a new metric that estimates an interaction\nscore between two molecules in the space where the corresponding words are\nembedded. We demonstrate the power of INtERAcT by reconstructing the molecular\npathways associated to 10 different cancer types using a corpus of\ndisease-specific articles for each cancer type. We evaluate INtERAcT using\nSTRING database as a benchmark, and show that our metric outperforms currently\nadopted approaches for similarity computation at the task of identifying known\nmolecular interactions in all studied cancer types. Furthermore, our approach\ndoes not require text annotation, manual curation or the definition of semantic\nrules based on expert knowledge, and hence it can be easily and efficiently\napplied to different scientific domains. Our findings suggest that INtERAcT may\nincrease our capability to summarize the understanding of a specific disease\nusing the published literature in an automated and completely unsupervised\nfashion.\n",
"title": "INtERAcT: Interaction Network Inference from Vector Representations of Words"
}
| null | null | null | null | true | null |
10390
| null |
Default
| null | null |
null |
{
"abstract": " Transfer learning is a popular practice in deep neural networks, but\nfine-tuning of large number of parameters is a hard task due to the complex\nwiring of neurons between splitting layers and imbalance distributions of data\nin pretrained and transferred domains. The reconstruction of the original\nwiring for the target domain is a heavy burden due to the size of\ninterconnections across neurons. We propose a distributed scheme that tunes the\nconvolutional filters individually while backpropagates them jointly by means\nof basic probability assignment. Some of the most recent advances in evidence\ntheory show that in a vast variety of the imbalanced regimes, optimizing of\nsome proper objective functions derived from contingency matrices prevents\nbiases towards high-prior class distributions. Therefore, the original filters\nget gradually transferred based on individual contributions to overall\nperformance of the target domain. This largely reduces the expected complexity\nof transfer learning whilst highly improves precision. Our experiments on\nstandard benchmarks and scenarios confirm the consistent improvement of our\ndistributed deep transfer learning strategy.\n",
"title": "Distributed Deep Transfer Learning by Basic Probability Assignment"
}
| null | null | null | null | true | null |
10391
| null |
Default
| null | null |
null |
{
"abstract": " This paper presents the construction of a particle filter, which incorporates\nelements inspired by genetic algorithms, in order to achieve accelerated\nadaptation of the estimated posterior distribution to changes in model\nparameters. Specifically, the filter is designed for the situation where the\nsubsequent data in online sequential filtering does not match the model\nposterior filtered based on data up to a current point in time. The examples\nconsidered encompass parameter regime shifts and stochastic volatility. The\nfilter adapts to regime shifts extremely rapidly and delivers a clear heuristic\nfor distinguishing between regime shifts and stochastic volatility, even though\nthe model dynamics assumed by the filter exhibit neither of those features.\n",
"title": "Parameter Learning and Change Detection Using a Particle Filter With Accelerated Adaptation"
}
| null | null | null | null | true | null |
10392
| null |
Default
| null | null |
null |
{
"abstract": " Enabling robots to autonomously navigate complex environments is essential\nfor real-world deployment. Prior methods approach this problem by having the\nrobot maintain an internal map of the world, and then use a localization and\nplanning method to navigate through the internal map. However, these approaches\noften include a variety of assumptions, are computationally intensive, and do\nnot learn from failures. In contrast, learning-based methods improve as the\nrobot acts in the environment, but are difficult to deploy in the real-world\ndue to their high sample complexity. To address the need to learn complex\npolicies with few samples, we propose a generalized computation graph that\nsubsumes value-based model-free methods and model-based methods, with specific\ninstantiations interpolating between model-free and model-based. We then\ninstantiate this graph to form a navigation model that learns from raw images\nand is sample efficient. Our simulated car experiments explore the design\ndecisions of our navigation model, and show our approach outperforms\nsingle-step and $N$-step double Q-learning. We also evaluate our approach on a\nreal-world RC car and show it can learn to navigate through a complex indoor\nenvironment with a few hours of fully autonomous, self-supervised training.\nVideos of the experiments and code can be found at github.com/gkahn13/gcg\n",
"title": "Self-supervised Deep Reinforcement Learning with Generalized Computation Graphs for Robot Navigation"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10393
| null |
Validated
| null | null |
null |
{
"abstract": " We study magnetization reversal in a $\\varphi_0$ Josephson junction with\ndirect coupling between magnetic moment and Josephson current. Our simulations\nof magnetic moment dynamics show that by applying an electric current pulse, we\ncan realize the full magnetization reversal. We propose different protocols of\nfull magnetization reversal based on the variation of the Josephson junction\nand pulse parameters, particularly, electric current pulse amplitude, damping\nof magnetization and spin-orbit interaction. We discuss experiments which can\nprobe the magnetization reversal in $\\varphi_0$-junctions.\n",
"title": "Magnetization reversal by superconducting current in $φ_0$ Josephson junctions"
}
| null | null | null | null | true | null |
10394
| null |
Default
| null | null |
null |
{
"abstract": " As computational astrophysics comes under pressure to become a precision\nscience, there is an increasing need to move to high accuracy schemes for\ncomputational astrophysics. Hence the need for a specialized review on higher\norder schemes for computational astrophysics.\nThe focus here is on weighted essentially non-oscillatory (WENO) schemes,\ndiscontinuous Galerkin (DG) schemes and PNPM schemes. WENO schemes are higher\norder extensions of traditional second order finite volume schemes which are\nalready familiar to most computational astrophysicists. DG schemes, on the\nother hand, evolve all the moments of the solution, with the result that they\nare more accurate than WENO schemes. PNPM schemes occupy a compromise position\nbetween WENO and PNPM schemes. They evolve an Nth order spatial polynomial,\nwhile reconstructing higher order terms up to Mth order. As a result, the\ntimestep can be larger.\nTime-dependent astrophysical codes need to be accurate in space and time.\nThis is realized with the help of SSP-RK (strong stability preserving\nRunge-Kutta) schemes and ADER (Arbitrary DERivative in space and time) schemes.\nThe most popular approaches to SSP-RK and ADER schemes are also described.\nThe style of this review is to assume that readers have a basic understanding\nof hyperbolic systems and one-dimensional Riemann solvers. Such an\nunderstanding can be acquired from a sequence of prepackaged lectures available\nfrom this http URL. We then build on this\nunderstanding to give the reader a practical introduction to the schemes\ndescribed here. The emphasis is on computer-implementable ideas, not\nnecessarily on the underlying theory, because it was felt that this would be\nmost interesting to most computational astrophysicists.\n",
"title": "Higher Order Accurate Space-Time Schemes for Computational Astrophysics -- Part I -- Finite Volume Methods"
}
| null | null | null | null | true | null |
10395
| null |
Default
| null | null |
null |
{
"abstract": " Deep Neural Networks are built to generalize outside of training set in mind\nby using techniques such as regularization, early stopping and dropout. But\nconsiderations to make them more resilient to adversarial examples are rarely\ntaken. As deep neural networks become more prevalent in mission-critical and\nreal-time systems, miscreants start to attack them by intentionally making deep\nneural networks to misclassify an object of one type to be seen as another\ntype. This can be catastrophic in some scenarios where the classification of a\ndeep neural network can lead to a fatal decision by a machine. In this work, we\nused GTSRB dataset to craft adversarial samples by Fast Gradient Sign Method\nand Jacobian Saliency Method, used those crafted adversarial samples to attack\nanother Deep Convolutional Neural Network and built the attacked network to be\nmore resilient against adversarial attacks by making it more robust by\nDefensive Distillation and Adversarial Training\n",
"title": "Building Robust Deep Neural Networks for Road Sign Detection"
}
| null | null | null | null | true | null |
10396
| null |
Default
| null | null |
null |
{
"abstract": " In the Simply Typed $\\lambda$-calculus Statman investigates the reducibility\nrelation $\\leq_{\\beta\\eta}$ between types: for $A,B \\in \\mathbb{T}^0$, types\nfreely generated using $\\rightarrow$ and a single ground type $0$, define $A\n\\leq_{\\beta\\eta} B$ if there exists a $\\lambda$-definable injection from the\nclosed terms of type $A$ into those of type $B$. Unexpectedly, the induced\npartial order is the (linear) well-ordering (of order type) $\\omega + 4$.\nIn the proof a finer relation $\\leq_{h}$ is used, where the above injection\nis required to be a Böhm transformation, and an (a posteriori) coarser\nrelation $\\leq_{h^+}$, requiring a finite family of Böhm transformations that\nis jointly injective.\nWe present this result in a self-contained, syntactic, constructive and\nsimplified manner. En route similar results for $\\leq_h$ (order type $\\omega +\n5$) and $\\leq_{h^+}$ (order type $8$) are obtained. Five of the equivalence\nclasses of $\\leq_{h^+}$ correspond to canonical term models of Statman, one to\nthe trivial term model collapsing all elements of the same type, and one does\nnot even form a model by the lack of closed terms of many types.\n",
"title": "Statman's Hierarchy Theorem"
}
| null | null | null | null | true | null |
10397
| null |
Default
| null | null |
null |
{
"abstract": " We have used Brillouin Light Scattering spectroscopy to independently\ndetermine the in-plane Magneto-Crystalline Anisotropy and the\nDzyaloshinskii-Moriya Interaction (DMI) in out-of-plane magnetized\nAu/Co/W(110). We found that the DMI strength is 2-3 times larger along the\nbcc$[\\bar{1}10]$ than along the bcc$[001]$ direction. We use analytical\nconsiderations to illustrate the relationship between the crystal symmetry of\nthe stack and the anisotropy of microscopic DMI. Such an anisotropic DMI is the\nfirst step to realize isolated elliptical skyrmions or anti-skyrmions in thin\nfilm systems with $C_{2v}$ symmetry.\n",
"title": "Anisotropic Dzyaloshinskii-Moriya Interaction in ultra-thin epitaxial Au/Co/W(110)"
}
| null | null | null | null | true | null |
10398
| null |
Default
| null | null |
null |
{
"abstract": " This paper shows a detailed modeling of three-link robotic finger that is\nactuated by nylon artificial muscles and a simulink model that can be used for\nnumerical study of a robotic finger. The robotic hand prototype was recently\ndemonstrated in recent publication Wu, L., Jung de Andrade, M., Saharan,\nL.,Rome, R., Baughman, R., and Tadesse, Y., 2017, Compact and Low-cost Humanoid\nHand Powered by Nylon Artificial Muscles, Bioinspiration & Biomimetics, 12 (2).\nThe robotic hand is a 3D printed, lightweight and compact hand actuated by\nsilver-coated nylon muscles, often called Twisted and coiled Polymer (TCP)\nmuscles. TCP muscles are thermal actuators that contract when they are heated\nand they are getting attention for application in robotics. The purpose of this\npaper is to demonstrate the modeling equations that were derived based on Euler\nLagrangian approach that is suitable for implementation in simulink model.\n",
"title": "Modeling and Simulation of Robotic Finger Powered by Nylon Artificial Muscles- Equations with Simulink model"
}
| null | null |
[
"Computer Science"
] | null | true | null |
10399
| null |
Validated
| null | null |
null |
{
"abstract": " A key task in Bayesian statistics is sampling from distributions that are\nonly specified up to a partition function (i.e., constant of proportionality).\nHowever, without any assumptions, sampling (even approximately) can be #P-hard,\nand few works have provided \"beyond worst-case\" guarantees for such settings.\nFor log-concave distributions, classical results going back to Bakry and\nÉmery (1985) show that natural continuous-time Markov chains called Langevin\ndiffusions mix in polynomial time. The most salient feature of log-concavity\nviolated in practice is uni-modality: commonly, the distributions we wish to\nsample from are multi-modal. In the presence of multiple deep and\nwell-separated modes, Langevin diffusion suffers from torpid mixing.\nWe address this problem by combining Langevin diffusion with simulated\ntempering. The result is a Markov chain that mixes more rapidly by\ntransitioning between different temperatures of the distribution. We analyze\nthis Markov chain for the canonical multi-modal distribution: a mixture of\ngaussians (of equal variance). The algorithm based on our Markov chain provably\nsamples from distributions that are close to mixtures of gaussians, given\naccess to the gradient of the log-pdf. For the analysis, we use a spectral\ndecomposition theorem for graphs (Gharan and Trevisan, 2014) and a Markov chain\ndecomposition technique (Madras and Randall, 2002).\n",
"title": "Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo"
}
| null | null | null | null | true | null |
10400
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.