Advertising, consensus, and ageing in multilayer Sznajd model

In the Sznajd consensus model on the square lattice, two people who agree in their opinions convince their neighbours of this opinion. We generalize it to many layers representing many age levels, and check if still a consensus among all layers is possible. Advertising sometimes but not always produces a consensus on the advertised opinion.Comment: 6 pages including 4 figures, for Int. J. Mod. Phys.

Knowledge Flows Through Social Networks in a Cluster Interfirm versus University-Industry Contacts

Knowledge spillovers from a university to the local industry play an important role in clusters, but we know little about these spillovers. This paper examines empirically the extent of university-industry informal contacts. Furthermore, it analyses the characteristics of an engineer that acquire knowledge from informal contacts with university researchers. The university-industry contacts are compared with results for interfirm contacts. The research shows that the interfirm informal contacts are more numerous than university informal contacts. Likewise, knowledge is more frequently acquired from other firms than through university-industry contacts. Engineers that have participated in formal projects with university researchers and engineers that are educated at the university have a higher likelihood of acquiring knowledge from informal contacts with university researchers.Knowledge flows; informal contacts

Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem

In the minimum common string partition (MCSP) problem two related input strings are given. "Related" refers to the property that both strings consist of the same set of letters appearing the same number of times in each of the two strings. The MCSP seeks a minimum cardinality partitioning of one string into non-overlapping substrings that is also a valid partitioning for the second string. This problem has applications in bioinformatics e.g. in analyzing related DNA or protein sequences. For strings with lengths less than about 1000 letters, a previously published integer linear programming (ILP) formulation yields, when solved with a state-of-the-art solver such as CPLEX, satisfactory results. In this work, we propose a new, alternative ILP model that is compared to the former one. While a polyhedral study shows the linear programming relaxations of the two models to be equally strong, a comprehensive experimental comparison using real-world as well as artificially created benchmark instances indicates substantial computational advantages of the new formulation.Comment: arXiv admin note: text overlap with arXiv:1405.5646 This paper version replaces the one submitted on January 10, 2015, due to detected error in the calculation of the variables involved in the ILP model

Freezing and Using Prepared Foods

PDF pages: 1