In this article, we continue our very recent work by extending it to the complex case. Having been inspired real Hopfield neural network (HNN) results, investigations here yield various novel some of which are as follows. First, “biased pseudo-cut” concept HNN (CHNN) case, introduce a “shadow-cut” that is defined sum intercluster phased edges. Second, while discrete-time strictly minimizes in e...

This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...

0

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

BACKGROUND Obesity or being overweight is a major health problem in Iran. Only few studies are available that compare the obesity prevalence by four different available criteria. The aim of this study was to determine the prevalence of overweight and obesity among Isfahani adolescents based on four different definitions. MATERIALS AND METHODS This cross-sectional study was conducted on 3002 I...

Chen et al. argued recently that, in Bondi-Sachs space-times, the angular momentum at scri (null infinity) should vary continuously with position of cut (but not depend sensitively on its derivatives); they showed that this property was enjoyed by some definitions but others. I show here twistor definition has continuity. The argument is rather different from al.'s, invariant geometry forefront...

Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...