Deep neural networks are vulnerable to a range of adversaries. A particularly pernicious class of vulnerabilities are backdoors, where model predictions diverge in the presence of subtle triggers in inputs. An attacke...
详细信息
ISBN:
(数字)9781665490627
ISBN:
(纸本)9781665490627
Deep neural networks are vulnerable to a range of adversaries. A particularly pernicious class of vulnerabilities are backdoors, where model predictions diverge in the presence of subtle triggers in inputs. An attacker can implant a backdoor by poisoning the training data to yield a desired target prediction on triggered inputs. We study backdoors in the context of deep-learning for source code. (1) We define a range of backdoor classes for source-code tasks and install backdoors using dataset poisoning. (2) We adapt and improve recent algorithms from robust statistics for our setting, showing that backdoors leave a spectral signature in the learned representation of source code, thus enabling detection of poisoned data. (3) We conduct a thorough evaluation on different architectures and languages, showing the ease of injecting backdoors and our ability to eliminate them.
database Schema Evolution and Meta-Modeling : 9thinternationalworkshop on foundations of models and languages for data and objects, Fomlado/Demm 2000, Dagstuhl Castle, Germany, September 18-21, 2000 : Selected Paper...
详细信息
database Schema Evolution and Meta-Modeling : 9thinternationalworkshop on foundations of models and languages for data and objects, Fomlado/Demm 2000, Dagstuhl Castle, Germany, September 18-21, 2000 : Selected Papers by internationalworkshop on foundations of models; languages for data; objects (9th : 2000 Dagstuhl, Wadern, Germany); Balsters, Herman, 1952-; Brock, Bert De; Conrad, S. (Stefan); published by Berlin ; New York : Springer
the relationship between cultural heritage, digital technologies and visual models involves an increasingly wide area of research, oriented towards the renewal of archives and museums for the preservation and promotio...
详细信息
the relationship between cultural heritage, digital technologies and visual models involves an increasingly wide area of research, oriented towards the renewal of archives and museums for the preservation and promotion of culture. Recent research activities are the result of the progressive strengthening of digital technologies and the needs of a new generation of "digital" users, which requires museums to update their means of communication using Semantic Web languages and technologies shaped by a social conceptualization of a graph-based representation of information. the growth of several digitized heritage collections increases the necessity of proper methodologies to develop a structured system able to access to these collections and the large amount of data, metadata and paradata related to the digitized objects in a structured and organized way, defining a set of collection information models (CIM), that considers not only the digitizing process but also the data collection process, layered by an Upper Ontology level structure, based on CIDOC-CRM.
data Stream Management Systems (DSMS) represent a vibrant research area that is rich in technical challenges, which many projects have approached by extending database query languages and models for continuous queries...
详细信息
ISBN:
(纸本)9781450306096
data Stream Management Systems (DSMS) represent a vibrant research area that is rich in technical challenges, which many projects have approached by extending database query languages and models for continuous queries on data streams [1, 3, 4, 9, 5]. these database-inspired approaches have delivered remarkable systems and applications, but have yet to produce solid conceptual foundations for DSMS datamodels and query languages|particularly if we compare withthe extraordinary ones of relational databases. A cornerstone of the success of relational databases was the tight coupling between their data model and their logic-based query languages. In this paper, we show that a similar approach can succeed for data streams and propose a tight-coupled design for DSMS datamodels and query languages. To express more naturally the behavior of a data stream and attain more powerful on-line queries, we abandon the set-of-tuples model of relational databases, and instead use sequences of tuples ordered by their time-stamps as our data stream model. this approach allows us to overcome the blocking problem that severely impairs the expressive power of data stream query languages. As elucidated in [1]: A blocking query operator is one that cannot produce the first tuple of the output until it has seen the entire input. Previous work had characterized blocking query operators by their nonmonotonic behavior [7, 6, 8]. In this paper, we instead use the closed-world assumption [11, 10] to characterize blocking/ nonblocking behaviors with respect to the incompleteness/ completeness of the streaming database. From this, we infer simple syntactic conditions that make datalog rules immune from blocking. A significant and surprising new result is that the use of negated goals in the bodies of rules does not imply a blocking behavior: in fact, many very useful nonblocking queries can be expressed using negation. the ip side of this exciting result is that additional conditions must then be
the proceedings contain 13 papers. the special focus in this conference is on foundations of models and languages for data and objects. the topics include: Federated transaction management with snapshot isolation;seri...
ISBN:
(纸本)9783540672012
the proceedings contain 13 papers. the special focus in this conference is on foundations of models and languages for data and objects. the topics include: Federated transaction management with snapshot isolation;serializability, concurrency control, and replication control;logical update queries as open nested transactions;inheritance in a deductive object database language with updates;specifying distributed and dynamically evolving information systems using an extended co-nets approach;specifying active rules for database maintenance;nested transactions with integrity constraints;declarative specifications of complex transactions;a support for increasing performance and multi-tier applications;execution guarantees in electronic commerce payments;transactions in mobile electronic commerce;transactions and electronic commerce and overview and discussion topics.
the proceedings contain 13 papers. the special focus in this conference is on database Schema Evolution and Meta-Modeling. the topics include: Consistency management in runtime evolving concurrent information systems;...
ISBN:
(纸本)3540422722
the proceedings contain 13 papers. the special focus in this conference is on database Schema Evolution and Meta-Modeling. the topics include: Consistency management in runtime evolving concurrent information systems;adaptive specifications of technical information systems;evolving the software of a schema evolution system;schema evolution and versioning;a logical and computational characterisation;temporal branching as a conflict management technique;QFD matrix for incremental construction of a warehouse via data marts;change propagation in an axiomatic model of schema evolution for objectbase management systems;conceptual description of adaptive information systems;extending the object query language for transparent metadata access;a metamodeling approach to evolution and defining metrics for conceptual schema evolution.
Structured document databases can be naturally viewed as derivation trees of a context-free grammar. Under this view, the classical formalism of attribute grammars becomes a formalism for structured document query lan...
详细信息
Structured document databases can be naturally viewed as derivation trees of a context-free grammar. Under this view, the classical formalism of attribute grammars becomes a formalism for structured document query languages, From this perspective, we studs the expressive power of BAGs: Boolean-valued attribute grammars with propositional logic formulas as semantic rules, and RAGs: relation-valued attribute grammars with first-order logic formulas as semantic rules. BAGs can express only unary queries;RAGs can express queries of any arity. We first show that the (unary) queries expressible by BAGs are precisely those definable in monadic second-order logic, We then show that the queries expressible by RAGs are precisely those definable by first-order inductions of linear depth, or, equivalently, those computable in linear time on a parallel machine with polynomially many processors. Further, we show that RAGs that only use synthesized attributes are strictly weaker than RAGs that use both synthesized and inherited attributes. We show that RAGs are more expressive than monadic second-order logic for queries of any arity. Finally, we discuss relational attribute grammars in the context of BAGs and RAGs, We show that in the case of BAGs this does not increase the expressive power, while different semantics for relational RAGs capture the complexity classes NP, coNP and UP boolean AND coUP.
In this paper we consider the construction of a dimensional data warehouse. the warehouse is built beginning withthe first data mart and proceeding in an iterative manner constructing one mart at a time. In this way ...
详细信息
Today, information systems are essential parts of large organizations. Since such kinds of systems have a very long life-span, they have to be adapted to new changing requirements occurring during their lifetime. Evol...
详细信息
暂无评论