Syntax and semantics: A comparison of the structuralistic language theory of Ebeling with knowledge graph theory

This paper describes a comparison of two structuralistic theories of syntax and semantics of language. Both theories were developed in The Netherlands. One was developed by C.L.Ebeling at the University of Amsterdam about 30 years ago, the other by C.Hoede and students at the University of Twente in the last 20 years

Basic concepts in social sciences II

In this paper an extension is given of the set of concepts considered to be basic to the fields of Economics, Organization Theory, Political Science, Psychology and Sociology. The modeling is in terms of automata and automata networks. In the first paper on basic concepts the simplest unit, the social atom, stood central. In this second paper social structures and processes are focused upon

Knowledge graph analysis of particles in Japanese

The theory of knowledge graphs is a structuralistic theory of language. Its ontology consists of eight types of binary relationships and four types of so-called frames. The relationships connect so-called tokens, that represent semantic units. In this way a graph structure arises. Japanese particles are investigated against the background of knowledge graph ontology. It is shown that the structure of Japanese closely resembles the structure of the knowledge graph representation of language

Evaluating attitudes from texts

In this paper an example is given how the theory of knowledge graphs and the theory of social atoms can be used to evaluate the attitudes that actors have with respect to each other as far is evident from a text

Basic concepts in social sciences III

In this paper the set of concepts considered to be basic to the fields of Economics, Organization Theory, Political Science, Psychology and Sociology is completed. The set of 55 basic concepts in the first two papers on basic concepts was mainly determined by considering concepts in relation to social atoms. The concepts that play a role in n-networks form the majority of the concepts added in this paper

On Page Rank

In this paper the concept of page rank for the world wide web is discussed. The possibility of describing the distribution of page rank by an exponential law is considered. It is shown that the concept is essentially equal to that of status score, a centrality measure discussed already in 1953 by Katz. A structural classification of users in the web is given in terms of graph theoretical concepts

Classification of meetings and their participants

On the basis of a coding of utterances we investigate ways to classify participants of a meeting. On the basis of a coding of states of a meeting activities during meetings are classified

On Ising models

For various Ising models two approaches are discussed, one is that of simulating lattices, also called gauging on exact equations, the other is that of calculating analytical expressions for the boundary free energy of Ising lattices. The first approach allows to conjecture a solution for some Ising models, that have sofar not been solved, once some exact partial result for the problem is known. The second approach aims at furnishing such a partial result in the form of a condition for the critical temperature. An example of such a result was recently given for the 2D Ising square lattice with nearest and next-nearest-neighbor interactions. The critical line that separates the ordered (ferromagnetic) phase from the disordered (paramagnetic) phase showed good agreement in the moderate and strong nearest neighbor coupling limit with several results obtained by Monte Carlo, transfer matrix and series expansion results. We extend the discussion of the critical line, finding an excellent fit, now also in other points, like the Padé point, as well as cusp behavior at the Onsager point where the lattice decouples into two 2D square lattices with only nearest-neighbor interaction. Combination of this result with a geometrical argument in the simulation approach leads to a critical exponent $2-\sqrt{2} \approx 0.5858,$ comparable to the exponent $4/7 \approx 0.5714$ found from renormalization arguments.\ud \u

An alternative proof of the nowhere-zero 6-flow theorem

The nowhere-zero 6-flow theorem of Seymour is proven by construction

On the relation between the base of an EI algebra and word graphs

This paper is an attempt to investigate the possibilities to link algebraic fuzzy set theory with the theory of word graphs. In both theories concepts are studied and concepts can be set in correspondence. This enables to use algebraic results in the context of word graph theory