aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1812.06876 | 2905564348 | Recently advancements in sequence-to-sequence neural network architectures have led to an improved natural language understanding. When building a neural network-based Natural Language Understanding component, one main challenge is to collect enough training data. The generation of a synthetic dataset is an inexpensive... | Multi-task learning has been performed in many of machine learning applications, e. ,g., in facial landmark detection an application in the area of vision @cite_1 . | {
"cite_N": [
"@cite_1"
],
"mid": [
"1896424170"
],
"abstract": [
"Facial landmark detection has long been impeded by the problems of occlusion and pose variation. Instead of treating the detection task as a single and independent problem, we investigate the possibility of improving detection robu... |
1812.06898 | 2904840533 | In distributed computing frameworks like MapReduce, Spark, and Dyrad, a coflow is a set of flows transferring data between two stages of a job. The job cannot start its next stage unless all flows in the coflow finish. To improve the execution performance of such a job, it is crucial to reduce the completion time of a ... | Flow schedulers. Much research work has also been performed on reducing the average flow completion time @cite_1 @cite_5 @cite_10 @cite_11 @cite_16 @cite_4 . Rojas @cite_1 give a comprehensive survey on existing schemes for scheduling flows in data center networks. PDQ @cite_10 is a flow scheduling protocol which utili... | {
"cite_N": [
"@cite_4",
"@cite_1",
"@cite_5",
"@cite_16",
"@cite_10",
"@cite_11"
],
"mid": [
"1657185548",
"2064941967",
"2101871381",
"",
"",
"2117884704"
],
"abstract": [
"Many existing data center network (DCN) flow scheduling schemes minimize flow compl... |
1812.07023 | 2905141912 | Understanding audio-visual content and the ability to have an informative conversation about it have both been challenging areas for intelligent systems. The Audio Visual Scene-aware Dialog (AVSD) challenge, organized as a track of the Dialog System Technology Challenge 7 (DSTC7), proposes a combined task, where a syst... | Automated evaluation of both task-oriented and non-task-oriented dialogue systems has been a challenge @cite_9 @cite_16 too. Most such dialogue systems are evaluated using per-turn evaluation metrics since there is no suitable per-dialogue metric as conversations do not need to happen in a deterministic ordering of tur... | {
"cite_N": [
"@cite_9",
"@cite_16"
],
"mid": [
"2729046720",
"2328886022"
],
"abstract": [
"Automated metrics such as BLEU are widely used in the machine translation literature. They have also been used recently in the dialogue community for evaluating dialogue response generation. Howeve... |
1812.06669 | 2904596301 | As deep learning advances, algorithms of music composition increase in performance. However, most of the successful models are designed for specific musical structures. Here, we present BachProp, an algorithmic composer that can generate music scores in many styles given sufficient training data. To adapt BachProp to a... | DeepBach @cite_13 is designed exclusively for songs with a constant number of voices (e.g. four voices for a typical Bach chorale) and a discretization of the rhythm into multiples of a base unit, e.g. 16 th notes. The model achieves good results not only in generating novel songs but allows also in reharmonizing given... | {
"cite_N": [
"@cite_13"
],
"mid": [
"2963575853"
],
"abstract": [
"This paper introduces DeepBach, a graphical model aimed at modeling polyphonic music and specifically hymn-like pieces. We claim that, after being trained on the chorale harmonizations by Johann Sebastian Bach, our model is capabl... |
1812.06544 | 2951085355 | Human activity recognition based on video streams has received numerous attentions in recent years. Due to lack of depth information, RGB video based activity recognition performs poorly compared to RGB-D video based solutions. On the other hand, acquiring depth information, inertia etc. is costly and requires special ... | Human activity recognition has been extensively studied in the recent years @cite_29 @cite_21 @cite_3 . Most of state-of-the-art methods exact handcrafted features from RGB videos and rely on traditional shallow classifiers for activity classification @cite_35 @cite_18 @cite_30 @cite_11 @cite_37 . For example, @cite_35... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_18",
"@cite_37",
"@cite_29",
"@cite_21",
"@cite_3",
"@cite_11"
],
"mid": [
"2110142955",
"2034328688",
"45528431",
"",
"1551696353",
"2963218601",
"2274499208",
"2136917337"
],
"abstract": [
"In th... |
1812.06544 | 2951085355 | Human activity recognition based on video streams has received numerous attentions in recent years. Due to lack of depth information, RGB video based activity recognition performs poorly compared to RGB-D video based solutions. On the other hand, acquiring depth information, inertia etc. is costly and requires special ... | In order to solve the aforementioned issues, skeleton information from RGB-D video has been widely studied to improve recognition accuracy @cite_10 @cite_40 @cite_27 @cite_13 @cite_17 . Observations from seminal work by Johansson @cite_19 suggests that a few movement of human joints is sufficient to recognize an action... | {
"cite_N": [
"@cite_4",
"@cite_28",
"@cite_10",
"@cite_32",
"@cite_19",
"@cite_27",
"@cite_40",
"@cite_23",
"@cite_13",
"@cite_12",
"@cite_17"
],
"mid": [
"2554408731",
"2593146028",
"2526041356",
"2761860076",
"2099634219",
"",
"",
"195... |
1812.06576 | 2949720626 | Person re-identification (ReID) aims to match people across multiple non-overlapping video cameras deployed at different locations. To address this challenging problem, many metric learning approaches have been proposed, among which triplet loss is one of the state-of-the-arts. In this work, we explore the margin betwe... | Strictly speaking, triplet loss was first introduced by @cite_23 . They trained the metric with the goal that the k-nearest neighbors belong to the same class and examples of different classes can be dissociated by a large margin. Based on this work, @cite_5 improved the loss to learn a unified embedding for face recog... | {
"cite_N": [
"@cite_30",
"@cite_5",
"@cite_13",
"@cite_23"
],
"mid": [
"2598634450",
"2096733369",
"",
"2106053110"
],
"abstract": [
"In the past few years, the field of computer vision has gone through a revolution fueled mainly by the advent of large datasets and the ado... |
1812.06576 | 2949720626 | Person re-identification (ReID) aims to match people across multiple non-overlapping video cameras deployed at different locations. To address this challenging problem, many metric learning approaches have been proposed, among which triplet loss is one of the state-of-the-arts. In this work, we explore the margin betwe... | Hard example mining has been widely exploited to assist training of deep neural networks. @cite_33 proposed online hard example mining to improve the performance of object detection. @cite_30 extended this idea and selected the hardest positive and negative samples within a batch when generating triplets. These methods... | {
"cite_N": [
"@cite_30",
"@cite_33"
],
"mid": [
"2598634450",
"2341497066"
],
"abstract": [
"In the past few years, the field of computer vision has gone through a revolution fueled mainly by the advent of large datasets and the adoption of deep convolutional neural networks for end-to-en... |
1812.06635 | 2950469992 | In this paper, we propose a way to combine two acceleration techniques for the @math -regularized least squares problem: safe screening tests, which allow to eliminate useless dictionary atoms, and the use of fast structured approximations of the dictionary matrix. To do so, we introduce a new family of screening tests... | Apart from the aforementioned structured dictionaries and safe screening tests --as well as other preceding correlation-based feature selection heuristics @cite_34 @cite_37 -- some related acceleration strategies for sparsity-inducing optimization problems (or more specifically for problem ) are worth citing. | {
"cite_N": [
"@cite_37",
"@cite_34"
],
"mid": [
"2131060185",
"2154560360"
],
"abstract": [
"Summary. We consider rules for discarding predictors in lasso regression and related problems, for computational efficiency. El Ghaoui and his colleagues have proposed ‘SAFE’ rules, based on univa... |
1812.06635 | 2950469992 | In this paper, we propose a way to combine two acceleration techniques for the @math -regularized least squares problem: safe screening tests, which allow to eliminate useless dictionary atoms, and the use of fast structured approximations of the dictionary matrix. To do so, we introduce a new family of screening tests... | Instead of starting from the full problem and pruning the feature set, working set techniques @cite_27 @cite_17 start with small restricted problems and progressively include more promising features. In @cite_33 , the authors combine a working set strategy with safe screening and in @cite_21 they incorporate a dual ext... | {
"cite_N": [
"@cite_27",
"@cite_21",
"@cite_33",
"@cite_17"
],
"mid": [
"2497464837",
"2963653702",
"2604483902",
"1578527825"
],
"abstract": [
"In this paper, we investigate new active-settype methods for l1-regularized linear regression that overcome some difficulties of... |
1812.06635 | 2950469992 | In this paper, we propose a way to combine two acceleration techniques for the @math -regularized least squares problem: safe screening tests, which allow to eliminate useless dictionary atoms, and the use of fast structured approximations of the dictionary matrix. To do so, we introduce a new family of screening tests... | Joint screening @cite_32 allows to screen many atoms which lie close together in one single test, reducing the number of required tests for a given dictionary. Interestingly, the resulting tests share many similarities and mathematical connections to the stable screening tests introduced here, despite arising from an e... | {
"cite_N": [
"@cite_32"
],
"mid": [
"2963552869"
],
"abstract": [
"This paper focusses on “safe” screening techniques for the LASSO problem. Motivated by the need for low-complexity algorithms, we propose a new approach, dubbed “joint screening test”, allowing to screen a set of atoms by carrying... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | Indoor scene understanding has been a popular topic and accumulated rich literature in the past decades. We review the most relevant works and refer readers to the survey @cite_25 to have an overview. | {
"cite_N": [
"@cite_25"
],
"mid": [
"2792893928"
],
"abstract": [
"With the availability of low-cost and compact 2.5 3D visual sensing devices, computer vision community is experiencing a growing interest in visual scene understanding. This survey paper provides a comprehensive background to this... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | 3D Reconstruction A number of simultaneous localization and mapping (SLAM) techniques are widely used to model 3D scenes using a RGB-D sensor. Some typical works include Kinect Fusion @cite_15 , Voxel Hashing @cite_33 , Elastic Fusion @cite_17 , Bundle Fusion @cite_34 , ORB-SLAM @cite_24 , SVO @cite_23 , DSO @cite_11 a... | {
"cite_N": [
"@cite_11",
"@cite_33",
"@cite_24",
"@cite_23",
"@cite_15",
"@cite_34",
"@cite_17"
],
"mid": [
"2474281075",
"2071906076",
"2535547924",
"",
"1987648924",
"2336961836",
"2527142681"
],
"abstract": [
"Direct Sparse Odometry (DSO) is a vi... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | Works on room layout estimation via a single image @cite_8 @cite_10 @cite_0 @cite_41 @cite_5 have been continuously developed which enhance indoor scene analysis and understanding. Due to the limitation of the narrow field-of-view caused by a single standard image, researchers have tried to exploit panoramic images @ci... | {
"cite_N": [
"@cite_37",
"@cite_26",
"@cite_8",
"@cite_41",
"@cite_32",
"@cite_0",
"@cite_44",
"@cite_5",
"@cite_31",
"@cite_10"
],
"mid": [
"2598108580",
"566730006",
"2116851763",
"",
"",
"2534523274",
"",
"2113107168",
"",
""
],... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | RGB-D images include 3D range information of each pixel, thus significantly improving the accuracy and the robustness of geometry reasoning. Some methods use a single RGB-D image @cite_12 @cite_13 to estimate a room layout, which is also limited by the narrow field-of-view. With the superiority of panoramic RGB-D image... | {
"cite_N": [
"@cite_38",
"@cite_18",
"@cite_4",
"@cite_3",
"@cite_45",
"@cite_13",
"@cite_12"
],
"mid": [
"2201056710",
"",
"2775610217",
"2609058327",
"2795586939",
"",
"2296672305"
],
"abstract": [
"This paper presents a novel 3D modeling framewor... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | Indoor Scene Constraints Intrinsic properties of indoor scenes are widely used in indoor understanding and reconstruction. Manhattan World (MW) assumption is the predominant rule, thus Manhattan frame estimation is well researched for both RGB @cite_8 @cite_28 and RGB-D images @cite_42 @cite_27 . MW is widely used as a... | {
"cite_N": [
"@cite_35",
"@cite_8",
"@cite_28",
"@cite_41",
"@cite_29",
"@cite_42",
"@cite_0",
"@cite_44",
"@cite_27",
"@cite_19",
"@cite_5",
"@cite_10"
],
"mid": [
"",
"2116851763",
"1965834447",
"",
"",
"1955995711",
"2534523274",
... |
1812.06677 | 2904325312 | We present a novel approach to reconstruct large or featureless scenes. Our method jointly estimates camera poses and a room layout from a set of partial reconstructions due to camera tracking interruptions when scanning a large or featureless scene. Unlike the existing methods relying on feature point matching to loca... | In addition to the MW assumption, indoor scenes have plentiful lines and planes which provide strong cues for many tasks. Elqursh and Elgammal @cite_20 present a line-based camera pose estimation method, while Koch al @cite_7 use 3D line segments to align the non-overlapping indoor and outdoor reconstructions. Planar p... | {
"cite_N": [
"@cite_7",
"@cite_36",
"@cite_9",
"@cite_21",
"@cite_1",
"@cite_6",
"@cite_3",
"@cite_43",
"@cite_40",
"@cite_19",
"@cite_2",
"@cite_20"
],
"mid": [
"2484731041",
"",
"",
"",
"2789805612",
"",
"2609058327",
"",
"2769... |
1812.06698 | 2953271208 | In modern election campaigns, political parties utilize social media to advertise their policies and candidates and to communicate to the electorate. In Japan's latest general election in 2017, the 48th general election for the Lower House, social media, especially Twitter, was actively used. In this paper, we analyze ... | The number of followers a user has is used as the attention degree of the user. But the influence of the number of followers in information diffusion is not necessarily large @cite_0 , and fraudulent methods are sometimes used to gain followers @cite_3 . Even in political communication, the hub of information cannot be... | {
"cite_N": [
"@cite_0",
"@cite_3",
"@cite_8"
],
"mid": [
"1814023381",
"2011366667",
""
],
"abstract": [
"Directed links in social media could represent anything from intimate friendships to common interests, or even a passion for breaking news or celebrity gossip. Such directed l... |
1812.06587 | 2904946678 | Video description is one of the most challenging problems in vision and language understanding due to the large variability both on the video and language side. Models, hence, typically shortcut the difficulty in recognition and generate plausible sentences that are based on priors but are not necessarily grounded in t... | Attention Supervision. As fine-grained grounding becomes a potential incentive for next-generation vision-language systems, to what degree it can benefit remains an open question. On one hand, for VQA @cite_25 @cite_13 the authors point out that the attention model does not attend to same regions as humans and adding a... | {
"cite_N": [
"@cite_3",
"@cite_19",
"@cite_49",
"@cite_23",
"@cite_13",
"@cite_25"
],
"mid": [
"2410323755",
"",
"2795151422",
"2626778328",
"2949991003",
"2883092128"
],
"abstract": [
"Attention mechanisms have recently been introduced in deep learning for... |
1812.06553 | 2905548585 | Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous volumes of bulk multicast traffic generated as a result of data and content replication. Although one can perform these transfers using a sing... | A large body of general multicasting approaches have been proposed where receivers can join multicast groups anytime to receive required data and multicast trees are incrementally built and pruned as nodes join or leave a multicast session such as IP multicasting @cite_44 , TCP-SMO @cite_58 and NORM @cite_19 . These so... | {
"cite_N": [
"@cite_44",
"@cite_19",
"@cite_58"
],
"mid": [
"",
"2240045799",
"2162111441"
],
"abstract": [
"",
"This document describes the messages and procedures of the Negative- ACKnowledgment (NACK) Oriented Reliable Multicast (NORM) Protocol. This protocol is designed to... |
1812.06553 | 2905548585 | Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous volumes of bulk multicast traffic generated as a result of data and content replication. Although one can perform these transfers using a sing... | A variety of solutions have been proposed for minimizing congestion across the intra-datacenter network by selecting multicast trees according to link utilization. Datacast @cite_40 sends data over edge-disjoint Steiner trees found by pruning spanning trees over various topologies of FatTree, BCube, and Torus. AvRA @ci... | {
"cite_N": [
"@cite_57",
"@cite_40",
"@cite_63"
],
"mid": [
"2537090207",
"",
"2037572363"
],
"abstract": [
"Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, raising new requirements for multicast transpo... |
1812.06553 | 2905548585 | Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous volumes of bulk multicast traffic generated as a result of data and content replication. Although one can perform these transfers using a sing... | Various techniques have been proposed to make multicasting reliable including the use of coding and receiver (negative or positive) acknowledgments. Experiments have shown that using positive ACKs does not lead to ACK implosion for medium scale (sub-thousand) receiver groups @cite_58 . TCP-XM @cite_37 allows reliable d... | {
"cite_N": [
"@cite_38",
"@cite_37",
"@cite_7",
"@cite_52",
"@cite_57",
"@cite_19",
"@cite_58",
"@cite_13"
],
"mid": [
"",
"2120679453",
"1539914100",
"2161342511",
"2537090207",
"2240045799",
"2162111441",
""
],
"abstract": [
"",
"In re... |
1812.06553 | 2905548585 | Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous volumes of bulk multicast traffic generated as a result of data and content replication. Although one can perform these transfers using a sing... | Existing approaches track the slowest receiver. PGMCC @cite_47 , MCTCP @cite_57 and TCP-SMO @cite_58 use window-based TCP like congestion control to compete fairly with other flows. NORM @cite_19 uses an equation-based rate control scheme. With rate allocation and end-host based rate limiting applied over inter-datacen... | {
"cite_N": [
"@cite_57",
"@cite_19",
"@cite_47",
"@cite_58"
],
"mid": [
"2537090207",
"2240045799",
"2024370454",
"2162111441"
],
"abstract": [
"Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, ra... |
1812.06700 | 2904236443 | With the online proliferation of hate speech, there is an urgent need for systems that can detect such harmful content. In this paper, We present the machine learning models developed for the Automatic Misogyny Identification (AMI) shared task at EVALITA 2018. We generate three types of features: Sentence Embeddings, T... | The research on hatespeech is gaining momentum with several works which focus on different aspects such as analyzing hatespeech @cite_12 @cite_17 @cite_0 @cite_15 @cite_3 , and detection of hatespeech @cite_10 @cite_16 @cite_6 . | {
"cite_N": [
"@cite_3",
"@cite_6",
"@cite_0",
"@cite_15",
"@cite_16",
"@cite_10",
"@cite_12",
"@cite_17"
],
"mid": [
"2952038496",
"",
"2953180101",
"",
"2951737564",
"2887782043",
"2796881724",
"2903015761"
],
"abstract": [
"With the spread... |
1812.06589 | 2904622387 | Given an arbitrary speech clip and a facial image, talking face generation aims to synthesize a talking face video with precise lip synchronization as well as a smooth transition of facial motion over the entire video speech. Most existing methods mainly focus on either disentangling the information in a single image o... | Earlier works on talking face generation mainly synthesize the specific identity from the dataset by given an arbitrary speech audio. use a time-delayed LSTM @cite_2 to generate key points synced to the audio and use another network to generate the video frames conditioned on the key points. Furthermore, propose a teet... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2952232639"
],
"abstract": [
"There is large consent that successful training of deep networks requires many thousand annotated training samples. In this paper, we present a network and training strategy that relies on the strong use of data augmentation to use... |
1812.06589 | 2904622387 | Given an arbitrary speech clip and a facial image, talking face generation aims to synthesize a talking face video with precise lip synchronization as well as a smooth transition of facial motion over the entire video speech. Most existing methods mainly focus on either disentangling the information in a single image o... | In the following, attempt to adopt an encoder-decoder CNN model to learn the correspondences between raw audio and video data. propose a deep neural network to learn a mapping from input waveforms to the 3D vertex coordinates of a face model. The network discovers a latent code to disambiguate facial expression variati... | {
"cite_N": [
"@cite_5",
"@cite_9",
"@cite_13",
"@cite_11"
],
"mid": [
"",
"2099471712",
"2804600264",
"1569907127"
],
"abstract": [
"",
"We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models:... |
1812.06589 | 2904622387 | Given an arbitrary speech clip and a facial image, talking face generation aims to synthesize a talking face video with precise lip synchronization as well as a smooth transition of facial motion over the entire video speech. Most existing methods mainly focus on either disentangling the information in a single image o... | One of the pioneers is to calculate the relative frequencies on appropriate partitions to approximate mutual information @cite_6 . propose a popular KNN-based estimator modified from the entropy estimator . Recent works try to employ parameters-free approaches , or rely on approximate Gaussianity of data distribution t... | {
"cite_N": [
"@cite_22",
"@cite_6"
],
"mid": [
"2141652941",
"2951744766"
],
"abstract": [
"We develop the general, multivariate case of the Edgeworth approximation of differential entropy and show that it can be more accurate than the nearest-neighbor method in the multivariate case and ... |
1812.06598 | 2905543510 | Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practioners to determine which method would be suitable to get insights into the structural information of... | Agreste evaluate different community detection algorithms in a empirical and comparative approach, especially for the context of web data analytic @cite_38 . The authors find that and recommend that the label propagation method (LPA) , which is also in a global agreement with our analysis in Section providing predictio... | {
"cite_N": [
"@cite_38",
"@cite_46",
"@cite_20"
],
"mid": [
"2552367669",
"2610304566",
"2513567506"
],
"abstract": [
"Detecting communities in graphs is a fundamental tool to understand the structure of Web-based systems and predict their evolution. Many community detection algor... |
1812.06598 | 2905543510 | Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practioners to determine which method would be suitable to get insights into the structural information of... | Ghasemian present in a recent publication that an evaluation of overfitting and underfitting of several community detection models @cite_33 . The authors study the number of communities detected in practice by many methods and the maximum number of detectable clusters according to a theoretical model. Some conclusions ... | {
"cite_N": [
"@cite_33"
],
"mid": [
"2788030877"
],
"abstract": [
"A common data mining task on networks is community detection, which seeks an unsupervised decomposition of a network into structural groups based on statistical regularities in the network's connectivity. Although many methods exi... |
1907.02244 | 2954814982 | In this age of social media, people often look at what others are wearing. In particular, Instagram and Twitter influencers often provide images of themselves wearing different outfits and their followers are often inspired to buy similar clothes.We propose a system to automatically find the closest visually similar cl... | * Localization We review here a number of main academic approaches for localizing apparel items. In @cite_3 , deep CNNs were trained to predict a set of fashion landmarks, such as shoulder points or neck points. However, landmarks for clothes are sometimes not well defined and are often sensitive to occlusions. Human p... | {
"cite_N": [
"@cite_14",
"@cite_1",
"@cite_3",
"@cite_2",
"@cite_10"
],
"mid": [
"2193145675",
"2598915960",
"2471768434",
"",
"2951856387"
],
"abstract": [
"We present a method for detecting objects in images using a single deep neural network. Our approach, named... |
1907.02244 | 2954814982 | In this age of social media, people often look at what others are wearing. In particular, Instagram and Twitter influencers often provide images of themselves wearing different outfits and their followers are often inspired to buy similar clothes.We propose a system to automatically find the closest visually similar cl... | * Classification Recognizing the product type accurately for apparel is of critical importance in finding similar items from the catalog. In the literature, a number of different classifications have been adopted for clothing items. This is partially a function of what the labeled input datasets provide ( @cite_3 , @ci... | {
"cite_N": [
"@cite_23",
"@cite_13",
"@cite_3"
],
"mid": [
"2811481004",
"2121339428",
"2471768434"
],
"abstract": [
"Understanding clothes from a single image would have huge commercial and cultural impacts on modern societies. However, this task remains a challenging computer vi... |
1907.02244 | 2954814982 | In this age of social media, people often look at what others are wearing. In particular, Instagram and Twitter influencers often provide images of themselves wearing different outfits and their followers are often inspired to buy similar clothes.We propose a system to automatically find the closest visually similar cl... | Visual similarity search can be done by searching for the nearest neighbors to an embedding extracted from certain intermediate layer(s) in a deep neural network trained for surrogate tasks (see @cite_23 , @cite_21 , @cite_18 and @cite_25 ). The deep network can be trained with cross entropy loss (classification), cont... | {
"cite_N": [
"@cite_18",
"@cite_22",
"@cite_7",
"@cite_21",
"@cite_6",
"@cite_23",
"@cite_25"
],
"mid": [
"2144172034",
"2591921973",
"2606377603",
"1975517671",
"2598634450",
"2811481004",
"2547446130"
],
"abstract": [
"The key challenge of face re... |
1907.02326 | 2954114218 | We propose an interactive-predictive neural machine translation framework for easier model personalization using reinforcement and imitation learning. During the interactive translation process, the user is asked for feedback on uncertain locations identified by the system. Responses are weak feedback in the form of "k... | Interactive-predictive translation goes back to early approaches for IBM-type @cite_6 @cite_23 and phrase-based machine translation @cite_7 @cite_26 . Knowles and Koehn and presented neural interactive translation prediction --- a translation scenario where translators interact with an NMT system by accepting or correc... | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_7",
"@cite_21",
"@cite_6",
"@cite_23"
],
"mid": [
"2251171258",
"2251044602",
"2100271871",
"",
"1514971736",
"2164788644"
],
"abstract": [
"Analyses of computer aided translation typically focus on either fronten... |
1907.02326 | 2954114218 | We propose an interactive-predictive neural machine translation framework for easier model personalization using reinforcement and imitation learning. During the interactive translation process, the user is asked for feedback on uncertain locations identified by the system. Responses are weak feedback in the form of "k... | Gonz 'a lez- apply active learning for interactive machine translation, where a user interactively finishes translations of a statistical MT system. Their active learning component decides which sentences to sample for translation and receive supervision for, and the MT system is updated on-line @cite_16 . In our algor... | {
"cite_N": [
"@cite_16"
],
"mid": [
"1716250762"
],
"abstract": [
"State-of-the-art Machine Translation (MT) systems are still far from being perfect. An alternative is the so-called Interactive Machine Translation (IMT) framework. In this framework, the knowledge of a human translator is combine... |
1907.02361 | 2954969685 | The 5G New Radio (NR) standard for wireless communications supports the millimetre-wave (mmWave) spectrum to yield unprecedented improvement of the access network capacity. However, intermittent blockages in the mmWave signal may degrade the system performance and lead to the under-utilisation of the allocated resource... | The literature on blockage mitigation in mmWave communication is mostly focused on techniques that rely on spatial macro-diversity. Such techniques allow the transmitter to find an alternative physical path for the mmWave signal when the primary LOS path fails due to a blockage event. The main techniques considered are... | {
"cite_N": [
"@cite_18",
"@cite_28",
"@cite_9",
"@cite_24",
"@cite_19",
"@cite_2",
"@cite_17"
],
"mid": [
"2905177534",
"2786009799",
"2962725695",
"2771699997",
"2612195480",
"2793438365",
"2797160996"
],
"abstract": [
"60 GHz millimeter-wave netwo... |
1907.02361 | 2954969685 | The 5G New Radio (NR) standard for wireless communications supports the millimetre-wave (mmWave) spectrum to yield unprecedented improvement of the access network capacity. However, intermittent blockages in the mmWave signal may degrade the system performance and lead to the under-utilisation of the allocated resource... | It is the responsibility of the MAC layer to coordinate the extra communication nodes (e.g., relay nodes, neighbour AP ), and provide a smooth handover between the AP , relays, or reflectors when the mmWave signal power fades due to blockage @cite_20 @cite_27 @cite_8 @cite_10 . However, the intermittent blockages toget... | {
"cite_N": [
"@cite_27",
"@cite_10",
"@cite_20",
"@cite_8"
],
"mid": [
"",
"2575875755",
"2571468893",
"2724926863"
],
"abstract": [
"",
"The millimeter wave (mmWave) bands offer the possibility of orders of magnitude greater throughput for fifth-generation (5G) cellul... |
1907.02361 | 2954969685 | The 5G New Radio (NR) standard for wireless communications supports the millimetre-wave (mmWave) spectrum to yield unprecedented improvement of the access network capacity. However, intermittent blockages in the mmWave signal may degrade the system performance and lead to the under-utilisation of the allocated resource... | In state-of-the-art flexible numerology has been applied to improve the network latency where the TTI is optimised according to a latency deadline restriction @cite_21 and according to the traffic pattern @cite_16 . Also, it has been applied to improve the frame spectral efficiency when multiplexing different types of ... | {
"cite_N": [
"@cite_30",
"@cite_21",
"@cite_6",
"@cite_16"
],
"mid": [
"2963986572",
"2587066115",
"2907793396",
"2899057481"
],
"abstract": [
"We explore the potential of optimizing resource allocation with flexible numerology in frequency domain and variable frame struct... |
1907.02288 | 2956093676 | Is it possible to predict the affect of a user just by observing her behavioral interaction through a video? How can we, for instance, predict a user's arousal in games by merely looking at the screen during play? In this paper we address these questions by employing three dissimilar deep convolutional neural network a... | Videos have been at the core of interest for both eliciting and modeling emotions in affective computing @cite_29 . Typically, the video features a human face (or a group of faces) and emotion is modelled through the detection of facial cues (see @cite_43 @cite_0 @cite_25 among many) due to theoretical frameworks and e... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_4",
"@cite_28",
"@cite_29",
"@cite_42",
"@cite_0",
"@cite_43",
"@cite_24",
"@cite_27",
"@cite_34",
"@cite_25"
],
"mid": [
"2519256581",
"2136119880",
"1869445247",
"1966797434",
"",
"2142385019",
... |
1907.02288 | 2956093676 | Is it possible to predict the affect of a user just by observing her behavioral interaction through a video? How can we, for instance, predict a user's arousal in games by merely looking at the screen during play? In this paper we address these questions by employing three dissimilar deep convolutional neural network a... | Conventional machine learning methods have often been used for pattern recognition in images, videos and other data types, but have been held back by the requirement that raw data needed to be transformed to a suitable representation via a handcrafted feature construction process based on expert knowledge. The recent s... | {
"cite_N": [
"@cite_5",
"@cite_8",
"@cite_2",
"@cite_39"
],
"mid": [
"2742947407",
"2145339207",
"2163605009",
""
],
"abstract": [
"Deep learning methods employ multiple processing layers to learn hierarchical representations of data, and have produced state-of-the-art res... |
1907.02288 | 2956093676 | Is it possible to predict the affect of a user just by observing her behavioral interaction through a video? How can we, for instance, predict a user's arousal in games by merely looking at the screen during play? In this paper we address these questions by employing three dissimilar deep convolutional neural network a... | Player modeling is the study of computational models of players, their behavioral patterns and affective responses @cite_38 . If target outputs are available, a player model considers some input modality regarding the player (e.g. their gameplay and physiology) and is trained to predict aspects of the in-game behavior ... | {
"cite_N": [
"@cite_38",
"@cite_31",
"@cite_10"
],
"mid": [
"",
"2011974988",
"2141104189"
],
"abstract": [
"",
"Estimating affective and cognitive states in conditions of rich human-computer interaction, such as in games, is a field of growing academic and commercial interest... |
1907.02288 | 2956093676 | Is it possible to predict the affect of a user just by observing her behavioral interaction through a video? How can we, for instance, predict a user's arousal in games by merely looking at the screen during play? In this paper we address these questions by employing three dissimilar deep convolutional neural network a... | This study advances the state of the art in player modelling by using solely raw gameplay information to model a player's emotions. Within the broader area of artificial intelligence and games @cite_41 , the majority of the works that analyse and extract information from gameplay videos focus on inferring the strategy,... | {
"cite_N": [
"@cite_37",
"@cite_8",
"@cite_41",
"@cite_31",
"@cite_12",
"@cite_11"
],
"mid": [
"2103184652",
"2145339207",
"",
"2011974988",
"",
"2884289434"
],
"abstract": [
"More than 15 years after the early studies in Affective Computing (AC), [1] the p... |
1907.02452 | 2956043269 | This paper addresses the data-driven identification of latent dynamical representations of partially-observed systems, i.e., dynamical systems for which some components are never observed, with an emphasis on forecasting applications, including long-term asymptotic patterns. Whereas state-of-the-art data-driven approac... | The simplest example of an embedding is the case where our observation operator is an identity matrix. With such embedding we have direct access to the state variable @math which is governed by a deterministic ODE. This particular case has been widely studied in the literature, parametric representations based on augme... | {
"cite_N": [
"@cite_9",
"@cite_24",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_25"
],
"mid": [
"2782210340",
"2963755523",
"2788823228",
"2060458267",
"2937472180",
"2239232218"
],
"abstract": [
"The process of transforming observed data into predictive math... |
1907.02266 | 2955698149 | We give new partially-dynamic algorithms for the all-pairs shortest paths problem in weighted directed graphs. Most importantly, we give a new deterministic incremental algorithm for the problem that handles updates in @math total time (where the edge weights are from @math ) and explicitly maintains a @math -approxima... | The dynamic graph problems on digraphs are considerably harder than their counterparts on undirected graphs. An extreme example is the dynamic reachability problem, that is, transitive closure on directed graphs, and connectivity on undirected graphs. While there exist algorithms for undirected graphs with polylogarith... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_29",
"@cite_32",
"@cite_39",
"@cite_0",
"@cite_27",
"@cite_40",
"@cite_16"
],
"mid": [
"",
"2045430818",
"2395489635",
"2099450374",
"",
"2102347446",
"1886894033",
"2010151376",
"2146507303"
],
... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | Computational models of saliency prediction, a long standing problem in computer vision, have been studied from so many perspectives that going through all is beyond the scope of this manuscript. We, thus, provide a brief account of relevant works and summarize them in this section. We refer the readers to @cite_21 @ci... | {
"cite_N": [
"@cite_29",
"@cite_21"
],
"mid": [
"2032007016",
"2164084182"
],
"abstract": [
"Visual attention is a process that enables biological and machine vision systems to select the most relevant regions from a scene. Relevance is determined by two components: 1) top-down factors dr... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | To date, from a computer vision perspective, we can divide the research on computational models of saliency prediction into two era (1) pre-deep learning, and (2) deep learning. During the pre-deep learning period, significant number of saliency models were introduced, e.g. @cite_28 @cite_20 @cite_30 @cite_24 @cite_23 ... | {
"cite_N": [
"@cite_30",
"@cite_28",
"@cite_36",
"@cite_21",
"@cite_24",
"@cite_0",
"@cite_27",
"@cite_23",
"@cite_31",
"@cite_20"
],
"mid": [
"1924619199",
"",
"1980711281",
"2164084182",
"2037328649",
"2148383759",
"2063608179",
"213804601... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | The use of deep learning introduced new challenges to the community. The characteristics of most of the models shifted towards data intensive models based on deep convolutional neural networks (CNNs). To train a model, a huge amount of data is required; motivating the search for alternatives to eye tracking databases l... | {
"cite_N": [
"@cite_45",
"@cite_1"
],
"mid": [
"1934890906",
"2472782738"
],
"abstract": [
"Saliency in Context (SALICON) is an ongoing effort that aims at understanding and predicting visual attention. This paper presents a new method to collect large-scale human data during natural expl... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | To improve the training, Bruce al @cite_1 investigated the factors required to take into account when relying on deep models, , pre-processing steps, tricks for pooling all the eye tracking databases together and other nuances of training a deep model. Authors, however, considered only one loss function in their study. | {
"cite_N": [
"@cite_1"
],
"mid": [
"2472782738"
],
"abstract": [
"In this paper we consider the problem of visual saliency modeling, including both human gaze prediction and salient object segmentation. The overarching goal of the paper is to identify high level considerations relevant to derivin... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | Tavakoli al @cite_4 looked into the correlation between mouse tracking and eye tracking at finer details, showing the data from the two modalities are not exactly the same. They demonstrated that, while mouse tracking is useful for training a deep model, it is less reliable for model selection and evaluation in particu... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2619291653"
],
"abstract": [
"This paper revisits visual saliency prediction by evaluating the recent advancements in this field such as crowd-sourced mouse tracking-based databases and contextual annotations. We pursue a critical and quantitative approach towa... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | Given the sudden boost in overall performance by saliency models using deep learning techniques, Bylinskii al @cite_33 reevaluated the existing benchmarks and looked into the factors influencing the performance of models in a finer detail. They quantified the remaining gap between models and human. They argued that pus... | {
"cite_N": [
"@cite_33"
],
"mid": [
"2520859141"
],
"abstract": [
"Recently, large breakthroughs have been observed in saliency modeling. The top scores on saliency benchmarks have become dominated by neural network models of saliency, and some evaluation scores have begun to saturate. Large jump... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | Recently Sen al @cite_44 investigated the effect of model training on neuron representations inside a deep saliency model. They demonstrated that (1) some visual regions are more salient than others, and (2) the change in inner-representations is due to the task that original model is trained on prior to being fine-tun... | {
"cite_N": [
"@cite_44"
],
"mid": [
"2920331547"
],
"abstract": [
"Recently, data-driven deep saliency models have achieved high performance and have outperformed classical saliency models, as demonstrated by results on datasets such as the MIT300 and SALICON. Yet, there remains a large gap betwe... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | The deep saliency models fall into two categories, (1) those using CNNs as a fixed feature extractors and learn a regression from feature space into saliency space using a none-neural technique, and (2) those that train a deep saliency model end-to-end. The number of models belonging to the first category is limited. T... | {
"cite_N": [
"@cite_19",
"@cite_6"
],
"mid": [
"2078903912",
"2533058588"
],
"abstract": [
"Saliency prediction typically relies on hand-crafted (multiscale) features that are combined in different ways to form a \"master\" saliency map, which encodes local image conspicuity. Recent impro... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | Within end-to-end deep learning techniques, the main research has been on architecture design. Many of the models borrow the pre-trained weights of an image recognition network and experiment combining different layers in various ways. In other words, they engineer an encoder-decoder network that combines a selected se... | {
"cite_N": [
"@cite_42",
"@cite_10",
"@cite_11",
"@cite_2"
],
"mid": [
"2212216676",
"2738450183",
"2963828885",
"2964145162"
],
"abstract": [
"Saliency in Context (SALICON) is an ongoing effort that aims at understanding and predicting visual attention. Conventional salie... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | There has been also a wave of models incorporating recurrent neural architectures. Han and Liu @cite_43 proposed a multi-scale architecture using convolutional long-short-term memory (ConvLSTM). It is followed by @cite_38 using a slight modified architecture using multiple layers in the encoder and a different loss fun... | {
"cite_N": [
"@cite_43",
"@cite_17",
"@cite_38"
],
"mid": [
"2528092473",
"2798322161",
"2558906385"
],
"abstract": [
"Traditional saliency models usually adopt hand-crafted image features and human-designed mechanisms to calculate local or global contrast. In this paper, we propo... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | In the literature of deep saliency models, a loss function or a combination of several ones is chosen based on intuition, expertise of the authors or sometimes mathematical formulation of a model. K " u mmerer al @cite_26 introduces the idea that information-theory can be a good inspiration for saliency metrics. They u... | {
"cite_N": [
"@cite_5",
"@cite_26",
"@cite_34"
],
"mid": [
"2529173830",
"",
"2442293398"
],
"abstract": [
"Here we present DeepGaze II, a model that predicts where people look in images. The model uses the features from the VGG-19 deep neural network trained to identify objects i... |
1907.02336 | 2954329185 | Recent advances in deep learning have pushed the performances of visual saliency models way further than it has ever been. Numerous models in the literature present new ways to design neural networks, to arrange gaze pattern data, or to extract as much high and low-level image features as possible in order to create th... | With the application of deep learning techniques to computer vision domain, the choice of appropriate loss function for a task has become a critical aspect of the model training. The computer vision community have been successful in developing task tailored loss functions to improve a model, , encoding various geometri... | {
"cite_N": [
"@cite_35",
"@cite_22",
"@cite_8"
],
"mid": [
"2605111497",
"2950689937",
"2743473392"
],
"abstract": [
"Deep learning has shown to be effective for robust and real-time monocular image relocalisation. In particular, PoseNet [22] is a deep convolutional neural network... |
1907.02251 | 2954642157 | Consider collections @math and @math of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from @math that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity @math for @math . We consider the approxi... | Similarity search can be performed in several ways -- a popular technique is Locality Sensitive Hashing (LSH) @cite_4 which attempts to collect similar items in buckets in order to reduce the number of sets needed to check similarity against. We can for example use Broder's MinHash @cite_0 with locality sensitive hashi... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_4"
],
"mid": [
"",
"2574633002",
"2147717514"
],
"abstract": [
"",
"We consider the problem of approximate set similarity search under Braun-Blanquet similarity B(x, y) = |x ∩ y| max(|x|, |y|). The (b1, b2)-approximate Braun-Blanquet s... |
1907.02251 | 2954642157 | Consider collections @math and @math of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from @math that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity @math for @math . We consider the approxi... | The proof of Theorem will be based on a result by Rubinstein @cite_3 : Assuming the Orthogonal Vectors Conjecture, a @math -approximation to Bichromatic Closest Pair with Hamming, Edit or Euclidean distance requires time @math . The required approximation factor @math depends on @math , and tends to 1 as @math tends to... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2963964051"
],
"abstract": [
"We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is fals... |
1907.02251 | 2954642157 | Consider collections @math and @math of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from @math that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity @math for @math . We consider the approxi... | In order to handle smaller subconstant values of @math and @math we use a technique that we call squaring, which allows us to increase the gap in similarities between pairs with high Jaccard similarity and pairs with low Jaccard similarity by computing the cartesian product of a binary vector with itself. A similar tec... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2263882035"
],
"abstract": [
"Given a set of n d-dimensional Boolean vectors with the promise that the vectors are chosen uniformly at random with the exception of two vectors that have Pearson correlation coefficient ρ (Hamming distance dċ 1−ρf2), how quickly ... |
1907.02251 | 2954642157 | Consider collections @math and @math of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from @math that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity @math for @math . We consider the approxi... | Combining two simple reductions with the above squaring we show that for any @math , we can always find @math such that Bichromatic Closest Pair with Jaccard similarity cannot be solved in time @math for any pair @math when @math . Contrast this with the above LSH upper bound of @math for @math . We also know that ther... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2574633002"
],
"abstract": [
"We consider the problem of approximate set similarity search under Braun-Blanquet similarity B(x, y) = |x ∩ y| max(|x|, |y|). The (b1, b2)-approximate Braun-Blanquet similarity search problem is to preprocess a collection of sets P... |
1907.02364 | 2947492009 | By borrowing the wisdom of human in gaze following, we propose a two-stage solution for gaze point prediction of the target persons in a scene. Specifically, in the first stage, both head image and its position are fed into a gaze direction pathway to predict the gaze direction, and then multi-scale gaze direction fiel... | Previous work about gaze following paid attention to restricted scenes, which added some priors for specific applications. In @cite_30 , a face detector was employed to extract face, which was limited for the people looking away from the camera. @cite_19 detected whether people were looking at each other in a movie, wh... | {
"cite_N": [
"@cite_30",
"@cite_29",
"@cite_21",
"@cite_32",
"@cite_19",
"@cite_2",
"@cite_13"
],
"mid": [
"2047508432",
"2212494831",
"2776312359",
"1994463521",
"1971029019",
"1896788142",
""
],
"abstract": [
"We present a unified model for face d... |
1907.02364 | 2947492009 | By borrowing the wisdom of human in gaze following, we propose a two-stage solution for gaze point prediction of the target persons in a scene. Specifically, in the first stage, both head image and its position are fed into a gaze direction pathway to predict the gaze direction, and then multi-scale gaze direction fiel... | Eye tracking is strongly related to gaze following. Different from gaze following, eye tracking technology inferred which direction or which point on the screen one person was looking at @cite_0 . Previous work @cite_27 @cite_31 built the geometry model to infer the gaze point on the screen target. Recently, many appea... | {
"cite_N": [
"@cite_26",
"@cite_0",
"@cite_27",
"@cite_31",
"@cite_20"
],
"mid": [
"2952055246",
"2027879843",
"2130313210",
"2010854031",
"2778268008"
],
"abstract": [
"From scientific research to commercial applications, eye tracking is an important tool across m... |
1907.02364 | 2947492009 | By borrowing the wisdom of human in gaze following, we propose a two-stage solution for gaze point prediction of the target persons in a scene. Specifically, in the first stage, both head image and its position are fed into a gaze direction pathway to predict the gaze direction, and then multi-scale gaze direction fiel... | Saliency detection and gaze following are two different tasks @cite_13 @cite_21 even though they were closely related. Saliency detection predicts fixation map from observers out of the original images @cite_22 @cite_24 @cite_25 . Gaze following in image predicts the position that people in a scene were looking at. Pre... | {
"cite_N": [
"@cite_22",
"@cite_28",
"@cite_21",
"@cite_24",
"@cite_13",
"@cite_25",
"@cite_12",
"@cite_17"
],
"mid": [
"2144764737",
"1946606198",
"2776312359",
"1510835000",
"",
"2963985934",
"2128272608",
"2583180462"
],
"abstract": [
"Fi... |
1907.02110 | 2954384599 | Segmentation has been a major task in neuroimaging. A large number of automated methods have been developed for segmenting healthy and diseased brain tissues. In recent years, deep learning techniques have attracted a lot of attention as a result of their high accuracy in different segmentation problems. We present a n... | UNet architecture was introduced by @cite_1 . UNet has been an important advancement in the application of deep CNNs to the problem of biomedical image segmentation. CNNs have been initially used on classification problems by mapping input images to output class labels. However, in segmentation tasks, the desired outpu... | {
"cite_N": [
"@cite_1"
],
"mid": [
"1901129140"
],
"abstract": [
"There is large consent that successful training of deep networks requires many thousand annotated training samples. In this paper, we present a network and training strategy that relies on the strong use of data augmentation to use... |
1907.02110 | 2954384599 | Segmentation has been a major task in neuroimaging. A large number of automated methods have been developed for segmenting healthy and diseased brain tissues. In recent years, deep learning techniques have attracted a lot of attention as a result of their high accuracy in different segmentation problems. We present a n... | As noted by @cite_0 , when convolutional filters are arranged in different groups, the network can learn distinct features from each group, with low correlation between the learned features across groups. This was demonstrated in AlexNet, where the network consistently identified color-agnostic and color-specific featu... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2163605009"
],
"abstract": [
"We trained a large, deep convolutional neural network to classify the 1.2 million high-resolution images in the ImageNet LSVRC-2010 contest into the 1000 different classes. On the test data, we achieved top-1 and top-5 error rates ... |
1812.06329 | 2904942582 | While many approaches have been proposed to analyze the problem of matrix multiplication parallel computing, few of them address the problem on heterogeneous processor platforms. It still remains an open question on heterogeneous processor platforms to find the optimal schedule that balances the load within the heterog... | Approaches on homogeneous platforms. Homogeneous platforms assume that all the computing comunication resources and environment are identical. Matrix multiplication scheduling on homogeneous platforms have been extensively studied in @cite_9 - @cite_29 , among which, Canon introduces the first parallel algorithm on hom... | {
"cite_N": [
"@cite_26",
"@cite_8",
"@cite_9",
"@cite_29",
"@cite_21",
"@cite_24",
"@cite_23",
"@cite_13"
],
"mid": [
"2028045344",
"2082292996",
"",
"2075711817",
"2249672196",
"201315547",
"2483598939",
""
],
"abstract": [
"The sparse matr... |
1812.06329 | 2904942582 | While many approaches have been proposed to analyze the problem of matrix multiplication parallel computing, few of them address the problem on heterogeneous processor platforms. It still remains an open question on heterogeneous processor platforms to find the optimal schedule that balances the load within the heterog... | In summary, researchers have begun to realize the difficulty in finding the optimal that balance loads while minimize communication volume. Beaumont's work @cite_22 explicitly reveals that it is a NP-complete problem. Moreover, though alternative perspectives like have been proposed @cite_27 @cite_17 , those perspectiv... | {
"cite_N": [
"@cite_27",
"@cite_22",
"@cite_17"
],
"mid": [
"2160556361",
"2163674731",
"1560662781"
],
"abstract": [
"Parallel Matrix-Matrix Multiplication (MMM) is a fundamental part of the linear algebra libraries used by scientific applications on high performance computers. A... |
1812.06156 | 2952311206 | As of today, abuse is a pressing issue to participants and administrators of Online Social Networks (OSN). Abuse in Twitter can spawn from arguments generated for influencing outcomes of a political election, the use of bots to automatically spread misinformation, and generally speaking, activities that deny, disrupt, ... | To characterize abuse without considering the content of the communication, graph-based techniques have been proven useful for detecting and combating dishonest behavior @cite_22 and cyberbullying @cite_23 , as well as to detect fake accounts in OSN @cite_10 . However, they suffer from the fact that real-world social g... | {
"cite_N": [
"@cite_22",
"@cite_3",
"@cite_0",
"@cite_23",
"@cite_10"
],
"mid": [
"1546721273",
"2029749307",
"1992685726",
"84853486",
"2168508162"
],
"abstract": [
"Dishonest behaviors in on-line networks include the problems caused by those actions performed by ... |
1812.06156 | 2952311206 | As of today, abuse is a pressing issue to participants and administrators of Online Social Networks (OSN). Abuse in Twitter can spawn from arguments generated for influencing outcomes of a political election, the use of bots to automatically spread misinformation, and generally speaking, activities that deny, disrupt, ... | Firstly, previous datasets in this area are not yet released or in their infancy for verification of their applicability as abuse ground truth gold standard. The authors of @cite_14 claim to outperform deep learning techniques to detect hate speech, derogatory language and profanity. They compare their results with a p... | {
"cite_N": [
"@cite_14",
"@cite_12"
],
"mid": [
"2340954483",
"1071251684"
],
"abstract": [
"Detection of abusive language in user generated online content has become an issue of increasing importance in recent years. Most current commercial methods make use of blacklists and regular expr... |
1812.06156 | 2952311206 | As of today, abuse is a pressing issue to participants and administrators of Online Social Networks (OSN). Abuse in Twitter can spawn from arguments generated for influencing outcomes of a political election, the use of bots to automatically spread misinformation, and generally speaking, activities that deny, disrupt, ... | Finally, it is worth mentioning we in our feature set do not include sentiment analysis inputs as @cite_6 did; simply because we are interested in complex types of abuse that require more than just textual content analysis. Additionally, we have noticed that while some words or expressions may seem abusive at first (e.... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2951392332"
],
"abstract": [
"Sentiment in social media is increasingly considered as an important resource for customer segmentation, market understanding, and tackling other socio-economic issues. However, sentiment in social media is difficult to measure sin... |
1812.06407 | 2904185608 | Visual Tracking is a complex problem due to unconstrained appearance variations and dynamic environment. Extraction of complementary information from the object environment via multiple features and adaption to the target's appearance variations are the key problems of this work. To this end, we propose a robust object... | Mostly, generative models represent target's appearance using foreground information. In this direction, many sparse based methods @cite_18 @cite_31 @cite_3 were proposed. In @cite_18 , authors proposed weighted local sparse representation to measure the importance of each patch. The adaptive template update strategy c... | {
"cite_N": [
"@cite_18",
"@cite_31",
"@cite_15",
"@cite_48",
"@cite_3",
"@cite_50",
"@cite_47"
],
"mid": [
"2803629456",
"",
"2509359898",
"2809516743",
"",
"2786383677",
"2732089612"
],
"abstract": [
"Sparse representation has been widely exploited... |
1812.06407 | 2904185608 | Visual Tracking is a complex problem due to unconstrained appearance variations and dynamic environment. Extraction of complementary information from the object environment via multiple features and adaption to the target's appearance variations are the key problems of this work. To this end, we propose a robust object... | Recently, many deep learning based trackers @cite_13 @cite_33 @cite_21 were proposed pertaining to their favorable performance to model the target's appearance. In @cite_13 , authors considered the problem of visual tracking as a trajectory estimation task using convolutional and recurrent units. A large training data ... | {
"cite_N": [
"@cite_38",
"@cite_33",
"@cite_21",
"@cite_43",
"@cite_2",
"@cite_46",
"@cite_13"
],
"mid": [
"2514029627",
"",
"",
"2579238278",
"2790441826",
"2800990595",
"2617855130"
],
"abstract": [
"Deep neural network-based methods have recently... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | Hysteretic Q-Learning (HQL) @cite_20 attempts to mitigate this issue by injecting overestimation into the value estimation by reducing the learning rate for negative updates. Two learning rates @math and @math , named increase rate and decrease rate, are respectively used for updating overestimated and underestimated T... | {
"cite_N": [
"@cite_20"
],
"mid": [
"2108892923"
],
"abstract": [
"Multi-agent systems (MAS) are a field of study of growing interest in a variety of domains such as robotics or distributed controls. The article focuses on decentralized reinforcement learning (RL) in cooperative MAS, where a team... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | Hysteretic Deep Q-Network (HDQN) @cite_4 applies HQL to DQN. Using DQN as basis, TD error is given by @math . For simplicity, HDQN first sets a base learning rate @math suitable for the network (e.g. @math ), and scales the learning rate into @math and @math . In practice, HDQN usually fixes @math at @math and tunes @m... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2951896791"
],
"abstract": [
"Many real-world tasks involve multiple agents with partial observability and limited communication. Learning is challenging in these settings due to local viewpoints of agents, which perceive the world as non-stationary due to conc... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | In order to reason under partial observability, Hysteretic Deep Recurrent Q-Network (HDRQN), introduced by , utilizes a recurrent layer (LSTM) and is trained using experience traces sampled from an experience buffer. Decentralized buffers (called CERTs) featuring sample synchronization was adopted to stabilize training... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2255045308"
],
"abstract": [
"We propose deep distributed recurrent Q-networks (DDRQN), which enable teams of agents to learn to solve communication-based coordination tasks. In these tasks, the agents are not given any pre-designed communication protocol. Ther... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | Lenient Learning @cite_26 schedules the decrease of leniency applied to individual state-action pairs using decaying temperatures, where leniency is the probability of ignoring a negative @math value update. | {
"cite_N": [
"@cite_26"
],
"mid": [
"2108449787"
],
"abstract": [
"In concurrent learning algorithms, an agent's perception of the joint search space depends on the actions currently chosen by the other agents. These perceptions change as each agent's action selection is influenced by its learnin... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | IQN @cite_1 is a single-agent Deep RL method which we extend to multi-agent partially observable settings. As a distributional RL method, quantile networks represent a distribution over returns, denoted @math , where @math , by estimating the inverse c.d.f. of @math , denoted @math . Implicit Quantile Networks estimate... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2803308811"
],
"abstract": [
"In this work, we build on recent advances in distributional reinforcement learning to give a generally applicable, flexible, and state-of-the-art distributional variant of DQN. We achieve this by using quantile regression to approx... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | The quantile regression loss @cite_23 for estimating quantile at @math and error @math is defined using Huber loss @math with threshold @math which weighs overestimation by @math and underestimation by @math , @math is used for linear loss. | {
"cite_N": [
"@cite_23"
],
"mid": [
"1607777023"
],
"abstract": [
"This specification discloses a reduction gear transmission comprising an input shaft carrying a pinion, a satellite carrier having a gear meshing with the pinion, a composite satellite gear on said carrier and including two sectio... |
1812.06319 | 2912563296 | Recent successes of value-based multi-agent deep reinforcement learning employ optimism by limiting underestimation updates of value function estimator, through carefully controlled learning rate (, 2017) or reduced update probability (, 2018). To achieve full cooperation when learning independently, an agent must esti... | Distributional learning have long been considered a promising approach in approximate reinforcement learning due to reduced chattering @cite_14 @cite_21 . Furthermore, distributional RL methods have shown, in single agent settings, robustness to hyperparameter variation and to have superior sample complexity and perfor... | {
"cite_N": [
"@cite_14",
"@cite_21",
"@cite_3"
],
"mid": [
"1547105496",
"1575592356",
"2798705390"
],
"abstract": [
"The success of reinforcement learning in practical problems depends on the ability to combine function approximation with temporal difference methods such as value... |
1812.06269 | 2904040126 | The pull-based development process has become prevalent on platforms such as GitHub as a form of distributed software development. Potential contributors can create and submit a set of changes to a software project through pull requests. These changes can be accepted, discussed or rejected by the maintainers of the sof... | Gousios and Zaidman proposed a PR dataset @cite_9 including 900 projects and 350,000 PRs extracted using GHTorrent. Through a mixed-method analysis of 291 GitHub projects, @cite_3 established that the PR-based development approach is used as frequently as the shared repository approach on GitHub . They observed that mo... | {
"cite_N": [
"@cite_9",
"@cite_3"
],
"mid": [
"2125854594",
"2139092060"
],
"abstract": [
"Pull requests form a new method for collaborating in distributed software development. To study the pull request distributed development model, we constructed a dataset of almost 900 projects and 35... |
1812.06269 | 2904040126 | The pull-based development process has become prevalent on platforms such as GitHub as a form of distributed software development. Potential contributors can create and submit a set of changes to a software project through pull requests. These changes can be accepted, discussed or rejected by the maintainers of the sof... | @cite_7 studied the factors that contribute to latency in PR reviews, defining this latency as the time interval between pull request creation and closing date''. They found that PR latency is mainly affected by process-related factors such as whether a PR was assigned to a specific reviewer or not. They also found tha... | {
"cite_N": [
"@cite_7"
],
"mid": [
"1992105838"
],
"abstract": [
"The pull-based development model, enabled by git and popularised by collaborative coding platforms like Bit Bucket, Gitorius, and GitHub, is widely used in distributed software teams. While this model lowers the barrier to entry fo... |
1812.06269 | 2904040126 | The pull-based development process has become prevalent on platforms such as GitHub as a form of distributed software development. Potential contributors can create and submit a set of changes to a software project through pull requests. These changes can be accepted, discussed or rejected by the maintainers of the sof... | Rahman and Roy @cite_15 categorised the technical issues discussed in PR comments and analysed information about projects and developers to obtain insights into PR acceptance or rejection. They discovered that the rate of PR rejection is highly correlated to the programming language used (e.g., Java PRs are more freque... | {
"cite_N": [
"@cite_15"
],
"mid": [
"1994598608"
],
"abstract": [
"Given the increasing number of unsuccessful pull requests in GitHub projects, insights into the success and failure of these requests are essential for the developers. In this paper, we provide a comparative study between successf... |
1812.06384 | 2951389634 | Text effects transfer technology automatically makes the text dramatically more impressive. However, previous style transfer methods either study the model for general style, which cannot handle the highly-structured text effects along the glyph, or require manual design of subtle matching criteria for text effects. In... | Style transfer is the task of migrating styles from an example style image to a content image, which is closely related to texture synthesis. The pioneering work of @cite_21 demonstrates the powerful representation ability of convolutional neural networks to model textures. Gatys formulated textures as the correlation ... | {
"cite_N": [
"@cite_18",
"@cite_9",
"@cite_21",
"@cite_0",
"@cite_24",
"@cite_23",
"@cite_13"
],
"mid": [
"2951745349",
"2952226636",
"2475287302",
"2161208721",
"2952767162",
"2950078543",
"2950689937"
],
"abstract": [
"This paper proposes Markovia... |
1812.06384 | 2951389634 | Text effects transfer technology automatically makes the text dramatically more impressive. However, previous style transfer methods either study the model for general style, which cannot handle the highly-structured text effects along the glyph, or require manual design of subtle matching criteria for text effects. In... | Image-to-image translation is a domain transfer problem, where the input and output are both images. Driven by the great advances of GAN, once been introduced by @cite_5 , it has been widely studied. Recent work @cite_8 has been able to generate very high-resolution photo-realistic images from semantic label maps. Zhu ... | {
"cite_N": [
"@cite_5",
"@cite_8"
],
"mid": [
"2552465644",
"2772222351"
],
"abstract": [
"We investigate conditional adversarial networks as a general-purpose solution to image-to-image translation problems. These networks not only learn the mapping from input image to output image, but ... |
1812.06384 | 2951389634 | Text effects transfer technology automatically makes the text dramatically more impressive. However, previous style transfer methods either study the model for general style, which cannot handle the highly-structured text effects along the glyph, or require manual design of subtle matching criteria for text effects. In... | Text is one of the most important visual elements in our daily life and there is some work on style transfer specific to the text. Taking advantage of the accessibility of abundant font images, many works @cite_25 @cite_16 @cite_20 trained neural networks to learn stroke styles for font transfer. However, another type ... | {
"cite_N": [
"@cite_16",
"@cite_10",
"@cite_25",
"@cite_20"
],
"mid": [
"2780436321",
"2558128964",
"2559635221",
"2770449959"
],
"abstract": [
"Automatically writing stylized Chinese characters is an attractive yet challenging task due to its wide applicabilities. In this... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Mutation testing is an old concept which has seen many contributions over years. Jia and Harman propose a survey regarding this topic @cite_13 . In this section, we focus on the work that is related to ours. The most related work has already been discussed in . | {
"cite_N": [
"@cite_13"
],
"mid": [
"2135841285"
],
"abstract": [
"Mutation Testing is a fault-based software testing technique that has been widely studied for over three decades. The literature on Mutation Testing has contributed a set of approaches, tools, developments, and empirical results. ... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Strug and Strug @cite_19 use control flow graphs and classification for detecting similar mutants. Their approach is intended to reduce the number of mutants considered when doing mutation testing. We use these tools for change impact analysis. | {
"cite_N": [
"@cite_19"
],
"mid": [
"11644230"
],
"abstract": [
"This paper deals with an approach based on the similarity of mutants. This similarity is used to reduce the number of mutants to be executed. In order to calculate such a similarity among mutants their structure is used. Each mutant... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Do and Rothermel @cite_17 describe a protocol to study test case prioritization techniques based on mutation. Their protocol and ours share the same idea, that of using test cases to determine which test cases are impacted by the change. However, we have a different goal: they study test case prioritization whereas we ... | {
"cite_N": [
"@cite_17"
],
"mid": [
"2101780873"
],
"abstract": [
"Regression testing is an important part of software maintenance, but it can also be very expensive. To reduce this expense, software testers may prioritize their test cases so that those that are more important are run earlier in ... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Change impact analysis has been studied for many years and many algorithms have been proposed. Many categorizations of such algorithms exist. Bohner and Arnold proposed two types of analysis: dependency analysis and traceability analysis @cite_24 . The former analyzes the source code of the program at a relatively fine... | {
"cite_N": [
"@cite_24"
],
"mid": [
"1548254758"
],
"abstract": [
"From the Publisher: As software systems become increasingly large and complex, the need increases to predict and control the effects of software changes. Software Change Impact Analysis captures the latest information on the scien... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Bohner and Arnold @cite_24 and Li al @cite_1 list the notable graph-based approaches. Different types or variants of software graphs have been used to perform change impact analysis, a common example is the program dependence graphs ( PDG) @cite_11 . In the present paper, we focus on the call graph. | {
"cite_N": [
"@cite_24",
"@cite_1",
"@cite_11"
],
"mid": [
"1548254758",
"2111403266",
"2169063818"
],
"abstract": [
"From the Publisher: As software systems become increasingly large and complex, the need increases to predict and control the effects of software changes. Software ... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Walker al @cite_21 propose an impact analysis tool named TRE. Their approach uses conditional probability dependency graphs in which a node represents a class, there is an edge from a node class A to node B if A contains anything resolving to B. The conditional probabilities are estimated from data extracted from the C... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2156555135"
],
"abstract": [
"An evolutionary development approach is increasingly commonplace in industry but presents increased difficulties in risk management, for both technical and organizational reasons. In this context, technical risk is the product of ... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Zimmermann and Nagappan @cite_9 propose to use dependency graphs to estimate the most critical parts of a piece of software. Their approach uses network measures and complexity metrics to make the predictions. They assess their findings using some popular though proprietary software, where they are able to determine pa... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2135198476"
],
"abstract": [
"In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience backed by code complexity metrics. But often dependenci... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Antoniol al @cite_30 also address impact analysis. However, they consider a slightly different problem setting, because they take as input a bug report or a modification request and not a single source code element as we do. Their approach is less accurate as it takes into consideration documentation ( bug reports) for... | {
"cite_N": [
"@cite_30",
"@cite_7"
],
"mid": [
"2148069233",
"2104074028"
],
"abstract": [
"This paper deals with impact analysis and proposes a method based on information retrieval techniques to trace the text of a maintenance request onto the set of system components initially affected... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | A classical paper by Moritoni and Winkler @cite_26 also studies error propagation but they do it with the goal of having a perfect aproximation. By contrast, we perform approximations with the goal of exploring other trade-offs between precision and recall for impact prediction. Their work is more theoretical in essenc... | {
"cite_N": [
"@cite_26"
],
"mid": [
"2167881892"
],
"abstract": [
"It is pointed out that the incremental cost of a change to a program is often disproportionately high because of inadequate means of determining the semantic effects of the change. A practical logical technique for finding the sem... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Michael and Jones @cite_31 alter variables during the program's execution in order to study how this affects ( perturbates'' in their phrasing) the software. They focus on data-state perturbation, where we have a more global look of the software. Considering only variable perturbation does not take into consideration a... | {
"cite_N": [
"@cite_31"
],
"mid": [
"1928546442"
],
"abstract": [
"This paper presents an empirical study of an important aspect of software defect behavior: the propagation of data-state errors. A data-state error occurs when a fault is executed and affects a program's data-state, and it is said... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Challet and Lombardoni @cite_28 propose a theoretical reflection about impact analysis using graphs. However, they do not evaluate the validity of their bug basins'' as we do in this paper. | {
"cite_N": [
"@cite_28"
],
"mid": [
"1955700867"
],
"abstract": [
"We address the issue of how software components are affected by the failure of one of them, and the inverse problem of locating the faulty component. Because of the functional form of the incoming link distribution of software dep... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Robillard and Murphy @cite_32 introduce concern graphs'' for reasoning on the implementation of features. This kind of graphs may be assessed with the protocol we have presented here. | {
"cite_N": [
"@cite_32"
],
"mid": [
"2118944299"
],
"abstract": [
"Many maintenance tasks address concerns, or features, that are not well modularized in the source code comprising a system. Existing approaches available to help software developers locate and manage scattered concerns use a repre... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Binkley al @cite_6 @cite_18 propose observation-based slicing ( ORBS). They propose to slice a piece of software in a delete--execute--observe'' paradigm. In this paradigm, the effects of a change are observed after executing the code ( by running test cases). This paradigm is comparable to our approach where we mutate... | {
"cite_N": [
"@cite_18",
"@cite_6"
],
"mid": [
"2150038380",
"2167153801"
],
"abstract": [
"Observation-based slicing is a recently-introduced, language-independent slicing technique based on the dependencies observable from program behaviour. Due to the well-known limits of dynamic analy... |
1812.06286 | 2503567466 | In software engineering, impact analysis consists in predicting the software elements (e.g. modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose a framework to predict error propagation. Based on 10 open-sou... | Ren al @cite_15 propose a tool entitled Chianti for change impact prediction as an Eclipse plug-in. However, beyond the common idea of reasoning about impacts, they target a completely different problem: we aim at finding sensitive methods, while they aim at finding the change responsible for a failure ( a bug-inducing... | {
"cite_N": [
"@cite_15"
],
"mid": [
"2038899190"
],
"abstract": [
"This paper reports on the design and implementation of Chianti, a change impact analysis tool for Java that is implemented in the context of the Eclipse environment. Chianti analyzes two versions of an application and decomposes t... |
1812.06162 | 2903697572 | In an increasing number of domains it has been demonstrated that deep learning models can be trained using relatively large batch sizes without sacrificing data efficiency. However the limits of this massive data parallelism seem to differ from domain to domain, ranging from batches of tens of thousands in ImageNet to ... | Recent papers have probed the limits of large batch training empirically, especially for ImageNet @cite_24 @cite_26 @cite_9 , in some cases using layer-wise adaptive learning-rates @cite_21 . More recent work has demonstrated that large batch training can also be applied to RL @cite_56 @cite_44 @cite_18 @cite_11 . The ... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_26",
"@cite_36",
"@cite_9",
"@cite_21",
"@cite_55",
"@cite_56",
"@cite_24",
"@cite_44",
"@cite_11"
],
"mid": [
"2900167092",
"2793035934",
"2755682530",
"",
"",
"2757910899",
"",
"",
"27698... |
1812.06162 | 2903697572 | In an increasing number of domains it has been demonstrated that deep learning models can be trained using relatively large batch sizes without sacrificing data efficiency. However the limits of this massive data parallelism seem to differ from domain to domain, ranging from batches of tens of thousands in ImageNet to ... | Other recent work has explored the impact of gradient noise on optimization speed and batch size selection. @cite_16 connected gradient noise and the locally optimal step size to identify an adaptive learning rate. @cite_19 derived a sampling distribution for SGD, motivating our definition of temperature'. @cite_59 con... | {
"cite_N": [
"@cite_7",
"@cite_42",
"@cite_58",
"@cite_19",
"@cite_59",
"@cite_16",
"@cite_25"
],
"mid": [
"2773689216",
"",
"2593634001",
"2962915600",
"2765733029",
"2120420045",
"2766164908"
],
"abstract": [
"Training deep neural networks with St... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.