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": " We present a compact design for a velocity-map imaging spectrometer for\nenergetic electrons and ions. The standard geometry by Eppink and Parker [A. T.\nJ. B. Eppink and D. H. Parker, Rev. Sci. Instrum. 68, 3477 (1997)] is augmented\nby just two extended electrodes so as to realize an additional einzel lens. In\nthis way, for a maximum electrode voltage of 7 kV we experimentally demonstrate\nimaging of electrons with energies up to 65 eV. Simulations show that energy\nacceptances of <270 and <1,200 eV with an energy resolution of dE / E <5% are\nachievable for electrode voltages of <20 kV when using diameters of the\nposition-sensitive detector of 42 and 78 mm, respectively.\n",
"title": "A compact design for velocity-map imaging energetic electrons and ions"
} | null | null | null | null | true | null | 501 | null | Default | null | null |
null | {
"abstract": " Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai,\nmimic a distributed storage of a set of $n$ data items on $m$ servers, in such\na way that any batch of $k$ data items can be retrieved by reading at most some\n$t$ symbols from each server. Combinatorial batch codes, are replication-based\nbatch codes in which each server stores a subset of the data items.\nIn this paper, we propose a generalization of combinatorial batch codes,\ncalled multiset combinatorial batch codes (MCBC), in which $n$ data items are\nstored in $m$ servers, such that any multiset request of $k$ items, where any\nitem is requested at most $r$ times, can be retrieved by reading at most $t$\nitems from each server. The setup of this new family of codes is motivated by\nrecent work on codes which enable high availability and parallel reads in\ndistributed storage systems. The main problem under this paradigm is to\nminimize the number of items stored in the servers, given the values of\n$n,m,k,r,t$, which is denoted by $N(n,k,m,t;r)$. We first give a necessary and\nsufficient condition for the existence of MCBCs. Then, we present several\nbounds on $N(n,k,m,t;r)$ and constructions of MCBCs. In particular, we\ndetermine the value of $N(n,k,m,1;r)$ for any $n\\geq\n\\left\\lfloor\\frac{k-1}{r}\\right\\rfloor{m\\choose k-1}-(m-k+1)A(m,4,k-2)$, where\n$A(m,4,k-2)$ is the maximum size of a binary constant weight code of length\n$m$, distance four and weight $k-2$. We also determine the exact value of\n$N(n,k,m,1;r)$ when $r\\in\\{k,k-1\\}$ or $k=m$.\n",
"title": "Multiset Combinatorial Batch Codes"
} | null | null | null | null | true | null | 502 | null | Default | null | null |
null | {
"abstract": " The energy efficiency and power of a three-terminal thermoelectric nanodevice\nare studied by considering elastic tunneling through a single quantum dot.\nFacilitated by the three-terminal geometry, the nanodevice is able to generate\nsimultaneously two electrical powers by utilizing only one temperature bias.\nThese two electrical powers can add up constructively or destructively,\ndepending on their signs. It is demonstrated that the constructive addition\nleads to the enhancement of both energy efficiency and output power for various\nsystem parameters. In fact, such enhancement, dubbed as thermoelectric\ncooperative effect, can lead to maximum efficiency and power no less than when\nonly one of the electrical power is harvested.\n",
"title": "Thermoelectric Cooperative Effect in Three-Terminal Elastic Transport through a Quantum Dot"
} | null | null | [
"Physics"
]
| null | true | null | 503 | null | Validated | null | null |
null | {
"abstract": " In recent years, a number of methods for verifying DNNs have been developed.\nBecause the approaches of the methods differ and have their own limitations, we\nthink that a number of verification methods should be applied to a developed\nDNN. To apply a number of methods to the DNN, it is necessary to translate\neither the implementation of the DNN or the verification method so that one\nruns in the same environment as the other. Since those translations are\ntime-consuming, a utility tool, named DeepSaucer, which helps to retain and\nreuse implementations of DNNs, verification methods, and their environments, is\nproposed. In DeepSaucer, code snippets of loading DNNs, running verification\nmethods, and creating their environments are retained and reused as software\nassets in order to reduce cost of verifying DNNs. The feasibility of DeepSaucer\nis confirmed by implementing it on the basis of Anaconda, which provides\nvirtual environment for loading a DNN and running a verification method. In\naddition, the effectiveness of DeepSaucer is demonstrated by usecase examples.\n",
"title": "DeepSaucer: Unified Environment for Verifying Deep Neural Networks"
} | null | null | null | null | true | null | 504 | null | Default | null | null |
null | {
"abstract": " During exploratory testing sessions the tester simultaneously learns, designs\nand executes tests. The activity is iterative and utilizes the skills of the\ntester and provides flexibility and creativity.Test charters are used as a\nvehicle to support the testers during the testing. The aim of this study is to\nsupport practitioners in the design of test charters through checklists. We\naimed to identify factors allowing practitioners to critically reflect on their\ndesigns and contents of test charters to support practitioners in making\ninformed decisions of what to include in test charters. The factors and\ncontents have been elicited through interviews. Overall, 30 factors and 35\ncontent elements have been elicited.\n",
"title": "Checklists to Support Test Charter Design in Exploratory Testing"
} | null | null | null | null | true | null | 505 | null | Default | null | null |
null | {
"abstract": " We demonstrate the parallel and non-destructive readout of the hyperfine\nstate for optically trapped $^{87}$Rb atoms. The scheme is based on\nstate-selective fluorescence imaging and achieves detection fidelities $>$98%\nwithin 10$\\,$ms, while keeping 99% of the atoms trapped. For the read-out of\ndense arrays of neutral atoms in optical lattices, where the fluorescence\nimages of neighboring atoms overlap, we apply a novel image analysis technique\nusing Bayesian inference to determine the internal state of multiple atoms. Our\nmethod is scalable to large neutral atom registers relevant for future quantum\ninformation processing tasks requiring fast and non-destructive readout and can\nalso be used for the simultaneous read-out of quantum information stored in\ninternal qubit states and in the atoms' positions.\n",
"title": "Fast non-destructive parallel readout of neutral atom registers in optical potentials"
} | null | null | null | null | true | null | 506 | null | Default | null | null |
null | {
"abstract": " In this work we apply Amplitude Modulation Spectrum (AMS) features to the\nsource localization problem. Our approach computes 36 bilateral features for 2s\nlong signal segments and estimates the azimuthal directions of a sound source\nthrough a binaurally trained classifier. This directional information of a\nsound source could be e.g. used to steer the beamformer in a hearing aid to the\nsource of interest in order to increase the SNR. We evaluated our approach on\nthe development set of the IEEE-AASP Challenge on sound source localization and\ntracking (LOCATA) and achieved a 4.25° smaller MAE than the baseline\napproach. Additionally, our approach is computationally less complex.\n",
"title": "Binaural Source Localization based on Modulation-Domain Features and Decision Pooling"
} | null | null | null | null | true | null | 507 | null | Default | null | null |
null | {
"abstract": " We propose a novel class of dynamic shrinkage processes for Bayesian time\nseries and regression analysis. Building upon a global-local framework of prior\nconstruction, in which continuous scale mixtures of Gaussian distributions are\nemployed for both desirable shrinkage properties and computational\ntractability, we model dependence among the local scale parameters. The\nresulting processes inherit the desirable shrinkage behavior of popular\nglobal-local priors, such as the horseshoe prior, but provide additional\nlocalized adaptivity, which is important for modeling time series data or\nregression functions with local features. We construct a computationally\nefficient Gibbs sampling algorithm based on a Pólya-Gamma scale mixture\nrepresentation of the proposed process. Using dynamic shrinkage processes, we\ndevelop a Bayesian trend filtering model that produces more accurate estimates\nand tighter posterior credible intervals than competing methods, and apply the\nmodel for irregular curve-fitting of minute-by-minute Twitter CPU usage data.\nIn addition, we develop an adaptive time-varying parameter regression model to\nassess the efficacy of the Fama-French five-factor asset pricing model with\nmomentum added as a sixth factor. Our dynamic analysis of manufacturing and\nhealthcare industry data shows that with the exception of the market risk, no\nother risk factors are significant except for brief periods.\n",
"title": "Dynamic Shrinkage Processes"
} | null | null | null | null | true | null | 508 | null | Default | null | null |
null | {
"abstract": " The monitoring of the lifestyles may be performed based on a system for the\nrecognition of Activities of Daily Living (ADL) and their environments,\ncombining the results obtained with the user agenda. The system may be\ndeveloped with the use of the off-the-shelf mobile devices commonly used,\nbecause they have several types of sensors available, including motion,\nmagnetic, acoustic, and location sensors. Data acquisition, data processing,\ndata fusion, and artificial intelligence methods are applied in different\nstages of the system developed, which recognizes the ADL with pattern\nrecognition methods. The motion and magnetic sensors allow the recognition of\nactivities with movement, but the acoustic sensors allow the recognition of the\nenvironments. The fusion of the motion, magnetic and acoustic sensors allows\nthe differentiation of other ADL. On the other hand, the location sensors\nallows the recognition of ADL with large movement, and the combination of these\nsensors with the other sensors increases the number of ADL recognized by the\nsystem. This study consists on the comparison of different types of ANN for\nchoosing the best methods for the recognition of several ADL, which they are\nimplemented in a system for the recognition of ADL that combines the sensors\ndata with the users agenda for the monitoring of the lifestyles. Conclusions\npoint to the use of Deep Neural Networks (DNN) with normalized data for the\nidentification of ADL with 85.89% of accuracy, the use of Feedforward neural\nnetworks with non-normalized data for the identification of the environments\nwith 86.50% of accuracy, and the use of DNN with normalized data for the\nidentification of standing activities with 100% of accuracy, proving the\nreliability of the framework presented in this study.\n",
"title": "A Multiple Source Framework for the Identification of Activities of Daily Living Based on Mobile Device Data"
} | null | null | null | null | true | null | 509 | null | Default | null | null |
null | {
"abstract": " The extreme value index is a fundamental parameter in univariate Extreme\nValue Theory (EVT). It captures the tail behavior of a distribution and is\ncentral in the extrapolation beyond observed data. Among other semi-parametric\nmethods (such as the popular Hill's estimator), the Block Maxima (BM) and\nPeaks-Over-Threshold (POT) methods are widely used for assessing the extreme\nvalue index and related normalizing constants. We provide asymptotic theory for\nthe maximum likelihood estimators (MLE) based on the BM method. Our main result\nis the asymptotic normality of the MLE with a non-trivial bias depending on the\nextreme value index and on the so-called second order parameter. Our approach\ncombines asymptotic expansions of the likelihood process and of the empirical\nquantile process of block maxima. The results permit to complete the comparison\nof most common semi-parametric estimators in EVT (MLE and probability weighted\nmoment estimators based on the POT or BM methods) through their asymptotic\nvariances, biases and optimal mean square errors.\n",
"title": "Maximum likelihood estimators based on the block maxima method"
} | null | null | null | null | true | null | 510 | null | Default | null | null |
null | {
"abstract": " The spread of opinions, memes, diseases, and \"alternative facts\" in a\npopulation depends both on the details of the spreading process and on the\nstructure of the social and communication networks on which they spread. In\nthis paper, we explore how \\textit{anti-establishment} nodes (e.g.,\n\\textit{hipsters}) influence the spreading dynamics of two competing products.\nWe consider a model in which spreading follows a deterministic rule for\nupdating node states (which describe which product has been adopted) in which\nan adjustable fraction $p_{\\rm Hip}$ of the nodes in a network are hipsters,\nwho choose to adopt the product that they believe is the less popular of the\ntwo. The remaining nodes are conformists, who choose which product to adopt by\nconsidering which products their immediate neighbors have adopted. We simulate\nour model on both synthetic and real networks, and we show that the hipsters\nhave a major effect on the final fraction of people who adopt each product:\neven when only one of the two products exists at the beginning of the\nsimulations, a very small fraction of hipsters in a network can still cause the\nother product to eventually become the more popular one. To account for this\nbehavior, we construct an approximation for the steady-state adoption fraction\non $k$-regular trees in the limit of few hipsters. Additionally, our\nsimulations demonstrate that a time delay $\\tau$ in the knowledge of the\nproduct distribution in a population, as compared to immediate knowledge of\nproduct adoption among nearest neighbors, can have a large effect on the final\ndistribution of product adoptions. Our simple model and analysis may help shed\nlight on the road to success for anti-establishment choices in elections, as\nsuch success can arise rather generically in our model from a small number of\nanti-establishment individuals and ordinary processes of social influence on\nnormal individuals.\n",
"title": "Hipsters on Networks: How a Small Group of Individuals Can Lead to an Anti-Establishment Majority"
} | null | null | null | null | true | null | 511 | null | Default | null | null |
null | {
"abstract": " We study the problem of testing identity against a given distribution with a\nfocus on the high confidence regime. More precisely, given samples from an\nunknown distribution $p$ over $n$ elements, an explicitly given distribution\n$q$, and parameters $0< \\epsilon, \\delta < 1$, we wish to distinguish, {\\em\nwith probability at least $1-\\delta$}, whether the distributions are identical\nversus $\\varepsilon$-far in total variation distance. Most prior work focused\non the case that $\\delta = \\Omega(1)$, for which the sample complexity of\nidentity testing is known to be $\\Theta(\\sqrt{n}/\\epsilon^2)$. Given such an\nalgorithm, one can achieve arbitrarily small values of $\\delta$ via black-box\namplification, which multiplies the required number of samples by\n$\\Theta(\\log(1/\\delta))$.\nWe show that black-box amplification is suboptimal for any $\\delta = o(1)$,\nand give a new identity tester that achieves the optimal sample complexity. Our\nnew upper and lower bounds show that the optimal sample complexity of identity\ntesting is \\[\n\\Theta\\left( \\frac{1}{\\epsilon^2}\\left(\\sqrt{n \\log(1/\\delta)} +\n\\log(1/\\delta) \\right)\\right) \\] for any $n, \\varepsilon$, and $\\delta$. For\nthe special case of uniformity testing, where the given distribution is the\nuniform distribution $U_n$ over the domain, our new tester is surprisingly\nsimple: to test whether $p = U_n$ versus $d_{\\mathrm TV}(p, U_n) \\geq\n\\varepsilon$, we simply threshold $d_{\\mathrm TV}(\\widehat{p}, U_n)$, where\n$\\widehat{p}$ is the empirical probability distribution. The fact that this\nsimple \"plug-in\" estimator is sample-optimal is surprising, even in the\nconstant $\\delta$ case. Indeed, it was believed that such a tester would not\nattain sublinear sample complexity even for constant values of $\\varepsilon$\nand $\\delta$.\n",
"title": "Optimal Identity Testing with High Probability"
} | null | null | null | null | true | null | 512 | null | Default | null | null |
null | {
"abstract": " Component-based design is a different way of constructing systems which\noffers numerous benefits, in particular, decreasing the complexity of system\ndesign. However, deploying components into a system is a challenging and\nerror-prone task. Model checking is one of the reliable methods that\nautomatically and systematically analyse the correctness of a given system. Its\nbrute-force check of the state space significantly expands the level of\nconfidence in the system. Nevertheless, model checking is limited by a critical\nproblem so-called State Space Explosion (SSE). To benefit from model checking,\nappropriate methods to reduce SSE, is required. In two last decades, a great\nnumber of methods to mitigate the state space explosion have been proposed\nwhich have many similarities, dissimilarities, and unclear concepts in some\ncases. This research, firstly, aims at present a review and brief discussion of\nthe methods of handling SSE problem and classify them based on their\nsimilarities, principle and characteristics. Second, it investigates the\nmethods for handling SSE problem in verifying Component-based system (CBS) and\nprovides insight into CBS verification limitations that have not been addressed\nyet. The analysis in this research has revealed the patterns, specific\nfeatures, and gaps in the state-of-the-art methods. In addition, we identified\nand discussed suitable methods to soften SSE problem in CBS and underlined the\nkey challenges for future research efforts.\n",
"title": "Handling state space explosion in verification of component-based systems: A review"
} | null | null | [
"Computer Science",
"Mathematics"
]
| null | true | null | 513 | null | Validated | null | null |
null | {
"abstract": " Dust devils are likely the dominant source of dust for the martian\natmosphere, but the amount and frequency of dust-lifting depend on the\nstatistical distribution of dust devil parameters. Dust devils exhibit pressure\nperturbations and, if they pass near a barometric sensor, they may register as\na discernible dip in a pressure time-series. Leveraging this fact, several\nsurveys using barometric sensors on landed spacecraft have revealed dust devil\nstructures and occurrence rates. However powerful they are, though, such\nsurveys suffer from non-trivial biases that skew the inferred dust devil\nproperties. For example, such surveys are most sensitive to dust devils with\nthe widest and deepest pressure profiles, but the recovered profiles will be\ndistorted, broader and shallow than the actual profiles. In addition, such\nsurveys often do not provide wind speed measurements alongside the pressure\ntime series, and so the durations of the dust devil signals in the time series\ncannot be directly converted to profile widths. Fortunately, simple statistical\nand geometric considerations can de-bias these surveys, allowing conversion of\nthe duration of dust devil signals into physical widths, given only a\ndistribution of likely translation velocities, and the recovery of the\nunderlying distributions of physical parameters. In this study, we develop a\nscheme for de-biasing such surveys. Applying our model to an in-situ survey\nusing data from the Phoenix lander suggests a larger dust flux and a dust devil\noccurrence rate about ten times larger than previously inferred. Comparing our\nresults to dust devil track surveys suggests only about one in five\nlow-pressure cells lifts sufficient dust to leave a visible track.\n",
"title": "A Framework for Relating the Structures and Recovery Statistics in Pressure Time-Series Surveys for Dust Devils"
} | null | null | null | null | true | null | 514 | null | Default | null | null |
null | {
"abstract": " With the help of first principles calculation method based on the density\nfunctional theory we have investigated the structural, elastic, mechanical\nproperties and Debye temperature of Fe2ScM (M = P and As) compounds under\npressure up to 60 GPa. The optical properties have been investigated under zero\npressure. Our calculated optimized structural parameters of both the compounds\nare in good agreement with the other theoretical results. The calculated\nelastic constants show that Fe2ScM (M = P and As) compounds are mechanically\nstable up to 60 GPa.\n",
"title": "Investigation on different physical aspects such as structural, elastic, mechanical, optical properties and Debye temperature of Fe2ScM (M = P and As) semiconductors: a DFT based first principles study"
} | null | null | null | null | true | null | 515 | null | Default | null | null |
null | {
"abstract": " Lowpass envelope approximation of smooth continuous-variable signals are\nintroduced in this work. Envelope approximations are necessary when a given\nsignal has to be approximated always to a larger value (such as in TV white\nspace protection regions). In this work, a near-optimal approximate algorithm\nfor finding a signal's envelope, while minimizing a mean-squared cost function,\nis detailed. The sparse (lowpass) signal approximation is obtained in the\nlinear Fourier series basis. This approximate algorithm works by discretizing\nthe envelope property from an infinite number of points to a large (but finite)\nnumber of points. It is shown that this approximate algorithm is near-optimal\nand can be solved by using efficient convex optimization programs available in\nthe literature. Simulation results are provided towards the end to gain more\ninsights into the analytical results presented.\n",
"title": "Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space"
} | null | null | null | null | true | null | 516 | null | Default | null | null |
null | {
"abstract": " We study the spectral properties of curl, a linear differential operator of\nfirst order acting on differential forms of appropriate degree on an\nodd-dimensional closed oriented Riemannian manifold. In three dimensions its\neigenvalues are the electromagnetic oscillation frequencies in vacuum without\nexternal sources. In general, the spectrum consists of the eigenvalue 0 with\ninfinite multiplicity and further real discrete eigenvalues of finite\nmultiplicity. We compute the Weyl asymptotics and study the zeta-function. We\ngive a sharp lower eigenvalue bound for positively curved manifolds and analyze\nthe equality case. Finally, we compute the spectrum for flat tori, round\nspheres and 3-dimensional spherical space forms.\n",
"title": "The curl operator on odd-dimensional manifolds"
} | null | null | null | null | true | null | 517 | null | Default | null | null |
null | {
"abstract": " This paper presents a topology optimization framework for structural problems\nsubjected to transient loading. The mechanical model assumes a linear elastic\nisotropic material, infinitesimal strains, and a dynamic response. The\noptimization problem is solved using the gradient-based optimizer Method of\nMoving Asymptotes (MMA) with time-dependent sensitivities provided via the\nadjoint method. The stiffness of materials is interpolated using the Solid\nIsotropic Material with Penalization (SIMP) method and the Heaviside Projection\nMethod (HPM) is used to stabilize the problem numerically and improve the\nmanufacturability of the topology-optimized designs. Both static and dynamic\noptimization examples are considered here. The resulting optimized designs\ndemonstrate the ability of topology optimization to tailor the transient\nresponse of structures.\n",
"title": "Topology optimization for transient response of structures subjected to dynamic loads"
} | null | null | null | null | true | null | 518 | null | Default | null | null |
null | {
"abstract": " It is pointed out that the generalized Lambert series\n$\\displaystyle\\sum_{n=1}^{\\infty}\\frac{n^{N-2h}}{e^{n^{N}x}-1}$ studied by\nKanemitsu, Tanigawa and Yoshimoto can be found on page $332$ of Ramanujan's\nLost Notebook in a slightly more general form. We extend an important\ntransformation of this series obtained by Kanemitsu, Tanigawa and Yoshimoto by\nremoving restrictions on the parameters $N$ and $h$ that they impose. From our\nextension we deduce a beautiful new generalization of Ramanujan's famous\nformula for odd zeta values which, for $N$ odd and $m>0$, gives a relation\nbetween $\\zeta(2m+1)$ and $\\zeta(2Nm+1)$. A result complementary to the\naforementioned generalization is obtained for any even $N$ and\n$m\\in\\mathbb{Z}$. It generalizes a transformation of Wigert and can be regarded\nas a formula for $\\zeta\\left(2m+1-\\frac{1}{N}\\right)$. Applications of these\ntransformations include a generalization of the transformation for the\nlogarithm of Dedekind eta-function $\\eta(z)$, Zudilin- and Rivoal-type results\non transcendence of certain values, and a transcendence criterion for Euler's\nconstant $\\gamma$.\n",
"title": "Generalized Lambert series and arithmetic nature of odd zeta values"
} | null | null | null | null | true | null | 519 | null | Default | null | null |
null | {
"abstract": " Motivated by applications in cancer genomics and following the work of\nHajirasouliha and Raphael (WABI 2014), Hujdurović et al. (IEEE TCBB, to\nappear) introduced the minimum conflict-free row split (MCRS) problem: split\neach row of a given binary matrix into a bitwise OR of a set of rows so that\nthe resulting matrix corresponds to a perfect phylogeny and has the minimum\npossible number of rows among all matrices with this property. Hajirasouliha\nand Raphael also proposed the study of a similar problem, in which the task is\nto minimize the number of distinct rows of the resulting matrix. Hujdurović\net al. proved that both problems are NP-hard, gave a related characterization\nof transitively orientable graphs, and proposed a polynomial-time heuristic\nalgorithm for the MCRS problem based on coloring cocomparability graphs.\nWe give new, more transparent formulations of the two problems, showing that\nthe problems are equivalent to two optimization problems on branchings in a\nderived directed acyclic graph. Building on these formulations, we obtain new\nresults on the two problems, including: (i) a strengthening of the heuristic by\nHujdurović et al. via a new min-max result in digraphs generalizing\nDilworth's theorem, which may be of independent interest, (ii) APX-hardness\nresults for both problems, (iii) approximation algorithms, and (iv)\nexponential-time algorithms solving the two problems to optimality faster than\nthe naïve brute-force approach. Our work relates to several well studied\nnotions in combinatorial optimization: chain partitions in partially ordered\nsets, laminar hypergraphs, and (classical and weighted) colorings of graphs.\n",
"title": "Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem"
} | null | null | [
"Computer Science",
"Mathematics"
]
| null | true | null | 520 | null | Validated | null | null |
null | {
"abstract": " Smart cities are a growing trend in many cities in Argentina. In particular,\nthe so-called intermediate cities present a context and requirements different\nfrom those of large cities with respect to smart cities. One aspect of\nrelevance is to encourage the development of applications (generally for mobile\ndevices) that enable citizens to take advantage of data and services normally\nassociated with the city, for example, in the urban mobility domain. In this\nwork, a platform is proposed for intermediate cities that provide \"high level\"\nservices and that allow the construction of software applications that consume\nthose services. Our platform-centric strategy focused aims to integrate systems\nand heterogeneous data sources, and provide \"intelligent\" services to different\napplications. Examples of these services include: construction of user\nprofiles, recommending local events, and collaborative sensing based on data\nmining techniques, among others. In this work, the design of this platform\n(currently in progress) is described, and experiences of applications for urban\nmobility are discussed, which are being migrated in the form of reusable\nservices provided by the platform\n",
"title": "Towards a Service-oriented Platform for Intelligent Apps in Intermediate Cities"
} | null | null | null | null | true | null | 521 | null | Default | null | null |
null | {
"abstract": " Bayesian estimation is increasingly popular for performing model based\ninference to support policymaking. These data are often collected from surveys\nunder informative sampling designs where subject inclusion probabilities are\ndesigned to be correlated with the response variable of interest. Sampling\nweights constructed from marginal inclusion probabilities are typically used to\nform an exponentiated pseudo likelihood that adjusts the population likelihood\nfor estimation on the sample due to ease-of-estimation. We propose an\nalternative adjustment based on a Bayes rule construction that simultaneously\nperforms weight smoothing and estimates the population model parameters in a\nfully Bayesian construction. We formulate conditions on known marginal and\npairwise inclusion probabilities that define a class of sampling designs where\n$L_{1}$ consistency of the joint posterior is guaranteed. We compare\nperformances between the two approaches on synthetic data, which reveals that\nour fully Bayesian approach better estimates posterior uncertainty without a\nrequirement to calibrate the normalization of the sampling weights. We\ndemonstrate our method on an application concerning the National Health and\nNutrition Examination Survey exploring the relationship between caffeine\nconsumption and systolic blood pressure.\n",
"title": "Fully Bayesian Estimation Under Informative Sampling"
} | null | null | null | null | true | null | 522 | null | Default | null | null |
null | {
"abstract": " Reaction-diffusion equations appear in biology and chemistry, and combine\nlinear diffusion with different kind of reaction terms. Some of them are\nremarkable from the mathematical point of view, since they admit families of\ntravelling waves that describe the asymptotic behaviour of a larger class of\nsolutions $0\\leq u(x,t)\\leq 1$ of the problem posed in the real line. We\ninvestigate here the existence of waves with constant propagation speed, when\nthe linear diffusion is replaced by the \"slow\" doubly nonlinear diffusion. In\nthe present setting we consider bistable reaction terms, which present\ninteresting differences w.r.t. the Fisher-KPP framework recently studied in\n\\cite{AA-JLV:art}. We find different families of travelling waves that are\nemployed to describe the wave propagation of more general solutions and to\nstudy the stability/instability of the steady states, even when we extend the\nstudy to several space dimensions. A similar study is performed in the critical\ncase that we call \"pseudo-linear\", i.e., when the operator is still nonlinear\nbut has homogeneity one. With respect to the classical model and the\n\"pseudo-linear\" case, the travelling waves of the \"slow\" diffusion setting\nexhibit free boundaries. \\\\ Finally, as a complement of \\cite{AA-JLV:art}, we\nstudy the asymptotic behaviour of more general solutions in the presence of a\n\"heterozygote superior\" reaction function and doubly nonlinear diffusion\n(\"slow\" and \"pseudo-linear\").\n",
"title": "Bistable reaction equations with doubly nonlinear diffusion"
} | null | null | null | null | true | null | 523 | null | Default | null | null |
null | {
"abstract": " Drivable free space information is vital for autonomous vehicles that have to\nplan evasive maneuvers in real-time. In this paper, we present a new efficient\nmethod for environmental free space detection with laser scanner based on 2D\noccupancy grid maps (OGM) to be used for Advanced Driving Assistance Systems\n(ADAS) and Collision Avoidance Systems (CAS). Firstly, we introduce an enhanced\ninverse sensor model tailored for high-resolution laser scanners for building\nOGM. It compensates the unreflected beams and deals with the ray casting to\ngrid cells accuracy and computational effort problems. Secondly, we introduce\nthe 'vehicle on a circle for grid maps' map alignment algorithm that allows\nbuilding more accurate local maps by avoiding the computationally expensive\ninaccurate operations of image sub-pixel shifting and rotation. The resulted\ngrid map is more convenient for ADAS features than existing methods, as it\nallows using less memory sizes, and hence, results into a better real-time\nperformance. Thirdly, we present an algorithm to detect what we call the\n'in-sight edges'. These edges guarantee modeling the free space area with a\nsingle polygon of a fixed number of vertices regardless the driving situation\nand map complexity. The results from real world experiments show the\neffectiveness of our approach.\n",
"title": "Static Free Space Detection with Laser Scanner using Occupancy Grid Maps"
} | null | null | null | null | true | null | 524 | null | Default | null | null |
null | {
"abstract": " In this paper, the fundamental problem of distribution and proactive caching\nof computing tasks in fog networks is studied under latency and reliability\nconstraints. In the proposed scenario, computing can be executed either locally\nat the user device or offloaded to an edge cloudlet. Moreover, cloudlets\nexploit both their computing and storage capabilities by proactively caching\npopular task computation results to minimize computing latency. To this end, a\nclustering method to group spatially proximate user devices with mutual task\npopularity interests and their serving cloudlets is proposed. Then, cloudlets\ncan proactively cache the popular tasks' computations of their cluster members\nto minimize computing latency. Additionally, the problem of distributing tasks\nto cloudlets is formulated as a matching game in which a cost function of\ncomputing delay is minimized under latency and reliability constraints.\nSimulation results show that the proposed scheme guarantees reliable\ncomputations with bounded latency and achieves up to 91% decrease in computing\nlatency as compared to baseline schemes.\n",
"title": "Proactive Edge Computing in Latency-Constrained Fog Networks"
} | null | null | null | null | true | null | 525 | null | Default | null | null |
null | {
"abstract": " High-mass stars are expected to form from dense prestellar cores. Their\nprecise formation conditions are widely discussed, including their virial\ncondition, which results in slow collapse for super-virial cores with strong\nsupport by turbulence or magnetic fields, or fast collapse for sub-virial\nsources. To disentangle their formation processes, measurements of the\ndeuterium fractions are frequently employed to approximately estimate the ages\nof these cores and to obtain constraints on their dynamical evolution. We here\npresent 3D magneto-hydrodynamical simulations including for the first time an\naccurate non-equilibrium chemical network with 21 gas-phase species plus dust\ngrains and 213 reactions. With this network we model the deuteration process in\nfully depleted prestellar cores in great detail and determine its response to\nvariations in the initial conditions. We explore the dependence on the initial\ngas column density, the turbulent Mach number, the mass-to-magnetic flux ratio\nand the distribution of the magnetic field, as well as the initial\northo-to-para ratio of H2. We find excellent agreement with recent observations\nof deuterium fractions in quiescent sources. Our results show that deuteration\nis rather efficient, even when assuming a conservative ortho-to-para ratio of 3\nand highly sub-virial initial conditions, leading to large deuterium fractions\nalready within roughly a free-fall time. We discuss the implications of our\nresults and give an outlook to relevant future investigations.\n",
"title": "Deuterium fractionation and H2D+ evolution in turbulent and magnetized cloud cores"
} | null | null | null | null | true | null | 526 | null | Default | null | null |
null | {
"abstract": " The Lennard-Jones (LJ) potential is a cornerstone of Molecular Dynamics (MD)\nsimulations and among the most widely used computational kernels in science.\nThe potential models atomistic attraction and repulsion with century old\nprescribed parameters ($q=6, \\; p=12$, respectively), originally related by a\nfactor of two for simplicity of calculations. We re-examine the value of the\nrepulsion exponent through data driven uncertainty quantification. We perform\nHierarchical Bayesian inference on MD simulations of argon using experimental\ndata of the radial distribution function (RDF) for a range of thermodynamic\nconditions, as well as dimer interaction energies from quantum mechanics\nsimulations. The experimental data suggest a repulsion exponent ($p \\approx\n6.5$), in contrast to the quantum simulations data that support values closer\nto the original ($p=12$) exponent. Most notably, we find that predictions of\nRDF, diffusion coefficient and density of argon are more accurate and robust in\nproducing the correct argon phase around its triple point, when using the\nvalues inferred from experimental data over those from quantum mechanics\nsimulations. The present results suggest the need for data driven recalibration\nof the LJ potential across MD simulations.\n",
"title": "Experimental data over quantum mechanics simulations for inferring the repulsive exponent of the Lennard-Jones potential in Molecular Dynamics"
} | null | null | null | null | true | null | 527 | null | Default | null | null |
null | {
"abstract": " Thompson sampling has emerged as an effective heuristic for a broad range of\nonline decision problems. In its basic form, the algorithm requires computing\nand sampling from a posterior distribution over models, which is tractable only\nfor simple special cases. This paper develops ensemble sampling, which aims to\napproximate Thompson sampling while maintaining tractability even in the face\nof complex models such as neural networks. Ensemble sampling dramatically\nexpands on the range of applications for which Thompson sampling is viable. We\nestablish a theoretical basis that supports the approach and present\ncomputational results that offer further insight.\n",
"title": "Ensemble Sampling"
} | null | null | null | null | true | null | 528 | null | Default | null | null |
null | {
"abstract": " In recent years, Deep Learning has become the go-to solution for a broad\nrange of applications, often outperforming state-of-the-art. However, it is\nimportant, for both theoreticians and practitioners, to gain a deeper\nunderstanding of the difficulties and limitations associated with common\napproaches and algorithms. We describe four types of simple problems, for which\nthe gradient-based algorithms commonly used in deep learning either fail or\nsuffer from significant difficulties. We illustrate the failures through\npractical experiments, and provide theoretical insights explaining their\nsource, and how they might be remedied.\n",
"title": "Failures of Gradient-Based Deep Learning"
} | null | null | null | null | true | null | 529 | null | Default | null | null |
null | {
"abstract": " Proxima Centauri is known as the closest star from the Sun. Recently, radial\nvelocity observations revealed the existence of an Earth-mass planet around it.\nWith an orbital period of ~11 days, the surface of Proxima Centauri b is\ntemperate and might be habitable. We took a photometric monitoring campaign to\nsearch for its transit, using the Bright Star Survey Telescope at the Zhongshan\nStation in Antarctica. A transit-like signal appearing on 2016 September 8th,\nis identified tentatively. Its midtime, $T_{C}=2,457,640.1990\\pm0.0017$ HJD, is\nconsistent with the predicted ephemeris based on RV orbit in a 1$\\sigma$\nconfidence interval. Time-correlated noise is pronounced in the light curve of\nProxima Centauri, affecting detection of transits. We develop a technique, in a\nGaussian process framework, to gauge the statistical significance of potential\ntransit detection. The tentative transit signal reported here, has a confidence\nlevel of $2.5\\sigma$. Further detection of its periodic signals is necessary to\nconfirm the planetary transit of Proxima Centauri b. We plan to monitor Proxima\nCentauri in next Polar night at Dome A in Antarctica, taking the advantage of\ncontinuous darkness. \\citet{Kipping17} reported two tentative transit-like\nsignals of Proxima Centauri b, observed by the Microvariability and Oscillation\nof Stars space Telescope in 2014 and 2015, respectively. The midtransit time of\nour detection is 138 minutes later than that predicted by their transit\nephemeris. If all the signals are real transits, the misalignment of the epochs\nplausibly suggests transit timing variations of Proxima Centauri b induced by\nan outer planet in this system.\n",
"title": "Searching for the Transit of the Earth--mass exoplanet Proxima~Centauri~b in Antarctica: Preliminary Result"
} | null | null | null | null | true | null | 530 | null | Default | null | null |
null | {
"abstract": " In this paper, we propose an optimization-based sparse learning approach to\nidentify the set of most influential reactions in a chemical reaction network.\nThis reduced set of reactions is then employed to construct a reduced chemical\nreaction mechanism, which is relevant to chemical interaction network modeling.\nThe problem of identifying influential reactions is first formulated as a\nmixed-integer quadratic program, and then a relaxation method is leveraged to\nreduce the computational complexity of our approach. Qualitative and\nquantitative validation of the sparse encoding approach demonstrates that the\nmodel captures important network structural properties with moderate\ncomputational load.\n",
"title": "A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks"
} | null | null | null | null | true | null | 531 | null | Default | null | null |
null | {
"abstract": " Using density-functional theory calculations, we analyze the optical\nabsorption properties of lead (Pb)-free metal halide perovskites\n(AB$^{2+}$X$_3$) and double perovskites (AB$^+$B$^{3+}$X$_6$) (A = Cs or\nmonovalent organic ion, B$^{2+}$ = non-Pb divalent metal, B$^+$ = monovalent\nmetal, B$^{3+}$ = trivalent metal, X = halogen). We show that, if B$^{2+}$ is\nnot Sn or Ge, Pb-free metal halide perovskites exhibit poor optical absorptions\nbecause of their indirect bandgap nature. Among the nine possible types of\nPb-free metal halide double perovskites, six have direct bandgaps. Of these six\ntypes, four show inversion symmetry-induced parity-forbidden or weak\ntransitions between band edges, making them not ideal for thin-film solar cell\napplication. Only one type of Pb-free double perovskite shows optical\nabsorption and electronic properties suitable for solar cell applications,\nnamely those with B$^+$ = In, Tl and B$^{3+}$ = Sb, Bi. Our results provide\nimportant insights for designing new metal halide perovskites and double\nperovskites for optoelectronic applications.\n",
"title": "Parity-Forbidden Transitions and Their Impacts on the Optical Absorption Properties of Lead-Free Metal Halide Perovskites and Double Perovskites"
} | null | null | null | null | true | null | 532 | null | Default | null | null |
null | {
"abstract": " MicroRNAs play important roles in many biological processes. Their aberrant\nexpression can have oncogenic or tumor suppressor function directly\nparticipating to carcinogenesis, malignant transformation, invasiveness and\nmetastasis. Indeed, miRNA profiles can distinguish not only between normal and\ncancerous tissue but they can also successfully classify different subtypes of\na particular cancer. Here, we focus on a particular class of transcripts\nencoding polycistronic miRNA genes that yields multiple miRNA components. We\ndescribe clustered MiRNA Master Regulator Analysis (ClustMMRA), a fully\nredesigned release of the MMRA computational pipeline (MiRNA Master Regulator\nAnalysis), developed to search for clustered miRNAs potentially driving cancer\nmolecular subtyping. Genomically clustered miRNAs are frequently co-expressed\nto target different components of pro-tumorigenic signalling pathways. By\napplying ClustMMRA to breast cancer patient data, we identified key miRNA\nclusters driving the phenotype of different tumor subgroups. The pipeline was\napplied to two independent breast cancer datasets, providing statistically\nconcordant results between the two analysis. We validated in cell lines the\nmiR-199/miR-214 as a novel cluster of miRNAs promoting the triple negative\nsubtype phenotype through its control of proliferation and EMT.\n",
"title": "Identification of microRNA clusters cooperatively acting on Epithelial to Mesenchymal Transition in Triple Negative Breast Cancer"
} | null | null | null | null | true | null | 533 | null | Default | null | null |
null | {
"abstract": " We present a simultaneous localization and mapping (SLAM) algorithm that is\nbased on radio signals and the association of specular multipath components\n(MPCs) with geometric features. Especially in indoor scenarios, robust\nlocalization from radio signals is challenging due to diffuse multipath\npropagation, unknown MPC-feature association, and limited visibility of\nfeatures. In our approach, specular reflections at flat surfaces are described\nin terms of virtual anchors (VAs) that are mirror images of the physical\nanchors (PAs). The positions of these VAs and possibly also of the PAs are\nunknown. We develop a Bayesian model of the SLAM problem including the unknown\nMPC-VA/PA association. We represent this model by a factor graph, which enables\nthe use of the belief propagation (BP) scheme for efficient marginalization of\nthe joint posterior distribution. The resulting BP-based SLAM algorithm detects\nthe VAs associated with the PAs and estimates jointly the time-varying position\nof the mobile agent and the positions of the VAs and possibly also of the PAs,\nthereby leveraging the MPCs in the radio signal for improved accuracy and\nrobustness of agent localization. A core aspect of the algorithm is BP-based\nprobabilistic MPC-VA/PA association. Moreover, for improved initialization of\nnew VA positions, the states of unobserved potential VAs are modeled as a\nrandom finite set and propagated in time by means of a \"zero-measurement\"\nprobability hypothesis density filter. The proposed BP-based SLAM algorithm has\na low computational complexity and scales well in all relevant system\nparameters. Experimental results using both synthetically generated\nmeasurements and real ultra-wideband radio signals demonstrate the excellent\nperformance of the algorithm in challenging indoor environments.\n",
"title": "A Belief Propagation Algorithm for Multipath-Based SLAM"
} | null | null | null | null | true | null | 534 | null | Default | null | null |
null | {
"abstract": " This survey is about old and new results about the modular representation\ntheory of finite reductive groups with a strong emphasis on local methods. This\nincludes subpairs, Brauer's Main Theorems, fusion, Rickard equivalences. In the\ndefining characteristic we describe the relation between $p$-local subgroups\nand parabolic subgroups, then give classical consequences on simple modules and\nblocks, including the Alperin weight conjecture in that case. In the\nnon-defining characteristics, we sketch a picture of the local methods\npioneered by Fong-Srinivasan in the determination of blocks and their ordinary\ncharacters. This includes the relationship with Lusztig's twisted induction and\nthe determination of defect groups. We conclude with a survey of the results\nand methods by Bonnafé-Dat-Rouquier giving Morita equivalences between blocks\nthat preserve defect groups and the local structures.\nThe text grew out of the course and talks given by the author in July and\nSeptember 2016 during the program \"Local representation theory and simple\ngroups\" at CIB Lausanne. Written Oct 2017, to appear in a proceedings volume\npublished by EMS.\n",
"title": "Local methods for blocks of finite simple groups"
} | null | null | null | null | true | null | 535 | null | Default | null | null |
null | {
"abstract": " A high redundant non-holonomic humanoid mobile dual-arm manipulator system is\npresented in this paper where the motion planning to realize \"human-like\"\nautonomous navigation and manipulation tasks is studied. Firstly, an improved\nMaxiMin NSGA-II algorithm, which optimizes five objective functions to solve\nthe problems of singularity, redundancy, and coupling between mobile base and\nmanipulator simultaneously, is proposed to design the optimal pose to\nmanipulate the target object. Then, in order to link the initial pose and that\noptimal pose, an off-line motion planning algorithm is designed. In detail, an\nefficient direct-connect bidirectional RRT and gradient descent algorithm is\nproposed to reduce the sampled nodes largely, and a geometric optimization\nmethod is proposed for path pruning. Besides, head forward behaviors are\nrealized by calculating the reasonable orientations and assigning them to the\nmobile base to improve the quality of human-robot interaction. Thirdly, the\nextension to on-line planning is done by introducing real-time sensing,\ncollision-test and control cycles to update robotic motion in dynamic\nenvironments. Fourthly, an EEs' via-point-based multi-objective genetic\nalgorithm is proposed to design the \"human-like\" via-poses by optimizing four\nobjective functions. Finally, numerous simulations are presented to validate\nthe effectiveness of proposed algorithms.\n",
"title": "Motion Planning for a Humanoid Mobile Manipulator System"
} | null | null | null | null | true | null | 536 | null | Default | null | null |
null | {
"abstract": " This article discusses a framework to support the design and end-to-end\nplanning of fixed millimeter-wave networks. Compared to traditional techniques,\nthe framework allows an organization to quickly plan a deployment in a\ncost-effective way. We start by using LiDAR data---basically, a 3D point cloud\ncaptured from a city---to estimate potential sites to deploy antennas and\nwhether there is line-of-sight between them. With that data on hand, we use\ncombinatorial optimization techniques to determine the optimal set of locations\nand how they should communicate with each other, to satisfy engineering (e.g.,\nlatency, polarity), design (e.g., reliability) and financial (e.g., total cost\nof operation) constraints. The primary goal is to connect as many people as\npossible to the network. Our methodology can be used for strategic planning\nwhen an organization is in the process of deciding whether to adopt a\nmillimeter-wave technology or choosing between locations, or for operational\nplanning when conducting a detailed design of the actual network to be deployed\nin a selected location.\n",
"title": "End-to-end Planning of Fixed Millimeter-Wave Networks"
} | null | null | null | null | true | null | 537 | null | Default | null | null |
null | {
"abstract": " The amount of ultraviolet irradiation and ablation experienced by a planet\ndepends strongly on the temperature of its host star. Of the thousands of\nextra-solar planets now known, only four giant planets have been found that\ntransit hot, A-type stars (temperatures of 7300-10,000K), and none are known to\ntransit even hotter B-type stars. WASP-33 is an A-type star with a temperature\nof ~7430K, which hosts the hottest known transiting planet; the planet is\nitself as hot as a red dwarf star of type M. The planet displays a large heat\ndifferential between its day-side and night-side, and is highly inflated,\ntraits that have been linked to high insolation. However, even at the\ntemperature of WASP-33b's day-side, its atmosphere likely resembles the\nmolecule-dominated atmospheres of other planets, and at the level of\nultraviolet irradiation it experiences, its atmosphere is unlikely to be\nsignificantly ablated over the lifetime of its star. Here we report\nobservations of the bright star HD 195689, which reveal a close-in (orbital\nperiod ~1.48 days) transiting giant planet, KELT-9b. At ~10,170K, the host star\nis at the dividing line between stars of type A and B, and we measure the\nKELT-9b's day-side temperature to be ~4600K. This is as hot as stars of stellar\ntype K4. The molecules in K stars are entirely dissociated, and thus the\nprimary sources of opacity in the day-side atmosphere of KELT-9b are likely\natomic metals. Furthermore, KELT-9b receives ~700 times more extreme\nultraviolet radiation (wavelengths shorter than 91.2 nanometers) than WASP-33b,\nleading to a predicted range of mass-loss rates that could leave the planet\nlargely stripped of its envelope during the main-sequence lifetime of the host\nstar.\n",
"title": "A giant planet undergoing extreme ultraviolet irradiation by its hot massive-star host"
} | null | null | [
"Physics"
]
| null | true | null | 538 | null | Validated | null | null |
null | {
"abstract": " Online video services, messaging systems, games and social media services are\ntremendously popular among young people and children in many countries. Most of\nthe digital services offered on the internet are advertising funded, which\nmakes advertising ubiquitous in children's everyday life. To understand the\nimpact of advertising-based digital services on children, we study the\ncollective behavior of users of YouTube for kids channels and present the\ndemographics of a large number of users. We collected data from 12,848 videos\nfrom 17 channels in US and UK and 24 channels in Brazil. The channels in\nEnglish have been viewed more than 37 billion times. We also collected more\nthan 14 million comments made by users. Based on a combination of text-analysis\nand face recognition tools, we show the presence of racial and gender biases in\nour large sample of users. We also identify children actively using YouTube,\nalthough the minimum age for using the service is 13 years in most countries.\nWe provide comparisons of user behavior among the three countries, which\nrepresent large user populations in the global North and the global South.\n",
"title": "Characterizing videos, audience and advertising in Youtube channels for kids"
} | null | null | null | null | true | null | 539 | null | Default | null | null |
null | {
"abstract": " We prove that the homotopy algebraic K-theory of tame quasi-DM stacks\nsatisfies cdh-descent. We apply this descent result to prove that if X is a\nNoetherian tame quasi-DM stack and i < -dim(X), then K_i(X)[1/n] = 0 (resp.\nK_i(X, Z/n) = 0) provided that n is nilpotent on X (resp. is invertible on X).\nOur descent and vanishing results apply more generally to certain Artin stacks\nwhose stabilizers are extensions of finite group schemes by group schemes of\nmultiplicative type.\n",
"title": "Vanishing theorems for the negative K-theory of stacks"
} | null | null | null | null | true | null | 540 | null | Default | null | null |
null | {
"abstract": " Screened modified gravity (SMG) is a kind of scalar-tensor theory with\nscreening mechanisms, which can suppress the fifth force in dense regions and\nallow theories to evade the solar system and laboratory tests. In this paper,\nwe investigate how the screening mechanisms in SMG affect the gravitational\nradiation damping effects, calculate in detail the rate of the energy loss due\nto the emission of tensor and scalar gravitational radiations, and derive their\ncontributions to the change in the orbital period of the binary system. We find\nthat the scalar radiation depends on the screened parameters and the\npropagation speed of scalar waves, and the scalar dipole radiation dominates\nthe orbital decay of the binary system. For strongly self-gravitating bodies,\nall effects of scalar sector are strongly suppressed by the screening\nmechanisms in SMG. By comparing our results to observations of binary system\nPSR J1738+0333, we place the stringent constraints on the screening mechanisms\nin SMG. As an application of these results, we focus on three specific models\nof SMG (chameleon, symmetron, and dilaton), and derive the constraints on the\nmodel parameters, respectively.\n",
"title": "Gravitational radiation from compact binary systems in screened modified gravity"
} | null | null | null | null | true | null | 541 | null | Default | null | null |
null | {
"abstract": " Selective weed treatment is a critical step in autonomous crop management as\nrelated to crop health and yield. However, a key challenge is reliable, and\naccurate weed detection to minimize damage to surrounding plants. In this\npaper, we present an approach for dense semantic weed classification with\nmultispectral images collected by a micro aerial vehicle (MAV). We use the\nrecently developed encoder-decoder cascaded Convolutional Neural Network (CNN),\nSegnet, that infers dense semantic classes while allowing any number of input\nimage channels and class balancing with our sugar beet and weed datasets. To\nobtain training datasets, we established an experimental field with varying\nherbicide levels resulting in field plots containing only either crop or weed,\nenabling us to use the Normalized Difference Vegetation Index (NDVI) as a\ndistinguishable feature for automatic ground truth generation. We train 6\nmodels with different numbers of input channels and condition (fine-tune) it to\nachieve about 0.8 F1-score and 0.78 Area Under the Curve (AUC) classification\nmetrics. For model deployment, an embedded GPU system (Jetson TX2) is tested\nfor MAV integration. Dataset used in this paper is released to support the\ncommunity and future work.\n",
"title": "weedNet: Dense Semantic Weed Classification Using Multispectral Images and MAV for Smart Farming"
} | null | null | null | null | true | null | 542 | null | Default | null | null |
null | {
"abstract": " Let $G:=\\widehat{SL_2}$ denote the affine Kac-Moody group associated to\n$SL_2$ and $\\bar{\\mathcal{X}}$ the associated affine Grassmannian. We determine\nan inductive formula for the Schubert basis structure constants in the\ntorus-equivariant Grothendieck group of $\\bar{\\mathcal{X}}$. In the case of\nordinary (non-equivariant) $K$-theory we find an explicit closed form for the\nstructure constants. We also determine an inductive formula for the structure\nconstants in the torus-equivariant cohomology ring, and use this formula to\nfind closed forms for some of the structure constants.\n",
"title": "An explicit determination of the $K$-theoretic structure constants of the affine Grassmannian associated to $SL_2$"
} | null | null | null | null | true | null | 543 | null | Default | null | null |
null | {
"abstract": " The existing measurement theory interprets the variance as the dispersion of\nmeasured value, which is actually contrary to a general mathematical knowledge\nthat the variance of a constant is 0. This paper will fully demonstrate that\nthe variance in measurement theory is actually the evaluation of probability\ninterval of an error instead of the dispersion of a measured value, point out\nthe key point of mistake in the existing interpretation, and fully interpret a\nseries of changes in conceptual logic and processing method brought about by\nthis new concept.\n",
"title": "The Correct Application of Variance Concept in Measurement Theory"
} | null | null | null | null | true | null | 544 | null | Default | null | null |
null | {
"abstract": " Researchers are often interested in analyzing conditional treatment effects.\nOne variant of this is \"causal moderation,\" which implies that intervention\nupon a third (moderator) variable would alter the treatment effect. This study\npresents a generalized, non-parametric framework for estimating causal\nmoderation effects given randomized treatments and non-randomized moderators\nthat achieves a number of goals. First, it highlights how conventional\napproaches do not constitute unbiased or consistent estimators of causal\nmoderation effects. Second, it offers researchers a simple, transparent\napproach for estimating causal moderation effects and lays out the assumptions\nunder which this can be performed consistently and/or without bias. Third, as\npart of the estimation process, it allows researchers to implement their\npreferred method of covariate adjustment, including parametric and\nnon-parametric methods, or alternative identification strategies of their\nchoosing. Fourth, it provides a set-up whereby sensitivity analysis designed\nfor the average-treatment-effect context can be extended to the moderation\ncontext. An original application is also presented.\n",
"title": "A Generalized Framework for the Estimation of Causal Moderation Effects with Randomized Treatments and Non-Randomized Moderators"
} | null | null | null | null | true | null | 545 | null | Default | null | null |
null | {
"abstract": " This paper deals with some simple results about spherical functions of type\n$\\delta$, namely new integral formulas, new results about behavior at infinity\nand some facts about the related $C_\\sigma$ functions.\n",
"title": "Spherical Functions on Riemannian Symmetric Spaces"
} | null | null | null | null | true | null | 546 | null | Default | null | null |
null | {
"abstract": " In this study, we determine all modular curves $X_0(N)$ that admit infinitely\nmany cubic points.\n",
"title": "Modular curves with infinitely many cubic points"
} | null | null | null | null | true | null | 547 | null | Default | null | null |
null | {
"abstract": " In the framework of multi-body dynamics, successive encounters with a third\nbody, even if well outside of its sphere of influence, can noticeably alter the\ntrajectory of a spacecraft. Examples of these effects have already been\nexploited by past missions such as SMART-1, as well as are proposed to benefit\nfuture missions to Jupiter, Saturn or Neptune, and disposal strategies from\nEarth's High Eccentric or Libration Point Orbits. This paper revises three\ntotally different descriptions of the effects of the third body gravitational\nperturbation. These are the averaged dynamics of the classical third body\nperturbing function, the Opik's close encounter theory and the Keplerian map\napproach. The first two techniques have respectively been applied to the cases\nof a spacecraft either always remaining very far or occasionally experiencing\nextremely close approaches to the third body. However, the paper also seeks\nsolutions for trajectories that undergo one or more close approaches at\ndistances in the order of the sphere of influence of the third body. The paper\nattempts to gain insight into the accuracy of these different perturbative\ntechniques into each of these scenarios, as compared with the motion in the\nCircular Restricted Three Body Problem.\n",
"title": "Semi-Analytical Perturbative Approaches to Third Body Resonant Trajectories"
} | null | null | null | null | true | null | 548 | null | Default | null | null |
null | {
"abstract": " Capsule Networks envision an innovative point of view about the\nrepresentation of the objects in the brain and preserve the hierarchical\nspatial relationships between them. This type of networks exhibits a huge\npotential for several Machine Learning tasks like image classification, while\noutperforming Convolutional Neural Networks (CNNs). A large body of work has\nexplored adversarial examples for CNNs, but their efficacy to Capsule Networks\nis not well explored. In our work, we study the vulnerabilities in Capsule\nNetworks to adversarial attacks. These perturbations, added to the test inputs,\nare small and imperceptible to humans, but fool the network to mis-predict. We\npropose a greedy algorithm to automatically generate targeted imperceptible\nadversarial examples in a black-box attack scenario. We show that this kind of\nattacks, when applied to the German Traffic Sign Recognition Benchmark (GTSRB),\nmislead Capsule Networks. Moreover, we apply the same kind of adversarial\nattacks to a 9-layer CNN and analyze the outcome, compared to the Capsule\nNetworks to study their differences / commonalities.\n",
"title": " Robust and Imperceptible Adversarial Attacks on Capsule Networks"
} | null | null | [
"Computer Science",
"Statistics"
]
| null | true | null | 549 | null | Validated | null | null |
null | {
"abstract": " The effects of MHD boundary layer flow of non-linear thermal radiation with\nconvective heat transfer and non-uniform heat source/sink in presence of\nthermophortic velocity and chemical reaction investigated in this study.\nSuitable similarity transformation are used to solve the partial ordinary\ndifferential equation of considered governing flow. Runge-Kutta fourth fifth\norder Fehlberg method with shooting techniques are used to solved\nnon-dimensional governing equations. The variation of different parameters such\nas thermophoretic parameter, chemical reaction parameter, non- uniform heat\nsource/sink parameters are studied on velocity, temperature and concentration\nprofiles, and are described by suitable graphs and tables. The obtained results\nare in very well agreement with previous results.\n",
"title": "Thermophoretic MHD Flow and Non-linear Radiative Heat Transfer with Convective Boundary Conditions over a Non-linearly Stretching Sheet"
} | null | null | null | null | true | null | 550 | null | Default | null | null |
null | {
"abstract": " Resting-state functional Arterial Spin Labeling (rs-fASL) in clinical daily\npractice and academic research stay discreet compared to resting-state BOLD.\nHowever, by giving direct access to cerebral blood flow maps, rs-fASL leads to\nsignificant clinical subject scaled application as CBF can be considered as a\nbiomarker in common neuropathology. Our work here focuses on the link between\noverall quality of rs-fASL and duration of acquisition. To this end, we\nconsider subject self-Default Mode Network (DMN), and assess DMN quality\ndepletion compared to a gold standard DMN depending on the duration of\nacquisition.\n",
"title": "Resting-state ASL : Toward an optimal sequence duration"
} | null | null | null | null | true | null | 551 | null | Default | null | null |
null | {
"abstract": " We propose a novel end-to-end neural network architecture that, once trained,\ndirectly outputs a probabilistic clustering of a batch of input examples in one\npass. It estimates a distribution over the number of clusters $k$, and for each\n$1 \\leq k \\leq k_\\mathrm{max}$, a distribution over the individual cluster\nassignment for each data point. The network is trained in advance in a\nsupervised fashion on separate data to learn grouping by any perceptual\nsimilarity criterion based on pairwise labels (same/different group). It can\nthen be applied to different data containing different groups. We demonstrate\npromising performance on high-dimensional data like images (COIL-100) and\nspeech (TIMIT). We call this ``learning to cluster'' and show its conceptual\ndifference to deep metric learning, semi-supervise clustering and other related\napproaches while having the advantage of performing learnable clustering fully\nend-to-end.\n",
"title": "Learning Neural Models for End-to-End Clustering"
} | null | null | null | null | true | null | 552 | null | Default | null | null |
null | {
"abstract": " The collective magnetic excitations in the spin-orbit Mott insulator\n(Sr$_{1-x}$La$_x$)$_2$IrO$_4$ ($x=0,\\,0.01,\\,0.04,\\, 0.1$) were investigated by\nmeans of resonant inelastic x-ray scattering. We report significant magnon\nenergy gaps at both the crystallographic and antiferromagnetic zone centers at\nall doping levels, along with a remarkably pronounced momentum-dependent\nlifetime broadening. The spin-wave gap is accounted for by a significant\nanisotropy in the interactions between $J_\\text{eff}=1/2$ isospins, thus\nmarking the departure of Sr$_2$IrO$_4$ from the essentially isotropic\nHeisenberg model appropriate for the superconducting cuprates.\n",
"title": "Anisotropic exchange and spin-wave damping in pure and electron-doped Sr$_2$IrO$_4$"
} | null | null | [
"Physics"
]
| null | true | null | 553 | null | Validated | null | null |
null | {
"abstract": " We report the proximity induced anomalous transport behavior in a Nb\nBi1.95Sb0.05Se3 heterostructure. Mechanically Exfoliated single crystal of\nBi1.95Sb0.05Se3 topological insulator (TI) is partially covered with a 100 nm\nthick Niobium superconductor using DC magnetron sputtering by shadow masking\ntechnique. The magnetotransport (MR) measurements have been performed\nsimultaneously on the TI sample with and without Nb top layer in the\ntemperature,T, range of 3 to 8 K, and a magnetic field B up to 15 T. MR on TI\nregion shows Subnikov de Haas oscillation at fields greater than 5 T. Anomalous\nlinear change in resistance is observed in the field range of negative 4T to\npositive 4T at which Nb is superconducting. At 0 T field, the temperature\ndependence of resistance on the Nb covered region revealed a superconducting\ntransition (TC) at 8.2 K, whereas TI area showed similar TC with the absence of\nzero resistance states due to the additional resistance from superconductor\n(SC) TI interface. Interestingly below the TC the R vs T measured on TI showed\nan enhancement in resistance for positive field and prominent fall in\nresistance for negative field direction. This indicates the directional\ndependent scattering of the Cooper pairs on the surface of the TI due to the\nsuperposition of spin singlet and triplet states in the superconductor and TI\nrespectively.\n",
"title": "Anomalous transport properties in Nb/Bi1.95Sb0.05Se3 hybrid structure"
} | null | null | null | null | true | null | 554 | null | Default | null | null |
null | {
"abstract": " Networked control systems (NCS) have attracted considerable attention in\nrecent years. While the stabilizability and optimal control of NCS for a given\ncommunication system has already been studied extensively, the design of the\ncommunication system for NCS has recently seen an increase in more thorough\ninvestigation. In this paper, we address an optimal scheduling problem for a\nset of NCS sharing a dedicated communication channel, providing performance\nbounds and asymptotic stability. We derive a suboptimal scheduling policy with\ndynamic state-based priorities calculated at the sensors, which are then used\nfor stateless priority queuing in the network, making it both scalable and\nefficient to implement on routers or multi-layer switches. These properties are\nbeneficial towards leveraging existing IP networks for control, which will be a\ncrucial factor for the proliferation of wide-area NCS applications. By allowing\nfor an arbitrary number of concurrent transmissions, we are able to investigate\nthe relationship between available bandwidth, transmission rate, and delay. To\ndemonstrate the feasibility of our approach, we provide a proof-of-concept\nimplementation of the priority scheduler using real networking hardware.\n",
"title": "State-dependent Priority Scheduling for Networked Control Systems"
} | null | null | null | null | true | null | 555 | null | Default | null | null |
null | {
"abstract": " Given a property of representations satisfying a basic stability condition,\nRamakrishna developed a variant of Mazur's Galois deformation theory for\nrepresentations with that property. We introduce an axiomatic definition of\npseudorepresentations with such a property. Among other things, we show that\npseudorepresentations with a property enjoy a good deformation theory,\ngeneralizing Ramakrishna's theory to pseudorepresentations.\n",
"title": "Deformation conditions for pseudorepresentations"
} | null | null | null | null | true | null | 556 | null | Default | null | null |
null | {
"abstract": " A novel adaptive local surface refinement technique based on Locally Refined\nNon-Uniform Rational B-Splines (LR NURBS) is presented. LR NURBS can model\ncomplex geometries exactly and are the rational extension of LR B-splines. The\nlocal representation of the parameter space overcomes the drawback of\nnon-existent local refinement in standard NURBS-based isogeometric analysis.\nFor a convenient embedding into general finite element code, the Bézier\nextraction operator for LR NURBS is formulated. An automatic remeshing\ntechnique is presented that allows adaptive local refinement and coarsening of\nLR NURBS. In this work, LR NURBS are applied to contact computations of 3D\nsolids and membranes. For solids, LR NURBS-enriched finite elements are used to\ndiscretize the contact surfaces with LR NURBS finite elements, while the rest\nof the body is discretized by linear Lagrange finite elements. For membranes,\nthe entire surface is discretized by LR NURBS. Various numerical examples are\nshown, and they demonstrate the benefit of using LR NURBS: Compared to uniform\nrefinement, LR NURBS can achieve high accuracy at lower computational cost.\n",
"title": "Adaptive local surface refinement based on LR NURBS and its application to contact"
} | null | null | null | null | true | null | 557 | null | Default | null | null |
null | {
"abstract": " This paper introduces a general method to approximate the convolution of an\narbitrary program with a Gaussian kernel. This process has the effect of\nsmoothing out a program. Our compiler framework models intermediate values in\nthe program as random variables, by using mean and variance statistics. Our\napproach breaks the input program into parts and relates the statistics of the\ndifferent parts, under the smoothing process. We give several approximations\nthat can be used for the different parts of the program. These include the\napproximation of Dorn et al., a novel adaptive Gaussian approximation, Monte\nCarlo sampling, and compactly supported kernels. Our adaptive Gaussian\napproximation is accurate up to the second order in the standard deviation of\nthe smoothing kernel, and mathematically smooth. We show how to construct a\ncompiler that applies chosen approximations to given parts of the input\nprogram. Because each expression can have multiple approximation choices, we\nuse a genetic search to automatically select the best approximations. We apply\nthis framework to the problem of automatically bandlimiting procedural shader\nprograms. We evaluate our method on a variety of complex shaders, including\nshaders with parallax mapping, animation, and spatially varying statistics. The\nresulting smoothed shader programs outperform previous approaches both\nnumerically, and aesthetically, due to the smoothing properties of our\napproximations.\n",
"title": "Approximate Program Smoothing Using Mean-Variance Statistics, with Application to Procedural Shader Bandlimiting"
} | null | null | [
"Computer Science"
]
| null | true | null | 558 | null | Validated | null | null |
null | {
"abstract": " Large-scale computational experiments, often running over weeks and over\nlarge datasets, are used extensively in fields such as epidemiology,\nmeteorology, computational biology, and healthcare to understand phenomena, and\ndesign high-stakes policies affecting everyday health and economy. For\ninstance, the OpenMalaria framework is a computationally-intensive simulation\nused by various non-governmental and governmental agencies to understand\nmalarial disease spread and effectiveness of intervention strategies, and\nsubsequently design healthcare policies. Given that such shared results form\nthe basis of inferences drawn, technological solutions designed, and day-to-day\npolicies drafted, it is essential that the computations are validated and\ntrusted. In particular, in a multi-agent environment involving several\nindependent computing agents, a notion of trust in results generated by peers\nis critical in facilitating transparency, accountability, and collaboration.\nUsing a novel combination of distributed validation of atomic computation\nblocks and a blockchain-based immutable audits mechanism, this work proposes a\nuniversal framework for distributed trust in computations. In particular we\naddress the scalaibility problem by reducing the storage and communication\ncosts using a lossy compression scheme. This framework guarantees not only\nverifiability of final results, but also the validity of local computations,\nand its cost-benefit tradeoffs are studied using a synthetic example of\ntraining a neural network.\n",
"title": "Trusted Multi-Party Computation and Verifiable Simulations: A Scalable Blockchain Approach"
} | null | null | null | null | true | null | 559 | null | Default | null | null |
null | {
"abstract": " We provide an overview of several non-linear activation functions in a neural\nnetwork architecture that have proven successful in many machine learning\napplications. We conduct an empirical analysis on the effectiveness of using\nthese function on the MNIST classification task, with the aim of clarifying\nwhich functions produce the best results overall. Based on this first set of\nresults, we examine the effects of building deeper architectures with an\nincreasing number of hidden layers. We also survey the impact of using, on the\nsame task, different initialisation schemes for the weights of our neural\nnetwork. Using these sets of experiments as a base, we conclude by providing a\noptimal neural network architecture that yields impressive results in accuracy\non the MNIST classification task.\n",
"title": "Empirical analysis of non-linear activation functions for Deep Neural Networks in classification tasks"
} | null | null | null | null | true | null | 560 | null | Default | null | null |
null | {
"abstract": " Advancements in deep learning over the years have attracted research into how\ndeep artificial neural networks can be used in robotic systems. This research\nsurvey will present a summarization of the current research with a specific\nfocus on the gains and obstacles for deep learning to be applied to mobile\nrobotics.\n",
"title": "A Survey of Deep Learning Techniques for Mobile Robot Applications"
} | null | null | null | null | true | null | 561 | null | Default | null | null |
null | {
"abstract": " Our desire and fascination with intelligent machines dates back to the\nantiquity's mythical automaton Talos, Aristotle's mode of mechanical thought\n(syllogism) and Heron of Alexandria's mechanical machines and automata.\nHowever, the quest for Artificial General Intelligence (AGI) is troubled with\nrepeated failures of strategies and approaches throughout the history. This\ndecade has seen a shift in interest towards bio-inspired software and hardware,\nwith the assumption that such mimicry entails intelligence. Though these steps\nare fruitful in certain directions and have advanced automation, their singular\ndesign focus renders them highly inefficient in achieving AGI. Which set of\nrequirements have to be met in the design of AGI? What are the limits in the\ndesign of the artificial? Here, a careful examination of computation in\nbiological systems hints that evolutionary tinkering of contextual processing\nof information enabled by a hierarchical architecture is the key to build AGI.\n",
"title": "Design of the Artificial: lessons from the biological roots of general intelligence"
} | null | null | null | null | true | null | 562 | null | Default | null | null |
null | {
"abstract": " Conventional crystalline magnets are characterized by symmetry breaking and\nnormal modes of excitation called magnons with quantized angular momentum\n$\\hbar$. Neutron scattering correspondingly features extra magnetic Bragg\ndiffraction at low temperatures and dispersive inelastic scattering associated\nwith single magnon creation and annihilation. Exceptions are anticipated in\nso-called quantum spin liquids as exemplified by the one-dimensional spin-1/2\nchain which has no magnetic order and where magnons accordingly fractionalize\ninto spinons with angular momentum $\\hbar/2$. This is spectacularly revealed by\na continuum of inelastic neutron scattering associated with two-spinon\nprocesses and the absence of magnetic Bragg diffraction. Here, we report\nevidence for these same key features of a quantum spin liquid in the\nthree-dimensional Heisenberg antiferromagnet NaCaNi$_2$F$_7$. Through specific\nheat and neutron scattering measurements, Monte Carlo simulations, and analytic\napproximations to the equal time correlations, we show that NaCaNi$_2$F$_7$ is\nan almost ideal realization of the spin-1 antiferromagnetic Heisenberg model on\na pyrochlore lattice with weak connectivity and frustrated interactions.\nMagnetic Bragg diffraction is absent and 90\\% of the spectral weight forms a\ncontinuum of magnetic scattering not dissimilar to that of the spin-1/2 chain\nbut with low energy pinch points indicating NaCaNi$_2$F$_7$ is in a Coulomb\nphase. The residual entropy and diffuse elastic scattering points to an exotic\nstate of matter driven by frustration, quantum fluctuations and weak exchange\ndisorder.\n",
"title": "Continuum of quantum fluctuations in a three-dimensional $S\\!=\\!1$ Heisenberg magnet"
} | null | null | [
"Physics"
]
| null | true | null | 563 | null | Validated | null | null |
null | {
"abstract": " We introduce the new version of SimProp, a Monte Carlo code for simulating\nthe propagation of ultra-high energy cosmic rays in intergalactic space. This\nversion, SimProp v2r4, together with an overall improvement of the code\ncapabilities with a substantial reduction in the computation time, also\ncomputes secondary cosmogenic particles such as electron-positron pairs and\ngamma rays produced during the propagation of ultra-high energy cosmic rays. As\nrecently pointed out by several authors, the flux of this secondary radiation\nand its products, within reach of the current observatories, provides useful\ninformation about models of ultra-high energy cosmic ray sources which would be\nhard to discriminate otherwise.\n",
"title": "SimProp v2r4: Monte Carlo simulation code for UHECR propagation"
} | null | null | null | null | true | null | 564 | null | Default | null | null |
null | {
"abstract": " Given a collection of data points, non-negative matrix factorization (NMF)\nsuggests to express them as convex combinations of a small set of `archetypes'\nwith non-negative entries. This decomposition is unique only if the true\narchetypes are non-negative and sufficiently sparse (or the weights are\nsufficiently sparse), a regime that is captured by the separability condition\nand its generalizations.\nIn this paper, we study an approach to NMF that can be traced back to the\nwork of Cutler and Breiman (1994) and does not require the data to be\nseparable, while providing a generally unique decomposition. We optimize the\ntrade-off between two objectives: we minimize the distance of the data points\nfrom the convex envelope of the archetypes (which can be interpreted as an\nempirical risk), while minimizing the distance of the archetypes from the\nconvex envelope of the data (which can be interpreted as a data-dependent\nregularization). The archetypal analysis method of (Cutler, Breiman, 1994) is\nrecovered as the limiting case in which the last term is given infinite weight.\nWe introduce a `uniqueness condition' on the data which is necessary for\nexactly recovering the archetypes from noiseless data. We prove that, under\nuniqueness (plus additional regularity conditions on the geometry of the\narchetypes), our estimator is robust. While our approach requires solving a\nnon-convex optimization problem, we find that standard optimization methods\nsucceed in finding good solutions both for real and synthetic data.\n",
"title": "Non-negative Matrix Factorization via Archetypal Analysis"
} | null | null | null | null | true | null | 565 | null | Default | null | null |
null | {
"abstract": " Muon reconstruction in the Daya Bay water pools would serve to verify the\nsimulated muon fluxes and offer the possibility of studying cosmic muons in\ngeneral. This reconstruction is, however, complicated by many optical obstacles\nand the small coverage of photomultiplier tubes (PMTs) as compared to other\nlarge water Cherenkov detectors. The PMTs' timing information is useful only in\nthe case of direct, unreflected Cherenkov light. This requires PMTs to be added\nand removed as an hypothesized muon trajectory is iteratively improved, to\naccount for the changing effects of obstacles and direction of light.\nTherefore, muon reconstruction in the Daya Bay water pools does not lend itself\nto a general fitting procedure employing smoothly varying functions with\ncontinuous derivatives. Here, an algorithm is described which overcomes these\ncomplications. It employs the method of Least Mean Squares to determine an\nhypothesized trajectory from the PMTs' charge-weighted positions. This\ninitially hypothesized trajectory is then iteratively refined using the PMTs'\ntiming information. Reconstructions with simulated data reproduce the simulated\ntrajectory to within about 5 degrees in direction and about 45 cm in position\nat the pool surface, with a bias that tends to pull tracks away from the\nvertical by about 3 degrees.\n",
"title": "Muon Reconstruction in the Daya Bay Water Pools"
} | null | null | null | null | true | null | 566 | null | Default | null | null |
null | {
"abstract": " We present a method to improve the accuracy of a foot-mounted,\nzero-velocity-aided inertial navigation system (INS) by varying estimator\nparameters based on a real-time classification of motion type. We train a\nsupport vector machine (SVM) classifier using inertial data recorded by a\nsingle foot-mounted sensor to differentiate between six motion types (walking,\njogging, running, sprinting, crouch-walking, and ladder-climbing) and report\nmean test classification accuracy of over 90% on a dataset with five different\nsubjects. From these motion types, we select two of the most common (walking\nand running), and describe a method to compute optimal zero-velocity detection\nparameters tailored to both a specific user and motion type by maximizing the\ndetector F-score. By combining the motion classifier with a set of optimal\ndetection parameters, we show how we can reduce INS position error during mixed\nwalking and running motion. We evaluate our adaptive system on a total of 5.9\nkm of indoor pedestrian navigation performed by five different subjects moving\nalong a 130 m path with surveyed ground truth markers.\n",
"title": "Improving Foot-Mounted Inertial Navigation Through Real-Time Motion Classification"
} | null | null | null | null | true | null | 567 | null | Default | null | null |
null | {
"abstract": " The primary function of memory allocators is to allocate and deallocate\nchunks of memory primarily through the malloc API. Many memory allocators also\nimplement other API extensions, such as deriving the size of an allocated\nobject from the object's pointer, or calculating the base address of an\nallocation from an interior pointer. In this paper, we propose a general\npurpose extended allocator API built around these common extensions. We argue\nthat such extended APIs have many applications and demonstrate several use\ncases, such as (manual) memory error detection, meta data storage, typed\npointers and compact data-structures. Because most existing allocators were not\ndesigned for the extended API, traditional implementations are expensive or not\npossible.\nRecently, the LowFat allocator for heap and stack objects has been developed.\nThe LowFat allocator is an implementation of the idea of low-fat pointers,\nwhere object bounds information (size and base) are encoded into the native\nmachine pointer representation itself. The \"killer app\" for low-fat pointers is\nautomated bounds check instrumentation for program hardening and bug detection.\nHowever, the LowFat allocator can also be used to implement highly optimized\nversion of the extended allocator API, which makes the new applications (listed\nabove) possible. In this paper, we implement and evaluate several applications\nbased efficient memory allocator API extensions using low-fat pointers. We also\nextend the LowFat allocator to cover global objects for the first time.\n",
"title": "An Extended Low Fat Allocator API and Applications"
} | null | null | null | null | true | null | 568 | null | Default | null | null |
null | {
"abstract": " We extend a data-based model-free multifractal method of exoplanet detection\nto probe exoplanetary atmospheres. Whereas the transmission spectrum is studied\nduring the primary eclipse, we analyze the emission spectrum during the\nsecondary eclipse, thereby probing the atmospheric limb. In addition to the\nspectral structure of exoplanet atmospheres, the approach provides information\nto study phenomena such as atmospheric flows, tidal-locking behavior, and the\ndayside-nightside redistribution of energy. The approach is demonstrated using\nSpitzer data for exoplanet HD189733b. The central advantage of the method is\nthe lack of model assumptions in the detection and observational schemes.\n",
"title": "Exoplanet Atmosphere Retrieval using Multifractal Analysis of Secondary Eclipse Spectra"
} | null | null | null | null | true | null | 569 | null | Default | null | null |
null | {
"abstract": " We formulate and analyze a novel hypothesis testing problem for inferring the\nedge structure of an infection graph. In our model, a disease spreads over a\nnetwork via contagion or random infection, where the random variables governing\nthe rates of contracting the disease from neighbors or random infection are\nindependent exponential random variables with unknown rate parameters. A subset\nof nodes is also censored uniformly at random. Given the statuses of nodes in\nthe network, the goal is to determine the underlying graph. We present a\nprocedure based on permutation testing, and we derive sufficient conditions for\nthe validity of our test in terms of automorphism groups of the graphs\ncorresponding to the null and alternative hypotheses. Further, the test is\nvalid more generally for infection processes satisfying a basic symmetry\ncondition. Our test is easy to compute and does not involve estimating unknown\nparameters governing the process. We also derive risk bounds for our\npermutation test in a variety of settings, and motivate our test statistic in\nterms of approximate equivalence to likelihood ratio testing and maximin tests.\nWe conclude with an application to real data from an HIV infection network.\n",
"title": "Permutation Tests for Infection Graphs"
} | null | null | null | null | true | null | 570 | null | Default | null | null |
null | {
"abstract": " This work is motivated by a particular problem of a modern paper\nmanufacturing industry, in which maximum efficiency of the fiber-filler\nrecovery process is desired. A lot of unwanted materials along with valuable\nfibers and fillers come out as a by-product of the paper manufacturing process\nand mostly goes as waste. The job of an efficient Krofta supracell is to\nseparate the unwanted materials from the valuable ones so that fibers and\nfillers can be collected from the waste materials and reused in the\nmanufacturing process. The efficiency of Krofta depends on several crucial\nprocess parameters and monitoring them is a difficult proposition. To solve\nthis problem, we propose a novel hybridization of regression trees (RT) and\nartificial neural networks (ANN), hybrid RT-ANN model, to solve the problem of\nlow recovery percentage of the supracell. This model is used to achieve the\ngoal of improving supracell efficiency, viz., gain in percentage recovery. In\naddition, theoretical results for the universal consistency of the proposed\nmodel are given with the optimal value of a vital model parameter. Experimental\nfindings show that the proposed hybrid RT-ANN model achieves higher accuracy in\npredicting Krofta recovery percentage than other conventional regression models\nfor solving the Krofta efficiency problem. This work will help the paper\nmanufacturing company to become environmentally friendly with minimal\necological damage and improved waste recovery.\n",
"title": "A novel distribution-free hybrid regression model for manufacturing process efficiency improvement"
} | null | null | null | null | true | null | 571 | null | Default | null | null |
null | {
"abstract": " Telescopes based on the imaging atmospheric Cherenkov technique (IACTs)\ndetect images of the atmospheric showers generated by gamma rays and cosmic\nrays as they are absorbed by the atmosphere. The much more frequent cosmic-ray\nevents form the main background when looking for gamma-ray sources, and\ntherefore IACT sensitivity is significantly driven by the capability to\ndistinguish between these two types of events. Supervised learning algorithms,\nlike random forests and boosted decision trees, have been shown to effectively\nclassify IACT events. In this contribution we present results from exploratory\nwork using deep learning as an event classification method for the Cherenkov\nTelescope Array (CTA). CTA, conceived as an array of tens of IACTs, is an\ninternational project for a next-generation ground-based gamma-ray observatory,\naiming to improve on the sensitivity of current-generation experiments by an\norder of magnitude and provide energy coverage from 20 GeV to more than 300\nTeV.\n",
"title": "Exploring deep learning as an event classification method for the Cherenkov Telescope Array"
} | null | null | null | null | true | null | 572 | null | Default | null | null |
null | {
"abstract": " Transition metal dichalcogenides (TMDs) are emerging as promising\ntwo-dimensional (2d) semiconductors for optoelectronic and flexible devices.\nHowever, a microscopic explanation of their photophysics -- of pivotal\nimportance for the understanding and optimization of device operation -- is\nstill lacking. Here we use femtosecond transient absorption spectroscopy, with\npump pulse tunability and broadband probing, to monitor the relaxation dynamics\nof single-layer MoS2 over the entire visible range, upon photoexcitation of\ndifferent excitonic transitions. We find that, irrespective of excitation\nphoton energy, the transient absorption spectrum shows the simultaneous\nbleaching of all excitonic transitions and corresponding red-shifted\nphotoinduced absorption bands. First-principle modeling of the ultrafast\noptical response reveals that a transient bandgap renormalization, caused by\nthe presence of photo-excited carriers, is primarily responsible for the\nobserved features. Our results demonstrate the strong impact of many-body\neffects in the transient optical response of TMDs even in the\nlow-excitation-density regime.\n",
"title": "Photo-Induced Bandgap Renormalization Governs the Ultrafast Response of Single-Layer MoS2"
} | null | null | null | null | true | null | 573 | null | Default | null | null |
null | {
"abstract": " In a classical regression model, it is usually assumed that the explanatory\nvariables are independent of each other and error terms are normally\ndistributed. But when these assumptions are not met, situations like the error\nterms are not independent or they are not identically distributed or both of\nthese, LSE will not be robust. Hence, quantile regression has been used to\ncomplement this deficiency of classical regression analysis and to improve the\nleast square estimation (LSE). In this study, we consider preliminary test and\nshrinkage estimation strategies for quantile regression models with\nindependently and non-identically distributed (i.ni.d.) errors. A Monte Carlo\nsimulation study is conducted to assess the relative performance of the\nestimators. Also, we numerically compare their performance with Ridge, Lasso,\nElastic Net penalty estimation strategies. A real data example is presented to\nillustrate the usefulness of the suggested methods. Finally, we obtain the\nasymptotic results of suggested estimators\n",
"title": "Improved Quantile Regression Estimators when the Errors are Independently and Non-identically Distributed"
} | null | null | null | null | true | null | 574 | null | Default | null | null |
null | {
"abstract": " We present a clustering-based language model using word embeddings for text\nreadability prediction. Presumably, an Euclidean semantic space hypothesis\nholds true for word embeddings whose training is done by observing word\nco-occurrences. We argue that clustering with word embeddings in the metric\nspace should yield feature representations in a higher semantic space\nappropriate for text regression. Also, by representing features in terms of\nhistograms, our approach can naturally address documents of varying lengths. An\nempirical evaluation using the Common Core Standards corpus reveals that the\nfeatures formed on our clustering-based language model significantly improve\nthe previously known results for the same corpus in readability prediction. We\nalso evaluate the task of sentence matching based on semantic relatedness using\nthe Wiki-SimpleWiki corpus and find that our features lead to superior matching\nperformance.\n",
"title": "Language Modeling by Clustering with Word Embeddings for Text Readability Assessment"
} | null | null | null | null | true | null | 575 | null | Default | null | null |
null | {
"abstract": " We study special circle bundles over two elementary moduli spaces of\nmeromorphic quadratic differentials with real periods denoted by $\\mathcal\nQ_0^{\\mathbb R}(-7)$ and $\\mathcal Q^{\\mathbb R}_0([-3]^2)$. The space\n$\\mathcal Q_0^{\\mathbb R}(-7)$ is the moduli space of meromorphic quadratic\ndifferentials on the Riemann sphere with one pole of order 7 with real periods;\nit appears naturally in the study of a neighbourhood of the Witten's cycle\n$W_1$ in the combinatorial model based on Jenkins-Strebel quadratic\ndifferentials of $\\mathcal M_{g,n}$. The space $\\mathcal Q^{\\mathbb\nR}_0([-3]^2)$ is the moduli space of meromorphic quadratic differentials on the\nRiemann sphere with two poles of order at most 3 with real periods; it appears\nin description of a neighbourhood of Kontsevich's boundary $W_{-1,-1}$ of the\ncombinatorial model. The application of the formalism of the Bergman\ntau-function to the combinatorial model (with the goal of computing\nanalytically Poincare dual cycles to certain combinations of tautological\nclasses) requires the study of special sections of circle bundles over\n$\\mathcal Q_0^{\\mathbb R}(-7)$ and $\\mathcal Q^{\\mathbb R}_0([-3]^2)$; in the\ncase of the space $\\mathcal Q_0^{\\mathbb R}(-7)$ a section of this circle\nbundle is given by the argument of the modular discriminant. We study the\nspaces $\\mathcal Q_0^{\\mathbb R}(-7)$ and $\\mathcal Q^{\\mathbb R}_0([-3]^2)$,\nalso called the spaces of Boutroux curves, in detail, together with\ncorresponding circle bundles.\n",
"title": "Discriminant circle bundles over local models of Strebel graphs and Boutroux curves"
} | null | null | [
"Physics",
"Mathematics"
]
| null | true | null | 576 | null | Validated | null | null |
null | {
"abstract": " We report a method to control the positions of ellipsoidal magnets in flowing\nchannels of rectangular or circular cross section at low Reynolds number.A\nstatic uniform magnetic field is used to pin the particle orientation, and the\nparticles move with translational drift velocities resulting from hydrodynamic\ninteractions with the channel walls which can be described using Blake's image\ntensor.Building on his insights, we are able to present a far-field theory\npredicting the particle motion in rectangular channels, and validate the\naccuracy of the theory by comparing to numerical solutions using the boundary\nelement method.We find that, by changing the direction of the applied magnetic\nfield, the motion can be controlled so that particles move either to a curved\nfocusing region or to the channel walls.We also use simulations to show that\nthe particles are focused to a single line in a circular channel.Our results\nsuggest ways to focus and segregate magnetic particles in lab-on-a-chip\ndevices.\n",
"title": "Far-field theory for trajectories of magnetic ellipsoids in rectangular and circular channels"
} | null | null | null | null | true | null | 577 | null | Default | null | null |
null | {
"abstract": " Let $f$ be a primitive cusp form of weight $k$ and level $N,$ let $\\chi$ be a\nDirichlet character of conductor coprime with $N,$ and let\n$\\mathfrak{L}(f\\otimes \\chi, s)$ denote either $\\log L(f\\otimes \\chi, s)$ or\n$(L'/L)(f\\otimes \\chi, s).$ In this article we study the distribution of the\nvalues of $\\mathfrak{L}$ when either $\\chi$ or $f$ vary. First, for a\nquasi-character $\\psi\\colon \\mathbb{C} \\to \\mathbb{C}^\\times$ we find the limit\nfor the average $\\mathrm{Avg}\\_\\chi \\psi(L(f\\otimes\\chi, s)),$ when $f$ is\nfixed and $\\chi$ varies through the set of characters with prime conductor that\ntends to infinity. Second, we prove an equidistribution result for the values\nof $\\mathfrak{L}(f\\otimes \\chi,s)$ by establishing analytic properties of the\nabove limit function. Third, we study the limit of the harmonic average\n$\\mathrm{Avg}^h\\_f \\psi(L(f, s)),$ when $f$ runs through the set of primitive\ncusp forms of given weight $k$ and level $N\\to \\infty.$ Most of the results are\nobtained conditionally on the Generalized Riemann Hypothesis for\n$L(f\\otimes\\chi, s).$\n",
"title": "On M-functions associated with modular forms"
} | null | null | null | null | true | null | 578 | null | Default | null | null |
null | {
"abstract": " Hierarchical graph clustering is a common technique to reveal the multi-scale\nstructure of complex networks. We propose a novel metric for assessing the\nquality of a hierarchical clustering. This metric reflects the ability to\nreconstruct the graph from the dendrogram, which encodes the hierarchy. The\noptimal representation of the graph defines a class of reducible linkages\nleading to regular dendrograms by greedy agglomerative clustering.\n",
"title": "Learning Graph Representations by Dendrograms"
} | null | null | null | null | true | null | 579 | null | Default | null | null |
null | {
"abstract": " A two-dimensional bidisperse granular fluid is shown to exhibit pronounced\nlong-ranged dynamical heterogeneities as dynamical arrest is approached. Here\nwe focus on the most direct approach to study these heterogeneities: we\nidentify clusters of slow particles and determine their size, $N_c$, and their\nradius of gyration, $R_G$. We show that $N_c\\propto R_G^{d_f}$, providing\ndirect evidence that the most immobile particles arrange in fractal objects\nwith a fractal dimension, $d_f$, that is observed to increase with packing\nfraction $\\phi$. The cluster size distribution obeys scaling, approaching an\nalgebraic decay in the limit of structural arrest, i.e., $\\phi\\to\\phi_c$.\nAlternatively, dynamical heterogeneities are analyzed via the four-point\nstructure factor $S_4(q,t)$ and the dynamical susceptibility $\\chi_4(t)$.\n$S_4(q,t)$ is shown to obey scaling in the full range of packing fractions,\n$0.6\\leq\\phi\\leq 0.805$, and to become increasingly long-ranged as\n$\\phi\\to\\phi_c$. Finite size scaling of $\\chi_4(t)$ provides a consistency\ncheck for the previously analyzed divergences of $\\chi_4(t)\\propto\n(\\phi-\\phi_c)^{-\\gamma_{\\chi}}$ and the correlation length $\\xi\\propto\n(\\phi-\\phi_c)^{-\\gamma_{\\xi}}$. We check the robustness of our results with\nrespect to our definition of mobility. The divergences and the scaling for\n$\\phi\\to\\phi_c$ suggest a non-equilibrium glass transition which seems\nqualitatively independent of the coefficient of restitution.\n",
"title": "Slow and Long-ranged Dynamical Heterogeneities in Dissipative Fluids"
} | null | null | null | null | true | null | 580 | null | Default | null | null |
null | {
"abstract": " We study the \\emph{Proximal Alternating Predictor-Corrector} (PAPC) algorithm\nintroduced recently by Drori, Sabach and Teboulle to solve nonsmooth structured\nconvex-concave saddle point problems consisting of the sum of a smooth convex\nfunction, a finite collection of nonsmooth convex functions and bilinear terms.\nWe introduce the notion of pointwise quadratic supportability, which is a\nrelaxation of a standard strong convexity assumption and allows us to show that\nthe primal sequence is R-linearly convergent to an optimal solution and the\nprimal-dual sequence is globally Q-linearly convergent. We illustrate the\nproposed method on total variation denoising problems and on locally adaptive\nestimation in signal/image deconvolution and denoising with multiresolution\nstatistical constraints.\n",
"title": "A Globally Linearly Convergent Method for Pointwise Quadratically Supportable Convex-Concave Saddle Point Problems"
} | null | null | null | null | true | null | 581 | null | Default | null | null |
null | {
"abstract": " Chemical or enzymatic cross-linking of casein micelles (CMs) increases their\nstability against dissociating agents. In this paper, a comparative study of\nstability between native CMs and CMs cross-linked with genipin (CMs-GP) as a\nfunction of pH is described. Stability to temperature and ethanol were\ninvestigated in the pH range 2.0-7.0. The size and the charge\n($\\zeta$-potential) of the particles were determined by dynamic light\nscattering. Native CMs precipitated below pH 5.5, CMs-GP precipitated from pH\n3.5 to 4.5, whereas no precipitation was observed at pH 2.0-3.0 or pH 4.5-7.0.\nThe isoelectric point of CMs-GP was determined to be pH 3.7. Highest stability\nagainst heat and ethanol was observed for CMs-GP at pH 2, where visible\ncoagulation was determined only after 800 s at 140 $^\\circ$C or 87.5% (v/v) of\nethanol. These results confirmed the hypothesis that cross-linking by GP\nincreased the stability of CMs.\n",
"title": "Stability of casein micelles cross-linked with genipin: a physicochemical study as a function of pH"
} | null | null | null | null | true | null | 582 | null | Default | null | null |
null | {
"abstract": " We investigate a construction of an integral residuated lattice starting from\nan integral residuated lattice and two sets with an injective mapping from one\nset into the second one. The resulting algebra has a shape of a Chinese cascade\nkite, therefore, we call this algebra simply a kite. We describe subdirectly\nirreducible kites and we classify them. We show that the variety of integral\nresiduated lattices generated by kites is generated by all finite-dimensional\nkites. In particular, we describe some homomorphisms among kites.\n",
"title": "Kites and Residuated Lattices"
} | null | null | null | null | true | null | 583 | null | Default | null | null |
null | {
"abstract": " Nowadays, online video platforms mostly recommend related videos by analyzing\nuser-driven data such as viewing patterns, rather than the content of the\nvideos. However, content is more important than any other element when videos\naim to deliver knowledge. Therefore, we have developed a web application which\nrecommends related TED lecture videos to the users, considering the content of\nthe videos from the transcripts. TED Talk Recommender constructs a network for\nrecommending videos that are similar content-wise and providing a user\ninterface.\n",
"title": "TED Talk Recommender Using Speech Transcripts"
} | null | null | [
"Computer Science"
]
| null | true | null | 584 | null | Validated | null | null |
null | {
"abstract": " Exploration of asteroids and small-bodies can provide valuable insight into\nthe origins of the solar system, into the origins of Earth and the origins of\nthe building blocks of life. However, the low-gravity and unknown surface\nconditions of asteroids presents a daunting challenge for surface exploration,\nmanipulation and for resource processing. This has resulted in the loss of\nseveral landers or shortened missions. Fundamental studies are required to\nobtain better readings of the material surface properties and physical models\nof these small bodies. The Asteroid Origins Satellite 1 (AOSAT 1) is a CubeSat\ncentrifuge laboratory that spins at up to 4 rpm to simulate the milligravity\nconditions of sub 1 km asteroids. Such a laboratory will help to de-risk\ndevelopment and testing of landing and resource processing technology for\nasteroids. Inside the laboratory are crushed meteorites, the remains of\nasteroids. The laboratory is equipped with cameras and actuators to perform a\nseries of science experiments to better understand material properties and\nasteroid surface physics. These results will help to improve our physics models\nof asteroids. The CubeSat has been designed to be low-cost and contains 3-axis\nmagnetorquers and a single reaction-wheel to induce spin. In our work, we first\nanalyze how the attitude control system will de-tumble the spacecraft after\ndeployment. Further analysis has been conducted to analyze the impact and\nstability of the attitude control system to shifting mass (crushed meteorites)\ninside the spacecraft as its spinning in its centrifuge mode. AOSAT 1 will be\nthe first in a series of low-cost CubeSat centrifuges that will be launched\nsetting the stage for a larger, permanent, on-orbit centrifuge laboratory for\nexperiments in planetary science, life sciences and manufacturing.\n",
"title": "Attitude Control of the Asteroid Origins Satellite 1 (AOSAT 1)"
} | null | null | null | null | true | null | 585 | null | Default | null | null |
null | {
"abstract": " In automatic speech processing systems, speaker diarization is a crucial\nfront-end component to separate segments from different speakers. Inspired by\nthe recent success of deep neural networks (DNNs) in semantic inferencing,\ntriplet loss-based architectures have been successfully used for this problem.\nHowever, existing work utilizes conventional i-vectors as the input\nrepresentation and builds simple fully connected networks for metric learning,\nthus not fully leveraging the modeling power of DNN architectures. This paper\ninvestigates the importance of learning effective representations from the\nsequences directly in metric learning pipelines for speaker diarization. More\nspecifically, we propose to employ attention models to learn embeddings and the\nmetric jointly in an end-to-end fashion. Experiments are conducted on the\nCALLHOME conversational speech corpus. The diarization results demonstrate\nthat, besides providing a unified model, the proposed approach achieves\nimproved performance when compared against existing approaches.\n",
"title": "Triplet Network with Attention for Speaker Diarization"
} | null | null | [
"Statistics"
]
| null | true | null | 586 | null | Validated | null | null |
null | {
"abstract": " Predicting when rupture occurs or cracks progress is a major challenge in\nnumerous elds of industrial, societal and geophysical importance. It remains\nlargely unsolved: Stress enhancement at cracks and defects, indeed, makes the\nmacroscale dynamics extremely sensitive to the microscale material disorder.\nThis results in giant statistical uctuations and non-trivial behaviors upon\nupscaling dicult to assess via the continuum approaches of engineering. These\nissues are examined here. We will see: How linear elastic fracture mechanics\nsidetracks the diculty by reducing the problem to that of the propagation of a\nsingle crack in an eective material free of defects, How slow cracks sometimes\ndisplay jerky dynamics, with sudden violent events incompatible with the\nprevious approach, and how some paradigms of statistical physics can explain\nit, How abnormally fast cracks sometimes emerge due to the formation of\nmicrocracks at very small scales.\n",
"title": "Dynamics of cracks in disordered materials"
} | null | null | null | null | true | null | 587 | null | Default | null | null |
null | {
"abstract": " This paper investigates the multiplicative spread spectrum watermarking\nmethod for the image. The information bit is spreaded into middle-frequency\nDiscrete Cosine Transform (DCT) coefficients of each block of an image using a\ngenerated pseudo-random sequence. Unlike the conventional signal modeling, we\nsuppose that both signal and noise are distributed with Laplacian distribution\nbecause the sample loss of digital media can be better modeled with this\ndistribution than the Gaussian one. We derive the optimum decoder for the\nproposed embedding method thanks to the maximum likelihood decoding scheme. We\nalso analyze our watermarking system in the presence of noise and provide\nanalytical evaluations and several simulations. The results show that it has\nthe suitable performance and transparency required for watermarking\napplications.\n",
"title": "Optimum Decoder for Multiplicative Spread Spectrum Image Watermarking with Laplacian Modeling"
} | null | null | null | null | true | null | 588 | null | Default | null | null |
null | {
"abstract": " We present a representation learning algorithm that learns a low-dimensional\nlatent dynamical system from high-dimensional \\textit{sequential} raw data,\ne.g., video. The framework builds upon recent advances in amortized inference\nmethods that use both an inference network and a refinement procedure to output\nsamples from a variational distribution given an observation sequence, and\ntakes advantage of the duality between control and inference to approximately\nsolve the intractable inference problem using the path integral control\napproach. The learned dynamical model can be used to predict and plan the\nfuture states; we also present the efficient planning method that exploits the\nlearned low-dimensional latent dynamics. Numerical experiments show that the\nproposed path-integral control based variational inference method leads to\ntighter lower bounds in statistical model learning of sequential data. The\nsupplementary video: this https URL\n",
"title": "Adaptive Path-Integral Autoencoder: Representation Learning and Planning for Dynamical Systems"
} | null | null | null | null | true | null | 589 | null | Default | null | null |
null | {
"abstract": " Consider a social network where only a few nodes (agents) have meaningful\ninteractions in the sense that the conditional dependency graph over node\nattribute variables (behaviors) is sparse. A company that can only observe the\ninteractions between its own customers will generally not be able to accurately\nestimate its customers' dependency subgraph: it is blinded to any external\ninteractions of its customers and this blindness creates false edges in its\nsubgraph. In this paper we address the semiblind scenario where the company has\naccess to a noisy summary of the complementary subgraph connecting external\nagents, e.g., provided by a consolidator. The proposed framework applies to\nother applications as well, including field estimation from a network of awake\nand sleeping sensors and privacy-constrained information sharing over social\nsubnetworks. We propose a penalized likelihood approach in the context of a\ngraph signal obeying a Gaussian graphical models (GGM). We use a convex-concave\niterative optimization algorithm to maximize the penalized likelihood.\n",
"title": "Semiblind subgraph reconstruction in Gaussian graphical models"
} | null | null | null | null | true | null | 590 | null | Default | null | null |
null | {
"abstract": " In this paper, we present a novel structure, Semi-AutoEncoder, based on\nAutoEncoder. We generalize it into a hybrid collaborative filtering model for\nrating prediction as well as personalized top-n recommendations. Experimental\nresults on two real-world datasets demonstrate its state-of-the-art\nperformances.\n",
"title": "Hybrid Collaborative Recommendation via Semi-AutoEncoder"
} | null | null | null | null | true | null | 591 | null | Default | null | null |
null | {
"abstract": " We show how a characteristic length scale imprinted in the galaxy two-point\ncorrelation function, dubbed the \"linear point\", can serve as a comoving\ncosmological standard ruler. In contrast to the Baryon Acoustic Oscillation\npeak location, this scale is constant in redshift and is unaffected by\nnon-linear effects to within $0.5$ percent precision. We measure the location\nof the linear point in the galaxy correlation function of the LOWZ and CMASS\nsamples from the Twelfth Data Release (DR12) of the Baryon Oscillation\nSpectroscopic Survey (BOSS) collaboration. We combine our linear-point\nmeasurement with cosmic-microwave-background constraints from the Planck\nsatellite to estimate the isotropic-volume distance $D_{V}(z)$, without relying\non a model-template or reconstruction method. We find $D_V(0.32)=1264\\pm 28$\nMpc and $D_V(0.57)=2056\\pm 22$ Mpc respectively, consistent with the quoted\nvalues from the BOSS collaboration. This remarkable result suggests that all\nthe distance information contained in the baryon acoustic oscillations can be\nconveniently compressed into the single length associated with the linear\npoint.\n",
"title": "The Linear Point: A cleaner cosmological standard ruler"
} | null | null | null | null | true | null | 592 | null | Default | null | null |
null | {
"abstract": " Starting from isentropic compressible Navier-Stokes equations with growth\nterm in the continuity equation, we rigorously justify that performing an\nincompressible limit one arrives to the two-phase free boundary fluid system.\n",
"title": "Incompressible limit of the Navier-Stokes model with a growth term"
} | null | null | null | null | true | null | 593 | null | Default | null | null |
null | {
"abstract": " We study a stochastic primal-dual method for constrained optimization over\nRiemannian manifolds with bounded sectional curvature. We prove non-asymptotic\nconvergence to the optimal objective value. More precisely, for the class of\nhyperbolic manifolds, we establish a convergence rate that is related to the\nsectional curvature lower bound. To prove a convergence rate in terms of\nsectional curvature for the elliptic manifolds, we leverage Toponogov's\ncomparison theorem. In addition, we provide convergence analysis for the\nasymptotically elliptic manifolds, where the sectional curvature at each given\npoint on manifold is locally bounded from below by the distance function. We\ndemonstrate the performance of the primal-dual algorithm on the sphere for the\nnon-negative principle component analysis (PCA). In particular, under the\nnon-negativity constraint on the principle component and for the symmetric\nspiked covariance model, we empirically show that the primal-dual approach\noutperforms the spectral method. We also examine the performance of the\nprimal-dual method for the anchored synchronization from partial noisy\nmeasurements of relative rotations on the Lie group SO(3). Lastly, we show that\nthe primal-dual algorithm can be applied to the weighted MAX-CUT problem under\nconstraints on the admissible cut. Specifically, we propose different\napproximation algorithms for the weighted MAX-CUT problem based on optimizing a\nfunction on the manifold of direct products of the unit spheres as well as the\nmanifold of direct products of the rotation groups.\n",
"title": "Stochastic Primal-Dual Method on Riemannian Manifolds with Bounded Sectional Curvature"
} | null | null | null | null | true | null | 594 | null | Default | null | null |
null | {
"abstract": " We investigate a new sampling scheme aimed at improving the performance of\nparticle filters whenever (a) there is a significant mismatch between the\nassumed model dynamics and the actual system, or (b) the posterior probability\ntends to concentrate in relatively small regions of the state space. The\nproposed scheme pushes some particles towards specific regions where the\nlikelihood is expected to be high, an operation known as nudging in the\ngeophysics literature. We re-interpret nudging in a form applicable to any\nparticle filtering scheme, as it does not involve any changes in the rest of\nthe algorithm. Since the particles are modified, but the importance weights do\nnot account for this modification, the use of nudging leads to additional bias\nin the resulting estimators. However, we prove analytically that nudged\nparticle filters can still attain asymptotic convergence with the same error\nrates as conventional particle methods. Simple analysis also yields an\nalternative interpretation of the nudging operation that explains its\nrobustness to model errors. Finally, we show numerical results that illustrate\nthe improvements that can be attained using the proposed scheme. In particular,\nwe present nonlinear tracking examples with synthetic data and a model\ninference example using real-world financial data.\n",
"title": "Nudging the particle filter"
} | null | null | null | null | true | null | 595 | null | Default | null | null |
null | {
"abstract": " We report the measurements of de Haas-van Alphen (dHvA) oscillations in the\nnoncentrosymmetric superconductor BiPd. Several pieces of a complex multi-sheet\nFermi surface are identified, including a small pocket (frequency 40 T) which\nis three dimensional and anisotropic. From the temperature dependence of the\namplitude of the oscillations, the cyclotron effective mass is ($0.18$ $\\pm$\n0.1) $m_e$. Further analysis showed a non-trivial $\\pi$-Berry phase is\nassociated with the 40 T pocket, which strongly supports the presence of\ntopological states in bulk BiPd and may result in topological superconductivity\ndue to the proximity coupling to other bands.\n",
"title": "Quantum oscillations and a non-trivial Berry phase in the noncentrosymmetric superconductor BiPd"
} | null | null | null | null | true | null | 596 | null | Default | null | null |
null | {
"abstract": " Statistical inference can be computationally prohibitive in\nultrahigh-dimensional linear models. Correlation-based variable screening, in\nwhich one leverages marginal correlations for removal of irrelevant variables\nfrom the model prior to statistical inference, can be used to overcome this\nchallenge. Prior works on correlation-based variable screening either impose\nstrong statistical priors on the linear model or assume specific post-screening\ninference methods. This paper first extends the analysis of correlation-based\nvariable screening to arbitrary linear models and post-screening inference\ntechniques. In particular, ($i$) it shows that a condition---termed the\nscreening condition---is sufficient for successful correlation-based screening\nof linear models, and ($ii$) it provides insights into the dependence of\nmarginal correlation-based screening on different problem parameters. Numerical\nexperiments confirm that these insights are not mere artifacts of analysis;\nrather, they are reflective of the challenges associated with marginal\ncorrelation-based variable screening. Second, the paper explicitly derives the\nscreening condition for two families of linear models, namely, sub-Gaussian\nlinear models and arbitrary (random or deterministic) linear models. In the\nprocess, it establishes that---under appropriate conditions---it is possible to\nreduce the dimension of an ultrahigh-dimensional, arbitrary linear model to\nalmost the sample size even when the number of active variables scales almost\nlinearly with the sample size.\n",
"title": "ExSIS: Extended Sure Independence Screening for Ultrahigh-dimensional Linear Models"
} | null | null | null | null | true | null | 597 | null | Default | null | null |
null | {
"abstract": " Mitochondrial oxidative phosphorylation (mOxPhos) makes ATP, the energy\ncurrency of life. Chemiosmosis, a proton centric mechanism, advocates that\nComplex V harnesses a transmembrane potential (TMP) for ATP synthesis. This\nperception of cellular respiration requires oxygen to stay tethered at Complex\nIV (an association inhibited by cyanide) and diffusible reactive oxygen species\n(DROS) are considered wasteful and toxic products. With new mechanistic\ninsights on heme and flavin enzymes, an oxygen or DROS centric explanation\n(called murburn concept) was recently proposed for mOxPhos. In the new\nmechanism, TMP is not directly harnessed, protons are a rate limiting reactant\nand DROS within matrix serve as the chemical coupling agents that directly link\nNADH oxidation with ATP synthesis. Herein, we report multiple ADP binding sites\nand solvent accessible DROS channels in respiratory proteins, which validate\nthe oxygen or DROS centric power generation (ATP synthesis) system in mOxPhos.\nSince cyanide's heme binding Kd is high (mM), low doses (uM) of cyanide is\nlethal because cyanide disrupts DROS dynamics in mOxPhos. The critical study\nalso provides comprehensive arguments against Mitchell's and Boyer's\nexplanations and extensive support for murburn concept based holistic\nperspectives for mOxPhos.\n",
"title": "Unveiling ADP-binding sites and channels in respiratory complexes: Validation of Murburn concept as a holistic explanation for oxidative phosphorylation"
} | null | null | null | null | true | null | 598 | null | Default | null | null |
null | {
"abstract": " Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling\nStormer for special JB-algebras, we prove that a synaptic algebra is norm\ncomplete (i.e., Banach) if and only if it is isomorphic to the self-adjoint\npart of a Rickart C*-algebra. Also, we give conditions on a Banach synaptic\nalgebra that are equivalent to the condition that it is isomorphic to the\nself-adjoint part of an AW*-algebra. Moreover, we study some relationships\nbetween synaptic algebras and so-called generalized Hermitian algebras.\n",
"title": "Banach synaptic algebras"
} | null | null | null | null | true | null | 599 | null | Default | null | null |
null | {
"abstract": " High-pressure neutron powder diffraction, muon-spin rotation and\nmagnetization studies of the structural, magnetic and the superconducting\nproperties of the Ce-underdoped superconducting (SC) electron-doped cuprate\nsystem T'-Pr_1.3-xLa_0.7Ce_xCuO_4 with x = 0.1 are reported. A strong reduction\nof the lattice constants a and c is observed under pressure. However, no\nindication of any pressure induced phase transition from T' to T structure is\nobserved up to the maximum applied pressure of p = 11 GPa. Large and non-linear\nincrease of the short-range magnetic order temperature T_so in\nT'-Pr_1.3-xLa_0.7Ce_xCuO_4 (x = 0.1) was observed under pressure.\nSimultaneously pressure causes a non-linear decrease of the SC transition\ntemperature T_c. All these experiments establish the short-range magnetic order\nas an intrinsic and a new competing phase in SC T'-Pr_1.2La_0.7Ce_0.1CuO_4. The\nobserved pressure effects may be interpreted in terms of the improved nesting\nconditions through the reduction of the in-plane and out-of-plane lattice\nconstants upon hydrostatic pressure.\n",
"title": "Pressure tuning of structure, superconductivity and novel magnetic order in the Ce-underdoped electron-doped cuprate T'-Pr_1.3-xLa_0.7Ce_xCuO_4 (x = 0.1)"
} | null | null | null | null | true | null | 600 | null | Default | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.