Split (3)

train · 234k rows

citing_id stringlengths 9 16	cited_id stringlengths 9 16	section_title stringlengths 0 2.25k	citation stringlengths 52 442	text_before_citation list	text_after_citation list	keywords list	citation_intent stringclasses 3 values	citing_paper_content dict	cited_paper_content dict
1704.03295	1502.02445	I. INTRODUCTION	Unlike previous work that employs CNNs for a brain image segmentation task #REFR , the proposed method allows omitting the explicit definition of spatial features.	[ "Recent MICCAI challenges in neonatal #OTHEREFR and adult #OTHEREFR MR brain image segmentation show that various segmentation methods achieve accurate results, but also that different methods are better at different aspects of brain image segmentation.", "The best results per tissue type in both the NeoBrainS12 ...	[ "Furthermore, unlike previous work used for brain image segmentation #OTHEREFR , the method uses multiple patch and kernel sizes combined.", "This approach allows the method to learn multi-scale features that estimate both intensity and spatial characteristics.", "In contrast to using these multiple patch and k...	[ "brain image segmentation" ]	method	{ "title": "Automatic segmentation of MR brain images with a convolutional neural network", "abstract": "Abstract-Automatic segmentation in MR brain images is important for quantitative analysis in large-scale studies with images acquired at all ages. This paper presents a method for the automatic segmentation of M...	{ "title": "Deep neural networks for anatomical brain segmentation", "abstract": "We present a novel approach to automatically segment magnetic resonance (MR)" }
1903.12152	1502.02445		As a pioneer, de Brébisson #REFR proposed a unified CNN network to learn 2D and 3D patches as well as their spatial coordinates for whole brain segmentation.	[ "Recently, CNN methods have been widely developed to applied to whole brain segmentation.", "The straightforward strategy of performing whole brain segmentation is to fit all brain volume to a 3D CNN based segmentation network, like U-Net [42] or V-Net #OTHEREFR .", "Unfortunately, it is impractical to fit the ...	[ "Then, such network has been extended to BrainSegNet #OTHEREFR , which employed 2.5D patches for training a CNN network.", "Recently, DeepNAT #OTHEREFR was proposed to perform hierarchical multi-task learning on 3D patches.", "These methods modeled the whole brain segmentation as a per-voxel segmentation proble...	[ "whole brain segmentation" ]	background	{ "title": "3D Whole Brain Segmentation using Spatially Localized Atlas Network Tiles", "abstract": "Abstract-Detailed whole brain segmentation is an essential quantitative technique in medical image analysis, which provides a non-invasive way of measuring brain regions from a clinical acquired structural magnetic ...	{ "title": "Deep neural networks for anatomical brain segmentation", "abstract": "We present a novel approach to automatically segment magnetic resonance (MR)" }
1804.04563	1502.02445	RESULTS	In comparison, #REFR which is the only to our knowledge to have used a by-patch segmentation approach for the original 135 classes problem, proposed a model composed of 30M parameters and reached an average dice of 0.725.	[ "Figure 2 shows an example of segmentation maps we produced with the tested models.", "A real performance gap can be noticed between BaseNet(e) and BaseNet+DistBranch (d), where the first detects background between the left and right lateral ventricles and the second is able to recover smooth structures.", "In ...	[ "Our model has 10 order of magnitude less parameters, with a better average dice.", "With this model, we would have been ranked 5th of the multi-atlas segmentation challenge at MICCAI 2012, with a segmentation time per image of approximately 9 minutes.", "We briefly compare to a UNet #OTHEREFR like encoder-deco...	[ "patch", "model" ]	method	{ "title": "Towards integrating spatial localization in convolutional neural networks for brain image segmentation", "abstract": "Semantic segmentation is an established while rapidly evolving field in medical imaging. In this paper we focus on the segmentation of brain Magnetic Resonance Images (MRI) into cerebral...	{ "title": "Deep neural networks for anatomical brain segmentation", "abstract": "We present a novel approach to automatically segment magnetic resonance (MR)" }
1601.05875	1010.3613	I. INTRODUCTION	There is no corresponding upper bound to #REFR for continuous random variables, however, and it is unclear under what conditions G is finite.	[ "Wyner's common information between scalar jointly Gaussian random variables is computed in #OTHEREFR , and the result is extended to Gaussian vectors in #OTHEREFR , and to outputs of additive Gaussian channels in #OTHEREFR .", "We can also generalize the bounds in (2) to n random variables to obtain", "where I...	[ "In this paper we devise a computationally efficient scheme for constructing a common randomness variable W for distributed simulation of n continuous random variables and establish upper bounds on its entropy, which in turn provide upper bounds on G.", "In particular we establish the following upper bound on G w...	[ "continuous random variables" ]	background	{ "title": "Distributed Simulation of Continuous Random Variables", "abstract": "We establish the first known upper bound on the exact and Wyner's common information of n continuous random variables in terms of the dual total correlation between them (which is a generalization of mutual information). In particular,...	{ "title": "The common information of N dependent random variables", "abstract": "Abstract-This paper generalizes Wyner's definition of common information of a pair of random variables to that of N random variables. We prove coding theorems that show the same operational meanings for the common information of two r...
1106.2050	1010.3613	IV. COMPARISON AND EXAMPLES In [1] Wyner defines the common information of two correlated random variables	Recently, this notion of common information was generalized to K correlated random variables in #REFR . The common information, B(X 1 , . . .	[ "One interpretation of this common information can be obtained from the Gray-Wyner source network.", "The common information B(X 1 , X 2 ) of two random variables is given as the smallest value of R 0 such that (R 1 , R 2 , R 0 ) ∈ R G−W and R 0 + R 1 + R 2 ≤ H(X 1 , X 2 )." ]	[ ", X K ), of K correlated random variables, as defined in #OTHEREFR , is given by smallest value of R 0 such that", "where the infimum is over all distributions p(w, x 1 , . . . , x K", "It was shown in #OTHEREFR that B(X 1 , . . . , X K ) is monotonically increasing in K.", "We believe that any intuitively s...	[ "common information" ]	background	{ "title": "Multi-user privacy: The Gray-Wyner system and generalized common information", "abstract": "Abstract-The problem of preserving privacy when a multivariate source is required to be revealed partially to multiple users is modeled as a Gray-Wyner source coding problem with K correlated sources at the encod...	{ "title": "The common information of N dependent random variables", "abstract": "Abstract-This paper generalizes Wyner's definition of common information of a pair of random variables to that of N random variables. We prove coding theorems that show the same operational meanings for the common information of two r...
1911.02404	1609.03773	Results on mouse dataset	Unlike human dataset, mouse dataset is more challenging due to its stochastic nature which causes difficulties to category its motion #REFR . Table 2 depicts the comparison results with MAE.	[]	[ "Our model outperformes other models on six out of eight frames.", "We also found that zero-velocity only surpasses others at the 80ms frame and falls behind with a notable margin on the remaining frames.", "This is because the movement of mouse is faster and more random than the human. As suggested in Fig 6," ...	[ "motion", "human dataset" ]	result	{ "title": "Predicting Long-Term Skeletal Motions by a Spatio-Temporal Hierarchical Recurrent Network", "abstract": "The primary goal of skeletal motion prediction is to generate future motion by observing a sequence of 3D skeletons. A key challenge in motion prediction is the fact that a motion can often be perfor...	{ "title": "Lie-X: Depth Image Based Articulated Object Pose Estimation, Tracking, and Action Recognition on Lie Groups", "abstract": "Pose estimation, tracking, and action recognition of articulated objects from depth images are important and challenging problems, which are normally considered separately. In this ...
1912.13436	1906.09792	I. INTRODUCTION	This variant of SABM, named SABM-SR, was shown to outperform iBDD and SABM by up to 0.8 dB and 0.3 dB, respectively, with only minor additional complexity #REFR .	[ "Therefore, solutions which trade-off performance for a lower decoding complexity are becoming increasingly attractive #OTHEREFR .", "Along the path traced by Chase in 1972 #OTHEREFR , hybrid hard-decision (HD)/SD decoders have been recently reproposed in optical communications as a low-complexity alternative to ...	[ "In combination with FEC, constellation shaping has been demonstrated to be a viable solution for providing additional signal-to-noise ratio (SNR) gains at a given spectral efficiency (SE).", "In particular, geometrical shaping can be easily coupled with FEC and only requires straightforward modifications of the ...	[ "iBDD" ]	method	{ "title": "30% Reach Increase via Low-complexity Hybrid HD/SD FEC and Nonlinearity-tolerant 4D Modulation", "abstract": "Current optical coherent transponders technology is driving data rates towards 1 Tb/s/λ and beyond. This trend requires both high-performance coded modulation schemes and efficient implementatio...	{ "title": "A novel soft-aided bit-marking decoder for product codes", "abstract": "We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via updated reliabilities at each decoding iteration. Gains up to 0.8 dB vs. standard iterative bounded distance decoding and up to 0.3 dB ...
1901.06796	1707.05970	FSGM-based	The authors in #REFR developed a new surrogate loss function, based on FGSM to find adversarial examples in deep malware detection models.	[ "The work #OTHEREFR represents an executable by binary vector {x 1 , ..., x m }, x i ∈ {0, 1} and m is the number of features, that using 1 and 0 to indicate the feature is present or not.", "The authors investigated four method to generate binaryencoded adversarial examples.", "The first two methods adopt FSGM...	[ "They injected a sequence of bytes (payload) to the binary files to preserve the original functionality of the malware. Finally they reconstructed adverse embedding to valid binary file." ]	[ "adversarial examples", "deep malware detection" ]	method	{ "title": "Generating Textual Adversarial Examples for Deep Learning Models: A Survey", "abstract": "With the development of high computational devices, deep neural networks (DNNs), in recent years, have gained significant popularity in many Artificial Intelligence (AI) applications. However, previous efforts have...	{ "title": "Generic Black-Box End-to-End Attack against RNNs and Other API Calls Based Malware Classifiers", "abstract": "Deep neural networks (DNNs) are used to solve complex classification problems, for which other machine learning classifiers, such as SVM, fall short. Recurrent neural networks (RNNs) have been u...
1804.09081	1708.05552	INTRODUCTION	We evaluate LEMONADE on two different search spaces for image classification: (i) non-modularized architectures and (ii) cells that are used as repeatable building blocks within an architecture #REFR and also allow transfer to other datasets.	[ "In contrast to generic multi-objective algorithms, LEMONADE exploits that evaluating certain objectives (such as an architecture's number of parameters) is cheap while evaluating the predictive performance on validation data is expensive (since it requires training the model first).", "Thus, LEMONADE handles its...	[ "In both cases, LEMONADE returns a population of CNNs covering architectures with 10 000 to 10 000 000 parameters.", "Within only one week on eight GPUs, LEMONADE discovers architectures that are competitive in terms of predictive performance and resource consumption with hand-designed networks, such as MobileNet...	[ "image classification" ]	method	{ "title": "Efficient Multi-objective Neural Architecture Search via Lamarckian Evolution", "abstract": "Neural Architecture Search aims at automatically finding neural architectures that are competitive with architectures designed by human experts. While recent approaches have achieved state-of-the-art predictive ...	{ "title": "Practical Network Blocks Design with Q-Learning", "abstract": "Convolutional neural network provides an end-to-end solution to train many computer vision tasks and has gained great successes. However, the design of network architectures usually relies heavily on expert knowledge and is hand-crafted. In ...
1806.10982	1708.09533	Network architecture	The generator has one additional enhancement in relation to the default architecture: according to the results in #REFR we use one more upscaling step with the next average pooling operator to force the network taking into account the opinions of neighbors pixels too.	[ "In our case not only the discriminator should satisfy the specified above conditions but the encoder and the attribute classifier too.", "As a result, we are limited in choice of the state of the art architectures to carry out the feature extraction with better quality.", "But as it shows in practice the funda...	[]	[ "generator" ]	method	{ "title": "High Diversity Attribute Guided Face Generation with GANs", "abstract": "Abstract. In this work we focused on GAN-based solution for the attribute guided face synthesis. Previous works exploited GANs for generation of photo-realistic face images and did not pay attention to the question of diversity of ...	{ "title": "Learning a Generative Adversarial Network for High Resolution Artwork Synthesis", "abstract": "Artwork is a mode of creative expression and this paper is particularly interested in investigating if machine can learn and synthetically create artwork that are usually nonfigurative and structured abstract....
1901.08787	1502.03532	NLPR_MCT dataset	Each sub-dataset includes 3-5 cameras with non-overlapping scenes and recordes different situations according to the number of people (ranging from 14 to 255) and the level of illumination changes and occlusions #REFR . The videos contain both real scenes and simulated environments.	[ "The NLPR_MCT dataset consists of four sub-datasets. A sub-dataset is depicted in Figure 6 † ." ]	[ "Each video was nearly 20 minutes long (except Dataset 3), with a rate of 25 fps.", "In this dataset, the topological connection information for every pair of entry/exit points for each sub-dataset is provided.", "We split the π i of an observation o i into π dataset did not provide separate training and test d...	[ "3-5 cameras" ]	background	{ "title": "Multiple Hypothesis Tracking Algorithm for Multi-Target Multi-Camera Tracking with Disjoint Views", "abstract": "In this study, a multiple hypothesis tracking (MHT) algorithm for multi-target multi-camera tracking (MCT) with disjoint views is proposed. The authors' method forms track-hypothesis trees, a...	{ "title": "An equalised global graphical model-based approach for multi-camera object tracking", "abstract": "Multi-camera non-overlapping visual object tracking system typically consists of two tasks: single camera object tracking and inter-camera object tracking. Since the state-of-theart approaches are yet not ...
1705.02573	1509.00600	C. Regrasping	The set G ∩ P can, in fact, be grouped into a finite number of subsets, called grasp classes and placement classes #REFR .	[ "Pioneering works on regrasping problems, including #OTHEREFR - #OTHEREFR , characterized the set G ∩ P by means of discretization.", "Their methods are therefore limited to objects with low geometric complexity. However, Tournassoud et al.", "#OTHEREFR also proposed an interesting notion of Grasp-Placement Tab...	[ "Utilizing this fact, Lertkultanon and Pham #OTHEREFR introduced a high-level Grasp-Placement Graph, which showed potential connectivity between different connected components of G ∩ P.", "They proposed a manipulation planner that, with the guidance from the graph, explored the configuration space efficiently and...	[ "grasp classes" ]	background	{ "title": "A Certified-Complete Bimanual Manipulation Planner", "abstract": "Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, ...	{ "title": "A Single-Query Manipulation Planner", "abstract": "Abstract-In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structu...
1705.02573	1509.00600	A. Background	The set of all valid grasps can be parameterized by a set of parameters #REFR , which is finite but not necessarily unique.	[ "One can represent a grasp by, e.g., a pair of relative transformations between each robot gripper and the object.", "Note that from the definition, any pair of relative transformations can be a grasp.", "However, the object can be moved only when being grasped by a valid grasp.", "The set of all valid grasps...	[ "Consider for example an object composed entirely of boxes 3 and a gripper shown in Fig. 2 . Grasp parameters may be defined as follows #OTHEREFR .", "l is an integer indicating the index of the link (box) that the gripper is grasping.", "a is an integer indicating how the gripper is approaching the object.", ...	[ "valid grasps" ]	background	{ "title": "A Certified-Complete Bimanual Manipulation Planner", "abstract": "Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, ...	{ "title": "A Single-Query Manipulation Planner", "abstract": "Abstract-In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structu...
1705.02573	1509.00600	C. Regrasping	The set G ∩ P can, in fact, be grouped into a finite number of subsets, called grasp classes and placement classes #REFR .	[ "The set of configurations satisfying the aforementioned criteria, denoted as G ∩P, and connectivity between its different connected component play significant roles in solving regrasping problems.", "Pioneering works on regrasping problems, including #OTHEREFR , #OTHEREFR , #OTHEREFR , characterized the set G ∩P...	[ "Utilizing these facts, the authors of #OTHEREFR introduced a high-level Grasp-Placement Graph which showed potential connectivity between different connected components of G ∩ P.", "They proposed a manipulation planner which, with the guidance from the graph, explored the configuration space efficiently and syst...	[ "grasp classes" ]	background	{ "title": "A Certified-Complete Bimanual Manipulation Planner Puttichai Lertkultanon", "abstract": "Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid ...	{ "title": "A Single-Query Manipulation Planner", "abstract": "Abstract-In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structu...
1705.02573	1509.00600	Definition 5.	Both G and P can be partitioned into a finite number of grasp classes and placement classes, respectively #REFR .	[ "For convenience, we define a function π p : C → C O which projects a composite configuration c = (q 1 , q 2 , T ) into SE(3) such that π p (c) = T .", "There are two types of subsets of C induced by valid grasps and stable placements. Definition 6.", "Grasp configuration set, G , is the set of feasible composi...	[ "From the grasp parameters we introduced earlier, we define a grasp class as a subset of G whose configurations have the same grasp parameters l (link index) and a (approaching direction).", "For example, if the object is a box, there will be 6 grasp classes in total. Now consider partitioning of P. Let H be the ...	[ "grasp classes" ]	background	{ "title": "A Certified-Complete Bimanual Manipulation Planner Puttichai Lertkultanon", "abstract": "Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid ...	{ "title": "A Single-Query Manipulation Planner", "abstract": "Abstract-In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structu...
1007.2818	1012.4189	Modeling Complex Systems	Some optimization problems, such as the optimization of logistic or traffic signal operations, are algorithmically complex #REFR .	[ "These fields have considerably advanced our understanding of complex systems.", "In this connection, one should be aware that the term \"complexity\" is used in many different ways.", "In the following, we will distinguish three kinds of complexity:", "1. structural, 2. dynamical, and 3. functional complexit...	[ "Linear models are not considered to be complex, no matter how many terms they contain.", "An example for structural complexity is a car or airplane.", "They are constructed in a way that is dynamically more or less deterministic and well controllable, i.e.", "dynamically simple, and they also serve relativel...	[ "traffic signal operations", "logistic" ]	background	{ "title": "Pluralistic Modeling of Complex Systems", "abstract": "The modeling of complex systems such as ecological or socio-economic systems can be very challenging. Although various modeling approaches exist, they are generally not compatible and mutually consistent, and empirical data often do not allow one to...	{ "title": "BioLogistics and the Struggle for Efficiency: Concepts and Perspectives", "abstract": "The growth of world population, limitation of resources, economic problems and environmental issues force engineers to develop increasingly efficient solutions for logistic systems. Pure optimization for efficiency, h...
1803.04566	1611.08024	Detecting frequency and phase information with the Compact-CNN	Since the first layer of our Compact-CNN is a temporal convolution (whose weights need to be learned from the data), our network has the capability to learn frequencyspecific temporal filters, including EEG features as shown in our previous work #REFR .	[ "The Convolution Theorem states that convolutions of signals in the time-domain relate to multiplication in the frequency-domain." ]	[ "We showed in Figure 3 that the Compact-CNN model is capable of extracting narrow-band task-specific slowwave and fast-wave frequency activity.", "We believe that our network is also capturing information correlated to frequency through the use of the average-pooling layer in Layer 1 of our model.", "The sequen...	[ "EEG features" ]	method	{ "title": "Compact Convolutional Neural Networks for Classification of Asynchronous Steady-state Visual Evoked Potentials", "abstract": "Objective. Steady-State Visual Evoked Potentials (SSVEPs) are neural oscillations from the parietal and occipital regions of the brain that are evoked from flickering visual stim...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1805.01667	1611.08024	III. PREPROCESSING, DECODING & STATISTICS	Additionally, we used a 34-layered ResNet architecture 2 and the compact EEGNet architecture was reimplemented as described in #REFR , as the EEGNet code from the original publication was not available.	[ "Each electrode was then assigned to a specific brain region by calculating cytoarchitectonic probabilistic maps in the SPM anatomy toolbox #OTHEREFR .", "Intracranial EEG data were re-referenced bipolarly between the respective neighbors to be specific for local effects and reduce external noise contamination, a...	[ "As optimizer, we used AdamW #OTHEREFR with cosine annealing #OTHEREFR , a weight decay of 0.002 and an initial learning rate of 0.01 32 .", "For each recording, the first 60 % of the data was used for training, and the last 40 % were reserved as final evaluation set, which was only used to test the final accurac...	[ "34-layered ResNet architecture", "EEGNet code" ]	method	{ "title": "Intracranial Error Detection via Deep Learning", "abstract": "Abstract-Deep learning techniques have revolutionized the field of machine learning and were recently successfully applied to various classification problems in noninvasive electroencephalography (EEG). However, these methods were so far only...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1805.04157	1611.08024	II. RELATED WORK	The authors in #REFR introduce EEGNet, a CNN model for wet-EEG data across paradigms.	[ "The data from the stimuli is pre-processed for all approaches with the CNN-1 method providing the best accuracy results across both EEG data genres.", "A five class SSVEP signal problem is classified using both traditional machine learning approaches and deep learning #OTHEREFR .", "The authors analyse the dat...	[ "The paper includes four datasets for four different paradigms (P300 Event-Related Potential, Error-Related Negativity, Movement-Related Cortical Potential, and Sensorimotor Rhythm).", "All the datasets come from different sources with different data sizes.", "These authors pre-process the data before training ...	[ "wet-EEG data" ]	background	{ "title": "On the Classification of SSVEP-Based Dry-EEG Signals via Convolutional Neural Networks", "abstract": "Abstract-Electroencephalography (EEG) is a common signal acquisition approach employed for Brain-Computer Interface (BCI) research. Nevertheless, the majority of EEG acquisition devices rely on the cumb...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1809.00929	1611.08024	Introduction	It extends EEGNet #REFR , a convolutional neural network (CNN) originally designed for classification problems in brain-computer interface (BCI), to regression problems. 2.	[ "This paper focuses on the contact sensor based detection approaches. More specifically, we consider EEG-based driver drowsiness detection.", "The main reason is that EEG signals, which directly measure the brain state, have the potential to predict the drowsiness before it reaches a dangerous level.", "Hence, ...	[ "It uses spectral meta-learner for regression (SMLR) #OTHEREFR , an unsupervised ensemble regression approach, to aggregate multiple EEGNet regression models for improved performance. 3.", "Instead of using raw EEG signals as the input to EEGNet, it uses their power spectral density (PSD) at certain frequencies a...	[ "brain-computer interface", "BCI" ]	method	{ "title": "A ug 2 01 8 EEG-Based Driver Drowsiness Estimation Using Convolutional Neural Networks", "abstract": "Abstract. Deep learning, including convolutional neural networks (CNNs), has started finding applications in brain-computer interfaces (BCIs). However, so far most such approaches focused on BCI classif...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1907.01332	1611.08024	Related Work	To attain a level that is comparable to the model introduced by Lawhern et al. #REFR , Schirrmeister et al.	[ "Finally they introduce shallow ConvNets, which are inspired by the Filter Bank Common Spatial Patterns (FBCSP) #OTHEREFR pipeline, specifically tailored to decode band power features in EEG signals.", "The main difference with the two previous works is the introduction of a technique for data augmentation inspir...	[ "had to train the model on a supplementary dataset, called the high-gamma dataset, which sees a four fold increase in datapoints in comparison to the dataset of Lawhern et al. #OTHEREFR .", "This addition of new data shows that their model requires a large number of training examples, which is not always availabl...	[ "model" ]	method	{ "title": "Applying Transfer Learning To Deep Learned Models For EEG Analysis", "abstract": "The introduction of deep learning and transfer learning techniques in fields such as computer vision allowed a leap forward in the accuracy of image classification tasks. Currently there is only limited use of such techniq...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1807.11752	1611.08024	IV. DISCUSSION	In #REFR a 68% accuracy is reported on sensorimotor rhythms using 3 convolution layers offline.	[ "However, compared to ours, their architecture would have required longer training times, was not tested online and was applied to a memory paradigm.", "Training CNNs depends very much on the initialisation when data is scarce. In contrast to Schirrmeister et al.", "#OTHEREFR , we did observe certain instabilit...	[ "In the mentioned studies no artefact correction is applied to the input, neural sources are rather checked a posteriori.", "Cybathlon rules out this possibility requiring an online implementation for artefact correction which could be a reason for our lower performances.", "Indeed, our average race completion ...	[ "sensorimotor rhythms" ]	method	{ "title": "Compact Convolutional Neural Networks for Multi-Class, Personalised, Closed-Loop EEG-BCI", "abstract": "For many people suffering from motor disabilities, assistive devices controlled with only brain activity are the only way to interact with their environment [1] . Natural tasks often require different...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1912.01171	1611.08024	C. TLM-Based UAP	Specifically, we solve the following optimization problem: #REFR where l(x + v, y) is a loss function, in which y is the (true or predicted) label of example x, C(x, v) the constraint on the perturbation v, and α the regularization coefficient.	[ "Different from the DeepFool-based algorithm, TLM directly optimizes an objective function w.r.t. the UAP by batch gradient descent.", "In white-box attacks, the parameters of the victim model are known and fixed, and hence we can view the UAP as a variable to minimize an objective function on the entire training...	[ "Our proposed approach is highly flexible, as the attacker can choose different optimizers, loss functions, or constraints, according to the specific task.", "Our approach can be applied to both target and non-target attacks by simply updating the loss function l.", "For non-target attacks, the loss function l ...	[ "regularization" ]	method	{ "title": "Universal Adversarial Perturbations for CNN Classifiers in EEG-Based BCIs", "abstract": "Multiple convolutional neural network (CNN) classifiers have been proposed for electroencephalogram (EEG) based brain-computer interfaces (BCIs). However, CNN models have been found vulnerable to universal adversari...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
2003.02657	1611.08024	I. INTRODUCTION	Basically, most of machine learning-based BCI methods follow these processes, however, these methods need specific modification to classify a user's intention/condition for each different paradigm #REFR .	[ "Evoked BCIs exploit unintentional electrical potentials reacting to external or internal stimuli.", "Examples of evoked BCIs include steady-state visually evoked potentials (SSVEP) #OTHEREFR , #OTHEREFR and event-related potentials #OTHEREFR .", "Additionally, spontaneous BCIs use an internal cognitive process...	[ "In other words, machine learningbased methods need to have prior knowledge of different EEG paradigms #OTHEREFR , #OTHEREFR , #OTHEREFR , #OTHEREFR , #OTHEREFR .", "Therefore, conventional machine learning-based BCIs have discovered EEG representations through extremely specialized approaches, e.g., a common spa...	[ "machine learning-based BCI" ]	method	{ "title": "Multi-Scale Neural network for EEG Representation Learning in BCI", "abstract": "Recent advances in deep learning have had a methodological and practical impact on brain-computer interface (BCI) research. Among the various deep network architectures, convolutional neural networks (CNNs) have been well s...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
2003.02657	1611.08024	A. Linear Models	However, these methods need to have certain prior neurophysiology knowledge #REFR , because their feature extraction stages are specifically designed for each EEG paradigm.	[ "Specifically, these authors #OTHEREFR used filter banks in a channel-wise manner to capture the spatio-spectral information.", "Then, by encoding the temporal evolution of extracted spatio-spectral feature vectors, they #OTHEREFR effectively constructed epileptic seizure EEG signal spatio-spectral-temporal featu...	[ "Conversely, our method does not need to be specialized for different paradigms." ]	[ "EEG paradigm" ]	method	{ "title": "Multi-Scale Neural network for EEG Representation Learning in BCI", "abstract": "Recent advances in deep learning have had a methodological and practical impact on brain-computer interface (BCI) research. Among the various deep network architectures, convolutional neural networks (CNNs) have been well s...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1707.08262	1611.08024	Related work	Compact CNNs have been proposed to learn representation of EEG for brain computer interface tasks #REFR .	[ "RNNs have had great success in speech recognition, handwriting recognition, and machine translation #OTHEREFR .", "In health care applications, RNNs have also demonstrated success on predictive modeling problems using electronic health records (Choi et al., 2016a,b; #OTHEREFR .", "Following the recent developm...	[ "These successful applications to EEG data suggest that deep learning methods have potential for analyzing EEG data from PSGs to extract efficient representations for automatic sleep-wake stage annotation." ]	[ "EEG", "brain computer interface" ]	method	{ "title": "SLEEPNET: Automated Sleep Staging System via Deep Learning", "abstract": "Sleep disorders, such as sleep apnea, parasomnias, and hypersomnia, affect 50-70 million adults in the United States (Hillman et al., 2006) . Overnight polysomnography (PSG), including brain monitoring using electroencephalography...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1909.06970	1611.08024	Within-subject classification	In contrast, in #REFR , the authors reported that they did not perform significantly different amongst themselves.	[ "Table 3 presents the mean AUC values of the within-subject five-fold cross-validation results across all methods, which can be seen in Figure 7 .", "The ANOVA analysis showed that the means AUCs of CNN3 and UCNN3 are significantly different from the rest of the methods.", "The means AUCs of CNN-1 are very simi...	[ "More importantly, the means of FCNN and SepConv1D-1F are not significantly different from other methods. Moreover, they are very similar to them." ]	[ "contrast" ]	result	{ "title": "A few filters are enough: Convolutional Neural Network for P300 Detection", "abstract": "In this paper, we aim to provide elements to contribute to the discussion about the usefulness of deep CNNs with several filters to solve both within-subject and cross-subject classification for single-trial P300 de...	{ "title": "EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfaces", "abstract": "Objective: Brain-Computer Interface technologies (BCI) enable the direct communication between humans and computers by analyzing brain measurements, such as electroencephalography (EEG). These technologies hav...
1906.00540	1302.0698	The fractional Laplace operator. Since	Before describing the aforementioned solution technique, we briefly recall the finite element approximation of #REFR for the state equation (2.4).	[ "3.3.", "A fully discrete scheme for the fractional optimal control problem.", "In what follows we briefly recall the fully discrete scheme proposed in #OTHEREFR and review its a priori error analysis.", "To accomplish this task, we will assume in this section that", "This regularity assumption holds if, fo...	[ "Let T Ω = {K} be a conforming and shape regular mesh of Ω into cells K that are isoparametrically equivalent either to the unit cube [0, #OTHEREFR n or the unit simplex in R n #OTHEREFR .", "Let I Y be a partition of [0, Y ] with mesh points", "We construct a mesh T Y over the cylinder C Y as T Y = T Ω ⊗ I Y ,...	[ "finite element approximation" ]	method	{ "title": "An adaptive finite element method for the sparse optimal control of fractional diffusion", "abstract": "Abstract. We propose and analyze an a posteriori error estimator for a PDE-constrained optimization problem involving a nondifferentiable cost functional, fractional diffusion, and controlconstraints....	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1404.0068	1302.0698	Finite element methods.	The graded meshes described by (4.11) yield near optimal error estimates both in regularity and order for the elliptic case investigated in #REFR .	[ "It is known that the numerical approximation of functions with a strong directional-dependent behavior needs anisotropic elements in order to recover quasi-optimal error estimates #OTHEREFR .", "In our setting, anisotropic elements of tensor product structure are essential.", "Given T Y , we call N (T Y ) the ...	[]	[ "graded meshes", "elliptic case" ]	background	{ "title": "A PDE approach to space-time fractional parabolic problems", "abstract": "Abstract. We study solution techniques for parabolic equations with fractional diffusion and Caputo fractional time derivative, the latter being discretized and analyzed in a general Hilbert space setting. The spatial fractional d...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1508.04382	1302.0698	2.2.	We now review the main results of #REFR about the a priori error analysis of discretizations of problem (1.1).	[ "A priori error analysis." ]	[ "This will also serve to make clear the limitations of this theory, thereby justifying the quest for an a posteriori error analysis. In this section we assume that", "(Ω).", "This holds if, for instance, the domain Ω is convex #OTHEREFR .", "Since C is unbounded, problem (", "then the aforementioned problem...	[ "discretizations" ]	background	{ "title": "A PDE Approach to Numerical Fractional Diffusion", "abstract": "Abstract. Fractional diffusion has become a fundamental tool for the modeling of multiscale and heterogeneous phenomena. However, due to its nonlocal nature, its accurate numerical approximation is delicate. We survey our research program o...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1607.07704	1302.0698	Introduction	Such an approach is a more suitable choice for numerical methods, see #REFR for the linear case.	[ "For the latter result, we apply a well-known technique due to Stampacchia.", "However, when Ω has a Lipschitz continuous boundary and f is locally Lipschitz continuous we illustrate the regularity shift.", "For completeness we also derive the Hölder regularity of solution for smooth Ω.", "Numerical realizati...	[ "The extension idea was introduced by Caffarelli and Silvestre in R N #OTHEREFR and its extensions to bounded domains is given in e.g. #OTHEREFR .", "The extension says that fractional powers (−∆ D ) s of the spatial operator −∆ D can be realized as an operator that maps a Dirichlet boundary condition to a Neuman...	[ "numerical methods" ]	method	{ "title": "A note on semilinear fractional elliptic equation: analysis and discretization", "abstract": "Abstract In this paper we study existence, regularity, and approximation of solution to a fractional semilinear elliptic equation of order s ∈ (0, 1). We identify minimal conditions on the nonlinear term and th...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1403.4278	1302.0698	Introduction	The following simple strategy to find the solution of (1.1) has been proposed and analyzed in #REFR : given a sufficiently smooth function f we solve (1.2), thus obtaining a function U = U (x , y).	[ "where ∂ L C = ∂Ω × [0, ∞) denotes the lateral boundary of C, and", "is the the so-called conormal exterior derivative of U with ν being the unit outer normal to C at Ω × {0}.", "The parameter α is defined as (1.4) α = 1 − 2s ∈ (−1, 1).", "Finally, d s is a positive normalization constant which depends only o...	[ "Setting u : x ∈ Ω → u(x ) = U (x , 0) ∈ R, we obtain the solution of (1.1).", "For an overview of the existing numerical techniques used to solve problems involving fractional diffusion such as the matrix transference technique and the contour integral method, we refer to #OTHEREFR .", "In addition to #OTHEREF...	[ "sufficiently smooth function" ]	method	{ "title": "Multilevel methods for nonuniformly elliptic operators", "abstract": "Abstract. We develop and analyze multilevel methods for nonuniformly elliptic operators whose ellipticity holds in a weighted Sobolev space with an A 2 -Muckenhoupt weight. Using the so-called Xu-Zikatanov (XZ) identity, we derive a n...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1403.4278	1302.0698	A multigrid method for the fractional Laplace operator on anisotropic meshes	This allows us to recover an almostoptimal error estimate for the finite element approximation of problem (1.2) #REFR Theorem 5.4] .	[ "As we explained in § 3.3, the regularity estimate (3.14) implies the necessity of graded meshes in the extended variable y." ]	[ "In fact, finite elements on quasi-uniform meshes have poor approximation properties for small values of the parameter s.", "The isotropic error estimates of [46, Theorem 5.1] are not optimal, which makes anisotropic estimates essential.", "For this reason, in this section we develop a multilevel theory for pro...	[ "finite element approximation" ]	background	{ "title": "Multilevel methods for nonuniformly elliptic operators", "abstract": "Abstract. We develop and analyze multilevel methods for nonuniformly elliptic operators whose ellipticity holds in a weighted Sobolev space with an A 2 -Muckenhoupt weight. Using the so-called Xu-Zikatanov (XZ) identity, we derive a n...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1706.04066	1302.0698	Introduction	Thereby, in Section 4.1, we mainly recover the results of #REFR . The reason for doing this is twofold.	[ "Numerical approaches for the integral definition of the fractional Laplacian, which is not equivalent to the spectral definition considered in the present paper, can be found in #OTHEREFR .", "This paper is organized as follows: In Section 2, we state the definition of the fractional Laplacian, formulate the ext...	[ "First, we are able to slightly improve the mesh grading condition used in #OTHEREFR .", "However, the main reason to analyze the h-FEM on graded meshes before developing the analysis for the hp-method considered in Section 4.2 is, that the techniques we use are almost identical for both cases, but the details ar...	[ "Section" ]	background	{ "title": "$hp$-Finite Elements for Fractional Diffusion", "abstract": "The purpose of this work is to introduce and analyze a numerical scheme to efficiently solve boundary value problems involving the spectral fractional Laplacian. The approach is based on a reformulation of the problem posed on a semi-infinite ...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1402.1916	1302.0698	A weighted Poincaré inequality	For a star-shaped domain, and a specific A 2 -weight, we have proved a weighted Poincaré inequality #REFR Lemma 4.2] .	[ "In order to obtain interpolation error estimates in L p (ω, Ω) and W 1 p (ω, Ω), it is instrumental to have a weighted Poincaré-like inequality #OTHEREFR .", "A pioneering reference is the work by Fabes, Kenig and Serapioni #OTHEREFR , which shows that, when the domain is a ball and the weight belongs to A p 1 <...	[ "In this section we extend this result to a general exponent p and a general weight ω ∈ A p (R n ).", "Our proof is constructive and not based on a compactness argument.", "This allows us to trace the dependence of the stability constant on the domain geometry.", "Lemma 3.1 (weighted Poincaré inequality I).",...	[ "weighted Poincaré inequality" ]	background	{ "title": "Piecewise polynomial interpolation in Muckenhoupt weighted Sobolev spaces and applications", "abstract": "Abstract. We develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal er...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1307.7079	1302.0698	Introduction	At this point we would like to mention the recent results in #REFR in relation with the rate of convergence of nonlinear approximation methods observed by Dahlke and DeVore in the harmonic case.	[ "Regarding Besov regularity of harmonic functions see also #OTHEREFR .", "The paper is organized in three sections.", "In the first one we prove mean value formulas for solutions of L a u = 0 at the points on the hyperplane y = 0 of R n+1 .", "The second section is devoted to apply the result in Section 1 in ...	[ "The main result of this section is contained in the next statement.", "As in #OTHEREFR we shall use X to denote the points (x, y) in R n+1 with x ∈ R n and y ∈ R.", "For x ∈ D with δ(x) we shall denote the distance from x to ∂D.", ") and has compact support in the ball S((0, 0), 1). It is easy to check that ...	[ "harmonic case" ]	result	{ "title": "Mean value formulas for solutions of some degenerate elliptic equations and applications", "abstract": "Abstract. We prove a mean value formula for weak solutions of div(\|y\| a grad u) = 0 in R n+1 = {(x, y) : x ∈ R n , y ∈ R}, −1 < a < 1 and balls centered at points of the form (x, 0). We obtain an expl...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1507.01985	1302.0698	Notation and preliminaries. In this work Ω is a convex bounded and open subset of	For a bounded domain there are several ways, not necessarily equivalent, to define the fractional Laplacian; see #REFR for a discussion.	[ "We also define the piecewise linear interpolantŴ", "The first order backward difference operator d is defined by dW", "k+1 for all t ∈ (t k , t k+1 ) and k = 0, . . . , K−1. Finally, we also notice that, for any sequence", "The relation a b indicates that a ≤ Cb for a constant that does not depend on either ...	[ "As in #OTHEREFR we will adopt that based on spectral theory #OTHEREFR . Namely, since −∆ :", "is an unbounded, positive and closed operator with dense domain", "(Ω) and its inverse is compact, there is a countable collection of eigenpairs {λ l , ϕ l } l∈N ⊂ R + × H 1 0 (Ω) such that {ϕ l } l∈N is an orthonorma...	[ "fractional Laplacian" ]	background	{ "title": "Finite element approximation of the parabolic fractional obstacle problem", "abstract": "Abstract. We study a discretization technique for the parabolic fractional obstacle problem in bounded domains. The fractional Laplacian is realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic equati...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1707.07367	1302.0698		In #REFR the extension problem (1.2) was first used as a way to obtain a numerical technique to approximate the solution to (1.1).	[ "The so-called conormal exterior derivative of U at Ω × {0} is", "We shall refer to y as the extended variable and to the dimension d + 1 in R d+1 + the extended dimension of problem (1.2) .", "Throughout the text, points x ∈ C will be written as x = (x ′ , y) with x ′ ∈ Ω and y > 0.", "The limit in (1.3) mus...	[ "A piecewise linear finite element method (P 1 -FEM) was proposed and analyzed.", "In this work, we extend the results of #OTHEREFR in several directions: a) In Theorem 5.9, we generalize the error analysis of #OTHEREFR , based on the localization of L s given by (1.2), to nonconvex polygonal domains Ω ⊂ R 2 , un...	[ "numerical technique" ]	method	{ "title": "Tensor FEM for spectral fractional diffusion", "abstract": "Abstract. We design and analyze several Finite Element Methods (FEMs) applied to the Caffarelli-Silvestre extension that localizes the fractional powers of symmetric, coercive, linear elliptic operators in bounded domains with Dirichlet boundar...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1707.07367	1302.0698	Remark 3.2 (complexity).	The first one, as in #REFR , is a full tensor product FEM and for it we show the first order rate of convergence in Ω, but at superlinear complexity in terms of the number N Ω of degrees of freedom in Ω.	[ "5. h-FE discretization in Ω. We now begin with the discretization of (2.11).", "The structure of this section is as follows: in Section 5.1, we introduce the FE approximation in Ω and fix notation on Finite Element spaces.", "Section 5.2 introduces the FE discretization in C in abstract form.", "Section 5.3 ...	[ "To reduce the complexity, we propose the second, novel approach: by sparse tensor product P 1 discretization of the extended problem in C, we show the same convergence rate, but with (essentially) linear complexity in terms of N Ω requiring only marginally more regularity of the data f in Ω.", "Section 5.5 addre...	[ "convergence" ]	background	{ "title": "Tensor FEM for spectral fractional diffusion", "abstract": "Abstract. We design and analyze several Finite Element Methods (FEMs) applied to the Caffarelli-Silvestre extension that localizes the fractional powers of symmetric, coercive, linear elliptic operators in bounded domains with Dirichlet boundar...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1707.07367	1302.0698	5.4.3.	The proof of Theorem 5.9 follows similar arguments to #REFR and [33, Section 4.1] and uses the stability and approximation properties (5.14) of Π β ℓ . For completeness we provide the details.	[ "where N Ω = #T ℓ β .", "Before proving Theorem 5.9, we note a corollary that follows from a simple interpolation argument.", "Corollary 5.10 (reduced regularity).", "Assume that the meshes are constructed as in Theorem 5.9 and that f ∈ H −s+σ (Ω), with σ ∈ [0, 1].", "Then we have 32) where the hidden const...	[ "Proof of Theorem 5.9: For the given choice of k, η and Y , we denote by π 1,ℓ η,{Y } the nodal interpolation operator on the mesh (5.15), which we analyzed in Lemma 5.7.", "By Lemmas 5.1 and 5.2, and by the choice (5.29) (recall (5.6)) it suffices to bound", "Recalling that ∇ = (∇ x ′ , ∂ y ) we split the firs...	[ "approximation properties" ]	method	{ "title": "Tensor FEM for spectral fractional diffusion", "abstract": "Abstract. We design and analyze several Finite Element Methods (FEMs) applied to the Caffarelli-Silvestre extension that localizes the fractional powers of symmetric, coercive, linear elliptic operators in bounded domains with Dirichlet boundar...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1707.07367	1302.0698	8.1.	This result is analogous to the bounds obtained in #REFR for convex domains Ω, thus generalizing these results to nonconvex, polygonal domains Ω ⊂ R 2 .	[ "Note that the change in the slope (from 1/2 to 1) near the boundary is a numerical artifact -as the approximation is improved, the kink moves to the left. the Caffarelli-Silvestre extension of (1.1) from Ω to C. Our main contributions are the following.", "• General operators and nonconvex domains.", "We propo...	[ "The error analysis proceeded by a suitable form of quasi-optimality in Lemma 5.1 and the construction of a tensor product FEM interpolant in the truncated cylinder C Y .", "This interpolant was constructed from a nodal, continuous and piecewise linear interpolant π 1,ℓ η with respect to the extended variable y ∈...	[ "convex domains Ω" ]	result	{ "title": "Tensor FEM for spectral fractional diffusion", "abstract": "Abstract. We design and analyze several Finite Element Methods (FEMs) applied to the Caffarelli-Silvestre extension that localizes the fractional powers of symmetric, coercive, linear elliptic operators in bounded domains with Dirichlet boundar...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1307.2474	1302.0698	Introduction	The numerical analysis of the elliptic PDE (−∆) s u = f in a bounded domain with zero boundary data via the extension method has been recently studied by Nochetto and collaborators using finite elements, #REFR .	[ "Previous works dealing with the numerical analysis of nonlocal equations of this type are due to Cifani, Jakobsen, and Karlsen in #OTHEREFR , #OTHEREFR , #OTHEREFR .", "In particular, they formulate some convergent numerical methods for entropy and viscosity solutions.", "One of the main differences of our wor...	[ "The paper is organized as follows.", "In Section 2 we give a brief description of the problem we are concerned with.", "We present an equivalent way of expressing the problem avoiding the nonlocal operator formulation.", "For numerical reasons it is convenient to start by posing the problem in a bounded doma...	[ "elliptic PDE" ]	method	{ "title": "Finite difference method for a general fractional porous medium equation", "abstract": "We formulate a numerical method to solve the porous medium type equation with fractional diffusion ∂u ∂t posed for x ∈ R N , t > 0, with m ≥ 1, σ ∈ (0, 2), and nonnegative initial data u(x, 0). We prove existence and...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1508.02807	1302.0698	A finite element method for the state equation	It is instructive to review the results of #REFR , which assume that Ω is a convex polytopal subset of R n (n ≥ 1) with boundary ∂Ω.	[ "In the next section we will propose a fully discrete scheme to approximate the solution to the optimal control problem (1.2)-(1.4) .", "The analysis relies, first, on the localization results of Section 3, and second, on finite element approximation techniques for solving (4.1) on curved domains; the latter bein...	[ "To do this, we start by recalling the regularity properties of U and v, solutions to (3.2) and (4.1), respectively.", "The second order regularity of U is much worse in the extended direction. In fact #OTHEREFR Theorem 2.7] (see #OTHEREFR Remark 25]", "with β > 2α + 1.", "These regularity estimates have impo...	[ "boundary ∂Ω." ]	background	{ "title": "A piecewise linear FEM for an optimal control problem of fractional operators: error analysis on curved domains", "abstract": "Abstract. We propose and analyze a new discretization technique for a linearquadratic optimal control problem involving the fractional powers of a symmetric and uniformly ellipt...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1808.00584	1302.0698	Numerical results	Here, the values of y + and of M are determined as linear functions of log 10 of the number of elements in T Ω to control the error resulting from the truncation of the y-domain #REFR .	[ "Our test problem will be (2), either with µ = s, or with µ = (s, ν) for a one-dimensional parameter ν.", "In all cases the spatial domain Ω is a rectangular two-dimensional set:", "We use 5, 000 elements on Ω to form a triangulation T Ω , and choose M = M FE := 158 in #OTHEREFR to define the partition I y + of...	[ "In our computations, this results in y + = 2.233." ]	[ "truncation" ]	method	{ "title": "Certified reduced basis methods for fractional Laplace equations via extension", "abstract": "Fractional Laplace equations are becoming important tools for mathematical modeling and prediction. Recent years have shown much progress in developing accurate and robust algorithms to numerically solve such p...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1606.04912	1302.0698	R d	This result was then utilized in #REFR in the numerical approximation of the fractional Laplacian (−∆) s defined in (1.4) , by solving the integer-order equation on Ω×(0, ∞) via graded meshes in the extended variable.	[ "As the sample paths of a Lévy process admit jumps of arbitrary lengths, the boundary data must be imposed on the entire complement Ω c of the domain Ω.", "On the other hand, for the Laplacian equation ((1.3) with s = 1), the underlying stochastic process is a Brownian motion that has continuous sample paths that...	[ "An alternative numerical discretization of the fractional Laplacian defined by (1.4) was presented in #OTHEREFR via a discrete version of the spectral decomposition of (1.4) .", "The constitutive models in peridynamics depend on finite deformation vectors, instead of deformation gradients in classical constituti...	[ "fractional Laplacian" ]	method	{ "title": "Wellposedness and regularity of steady-state two-sided variable-coefficient conservative space-fractional diffusion equations", "abstract": "Abstract. We study the Dirichlet boundary-value problem of steady-state two-sided variablecoefficient conservative space-fractional diffusion equations. We show th...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1409.7721	1302.0698	Introduction	Finally, we mention that finite element approximations for the fractional problem (1.2) were studied in #REFR by using the extension problem.	[ "It is known that there is a Markov process Y t having as generator the fractional power (−∆ D ) s of the Dirichlet Laplacian −∆ D on Ω.", "Indeed, we first kill the Wiener process X t at τ Ω , the first exit time of X t from Ω, and then we subordinate the killed Wiener process with an s-stable subordinator T t ....	[ "We now present the interior regularity estimates.", "Theorem 1.1 (Interior regularity for f in C α ).", "Assume that Ω is a bounded Lipschitz domain and that f ∈ C 0,α (Ω), for some 0 < α < 1. Let u be a solution to (1.2) or (1.6).", "(1) Suppose that 0 < α + 2s < 1 and that A(x) is continuous in Ω. Then u ∈...	[ "fractional problem", "finite element approximations" ]	method	{ "title": "Fractional elliptic equations, Caccioppoli estimates and regularity", "abstract": "Abstract. Let L = − divx(A(x)∇x) be a uniformly elliptic operator in divergence form in a bounded domain Ω. We consider the fractional nonlocal equations on ∂Ω, and Here L s , 0 < s < 1, is the fractional power of L and ∂...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1507.08970	1302.0698		This localization was exploited by Nochetto, Otárola and Salgado in #REFR , where the authors study the numerical approximation of the spectral fractional Laplacian by considering graded meshes in the extended variable. 2.	[ "1.", "One first possibility is to consider fractional powers of the Dirichlet Laplace operator in the sense of spectral theory.", "Indeed, let {ψ k , λ k } k∈N ⊂ H 1 0 (Ω) × R + be the set of normalized eigenfunctions and eigenvalues for the Laplace operator in Ω with homogeneous Dirichlet boundary conditions,...	[ "A second feasible definition is attained by considering the integral formulation (1.2), and restricting it to functions supported in Ω.", "This gives rise to the integral fractional Laplacian (−∆) s I u.", "This operator is different to the spectral fractional Laplacian; for example, their difference is positi...	[ "spectral fractional" ]	background	{ "title": "A fractional Laplace equation: regularity of solutions and Finite Element approximations", "abstract": "Abstract. This paper deals with the integral version of the Dirichlet homogeneous fractional Laplace equation. For this problem weighted and fractional Sobolev a priori estimates are provided in terms...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1709.00730	1302.0698	Sobolev Spaces and Inequalities	First, we recall the results and notation of fractional and weighted Poincaré inequalities presented in #REFR and references therein.	[ "In this section we will introduce the notation of fractional and weighted Sobolev spaces." ]	[ "We also present and prove some useful inverse and trace inequalities in the weighted Sobolev space, thus linking the two kinds of Sobolev spaces." ]	[ "fractional" ]	background	{ "title": "Numerical Homogenization of Heterogeneous Fractional Laplacians", "abstract": "In this paper, we develop a numerical multiscale method to solve the fractional Laplacian with a heterogeneous diffusion coefficient. When the coefficient is heterogeneous, this adds to the computational costs. Moreover, the ...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1603.08989	1302.0698		The use of the aforementioned localization techniques for the numerical treatment of problem (1.3) followed not so long after #REFR .	[ "The parameter α is defined as α = 1 − 2s ∈ (−1, 1) and the conormal exterior derivative of U at Ω × {0} is", "We call y the extended variable and call the dimension n + 1 in R n+1 + the extended dimension of problem (1.5).", "The limit in (1.6) must be understood in the distributional sense; see #OTHEREFR .", ...	[ "In this reference, the authors propose the following technique to solve problem (1.3): given z, solve (1.5), thus obtaining a function U ; setting u(x ) = U (x , 0), the solution to (1.3) is obtained.", "The implementation of this scheme uses standard components of finite element analysis, while its analysis com...	[ "numerical treatment" ]	method	{ "title": "An a posteriori error analysis for an optimal control problem involving the fractional Laplacian", "abstract": "Abstract. In a previous work, we introduced a discretization scheme for a constrained optimal control problem involving the fractional Laplacian. For such a control problem, we derived optimal...	{ "title": "A PDE approach to fractional diffusion in general domains: a priori error analysis", "abstract": "Abstract. The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary condition...
1911.08541	1903.00107	I. INTRODUCTION	To alleviate the pattern artifacts, dark channel prior was incorporated into loss function and the residual nets of the DeblurGAN was replaced with the light-weighted U-net #REFR .	[ "They trained neural networks to predict motion blur kernel in spatial or frequency domain and restored the sharp image by time-consuming deconvolution. Recently, the end-toend deblurring networks have drawn much attention.", "These techniques produce the latent sharp image from a blurry one in one pass without e...	[ "However, the poor performance in challenging applications is still an issue in those networks.", "For example, the multi-scale network proposed by SRN #OTHEREFR fails to handle the large blur kernel as shown in Fig. 1 .", "Although SRN adopted three scales of neural networks, it is not enough for such large bl...	[ "residual nets" ]	method	{ "title": "Deep Motion Blur Removal Using Noisy/Blurry Image Pairs", "abstract": "Removing spatially variant motion blur from a blurry image is a challenging problem as blur sources are complicated and difficult to model accurately. Recent progress in deep neural networks suggests that kernel free single image deb...	{ "title": "GAN Based Image Deblurring Using Dark Channel Prior", "abstract": "A conditional general adversarial network (GAN) is proposed for image deblurring problem. It is tailored for image deblurring instead of just applying GAN on the deblurring problem. Motivated by that, dark channel prior is carefully pick...
1912.03366	1602.03686	Introduction	Prediction based embedding approaches #REFR Choi et al., 2016a) work well on structured modality where each patient can be represented as a sequence of visits of codes, and can consider context in terms of the other neighboring codes within the same visit.	[ "However, trying to fuse infor-mation from different modalities in EHR presents the following obstacles for representation learning, 1. Inconsistency in medical concept terminology.", "In structured clinical events, the medical concept is represented with ICD-9/ICD-10 clinical code.", "While in unstructured cli...	[ "However, for unstructured clinical notes, the context can be noisy due to the presence of text describing all aspects of a patient's admission (e.g., past medical history).", "3. Feature Associations Complexity.", "Other types of patient information such as demographics and laboratory results are possibly impo...	[ "structured modality", "patient" ]	background	{ "title": "Med2Meta: Learning Representations of Medical Concepts with Meta-Embeddings", "abstract": "Distributed representations of medical concepts have been used to support downstream clinical tasks recently. Electronic Health Records (EHR) capture different aspects of patients' hospital encounters and serve as...	{ "title": "Medical Concept Representation Learning from Electronic Health Records and its Application on Heart Failure Prediction", "abstract": "Objective: To transform heterogeneous clinical data from electronic health records into clinically meaningful constructed features using data driven method that rely, in ...
2001.05295	1602.03686	Representation Learning For Text	Choi et al #REFR takes the next step and uses the code vectors to predict heart failure.	[ "Currently, the most effective representation learning techniques for text expand on document level representations by learning language models.", "A language model is a probabilistic model of sequences of words, as opposed to LSI, which models only the count matrix, or word2vec, which models only the probability...	[ "In follow up work, Choi et al extend this approach to simultaneously learn medical code and patient level representations #OTHEREFR .", "However, later evaluations on clinical outcomes found this approach was little better than several other baselines in predicting heart failure #OTHEREFR .", "Finally, Miotto ...	[ "code vectors", "heart failure" ]	background	{ "title": "Language Models Are An Effective Patient Representation Learning Technique For Electronic Health Record Data", "abstract": "Widespread adoption of electronic health records (EHRs) has fueled development of clinical outcome models using machine learning. However, patient EHR data are complex, and how to ...	{ "title": "Medical Concept Representation Learning from Electronic Health Records and its Application on Heart Failure Prediction", "abstract": "Objective: To transform heterogeneous clinical data from electronic health records into clinically meaningful constructed features using data driven method that rely, in ...
1811.11005	1602.03686	Experimental Results	When comparing our results with previous studies which used clinical concept embeddings to predict HF onset in a similar experimental setup, our approach achieved broadly similar (but slightly worse) overall performance and followed similar patterns: Choi #REFR et al.	[ "For models using the less extensive corpuses, the best performing results were observed with vectors of smaller size (50 dimensions) and larger context windows (ranging from #OTHEREFR .", "Although, counter-intuitively, the PRIMDX best embedding outperformed PRIMDX-PROC (using procedures and primary diagnoses), ...	[ "utilized clinical concept vectors trained using word2vec skip-gram and reported an AUROC of 0.711 with one-hot encoded input and AUROC of 0.743 using embeddings with a SVM classifier.", "Interestingly, the fact that we observed similar (albeit slightly worse) results when using data from multiple hospitals compa...	[ "clinical concept embeddings" ]	result	{ "title": "Application of Clinical Concept Embeddings for Heart Failure Prediction in UK EHR data", "abstract": "Electronic health records (EHR) are increasingly being used for constructing disease risk prediction models. Feature engineering in EHR data however is challenging due to their highly dimensional and he...	{ "title": "Medical Concept Representation Learning from Electronic Health Records and its Application on Heart Failure Prediction", "abstract": "Objective: To transform heterogeneous clinical data from electronic health records into clinically meaningful constructed features using data driven method that rely, in ...
1907.09600	1602.03686	INTRODUCTION	In #REFR embeddings of the aforementioned types of codes are use to predict heart failure.	[ "Especially due to the presence of free text and of di erent types clinical codes, EHR data requires potentially very high dimensional representations of patient information, with a challenge to design machine learning models that for many institutions like ours can only be trained over a relatively limited number ...	[ "To date, the embeddings of medical concepts trained on the largest amount of data (insurance claims and medical notes from 60 million patients) are those presented in [1] . Embeddings are trained from physician DSHealth, Anchorage, AK 2019. 978-x-xxxx-xxxx-x/YY/MM. . .", "$15.00 DOI: 10.1145/nnnnnnn.nnnnnnn note...	[ "embeddings" ]	method	{ "title": "Evaluation of Embeddings of Laboratory Test Codes for Patients at a Cancer Center", "abstract": "Laboratory test results are an important and generally high dimensional component of a patient's Electronic Health Record (EHR). We train embedding representations (via Word2Vec and GloVe) for LOINC codes of...	{ "title": "Medical Concept Representation Learning from Electronic Health Records and its Application on Heart Failure Prediction", "abstract": "Objective: To transform heterogeneous clinical data from electronic health records into clinically meaningful constructed features using data driven method that rely, in ...
1908.08594	1602.03686	Results	One example of medical applications is medGAN #REFR an generative adversarial network (GAN) that can be trained on a public database of EHRs and then be used to generate new, synthetic health records.	[ "The applications of deep learning and recurrent neural networks as well as convolutional networks range from computer vision and picture annotation to summarizing, text generation, question answering, and generating new instances of trained material.", "In some sense, RNNs can b ere viewed as the imputation mode...	[ "However, medGAN can also be considered an 'old style' approach just as the approach I used for generating personality items #OTHEREFR , as medGAN was not based on a pre-trained network that already includes a large body of materials in order to give it general capabilities that would be fine-tuned later.", "The ...	[ "medical applications", "EHRs" ]	background	{ "title": "Training Optimus Prime, M.D.: Generating Medical Certification Items by Fine-Tuning OpenAI's gpt2 Transformer Model", "abstract": "Objective: Showcasing Artificial Intelligence, in particular deep neural networks, for language modeling aimed at automated generation of medical education test items. OpenA...	{ "title": "Medical Concept Representation Learning from Electronic Health Records and its Application on Heart Failure Prediction", "abstract": "Objective: To transform heterogeneous clinical data from electronic health records into clinically meaningful constructed features using data driven method that rely, in ...
1903.08766	1801.08532	Perfect Affinity	Moreover, the underestimate was largest at the 50% iteration, the iteration that is generally supposed to have the best statistical properties for inference #REFR .	[ "Perfect affinity also drove a large difference between standard lift and Element lift.", "This difference was also dependent upon the proportion of treated members.", "Using the standard lift estimation technique, we found that at the 50% iteration, the new feature increased messages sent by +2.3%, and increas...	[ "Thus, Element allowed us not only to identify the presence of perfect affinity, but to corrected for it as well.", "From the description of the experimental setup, it might be fairly trivial to recognize that this would be a situation that should have strong network effects.", "Indeed, it makes perfect sense t...	[ "best statistical properties", "50% iteration" ]	background	{ "title": "A Method for Measuring Network Effects of One-to-One Communication Features in Online A/B Tests", "abstract": "A/B testing is an important decision making tool in product development because can provide an accurate estimate of the average treatment effect of a new features, which allows developers to un...	{ "title": "SQR: Balancing Speed, Quality and Risk in Online Experiments", "abstract": "Controlled experimentation, also called A/B testing, is widely adopted to accelerate product innovations in the online world. However, how fast we innovate can be limited by how we run experiments. Most experiments go through a ...
1708.08741	1204.2072	Related Work	The mesoscale dissipative particle dynamics method is applied in #REFR to simulate electrophoresis of a polyelectrolyte in a nanochannel.	[ "Also three-dimensional parallel simulations of electrophoretic separation with continuum approaches have been reported.", "The finite element simulations in #OTHEREFR consider the buffer composition and the ζ-potential at channel walls.", "In #OTHEREFR mixed finite element and finite difference simulations of ...	[ "Another explicit solvent method is presented in #OTHEREFR for simulating DNA electrophoresis, modeling DNA as a polymer.", "In both methods the polymer is represented by bead-spring chains with beads represented by a truncated Lennard-Jones potential and connected by elastic spring potentials.", "Explicit solv...	[ "electrophoresis", "nanochannel" ]	method	{ "title": "Coupled Multiphysics Simulations of Charged Particle Electrophoresis for Massively Parallel Supercomputers", "abstract": "The article deals with the multiphysics simulation of electrokinetic flows. When charged particles are immersed in a fluid and are additionally subjected to electric fields, this res...	{ "title": "Mesoscopic Simulations of Electroosmotic Flow and Electrophoresis in Nanochannels", "abstract": "We review recent dissipative particle dynamics (DPD) simulations of electrolyte flow in nanochannels. A method is presented by which the slip length δ B at the channel boundaries can be tuned systematically ...
1806.09757	1706.00890	Adaptive guaranteed-performance consensus design for leaderless cases	Because subsystem (5) describes the consensus motion of multiagent system (1), the following corollary can be obtained by #REFR .	[ "Furthermore, a large γ may regulate the consensus control gain by Theorem 1, so we can choose some proper γ and P to regulate the consensus control gain.", "We introduce a gain factor δ > 0 such that P ≤ δI, where δ can also be regarded as an upper bound of the eigenvalue of P.", "Thus, one can show that PBB T...	[]	[ "consensus motion", "multiagent system" ]	background	{ "title": "Adaptive guaranteed-performance consensus design for high-order multiagent systems", "abstract": "The current paper addresses the distributed guaranteed-performance consensus design problems for general high-order linear multiagent systems with leaderless and leaderfollower structures, respectively. The...	{ "title": "On Almost Controllability of Dynamical Complex Networks with Noises", "abstract": "Abstract: This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman...
1905.03404	1706.00890	D. Convergence speed analysis	In the following, we determine the convergence coefficient of multi-agent system (1) under control protocol #REFR and compare it with the convergence coefficient under the standard consensus protocol.	[ "Then the lower bound of ( ) t  is shown as min  which means the minimum convergence speed of multi-agent system (1).", "As a matter of fact, equation (28) originates from Definition 2.", "Then with regard to multiagent system (1) under the standard control protocol in #OTHEREFR , where ( ) ( ) ( )", "It ca...	[ "In order to ensure the effectiveness of this comparison, the control gain  is also considered in the standard consensus protocol as a reference, which means that", ". In this case, one can directly obtain that min,1", "Then substituting (17) into #OTHEREFR , the convergence coefficient of multi-agent system (...	[ "standard consensus protocol", "control protocol" ]	method	{ "title": "Adaptive Guaranteed-Performance Consensus Control for Multiagent Systems With an Adjustable Convergence Speed", "abstract": "Adaptive guaranteed-performance consensus control problems for multi-agent systems are investigated, where the adjustable convergence speed is discussed. This paper firstly propos...	{ "title": "On Almost Controllability of Dynamical Complex Networks with Noises", "abstract": "Abstract: This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman...
1912.13457	1803.11182	Analysis of the Framework	Similar to IPGAN #REFR , its results suffer from artifacts like blurriness, since a lot of attributes information from the target images are lost.	[ "We also visualize the masks M k of AAD layers on different levels in Figure 8 , where a brighter pixel indicates a higher weight for identity embedding in Equation #OTHEREFR .", "It shows that the identity embedding takes more effect in low level layers.", "Its effective region becomes sparser in middle levels...	[ "To understand what is encoded in the attributes embedding, we concatenate the embeddings z k att (bilinearly upsampled to 256 × 256 and vectorized) from all levels as a unified attribute representation. We conduct PCA to reduce vector dimensions as 512.", "We then perform tests querying faces from the training s...	[ "attributes" ]	background	{ "title": "FaceShifter: Towards High Fidelity And Occlusion Aware Face Swapping", "abstract": ": The face in the source image is taken to replace the face in the target image. Results of FaceShifter appear in the right. In this work, we propose a novel two-stage framework, called FaceShifter, for high fidelity and...	{ "title": "Towards Open-Set Identity Preserving Face Synthesis", "abstract": "We propose a framework based on Generative Adversarial Networks to disentangle the identity and attributes of faces, such that we can conveniently recombine different identities and attributes for identity preserving face synthesis in op...
1705.00133	1603.01445	Equivalence with Sato's Definition	In recent work on verifying differential privacy over general, continuous distributions, Sato #REFR proposes an alternative definition of approximate lifting.	[]	[ "In the special case of discrete distributions, where measurability of events can be forgotten, his definition can be stated as follows.", "Definition 13 (Sato [12] ).", "Let µ 1 ∈ D(A) and µ 2 ∈ D(B), R be a binary relation over", "Notice that this definition has no witness distributions at all; instead, it ...	[ "differential privacy" ]	background	{ "title": "Relational $\\star$-Liftings for Differential Privacy", "abstract": "Recent developments in formal verification have identified approximate liftings (also known as approximate couplings) as a clean, compositional abstraction for proving differential privacy. There are two styles of definitions for this ...	{ "title": "Approximate Relational Hoare Logic for Continuous Random Samplings", "abstract": "Approximate relational Hoare logic (apRHL) is a logic for formal verification of the differential privacy of databases written in the programming language pWHILE. Strictly speaking, however, this logic deals only with disc...
1710.09010	1603.01445	I. INTRODUCTION	Previous work #REFR has considered a different semantic model for standard differential privacy over continuous distributions using witness-free relational lifting, but it is not clear how to extend this model beyond differential privacy.	[ "First, Rényi divergences are not f -divergences (for one differenc, f -divergences are jointly convex while Rényi divergences are only quasi-convex #OTHEREFR ), moreover, zCDP and tCDP are supremums of Rényi divergences.", "As a result, these properties cannot be described in terms of f -divergences, nor capture...	[ "To overcome these challenges, we generalize 2-witness liftings in two directions.", "First, we replace the notion of fdivergence with a more general class of divergences, identifying the basic properties needed for compositional reasoning. Second, we generalize to continuous probability measures.", "The main c...	[ "differential privacy" ]	background	{ "title": "Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy", "abstract": "Abstract-We develop new abstractions for reasoning about three relaxations of differential privacy: Rényi differential privacy, zero-concentrated differential privacy, and truncated concentrated dif...	{ "title": "Approximate Relational Hoare Logic for Continuous Random Samplings", "abstract": "Approximate relational Hoare logic (apRHL) is a logic for formal verification of the differential privacy of databases written in the programming language pWHILE. Strictly speaking, however, this logic deals only with disc...
1708.05486	1201.0917	Arbitrary paths	Proof: Kratochvíl and Ueckerdt #REFR showed that the non-crossing connectors problem always has a solution when the regions form a collection of pseudo-disks [11, Theorem 2] (i.e., the boundaries of any two regions intersect in at most two points). In our context, the regions are the tubes.	[ "However, that is not always the case, as the example in Fig. 9(b) shows.", "Nevertheless, if we disallow double intersections, then we can still decide in polynomial time whether a solution exists.", "The key idea is to use a result by Kratochvíl and Ueckerdt #OTHEREFR that states that if the regions (in our c...	[ "To apply their result to our problem we need two things.", "First, the tubes need to be pseudo-disks.", "If no two tubes fully cross or create a double intersection, the only way in which they can interact is through single intersections.", "Two tubes that intersect in a single intersection are not always ps...	[ "non-crossing connectors problem" ]	background	{ "title": "Non-crossing paths with geographic constraints", "abstract": "A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn witho...	{ "title": "Non-crossing Connectors in the Plane", "abstract": "We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R 1 , . . . , R n in the plane and finite point sets P i ⊂ R i for i = 1, . . . , n, are there non-crossing connectors γ i for (R i , P i ), i...
1911.08700	1504.04061	Related Works	A even more special case of (4) is the synchronization over Z 2 = {1, −1} #REFR , which assume that x i in (4) are real-valued and x i = ±1.	[ "Using a more involved argument and a modified power method, Zhong and Boumal improved the bound in #OTHEREFR to σ = O( m log m ).", "In fact, this paper follows this line of works and solve the problem of (1), based on it convex relaxation #OTHEREFR .", "There are works that solve phase synchronization without...	[ "For this problem, #OTHEREFR shows that the solution of (5) matches the minimax lower bound on the optimal Bayes error rate for original problem (4).", "If d 1 = · · · = d m = r > 2, it is called the problem of synchronization of rotations in some literature.", "#OTHEREFR studies it from the perspective of esti...	[ "synchronization" ]	background	{ "title": "Tightness of the semidefinite relaxation for orthogonal trace-sum maximization", "abstract": "This paper studies an optimization problem on the sum of traces of matrix quadratic forms on m orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the pro...	{ "title": "Synchronization over Z2 and community detection in multiplex signed networks with constraints", "abstract": "Abstract. Finding group elements from noisy measurements of their pairwise ratios is also known as the group synchronization problem, first introduced in the context of the group SO(2) of planar ...
1501.06678	1502.06732	Definition 5 (Directed Edge Laplacian) The edge Laplacian of a directed graph G is defined as	The proof for the weighted version of L e (G) can be easily extended from lemma 5 of our previous work #REFR , thus the detail is omitted here.	[ "To provide a deeper insights into what the edge Laplacian L e (G) offers in the analysis and synthesis of multi-agent systems, we propose the following lemma. PROOF." ]	[ "Obviously, if G = G T , then G has L = N − 1 edges and all the eigenvalues of L e (G) are nonzero.", "In the following paper, when we deal with a quasi-strongly connected graph, it refers to a general directed graph G = G T ∪G C unless noted otherwise.", "Lemma 7 Considering a quasi-strongly connected graph G ...	[ "weighted version", "lemma" ]	background	{ "title": "Edge Agreement of Multi-agent System with Quantized Measurements via Directed Edge Laplacian", "abstract": "This work explores the edge agreement problem of the second-order nonlinear multiagent system under quantized measurements. To begin with, the general concepts of weighted edge Laplacian of direct...	{ "title": "Convergence Analysis using the Edge Laplacian: Robust Consensus of Nonlinear Multi-agent Systems via ISS Method", "abstract": "This study develops an original and innovative matrix representation with respect to the information flow for networked multi-agent system. To begin with, the general concepts o...
1910.09040	1607.03483	Seed-set expansion based on LPs	An important question that arises in seed-set expansion is how to choose the weights of the GPR in order to insure near-optimal or optimal classification #REFR .	[ "Consequently, thresholding properly combined LP values may allow for classifying vertices as being inside or outside of the community.", "Formally, each vertex v in a hypergraph G(V, E) is associated with a vector of LPs (x", "The GPRs of vertices are compared to a threshold to determine whether they belong to...	[ "To this end, start with a partition into two communities V 0 , V 1 of V .", "Let a = (a (0) , a #OTHEREFR , ...) denote the arithmetic mean (centroid) of the LPs of vertices v ∈ V 0 , #OTHEREFR , ...) denote the arithmetic mean (centroid) of the LPs of ver-", "v .", "If the only available information about t...	[ "seed-set expansion" ]	background	{ "title": "Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs", "abstract": "We describe the first known mean-field study of landing probabilities for random walks on hypergraphs. In particular, we examine clique-expansion and tensor methods and evaluate their mean-field characteristics ov...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1910.09040	1607.03483	Concentration results	The result is also consistent with the finding for the special case d = 2 described in #REFR .	[ "The mean-field of the LPs for the d-hSBM(n, p, q) model in the clique-expansion setting is described in the following theorem. ce . Then for all k ≥ 0 we havē", "whereā,b satisfy the following recurrence relation", "Remark 3.1. The eigenvalue decomposition leads tō", "This result reveals that the geometric d...	[ "Next we show that the geometric centroids of LPs of clique-expansion RWoHs will asymptotically concentrate around their mean-field counterparts, which establishes consistency of the mean-field analysis.", "v;ce be the LPs of a clique-expansion RWoHs on G (ce) satisfying #OTHEREFR .", "Also assume that n d−1 q ...	[ "finding" ]	result	{ "title": "Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs", "abstract": "We describe the first known mean-field study of landing probabilities for random walks on hypergraphs. In particular, we examine clique-expansion and tensor methods and evaluate their mean-field characteristics ov...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1910.09040	1607.03483	Construction of GPR based on landing probabilities	Following #REFR , the geometric discriminant of interest equals w T x v , where x v is the landing probability vector of the vertex v.	[ "In what follows, we use the results of our theoretical results to propose new GPR methods for hypergraph clustering." ]	[ "If only the first moments of the LPs are available, the optimal choice of w corresponding to the maximal marginal separator of the centroids is given in Theorems 3.2 and 3.4 for cliqueexpansion RWoHs and tensor RWoHs, respectively.", "The geometric discriminant only takes the first-order moments of LPs into acco...	[ "vertex", "landing probability vector" ]	background	{ "title": "Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs", "abstract": "We describe the first known mean-field study of landing probabilities for random walks on hypergraphs. In particular, we examine clique-expansion and tensor methods and evaluate their mean-field characteristics ov...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1910.09040	1607.03483	Construction of GPR based on landing probabilities	The authors of #REFR empirically leveraged the information about the second-order moments of LPs.	[ "Following #OTHEREFR , the geometric discriminant of interest equals w T x v , where x v is the landing probability vector of the vertex v.", "If only the first moments of the LPs are available, the optimal choice of w corresponding to the maximal marginal separator of the centroids is given in Theorems 3.2 and 3...	[ "They showed that the Fisher discriminant has a performance that nearly matches that of belief propagation, the statistically optimal method for community detection on SBM [36, 37, 38].", "We therefore turn our attention to Fisher discriminant corresponding to clique-expansion and tensor RWoHs.", "Recall that o...	[ "second-order moments", "information" ]	background	{ "title": "Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs", "abstract": "We describe the first known mean-field study of landing probabilities for random walks on hypergraphs. In particular, we examine clique-expansion and tensor methods and evaluate their mean-field characteristics ov...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1806.07640	1607.03483	Introduction	The authors of #REFR have carried out their analysis in dense stochastic block models when the edge probabilities are fixed, i.e., they do not scale with the size of the graph.	[ "On the other hand, the analysis of Personalized PageRank on undirected random graph models is more difficult because a simple random walk on an undirected graph can pass through an edge in both directions, thus creating many short cycles and loops.", "To the best of our knowledge, #OTHEREFR is the only work stud...	[ "In the present work we analyze Personalized PageRank with a localized restart distribution.", "As a graph model, we consider an ER random graph with a smaller denser ER graph planted within.", "We establish conditions for concentration and non-concentration of PPR under different scaling laws of the edge proba...	[ "dense stochastic block" ]	background	{ "title": "Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering", "abstract": "We analyse a mean-field model of Personalized PageRank on the Erdős-Rényi random graph containing a denser planted Erdős-Rényi subgraph. We investigate the regimes where the values of Personalized Pa...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1811.10797	1607.03483	Spectral multi-length embeddings	According to #REFR , for SPD matrices, the SVD is identical to the eigenvalue decomposition (EVD).	[ "While any symmetric S that obeys (4) can be used for constructing multi-length similarities (cf.", "(5)), certain desirable properties may materialize by properly designing S. We begin by recalling the following identity", "where P + N denotes the space of N × N symmetric positive definite (SPD) matrices, and ...	[ "Thus, if S ∈ P + N , the solution to (2) is also given as (cf. (8))", "where U d are also the first d eigenvectors of S, and", "is the K−order polynomial of its eigenvalues defined by θ.", "Consider now that we specify S to be", "Clearly, (11) is SPD; this follows upon recalling that" ]	[ "eigenvalue decomposition", "SVD" ]	background	{ "title": "Adaptive-similarity node embedding for scalable learning over graphs.", "abstract": "Abstract-Node embedding is the task of extracting informative and descriptive features over the nodes of a graph. The importance of node embeddings for graph analytics, as well as learning tasks such as node classificat...	{ "title": "Block Models and Personalized PageRank", "abstract": "Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset S of nodes...
1605.09781	1210.0866	Related Work	In particular, the authors would like to underline the similarities of this study with a recent work of Adcock, Rubin and Carlsson #REFR .	[ "A real comparison with other research groups or with a competing commercial software is difficult to assess.", "Algorithms based on persistent homology have been used by other research groups in different applications." ]	[ "In this paper, persistent homology has been used to classify hepatic (liver) lesions using multidimensional persistent homology.", "Indeed, the intensity filtration used there is the same filtering function used here for the three color channels and the idea of the border filtration used there is very similar to...	[ "similarities" ]	result	{ "title": "A Feasibility Study for a Persistent Homology-Based k-Nearest Neighbor Search Algorithm in Melanoma Detection", "abstract": "Abstract Persistent homology is a fairly new branch of computational topology which combines geometry and topology for an effective shape description of use in Pattern Recognition...	{ "title": "Classification of Hepatic Lesions using the Matching Metric", "abstract": "In this paper we present a methodology of classifying hepatic (liver) lesions using multidimensional persistent homology, the matching metric (also called the bottleneck distance), and a support vector machine. We present our cla...
1907.08276	1807.10446	Introduction	Basing on validation by using the 127 Trojan samples collected from a real-world banking environment in the UK #REFR .	[ "Since the top banking botnets and takedown efforts in 2014 and 2015, researchers #OTHEREFR have observed cybercriminals learning from past experience and quickly adapting to more sophisticated technologies commonly seen in advanced persistent threat (APT) attacks.", "Instead of stealing credentials by infecting ...	[ "The steps below describe in greater detail how APT-based banking trojan typically works:", "1.", "Reconnaissance and Weaponization: Gathering information and preparation of an attack.", "Using Carbanak APT #OTHEREFR as an example, Cybercriminals registered new spoofing domains to impersonate a legitimate sof...	[ "127 Trojan samples" ]	method	{ "title": "An AI-based, Multi-stage detection system of banking botnets", "abstract": "Banking Trojans, botnets are primary drivers of financially-motivated cybercrime. In this paper, we first analyzed how an APT-based banking botnet works step by step through the whole lifecycle. Specifically, we present a multi-...	{ "title": "A Cyber Kill Chain Based Taxonomy of Banking Trojans for Evolutionary Computational Intelligence", "abstract": "Malware such as banking Trojans are popular with financially-motivated cybercriminals. Detection of banking Trojans remains a challenging task, due to the constant evolution of techniques used...
1908.09590	1809.05807	Comparisons with models in the literature	DUPMN #REFR ) also uses a hierarchical LSTM as base model and incorporates attributes as two separate deep memory network, one for each attribute.	[ "2.", "UPDMN #OTHEREFR uses an LSTM classifier as base model and incorporates attributes as a separate deep memory network that uses other related documents as memory.", "3.", "NSC #OTHEREFR ) uses a hierarchical LSTM classifier as base model and incorporates attributes using the bias-attention method on both...	[ "5.", "PMA #OTHEREFR ) is similar to NSC but uses external features such as the ranking preference method of a specific user.", "6.", "HCSC (Amplayo et al., 2018a) uses a combination of BiLSTM and CNN as base model, incorporates attributes using the biasattention method, and also considers the existence of co...	[ "hierarchical LSTM", "memory network" ]	method	{ "title": "Rethinking Attribute Representation and Injection for Sentiment Classification", "abstract": "Text attributes, such as user and product information in product reviews, have been used to improve the performance of sentiment classification models. The de facto standard method is to incorporate them as add...	{ "title": "Dual Memory Network Model for Biased Product Review Classification", "abstract": "In sentiment analysis (SA) of product reviews, both user and product information are proven to be useful. Current tasks handle user profile and product information in a unified model which may not be able to learn salient ...
1701.07518	0909.2622	IV. COMPOUND SECRECY CAPACITY WITH EAVESDROPPER MEAN UNCERTAINTY	For this particular scenario, q ns takes the same form as in #REFR , yet, with u e = u * .	[ "Proof.", "Follows immediately by Theorem 1 while realizing that the worst eavesdropper mean channel is in the direction u * .", "Corollary 1 extends Theorem 1 to the case of uncertainty about the eavesdropper mean channel direction.", "We can conclude that, since the transmitter does not know the eavesdroppe...	[]	[ "form", "u" ]	background	{ "title": "On the compound MIMO wiretap channel with mean feedback", "abstract": "Compound MIMO wiretap channel with double sided uncertainty is considered under channel mean information model. In mean information model, channel variations are centered around its mean value which is fed back to the transmitter. We...	{ "title": "Transmitter Optimization for Achieving Secrecy Capacity in Gaussian MIMO Wiretap Channels", "abstract": "We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each node equipped with multiple anten...
1611.00044	0909.2622		This strengthens the earlier result in #REFR (transmission on non-negative rather than positive directions).	[ "In particular, the optimal covariance does not converge to a scaled identity in the high-SNR case and thus isotropic signaling is sub-optimal in this regime.", "Theorem 1, in combination with the rank-1 solution, provides the complete characterization of the optimal covariance for the case of two transmit antenn...	[ "While the proof in #OTHEREFR is rather straightforward and is based on a singular transformation (multiplication by a matrix that is singular when the covariance matrix is rank-deficient) of the KKT conditions, significantly more effort and a new approach are required to establish the stronger result.", "It avoi...	[ "positive directions" ]	result	{ "title": "Optimal Signaling for Secure Communications Over Gaussian MIMO Wiretap Channels", "abstract": "Optimal signaling over the Gaussian multiple-input multiple-output wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obt...	{ "title": "Transmitter Optimization for Achieving Secrecy Capacity in Gaussian MIMO Wiretap Channels", "abstract": "We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each node equipped with multiple anten...
1611.00044	0909.2622		While the proof in #REFR is rather straightforward and is based on a singular transformation (multiplication by a matrix that is singular when the covariance matrix is rank-deficient) of the KKT conditions, significantly more effort and a new approach are required to establish the stronger result.	[ "Theorem 1, in combination with the rank-1 solution, provides the complete characterization of the optimal covariance for the case of two transmit antennas (for any channel, degraded or not).", "The cases of high-SNR and of weak eavesdropper are elaborated in Corollaries 1 and 2.", "An optimal covariance matrix...	[ "It avoids using a singular transformation (since some information about active signalling sub-space is irreversibly lost in the process) but relies on a novel property of positive semi-definite matrices (Lemma 2) and their block-partitioned representation to establish a property of dual variables from which the de...	[ "covariance matrix" ]	background	{ "title": "Optimal Signaling for Secure Communications Over Gaussian MIMO Wiretap Channels", "abstract": "Optimal signaling over the Gaussian multiple-input multiple-output wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obt...	{ "title": "Transmitter Optimization for Achieving Secrecy Capacity in Gaussian MIMO Wiretap Channels", "abstract": "We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each node equipped with multiple anten...
1504.03725	0909.2622	I. INTRODUCTION	A weaker form of this result (non-negative instead of positive directions) has been obtained earlier in #REFR .	[ "The optimal transmit covariance matrix under the total power constraint has been obtained for some special cases, e.g.", "low/high SNR, multiple-input single-output (MISO) channels, fullrank, rank-1 or weak eavesdropper cases, or the parallel channel #OTHEREFR - #OTHEREFR , but the general case remains illusive....	[ "In the general case, the rank of an optimal covariance matrix does not exceed the number of positive eigenvalues of the difference channel matrix #OTHEREFR .", "An exact full-rank solution for the optimal covariance has been obtained in #OTHEREFR and its properties have been characterized.", "In particular, un...	[ "positive directions" ]	result	{ "title": "An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels", "abstract": "Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obta...	{ "title": "Transmitter Optimization for Achieving Secrecy Capacity in Gaussian MIMO Wiretap Channels", "abstract": "We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each node equipped with multiple anten...
1904.11481	1812.10455	B. Exogenous Update Arrivals	Note that when p 1 = 1, (24) reduces to the building block result in #REFR Theorem 1] .	[ "However, type I update interarrival to a node, S I , is now equal to S I = X k1:n +Z + j+M1−1", "In the following theorem, we determine the age of a type I update at an individual node when the update streams arrive exogenously at the source node.", "Theorem 2 Under the earliest k 1 and k 2 transmission scheme...	[ "By making the corresponding replacements as in Section III-A we can obtain the average age expression of type II update stream, ∆ II .", "When the service times of the packets of the same kind are i.i.d.", "shifted exponential random variables and n is large, we can further simplify (24) as follows.", "Corol...	[ "Theorem" ]	background	{ "title": "Age of Information in Multicast Networks with Multiple Update Streams", "abstract": "Abstract-We consider the age of information in a multicast network where there is a single source node that sends timesensitive updates to n receiver nodes. Each status update is one of two kinds: type I or type II. To ...	{ "title": "Age of information in multihop multicast networks", "abstract": "We consider the age of information in a multihop multicast network where there is a single source node sending timesensitive updates to n L end nodes, and L denotes the number of hops. In the first hop, the source node sends updates to n f...
1110.3672	cs/0305040	Corollary 1	In Appendix C we report tests of our approach for bounded model checking of DLTL formulas in the line of the LTL BMC experiments in #REFR .	[ "This formula is valid if its negation ✸¬(mail(b) ⊃ ✸¬mail(b)) is not satisfiable.", "We verify the satisfiability of this formula, by adding to the translation of the domain description the constraint ← not sat (ev(neg(impl(mail(b) , ev(neg(mail(b)))))), 0). and looking for an extension.", "The resulting set o...	[ "Results are provided for a DLV encoding of BMC and of action domain descriptions for the dining philosophers problems considered in that paper. The scalability of the two approaches is similar." ]	[ "bounded model checking" ]	method	{ "title": "Reasoning about Actions with Temporal Answer Sets", "abstract": "In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional ...	{ "title": "Bounded LTL Model Checking with Stable Models", "abstract": "In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalisation of communicating automata, 1-safe Petri net...
2003.02117	1910.13636	B. OP and ER	Based on results in #REFR , it is indicated that the diversity orders of all the NOMA users can be approximated to the number of RAs L for the I-RIS cases when the number of RISs is high enough.	[ "We then focus on the diversity orders of user k in cluster m, which can be obtained for evaluating the slope of OP.", "Proposition 1.", "From Theorem 1, the diversity orders for the I-RIS cases can be determined by expanding the lower incomplete Gamma function, and the diversity order of user k in cluster m of...	[ "We then turn our attention to the ER of user K in cluster m, which is a salient metric for performance analysis, and hence the approximated ER expressions for user K in cluster m is given in the following Theorem.", "Theorem 2.", "When the number of RISs N is sufficiently high, and α 2 v − K q=v+1 α 2 q ε v > ...	[ "NOMA users" ]	result	{ "title": "MIMO-NOMA Networks Relying on Reconfigurable Intelligent Surface: A Signal Cancellation Based Design", "abstract": "Reconfigurable intelligent surface (RIS) technique stands as a promising signal enhancement or signal cancellation technique for next generation networks. We design a novel passive beamfor...	{ "title": "Exploiting Intelligent Reflecting Surfaces in Multi-Antenna Aided NOMA Systems", "abstract": "This paper investigates a downlink multiple-input single-output intelligent reflecting surface (IRS) non-orthogonal multiple access (NOMA) system, where a base station (BS) serves multiple users with the aid of...
1808.08509	1706.09077	Single Image Super Resolution	Various deep learning methods have been applied in the past, to solve the SISR problem, many of which have been summarized in #REFR . First, Dong et al.	[]	[ "proposed in #OTHEREFR the replacement of all steps to produce a high resolution imagefeature extraction then mapping then reconstruction -by a single neural network.", "The deep learning model performed better than other example-based methods.", "However, it was proposed in #OTHEREFR that deeper networks may n...	[ "Various deep learning" ]	method	{ "title": "Efficient Single Image Super Resolution using Enhanced Learned Group Convolutions", "abstract": "Abstract. Convolutional Neural Networks (CNNs) have demonstrated great results for the single-image super-resolution (SISR) problem. Currently, most CNN algorithms promote deep and computationally expensive ...	{ "title": "Super-Resolution via Deep Learning", "abstract": "The recent phenomenal interest in convolutional neural networks (CNNs) must have made it inevitable for the super-resolution (SR) community to explore its potential. The response has been immense and in the last three years, since the advent of the pione...
1904.10105	1701.05303	where	The type system presented in this section is essentially taken from Parys #REFR ; we have applied some cosmetic changes, though.	[ "Corollary 9.", "The following conditions are equivalent for a homogeneous and closed (potentially infinite) lambda-term M of sort o:", "• for every n ∈ N, in the tree generated by M there exists a branch with at least n appearances of the constant a, and • for every n ∈ N, there exists a derivation for ⊢ m M :...	[ "In Parys #OTHEREFR the type system is extended to the task of counting multiple constants: the (m + 1)-value is not a number, but a tuple, where each coordinate of the tuple estimates the number of appearances of a particular constant.", "In particular, Corollary 9 is extended there to the property \"for every n...	[ "type system" ]	method	{ "title": "Intersection Types for Unboundedness Problems", "abstract": "Intersection types have been originally developed as an extension of simple types, but they can also be used for refining simple types. In this survey we concentrate on the latter option; more precisely, on the use of intersection types for de...	{ "title": "Intersection Types and Counting", "abstract": "We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground λ -term corresponds to some property of a derivation of a typ...
1811.02034	1309.4334	Handling of Exceptions and Code Changes	To correctly detect code changes in the debugger project, the IDRA Changes Handler leverages on Epicea #REFR , an existent library for handling such events.	[ "The restart queue is needed to keep track of the debugging sessions that were already sent to the IDRA Manager.", "It allows IDRA to restart the failed debugging session after the developer commits its fix to the remote machine.", "Figure 5 shows how, after the developer produces and commits a fix, this trigge...	[]	[ "debugger project" ]	method	{ "title": "Out-Of-Place debugging: a debugging architecture to reduce debugging interference", "abstract": "Abstract Context Recent studies show that developers spend most of their programming time testing, verifying and debugging software. As applications become more and more complex, developers demand more advan...	{ "title": "Representing Code History with Development Environment Events", "abstract": "Modern development environments handle information about the intent of the programmer: for example, they use abstract syntax trees for providing high-level code manipulation such as refactorings; nevertheless, they do not keep ...
1911.11932	1711.05225	B. Attacker Agenda	User Privacy Violation: smart devices are increasingly trusted with private user data such as shopping history, voice commands, or medical recordings #REFR .	[ "The y-axis in Figure 1 represents the attacker's motivation for attacking an edge-deployed neural network.", "We classify attacker motivations into four categories: Denial of Service: attackers may want to prevent a device running a neural network from properly functioning.", "For example, attackers may want t...	[ "This data is valuable for its advertising, monitoring, or polling value.", "User privacy violations are cases where the attacker is able to access measured or stored sensor data from the device or user data the device from the network.", "For example, attacks on voice assistants where the attacker can access p...	[ "smart devices", "medical recordings" ]	background	{ "title": "Survey of Attacks and Defenses on Edge-Deployed Neural Networks", "abstract": "Deep Neural Network (DNN) workloads are quickly moving from datacenters onto edge devices, for latency, privacy, or energy reasons. While datacenter networks can be protected using conventional cybersecurity measures, edge ne...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1904.02633	1711.05225	Evaluation of Generated Reports	Learning Meaningful Attention Maps Attention maps have been a useful tool in visualizing what a neural network is attending to, as demonstrated by #REFR .	[ "For example, TieNet is prone to generate nasogastric tube mentions while our model tends to mention tracheostomy or endotracheal tube, and yet both models have difficulty identifying some specific lines such as chest tube or PICC line.", "Similarly, both systems do not generate the sentence with positive lung pa...	[ "Figure 3 shows the intermediate attention maps for each word when it is being generated.", "As we can observe, the model is able to roughly capture the location of the indicated disease or parts, but we also find, interestingly, that the attention map tends to be the complement of the actual region of interest w...	[ "Meaningful Attention Maps", "neural network" ]	background	{ "title": "Clinically Accurate Chest X-Ray Report Generation", "abstract": "The automatic generation of radiology reports given medical radiographs has significant potential to operationally and clinically improve patient care. A number of prior works have focused on this problem, employing advanced methods from c...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1801.09927	1711.05225	C. Evaluation	In nearly all the 14 classes, our method yields best performance. Only Rajpurkar et al. #REFR report higher accuracy on Hernia.	[ "Comparing with these methods, this paper contributes new state of the art to the community: average AUC = 0.871.", "AG-CNN exceeds the previous state of the art #OTHEREFR by 2.9%.", "AUC scores of pathologies such as Cardiomegaly and Infltration are higher than #OTHEREFR by about 0.03.", "AUC scores of Mass,...	[ "In all, the classification accuracy reported in this paper compares favorably against previous art.", "Variant of training strategy analysis.", "Training three branches with different orders influences the performance of AG-CNN.", "We perform 4 orders to train AG-CNN: 1) train global branch first, and then l...	[ "higher accuracy" ]	result	{ "title": "Diagnose like a Radiologist: Attention Guided Convolutional Neural Network for Thorax Disease Classification", "abstract": "Abstract-This paper considers the task of thorax disease classification on chest X-ray images. Existing methods generally use the global image as input for network learning. Such a...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1808.05744	1711.05225	Introduction	Chest X-rays is the most common imaging examinations in practice, with approximately 2 billion procedures per year #REFR .	[ "It is a relatively easy task for radiologists to read and diagnose chest X-ray images.", "However, teaching a computer to process hospital-scale of chest X-ray scans is extremely challenging." ]	[ "The success of chest X-ray disease detection will lay the groundwork for more complex systems to provide consistent, trustable and interpretable second opinions on reading medical images of all kinds of modalities.", "Deep Learning methods have been applied to disease classification, sensitive area localization ...	[ "common imaging examinations", "Chest X" ]	background	{ "title": "Dynamic Routing on Deep Neural Network for Thoracic Disease Classification and Sensitive Area Localization", "abstract": "Abstract. We present and evaluate a new deep neural network architecture for automatic thoracic disease detection on chest X-rays. Deep neural networks have shown great success in a ...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1708.05924	1711.05225	Transfer Learning	The idea is that most of the learned knowledge on dataset S can be used in the target dataset with a small amount of additional training. This idea works well in image processing (e.g. #REFR ) and considerably reduces the training time.	[ "Transfer learning #OTHEREFR has been an active and successful field of research in machine learning and especially in image processing.", "In transfer learning, there is a source dataset S and a trained neural network to perform a given task, e.g. classification, regression, or decisioning through RL.", "Train...	[ "In order to use transfer learning in the beer game, assume there exists a source agent i ∈ {1, 2, 3, 4} with trained network S i (with a fixed size on all agents), parameters", "demand distribution D 1 , and co-player policy π 1 .", "The weight matrix W i contains the learned weights such that W q i denotes th...	[ "target", "dataset" ]	background	{ "title": "A Deep Q-Network for the Beer Game : Reinforcement Learning for Inventory Optimization", "abstract": "Problem definition: The beer game is a widely used game that is played in supply chain management classes to demonstrate the bullwhip effect and the importance of supply chain coordination. The game is ...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1811.10947	1711.05225	Introduction	For instance, obtaining large samples of speech recordings or x-ray scans is substantially easier than providing an accurate label to each sample #REFR .	[ "The goal of a classifier is to predict the class label y ∈ Y of an object with features x ∈ X .", "Supervised learning of classifiers requires data pairs (x, y), but obtaining labels y for every observed feature x is a costly and/or time-consuming process. This limitation prohibits learning accurate classifiers ...	[ "This motivates the development of semi-supervised methods that leverage large amounts of unlabeled data in addition to a more limited labeled dataset, denoted D 0 = {x i } and D 1 = {(x i , y i )}, respectively.", "That is, methods applicable to scenarios in which \|D 0 \| \|D 1 \|.", "Missing data is a well-studi...	[ "accurate label", "x-ray scans" ]	background	{ "title": "Reliable Semi-Supervised Learning when Labels are Missing at Random", "abstract": "Semi-supervised learning methods are motivated by the availability of large datasets with unlabeled features in addition to labeled data. Unlabeled data is, however, not guaranteed to improve classification performance an...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1909.01940	1711.05225	RESULTS	Training and testing on ChestX-ray14 achieves results similar to the ones reported on #REFR .	[ "We train the same neural network architecture with the same hyperparameters at each of the three datasets individually." ]	[ "After training, we load our model and evaluate it with images from the remaining two.", "We summarize our results in Table 2 .", "We can see that the best results for each test set appear when the training set is from the same dataset.", "This shows that clinicians should expect a decrease in the reported pe...	[ "Training" ]	result	{ "title": "Can we trust deep learning models diagnosis? The impact of domain shift in chest radiograph classification", "abstract": "While deep learning models become more widespread, their ability to handle unseen data and generalize for any scenario is yet to be challenged. In medical imaging, there is a high he...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1811.08615	1711.05225	Methods	Images are resized to 256×256, then featurized to the last bottleneck layer of a pretrained DenseNet-121 model #REFR .	[ "Our overall experimental flow follows Figure 1 .", "Notes are featurized via (1) term frequencyinverse document frequency (TF-IDF) over bi-grams, (2) pre-trained GloVe word embeddings #OTHEREFR averaged across the selected section of the report, (3) sentence embeddings, or (4) paragraph embeddings.", "In (3) a...	[ "PCA is applied onto the 1024-dimension raw image features to obtain 64-dimension features.", "#OTHEREFR Text features are projected into the 64-dimension image feature space. We use several methods regarding different objectives.", "Embedding Alignment (EA) Here, we find a linear transformation between two set...	[ "pretrained DenseNet-121 model" ]	method	{ "title": "Unsupervised Multimodal Representation Learning across Medical Images and Reports", "abstract": "Joint embeddings between medical imaging modalities and associated radiology reports have the potential to offer significant benefits to the clinical community, ranging from cross-domain retrieval to conditi...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
2003.00682	1711.05225	Related work	The paper #REFR suggested a network for deep convolutional 121-layer with the dataset of chestX-ray14.	[ "So, a complete study is requisite to conduct deep learning with power over thousand patients' samples to obtain the reliable and accurate predictions.", "In #OTHEREFR offered the significance of AI with a state of art in the classification of chest X-ray and analysis.", "Furthermore, the work #OTHEREFR describ...	[ "Publicly available in this dataset has X-ray images for fourteen diseases.", "They also addressed that their algorithm has been provided very high efficiency.", "The paper #OTHEREFR described that a dataset for big labeled is the point of achievement for classification tasks and prediction.", "They offered a...	[ "deep convolutional 121-layer" ]	background	{ "title": "Disease Detection from Lung X-ray Images based on Hybrid Deep Learning", "abstract": "Lung Disease can be considered as the second most common type of disease for men and women. Many people die of lung disease such as lung cancer, Asthma, CPD (Chronic pulmonary disease) etc. in every year. Early detecti...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1712.07632	1711.05225	Introduction	For example, recently, CheXNet model was announced that can automatically detect pneumonia from chest X-rays at a level exceeding practicing radiologists #REFR .	[ "Chest X-ray (CXR) imaging is currently the most popular and the most available diagnostic tool for health monitoring and diagnosing many lung diseases, including pneumonia, tuberculosis, cancer, etc.", "However, detecting marks of these diseases from CXRs is a very complicated procedure, which takes involvement ...	[ "That is why any automated assistance tools and related machine learning techniques are of great importance for the faster and better identification, classification and segmentation of suspicious regions (like lesions, nodules, etc.) for the subsequent diagnostic.", "The main aim of this paper is to demonstrate e...	[ "chest X" ]	background	{ "title": "Deep Learning with Lung Segmentation and Bone Shadow Exclusion Techniques for Chest X-Ray Analysis of Lung Cancer", "abstract": "Abstract. The recent progress of computing, machine learning, and especially deep learning, for image recognition brings a meaningful effect for automatic detection of various...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1904.02805	1711.05225	Introduction	They find that deep learning systems rival expert radiologists, as is the recent paper of Rajpurkar et al. when having radiologists diagnosing pneumonia #REFR . Arevalo et al.	[ "Visual search may also be trivial as in the previous example or may require stronger degrees of expertise accumulated even over many years such as radiologists searching for tumours in mammograms, as well as military surveillance operators, or TSA agents who must go over a high collection of images in the shortest...	[ "benchmark CNN's to classical computer vision models such as HOG and explore the learned representations by such deep networks in the first convolutional layer #OTHEREFR .", "The majority of studies have evaluated automated intelligent agents via classical computer vision or endto-end deep learning architectures ...	[ "deep learning systems" ]	background	{ "title": "Assessment of Faster R-CNN in Man-Machine Collaborative Search", "abstract": "Abstract" }	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1901.07441	1711.05225	arXiv:1901.07441v2 [eess.IV] 7 Feb 2019	Using the same repository, #REFR extended the annotations to 14 different pathologies (ChestX-Ray14) and designed a model with a deeper CNN architecture to classify images as 14 pathological entities.	[ "area of research in recent years #OTHEREFR .", "For instance, #OTHEREFR trained a Convolutional Neural Network (CNN) to classify and localize 8 pathologies using the chest x-ray database (ChestX-Ray8) which comprised 108,948 frontal-view x-ray images of 32,717 different patients." ]	[ "This method was reported to obtain greater diagnostic efficiency in the detection of pneumonias when compared to that of radiologists.", "#OTHEREFR proposed the attention guided CNN to help combine global and local information in order to improve recognition performance.", "Chest-XRay14 was also employed by #O...	[ "deeper CNN architecture" ]	method	{ "title": "PadChest: A large chest x-ray image dataset with multi-label annotated reports", "abstract": "We present a labeled large-scale, high resolution chest x-ray dataset for the automated exploration of medical images along with their associated reports. This dataset includes more than 160,000 images obtained...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1909.02077	1711.05225	Comparison to Prior Work	We compare against the single-stage high-capacity approaches of CheXNet #REFR and Wang et al.	[ "We evaluate general fracture classification performance using five-fold crossvalidation with a 70%/10%/20% training, validation, and testing split, respectively." ]	[ "#OTHEREFR , both of which use DenseNet-121 as backbones and apply global average pooling (GAP) and LSE pooling, respectively.", "Note, that unlike our first stage of §2.1, the pooling is applied to the last feature map.", "We also compare against the single-stage lower-capacity model of ResNet-18, using both G...	[ "CheXNet" ]	method	{ "title": "Weakly Supervised Universal Fracture Detection in Pelvic X-rays", "abstract": "Abstract. Hip and pelvic fractures are serious injuries with life-threatening complications. However, diagnostic errors of fractures in pelvic X-rays (PXRs) are very common, driving the demand for computer-aided diagnosis (CA...	{ "title": "CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning", "abstract": "We develop an algorithm that can detect pneumonia from chest X-rays at a level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer convolutional neural network trained on ChestX-ray14, ...
1807.05275	1802.02209	II. RELATED WORK	IONet #REFR is an end-to-end learned INS that provides a continuous trajectory estimate directly from raw inertial data using an LSTM network.	[ "Furthermore, the system in #OTHEREFR requires that a moving average filter be applied to the SVM output in order to remove false-positive detections; this may erroneously remove correctly-predicted zero-velocity events for running users. Our approach differs from Park et al.", "in that we train a single model fo...	[ "While this implementation fully replaces the filtering architecture with a learned model, we believe that zero-velocity detection is an integral part of the architecture and that an end-to-end method would have difficulty reproducing the accuracy of a zero-velocity-aided system.", "Instead, we simply replace an ...	[ "raw inertial data" ]	method	{ "title": "LSTM-Based Zero-Velocity Detection for Robust Inertial Navigation", "abstract": "Abstract-We present a method to improve the accuracy of a zero-velocity-aided inertial navigation system (INS) by replacing the standard zero-velocity detector with a long short-term memory (LSTM) neural network. While exis...	{ "title": "IONet: Learning to Cure the Curse of Drift in Inertial Odometry", "abstract": "Inertial sensors play a pivotal role in indoor localization, which in turn lays the foundation for pervasive personal applications. However, low-cost inertial sensors, as commonly found in smartphones, are plagued by bias and...
1903.01534	1802.02209	Feature Encoder	Inspired by IONet #REFR , we use a two-layer Bi-directional LSTM with 128 hidden states as the Inertial Feature Encoder f inertial .	[ "Ideally, we want the Visual Encoder f vision to learn geometrically meaningful features rather than features related with appearance or context.", "For this reason, instead of using a PoseNet model #OTHEREFR , as commonly found in other DL-based VO approaches #OTHEREFR , we use FlowNetSimple #OTHEREFR as our fea...	[ "As shown in Figure 2 , a window of inertial measurements x I between each two images is fed to the inertial feature encoder in order to extract the dimensional feature vector a I :" ]	[ "Inertial Feature Encoder" ]	method	{ "title": "Selective Sensor Fusion for Neural Visual-Inertial Odometry", "abstract": "Deep learning approaches for Visual-Inertial Odometry (VIO) have proven successful, but they rarely focus on incorporating robust fusion strategies for dealing with imperfect input sensory data. We propose a novel end-to-end sele...	{ "title": "IONet: Learning to Cure the Curse of Drift in Inertial Odometry", "abstract": "Inertial sensors play a pivotal role in indoor localization, which in turn lays the foundation for pervasive personal applications. However, low-cost inertial sensors, as commonly found in smartphones, are plagued by bias and...
2001.04061	1802.02209	B. Inertial Odometry Neural Networks	Inertial Odometry Neural Networks (IONet) #REFR are able to learn user's ego-motion directly from raw inertial data and solve more general motions.	[]	[ "For example, tracking a trolley or other wheeled configurations is quite challenging for PDR models, due to the fact that no walking step or periodicity patterns can be detected in this case.", "In contrast, IONet can regress the location transformation (the average speed) during any fixed window of time, withou...	[ "Inertial Odometry Neural" ]	background	{ "title": "Deep Learning based Pedestrian Inertial Navigation: Methods, Dataset and On-Device Inference", "abstract": "Modern inertial measurements units (IMUs) are small, cheap, energy efficient, and widely employed in smart devices and mobile robots. Exploiting inertial data for accurate and reliable pedestrian ...	{ "title": "IONet: Learning to Cure the Curse of Drift in Inertial Odometry", "abstract": "Inertial sensors play a pivotal role in indoor localization, which in turn lays the foundation for pervasive personal applications. However, low-cost inertial sensors, as commonly found in smartphones, are plagued by bias and...

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.