Robust Computation through Percolation

2011 ◽  
Vol 3 (2) ◽  
pp. 12-30 ◽  
Author(s):  
Mustafa Altun ◽  
Marc D. Riedel
Keyword(s):  
Boolean Functions ◽  
Defect Tolerance ◽  
Probabilistic Framework ◽  
Necessary And Sufficient Condition ◽  
Local Connectivity ◽  
Worst Case ◽  
Mapping Strategy ◽  
Necessary And Sufficient ◽  
Robust Computation ◽  
Random Connectivity

This paper proposes a probabilistic framework for digital computation with lattices of nanoscale switches based on the mathematical phenomenon of percolation. With random connectivity, percolation gives rise to a sharp non-linearity in the probability of global connectivity as a function of the probability of local connectivity. This phenomenon is exploited to compute Boolean functions robustly in the presence of defects. It is shown that the margins, defined in terms of the steepness of the non-linearity, translate into the degree of defect tolerance. Achieving good margins entails a mapping problem. Given a target Boolean function, the problem is how to assign literals to regions of the lattice such that no diagonal paths of 1’s exist in any assignment that evaluates to 0. Assignments with such paths result in poor error margins due to stray, random connections that can form across the diagonal. A necessary and sufficient condition is formulated for a mapping strategy that preserves good margins: the top-to-bottom and left-to-right connectivity functions across the lattice must be dual functions. Based on lattice duality, an efficient algorithm to perform the mapping is proposed. The algorithm optimizes the lattice area while meeting prescribed worst-case margins. Its effectiveness is demonstrated on benchmark circuits.

scholarly journals Minimally locally 1-connected graphs

1978 ◽  
Vol 19 (1) ◽  
pp. 77-80 ◽  
Author(s):  
K.H. Kulkarni
Keyword(s):  
Connected Graph ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Local Connectivity ◽  
Connected Graphs ◽  
Necessary And Sufficient

The local connectivity, νk(G), of a graph G is the minimum of the connectivities of neighbourhoods of the vertices of G. G is minimally locally n-connected if νk(G) = n and for every edge x of G, νk(G−x) = n − 1. A necessary and sufficient condition for a locally connected graph to be minimally locally 1-connected is given, and it is shown that for n ≥ 7, is minimally locally 1-connected.

A Proposed Framework Emphasizing Auditor Reliability over Auditor Independence

2003 ◽  
Vol 17 (3) ◽  
pp. 257-266 ◽  
Author(s):  
Mark H. Taylor ◽  
F. Todd DeZoort ◽  
Edward Munn ◽  
Martha Wetterhall Thomas
Keyword(s):  
Public Interest ◽  
Auditor Independence ◽  
Public Confidence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Accounting Profession ◽  
The Public ◽  
Necessary And Sufficient

This paper introduces an auditor reliability framework that repositions the role of auditor independence in the accounting profession. The framework is motivated in part by widespread confusion about independence and the auditing profession's continuing problems with managing independence and inspiring public confidence. We use philosophical, theoretical, and professional arguments to argue that the public interest will be best served by reprioritizing professional and ethical objectives to establish reliability in fact and appearance as the cornerstone of the profession, rather than relationship-based independence in fact and appearance. This revised framework requires three foundation elements to control subjectivity in auditors' judgments and decisions: independence, integrity, and expertise. Each element is a necessary but not sufficient condition for maximizing objectivity. Objectivity, in turn, is a necessary and sufficient condition for achieving and maintaining reliability in fact and appearance.

The Power of Public Positions

2018 ◽  
Author(s):  
Thomas Sinclair
Keyword(s):  
Detailed Analysis ◽  
Political Authority ◽  
The State ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
State Institutions ◽  
State Of Nature ◽  
Necessary And Sufficient

The Kantian account of political authority holds that the state is a necessary and sufficient condition of our freedom. We cannot be free outside the state, Kantians argue, because any attempt to have the “acquired rights” necessary for our freedom implicates us in objectionable relations of dependence on private judgment. Only in the state can this problem be overcome. But it is not clear how mere institutions could make the necessary difference, and contemporary Kantians have not offered compelling explanations. A detailed analysis is presented of the problems Kantians identify with the state of nature and the objections they face in claiming that the state overcomes them. A response is sketched on behalf of Kantians. The key idea is that under state institutions, a person can make claims of acquired right without presupposing that she is by nature exceptional in her capacity to bind others.

Interest rate option hedging portfolios without bank account

2019 ◽  
Vol 37 (1) ◽  
pp. 134-142
Author(s):  
Alberto Bueno-Guerrero
Keyword(s):  
Design Methodology ◽  
Contingent Claim ◽  
Necessary And Sufficient Condition ◽  
Barrier Option ◽  
Bank Account ◽  
Content Type ◽  
Option Hedging ◽  
Hedging Portfolio ◽  
Necessary And Sufficient ◽  
First Time

Purpose This paper aims to study the conditions for the hedging portfolio of any contingent claim on bonds to have no bank account part. Design/methodology/approach Hedging and Malliavin calculus techniques recently developed under a stochastic string framework are applied. Findings A necessary and sufficient condition for the hedging portfolio to have no bank account part is found. This condition is applied to a barrier option, and an example of a contingent claim whose hedging portfolio has a bank account part different from zero is provided. Originality/value To the best of the authors’ knowledge, this is the first time that this issue has been addressed in the literature.

scholarly journals Lorentz Boosts and Wigner Rotations: Self-Adjoint Complexified Quaternions

Physics ◽  
2021 ◽  
Vol 3 (2) ◽  
pp. 352-366
Author(s):  
Thomas Berry ◽  
Matt Visser
Keyword(s):  
Point Of View ◽  
Sufficient Condition ◽  
Use Of Self ◽  
Necessary And Sufficient Condition ◽  
Wigner Rotation ◽  
Inertial Frames ◽  
Explicit Formulae ◽  
Specific Implementation ◽  
Necessary And Sufficient ◽  
Lorentz Boosts

In this paper, Lorentz boosts and Wigner rotations are considered from a (complexified) quaternionic point of view. It is demonstrated that, for a suitably defined self-adjoint complex quaternionic 4-velocity, pure Lorentz boosts can be phrased in terms of the quaternion square root of the relative 4-velocity connecting the two inertial frames. Straightforward computations then lead to quite explicit and relatively simple algebraic formulae for the composition of 4-velocities and the Wigner angle. The Wigner rotation is subsequently related to the generic non-associativity of the composition of three 4-velocities, and a necessary and sufficient condition is developed for the associativity to hold. Finally, the authors relate the composition of 4-velocities to a specific implementation of the Baker–Campbell–Hausdorff theorem. As compared to ordinary 4×4 Lorentz transformations, the use of self-adjoint complexified quaternions leads, from a computational view, to storage savings and more rapid computations, and from a pedagogical view to to relatively simple and explicit formulae.

Sign in / Sign up

Export Citation Format

Share Document