Optimized hash for network path encoding with minimized false positives

The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives. However, the space savings they offer outweigh the disadvantage if the false positive rates are kept sufficiently low. Inspired by the recent application of the Bloom filter in a novel multicast forwarding fabric, this paper proposes a variant of the Bloom filter, the optihash. The optihash introduces an optimization for the false positive rate at the stage of Bloom filter formation using the same amount of space at the cost of slightly more processing than the classic Bloom filter. Often Bloom filters are used in situations where a fixed amount of space is a primary constraint. We present the optihash as a good alternative to Bloom filters since the amount of space is the same and the improvements in false positives can justify the additional processing. Specifically, we show via simulations and numerical analysis that using the optihash the false positives occurrences can be reduced and controlled at a cost of small additional processing. The simulations are carried out for in-packet forwarding. In this framework, the Bloom filter is used as a compact link/route identifier and it is placed in the packet header to encode the route. At each node, the Bloom filter is queried for membership in order to make forwarding decisions. A false positive in the forwarding decision is translated into packets forwarded along an unintended outgoing link. By using the optihash, false positives can be reduced. The optimization processing is carried out in an entity termed the Topology Manger which is part of the control plane of the multicast forwarding fabric. This processing is only carried out on a per-session basis, not for every packet. The aim of this paper is to present the optihash and evaluate its false positive performances via simulations in order to measure the influence of different parameters on the false positive rate. The false positive rate for the optihash is then compared with the false positive probability of the classic Bloom filter.

The signature of a rough path: uniqueness

In the context of controlled differential equations, the signature is the exponential function on paths. B. Hambly and T. Lyons proved that the signature of a bounded variation path is trivial if and only if the path is tree-like. We extend Hambly–Lyons' result and their notion of tree-like paths to the setting of weakly geometric rough paths in a Banach space. At the heart of our approach is a new definition for reduced path and a lemma identifying the reduced path group with the space of signatures.

Economic Transformation in Ghana: Where Will the Path Lead?

In the context of the Ghanaian government’s objective of structural transformation with an emphasis on manufacturing, this paper provides a case study of economic transformation in Ghana, exploring patterns of growth, sector transformation, and agglomeration. We document and examine why, despite impressive growth and poverty reduction figures, Ghana’s economy has exhibited less transformation than might be expected for a country that has recently achieved middle-income status. Ghana’s reduced share of agriculture in the economy, unlike many successfully transformed countries in Asia and Latin America, has been filled by services, while manufacturing has stagnated and even declined. Likely causes include weak transformation of the agricultural sector and therefore little development of agro-processing, the emergence of “consumption cities” and consumption-driven growth, upward pressure on the exchange rate, weak production linkages, and a poor environment for private-sector-led manufacturing.

Paleomagnetism of the Santa Fe Group, central Brazil: Implications for the late Paleozoic apparent polar wander path for South America

Paleomagnetic and rockmagnetic data are reported for the Floresta Formation (Santa Fe Group) of the Sanfranciscana Basin, central Brazil. This formation represents the Permo-Carboniferous glacial record of the basin and comprises the Brocoto (diamictites and flow diamictites), Brejo do Arroz (red sandstones and shales with dropstones and invertebrate trails), and Lavado (red sandstones) members, which crop out near the cities of Santa Fe de Minas and Canabrava, Minas Gerais State. Both Brejo do Arroz and Lavado members were sampled in the vicinities of the two localities. Alternating field and thermal demagnetizations of 268 samples from 76 sites revealed reversed components of magnetization in all samples in accordance with the Permo-Carboniferous Reversed Superchron. The magnetic carriers are magnetite and hematite with both minerals exhibiting the same magnetization component, suggesting a primary origin for the remanence. We use the high-quality paleomagnetic pole for the Santa Fe Group (330.9 degrees E 65.7 degrees S; N = 60; alpha(95) = 4.1 degrees; k = 21) in a revised late Carboniferous to early Triassic apparent polar wander path for South America. On the basis of this result it is shown that an early Permian Pangea A-type fit is possible if better determined paleomagnetic poles become available.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Pseudoclassical description of scalar particle in non-abelian background and path-integral representations

Path-integral representations for a scalar particle propagator in non-Abelian external backgrounds are derived. To this aim, we generalize the procedure proposed by Gitman and Schvartsman of path-integral construction to any representation of SU(N) given in terms of antisymmetric generators. And for arbitrary representations of SU(N), we present an alternative construction by means of fermionic coherent states. From the path-integral representations we derive pseudoclassical actions for a scalar particle placed in non-Abelian backgrounds. These actions are classically analyzed and then quantized to prove their consistency.

Path integral representations in noncommutative quantum mechanics and noncommutative version of Berezin-Marinov action

It is known that the actions of field theories on a noncommutative space-time can be written as some modified (we call them theta-modified) classical actions already on the commutative space-time (introducing a star product). Then the quantization of such modified actions reproduces both space-time noncommutativity and the usual quantum mechanical features of the corresponding field theory. In the present article, we discuss the problem of constructing theta-modified actions for relativistic QM. We construct such actions for relativistic spinless and spinning particles. The key idea is to extract theta-modified actions of the relativistic particles from path-integral representations of the corresponding noncommutative field theory propagators. We consider the Klein-Gordon and Dirac equations for the causal propagators in such theories. Then we construct for the propagators path-integral representations. Effective actions in such representations we treat as theta-modified actions of the relativistic particles. To confirm the interpretation, we canonically quantize these actions. Thus, we obtain the Klein-Gordon and Dirac equations in the noncommutative field theories. The theta-modified action of the relativistic spinning particle is just a generalization of the Berezin-Marinov pseudoclassical action for the noncommutative case.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Repetition-free longest common subsequence

We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard. (C) 2009 Elsevier B.V. All rights reserved.

EQUIVARIANT PATH FIELDS ON TOPOLOGICAL MANIFOLDS

A classical theorem of H. Hopf asserts that a closed connected smooth manifold admits a nowhere vanishing vector field if and only if its Euler characteristic is zero. R. Brown generalized Hopf`s result to topological manifolds, replacing vector fields with path fields. In this note, we give an equivariant analog of Brown`s theorem for locally smooth G-manifolds where G is a finite group.

Optimal Path Searching through Specified Routes using different Algorithms

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive search and analyzed their results. The given problem is similar to Travelling Salesman Problem. Exhaustive search is a best algorithm to solve this problem as it checks each and every possibility and give the accurate result but it is an impractical solution because of huge time consumption. If no. of objects increased from 12 it takes hours to search the shortest path. Simulated annealing is emerged with some promising results with lower time cost. As of probabilistic nature, Simulated annealing could be non optimal but it gives a near optimal solution in a reasonable duration. Greedy algorithm is not a good choice for this problem. So, simulated annealing is proved best algorithm for this problem. The project has been implemented in C-language which takes input and store output in an Excel Workbook

Reducing yarn hairiness with a modified yarn path in worsted ring spinning

The spinning geometry of a ring frame plays an important role, and the twist triangle is the critical region in ring spinning. Changes in the spinning geometry may affect yarn properties. This paper examines the idea of ring spinning with a "diagonal" yarn path, and the effect of such a path on yam properties, particularly hairiness. Both "left diagonal" and "right diagonal" yam arrangements are tried on a 24-spindle Cognetex FLC worsted ring frame. The hairiness results obtained from the Zweigle hairiness meter show that the right diagonal yam path produces yams of lower hairiness than the conventional ring spun yarn in almost all the hair length groups. Yam evenness and tenacity are not as sensitive to the change in yarn path. The mean spindle speed at break is also tested, and there is some deterioration in spinning efficiency with the right diagonal yarn path, particularly at higher spinning speeds. Results from this study may help explain variations in yarns spun on poorly aligned ring frames.

Biotechnology and governance in Australia and Sweden: path dependency or instutional convergence?

The development of new generic technologies occurs within traditional structures of industry-government interaction, but also unleashes a process of 'creative destruction' generating new institutional patterns. This article, focusing on biotechnology, describes and compares policy processes and institutional arrangements in Australia and Sweden. The Swedish biotechnology sector displays a pattern of fragmentation and relatively weak state steering. Australia, by contrast, has implemented a set of comparatively coordinated regulatory and other measures to foster the growth of biotechnology. This observation contradicts the characterisation of Sweden as a 'strong state' economy, and challenges the depiction of Australia as lacking in state steering capacity. The relative open-endedness of the search in these countries for a mode of regulation of biotechnology suggests that the role of the state in economic restructuring today is fundamentally distinct from that of earlier periods.