aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1908.04933 | 2968171141 | Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data sets. As a solution for this problem we present, given a text of length @math whose characters a... | Re-Pair Computation Re-Pair is a grammar proposed by , who gave an algorithm computing it in expected linear time with @math words of working space, where @math is the number of non-terminals (produced by Re-Pair). This space requirement got improved by , who presented a linear time algorithm taking @math words on top ... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2610200252"
],
"abstract": [
"Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses @math words on top of ... |
1908.05004 | 2967978532 | The subject of this report is the re-identification of individuals in the Myki public transport dataset released as part of the Melbourne Datathon 2018. We demonstrate the ease with which we were able to re-identify ourselves, our co-travellers, and complete strangers; our analysis raises concerns about the nature and ... | A common theme is that a remarkably small number of distinct points of information are necessary to make an individual unique---whenever one person's information is linked together into a detailed record of their events, a few known events are usually enough to identify them. De Montjoye @cite_5 showed that 80 were uni... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2115240023"
],
"abstract": [
"We study fifteen months of human mobility data for one and a half million individuals and find that human mobility traces are highly unique. In fact, in a dataset where the location of an individual is specified hourly, and with a ... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | In @cite_2 , we considered the problem of data aggregation and dissemination in IoT networks serving, for example, monitoring, sensing, or machine control applications. A key aspect of the IoT that differentiates it from classical wireless sensor networks (WSNs) is its heterogeneity. We therefore considered cases where... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2786403027"
],
"abstract": [
"Established approaches to data aggregation in wireless sensor networks (WSNs) do not cover the variety of new use cases developing with the advent of the Internet of Things (IoT). In particular, the current push toward fog computin... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | Network lifetime has been studied extensively in the context of WSNs since the early 2000's. A full review of the literature in this area is therefore beyond the scope of this paper; a recent survey can be found in @cite_20 . We will instead focus on the recent work that is most relevant to the current paper. | {
"cite_N": [
"@cite_20"
],
"mid": [
"2571303926"
],
"abstract": [
"Emerging technologies, such as the Internet of things, smart applications, smart grids and machine-to-machine networks stimulate the deployment of autonomous, selfconfiguring, large-scale wireless sensor networks (WSNs). Efficient... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | There are numerous different definitions of network lifetime adopted in the literature @cite_20 . Some of these include that the network lifetime expires at the time instant a certain number (possibly as low as one) or proportion of nodes deplete their batteries, when the first data collection failure occurs, or when t... | {
"cite_N": [
"@cite_20"
],
"mid": [
"2571303926"
],
"abstract": [
"Emerging technologies, such as the Internet of things, smart applications, smart grids and machine-to-machine networks stimulate the deployment of autonomous, selfconfiguring, large-scale wireless sensor networks (WSNs). Efficient... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | However, a problem with many of these definitions is that they are not application-centric. In practice, whether or not a network is functional depends on the specific application or applications which it serves. Some applications may require all nodes in the network to have remaining energy, while others may continue ... | {
"cite_N": [
"@cite_22"
],
"mid": [
"2518827842"
],
"abstract": [
"Network is dynamic and requires update in the operation. However, many confusions and problems can be caused by careless schedule in the update process. Although the problem has been investigated for many years in traditional netw... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | This is the approach we adopt in this paper, and we define valid configurations based on the demands of the applications present in the network along with the roles the various nodes play in these demands. As such, we will adopt a general definition of the network lifetime as the total time in which the network is oper... | {
"cite_N": [
"@cite_15"
],
"mid": [
"2160450532"
],
"abstract": [
"A critical aspect of applications with wireless sensor networks is network lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to a processing node. Sensing and communication... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | Some work has been performed regarding network lifetime for networks with heterogeneous nodes, but only in a quite limited sense. For example, there is work based on the LEACH clustering protocol @cite_16 @cite_18 , where each node may be either an ordinary sensor node or a cluster head at different times. Examples of ... | {
"cite_N": [
"@cite_13",
"@cite_18",
"@cite_4",
"@cite_7",
"@cite_16",
"@cite_10",
"@cite_12",
"@cite_17"
],
"mid": [
"2909223649",
"",
"2050266688",
"2913938994",
"2106335692",
"2061879708",
"2800055840",
"2219395474"
],
"abstract": [
"The ... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | Some work in the literature also considers in-network processing. In @cite_8 , data aggregation trees are constructed and scheduled, and the network can be reconfigured, in that different trees can be used in different time periods. This work again uses the traditional WSN model of many homogeneous sensor nodes all sen... | {
"cite_N": [
"@cite_23",
"@cite_8"
],
"mid": [
"2811107380",
"2945696784"
],
"abstract": [
"Maintaining critical data access latency requirements and ensuring efficient energy consumption on the field devices are two important challenges of Industry 4.0. The traditional, centralized indus... |
1908.05055 | 2968345977 | In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take... | A few general frameworks for maximizing network lifetime have also been developed. In @cite_25 , the focus is on network deployment, specifically the initial energy allocated to each node. Once again nodes are homogeneous, with all nodes collecting data and transmitting it to their neighbors, and the definition of netw... | {
"cite_N": [
"@cite_1",
"@cite_25"
],
"mid": [
"2099641228",
"2138122413"
],
"abstract": [
"We derive a general formula for the lifetime-of wireless sensor networks which holds independently of the underlying network model including network architecture and protocol, data collection initi... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | To preserve spatial information within tensors in the dimensionality reduction methods, @cite_17 introduces the Tucker LPP (TLPP) which is LPP based on the Tucker decomposition to analyze the high-dimensional data and has the exponential increase in storage complexity as the number of modes increases. | {
"cite_N": [
"@cite_17"
],
"mid": [
"16346066"
],
"abstract": [
"Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various machine learning and pattern classification tasks. Among the methods proposed are Neighborhood Preserv... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | The other existing dimensionality reduction method which embeds the TT subspace, is the tensor train neighbourhood preserving embedding (TTNPE) @cite_2 . TTNPE solves the exponential explosion on the complexity with the number of modes increasing. However, its robustness to the extreme outliers remains as a concern. Th... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2789880577"
],
"abstract": [
"Tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing large-scale multidimensional data via a set of network of low-rank tensors. Associated with such a construct... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | We denote the left unfolding operation @cite_2 of @math as the matrix @math where the last mode of the tensor becomes the column indices of the left unfolding matrix and the rest of the modes are the row indices. Similarly, for the right unfolding operation, denoting it as @math . Also, the vectorization of a tensor is... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2789880577"
],
"abstract": [
"Tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing large-scale multidimensional data via a set of network of low-rank tensors. Associated with such a construct... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | The tensor-train (TT) decomposition is designed for large-scale data analysis @cite_3 . It can achieve a simpler implementation than the tree-type decomposition algorithms @cite_18 which are developed to reduce the storage complexity and avoid the local minima. | {
"cite_N": [
"@cite_18",
"@cite_3"
],
"mid": [
"1995406764",
"1993482030"
],
"abstract": [
"For @math -dimensional tensors with possibly large @math , an hierarchical data structure, called the Tree-Tucker format, is presented as an alternative to the canonical decomposition. It has asymp... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | For most of the applications, in order to achieve the computational efficiency and be less information redundant, the researchers often restrict the tensor ranks to be smaller than the size of their corresponding tensor mode, i.e., @math for @math @cite_2 . | {
"cite_N": [
"@cite_2"
],
"mid": [
"2789880577"
],
"abstract": [
"Tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing large-scale multidimensional data via a set of network of low-rank tensors. Associated with such a construct... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | Given a set of vectorial training data @math and an affinity matrix of locality similarity @math , LPP intends to seek for a linear projection @math from @math to @math such that the following optimization problem is solved to minimize the locality preserving criterion set as the objective function. The widely used aff... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2154872931"
],
"abstract": [
"Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projective maps that arise by solving a variational problem ... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | LPP is a classical dimensionality reduction method and has been applied in many real cases, for example, computer vision @cite_8 . It captures the local information among the data points and reduces more sensitivity to the outliers than PCA. However, we do observe the following shortcomings of LPP: LPP is designed for ... | {
"cite_N": [
"@cite_17",
"@cite_8"
],
"mid": [
"16346066",
"2089035607"
],
"abstract": [
"Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various machine learning and pattern classification tasks. Among the methods ... |
1908.04924 | 2967111226 | Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens... | The TT decomposition with a smaller storage complexity at @math has been recently applied in the tensor train neighborhood preserving embedding (TTNPE) @cite_2 @cite_0 . Nevertheless, the actual algorithm in TTNPE is only implemented as a TT approximation to the pseudo PCA. To the best of our knowledge, there is no exi... | {
"cite_N": [
"@cite_0",
"@cite_2"
],
"mid": [
"2963465654",
"2789880577"
],
"abstract": [
"In this paper, we propose a tensor train neighborhood preserving embedding (TTNPE) to embed multidimensional tensor data into low-dimensional tensor subspace. Novel approaches to solve the optimizat... |
1908.05085 | 2968619508 | The use of fingerprinting localization techniques in outdoor IoT settings has started to gain popularity over the recent years. Communication signals of Low Power Wide Area Networks (LPWAN), such as LoRaWAN, are used to estimate the location of low power mobile devices. In this study, a publicly available dataset of Lo... | Fingerprinting has been a broadly studied method of indoor positioning @cite_12 . More particularly, RSSI has been the main type of signal that is used @cite_12 . It has been only a few years since the transfering of fingerprinting techniques in the outdoor world, and in particular in LPWAN settings. In a recent study,... | {
"cite_N": [
"@cite_1",
"@cite_12"
],
"mid": [
"2791401550",
"2607595839"
],
"abstract": [
"Because of the increasing relevance of the Internet of Things and location-based services, researchers are evaluating wireless positioning techniques, such as fingerprinting, on Low Power Wide Area... |
1908.05085 | 2968619508 | The use of fingerprinting localization techniques in outdoor IoT settings has started to gain popularity over the recent years. Communication signals of Low Power Wide Area Networks (LPWAN), such as LoRaWAN, are used to estimate the location of low power mobile devices. In this study, a publicly available dataset of Lo... | @cite_0 , have evaluated experimentally RRS and TDoA ranging positioning methods using a LoRaWAN network, reporting median errors of 1250 and 200 meters for RRS and TDoA respectively. Other works @cite_2 , @cite_5 , have focused on rather specific settings over which they evaluate positioning methods. These works @cite... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_2"
],
"mid": [
"2901105864",
"2902596366",
"2900294995"
],
"abstract": [
"This paper experimentally compares the positioning accuracy of TDoA-based and RSS-based localization in a public outdoor LoRa network in the Netherlands. The perform... |
1908.05085 | 2968619508 | The use of fingerprinting localization techniques in outdoor IoT settings has started to gain popularity over the recent years. Communication signals of Low Power Wide Area Networks (LPWAN), such as LoRaWAN, are used to estimate the location of low power mobile devices. In this study, a publicly available dataset of Lo... | General purpose fingerprinting methods in LPWAN settings have been presented and discussed in recent works @cite_6 , @cite_7 . @cite_6 have utilized a Sigfox dataset to apply a kNN algorithm, and selected among a variety of distance metrics and data representations the best performing ones, resulting with a mean positi... | {
"cite_N": [
"@cite_7",
"@cite_6"
],
"mid": [
"2968588162",
"2901188462"
],
"abstract": [
"Fingerprinting techniques, which are a common method for indoor localization, have been recently applied with success into outdoor settings. Particularly, the communication signals of Low Power Wide... |
1908.04465 | 2967650664 | We explore the challenges and opportunities of shifting industrial control software from dedicated hardware to bare-met al servers or cloud computing platforms using off the shelf technologies. In particular, we demonstrate that executing time-critical applications on cloud platforms is viable based on a series of dedi... | Containerizing control applications has been discussed in recent literature. @cite_6 , for instance, presented the concept of containerization of full control applications as a means to decouple the hardware and software life-cycles of an industrial automation system. Due to the performance overhead in hardware virtual... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2487718634"
],
"abstract": [
"Virtualization is entering the world of real-time embedded systems. Industrial automation systems, in particular, can benefit from what virtualization has to offer: flexible consolidation of applications on different hardware types... |
1908.04465 | 2967650664 | We explore the challenges and opportunities of shifting industrial control software from dedicated hardware to bare-met al servers or cloud computing platforms using off the shelf technologies. In particular, we demonstrate that executing time-critical applications on cloud platforms is viable based on a series of dedi... | Goldschmidt and Hauk-Stattelmann in @cite_9 perform benchmark tests on modularized industrial Programmable Logic Controller (PLC) applications. This analysis analyzes the impact of container-based virtualization on real-time constraints. As there is no solution for legacy code migration of PLCs, the migration to applic... | {
"cite_N": [
"@cite_28",
"@cite_9"
],
"mid": [
"2792724737",
"2534821673"
],
"abstract": [
"Abstract Cyber-physical systems and the Internet-of-Things are getting more and more traction in different application areas. Boosted by initiatives such as Industrie 4.0 in Germany or the Industri... |
1908.04465 | 2967650664 | We explore the challenges and opportunities of shifting industrial control software from dedicated hardware to bare-met al servers or cloud computing platforms using off the shelf technologies. In particular, we demonstrate that executing time-critical applications on cloud platforms is viable based on a series of dedi... | @cite_0 address architectural details not discussed in @cite_9 and @cite_28 . These additions include the definite run-time environment and how deterministic communication of containers and field devices may be achieved in a novel container-based architecture. They proposed a Linux-based solution as host operating syst... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_28"
],
"mid": [
"2885043734",
"2534821673",
"2792724737"
],
"abstract": [
"Internet-of-Things and cyber-pyhsical systems are gaining ongoing importance in the field of industrial automation. At the same time, the production becomes more an... |
1908.04574 | 2968985217 | The domain name resolution into IP addresses can significantly delay connection establishments on the web. Moreover, the common use of recursive DNS resolvers presents a privacy risk as they can closely monitor the user's browsing activities. In this paper, we present a novel HTTP response header allowing web server to... | The DNS Anonymity Service combines a broadcast mechanism for popular DNS records with an anonymity network to conduct additional DNS lookups @cite_15 . Unlike our proposal, the DNS Anonymity Service causes additional network traffic for downloading the broadcasted DNS records and suffers additional network latency when... | {
"cite_N": [
"@cite_15"
],
"mid": [
"37081517"
],
"abstract": [
"We propose a dedicated DNS Anonymity Service which protects users' privacy. The design consists of two building blocks: a broadcast scheme for the distribution of a \"top list\" of DNS hostnames, and low-latency Mixes for requesting... |
1908.04574 | 2968985217 | The domain name resolution into IP addresses can significantly delay connection establishments on the web. Moreover, the common use of recursive DNS resolvers presents a privacy risk as they can closely monitor the user's browsing activities. In this paper, we present a novel HTTP response header allowing web server to... | DNS prefetching describes a popular performance optimization where browsers start resolving the hostname of hyperlinks before the user clicks on them. However, privacy research on this mechanism indicates severe privacy problems. For example, it was shown that the recursive resolver could even infer the search terms th... | {
"cite_N": [
"@cite_6"
],
"mid": [
"1512251782"
],
"abstract": [
"A recent trend in optimizing Internet browsing speed is to optimistically pre-resolve (or prefetch) DNS resolutions. While the practical benefits of doing so are still being debated, this paper attempts to raise awareness that curr... |
1908.04727 | 2967991851 | A in the unit @math -cube is a set @math such that for every @math and @math in @math we either have @math for all @math , or @math for all @math . We consider subsets, @math , of the unit @math -cube @math that satisfy [ card (A C) k, , for all chains , C [0,1]^n , , ] where @math is a fixed positive integer. We refer... | When @math this conjecture is clearly true, and when @math it is observed in @cite_0 that the validity of Conjecture is an immediate consequence of the following, well-known, result. Recall that a singular function @math is a strictly decreasing function whose derivative equals zero almost everywhere. | {
"cite_N": [
"@cite_0"
],
"mid": [
"2903599423"
],
"abstract": [
"A set @math is called an antichain (resp. antichain) if it does not contain two distinct elements @math and @math satisfying @math (resp. @math ) for all @math . We show that the Hausdorff dimension of a weak antichain @math in the... |
1908.04090 | 2967417443 | Although many tools have been presented in the research literature of software visualization, there is little evidence of their adoption. To choose a suitable visualization tool, practitioners need to analyze various characteristics of tools such as their supported software concerns and level of maturity. Indeed, some ... | Some studies examine software visualization tools, in particular, to create guidelines for designing and evaluating software visualizations. For example, Storey al @cite_52 examine 12 software visualization tools and propose a framework to evaluate software visualizations based on intent, information, presentation, int... | {
"cite_N": [
"@cite_52",
"@cite_59",
"@cite_6"
],
"mid": [
"2067172306",
"2014707001",
"2147787175"
],
"abstract": [
"This paper proposes a framework for describing, comparing and understanding visualization tools that provide awareness of human activities in software development.... |
1908.04090 | 2967417443 | Although many tools have been presented in the research literature of software visualization, there is little evidence of their adoption. To choose a suitable visualization tool, practitioners need to analyze various characteristics of tools such as their supported software concerns and level of maturity. Indeed, some ... | Some other studies present taxonomies that characterize software visualization tools. Myers @cite_14 classifies software visualization tools based on whether they focus on code, data, or algorithms; and whether they are implemented in a static or dynamic fashion. Price al @cite_24 present a taxonomy of software visuali... | {
"cite_N": [
"@cite_14",
"@cite_62",
"@cite_54",
"@cite_24",
"@cite_11"
],
"mid": [
"2065131671",
"2163225273",
"2029863192",
"2070921605",
"2794606420"
],
"abstract": [
"The Garnet research project, which is creating a set of tools to aid the design and implementa... |
1908.04008 | 2967406324 | Batch Normalization (BN) (Ioffe and Szegedy 2015) normalizes the features of an input image via statistics of a batch of images and this batch information is considered as batch noise that will be brought to the features of an instance by BN. We offer a point of view that self-attention mechanism can help regulate the ... | The normalization layer is an important component of a deep network. Multiple normalization methods have been proposed for different tasks. Batch Normalization @cite_30 which normalizes input by mini-batch statistics has been a foundation of visual recognition tasks @cite_7 . Instance Normalization @cite_1 performs one... | {
"cite_N": [
"@cite_30",
"@cite_4",
"@cite_7",
"@cite_28",
"@cite_1",
"@cite_27",
"@cite_23",
"@cite_15",
"@cite_10",
"@cite_25"
],
"mid": [
"2949117887",
"2962793481",
"2194775991",
"",
"",
"2963245493",
"2588610957",
"2331128040",
"281... |
1908.04008 | 2967406324 | Batch Normalization (BN) (Ioffe and Szegedy 2015) normalizes the features of an input image via statistics of a batch of images and this batch information is considered as batch noise that will be brought to the features of an instance by BN. We offer a point of view that self-attention mechanism can help regulate the ... | The cooperation of BN and attention dates back to Visual Questioning and Answering (VQA) which inputs an image and an image-related question and then outputs the answer to the question. For this task, Conditional Batch Norm @cite_27 is proposed to influence the feature extraction of an image via the feature collected f... | {
"cite_N": [
"@cite_27"
],
"mid": [
"2963245493"
],
"abstract": [
"It is commonly assumed that language refers to high-level visual concepts while leaving low-level visual processing unaffected. This view dominates the current literature in computational models for language-vision tasks, where vi... |
1908.04036 | 2968366816 | This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the sl... | The importance of the uneven-channel bottleneck in coded caching has been acknowledged in a large number of recent works that seek to understand and ameliorate this limitation @cite_7 @cite_20 @cite_25 @cite_31 @cite_28 @cite_12 @cite_18 @cite_3 @cite_21 @cite_15 @cite_30 @cite_23 @cite_14 @cite_9 @cite_19 @cite_17 . F... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_14",
"@cite_7",
"@cite_15",
"@cite_28",
"@cite_9",
"@cite_21",
"@cite_3",
"@cite_24",
"@cite_19",
"@cite_23",
"@cite_12",
"@cite_31",
"@cite_25",
"@cite_20",
"@cite_17"
],
"mid": [
"2963615879",
... |
1908.04036 | 2968366816 | This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the sl... | The uneven-capacity bottleneck was also studied in the presence of multiple transmit antennas @cite_25 @cite_26 . Reference @cite_25 exploited transmit diversity to ameliorate the impact of the worst-user capacity, and showed that employing @math transmit antennas can allow for a transmission sum-rate that scales with ... | {
"cite_N": [
"@cite_26",
"@cite_25"
],
"mid": [
"2805337448",
"2598021007"
],
"abstract": [
"We study the problem of cache-aided communication for cellular networks with multi-user and multiple antennas at finite signal-to-noise ratio. Users are assumed to have non-symmetric links, modele... |
1908.04036 | 2968366816 | This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the sl... | In a related line of work, the papers @cite_15 and @cite_30 studied the cache-aided topological interference channel where @math cache-aided transmitters are connected to @math cache-aided receivers, and each transmitter is connected to one receiver via a direct strong'' link and to each of the other receivers via weak... | {
"cite_N": [
"@cite_30",
"@cite_15"
],
"mid": [
"2963615879",
"2740920677"
],
"abstract": [
"We consider the cache-aided MISO broadcast channel (BC) in which a multi-antenna transmitter serves @math single-antenna receivers, each equipped with a cache memory. The transmitter has access to... |
1908.04036 | 2968366816 | This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the sl... | Recently, significant effort has been made toward understanding the behavior of coded caching in the finite Signal-to-Noise Ratio (SNR) regime with realistic (and thus often uneven) channel qualities. In this direction, the work in @cite_23 showed that a single-stream coded caching message beamformed by an appropriate ... | {
"cite_N": [
"@cite_14",
"@cite_9",
"@cite_19",
"@cite_23",
"@cite_17"
],
"mid": [
"2767375015",
"2885217635",
"2921187562",
"2963664701",
"2944365782"
],
"abstract": [
"A single cell downlink scenario is considered where a multiple-antenna base station delivers co... |
1908.04036 | 2968366816 | This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the rate of transmission of each multicasting message to be reduced to that of the sl... | Our work is in the spirit of all the above papers, and it can be seen specifically as an extension of @cite_20 . This reference considered a specific binary topological case, for which it proposed a two-level superposition-based transmission scheme to alleviate the worst-user bottleneck. | {
"cite_N": [
"@cite_20"
],
"mid": [
"2963745869"
],
"abstract": [
"We explore the performance of coded caching in a SISO BC setting where some users have higher link capacities than others. Focusing on a binary and fixed topological model where strong links have a fixed normalized capacity 1, and... |
1908.03864 | 2968252280 | We consider an information theoretic approach to address the problem of identifying fake digital images. We propose an innovative method to formulate the issue of localizing manipulated regions in an image as a deep representation learning problem using the Information Bottleneck (IB), which has recently gained popular... | Information theory is a powerful framework that is being increasingly adopted to improve various aspects of deep machine learning, e.g., representation learning @cite_36 generalizability & regularization @cite_38 , and for interpreting how deep neural networks function @cite_27 @cite_34 . Mutual information plays a key... | {
"cite_N": [
"@cite_38",
"@cite_36",
"@cite_24",
"@cite_0",
"@cite_27",
"@cite_31",
"@cite_34",
"@cite_13"
],
"mid": [
"2964209830",
"2887997457",
"2099471712",
"115285041",
"2593634001",
"2803832867",
"2785885194",
"2963226019"
],
"abstract": [... |
1908.03978 | 2968137284 | Accurate pedestrian counting algorithm is critical to eliminate insecurity in the congested public scenes. However, counting pedestrians in crowded scenes often suffer from severe perspective distortion. In this paper, basing on the straight-line double region pedestrian counting method, we propose a dynamic region div... | Traditional methods used the histogram of oriented gradients(HOG) as the pedestrian-level features and the support vector machine as the classifier to detect pedestrians in specific scenes @cite_10 , but these hand-crafted features severely suffered from light variance and scale variance. The region-based convolutional... | {
"cite_N": [
"@cite_7",
"@cite_6",
"@cite_3",
"@cite_10",
"@cite_17"
],
"mid": [
"2193145675",
"2796347433",
"2963037989",
"2161969291",
"2102605133"
],
"abstract": [
"We present a method for detecting objects in images using a single deep neural network. Our appro... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | In the modern world, a high density of wireless networks and huge interference between them make centralized coordination of the networks more and more popular. It allows optimizing network performance and thus increasing total efficiency. While today's wireless networks are mainly optimized to provide high throughput,... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2327455150"
],
"abstract": [
"After about a decade of intense research, spurred by both economic and operational considerations, and by environmental concerns, energy efficiency has now become a key pillar in the design of communication networks. With the adven... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | @cite_11 , energy efficiency is defined as the amount of data delivered through a link divided by the consumed energy. The authors of this paper consider a terminal having limited energy and compare the energy efficiency of various Automatic Repeat reQuest (ARQ) protocols. | {
"cite_N": [
"@cite_11"
],
"mid": [
"2143915643"
],
"abstract": [
"When terminals powered by a finite battery source are used for wireless communications, energy constraints are likely to influence the choice of error control protocols. Therefore, we propose the average number of correctly transm... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | When optimizing energy efficiency, it is essential to add circuit power consumption @math to transmit power. Without taking this component into account, the maximum energy efficiency corresponds to the lowest transmission rate @cite_1 . | {
"cite_N": [
"@cite_1"
],
"mid": [
"2154319347"
],
"abstract": [
"With explosive growth of high-data-rate applications, more and more energy is consumed in wireless networks to guarantee quality of service. Therefore, energy-efficient communications have been paid increasing attention under the b... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | Mentioned above papers consider only a single wireless link. The definition of energy efficiency has to be extended for systems with multiple transmitters and receivers. In @cite_10 , it is done in the following way: where @math is the overall utility function, @math is the link utility function of link @math , @math i... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2120292867"
],
"abstract": [
"While the demand for battery capacity on mobile devices has grown with the increase in high-bandwidth multi-media rich applications, battery technology has not kept up with this demand. Therefore power optimization techniques are ... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | @cite_3 , the authors consider some other utility functions. In addition to the sum of energy efficiencies, an example of which is described above, they consider the product of energy efficiencies and so-called Global Energy Efficiency (GEE). Global energy efficiency is defined as the sum of rates divided by the total ... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2060821751"
],
"abstract": [
"This paper addresses the problem of energy-efficient resource allocation in the downlink of a cellular orthogonal frequency division multiple access system. Three definitions of energy efficiency are considered for system design, a... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | The GEE maximization problem can be solved with existing mathematical methods based on the so-called polyblock algorithm @cite_7 . However, this approach is known to converge very slowly when one or more variables are close to zero. While modeling real deployments, we often observed such cases. That is why we use anoth... | {
"cite_N": [
"@cite_6",
"@cite_7",
"@cite_2"
],
"mid": [
"2589615107",
"2211148590",
"75157487"
],
"abstract": [
"The characterization of the global maximum of energy efficiency (EE) problems in wireless networks is a challenging problem due to their nonconvex nature in interferen... |
1908.03803 | 2966887519 | During the last decade, the number of devices connected to the Internet by Wi-Fi has grown significantly. A high density of both the client devices and the hot spots posed new challenges related to providing the desired quality of service in the current and emerging scenarios. To cope with the negative effects caused b... | Wi-Fi networks impose additional restrictions on solutions of the described problem. Specifically, since Wi-Fi implements CSMA CA, regulatory bodies put limits on the sensitivity threshold. An example of a solution to the GEE problem is shown in paper @cite_0 , where an algorithm based on the branch-and-bound technique... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2886781652"
],
"abstract": [
"Ubiquitous densification of wireless networks has brought up the issue of inter-and intra-cell interference. Interference significantly degrades network throughput and leads to unfair channel resource usage, especially in Wi-Fi net... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | There are different types of materials used in manufacturing of optical sensors: various polymers including silicone, polyurethane, and thermoplastic elastomers; POFs and hydrogels. Liquid silicone rubber compounds (e.g. Smooth-on Sorta Clear 18 and Techsil RTV27905) are widely used in injection molding to create robus... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2775635818"
],
"abstract": [
"Tactile sensing is an important perception mode for robots, but the existing tactile technologies have multiple limitations. What kind of tactile information robots need, and how to use the information, remain open questions. We b... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | With the aim of making wearable and biocompatible parts, technological advances in bioengineering led to the emergence of hydrogels @cite_3 . A hydrogel, a rubbery and transparent material composed mostly of water, can also be a good choice for safe physical HRI. | {
"cite_N": [
"@cite_3"
],
"mid": [
"2049609871"
],
"abstract": [
"Hydrogels have found wide application in biosensors due to their versatile nature. This family of materials is applied in biosensing either to increase the loading capacity compared to two-dimensional surfaces, or to support biospe... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | Using the materials described in Sec , a variety of optical tactile sensors were presented in the literature. The general principle is based on the optical reflection between mediums with different refractive indices. A conventional optical tactile sensor consists of an array of infrared light-emitting diodes (LEDs) an... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2775693038"
],
"abstract": [
"The aim of this paper is to report the design of a low-cost plastic optical fiber (POF) pressure sensor, embedded in a mattress. We report the design of a multipoint sensor, a cheap alternative to the most common fiber sensors. The... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | GelSight tactile sensor @cite_21 uses a thermoplastic elastomer coated with a reflective membrane highlighted by an LED ring to capture surface textures with a camera. @cite_4 , this sensor was benchmarked in a texture recognition problem. Similarly, researchers of the Bristol Robotics laboratory developed a family of ... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_4",
"@cite_9",
"@cite_21",
"@cite_24",
"@cite_19"
],
"mid": [
"2837391606",
"2067689171",
"2962983231",
"2781493652",
"2775635818",
"2125959037",
"2793447234"
],
"abstract": [
"Slip detection helps to prev... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | Researchers embedded an optical tactile sensor into the multi-modal tactile sensing system of an underwater robot gripper @cite_25 . As in @cite_10 and Optoforce sensor , the sensing principle is based on the light reflection delivered via POFs. The POFs can be used as force sensing elements due to the stray light, whi... | {
"cite_N": [
"@cite_1",
"@cite_0",
"@cite_2",
"@cite_10",
"@cite_25"
],
"mid": [
"2775693038",
"2157950978",
"2807271440",
"2070970799",
"1999111105"
],
"abstract": [
"The aim of this paper is to report the design of a low-cost plastic optical fiber (POF) pressure ... |
1908.03687 | 2967382602 | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... | Laboratory prototypes of image-based tactile sensors were reported in @cite_22 and @cite_24 . In these sensing panels, LEDs and photo-diodes camera were placed against a reflecting planar surface. When the surface deforms, it causes changes in reflected beams. These sensors use optical light to detect deformation of th... | {
"cite_N": [
"@cite_24",
"@cite_22"
],
"mid": [
"2125959037",
"1965890979"
],
"abstract": [
"It is believed that the use of haptic sensors to measure the magnitude, direction, and distribution of a force will enable a robotic hand to perform dexterous operations. Therefore, we develop a n... |
1908.03645 | 2966981412 | Qualitative relationships describe how increasing or decreasing one property (e.g. altitude) affects another (e.g. temperature). They are an important aspect of natural language question answering and are crucial for building chatbots or voice agents where one may enquire about qualitative relationships. Recently a dat... | Our work is related to both the works in semantic parsing @cite_14 @cite_12 @cite_1 @cite_0 @cite_4 and question answering using semantic parsing @cite_11 @cite_5 @cite_13 . The problem of QUAREL is quite similar to the word math problems @cite_16 @cite_6 in the sense that both are story problems and use semantic parsi... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_9",
"@cite_1",
"@cite_6",
"@cite_0",
"@cite_5",
"@cite_16",
"@cite_13",
"@cite_12",
"@cite_11"
],
"mid": [
"2163274265",
"",
"2901386711",
"2252136820",
"2251349042",
"2757361303",
"2252016937",
... |
1908.03405 | 2968351798 | Early time series classification (eTSC) is the problem of classifying a time series after as few measurements as possible with the highest possible accuracy. The most critical issue of any eTSC method is to decide when enough data of a time series has been seen to take a decision: Waiting for more data points usually m... | The techniques used for (TSC) can be broadly categorized into two classes: methods and . Whole series-based methods make use of a point-wise comparison of entire TS like 1-NN Dynamic Time Warping (DTW) @cite_12 . In contrast, feature-based classifiers rely on comparing features generated from substructures of TS. Appro... | {
"cite_N": [
"@cite_26",
"@cite_21",
"@cite_1",
"@cite_39",
"@cite_19",
"@cite_5",
"@cite_10",
"@cite_25",
"@cite_12"
],
"mid": [
"2029438113",
"",
"2551393996",
"",
"1968354112",
"2892035503",
"2581867724",
"2141536962",
"2099302229"
],
... |
1908.03295 | 2967131314 | We introduce a novel single-shot object detector to ease the imbalance of foreground-background class by suppressing the easy negatives while increasing the positives. To achieve this, we propose an Anchor Promotion Module (APM) which predicts the probability of each anchor as positive and adjusts their initial locatio... | Cascaded Architecture . Cascaded architecture has been explored a lot for improving classification and refining locations. Viola and Jones @cite_25 trained a series of cascaded weak classifiers to form a strong region classifier for face detection. MR-CNN @cite_2 introduced an iterative bounding box regression by feedi... | {
"cite_N": [
"@cite_11",
"@cite_25",
"@cite_12",
"@cite_2"
],
"mid": [
"2964241181",
"2164598857",
"2962731685",
"1932624639"
],
"abstract": [
"In object detection, an intersection over union (IoU) threshold is required to define positives and negatives. An object detector... |
1908.03391 | 2967874181 | Individual identification is essential to animal behavior and ecology research and is of significant importance for protecting endangered species. Red pandas, among the world's rarest animals, are currently identified mainly by visual inspection and microelectronic chips, which are costly and inefficient. Motivated by ... | As summarized in Table , automatic individual identification methods have been studied for a number of species, including African penguins @cite_5 , northeast tigers @cite_12 , cattle @cite_11 , lemurs @cite_8 , dairy cows @cite_7 , great white sharks @cite_3 , pandas @cite_0 , primates @cite_18 , pigs @cite_9 , and ri... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_7",
"@cite_8",
"@cite_9",
"@cite_3",
"@cite_0",
"@cite_5",
"@cite_12",
"@cite_11"
],
"mid": [
"2962837037",
"2765230784",
"2770032835",
"2583064257",
"2791690647",
"2521680879",
"",
"1489779347",
... |
1908.03391 | 2967874181 | Individual identification is essential to animal behavior and ecology research and is of significant importance for protecting endangered species. Red pandas, among the world's rarest animals, are currently identified mainly by visual inspection and microelectronic chips, which are costly and inefficient. Motivated by ... | Red pandas obviously belong to those species that have subtle appearance differences between different individuals. Fortunately, their faces have relatively salient textures. According to Table , most methods for the species that do not have salient appearance differences are based on learned features. With learning ba... | {
"cite_N": [
"@cite_9",
"@cite_7"
],
"mid": [
"2791690647",
"2770032835"
],
"abstract": [
"Abstract Identification of individual livestock such as pigs and cows has become a pressing issue in recent years as intensification practices continue to be adopted and precise objective measuremen... |
1908.03440 | 2967014930 | In this paper, we propose a deep reinforcement learning (DRL) solution to the grasping problem using 2.5D images as the only source of information. In particular, we developed a simulated environment where a robot equipped with a vacuum gripper has the aim of reaching blocks with planar surfaces. These blocks can have ... | Deep reinforcement learning has been applied to solve several tasks such as learning to play video-games and robotics problems @cite_4 . In particular, it has been applied to grasp tasks with manipulator robots equipped with grippers, to locomotion tasks and also to humanoid robots @cite_12 @cite_3 . These problems are... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_9",
"@cite_3",
"@cite_10",
"@cite_12",
"@cite_17"
],
"mid": [
"2130801532",
"1757796397",
"2062122188",
"2799034341",
"2788575380",
"2739330054",
"2963411833"
],
"abstract": [
"We provide a natural gradient... |
1908.03440 | 2967014930 | In this paper, we propose a deep reinforcement learning (DRL) solution to the grasping problem using 2.5D images as the only source of information. In particular, we developed a simulated environment where a robot equipped with a vacuum gripper has the aim of reaching blocks with planar surfaces. These blocks can have ... | @cite_3 is an open-source perceptual and physics simulator. This work can be seen as a bridge between learning from a simulator and transfer learning. The main goal of is to facilitate transferring models trained in a simulated environment to the real world. | {
"cite_N": [
"@cite_3"
],
"mid": [
"2799034341"
],
"abstract": [
"Developing visual perception models for active agents and sensorimotor control in the physical world are cumbersome as existing algorithms are too slow to efficiently learn in real-time and robots are fragile and costly. This has g... |
1908.03440 | 2967014930 | In this paper, we propose a deep reinforcement learning (DRL) solution to the grasping problem using 2.5D images as the only source of information. In particular, we developed a simulated environment where a robot equipped with a vacuum gripper has the aim of reaching blocks with planar surfaces. These blocks can have ... | Although the previous works seem to obtain good results using deep reinforcement learning, there are a lot of other works that do not show these satisfactory results. A significant example is @cite_13 , which shows good results mainly on tasks with vector observations as input, while most of the tasks with visual obser... | {
"cite_N": [
"@cite_13"
],
"mid": [
"2889987506"
],
"abstract": [
"Recent advances in Deep Reinforcement Learning and Robotics have been driven by the presence of increasingly realistic and complex simulation environments. Many of the existing platforms, however, provide either unrealistic visual... |
1908.03440 | 2967014930 | In this paper, we propose a deep reinforcement learning (DRL) solution to the grasping problem using 2.5D images as the only source of information. In particular, we developed a simulated environment where a robot equipped with a vacuum gripper has the aim of reaching blocks with planar surfaces. These blocks can have ... | Another problem in deep reinforcement learning, and deep learning in general, is hyper-parameters tuning. Deep reinforcement learning problems involve a huge number of hyper-parameters that affect training process. It is necessary to tune hyper-parameters such as the learning rate, batch size, random seed, architecture... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2754517384"
],
"abstract": [
"In recent years, significant progress has been made in solving challenging problems across various domains using deep reinforcement learning (RL). Reproducing existing work and accurately judging the improvements offered by novel m... |
1908.03030 | 2966691903 | We present an approach to accurately estimate high fidelity markerless 3D pose and volumetric reconstruction of human performance using only a small set of camera views ( @math ). Our method utilises a dual loss in a generative adversarial network that can yield improved performance in both reconstruction and pose esti... | Super-resolution: The classical solution to image restoration and super-resolution was to combine multiple data sources ( multiple images obtained at sub-pixel misalignments @cite_6 , or use self-similar patches within a single image @cite_31 @cite_33 ), and then incorporate these within a regularisation constraint tot... | {
"cite_N": [
"@cite_31",
"@cite_33",
"@cite_41",
"@cite_48",
"@cite_32",
"@cite_6",
"@cite_16",
"@cite_3",
"@cite_46",
"@cite_34",
"@cite_12"
],
"mid": [
"2534320940",
"",
"2098477387",
"2614746365",
"2476548250",
"2061398022",
"2146337213",... |
1908.03030 | 2966691903 | We present an approach to accurately estimate high fidelity markerless 3D pose and volumetric reconstruction of human performance using only a small set of camera views ( @math ). Our method utilises a dual loss in a generative adversarial network that can yield improved performance in both reconstruction and pose esti... | Bottom-up pose estimation is driven by image parsing to isolate components, Srinivasan @cite_42 used graph-cuts to parse a subset of salient shapes from an image and group these into a model of a person. Ren @cite_39 recursively splits Canny edge contours into segments, classifying each as a putative body part using cu... | {
"cite_N": [
"@cite_55",
"@cite_42",
"@cite_1",
"@cite_52",
"@cite_39",
"@cite_24",
"@cite_50",
"@cite_15"
],
"mid": [
"2495081533",
"2018793343",
"2089665312",
"1950149599",
"2161361693",
"",
"2079846689",
"2163605009"
],
"abstract": [
"Mar... |
1908.03030 | 2966691903 | We present an approach to accurately estimate high fidelity markerless 3D pose and volumetric reconstruction of human performance using only a small set of camera views ( @math ). Our method utilises a dual loss in a generative adversarial network that can yield improved performance in both reconstruction and pose esti... | More recently given the success and accuracy of 2D joint estimation @cite_53 , several works lift 2D detections to 3D using learning or geometric reasoning, aiming to recover the missing depth dimension in the images. Sanzari @cite_7 estimates the location of 2D joints, before predicting 3D pose using appearance and pr... | {
"cite_N": [
"@cite_18",
"@cite_7",
"@cite_53",
"@cite_43",
"@cite_2",
"@cite_5",
"@cite_51"
],
"mid": [
"",
"2520324844",
"",
"2555849634",
"2963688992",
"2554247908",
"2154189068"
],
"abstract": [
"",
"We introduce a 3D human pose estimation m... |
1908.03030 | 2966691903 | We present an approach to accurately estimate high fidelity markerless 3D pose and volumetric reconstruction of human performance using only a small set of camera views ( @math ). Our method utilises a dual loss in a generative adversarial network that can yield improved performance in both reconstruction and pose esti... | Since detecting pose for each frame individually leads to incoherent and jittery predictions over a sequence, many approaches exploit temporal information. Andriluka @cite_28 used tracking-by-detection to associate 2D poses detected in each frame individually and used them to retrieve 3D pose. While Tekin @cite_10 used... | {
"cite_N": [
"@cite_8",
"@cite_28",
"@cite_19",
"@cite_49",
"@cite_10"
],
"mid": [
"",
"2080873731",
"2963383668",
"2769237672",
"2963592930"
],
"abstract": [
"",
"Human pose estimation has made significant progress during the last years. However current datase... |
1908.02983 | 2964677000 | Semi-supervised learning, i.e. jointly learning from labeled an unlabeled samples, is an active research topic due to its key role on relaxing human annotation constraints. In the context of image classification, recent advances to learn from unlabeled samples are mainly focused on consistency regularization methods th... | Semi-supervised learning for image classification is an active research topic @cite_29 ; this section focuses on reviewing work closely related to ours, discussing methods that use deep learning with mini-batch optimization over large image collections. Previous work on semi-supervised deep learning differ in whether t... | {
"cite_N": [
"@cite_29",
"@cite_33"
],
"mid": [
"2963956526",
"2936604471"
],
"abstract": [
"Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data when labels are limited or expensive to obtain. SSL algorithms based on deep neural networks have recentl... |
1908.02983 | 2964677000 | Semi-supervised learning, i.e. jointly learning from labeled an unlabeled samples, is an active research topic due to its key role on relaxing human annotation constraints. In the context of image classification, recent advances to learn from unlabeled samples are mainly focused on consistency regularization methods th... | Co-training @cite_15 combines several ideas from the previous works, using two (or more) networks trained simultaneously to agree in their predictions (consistency regularization) and disagree in their errors. Here the errors are defined as making different predictions when exposed to adversarial attacks, thus forcing ... | {
"cite_N": [
"@cite_38",
"@cite_18",
"@cite_4",
"@cite_1",
"@cite_15",
"@cite_34",
"@cite_10"
],
"mid": [
"2909869271",
"2792287754",
"2964159205",
"2951970475",
"2962804657",
"2592691248",
"2895771689"
],
"abstract": [
"",
"Deep neural networks... |
1908.02983 | 2964677000 | Semi-supervised learning, i.e. jointly learning from labeled an unlabeled samples, is an active research topic due to its key role on relaxing human annotation constraints. In the context of image classification, recent advances to learn from unlabeled samples are mainly focused on consistency regularization methods th... | It is important to highlight a widely used practice @cite_27 @cite_1 @cite_34 @cite_15 @cite_39 @cite_33 : a warm-up where labeled samples have a higher (or full) weight at the beginning of training to palliate the incorrect guidance of unlabeled samples early in training. The authors in @cite_29 also reveal some limit... | {
"cite_N": [
"@cite_33",
"@cite_29",
"@cite_1",
"@cite_39",
"@cite_27",
"@cite_15",
"@cite_34"
],
"mid": [
"2936604471",
"2963956526",
"2951970475",
"2909986471",
"2963435192",
"2962804657",
"2592691248"
],
"abstract": [
"Semi-supervised learning is... |
1908.02949 | 2966611292 | Applications like disaster management and industrial inspection often require experts to enter contaminated places. To circumvent the need for physical presence, it is desirable to generate a fully immersive individual live teleoperation experience. However, standard video-based approaches suffer from a limited degree ... | The key to success for the generation of an immersive and interactive telepresence experience is the real-time 3D reconstruction of the scene of interest. In particular due to the high computational burden and the huge memory requirements required to process and store large scenes, seminal work on multi-camera telepres... | {
"cite_N": [
"@cite_14",
"@cite_26",
"@cite_22",
"@cite_41",
"@cite_24",
"@cite_19",
"@cite_15",
"@cite_34",
"@cite_25",
"@cite_11"
],
"mid": [
"2139881008",
"2068618856",
"1572135045",
"1971503540",
"353406226",
"2082930097",
"1526459853",
... |
1908.02949 | 2966611292 | Applications like disaster management and industrial inspection often require experts to enter contaminated places. To circumvent the need for physical presence, it is desirable to generate a fully immersive individual live teleoperation experience. However, standard video-based approaches suffer from a limited degree ... | Recently, a huge step towards an immersive teleconferencing experience has been achieved with the development of the Holoportation system @cite_38 . This system has been implemented based on the Fusion4D framework @cite_6 that allows an accurate 3D reconstruction at real-time rates, as well real-time data transmission ... | {
"cite_N": [
"@cite_38",
"@cite_6"
],
"mid": [
"2532511219",
"2461005315"
],
"abstract": [
"We present an end-to-end system for augmented and virtual reality telepresence, called Holoportation. Our system demonstrates high-quality, real-time 3D reconstructions of an entire space, includin... |
1908.02949 | 2966611292 | Applications like disaster management and industrial inspection often require experts to enter contaminated places. To circumvent the need for physical presence, it is desirable to generate a fully immersive individual live teleoperation experience. However, standard video-based approaches suffer from a limited degree ... | Towards the goal of exploring larger environments as related to the exploration of contaminated scenes envisioned in this work, Mossel and Kr "o ter @cite_5 presented a system that allows interactive VR-based exploration of the captured scene by a single exploration client. Their system benefits from the real-time reco... | {
"cite_N": [
"@cite_5",
"@cite_20"
],
"mid": [
"2584684405",
"1625949922"
],
"abstract": [
"We introduce a novel framework that enables large-scale dense 3D scene reconstruction, data streaming over the network and immersive exploration of the reconstructed environment using virtual reali... |
1908.02949 | 2966611292 | Applications like disaster management and industrial inspection often require experts to enter contaminated places. To circumvent the need for physical presence, it is desirable to generate a fully immersive individual live teleoperation experience. However, standard video-based approaches suffer from a limited degree ... | The recent approach by Stotko al @cite_7 overcomes these problems and allows the on-the-fly scene inspection and interaction by an arbitrary number of exploration clients, and, hence, represents a practical framework for interactive collaboration purposes. Most notably, the system is based on a novel compact Marching C... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2801778672"
],
"abstract": [
"Real-time 3D scene reconstruction from RGB-D sensor data, as well as the exploration of such data in VR AR settings, has seen tremendous progress in recent years. The combination of both these components into telepresence systems, ... |
1908.02949 | 2966611292 | Applications like disaster management and industrial inspection often require experts to enter contaminated places. To circumvent the need for physical presence, it is desirable to generate a fully immersive individual live teleoperation experience. However, standard video-based approaches suffer from a limited degree ... | In Schwarz al @cite_8 , the rescue robot Momaro is described, which is equipped with interfaces for immersive teleoperation using an HMD device and 6D trackers. The immersive display greatly benefited the operators by increasing situational awareness. However, visualization was limited to registered 3D point clouds, wh... | {
"cite_N": [
"@cite_27",
"@cite_8"
],
"mid": [
"2892180807",
"2797072841"
],
"abstract": [
"Mobile manipulation tasks are one of the key challenges in the field of search and rescue (SAR) robotics requiring robots with flexible locomotion and manipulation abilities. Since the tasks are mo... |
1908.03020 | 2966062579 | We propose a novel method for explaining the predictions of any classifier. In our approach, local explanations are expected to explain both the outcome of a prediction and how that prediction would change if 'things had been different'. Furthermore, we argue that satisfactory explanations cannot be dissociated from a ... | Early work seeking to provide explanations to neural networks have been focused on the extraction of symbolic knowledge from trained networks @cite_18 , either decision trees in the case of feedforward networks @cite_10 or graphs in the case of recurrent networks @cite_5 @cite_3 . More recently, attention has been shif... | {
"cite_N": [
"@cite_13",
"@cite_18",
"@cite_9",
"@cite_3",
"@cite_6",
"@cite_2",
"@cite_5",
"@cite_15",
"@cite_10"
],
"mid": [
"2786715987",
"2063046703",
"2753738274",
"2771330107",
"2963749936",
"2556838012",
"2142148616",
"2962714378",
"2... |
1908.03020 | 2966062579 | We propose a novel method for explaining the predictions of any classifier. In our approach, local explanations are expected to explain both the outcome of a prediction and how that prediction would change if 'things had been different'. Furthermore, we argue that satisfactory explanations cannot be dissociated from a ... | More specifically, @cite_14 have proposed LORE – Local Rule based Explanations, which provides local explanations for binary classification tasks using decision trees. It is model-agnostic, generates local models from synthetic data, has many other similarities to LIME, but it also generates counterfactual explanations... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2803532212"
],
"abstract": [
"The recent years have witnessed the rise of accurate but obscure decision systems which hide the logic of their internal decision processes to the users. The lack of explanations for the decisions of black box systems is a key eth... |
1908.02743 | 2965212953 | Consider a distributed system with @math processors out of which @math can be Byzantine faulty. In the approximate agreement task, each processor @math receives an input value @math and has to decide on an output value @math such that - the output values are in the convex hull of the non-faulty processors' input values... | The seminal result of @cite_0 showed that consensus cannot be reached in asynchronous systems in the presence of crash faults. @cite_5 showed that it is however possible to reach in an asynchronous system even with arbitrary faulty behavior when the values reside on the continuous real line. Subsequently, the one-dimen... | {
"cite_N": [
"@cite_13",
"@cite_41",
"@cite_36",
"@cite_0",
"@cite_5",
"@cite_10"
],
"mid": [
"1971773339",
"2115307136",
"1985434631",
"2035362408",
"2126906505",
"1976693492"
],
"abstract": [
"Consider a network of @math n processes, where each process in... |
1908.02743 | 2965212953 | Consider a distributed system with @math processors out of which @math can be Byzantine faulty. In the approximate agreement task, each processor @math receives an input value @math and has to decide on an output value @math such that - the output values are in the convex hull of the non-faulty processors' input values... | The was originally introduced in the context of wait-free algorithms in shared memory models @cite_47 @cite_53 . The problem has recently resurfaced in the context of asynchronous message-passing models with crash faults @cite_28 @cite_56 . These papers consider the problem when the validity condition is given as @math... | {
"cite_N": [
"@cite_28",
"@cite_47",
"@cite_56",
"@cite_53"
],
"mid": [
"2151102492",
"2095126777",
"2886192190",
"1997124359"
],
"abstract": [
"Lattice agreement is a key decision problem in distributed systems. In this problem, processes start with input values from a la... |
1908.02743 | 2965212953 | Consider a distributed system with @math processors out of which @math can be Byzantine faulty. In the approximate agreement task, each processor @math receives an input value @math and has to decide on an output value @math such that - the output values are in the convex hull of the non-faulty processors' input values... | Another class of structured agreement problems in the wait-free asynchronous setting are tasks @cite_32 , which generalise @math -set agreement and approximate agreement (e.g., @math -set agreement and one-dimensional approximate agreement). In loop agreement, the set of inputs consists of three distinct vertices on a ... | {
"cite_N": [
"@cite_17",
"@cite_11",
"@cite_32",
"@cite_39"
],
"mid": [
"1522404823",
"1526652053",
"2011451665",
"2162458446"
],
"abstract": [
"Objects like queue, swap, and test-and-set allow two processes to reach consensus, and are consequently \"universal\" for a syst... |
1908.02571 | 2964743966 | Informing professionals about the latest research results in their field is a particularly important task in the field of health care, since any development in this field directly improves the health status of the patients. Meanwhile, social media is an infrastructure that allows public instant sharing of information, ... | Classic link prediction methods on social media use graph properties of the social network or NLP feature of nodes to predict links between entities. For example, @cite_3 is base solely on graph features and @cite_8 uses a similar technique for the social networks in healthcare. Meanwhile, @cite_14 uses common words to... | {
"cite_N": [
"@cite_14",
"@cite_10",
"@cite_3",
"@cite_8"
],
"mid": [
"2071018679",
"2768375068",
"2737056279",
"1996564243"
],
"abstract": [
"In this paper we address the problem of discovering missing hypertext links in Wikipedia. The method we propose consists of two st... |
1908.02571 | 2964743966 | Informing professionals about the latest research results in their field is a particularly important task in the field of health care, since any development in this field directly improves the health status of the patients. Meanwhile, social media is an infrastructure that allows public instant sharing of information, ... | TransE @cite_13 is an embedding model that is popular because of its simplicity and efficiency. It represents the entities in a KG by a relation between the vectors representing them. The score function describing these vectors in TransE is: | {
"cite_N": [
"@cite_13"
],
"mid": [
"2127795553"
],
"abstract": [
"We consider the problem of embedding entities and relationships of multi-relational data in low-dimensional vector spaces. Our objective is to propose a canonical model which is easy to train, contains a reduced number of paramete... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | The first work to explore one communication round consensus in the benign failure model is @cite_10 . The basic protocol in @cite_10 requires @math . That protocol is also extended to support a preferred value which improves the resiliency requirement to @math , similar to our work. The main contribution of this paper ... | {
"cite_N": [
"@cite_10"
],
"mid": [
"1516351775"
],
"abstract": [
"This paper presents a very simple consensus protocol that converges in a single communication step in favorable circumstances. Those situations occur when \"enough\" processes propose the same value. (\"Enough\" means \"at least (... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | The work of @cite_18 explored simple Byzantine consensus protocols that can terminate in a single communication round whenever all nodes start with the same value and certain failures do not manifest. Yet, the probabilistic protocol of @cite_18 required @math while their deterministic protocol needed @math . In contras... | {
"cite_N": [
"@cite_18"
],
"mid": [
"2030698973"
],
"abstract": [
"This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensu... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | Traditional deterministic Byzantine consensus protocols, most notably PBFT @cite_15 require at least 3 communication rounds to terminate. Multiple works that reduce this number have been published, each presenting a unique optimization. The Q U work presented a client driven protocol @cite_17 which enables termination ... | {
"cite_N": [
"@cite_15",
"@cite_2",
"@cite_17"
],
"mid": [
"2126087831",
"2129467152",
"2147524598"
],
"abstract": [
"This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | The Fast Byzantine Consensus (FaB) protocol was the first protocol to implement a Byzantine consensus protocol that terminates in two communication phases in the normal case while requiring @math @cite_29 . The normal case in @cite_29 is defined as when there is a unique correct leader, all correct acceptors agree on i... | {
"cite_N": [
"@cite_29"
],
"mid": [
"2058322902"
],
"abstract": [
"We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps and number of processe... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | Zyzzyva is a client driven protocol @cite_24 which terminates after @math communication rounds (including the communication between the client and the replicas) whenever the client receives identical replies from all @math replicas. Our optimizer obtains termination in a single communication round among the replicas ev... | {
"cite_N": [
"@cite_24"
],
"mid": [
"2139359217"
],
"abstract": [
"We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client's request without first running an exp... |
1908.02675 | 2966014518 | Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires... | The condition based approach for solving consensus identifies various sets of input values that enable solving consensus fast @cite_7 . This is by treating the set of input values held by all processes as an input vector to the problem. Specifically, the work in @cite_11 showed that when the possible input vectors corr... | {
"cite_N": [
"@cite_7",
"@cite_11"
],
"mid": [
"2021482754",
"2139686511"
],
"abstract": [
"This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for whi... |
1908.02484 | 2965761271 | Fitting model parameters to a set of noisy data points is a common problem in computer vision. In this work, we fit the 6D camera pose to a set of noisy correspondences between the 2D input image and a known 3D environment. We estimate these correspondences from the image using a neural network. Since the correspondenc... | In contrast, Mixture of Experts (MoE) @cite_40 employs a divide-and-conquer strategy where each base-learner, expert, specializes in one part of the problem domain. An additional gating network assesses the relevancy of each expert for a given input, and predicts an associated weight. The ensemble prediction is a weigh... | {
"cite_N": [
"@cite_41",
"@cite_40"
],
"mid": [
"2131320820",
"2150884987"
],
"abstract": [
"The human brain can be described as containing a number of functional regions. These regions, as well as the connections between them, play a key role in information processing in the brain. Howev... |
1908.02484 | 2965761271 | Fitting model parameters to a set of noisy data points is a common problem in computer vision. In this work, we fit the 6D camera pose to a set of noisy correspondences between the 2D input image and a known 3D environment. We estimate these correspondences from the image using a neural network. Since the correspondenc... | Scene coordinate regression methods @cite_58 @cite_10 @cite_2 @cite_43 @cite_28 @cite_44 @cite_4 @cite_29 @cite_13 @cite_1 also estimate 2D-3D correspondences between image and environment but do so densely for each pixel of the input image. This circumvents the need for a feature detector with the aforementioned draw-... | {
"cite_N": [
"@cite_13",
"@cite_4",
"@cite_33",
"@cite_28",
"@cite_29",
"@cite_1",
"@cite_44",
"@cite_43",
"@cite_0",
"@cite_45",
"@cite_59",
"@cite_2",
"@cite_58",
"@cite_10"
],
"mid": [
"",
"",
"2556455135",
"",
"",
"",
"",
... |
1908.02484 | 2965761271 | Fitting model parameters to a set of noisy data points is a common problem in computer vision. In this work, we fit the 6D camera pose to a set of noisy correspondences between the 2D input image and a known 3D environment. We estimate these correspondences from the image using a neural network. Since the correspondenc... | In @cite_65 , Brachmann al train a joint classification-regression forest for camera re-localization. The forest classifies which part of the environment an input belongs to, and regresses relative scene coordinates for this part. More recently, image-retrieval and relative pose regression have been combined in one sys... | {
"cite_N": [
"@cite_51",
"@cite_65"
],
"mid": [
"2963210849",
"2894971516"
],
"abstract": [
"We seek to predict the 6 degree-of-freedom (6DoF) pose of a query photograph with respect to a large indoor 3D map. The contributions of this work are three-fold. First, we develop a new large-sca... |
1908.02402 | 2965998974 | This paper proposes a novel end-to-end architecture for task-oriented dialogue systems. It is based on a simple and practical yet very effective sequence-to-sequence approach, where language understanding and state tracking tasks are modeled jointly with a structured copy-augmented sequential decoder and a multi-label ... | Our work is related to end-to-end task-oriented dialogue systems in general [among others] BingNAACL18,Jason17,Lowe18,msr_challenge,BingGoogle17,Pawel18,bordes2016learning,HoriWHWHRHKJZA16,wen2016network,serban2016building and those that extend the Seq2Seq @cite_8 architecture in particular . Belief tracking, which is ... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2130942839"
],
"abstract": [
"Deep Neural Networks (DNNs) are powerful models that have achieved excellent performance on difficult learning tasks. Although DNNs work well whenever large labeled training sets are available, they cannot be used to map sequences ... |
1908.02239 | 2964358797 | A surge in artificial intelligence and autonomous technologies have increased the demand toward enhanced edge-processing capabilities. Computational complexity and size of state-of-the-art Deep Neural Networks (DNNs) are rising exponentially with diverse network models and larger datasets. This growth limits the perfor... | the concept of pruning the neural network and exploiting the sparsity has been explored lately either on the general purpose processors @cite_29 @cite_12 @cite_48 @cite_49 or dedicated accelerators. Both static pruning in which the layer weights are compressed, and dynamic pruning with zero-detection of the input activ... | {
"cite_N": [
"@cite_36",
"@cite_48",
"@cite_29",
"@cite_39",
"@cite_49",
"@cite_34",
"@cite_12"
],
"mid": [
"2285660444",
"2657126969",
"2767785892",
"2806364818",
"2119144962",
"2773134966",
"2964080840"
],
"abstract": [
"State-of-the-art deep neur... |
1908.01950 | 2966170251 | The importance of wild video based image set recognition is becoming monotonically increasing. However, the contents of these collected videos are often complicated, and how to efficiently perform set modeling and feature extraction is a big challenge for set-based classification algorithms. In recent years, some propo... | In image set classification, the covariance matrix, linear subspace and Gaussian distribution are three commonly used Riemannian manifold-valued descriptors for image set description. For covariance matrix, its advantages are the simplicity and flexibility to capture the variations within the set @cite_1 @cite_50 @cite... | {
"cite_N": [
"@cite_37",
"@cite_1",
"@cite_3",
"@cite_24",
"@cite_19",
"@cite_44",
"@cite_50"
],
"mid": [
"2126017757",
"2144093206",
"1928812244",
"",
"1922045146",
"2155608052",
"2962772276"
],
"abstract": [
"In this paper we propose a discriminan... |
1908.01950 | 2966170251 | The importance of wild video based image set recognition is becoming monotonically increasing. However, the contents of these collected videos are often complicated, and how to efficiently perform set modeling and feature extraction is a big challenge for set-based classification algorithms. In recent years, some propo... | Manifold Dimensionality Reduction Based Image Set Classification: To circumvent the above problem, some algorithms that jointly perform linear mapping and metric learning directly on the original Riemannian manifold have been suggested recently @cite_50 @cite_19 @cite_53 , and therefore a discriminative lower-dimension... | {
"cite_N": [
"@cite_19",
"@cite_53",
"@cite_50"
],
"mid": [
"1922045146",
"",
"2962772276"
],
"abstract": [
"In video based face recognition, great success has been made by representing videos as linear subspaces, which typically lie in a special type of non-Euclidean space known ... |
1908.01841 | 2966573247 | Neural dialogue models, despite their successes, still suffer from lack of relevance, diversity, and in many cases coherence in their generated responses. These issues have been attributed to reasons including (1) short-range model architectures that capture limited temporal dependencies, (2) limitations of the maximum... | There has been an ongoing effort to drastically improve the performance of dialogue response generation model especially in multi-turn scenarios. In particular, effort has been made to improve the performance of RNN-based models by exploring alternative frameworks such as variational auto-encoding @cite_15 , and genera... | {
"cite_N": [
"@cite_35",
"@cite_9",
"@cite_21",
"@cite_2",
"@cite_15",
"@cite_34"
],
"mid": [
"2806935606",
"",
"2950813464",
"",
"2418993857",
"2911109671"
],
"abstract": [
"We propose an adversarial learning approach for generating multi-turn dialogue res... |
1908.01714 | 2966789542 | In their seminal work on systemic risk in financial markets, Eisenberg and Noe proposed and studied a model with @math firms embedded into a network of debt relations. We analyze this model from a game-theoretic point of view. Every firm is a rational agent in a directed graph that has an incentive to allocate payments... | To our knowledge, strategic aspects are currently reflected only in models of network formation @cite_10 @cite_9 . A three period economy is assumed where firms can invest into risky assets. To do so, they strategically decide to borrow funds from outside investors as well as other firms. Thereby a network of financial... | {
"cite_N": [
"@cite_9",
"@cite_10",
"@cite_3"
],
"mid": [
"2160164079",
"100186914",
"2162337502"
],
"abstract": [
"We provide a framework to study the formation of financial networks and investigate the interplay between banks' lending incentives and the emergence of systemic ris... |
1908.01714 | 2966789542 | In their seminal work on systemic risk in financial markets, Eisenberg and Noe proposed and studied a model with @math firms embedded into a network of debt relations. We analyze this model from a game-theoretic point of view. Every firm is a rational agent in a directed graph that has an incentive to allocate payments... | On a more technical level, our game-theoretic approach is related to a number of existing game-theoretic models based on flows in networks. In cooperative game theory, there are several notions of flow games based on a directed flow network. Existing variants include games, where edges are players @cite_2 @cite_8 @cite... | {
"cite_N": [
"@cite_22",
"@cite_7",
"@cite_8",
"@cite_1",
"@cite_0",
"@cite_2",
"@cite_12",
"@cite_20"
],
"mid": [
"2028847614",
"",
"2064699170",
"2125537511",
"",
"2076900408",
"2034600319",
"2005690414"
],
"abstract": [
"A class of charac... |
1908.01623 | 2966715342 | Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process... | First, the conventional varying-order Markov models @cite_12 deal with this problem as a discrete-time sequence prediction task. Based on the observed history states sequence, prediction of the event type is given by the most likely state that the state transition process will evolve into on the next step. An obvious l... | {
"cite_N": [
"@cite_3",
"@cite_12"
],
"mid": [
"1485657187",
"2103960658"
],
"abstract": [
"Preface. Part I: Extensions of Basic Models. 1. The Solidarity of Markov Renewal Processes R. Pyke. 2. A Generalization of Semi-Markov Processes M. Iosifescu. 3. Quasi-stationary Phenomena for Semi... |
1908.01623 | 2966715342 | Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process... | Second, Temporal point processes with conditional intensity functions is a more general framework for sequential event data modeling. Temporal Point Process (TPP) is powerful for modeling event sequence with time-stamp in continuous time space. Early work dates back to the Hawkes processes @cite_40 which shows appropri... | {
"cite_N": [
"@cite_37",
"@cite_26",
"@cite_31",
"@cite_7",
"@cite_21",
"@cite_39",
"@cite_40",
"@cite_23",
"@cite_2",
"@cite_15",
"@cite_11"
],
"mid": [
"2002413290",
"",
"2168715086",
"2120497903",
"2090320383",
"2336875440",
"2069849731",... |
1908.01623 | 2966715342 | Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process... | Traditional TPP models are modeled by parametric forms involving manual design of conditional intensity function @math depicting event occurrence rate over time, which measures the instantaneous event occurrence rate at time @math . A few popular examples include: Poisson process @cite_25 : the basic form is history in... | {
"cite_N": [
"@cite_19",
"@cite_16",
"@cite_21",
"@cite_25"
],
"mid": [
"2145037371",
"138372711",
"2090320383",
""
],
"abstract": [
"The models surveyed include generalized Polya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. E... |
1908.01623 | 2966715342 | Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process... | One obvious limitation of the above TPP models is that they all assume all the samples obey a single parametric form which is too idealistic for real-world data. By contrast, recurrent neural network (RNN) based models @cite_4 @cite_17 @cite_22 are devised for learning point process. In these works, recurrent neural ne... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_22",
"@cite_17"
],
"mid": [
"2740189214",
"2509830164",
"2605191235",
"2569260160"
],
"abstract": [
"",
"Large volumes of event data are becoming increasingly available in a wide variety of applications, such as healthcare ana... |
1908.01623 | 2966715342 | Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process... | When dealing with event propagation sequences, a major limitation of these existing studies is that the structural information of the latent graph @math is not utilized. Conventional TPP models including state-of-the-art method in @cite_4 solve event propagation modeling as general event sequences modeling and take inp... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2509830164"
],
"abstract": [
"Large volumes of event data are becoming increasingly available in a wide variety of applications, such as healthcare analytics, smart cities and social network analysis. The precise time interval or the exact distance between two ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.