In this paper, the study of restoration of Supersymmetry, broken at tree level, has been undertaken. In the present model we have lucratively applied the method of back propagation based on gradient descent along the error surface to restore the supersymmetry against arbitrary tiny quantum corrections in the form of small thermal agitations. Back propagation method brings the potential stabilit...

Abstract: This paper evaluates a Virtual Connection Tree (VCT) algorithm for mobile Asynchronous Transfer Mode (ATM) handoff that offers service adaptability and efficient allocation of wired resources is applied to different multiple access techniques. This creates a more distributed system where decisions about traffic conditions in different areas can be evaluated at the Base Station (BS) le...

We investigate the use of unlabeled data to help labeled data in classification. We propose a simple iterative algorithm, label propagation, to propagate labels through the dataset along high density areas defined by unlabeled data. We analyze the algorithm, show its solution, and its connection to several other algorithms. We also show how to learn parameters by minimum spanning tree heuristic...

Monte-Carlo Tree Search and Upper Confidence Bounds provided huge improvements in computer-Go. In this paper, we test the generality of the approach by experimenting on another game, Havannah, which is known for being especially difficult for computers. We show that the same results hold, with slight differences related to the absence of clearly known patterns for the game of Havannah, in spite...

In this paper, a reconfigurable mesh-tree with a disjoint hierarchical routing protocol for the Bluetooth sensor network is proposed. First, a designated root constructs a tree-shaped subnet and propagates parameters k and c in its downstream direction to determine new roots. Each new root asks its upstream master to start a return connection to convert the first tree-shaped subnet into a mesh-...

In this paper, a new construct called connection graph, Gc, is proposed. An efficient geometric algorithm for constructing Gc is given. We present a framework for designing a class of time and space efficient maze-running and line-search rectilinear shortest path and rectilinear minimum spanning tree algorithms based on Gc. We give several example maze-running and line-search algorithms based o...

Semi-global matching, originally introduced in the context of dense stereo, is a very successful heuristic to minimize the energy of a pairwise multi-label Markov Random Field defined on a grid. We offer the first principled explanation of this empirically successful algorithm, and clarify its exact relation to belief propagation and tree-reweighted message passing. One outcome of this new conn...

We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting “nicely” on a tree gives rise to a self-covering of a topological groupoid, and how the group can be reconstructed from the groupoid and its covering. The connection is via finite-state automata. These define decomposition rules, or self-similar tilin...

We introduce a new connection between formal language theory and proof theory. One of the most fundamental proof transformations in a class of formal proofs is shown to correspond exactly to the computation of the language of a certain class of tree grammars. Translations in both directions, from proofs to grammars and from grammars to proofs, are provided. This correspondence allows theoretica...