citing_id stringlengths 9 16 | cited_id stringlengths 9 16 | section_title stringlengths 0 2.25k | citation stringlengths 52 442 | text_before_citation list | text_after_citation list | keywords list | citation_intent stringclasses 3
values | citing_paper_content dict | cited_paper_content dict |
|---|---|---|---|---|---|---|---|---|---|
1905.09162 | 1801.00349 | Transferability | It should be noted that the success rate of attacks across different models could be improved for example by using optimizations that are not tailored to an individual networks #REFR or by obtaining better approximations of the user template. | [
"We don't find particular differences in different classifiers, with the maximum being slightly weaker against this attack. These findings are in line Sharif et al.",
"#OTHEREFR who report similar transferability for dodging attacks across different networks.",
"Table 5 does not show any particularly evident tr... | [] | [
"user template",
"attacks"
] | background | {
"title": "Biometric Backdoors: A Poisoning Attack Against Unsupervised Template Updating",
"abstract": "In this work, we investigate the concept of biometric backdoors: a template poisoning attack on biometric systems that allows adversaries to stealthily and effortlessly impersonate users in the long-term by exp... | {
"title": "Adversarial Generative Nets: Neural Network Attacks on State-of-the-Art Face Recognition.",
"abstract": "In this paper we show that misclassification attacks against face-recognition systems based on deep neural networks (DNNs) are more dangerous than previously demonstrated, even in contexts where the ... |
1911.10671 | 1710.02692 | I. INTRODUCTION AND MOTIVATION | Unfortunately, identification mechanisms based on clock-skews are rendered ineffective by the fine grained control of time-triggered interrupts on embedded devices which allows ECUs to potentially fake their clock-skews as demonstrated by #REFR . | [
"These works do not target the creation of a covert timing authentication channel, but they focus on optimization problems for CAN traffic.",
"Nonetheless, many recent research works have been focusing on using frame arrival time, i.e., the delays that we use to create a covert channel, in order to detect intrusi... | [
"All these works are exploiting the precision of the clock circuitry in the controller, which also stays at the core of our proposal here.",
"To save bits from the data-field, other works have suggested the use of the identifier field, i.e., #OTHEREFR , #OTHEREFR , #OTHEREFR and #OTHEREFR , but this requires spec... | [
"time-triggered interrupts"
] | background | {
"title": "CANTO -- Covert AutheNtication with Timing channels over Optimized traffic flows for CAN",
"abstract": "Abstract-Previous research works have endorsed the use of delays and clock skews for detecting intrusions or fingerprinting ECUs on the CAN bus. Similar techniques have been also proposed for establis... | {
"title": "Cloaking the Clock: Emulating Clock Skew in Controller Area Networks",
"abstract": "Automobiles are equipped with Electronic Control Units (ECUs) that communicate via in-vehicle network protocol standards such as the Controller Area Network (CAN). These protocols were designed under the assumption that ... |
1309.3842 | 1309.3845 | Thresholding | Comparing with the formula #REFR Theorem 4.3] for the black-and-white case, the first order term is the same, whereas the second order term now depends on ρ and β. | [
"Observe as in Sect",
"Here S ± (u) denote the support sets of a set S ⊆ R d :"
] | [
"The term involving Tr II is the same except for the terms ϕ",
"If ρ is concentrated near 0, so that θ X (z) approximates the Dirac measure δ z (X), then D is small.",
"Hence the formula is close to the corresponding formula in the black-and-white case."
] | [
"black-and-white case",
"Theorem"
] | result | {
"title": "Estimation of Intrinsic Volumes from Digital Grey-Scale Images",
"abstract": "Abstract Local algorithms are common tools for estimating intrinsic volumes from black-and-white digital images. However, these algorithms are typically biased in the design based setting, even when the resolution tends to inf... | {
"title": "Local digital algorithms for estimating the integrated mean curvature of r-regular sets",
"abstract": "Abstract Consider the design based situation where an r-regular set is sampled on a random lattice. A fast algorithm for estimating the integrated mean curvature based on this observation is to use a w... |
1511.00820 | 1309.3845 | The 3D situation | The weights w (1) from Table 5 are also optimal based on the results of #REFR for the design based setting where an r-regular set is observed on a randomly translated and rotated lattice. | [
"This is satisfied by the weights in Table 5 .",
"Proof.",
"The assertion follows from a comparison of Corollary 5.2 with the Miles formulas (6).",
"The weights in Table 5 fulfill the asserted condition since they fulfill (29) and Q 1 , . . .",
", Q 8 are the columns of the matrix Q."
] | [
"This follows since w (1) DQ 3 = 0 and w (9)] and hence that the estimator in the same theorem is unbiased.",
"Thus, the weights in Table 5 are an optimal choice for isotropic Boolean models in R 3 with compact convex grains satisfying Condition 3.2.",
"But in particular, they are also optimal based on the resu... | [
"rotated lattice"
] | method | {
"title": "Local digital algorithms applied to Boolean models",
"abstract": "We investigate the estimation of specific intrinsic volumes of stationary Boolean models by local digital algorithms; that is, by weighted sums of n × . . . × n configuration counts. We show that asymptotically unbiased estimators for the... | {
"title": "Local digital algorithms for estimating the integrated mean curvature of r-regular sets",
"abstract": "Abstract Consider the design based situation where an r-regular set is sampled on a random lattice. A fast algorithm for estimating the integrated mean curvature based on this observation is to use a w... |
1605.02935 | 1406.2059 | Related Work | Their approach is closely related to the partiality monad, introduced by Capretta, and used by several authors to give functional representations of big-step semantics, including Danielsson [25] and Abel and Chapman #REFR (who call it the delay monad ). | [
"Several papers have explored how to represent divergence in big-step semantics.",
"Leroy and Grall #OTHEREFR survey different approaches to representing divergence in coinductive big-step semantics, including divergence predicates, trace-based semantics, and taking the coinductive interpretation of standard big-... | [
"In the partiality monad, functions either return a finitely delayed result or an infinite trace of delays.",
"Piróg and Gibbons #OTHEREFR study the category theoretic foundations of the resumption monad.",
"Related to the resumption monad is the interactive I/O monad by Hancock and Setzer #OTHEREFR for modelin... | [
"big-step semantics",
"delay monad"
] | method | {
"title": "Flag-Based Big-Step Semantics",
"abstract": "Structural operational semantic specifications come in different styles: small-step and big-step. A problem with the big-step style is that specifying divergence and abrupt termination gives rise to annoying duplication. We present a novel approach to represe... | {
"title": "Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types",
"abstract": "In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The normalizer consists of two coinductively defined functions in the delay monad: One... |
1105.5852 | 0812.2591 | Taking r-th Roots | Below are some known cases that primitive roots of unity can be computed efficiently; see #REFR for more details. Let p be the characteristic of F q . | [
"3.1 Find a Non-trivial Factor of x r − β",
"We extend the square root algorithm in #OTHEREFR to show a deterministic algorithm, Algorithm 3.3, for finding a non-trivial factor of x r − β.",
"Unlike other algorithms, such as the generalized Shanks's algorithm, Algorithm 3.3 does not require any r-th nonresidue ... | [
"Denote a fixed primitive k-th root of unity in F q by ζ k .",
"(i) ζ 2 or ζ 3 when p ≡ 1 (mod 12).",
"(ii) ζ 2·3 n +1 for n ≥ 1 when 2 · 3 n + 1 is a prime and p ≡ 13, 25 (mod 36).",
"(iii) ζ r when q = r e t + 1 with t small.",
"The arithmetic of the square root algorithm in #OTHEREFR is carried out over ... | [
"primitive roots"
] | background | {
"title": "On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications",
"abstract": "We first show a deterministic algorithm for taking r-th roots over F q without being given any r-th nonresidue, where F q is a finite field with q elements and r is a small prime such that r 2 divides of... | {
"title": "On Taking Square Roots without Quadratic Nonresidues over Finite Fields",
"abstract": "Abstract. We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is... |
1105.5852 | 0812.2591 | Taking r-th Roots | The arithmetic of the square root algorithm in #REFR is carried out over a specially constructed group, G α , which is isomorphic to F × q and a degenerated elliptic curve. | [
"Below are some known cases that primitive roots of unity can be computed efficiently; see #OTHEREFR for more details. Let p be the characteristic of F q .",
"Denote a fixed primitive k-th root of unity in F q by ζ k .",
"(i) ζ 2 or ζ 3 when p ≡ 1 (mod 12).",
"(ii) ζ 2·3 n +1 for n ≥ 1 when 2 · 3 n + 1 is a p... | [
"Taking square root is obviously equivalent to finding a non-trivial factor of x 2 − β.",
"It is possible to formulate the algorithm in #OTHEREFR so that the arithmetic is carried out over the ring F q [x]/(x 2 − β) for factoring the polynomial x 2 − β.",
"We generalize this idea and work on the ring F q [x]/(x... | [
"square root algorithm"
] | method | {
"title": "On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications",
"abstract": "We first show a deterministic algorithm for taking r-th roots over F q without being given any r-th nonresidue, where F q is a finite field with q elements and r is a small prime such that r 2 divides of... | {
"title": "On Taking Square Roots without Quadratic Nonresidues over Finite Fields",
"abstract": "Abstract. We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is... |
1105.5852 | 0812.2591 | Taking r-th Roots | It is possible to formulate the algorithm in #REFR so that the arithmetic is carried out over the ring F q [x]/(x 2 − β) for factoring the polynomial x 2 − β. | [
"(i) ζ 2 or ζ 3 when p ≡ 1 (mod 12).",
"(ii) ζ 2·3 n +1 for n ≥ 1 when 2 · 3 n + 1 is a prime and p ≡ 13, 25 (mod 36).",
"(iii) ζ r when q = r e t + 1 with t small.",
"The arithmetic of the square root algorithm in #OTHEREFR is carried out over a specially constructed group, G α , which is isomorphic to F × q... | [
"We generalize this idea and work on the ring F q [x]/(x r − β) in Algorithm 3.3.",
"When r = 2, Algorithm 3.3 and the algorithm in #OTHEREFR are essentially the same.",
"The \"problem\" of working on the ring F q [x]/(x r − β) is that there are zero divisors.",
"However, if we have a zero divisor f (x), then... | [
"arithmetic"
] | method | {
"title": "On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications",
"abstract": "We first show a deterministic algorithm for taking r-th roots over F q without being given any r-th nonresidue, where F q is a finite field with q elements and r is a small prime such that r 2 divides of... | {
"title": "On Taking Square Roots without Quadratic Nonresidues over Finite Fields",
"abstract": "Abstract. We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is... |
1905.10310 | 1805.11973 | Generator | We use an MLP architecture as in #REFR , consisting of three hidden layers with 128, 256, 512 units and tanh activation, respectively. | [
"The generator network g θ (z, ε) takes a point z from latent space, and outputs a discrete-valued and symmetric graph adjacency tensor A and a discrete-valued node feature matrix X."
] | [
"We extend A and X to explicitly model the absence of edges and nodes by introducing a separate ghost-edge type and ghost-node type.",
"This will enable us to encourage the generator to produce chemically valid molecular graphs as described below.",
"Thus, we definẽ A ∈ {0, 1} n×n×(m+1) andX ∈ {0, 1} n×(d+1) ."... | [
"MLP architecture"
] | method | {
"title": "Likelihood-Free Inference and Generation of Molecular Graphs",
"abstract": "Recent methods for generating novel molecules use graph representations of molecules and employ various forms of graph convolutional neural networks for inference. However, training requires solving an expensive graph isomorphis... | {
"title": "MolGAN: An implicit generative model for small molecular graphs",
"abstract": "Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive searc... |
1907.08501 | 1803.00832 | RELATED WORK | And finally, also the WDAqua #REFR system aims for language-independence and for being agnostic of the underlying knowledge base. | [
"In contrast to traditional approaches, which first try to understand the question, and then evaluate the query, in gAnswer the intention of the query is modeled in a structured way, which leads to a subgraph matching problem.",
"Secondly, QAKiS #OTHEREFR is QA system over structured knowledge bases such as DBped... | [
"WDAqua puts more importance on word semantics than on the syntax of the user query, and follows a processes of query expansion, SPARQL construction, query ranking and then making an answer decision.",
"For the evaluation of QA systems, several benchmarks have been proposed such as WebQuestions #OTHEREFR or Simpl... | [
"underlying knowledge base"
] | background | {
"title": "A Comparative Evaluation of Visual and Natural Language Question Answering Over Linked Data",
"abstract": "With the growing number and size of Linked Data datasets, it is crucial to make the data accessible and useful for users without knowledge of formal query languages. Two approaches towards this goa... | {
"title": "Towards a Question Answering System over the Semantic Web",
"abstract": "Abstract. Thanks to the development of the Semantic Web, a lot of new structured data has become available on the Web in the form of knowledge bases (KBs). Making this valuable data accessible and usable for end-users is one of the... |
1801.09542 | 1712.08735 | A. Related Works | In #REFR , the authors use a greedy approach for the precoder design while using symbol-wise MSE as the design criterion. | [
"In #OTHEREFR the safety margin to the decision thresholds of the received Phase-Shift Keying (PSK) symbols is maximized subject to a relaxed 1-bit constraint using linear programming for flatfading channels and extended in #OTHEREFR for frequency-selective channels.",
"The same optimization problem was solved by... | [
"The contribution in #OTHEREFR addresses the task of QCE precoding in the context of using a single common PA and separate digital phase shifters for the antenna front-ends.",
"The optimization problem consists of designing the QCE precoder while minimizing the MUI, and the idea of constructive interference, #OTH... | [
"precoder design"
] | method | {
"title": "Quantized Constant Envelope Precoding With PSK and QAM Signaling",
"abstract": "Coarsely quantized massive multiple-input multiple-output (MIMO) systems are gaining more interest due to their power efficiency. We present a new precoding technique to mitigate the multi-user interference and the quantizat... | {
"title": "Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ",
"abstract": "A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is c... |
1709.04846 | 1712.08735 | APPENDIX B PROOF OF THEOREM 1 | Finally, to obtain (65), we used We note that (65) is equal to the RHS of #REFR , which concludes the proof. | [
"Hence, to prove Theorem 1, we need to show that the entry on the mth row and on the nth column of the RHS of (62) equals the RHS of (42) if we use (53) to evaluate C e .",
"Define u a = a/Δ and v b = b/Δ.",
"Then, we can write the entry on the mth row and nth column of the RHS of (62) as follows:",
"Here, to... | [] | [
"proof"
] | background | {
"title": "Linear Precoding With Low-Resolution DACs for Massive MU-MIMO-OFDM Downlink",
"abstract": "We consider the downlink of a massive multiuser (MU) multiple-input multiple-output (MIMO) system in which the base station (BS) is equipped with low-resolution digital-to-analog converters (DACs). In contrast to ... | {
"title": "Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ",
"abstract": "A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is c... |
2002.10384 | 1901.10310 | Related work | In #REFR , a learning system has access to multiple datasets, some of which are manipulated, and the authors prove a generalization bound and propose an algorithm based on learning with a weighted combination of all datasets. | [
"The author proves that it is possible to robustly learn individual hypotheses for each source, but a single shared hypothesis cannot be learned robustly.",
"For the specific case that all data distributions are identical, the setup matches ours, though only for binary classification in the realizable case, and w... | [
"The main difference to our work is that their proposed method crucially relies on a trusted subset of the data being known to the learner.",
"Their adversary is also weaker, as it cannot influence the data points directly, but only change the distribution from which they are sampled, and the work also does not p... | [
"datasets"
] | background | {
"title": "On the Sample Complexity of Adversarial Multi-Source PAC Learning",
"abstract": "We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze ... | {
"title": "Robust Learning from Untrusted Sources",
"abstract": "Modern machine learning methods often require more data for training than a single expert can provide. Therefore, it has become a standard procedure to collect data from external sources, e.g. via crowdsourcing. Unfortunately, the quality of these so... |
1610.04815 | 1701.05880 | C. Beyond QI | Our companion paper #REFR shows how locality further leads to scalability of the controller synthesis. | [
"Before introducing the class of localized SLCs, we present a simple example for which the QI framework fails to capture an \"obvious\" controller with localized structure, but for which the SLA can.",
"This example also serves to illustrate the importance of locality in achieving scalability of controller implem... | [
"Example 1: Consider the optimal control problem as follows: #OTHEREFR with disturbance w [t] i.i. d ∼ N(0, I) .",
"We assume full state feedback, i.e., the control action at time t can be expressed as",
"for some function f .",
"An optimal control policy u for this linear quadratic regulator (LQR) problem ... | [
"controller synthesis"
] | background | {
"title": "A System-Level Approach to Controller Synthesis",
"abstract": "Abstract-Biological and advanced cyber-physical control systems often have limited, sparse, uncertain, and distributed communication and computing in addition to sensing and actuation. Fortunately, the corresponding plants and performance re... | {
"title": "Separable and Localized System-Level Synthesis for Large-Scale Systems",
"abstract": "Abstract-A major challenge faced in the design of largescale cyber-physical systems, such as power systems, the Internet of Things or intelligent transportation systems, is that traditional distributed optimal control ... |
1610.04815 | 1701.05880 | VI. CONCLUSION | In our companion paper #REFR , we show how to use the SLA to the controller synthesis to co-design controllers, system responses, and actuation, sensing, and communication architectures for largescale networked systems. | [
"In this paper, we defined and analyzed the SLA to the controller synthesis, which consists of three elements: SLPs, SLCs, and SLS problems.",
"We showed that all achievable and stable system responses can be characterized via the SLPs given in Theorems 1 and 2.",
"We further showed that these system responses ... | [] | [
"controller synthesis",
"largescale networked systems"
] | method | {
"title": "A System-Level Approach to Controller Synthesis",
"abstract": "Abstract-Biological and advanced cyber-physical control systems often have limited, sparse, uncertain, and distributed communication and computing in addition to sensing and actuation. Fortunately, the corresponding plants and performance re... | {
"title": "Separable and Localized System-Level Synthesis for Large-Scale Systems",
"abstract": "Abstract-A major challenge faced in the design of largescale cyber-physical systems, such as power systems, the Internet of Things or intelligent transportation systems, is that traditional distributed optimal control ... |
1909.10092 | 1701.05880 | Conclusion and Future Work | Further, in the case of L 1 optimal control, the resulting robust performance criteria satisfy the partial-separability properties (assuming suitable structural constraints on the cost matrices) needed to apply the distributed synthesis techniques described in #REFR , thus making our results applicable to large-scale d... | [
"In this paper, we generalized the SLS parameterization of LTI ∞ -stabilizing controllers, as well as a robust counterpart, to systems described by bounded and causal linear operators.",
"This extension, along with a simple algebraic transformation, allowed us to leverage tools from L 1 robust control to derive n... | [
"More importantly, we believe that the results in this paper open up a wide and exciting range of future research directions, including but not limited to, deriving analogous results for H ∞ optimal control, revisiting the structured singular value, µ-synthesis, and structured small gain theorems from a system leve... | [
"resulting robust performance",
"distributed synthesis techniques"
] | method | {
"title": "Robust Performance Guarantees for System Level Synthesis",
"abstract": "We generalize the System Level Synthesis (SLS) framework to systems defined by bounded causal linear operators, and use this parameterization to make connections between robust SLS and classical results from the robust control liter... | {
"title": "Separable and Localized System-Level Synthesis for Large-Scale Systems",
"abstract": "Abstract-A major challenge faced in the design of largescale cyber-physical systems, such as power systems, the Internet of Things or intelligent transportation systems, is that traditional distributed optimal control ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.