Network model of human language

The phenomenon of human language is widely studied from various points of view. It is interesting not only for social scientists, antropologists or philosophers, but also for those, interesting in the network dynamics. In several recent papers word web, or language as a graph has been investigated. In this paper I revise recent studies of syntactical word web. I present a model of growing network in which such processes as node addition, edge rewiring and new link creation are taken into account. I argue, that this model is a satisfactory minimal model explaining measured data.Comment: 10 pages, 1 fig, to appear in Physica

Modeling interactive memex-like applications based on self-modifiable petri nets

This paper introduces an interactive Memex-like application using a self-modifiable Petri Net model – Self-modifiable Color Petri Net (SCPN). The Memex (“memory extender”) device proposed by Vannevar Bush in 1945 focused on the problems of “locating relevant information in the published records and recording how that information is intellectually connected.” The important features of Memex include associative indexing and retrieval. In this paper, the self-modifiable functions of SCPN are used to achieve trail recording and retrieval. A place in SCPN represents a website and an arc indicates the trail direction. Each time when a new website is visited, a place corresponding to this website will be added. After a trail is built, users can use it to retrieve the websites they have visited. Besides, useful user interactions are supported by SCPN to achieve Memex functions. The types of user interactions include: forward, backward, history, search, etc. A simulator has been built to demonstrate that the SCPN model can realize Memex functions. Petri net instances can be designed to model trail record, back, and forward operations using this simulator. Furthermore, a client-server based application system has been built. Using this system, a user can surf online and record his surfing history on the server according to different topics and share them with other users

The Geometry of Synchronization (Long Version)

We graft synchronization onto Girard's Geometry of Interaction in its most concrete form, namely token machines. This is realized by introducing proof-nets for SMLL, an extension of multiplicative linear logic with a specific construct modeling synchronization points, and of a multi-token abstract machine model for it. Interestingly, the correctness criterion ensures the absence of deadlocks along reduction and in the underlying machine, this way linking logical and operational properties.Comment: 26 page

The Safety Net as a Network

The lack of a coherent understanding of what is meant by the American safety net made it difficult to have a meaningful discourse on the current condition. This paper proposes an alternative formulation of the social safety net based in network theory to overcome the shortcomings of the previous literature. The first part of the paper describes this approach, attempting to develop an alternative understanding of the safety net grounded in the actions of anti-poverty actors. Next is a list of propositions for measuring five dimensions of a safety net: the frame, structure, positions, influences, and the context. Three policy implications are derived from this new paradigm. First, shifting the level of analysis to network level allows policy makers to broaden the scope of the modern social safety net. Second, quantifying the interaction among actors reveals interdependency, which in turn redefines the power and influence of each actor within the network. Finally, the modern safety net could demonstrate a core-periphery structure. It calls for a new way of thinking about resource distribution and decision making channels of such unique structure.LBJ School of Public Affair

Universal low-temperature tricritical point in metallic ferromagnets and ferrimagnets

An earlier theory of the quantum phase transition in metallic ferromagnets is revisited and generalized in three ways. It is shown that the mechanism that leads to a fluctuation-induced first-order transition in metallic ferromagnets with a low Curie temperature is valid, (1) irrespective of whether the magnetic moments are supplied by the conduction electrons or by electrons in another band, (2) for ferromagnets in the XY and Ising universality classes as well as for Heisenberg ferromagnets, and (3) for ferrimagnets as well as for ferromagnets. This vastly expands the class of materials for which a first-order transition at low temperatures is expected, and it explains why strongly anisotropic ferromagnets, such as UGe2, display a first-order transition as well as Heisenberg magnets.Comment: 11pp, 2 fig

The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version)

We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by process algebras like the $\pi$-calculus. The introduced model is based on token machines in which not one but multiple tokens are allowed to traverse the underlying net at the same time. We prove soundness and adequacy of the introduced model. The former is proved as a simulation result between the token machines one obtains along any reduction sequence. The latter is obtained by a fine analysis of convergence, both in nets and in token machines