aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1907.12413 | 2965312352 | Argumentation Mining addresses the challenging tasks of identifying boundaries of argumentative text fragments and extracting their relationships. Fully automated solutions do not reach satisfactory accuracy due to their insufficient incorporation of semantics and domain knowledge. Therefore, experts currently rely on ... | Recent years have seen a rise of interactive machine learning @cite_41 and such techniques are now commonly integrated into visual analytics systems, as recently surveyed by @cite_50 . Often, they are used to learn model refinements from user interaction @cite_42 or provide @cite_40 . Semantic interactions are typicall... | {
"cite_N": [
"@cite_14",
"@cite_41",
"@cite_42",
"@cite_40",
"@cite_50"
],
"mid": [
"2738647029",
"2003238113",
"2753907577",
"2051088039",
"2602814102"
],
"abstract": [
"The current processes for building machine learning systems require practitioners with deep kn... |
1907.12413 | 2965312352 | Argumentation Mining addresses the challenging tasks of identifying boundaries of argumentative text fragments and extracting their relationships. Fully automated solutions do not reach satisfactory accuracy due to their insufficient incorporation of semantics and domain knowledge. Therefore, experts currently rely on ... | Several systems combine the close and distant reading metaphors to provide deeper insights into textual data, such as @cite_36 or @cite_43 . @cite_25 have developed a tool called , which combines focus- and context-techniques to support the analysis of large text documents. The tool enables exploration of text through ... | {
"cite_N": [
"@cite_36",
"@cite_43",
"@cite_51",
"@cite_25"
],
"mid": [
"",
"2137561086",
"173034076",
"2012118336"
],
"abstract": [
"",
"Digital information displays are becoming more common in public spaces such as museums, galleries, and libraries. However, the publ... |
1907.12413 | 2965312352 | Argumentation Mining addresses the challenging tasks of identifying boundaries of argumentative text fragments and extracting their relationships. Fully automated solutions do not reach satisfactory accuracy due to their insufficient incorporation of semantics and domain knowledge. Therefore, experts currently rely on ... | In recent years, several web-based interfaces have been created to support users in various text annotation tasks. For example, @cite_46 can be used for the annotation of POS tags or named entities. In this interface, annotations are made directly in the text by dragging the mouse over multiple words or clicking on a s... | {
"cite_N": [
"@cite_22",
"@cite_28",
"@cite_54",
"@cite_65",
"@cite_49",
"@cite_46"
],
"mid": [
"",
"1935970548",
"2050793659",
"2250522125",
"2755457990",
"8550301"
],
"abstract": [
"",
"We present TimeLineCurator, a browser-based authoring tool that a... |
1907.12336 | 2965762627 | Automatic data abstraction is an important capability for both benchmarking machine intelligence and supporting summarization applications. In the former one asks whether a machine can ‘understand’ enough about the meaning of input data to produce a meaningful but more compact abstraction. In the latter this capability... | Sketch recognition Early sketch recognition methods were developed to deal with professionally drawn sketches as in CAD or artistic drawings @cite_43 @cite_45 @cite_44 . The more challenging task of free-hand sketch recognition was first tackled in @cite_36 along with the release of the first large-scale dataset of ama... | {
"cite_N": [
"@cite_30",
"@cite_36",
"@cite_53",
"@cite_3",
"@cite_39",
"@cite_44",
"@cite_43",
"@cite_24",
"@cite_45",
"@cite_10"
],
"mid": [
"2493181180",
"1972420097",
"1503798456",
"1976664910",
"2743832495",
"",
"2137026559",
"",
""... |
1907.12383 | 2966710536 | Efficient transfers to many recipients present a host of issues on Ethereum. First, accounts are identified by long and incompressible constants. Second, these constants have to be stored and communicated for each payment. Third, the standard interface for token transfers does not support lists of recipients, adding re... | Howell @cite_5 study the success factors of 440 ICOs on based on propriety transaction data, presumably acquired from exchanges and other intermediaries, and manual labeling. Their main interest is in the relationship between issuer characteristics and indicators of success. The regression analyses find highly signific... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2811170310"
],
"abstract": [
"Initial coin offerings (ICOs) have emerged as a new mechanism for entrepreneurial finance, with parallels to initial public offerings, venture capital, and pre-sale crowdfunding. In a sample of more than 1,500 ICOs that collectivel... |
1907.12383 | 2966710536 | Efficient transfers to many recipients present a host of issues on Ethereum. First, accounts are identified by long and incompressible constants. Second, these constants have to be stored and communicated for each payment. Third, the standard interface for token transfers does not support lists of recipients, adding re... | Chen @cite_12 identify underpriced instructions (even after the 2016 gas price adjustment) and propose an adaptive pricing scheme. Their main interest is to raise economic barriers against congestion, which in the worst case enables denial of service attacks on the systemic level. | {
"cite_N": [
"@cite_12"
],
"mid": [
"2963220038"
],
"abstract": [
"The gas mechanism in Ethereum charges the execution of every operation to ensure that smart contracts running in EVM (Ethereum Virtual Machine) will be eventually terminated. Failing to properly set the gas costs of EVM operations... |
1907.12383 | 2966710536 | Efficient transfers to many recipients present a host of issues on Ethereum. First, accounts are identified by long and incompressible constants. Second, these constants have to be stored and communicated for each payment. Third, the standard interface for token transfers does not support lists of recipients, adding re... | Airdrops are a rather new topic. We are aware of one academic paper only. Harrigan @cite_18 raises awareness for privacy implications of airdrops when identifiers of one chain () are reused to distribute coins on another chain (). Sharing identifiers between chains in general gives additional clues for address clusteri... | {
"cite_N": [
"@cite_18"
],
"mid": [
"2891594175"
],
"abstract": [
"Airdrops are a popular method of distributing cryptocurrencies and tokens. While often considered risk-free from the point of view of recipients, their impact on privacy is easily overlooked. We examine the Clam airdrop of 2014, a... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | The term originates in control system theory and measures the degree to which a system's internal state can be determined from its output @cite_21 . In cloud environments, observability indicates to what degree infrastructure and applications and their interactions can be monitored. Outputs used are for example logs, m... | {
"cite_N": [
"@cite_0",
"@cite_21"
],
"mid": [
"2899113701",
"1540541511"
],
"abstract": [
"Cloud infrastructures can provide resource sharing between many applications and usually can meet the requirements of most of them. However, in order to enable an efficient usage of these resources... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | @cite_12 investigate the capturing of service execution paths in distributed systems. While capturing the execution path is challenging, as each request may cross many components of several servers, they introduce a generic end-to-end methodology to capture the entire request. During our interviews we found a need for ... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2899648294"
],
"abstract": [
"Distributed platforms are widely deployed to provide services in various trades. With the increasing scale and complexity of these distributed platforms, it is becoming more and more challenging to understand and diagnose a servic... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | The current trend towards more flexible and modular distributed systems is characterized by using independent services, such as micro- or web services. While systems consisting of web services provide better observability than monolithic systems, services have the potential to enhance their observability and monitoring... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2899645656"
],
"abstract": [
"In the current Web Service Description Language (WSDL), only the interface information of a web service is provided without any indication on its behavior logic. Naturally, it is difficult for the service user and developer to achi... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | Besides monitoring individual service calls, it is important to predict the runtime performance of distributed systems. @cite_4 show that two techniques, benchmarking and simulation, have shortcomings if they are used separately and introduce and validate a complementary approach. Their approach presents a process whic... | {
"cite_N": [
"@cite_4",
"@cite_17"
],
"mid": [
"2899973604",
"2900100055"
],
"abstract": [
"Estimating future runtime performance and cost is an essential task for Chief Information Officers in deciding whether to adopt a Cloud-based system. Benchmarking and simulation are two techniques ... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | @cite_8 addresses runtime monitoring on continuous deployment in software development as a crucial task, especially in rapidly changing software solutions. While current runtime monitoring approaches of previous and newly deployed versions lack in capturing and monitoring differences at runtime, they present an approac... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2899695116"
],
"abstract": [
"Continuous deployment techniques support rapid deployment of new software versions. Usually a new version is deployed on a limited scale, its behavior is monitored and compared against the previously deployed version and either the... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | @cite_14 conducted a survey of 62 multinational companies on public cloud adoption. While use of public cloud infrastructure is on the rise, barriers like security, regulatory compliance, and monitoring remain. Regarding monitoring, the survey has shown that half of the companies rely solely on their cloud providers' m... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2891766162"
],
"abstract": [
"Cloud Computing is radically changing the way of providing and managing IT services. Big enterprises are continuously investing on Cloud technologies to streamline IT processes and substantially reduce the time to market of new se... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | Similarly, Knoche and Hasselbring @cite_1 conducted a survey of German experts on microservice adoption. Drivers for microservice adoption are scalability, maintainability and development speed. On the other hand, barriers to adoption are mainly operational in nature. Operations department resist microservices due to t... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2907869797"
],
"abstract": [
"Microservices are an architectural style for software which currently receives a lot of attention in both industry and academia. Several companies employ microservice architectures with great success, and there is a wealth of blog ... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | Gamez- @cite_9 performed an analysis of RestFUL APIs of cloud providers, identifying requirements for API governance and noting a lack of standardization. | {
"cite_N": [
"@cite_9"
],
"mid": [
"2767103530"
],
"abstract": [
"As distribution models of information systems are moving to XaaS paradigms, microservices architectures are rapidly emerging, having the RESTful principles as the API model of choice. In this context, the term of API Economy is bei... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | While not an empirical study, @cite_16 show monitoring challenges of holistic cloud applications. Scale and complexity of applications is identified as a main challenge. Related to observability, incomplete and inaccurate views of the total system as well as fault localization are other identified challenges. | {
"cite_N": [
"@cite_16"
],
"mid": [
"2289646227"
],
"abstract": [
"Effective monitoring solutions are critical to the smooth running of enterprise systems. However, real-world constraints present several challenges in designing such solutions. With the increasing scale and complexity of today's e... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | @cite_10 give an overview of the state-of-the-art in application performance monitoring (APM), describing typical capabilities and available APM software. They found APM to be a solution to monitoring and analyzing cloud environments, but note future challenges in root cause detection, setup effort and interoperability... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2606883211"
],
"abstract": [
"The performance of application systems has a direct impact on business metrics. For example, companies lose customers and revenue in case of poor performance such as high response times. Application performance management (APM) ai... |
1907.12240 | 2966580058 | Business success of companies heavily depends on the availability and performance of their client applications. Due to modern development paradigms such as DevOps and microservice architectural styles, applications are decoupled into services with complex interactions and dependencies. Although these paradigms enable i... | @cite_3 give an insight into commercial cloud monitoring tools, showing state-of-the-art features, identifying shortcomings and, connected with that, future areas of research. Information aggregation across different layers of abstraction, a broad range of measurable metrics and extensibility are seen as critical succe... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2107557955"
],
"abstract": [
"Cloud monitoring activity involves dynamically tracking the Quality of Service (QoS) parameters related to virtualized resources (e.g., VM, storage, network, appliances, etc.), the physical resources they share, the applications ru... |
1907.12253 | 2965663253 | One major challenge in 3D reconstruction is to infer the complete shape geometry from partial foreground occlusions. In this paper, we propose a method to reconstruct the complete 3D shape of an object from a single RGB image, with robustness to occlusion. Given the image and a silhouette of the visible region, our app... | Most of these approaches are applied to non-occluded objects with clean backgrounds and no occlusions, which may prevent their application to natural images. Sun al @cite_41 conduct experiments on real images from Pix3D, a large-scale dataset with aligned ground-truth 3D shapes, but do not consider the problem of occlu... | {
"cite_N": [
"@cite_41",
"@cite_29"
],
"mid": [
"2962988048",
"2798505423"
],
"abstract": [
"We study 3D shape modeling from a single image and make contributions to it in three aspects. First, we present Pix3D, a large-scale benchmark of diverse image-shape pairs with pixel-level 2D-3D a... |
1907.12253 | 2965663253 | One major challenge in 3D reconstruction is to infer the complete shape geometry from partial foreground occlusions. In this paper, we propose a method to reconstruct the complete 3D shape of an object from a single RGB image, with robustness to occlusion. Given the image and a silhouette of the visible region, our app... | Occlusions have long been an obstacle in multi-view reconstruction. Solutions have been proposed to recover portions of surfaces from single views, with synthetic apertures @cite_6 @cite_31 , or to otherwise improve robustness of matching and completion functions from multiple views @cite_38 @cite_23 @cite_13 . Other w... | {
"cite_N": [
"@cite_38",
"@cite_15",
"@cite_10",
"@cite_9",
"@cite_32",
"@cite_6",
"@cite_27",
"@cite_23",
"@cite_31",
"@cite_13",
"@cite_25"
],
"mid": [
"2963660453",
"",
"2604176797",
"2119781527",
"2042754179",
"2136733503",
"2464328412",... |
1907.12398 | 2965570822 | User authentication can rely on various factors (e.g., a password, a cryptographic key, biometric data) but should not reveal any secret or private information. This seemingly paradoxical feat can be achieved through zero-knowledge proofs. Unfortunately, naive password-based approaches still prevail on the web. Multi-f... | The last couple of decades has seen a plethora of proposals for user authentication. In general, existing schemes suffer from at least one of the following drawbacks: (a) they require a dedicated device, (b) they are proprietary, (c) they involve a shared secret, and or (d) they still require a traditional password. He... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2030112111"
],
"abstract": [
"We evaluate two decades of proposals to replace text passwords for general-purpose user authentication on the web using a broad set of twenty-five usability, deployability and security benefits that an ideal scheme might provide. T... |
1907.12398 | 2965570822 | User authentication can rely on various factors (e.g., a password, a cryptographic key, biometric data) but should not reveal any secret or private information. This seemingly paradoxical feat can be achieved through zero-knowledge proofs. Unfortunately, naive password-based approaches still prevail on the web. Multi-f... | Bonneau @cite_17 had previously proposed a password-based authentication protocol, designed to avoid revealing the password to the server (using Javascript), which requires neither a software update on the client side nor a separate authentication device. @cite_8 similarly focused on restrictions imposed by legacy syst... | {
"cite_N": [
"@cite_8",
"@cite_17"
],
"mid": [
"1531500955",
"12767681"
],
"abstract": [
"We explore the extent to which we can address three issues with passwords today: the weakness of user-chosen passwords, reuse of passwords across security domains, and the revocation of credentials. ... |
1907.12398 | 2965570822 | User authentication can rely on various factors (e.g., a password, a cryptographic key, biometric data) but should not reveal any secret or private information. This seemingly paradoxical feat can be achieved through zero-knowledge proofs. Unfortunately, naive password-based approaches still prevail on the web. Multi-f... | Sound-Proof @cite_10 is a recent system that relies on sound for the smartphone and browser to communicate. One of the main goals of Sound-Proof is to provide a seamless experience to users, i.e., the phone need not even be handled for the authentication process to complete. However, the user still has to type a passwo... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2953351357"
],
"abstract": [
"Two-factor authentication protects online accounts even if passwords are leaked. Most users, however, prefer password-only authentication. One reason why two-factor authentication is so unpopular is the extra steps that the user m... |
1907.12353 | 2966108228 | We present recursive cascaded networks, a general architecture that enables learning deep cascades, for deformable image registration. The proposed architecture is simple in design and can be built on any base network. The moving image is warped successively by each cascade and finally aligned to the fixed image; this ... | Cascade approaches have been involved in a variety of domains of computer vision, e.g., cascaded pose regression progressively refines a pose estimation learned from supervised training data @cite_32 , cascaded classifiers speed up the process of object detection @cite_37 . | {
"cite_N": [
"@cite_37",
"@cite_32"
],
"mid": [
"2036989445",
"2136000821"
],
"abstract": [
"We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We focus primarily on the case of star-structured models and show how ... |
1907.12353 | 2966108228 | We present recursive cascaded networks, a general architecture that enables learning deep cascades, for deformable image registration. The proposed architecture is simple in design and can be built on any base network. The moving image is warped successively by each cascade and finally aligned to the fixed image; this ... | Deep learning also benefits from cascade architectures. For example, deep deformation network @cite_4 cascades two stages and predicts a deformation for landmark localization. Other applications include object detection @cite_9 , semantic segmentation @cite_47 , and image super-resolution @cite_51 . There are also seve... | {
"cite_N": [
"@cite_4",
"@cite_10",
"@cite_9",
"@cite_42",
"@cite_44",
"@cite_45",
"@cite_47",
"@cite_51"
],
"mid": [
"2952074561",
"2594014149",
"2964241181",
"2750807812",
"2753924563",
"2560920277",
"2216125271",
"135113724"
],
"abstract": [
... |
1907.12353 | 2966108228 | We present recursive cascaded networks, a general architecture that enables learning deep cascades, for deformable image registration. The proposed architecture is simple in design and can be built on any base network. The moving image is warped successively by each cascade and finally aligned to the fixed image; this ... | In respect of registration, traditional algorithms iteratively optimize some energy functions in common @cite_39 @cite_53 @cite_23 @cite_2 @cite_33 @cite_13 @cite_54 @cite_56 . Those methods are also recursive in general, i.e., similarly functioned alignments with respect to the current warped images are performed duri... | {
"cite_N": [
"@cite_18",
"@cite_33",
"@cite_53",
"@cite_54",
"@cite_39",
"@cite_56",
"@cite_23",
"@cite_2",
"@cite_31",
"@cite_13",
"@cite_17"
],
"mid": [
"2049981393",
"2170167891",
"",
"2118961645",
"2155298532",
"1998710995",
"",
"200... |
1907.12353 | 2966108228 | We present recursive cascaded networks, a general architecture that enables learning deep cascades, for deformable image registration. The proposed architecture is simple in design and can be built on any base network. The moving image is warped successively by each cascade and finally aligned to the fixed image; this ... | Learning-based methods are presented recently. Supervised methods entail much effort on the labeled data that can hardly meet the realistic demands, resulting in the limited performance @cite_55 @cite_15 @cite_38 @cite_57 . Unsupervised methods are proposed to solve this problem. Several initial works shows the possibi... | {
"cite_N": [
"@cite_38",
"@cite_35",
"@cite_41",
"@cite_55",
"@cite_29",
"@cite_1",
"@cite_21",
"@cite_3",
"@cite_57",
"@cite_43",
"@cite_0",
"@cite_49",
"@cite_15",
"@cite_16"
],
"mid": [
"2753461941",
"2891590469",
"2891631795",
"275224652... |
1907.12212 | 2965633139 | This paper is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the and the . Here at each synchronous and discrete time step, each vertex updates its opinion to match the majority among the opinions of two random neighbors and itself (the Best-of-t... | Other studies have focused on voting processes with more general updating rules. Cooper and Rivera @cite_5 studied the linear voting model , whose updating rule is characterized by a set of @math binary matrices. This model covers the synchronous pull and the asynchronous push pull voting processes. However, it does no... | {
"cite_N": [
"@cite_0",
"@cite_5"
],
"mid": [
"2589531210",
"2533034710"
],
"abstract": [
"We study consensus processes on the complete graph of n nodes. Initially, each node supports one up to n different opinions. Nodes randomly and in parallel sample the opinions of constantly many nod... |
1907.12079 | 2964825438 | Topic modeling is commonly used to analyze and understand large document collections. However, in practice, users want to focus on specific aspects or "targets" rather than the entire corpus. For example, given a large collection of documents, users may want only a smaller subset which more closely aligns with their in... | Various information visualization techniques have been applied to improve user interfaces for search. Some systems augment search result lists with additional small visualizations. For example, TileBars @cite_26 , INSYDER @cite_5 , and HotMap @cite_25 visualize query-document relationships as icons or glyphs alongside ... | {
"cite_N": [
"@cite_26",
"@cite_4",
"@cite_3",
"@cite_19",
"@cite_27",
"@cite_5",
"@cite_34",
"@cite_25",
"@cite_20"
],
"mid": [
"2158231614",
"2170061697",
"2130154693",
"2140501570",
"2024351142",
"2138539908",
"",
"2116336519",
"210684172... |
1907.12079 | 2964825438 | Topic modeling is commonly used to analyze and understand large document collections. However, in practice, users want to focus on specific aspects or "targets" rather than the entire corpus. For example, given a large collection of documents, users may want only a smaller subset which more closely aligns with their in... | Although topic summarization has been studied for a long time, discovering topic summary of a specific aspect (or targets) is a relatively new research problem. TTM @cite_12 is the first work to propose the term targeted topic modeling'. This work proposes a probabilistic model that is a variation of latent Dirichlet a... | {
"cite_N": [
"@cite_41",
"@cite_24",
"@cite_23",
"@cite_10",
"@cite_12"
],
"mid": [
"",
"2788837479",
"2788281060",
"1880262756",
"2352369035"
],
"abstract": [
"",
"Online reviews have become an inevitable part of a consumer’s decision making process, where the... |
1907.12079 | 2964825438 | Topic modeling is commonly used to analyze and understand large document collections. However, in practice, users want to focus on specific aspects or "targets" rather than the entire corpus. For example, given a large collection of documents, users may want only a smaller subset which more closely aligns with their in... | Interactive topic models allow users to steer the topics to improve the topic modeling results. Various topic steering interactions such as adding, editing, deleting, splitting, and merging topics have been introduced @cite_32 @cite_18 @cite_16 @cite_42 @cite_11 @cite_28 @cite_37 @cite_33 @cite_15 . These interactions ... | {
"cite_N": [
"@cite_18",
"@cite_37",
"@cite_33",
"@cite_28",
"@cite_42",
"@cite_32",
"@cite_15",
"@cite_16",
"@cite_11"
],
"mid": [
"1991676464",
"2794125445",
"2157821464",
"2560971156",
"2074930186",
"1993503217",
"2793816856",
"2087382273",
... |
1907.12047 | 2956646654 | Abstract The prevalence of e-learning systems and on-line courses has made educational material widely accessible to students of varying abilities and backgrounds. There is thus a growing need to accommodate for individual differences in e-learning systems. This paper presents an algorithm called EduRank for personaliz... | Our work relates to several areas of research in student modeling. Several approaches within the educational data mining community have used computational methods for sequencing students' learning items. Pardos and Heffernan @cite_39 infer order over questions by predicting students' skill levels over action pairs usin... | {
"cite_N": [
"@cite_39"
],
"mid": [
"2129373702"
],
"abstract": [
"Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collected in many ITS systems consist of answers to a grou... |
1907.12047 | 2956646654 | Abstract The prevalence of e-learning systems and on-line courses has made educational material widely accessible to students of varying abilities and backgrounds. There is thus a growing need to accommodate for individual differences in e-learning systems. This paper presents an algorithm called EduRank for personaliz... | Multiple researchers have used Bayesian knowledge tracing as a way to infer students' skill acquisition (i.e., mastery level) over time given their performance levels on different question sequences @cite_25 . These researchers reason about students' prior knowledge of skills and also account for slips and guessing on ... | {
"cite_N": [
"@cite_18",
"@cite_25",
"@cite_17"
],
"mid": [
"1597703949",
"2015040676",
"2404502960"
],
"abstract": [
"Modeling students' knowledge is a fundamental part of intelligent tutoring systems. One of the most popular methods for estimating students' knowledge is Corbett ... |
1907.12047 | 2956646654 | Abstract The prevalence of e-learning systems and on-line courses has made educational material widely accessible to students of varying abilities and backgrounds. There is thus a growing need to accommodate for individual differences in e-learning systems. This paper presents an algorithm called EduRank for personaliz... | Approaches based on recommendation systems are increasingly being used in e-learning to predict students' scores and to personalize educational content. We mention a few examples below and refer the reader to the surveys by @cite_30 and @cite_37 for more details. Collaborative filtering (CF) was previously used in the ... | {
"cite_N": [
"@cite_30",
"@cite_37",
"@cite_26",
"@cite_28",
"@cite_1",
"@cite_3"
],
"mid": [
"2199058847",
"1452699976",
"2303127372",
"2211922800",
"2115355580",
"1569739730"
],
"abstract": [
"This chapter presents an analysis of recommender systems in Te... |
1907.12209 | 2966634313 | Monocular depth prediction plays a crucial role in understanding 3D scene geometry. Although recent methods have achieved impressive progress in evaluation metrics such as the pixel-wise relative error, most methods neglect the geometric constraints in the 3D space. In this work, we show the importance of the high-orde... | Depth prediction from images is a long-standing problem. Previous work can be divided into active methods and passive methods. The former ones use the assistant optical information for prediction, such as coded patterns @cite_30 , while the latter ones completely focus on image contents. Monocular depth prediction @cit... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_22",
"@cite_50",
"@cite_5",
"@cite_16",
"@cite_13",
"@cite_12",
"@cite_17"
],
"mid": [
"2617593387",
"",
"2171740948",
"1905829557",
"2962741876",
"2963488291",
"",
"2194775991",
"2889002172"
],
... |
1907.12209 | 2966634313 | Monocular depth prediction plays a crucial role in understanding 3D scene geometry. Although recent methods have achieved impressive progress in evaluation metrics such as the pixel-wise relative error, most methods neglect the geometric constraints in the 3D space. In this work, we show the importance of the high-orde... | Most previous methods only adopted the pixel-wise depth supervision to train a network. By contrast, Liu al @cite_19 combined DCNN with the continuous conditional random field (CRF) to exploit consistency information of neighbouring pixels. CRF establishes a pair-wise constraint for local regions. Furthermore, several ... | {
"cite_N": [
"@cite_19",
"@cite_33"
],
"mid": [
"1803059841",
"2888531279"
],
"abstract": [
"In this article, we tackle the problem of depth estimation from single monocular images. Compared with depth estimation using multiple images such as stereo depth perception, depth from monocular ... |
1907.12237 | 2964535354 | This paper addresses the challenge of localization of anatomical landmarks in knee X-ray images at different stages of osteoarthritis (OA). Landmark localization can be viewed as regression problem, where the landmark position is directly predicted by using the region of interest or even full-size images leading to lar... | There are several methods focusing solely on the ROI localization. Tiulpin @cite_16 proposed a novel anatomical proposal method to localize the knee joint area. Antony @cite_19 used fully convolutional networks for the same problem. Recently, Chen @cite_14 proposed to use object detection methods to measure the knee OA... | {
"cite_N": [
"@cite_19",
"@cite_14",
"@cite_16"
],
"mid": [
"2604759322",
"2951269226",
"2584226844"
],
"abstract": [
"This paper introduces a new approach to automatically quantify the severity of knee OA using X-ray images. Automatically quantifying knee OA severity involves two... |
1907.12237 | 2964535354 | This paper addresses the challenge of localization of anatomical landmarks in knee X-ray images at different stages of osteoarthritis (OA). Landmark localization can be viewed as regression problem, where the landmark position is directly predicted by using the region of interest or even full-size images leading to lar... | The proposed approach is related to the regression-based methods for keypoint localization @cite_7 . We utilize an hourglass network which is an encoder-decoder model initially introduced for human pose estimation @cite_34 and address both ROI and landmark localization tasks. Several other studies in medical imaging do... | {
"cite_N": [
"@cite_38",
"@cite_37",
"@cite_7",
"@cite_0",
"@cite_34"
],
"mid": [
"1901129140",
"",
"2799930024",
"2925288829",
"2307770531"
],
"abstract": [
"There is large consent that successful training of deep networks requires many thousand annotated training... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Although convolutional neural networks (CNN) had achieved great success in analyzing 2D images, they cannot be directly applied to point clouds beacuse of its unorganized nature. Without a pixel-based neighborhood defined, vanilla CNNs cannot extract local information and gradually expand receptive field sizes in a mea... | {
"cite_N": [
"@cite_4",
"@cite_8",
"@cite_5",
"@cite_16",
"@cite_25",
"@cite_12",
"@cite_11"
],
"mid": [
"2024844736",
"2609719703",
"2211722331",
"",
"2963600949",
"",
"2594519801"
],
"abstract": [
"One of the most crucial requirements for building... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Although these methods did benefit from mature 2D image processing network structures, inefficient 3D data representations constrained them from showing good performance for scene segmentation, where it is necessary to deal with large, dense 3D scenes as a whole. Therefore, recent research gradually turned to networks ... | {
"cite_N": [
"@cite_26",
"@cite_7",
"@cite_6"
],
"mid": [
"2769473888",
"2797997528",
"2895472109"
],
"abstract": [
"We propose a novel deep learning-based framework to tackle the challenge of semantic segmentation of large-scale point clouds of millions of points. We argue that t... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | As introduced, PointNet used multi-layer perception (which process each point independently) to fit the unordered nature of point clouds @cite_8 . Furthermore, similar approaches like using @math convolutional kernels @cite_10 , radius querying @cite_1 or nearest neighbor searching @cite_0 were also adopted. Because lo... | {
"cite_N": [
"@cite_8",
"@cite_9",
"@cite_1",
"@cite_0",
"@cite_10"
],
"mid": [
"2609719703",
"2890834803",
"2624503621",
"2606987267",
"2963719584"
],
"abstract": [
"In this paper, we tackle the labeling problem for 3D point clouds. We introduce a 3D point cloud l... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Tangent Convolution @cite_7 proposed a way to efficiently model local dependencies and align convolutional filters on different scales. Their work is based on local covariance analysis and down-sampled neighborhood reconstruction with raw data points. Despite tangential convolution itself functioned well extracting loc... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2797997528"
],
"abstract": [
"We present an approach to semantic scene analysis using deep convolutional networks. Our approach is based on tangent convolutions - a new construction for convolutional networks on 3D data. In contrast to volumetric approaches, ou... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Several works turned to the global scale for permutation robustness. Its simplest form, global maximum pooling, only fulfilled light-weight tasks like object classification or part segmentation @cite_21 . Moreover, RNNs constructed with advance cells like Long-Short-Term-Memory @cite_28 or Gate-Recurrent-Unit @cite_19 ... | {
"cite_N": [
"@cite_26",
"@cite_14",
"@cite_28",
"@cite_21",
"@cite_19",
"@cite_15"
],
"mid": [
"2769473888",
"2963336905",
"",
"2560609797",
"1924770834",
"2963517242"
],
"abstract": [
"We propose a novel deep learning-based framework to tackle the challen... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Various works in this area aimed to promote existing supervised-learning networks as auto-encoders. For example, FoldingNet @cite_23 managed to learn global features of a 3D object through constructing a deformable 2D grid surface; PointWise @cite_20 considered theoretical smoothness of object surface; and, MortonNet @... | {
"cite_N": [
"@cite_20",
"@cite_23",
"@cite_17"
],
"mid": [
"2909765569",
"2796426482",
""
],
"abstract": [
"We present a novel approach to learning a point-wise, meaningful embedding for point-clouds in an unsupervised manner, through the use of neural-networks. The domain of poi... |
1907.12022 | 2965190089 | Traditional grid neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene comp... | Different from the common usage of finding a rich, concise feature embedding, SO-Net @cite_10 unsupervised learned a self-organizing map (SOM) for feature extraction and aggregation. Despite its novelty, few performance improvements were observed even when compared to PointNet or OctNet @cite_24 . Possible reasons incl... | {
"cite_N": [
"@cite_24",
"@cite_10"
],
"mid": [
"2556802233",
"2963719584"
],
"abstract": [
"We present OctNet, a representation for deep learning with sparse 3D data. In contrast to existing models, our representation enables 3D convolutional networks which are both deep and high resolut... |
1907.11941 | 2966630200 | Abstract There can be performance and vulnerability concerns with block ciphers, thus stream ciphers can used as an alternative. Although many symmetric key stream ciphers are fairly resistant to side-channel attacks, cryptographic artefacts may exist in memory. This paper identifies a significant vulnerability within ... | This paper focuses on the decrypting network traffic encrypted with ChaCha20-Poly1305 cipher. Prior studies have investigated potential vulnerabilities in cipher design and in cipher implementation. Researchers have found no vulnerabilities in ChaCha20 design. For example, differential attacks using techniques such as ... | {
"cite_N": [
"@cite_34",
"@cite_21",
"@cite_8"
],
"mid": [
"2336016133",
"2574027529",
"1577801461"
],
"abstract": [
"Recently, ChaCha20 (the stream cipher ChaCha with 20 rounds) is in the process of being a standardized and thus it attracts serious interest in cryptanalysis. The ... |
1907.11941 | 2966630200 | Abstract There can be performance and vulnerability concerns with block ciphers, thus stream ciphers can used as an alternative. Although many symmetric key stream ciphers are fairly resistant to side-channel attacks, cryptographic artefacts may exist in memory. This paper identifies a significant vulnerability within ... | ChaCha20 implementations may be vulnerable to side-channel attacks. While the cipher design may prevent timing attacks @cite_19 , correlating power electromagnetic radiation when specific cryptographic activities are performed may leak key stream information @cite_7 @cite_10 . Engendering instruction skips, for example... | {
"cite_N": [
"@cite_28",
"@cite_19",
"@cite_10",
"@cite_7"
],
"mid": [
"",
"2809200209",
"2768792654",
"2612613213"
],
"abstract": [
"",
"Salsa20 is a family of 256-bit stream ciphers designed in 2005 and submitted to eSTREAM, the ECRYPT Stream Cipher Project. Salsa20 ... |
1907.11941 | 2966630200 | Abstract There can be performance and vulnerability concerns with block ciphers, thus stream ciphers can used as an alternative. Although many symmetric key stream ciphers are fairly resistant to side-channel attacks, cryptographic artefacts may exist in memory. This paper identifies a significant vulnerability within ... | Cryptographic artefacts have been found in device memory. For instance, RSA keys may be discovered in virtual machine images @cite_32 @cite_1 . Studies have also discovered DES and AES cipher keys in cold-boot attacks @cite_17 , Skipjack and Twofish key blocks in virtual memory @cite_22 , and AES session keys in virtua... | {
"cite_N": [
"@cite_38",
"@cite_22",
"@cite_33",
"@cite_1",
"@cite_32",
"@cite_3",
"@cite_12",
"@cite_17"
],
"mid": [
"2935536571",
"2136331433",
"",
"2076132976",
"2154464007",
"2324374191",
"2912809249",
"2175377689"
],
"abstract": [
"Abst... |
1907.11914 | 2965936015 | We extend the state-of-the-art Cascade R-CNN with a simple feature sharing mechanism. Our approach focuses on the performance increases on high IoU but decreases on low IoU thresholds--a key problem this detector suffers from. Feature sharing is extremely helpful, our results show that given this mechanism embedded int... | Multi-stage object detectors are very popular in recent years. Following the main idea of divide and conquer', these detectors optimze a simpler problem first, and then refine the difficult progressively. In the field of object detection, cascade can be introduced into two components, namely the proposal generation pro... | {
"cite_N": [
"@cite_18",
"@cite_22",
"@cite_7",
"@cite_8",
"@cite_19",
"@cite_2",
"@cite_25",
"@cite_12",
"@cite_17"
],
"mid": [
"",
"2420613611",
"2912662889",
"2964241181",
"1934410531",
"1932624639",
"2766430333",
"2102605133",
"296341836... |
1907.11914 | 2965936015 | We extend the state-of-the-art Cascade R-CNN with a simple feature sharing mechanism. Our approach focuses on the performance increases on high IoU but decreases on low IoU thresholds--a key problem this detector suffers from. Feature sharing is extremely helpful, our results show that given this mechanism embedded int... | Feature sharing has also been taken in many approaches. In @cite_14 , sharing features in RPN stage can improve the performance and similar results can be found in @cite_6 @cite_7 across different tasks. Different from these methods, our approach not only focuses on the overall improvements but also narrowing the gap w... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_6"
],
"mid": [
"2565639579",
"2912662889",
"2743473392"
],
"abstract": [
"Feature pyramids are a basic component in recognition systems for detecting objects at different scales. But pyramid representations have been avoided in recent obj... |
1907.12051 | 2965243075 | Sparse Network Coding (SNC) has been a promising network coding scheme as an improvement for Random Linear Network Coding (RLNC) in terms of the computational complexity. However, in this literature, there has been no analytical expressions for the probability of decoding a fraction of source messages after transmissio... | The probability of decoding a fraction of source packets in RLNC scheme has been a major research topic, in context of both performance @cite_22 and security @cite_2 . The authors of @cite_2 showed an upper bound for the possibility of decoding a fraction of source packets, while in @cite_22 , the authors derived exact... | {
"cite_N": [
"@cite_5",
"@cite_10",
"@cite_22",
"@cite_2"
],
"mid": [
"2766982895",
"1882115122",
"2613932151",
"68293075"
],
"abstract": [
"Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latenc... |
1907.12051 | 2965243075 | Sparse Network Coding (SNC) has been a promising network coding scheme as an improvement for Random Linear Network Coding (RLNC) in terms of the computational complexity. However, in this literature, there has been no analytical expressions for the probability of decoding a fraction of source messages after transmissio... | Rateless codes such as LT and Raptor codes, can be considered as a binary implementation of SNC @cite_18 @cite_0 and partial decoding probability has been a major research topic in the literature of rateless codes. To mention a few, the authors of @cite_14 designed an algorithm for an optimal recovery rate, i.e. partia... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_28",
"@cite_9",
"@cite_0",
"@cite_17"
],
"mid": [
"",
"2129824524",
"2172232382",
"2100207307",
"",
"2133349749"
],
"abstract": [
"",
"Fountain codes are designed so that all input symbols can be recovered fro... |
1907.12051 | 2965243075 | Sparse Network Coding (SNC) has been a promising network coding scheme as an improvement for Random Linear Network Coding (RLNC) in terms of the computational complexity. However, in this literature, there has been no analytical expressions for the probability of decoding a fraction of source messages after transmissio... | Another interesting research is Instantly Decodable Network Coding (IDNC) @cite_12 . In this scheme, the packets are sent in a way that an instant decoding of at least one of the source packets is guaranteed. However, the analysis on the partial decoding probability of this family of codes, such as @cite_16 and @cite_2... | {
"cite_N": [
"@cite_24",
"@cite_16",
"@cite_12"
],
"mid": [
"2949575255",
"1980811884",
""
],
"abstract": [
"Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download... |
1907.12051 | 2965243075 | Sparse Network Coding (SNC) has been a promising network coding scheme as an improvement for Random Linear Network Coding (RLNC) in terms of the computational complexity. However, in this literature, there has been no analytical expressions for the probability of decoding a fraction of source messages after transmissio... | The authors of @cite_13 and @cite_19 introduced and analyzed an improvement for the SNC scheme called perpetual coding. However, this coding scheme is not completely random and uses a structured type of coding to send packets, and the analysis on this coding scheme can not be extended to random SNC scheme, which is the... | {
"cite_N": [
"@cite_19",
"@cite_13"
],
"mid": [
"2564688069",
"1983476430"
],
"abstract": [
"Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the pres... |
1907.11907 | 2966776769 | Lemmatization, finding the basic morphological form of a word in a corpus, is an important step in many natural language processing tasks when working with morphologically rich languages. We describe and evaluate Nefnir, a new open source lemmatizer for Icelandic. Nefnir uses suffix substitution rules, derived from a l... | Machine learning methods emerged to make the rule-learning process more effective, and various algorithms have been developed. These methods rely on training data, which can be a corpus of words and their lemmas or a large morphological lexicon @cite_6 . By analyzing the training data, transformation rules are formed, ... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2141457256"
],
"abstract": [
"We propose a method to automatically train lemmatization rules that handle prefix, infix and suffix changes to generate the lemma from the full form of a word. We explain how the lemmatization rules are created and how the lemmatiz... |
1907.12108 | 2965617855 | In this paper, we present an end-to-end empathetic conversation agent CAiRE. Our system adapts TransferTransfo (, 2019) learning approach that fine-tunes a large-scale pre-trained language model with multi-task objectives: response language modeling, response prediction and dialogue emotion detection. We evaluate our m... | Previous work @cite_12 @cite_5 @cite_0 showed that leveraging a large amount of data to learn context-sensitive features from a language model can create state-of-the-art models for a wide range of tasks. Taking this further, deployed higher capacity models and improved the state-of-the-art results. In this paper, we b... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_12"
],
"mid": [
"2896457183",
"2950813464",
"2787560479"
],
"abstract": [
"We introduce a new language representation model called BERT, which stands for Bidirectional Encoder Representations from Transformers. Unlike recent language repre... |
1907.11866 | 2966500445 | Wirelessly powered backscatter communication (WPBC) has been identified as a promising technology for low-power communication systems, which can reap the benefits of energy beamforming to improve energy transfer efficiency. Existing studies on energy beamforming fail to simultaneously take energy supply and information... | Significant progress has recently been made on the energy beamforming in wireless powered communication @cite_5 @cite_1 @cite_2 @cite_9 . To harness the benefits of energy beamforming, there have been many efforts made to enable energy beamforming in WPBC. @cite_0 focus on optimizing the transmit beamforming to maximiz... | {
"cite_N": [
"@cite_8",
"@cite_9",
"@cite_1",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_10"
],
"mid": [
"2791237814",
"2897693927",
"2963423274",
"2783633736",
"2888460575",
"2584574674",
"2964056649"
],
"abstract": [
"The integration of wireless powe... |
1907.11817 | 2954117579 | Source code similarity are increasingly used in application development to identify clones, isolate bugs, and find copy-rights violations. Similar code fragments can be very problematic due to the fact that errors in the original code must be fixed in every copy. Other maintenance changes, such as extensions or patches... | Clones can be broadly categorized into four types based on the nature of their similarity @cite_40 @cite_42 @cite_5 @cite_48 . : are clone pairs that are identical to each other with no modification to the source code. : are clone pairs that are only different in literals and variable types. : are renamed clone pairs w... | {
"cite_N": [
"@cite_48",
"@cite_42",
"@cite_40",
"@cite_23",
"@cite_5",
"@cite_12"
],
"mid": [
"",
"2041190309",
"2101832700",
"2119686964",
"2025962632",
"2042092487"
],
"abstract": [
"",
"Abstract Context Reusing software by means of copy and paste is... |
1907.11817 | 2954117579 | Source code similarity are increasingly used in application development to identify clones, isolate bugs, and find copy-rights violations. Similar code fragments can be very problematic due to the fact that errors in the original code must be fixed in every copy. Other maintenance changes, such as extensions or patches... | Several approaches have been proposed in the literature to identify similar source code ranging from textual to semantic similarity identification. Generally, they're classified based on the source representations they work with. In , the raw source code, with minimal transformation, is used to perform a pairwise compa... | {
"cite_N": [
"@cite_37",
"@cite_36",
"@cite_27",
"@cite_16",
"@cite_25"
],
"mid": [
"1698439592",
"2096491586",
"2128698639",
"2157532207",
"2109943392"
],
"abstract": [
"This paper presents a technique to automatically identify duplicate and near duplicate functio... |
1907.11817 | 2954117579 | Source code similarity are increasingly used in application development to identify clones, isolate bugs, and find copy-rights violations. Similar code fragments can be very problematic due to the fact that errors in the original code must be fixed in every copy. Other maintenance changes, such as extensions or patches... | Generally, similar code identification techniques work at varying level of granularity. detection leverages tokens, statements and lines as the basis for detection and comparison @cite_32 . On the other hand, detection uses functions, methods, classes, or program files as the basic units of detection @cite_40 . Natural... | {
"cite_N": [
"@cite_40",
"@cite_4",
"@cite_32"
],
"mid": [
"2101832700",
"2547865220",
"2138756793"
],
"abstract": [
"Over the last decade many techniques and tools for software clone detection have been proposed. In this paper, we provide a qualitative comparison and evaluation o... |
1907.11817 | 2954117579 | Source code similarity are increasingly used in application development to identify clones, isolate bugs, and find copy-rights violations. Similar code fragments can be very problematic due to the fact that errors in the original code must be fixed in every copy. Other maintenance changes, such as extensions or patches... | Another challenge in finding duplicate code is the performance of querying and retrieving possible matches from a large code base. Fingerprinting and hashing have been used to improve the search efficiency @cite_44 . Hashing maps variable size source code to a fixed size fingerprint that can later be used to query and ... | {
"cite_N": [
"@cite_38",
"@cite_14",
"@cite_28",
"@cite_44",
"@cite_31",
"@cite_12"
],
"mid": [
"2018986336",
"1996676702",
"2809551588",
"",
"2511803001",
"2042092487"
],
"abstract": [
"Clone detection techniques essentially cluster textually, syntacticall... |
1907.11817 | 2954117579 | Source code similarity are increasingly used in application development to identify clones, isolate bugs, and find copy-rights violations. Similar code fragments can be very problematic due to the fact that errors in the original code must be fixed in every copy. Other maintenance changes, such as extensions or patches... | One way to capture the program semantic is the code Control Flow Graphs (CFGs) . CFGs are one of the intermediate code representations that describes in graph notation, all paths that might be followed through a piece of code during its execution @cite_34 . In CFGs, vertices represent basic blocks and edges (i.e., arcs... | {
"cite_N": [
"@cite_30",
"@cite_26",
"@cite_33",
"@cite_7",
"@cite_8",
"@cite_41",
"@cite_24",
"@cite_34"
],
"mid": [
"2127637733",
"",
"2101134669",
"2001114671",
"2128006558",
"2508465325",
"2115971347",
"2117426803"
],
"abstract": [
"Any ... |
1907.11845 | 2964526184 | Generative adversarial networks (GANs) has proven hugely successful in variety of applications of image processing. However, generative adversarial networks for handwriting is relatively rare somehow because of difficulty of handling sequential handwriting data by Convolutional Neural Network (CNN). In this paper, we p... | : The GANs proposed on 2019 @cite_1 aims at generating realistic images of handwritten texts, which is naturally a fit for Optical Character Recognition (OCR). The authors use bidirectional LSTM recurrent layers to get an embedding of the word to be rendered, and then feed it to the generator network. They also modify ... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2920553990"
],
"abstract": [
"State-of-the-art offline handwriting text recognition systems tend to use neural networks and therefore require a large amount of annotated data to be trained. In order to partially satisfy this requirement, we propose a system bas... |
1907.11845 | 2964526184 | Generative adversarial networks (GANs) has proven hugely successful in variety of applications of image processing. However, generative adversarial networks for handwriting is relatively rare somehow because of difficulty of handling sequential handwriting data by Convolutional Neural Network (CNN). In this paper, we p... | : Alex Grave proposed an RNN based generator model to mimic handwriting data @cite_12 , referred as throughout the whole paper. For each timestamp, encodes prefix sampled path to produce a set of parameters of a probability distribution of next stroke point, then sample the next stroke point given this distribution. Th... | {
"cite_N": [
"@cite_12"
],
"mid": [
"1810943226"
],
"abstract": [
"This paper shows how Long Short-term Memory recurrent neural networks can be used to generate complex sequences with long-range structure, simply by predicting one data point at a time. The approach is demonstrated for text (where... |
1907.11836 | 2966726302 | Massive multiple-input multiple-output (MIMO) with frequency division duplex (FDD) mode is a promising approach to increasing system capacity and link robustness for the fifth generation (5G) wireless cellular systems. The premise of these advantages is the accurate downlink channel state information (CSI) fed back fro... | Without any occupation of uplink bandwidth resources, @cite_31 and @cite_6 estimated downlink CSI from uplink CSI by using DL approach. In @cite_31 , the core idea was that since the same propagating environment was shared for both uplink and downlink channels, the environment information could be applied to downlink c... | {
"cite_N": [
"@cite_31",
"@cite_6"
],
"mid": [
"2904192264",
"2908955555"
],
"abstract": [
"Knowledge of the channel state information (CSI) at the transmitter side is one of the primary sources of information that can be used for efficient allocation of wireless resources. Obtaining Down... |
1907.11836 | 2966726302 | Massive multiple-input multiple-output (MIMO) with frequency division duplex (FDD) mode is a promising approach to increasing system capacity and link robustness for the fifth generation (5G) wireless cellular systems. The premise of these advantages is the accurate downlink channel state information (CSI) fed back fro... | As a whole, the DL-based and SC-based CSI feedback methods still face huge challenge, which can be summarized as follows: Concentrated on feedback reduction, the DL-based CSI feedback methods, e.g., the methods in @cite_34 -- @cite_10 , inevitably occupy uplink bandwidth resources. Although the occupation of uplink ban... | {
"cite_N": [
"@cite_21",
"@cite_6",
"@cite_31",
"@cite_34",
"@cite_10"
],
"mid": [
"2109711397",
"2908955555",
"2904192264",
"2963145597",
"2911910187"
],
"abstract": [
"In closed-loop FDD MIMO system, downlink channel state information (DL-CSI) is usually feedback... |
1907.11770 | 2965569712 | In this paper we compare learning-based methods and classical methods for navigation in virtual environments. We construct classical navigation agents and demonstrate that they outperform state-of-the-art learning-based agents on two standard benchmarks: MINOS and Stanford Large-Scale 3D Indoor Spaces. We perform detai... | Error analysis has played an important role in computer vision research such as object detection @cite_41 and VQA @cite_14 . Although many learning-based methods have recently been proposed for navigation @cite_11 @cite_3 @cite_2 @cite_29 @cite_33 , there has been little work focused on error analysis of state-of-the-a... | {
"cite_N": [
"@cite_14",
"@cite_33",
"@cite_41",
"@cite_29",
"@cite_3",
"@cite_2",
"@cite_34",
"@cite_13",
"@cite_11"
],
"mid": [
"2597425697",
"",
"1832500336",
"",
"",
"",
"2918642789",
"2929928372",
"2952578114"
],
"abstract": [
"... |
1907.11770 | 2965569712 | In this paper we compare learning-based methods and classical methods for navigation in virtual environments. We construct classical navigation agents and demonstrate that they outperform state-of-the-art learning-based agents on two standard benchmarks: MINOS and Stanford Large-Scale 3D Indoor Spaces. We perform detai... | Another line of research follows a more module approach by developing learning-based navigation modules which can be integrated to a larger network. For example, localization can be formulated as a 3-DOF or 6-DOF camera pose estimation problem and performed by a deep network @cite_22 @cite_7 @cite_21 . Learning-based a... | {
"cite_N": [
"@cite_18",
"@cite_22",
"@cite_7",
"@cite_36",
"@cite_28",
"@cite_21",
"@cite_43",
"@cite_25"
],
"mid": [
"",
"2556455135",
"2200124539",
"2795447360",
"2951660448",
"2592936284",
"2258731934",
""
],
"abstract": [
"",
"RANSA... |
1907.11653 | 2965308893 | The prediction of electrical power in combined cycle power plants is a key challenge in the electrical power and energy systems field. This power output can vary depending on environmental variables, such as temperature, pressure, and humidity. Thus, the business problem is how to predict the power output as a function... | Regarding the SL topic, many researches have focused on it due to its mentioned relevance, such as @cite_3 @cite_57 @cite_36 @cite_44 @cite_25 , and more recently in @cite_28 @cite_51 @cite_30 @cite_5 . The application of regression techniques to SL has been recently addressed in @cite_16 , where the authors cover the ... | {
"cite_N": [
"@cite_30",
"@cite_37",
"@cite_4",
"@cite_36",
"@cite_28",
"@cite_21",
"@cite_3",
"@cite_57",
"@cite_44",
"@cite_5",
"@cite_16",
"@cite_51",
"@cite_25"
],
"mid": [
"",
"2585528949",
"2574867284",
"2588336250",
"2762596667",
... |
1907.11752 | 2965643485 | Decision making under uncertain conditions has been well studied when uncertainty can only be considered at the associative level of information. The classical Theorems of von Neumann-Morgenstern and Savage provide a formal criterion for rationally making choices using associative information. We provide here a previou... | A previous attempt to formalize Decision Theory in the presence of Causal Information is given in @cite_53 , @cite_70 . According to such formulation, a decision maker must choose whatever action is more likely to (causally) produce desired outcomes while keeping any beliefs about causal relations fixed ( @cite_4 ). Th... | {
"cite_N": [
"@cite_4",
"@cite_70",
"@cite_41",
"@cite_53",
"@cite_59",
"@cite_11"
],
"mid": [
"1584574224",
"2020595559",
"1511574020",
"2038908222",
"1590902735",
"601509448"
],
"abstract": [
"This introduction to decision theory offers comprehensive and ... |
1907.11752 | 2965643485 | Decision making under uncertain conditions has been well studied when uncertainty can only be considered at the associative level of information. The classical Theorems of von Neumann-Morgenstern and Savage provide a formal criterion for rationally making choices using associative information. We provide here a previou... | @cite_43 provides a framework for defining the notions of cause and effect in terms of decision theoretical concepts, such as states and outcomes and gives a theoretical basis for graphical description of causes and effects, such as causal influence diagrams ( @cite_54 ). Heckerman gave an elegant definition of causali... | {
"cite_N": [
"@cite_43",
"@cite_54"
],
"mid": [
"1480413091",
"2169315100"
],
"abstract": [
"We present a definition of cause and effect in terms of decision-theoretic primitives and thereby provide a principled foundation for causal reasoning. Our definition departs from the traditional ... |
1907.11703 | 2966816175 | Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the... | Safe Reinforcement Learning tries to ensure reasonable system performance and or respect safety constraints during the learning and or deployment processes @cite_30 . Roughly, there are two ways of doing safe RL: some methods adapt the optimality criterion, while others adapt the exploration mechanism. Our work uses co... | {
"cite_N": [
"@cite_30"
],
"mid": [
"1845972764"
],
"abstract": [
"Safe Reinforcement Learning can be defined as the process of learning policies that maximize the expectation of the return in problems in which it is important to ensure reasonable system performance and or respect safety constrai... |
1907.11703 | 2966816175 | Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the... | Approaches such as DAgger @cite_31 formulate imitation learning as a supervised problem where the aim is to match the demonstrator performance. However, the performance of agents using these methods is upper-bounded by the demonstrator. Recent works such as Expert Iteration @cite_2 and AlphaGo Zero @cite_4 extend imita... | {
"cite_N": [
"@cite_10",
"@cite_31",
"@cite_4",
"@cite_2"
],
"mid": [
"2788862220",
"2962957031",
"2766447205",
"2618097077"
],
"abstract": [
"Deep reinforcement learning (RL) has achieved several high profile successes in difficult decision-making problems. However, these... |
1907.11703 | 2966816175 | Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the... | ( hester2017deep ) used demonstrator data by combining the supervised learning loss with the Q-learning loss within the DQN algorithm to pre-train and showed that their method achieves good results on Atari games by using a few minutes of game-play data. ( kim2013learning ) proposed a learning from demonstration approa... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2951680172"
],
"abstract": [
"Manipulation in clutter requires solving complex sequential decision making problems in an environment rich with physical interactions. The transfer of motion planning solutions from simulation to the real world, in open-loop, suff... |
1907.11703 | 2966816175 | Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the... | Previous work @cite_19 combined planning and RL in such a way that RL can explore on the action space filtered down by the planner, outperforming using either solely a planner or RL. Other work @cite_23 employed MCTS as a high-level planner, which is fed a set of low-level offline learned DRL policies and refines them ... | {
"cite_N": [
"@cite_19",
"@cite_23"
],
"mid": [
"2518731509",
"2911324515"
],
"abstract": [
"Automated planning and reinforcement learning are characterized by complementary views on decision making: the former relies on previous knowledge and computation, while the latter on interaction ... |
1907.11717 | 2966432599 | The benefits of the ubiquitous caching in information centric networking (ICN) are profound; even though such features make ICN promising for content distribution, but it also introduces a challenge to content protection against the unauthorized access. The protection of a content against unauthorized access requires c... | Most existing access control schemes for secure contents are application specific or lack security strength. For example, in @cite_0 , the authors presented a scheme for protected contents using network coding as encryption. However, the scheme requires a private connection between the publisher and consumer to obtain ... | {
"cite_N": [
"@cite_0",
"@cite_26",
"@cite_25"
],
"mid": [
"2328980985",
"2886568791",
"2514042371"
],
"abstract": [
"",
"The current internet architecture is inefficient in fulfilling the demands of newly emerging internet applications. To address this issue, several over-the... |
1907.11717 | 2966432599 | The benefits of the ubiquitous caching in information centric networking (ICN) are profound; even though such features make ICN promising for content distribution, but it also introduces a challenge to content protection against the unauthorized access. The protection of a content against unauthorized access requires c... | In earlier work @cite_35 , the authors proposed a content access control scheme for ICN enabled wireless edge. The proposed one is an extension of @cite_23 , which employs the public-key based algorithm and shamir's secret sharing as a building block, named AccConF. To obtain a unique interpolating polynomial of shamir... | {
"cite_N": [
"@cite_35",
"@cite_23"
],
"mid": [
"2590898937",
"2136452616"
],
"abstract": [
"The fast-growing Internet traffic is increasingly becoming content-based and driven by mobile users, with users more interested in data rather than its source. This has precipitated the need for a... |
1907.11717 | 2966432599 | The benefits of the ubiquitous caching in information centric networking (ICN) are profound; even though such features make ICN promising for content distribution, but it also introduces a challenge to content protection against the unauthorized access. The protection of a content against unauthorized access requires c... | In work by @cite_30 , an access control realized by a flexible secure content distribution architecture, which combins the proxy re-encryption and identity-based encryption mechanisms. The publisher generates a symmetric key and encrypt the content before dissemination. To access the content from in-network cache or di... | {
"cite_N": [
"@cite_30"
],
"mid": [
"1995965669"
],
"abstract": [
"Content-centric networking (CCN) project, a flavor of information-centric networking (ICN), decouples data from its source by shifting the emphasis from hosts and interfaces to information. As a result, content becomes directly ac... |
1907.11717 | 2966432599 | The benefits of the ubiquitous caching in information centric networking (ICN) are profound; even though such features make ICN promising for content distribution, but it also introduces a challenge to content protection against the unauthorized access. The protection of a content against unauthorized access requires c... | In other work @cite_33 , author proposed a content access control scheme based on proxy re-encryption. In proxy re-encryption the content is re-encrypted by an intermediate node. In proposed scheme the edge routers perform the content re-encryption. Upon receiving a content request, the publisher encrypts the data and ... | {
"cite_N": [
"@cite_33"
],
"mid": [
"1567993328"
],
"abstract": [
"Shifting from host-oriented to data-oriented, information-centric networking (ICN) adopts several key design principles, e.g., in-network caching, to cope with the tremendous internet growth. In the ICN setting, data to be distrib... |
1907.11717 | 2966432599 | The benefits of the ubiquitous caching in information centric networking (ICN) are profound; even though such features make ICN promising for content distribution, but it also introduces a challenge to content protection against the unauthorized access. The protection of a content against unauthorized access requires c... | In another study @cite_7 , the authors presented an access control scheme for the encrypted content in ICN, which is based on the efficient unidirectional proxy re-encryption (EU-PRE) proposed by @cite_3 . The proposed scheme, named efficient unidirectional re-encryption (EU-RE), simplifies EU-PRE by eliminating the ne... | {
"cite_N": [
"@cite_10",
"@cite_3",
"@cite_20",
"@cite_7"
],
"mid": [
"",
"2116361063",
"2160964355",
"2291877322"
],
"abstract": [
"",
"Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the ... |
1907.11718 | 2964674144 | We propose to solve large scale Markowitz mean-variance (MV) portfolio allocation problem using reinforcement learning (RL). By adopting the recently developed continuous-time exploratory control framework, we formulate the exploratory MV problem in high dimensions. We further show the optimality of a multivariate Gaus... | The difficulty of seeking the global optimum for Markov Decision Process (MDP) problems under the MV criterion has been previously noted in @cite_30 . In fact, the variance of reward-to-go is nonlinear in expectation and, as a result of Bellman's inconsistency, most of the well-known RL algorithms cannot be applied dir... | {
"cite_N": [
"@cite_30"
],
"mid": [
"2038398071"
],
"abstract": [
"We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomized or history-based policies can improve performance... |
1907.11718 | 2964674144 | We propose to solve large scale Markowitz mean-variance (MV) portfolio allocation problem using reinforcement learning (RL). By adopting the recently developed continuous-time exploratory control framework, we formulate the exploratory MV problem in high dimensions. We further show the optimality of a multivariate Gaus... | Existing works on variance estimation and control generally divide into value based methods and policy based methods. @cite_29 obtained the Bellman's equation for the variance of reward-to-go under a fixed , given policy. @cite_15 further derived the TD(0) learning rule to estimate the variance, followed by @cite_7 whi... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_7",
"@cite_29",
"@cite_15",
"@cite_16",
"@cite_17"
],
"mid": [
"2141203641",
"2963856199",
"",
"2313791856",
"2566307933",
"89883662",
"1526449679"
],
"abstract": [
"In many sequential decision-making probl... |
1907.11830 | 2966222024 | 360° images are usually represented in either equirectangular projection (ERP) or multiple perspective projections. Different from the flat 2D images, the detection task is challenging for 360° images due to the distortion of ERP and the inefficiency of perspective projections. However, existing methods mostly focus on... | : Recent advances in 360 @math images resort to geometric information on the sphere. @cite_13 represent the ERP with a weighted graph, and apply the graph convolutional network to generate graph-based representations. @cite_9 propose SO(3) 3D rotation group for retrieval and classification tasks on spherical images. On... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_28",
"@cite_9",
"@cite_32",
"@cite_6",
"@cite_15",
"@cite_13"
],
"mid": [
"",
"2950477723",
"2807732111",
"2796422723",
"2895696451",
"2895250390",
"2963609011",
"2738767782"
],
"abstract": [
"",
... |
1907.11830 | 2966222024 | 360° images are usually represented in either equirectangular projection (ERP) or multiple perspective projections. Different from the flat 2D images, the detection task is challenging for 360° images due to the distortion of ERP and the inefficiency of perspective projections. However, existing methods mostly focus on... | : The promising modern object detectors are usually based on two-stage approaches. The Region-based CNN (R-CNN) approach @cite_17 attends to a set of candidate region proposals @cite_12 in the first stage, and then uses a convolutional network to regress the bounding boxes and classify the objects in the second stage. ... | {
"cite_N": [
"@cite_26",
"@cite_14",
"@cite_11",
"@cite_7",
"@cite_8",
"@cite_1",
"@cite_3",
"@cite_19",
"@cite_23",
"@cite_2",
"@cite_25",
"@cite_12",
"@cite_17"
],
"mid": [
"",
"2579985080",
"2796347433",
"2194775991",
"2570343428",
""... |
1907.11830 | 2966222024 | 360° images are usually represented in either equirectangular projection (ERP) or multiple perspective projections. Different from the flat 2D images, the detection task is challenging for 360° images due to the distortion of ERP and the inefficiency of perspective projections. However, existing methods mostly focus on... | : Object detection in spherical images is an emerging task in computer vision, and several efforts @cite_32 @cite_15 @cite_31 have been made to push forward this issue. @cite_15 utilize the network distillation in the network. This approach applies regular CNN to a specific tangent plane with origin aligned to the obje... | {
"cite_N": [
"@cite_15",
"@cite_31",
"@cite_32"
],
"mid": [
"2963609011",
"2804322746",
"2895696451"
],
"abstract": [
"While 360° cameras offer tremendous new possibilities in vision, graphics, and augmented reality, the spherical images they produce make core feature extraction n... |
1907.11357 | 2965380104 | As a pixel-level prediction task, semantic segmentation needs large computational cost with enormous parameters to obtain high performance. Recently, due to the increasing demand for autonomous systems and robots, it is significant to make a tradeoff between accuracy and inference speed. In this paper, we propose a nov... | Real-time semantic segmentation network requires finding a trade-off between high-quality prediction and high-inference speed. ENet @cite_8 is the first network to be designed in real time, it trims a great number of convolution filters to reduce computation. ICNet @cite_21 proposes an image cascade network that incorp... | {
"cite_N": [
"@cite_8",
"@cite_29",
"@cite_21",
"@cite_2",
"@cite_20"
],
"mid": [
"2419448466",
"2790933182",
"2611259176",
"2886934227",
"2762439315"
],
"abstract": [
"The ability to perform pixel-wise semantic segmentation in real-time is of paramount importance ... |
1907.11357 | 2965380104 | As a pixel-level prediction task, semantic segmentation needs large computational cost with enormous parameters to obtain high performance. Recently, due to the increasing demand for autonomous systems and robots, it is significant to make a tradeoff between accuracy and inference speed. In this paper, we propose a nov... | Dilated convolution @cite_23 inserts zeros between each pixel in a standard convolution, which leads to a large effective receptive field without increasing parameters, hence it is generally used in semantic segmentation models. In DeepLab series @cite_40 @cite_35 @cite_3 , an atrous spatial pyramid pooling (ASPP) modu... | {
"cite_N": [
"@cite_35",
"@cite_3",
"@cite_39",
"@cite_40",
"@cite_23"
],
"mid": [
"2630837129",
"2787091153",
"2799213142",
"2412782625",
"1610060839"
],
"abstract": [
"In this work, we revisit atrous convolution, a powerful tool to explicitly adjust filter's fiel... |
1907.11357 | 2965380104 | As a pixel-level prediction task, semantic segmentation needs large computational cost with enormous parameters to obtain high performance. Recently, due to the increasing demand for autonomous systems and robots, it is significant to make a tradeoff between accuracy and inference speed. In this paper, we propose a nov... | Convolution factorization divides a standard convolution operation into several steps to reduce the computational cost and memory, which is extensively adopted in lightweight CNN models. Inception @cite_11 @cite_25 @cite_1 employ several small-sized convolutions to replace the convolution with large kernel size while m... | {
"cite_N": [
"@cite_36",
"@cite_1",
"@cite_17",
"@cite_0",
"@cite_15",
"@cite_25",
"@cite_11"
],
"mid": [
"2531409750",
"2274287116",
"2963125010",
"2612445135",
"2963163009",
"2183341477",
""
],
"abstract": [
"We present an interpretation of Incept... |
1907.11484 | 2966798122 | In recent years, object detection has shown impressive results using supervised deep learning, but it remains challenging in a cross-domain environment. The variations of illumination, style, scale, and appearance in different domains can seriously affect the performance of detection models. Previous works use adversar... | Domain adaptation is a technique that adapts a model trained in one domain to another. Many related works try to define and minimize the distance of feature distributions between the data from different domains @cite_6 @cite_3 @cite_0 @cite_23 @cite_14 @cite_11 . For example, deep domain confusion (DDC) model @cite_14 ... | {
"cite_N": [
"@cite_14",
"@cite_3",
"@cite_6",
"@cite_0",
"@cite_23",
"@cite_10",
"@cite_11"
],
"mid": [
"1565327149",
"",
"2963826681",
"2768591600",
"2593768305",
"2962687275",
"2798681837"
],
"abstract": [
"Recent reports suggest that a generic s... |
1907.11484 | 2966798122 | In recent years, object detection has shown impressive results using supervised deep learning, but it remains challenging in a cross-domain environment. The variations of illumination, style, scale, and appearance in different domains can seriously affect the performance of detection models. Previous works use adversar... | Huang al propose that aligning the distributions of activations of intermediate layers can alleviate the covariate shift @cite_20 . This idea is similar to our work partly. However, instead of using a least squares generative adversarial network(LSGAN) @cite_18 loss to align distributions for semantic segmentation, we ... | {
"cite_N": [
"@cite_18",
"@cite_20"
],
"mid": [
"2593414223",
"2895168809"
],
"abstract": [
"Unsupervised learning with generative adversarial networks (GANs) has proven hugely successful. Regular GANs hypothesize the discriminator as a classifier with the sigmoid cross entropy loss funct... |
1907.11468 | 2965936489 | Deep learning has been shown to achieve impressive results in several domains like computer vision and natural language processing. Deep architectures are typically trained following a supervised scheme and, therefore, they rely on the availability of a large amount of labeled training data to effectively learn their p... | Neuro-symbolic approaches @cite_30 express the internal or output structure of the learner using logic. First-Order Logic (FOL) is often selected as the declarative framework for the knowledge because of its flexibility and expressive power. This class of methodologies is rooted in previous work from the Statistical Re... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_4",
"@cite_28",
"@cite_0",
"@cite_19",
"@cite_2",
"@cite_15",
"@cite_13",
"@cite_17"
],
"mid": [
"1545139845",
"2963277062",
"2804796373",
"2201744460",
"2772282934",
"2963572185",
"1977970897",
""... |
1907.11468 | 2965936489 | Deep learning has been shown to achieve impressive results in several domains like computer vision and natural language processing. Deep architectures are typically trained following a supervised scheme and, therefore, they rely on the availability of a large amount of labeled training data to effectively learn their p... | Within this class of approaches, it is of fundamental importance to define how to perform the fuzzy relaxation of the formulas in the knowledge base. For instance, @cite_31 introduces a learning framework where formulas are converted according to ukasiewicz logic t-norm and t-conorms. @cite_18 also proposes to convert ... | {
"cite_N": [
"@cite_28",
"@cite_31",
"@cite_18"
],
"mid": [
"2201744460",
"2621167405",
"2892114952"
],
"abstract": [
"Abstract This paper proposes a unified approach to learning from constraints, which integrates the ability of classical machine learning techniques to learn from ... |
1907.11468 | 2965936489 | Deep learning has been shown to achieve impressive results in several domains like computer vision and natural language processing. Deep architectures are typically trained following a supervised scheme and, therefore, they rely on the availability of a large amount of labeled training data to effectively learn their p... | From a learning point of view, different quantifier conversions can be taken into account and validated, as well. For instance, the arithmetic mean and maximum operator have been used to convert the universal and existential quantifiers in @cite_28 , respectively. Different possibilities have been considered for the un... | {
"cite_N": [
"@cite_28",
"@cite_14"
],
"mid": [
"2201744460",
"2963277062"
],
"abstract": [
"Abstract This paper proposes a unified approach to learning from constraints, which integrates the ability of classical machine learning techniques to learn from continuous feature-based represent... |
1907.11322 | 2966078947 | By expanding the connection of objects to the Internet and their entry to human life, the issue of security and privacy has become important. In order to enhance security and privacy on the Internet, many security protocols have been developed. Unfortunately, the security analyzes that have been carried out on these pr... | A factor that can help expand the IoT is to create confidence for users of this technology in terms of maintaining their privacy and security, because if there is no proper security in its infrastructure, damage to IoT-based equipment, the possibility of losing personal information, the loss of privacy, and even the di... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2686848947"
],
"abstract": [
"Within the next few years, billions of IoT devices will densely populate our cities. In this paper we describe a new type of threat in which adjacent IoT devices will infect each other with a worm that will rapidly spread over larg... |
1907.11322 | 2966078947 | By expanding the connection of objects to the Internet and their entry to human life, the issue of security and privacy has become important. In order to enhance security and privacy on the Internet, many security protocols have been developed. Unfortunately, the security analyzes that have been carried out on these pr... | Reviewing the proposed mechanisms and designing new models that are compatible with IoT-based devices are also very important. Given that an IoT system can include many objects with limited resources, it requires special protocols to ensure that privacy and security are guaranteed. Therefore, with the further developme... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_26",
"@cite_22",
"@cite_4",
"@cite_8",
"@cite_9",
"@cite_29",
"@cite_0",
"@cite_2",
"@cite_12"
],
"mid": [
"2755191230",
"2737663594",
"2737418893",
"2608333876",
"2732131698",
"2345110324",
"20431... |
1907.11322 | 2966078947 | By expanding the connection of objects to the Internet and their entry to human life, the issue of security and privacy has become important. In order to enhance security and privacy on the Internet, many security protocols have been developed. Unfortunately, the security analyzes that have been carried out on these pr... | Among different designing strategies of security protocols, attempts to design a secure ultralightweight protocol for constrained environment has a long (unsuccessful) history. Pioneer examples include SASI @cite_27 , RAPP @cite_1 , SLAP @cite_25 , LMAP @cite_10 and R @math AP @cite_11 and among the recent proposals is... | {
"cite_N": [
"@cite_13",
"@cite_28",
"@cite_1",
"@cite_17",
"@cite_3",
"@cite_19",
"@cite_27",
"@cite_23",
"@cite_5",
"@cite_15",
"@cite_10",
"@cite_25",
"@cite_20",
"@cite_11"
],
"mid": [
"2082342720",
"1484207026",
"2093422627",
"297037334... |
1907.11322 | 2966078947 | By expanding the connection of objects to the Internet and their entry to human life, the issue of security and privacy has become important. In order to enhance security and privacy on the Internet, many security protocols have been developed. Unfortunately, the security analyzes that have been carried out on these pr... | In the line of designing ultralightweight protocols, in @cite_7 , Tewari and Gupta proposed a new ultralightweight authentication protocol for IoT and claimed that their protocol satisfies all security requirements. However, in @cite_19 , an efficient passive secret disclosure attack is applied to this protocol. Moreov... | {
"cite_N": [
"@cite_19",
"@cite_16",
"@cite_4",
"@cite_7"
],
"mid": [
"2573616158",
"2887736592",
"2732131698",
"2516089876"
],
"abstract": [
"Internet of Things (IoT) is a technology in which for any object the ability to send data via communications networks is provided.... |
1907.11322 | 2966078947 | By expanding the connection of objects to the Internet and their entry to human life, the issue of security and privacy has become important. In order to enhance security and privacy on the Internet, many security protocols have been developed. Unfortunately, the security analyzes that have been carried out on these pr... | As a new emerging technology, blockchain is believed to provide higher data protection, reliability, transparency, and lower management costs compared to a conventional centralized database. Hence, it could be a promising solution for large scale IoT systems. Targeting those benefits Sidorov recently proposed an ultral... | {
"cite_N": [
"@cite_24"
],
"mid": [
"2907112888"
],
"abstract": [
"Previous research studies mostly focused on enhancing the security of radio frequency identification (RFID) protocols for various RFID applications that rely on a centralized database. However, blockchain technology is quickly eme... |
1907.11481 | 2966777976 | Good code quality is a prerequisite for efficiently developing maintainable software. In this paper, we present a novel approach to generate exploranative (explanatory and exploratory) data-driven documents that report code quality in an interactive, exploratory environment. We employ a template-based natural language ... | -- Code quality is multi-faceted and covers, for instance, testability, maintainability, and readability. To examine these aspects, certain quality attributes (e.g., coupling, complexity, size) are quantified by underlying software metrics; for instance, McCabe's software complexity metrics measure readability aspects ... | {
"cite_N": [
"@cite_64",
"@cite_44",
"@cite_43",
"@cite_51",
"@cite_15",
"@cite_13"
],
"mid": [
"",
"",
"2158864412",
"2039978418",
"2167363007",
"1964962870"
],
"abstract": [
"",
"",
"Given the central role that software development plays in the de... |
1907.11481 | 2966777976 | Good code quality is a prerequisite for efficiently developing maintainable software. In this paper, we present a novel approach to generate exploranative (explanatory and exploratory) data-driven documents that report code quality in an interactive, exploratory environment. We employ a template-based natural language ... | -- Visualizations included into the lines or paragraphs of a text are known as @cite_56 , @cite_36 , or graphics @cite_12 . They allow close and coherent integration of the textual and visual representations of data. Some approaches apply these in the context of software engineering and embed them into the code to assi... | {
"cite_N": [
"@cite_33",
"@cite_7",
"@cite_36",
"@cite_41",
"@cite_21",
"@cite_56",
"@cite_45",
"@cite_46",
"@cite_12"
],
"mid": [
"2040362995",
"2050888673",
"2590534375",
"2796075754",
"2108958711",
"",
"2898193680",
"2005775881",
"1995073... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.