One loop correction to the SUSY Ward-Takahashi identity is calculated on lattice withWilson fermion. The supersymmetry on lattice is broken explicitly by the gluino mass and the lattice artifact. We should fine tune the theory to the point given by the additive mass correction to eliminate the breaking effect of lattice artifact. It is shown that the additive mass correction appearing from the ...

The performance of block-matching sub-pixel motion estimation algorithms under the adverse conditions of image undersampling and additive noise is studied empirically. This study is motivated by the requirement for reliable subpixel accuracy motion estimates for motion compensated observation models used in multi-frame super-resolution image reconstruction. Idealized test functions which includ...

We take advantage of different generalizations of the tangent manifold to the context of graded manifolds, together with the notion of super section along a morphism of graded manifolds, to obtain intrinsic definitions of the main objects in supermechanics such as, the vertical endomorphism, the canonical and the Cartan’s graded forms, the total time derivative operator and the super–Legendre t...

Polyvinylchloride (PVC) based heterogeneous cation exchange membranes were prepared by the solution casting technique. The effect of super activated carbon nanoparticles concentration as filler additive in membrane matrix on ionic transfer behaviors of the membrane was studied. SOM images showed uniform particles distribution and relatively uniform surfaces for the membranes. The membrane water...

In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspondence between this paradigm and those more pragmatic ones inspired to transactional or distributed...

An injective coloring of a graph is a vertex labeling such that two vertices sharing a common neighbor get different labels. In this work we introduce and study what we call additive colorings. An injective coloring c : V (G) → Z of a graph G is an additive coloring if for every uv, vw in E(G), c(u)+ c(w) = 2c(v). The smallest integer k such that an injective (resp. additive) coloring of a give...

Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...

Linguists build theories of grammar based largely on acceptability contrasts. But these contrasts can reflect grammatical constraints and/or constraints on language processing. How can theorists determine the extent to which the acceptability of an utterance depends on functional constraints? In a series of acceptability experiments, we consider two factors that might indicate processing contri...