We analyze the dynamics of a two-dimensional cellular automaton, 2D Minority, for the Moore neighborhood (eight neighbors per cell) under fully asynchronous dynamics (where only one random cell updates at each time step). Even if 2D Minority seems a simple rule, from the experience of Ising models and Hopfield nets, it is known that models with negative feedback are hard to study. This automato...

experiences indicate that after earthquakes a little attention is paid to the role of collective memory (cm) in the reconstruction process. this is due to time constraints, because all organizations try to speed up the physical reconstruction process, after the disasters. thus, quality is sacrificed for quantity. herein one of the most challenging issues is the reconstruction of bazaar neighbor...

In this paper, an effective approach based on the variable neighborhood search (VNS) algorithm is presented to solve the uncapacitated multilevel lot-sizing (MLLS) problems with component commonality and multiple end-items. A neighborhood structure for the MLLS problem is defined, and two kinds of solution move policies, i.e., move at first improvement (MAFI) and move at best improvement (MABI)...

The paper presents the dynamics of consumer preferences over two competing products acting in duopoly market. The model presented compared the majority and minority rules as well as the modified Snazjd model in the Von Neumann neighborhood. We showed how important advertising in marketing a product is. We show that advertising should also consider the social structure simultaneously with the co...

This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce “ultrafilter semantics,” a way of expressing all sets over a canonical frame in an ‘effable’ way. This provides us with a conceptually easy...

A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...

The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic induced by his conception satisfies the traditional square of opposition, but also has some unique pr...

larger than the size of a rupee, on his face, situated at the corner of the right ala nasi. His father, who accompanied him, had recently returned home with the boy from Teheran to visit his family. The boy had contracted the trouble in Teheran some four months previously. As they did not turn up next day I forgot all about this case. After three weeks the boy was again brought to me fof cough,...