English
Related papers

Related papers: Easily testable logical networks based on a 'widen…

200 papers

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to…

Logic · Mathematics 2012-03-20 Richard McKinley

We discuss the adequacy of tests for intelligent systems and practical problems raised by their implementation. We propose the replacement test as the ability of a system to replace successfully another system performing a task in a given…

Artificial Intelligence · Computer Science 2023-08-15 Joseph Sifakis

The spread of misinformation, propaganda, and flawed argumentation has been amplified in the Internet era. Given the volume of data and the subtlety of identifying violations of argumentation norms, supporting information analytics tasks,…

The purpose of this article is to explore the properties of integrable, purely transmitting, defects placed at the junctions of several one-dimensional domains within a network. The defect sewing conditions turn out to be quite restrictive…

High Energy Physics - Theory · Physics 2020-12-02 E. Corrigan , C. Zambon

Too many defective compute chips are escaping existing manufacturing tests -- at least an order of magnitude more than industrial targets across all compute chip types in data centers. Silent data corruptions (SDCs) caused by test escapes,…

As learning difficulty is crucial for machine learning (e.g., difficulty-based weighting learning strategies), previous literature has proposed a number of learning difficulty measures. However, no comprehensive investigation for learning…

Machine Learning · Computer Science 2022-09-20 Weiyao Zhu , Ou Wu , Fengguang Su , Yingjun Deng

Recent research interest in emerging logic systems based on quantum dots has been sparked by the experimental demonstration of nanometer-scale logic devices composed of atomically sized quantum dots made of silicon dangling bonds (SiDBs),…

Mesoscale and Nanoscale Physics · Physics 2023-08-09 Samuel S. H. Ng , Jeremiah Croshaw , Marcel Walter , Robert Wille , Robert Wolkow , Konrad Walus

While LLMs demonstrate impressive reasoning capabilities, they remain fragile in multi-step logical deduction, where a single transition error can propagate through the entire reasoning chain, leading to unstable performance. In this work,…

Computation and Language · Computer Science 2026-04-23 Seunghyun Park , Yuanyuan Lei

Globalization of IC manufacturing has led to increased security concerns, notably IP theft. Several logic locking techniques have been developed for protecting designs, but they typically display very large overhead, and are generally…

Cryptography and Security · Computer Science 2020-05-22 Joseph Sweeney , Mohammed Zackriya , Samuel Pagliarini , Lawrence Pileggi

At our behest or otherwise, while our software is being executed, a huge variety of design assumptions is continuously matched with the truth of the current condition. While standards and tools exist to express and verify some of these…

Software Engineering · Computer Science 2016-05-09 Vincenzo De Florio

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

Information Theory · Computer Science 2015-02-04 Tom Kealy , Oliver Johnson , Robert Piechocki

Deployment of distributed systems sets high requirements for procedures for the security testing of these systems. This work introduces: (1) a list of typical threats based on standards and actual practices; (2) an extended six-layered…

Cryptography and Security · Computer Science 2014-11-11 Vladimir A. Khlevnoy , Andrey A. Shchurov

This paper addresses the problem of designing LDPC decoders robust to transient errors introduced by a faulty hardware. We assume that the faulty hardware introduces errors during the message passing updates and we propose a general…

Information Theory · Computer Science 2016-11-17 Elsa Dupraz , David Declercq , Bane Vasic , Valentin Savin

Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.

Formal Languages and Automata Theory · Computer Science 2021-06-02 Artur Polański , Eryk Lipka

We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…

cmp-lg · Computer Science 2008-02-03 Jochen Doerre , Suresh Manandhar

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

Consider a large social network with possibly severe degree heterogeneity and mixed-memberships. We are interested in testing whether the network has only one community or there are more than one communities. The problem is known to be…

Methodology · Statistics 2018-07-24 Jiashun Jin , Zheng Tracy Ke , Shengming Luo

Consider the reliability problem in a system with two different devices, which can break down.

Signal Processing · Electrical Eng. & Systems 2018-11-30 E. A. Golovastova

There is a pressing need to interconnect physical systems such as power grid and vehicles for efficient management and safe operations. Owing to the diverse features of physical systems, there is hardly a one-size-fits-all networking…

Networking and Internet Architecture · Computer Science 2019-10-31 Qiang Liu , Tao Han , Nirwan Ansari

Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another…

Logic in Computer Science · Computer Science 2014-12-01 Antti Valmari