Abstract Dense networks with weighted connections often exhibit a community-like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on node’s community membership. We propose new framework for generating and estimating dense potentially connectivity across communities. The proposed model relies particular class functions whi...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate subclasses of weighted timed automata and show how we can extend existing timed MSO logics with weights. Here, we focus on the class of weighted event-recording automata and define a weighted extension of the full logic MSOer(Σ) in...

We study synchronization phenomena in scale-free networks of asymmetrically coupled dynamical systems featuring degree-degree correlation in the topology of the connection wiring. We show that when the interaction is dominant from the high-degree to the low-degree (from the low-degree to the high degree) nodes, synchronization is enhanced for assortative (disassortative) degree-degree correlati...

Perceptual similarity underlies a number of important psychological properties of musical materials, including perceptual invariance under transformation, categorization, recognition, and the sense of familiarity. Mental processes involved in the perception of musical similarity may be an integral part of the functional logic of music composition and thus underly important aspects of musical ex...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate subclasses of weighted timed automata and show how we can extend existing timed MSO logics with weights. Here, we focus on the class of weighted event-recording automata and define a weighted extension of the full logic MSOer(Σ) in...

A new approach to define the similarity measure betweeninterval-valued fuzzy sets is presented. The proposed approach isbased on a weighted measure in which the normalized similaritiesbetween lower functions and also between upper functions arecombined by a weight parameter. The properties of this similaritymeasure are investigated. It is shown that, the proposed measurehas some advantages in c...

It is highly desirable for a computational model to have a logic characterization like in the seminal work of Büchi that connects MSO with finite automata. For example, weighted automata are the quantitative extension of finite automata for computing functions over words and they can be naturally characterized by a subfragment of weighted logic introduced by Droste and Gastin. Recently, cost re...