Modularity maximization has been one of the most widely used approaches in the last decade for discovering community structure in networks of practical interest in biology, computing, social science, statistical mechanics, and more. Modularity is a quality function that measures the difference between the number of edges found within clusters minus the number of edges one would statistically ex...

We examine hierarchical modularity modularity on multiple levels, in which the modules at a lower level of abstraction can serve as nodes in a network at a higher level of abstraction that also has positive modularity as well as degree of modularity on a single level of abstraction, in evolved neural networks in single-task, parallel-subtask environments, and sequential-subtask environments, us...

Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The interaction of prefix iteration with silent steps is studied in the setting of Milner’s basic CCS. Complete equational axiomatizations are given for four notions of behavioural congruence over basic CCS with prefix iteration, viz...

Article history: Received 1 March 2011 Available online 9 March 2011 The relation of interest–major congruence to indicators of college success was examined as it was moderated by environmental constraint, individual flexibility, and congruence definition in an initial sample of 88,813 undergraduates (38,787 men and 50,026 women) from 42 different colleges and universities in 16 states. College...

Let A = (A;F ) be an algebra and ConA its congruence lattice. Recall that A is congruence uniform (see e.g. [1], [5]) if for each Θ ∈ ConA and every a, b ∈ A, card[a]Θ = card[b]Θ. Examples of congruence uniform algebras are e.g. groups, rings or Boolean algebras. A variety V is congruence uniform if each A ∈ V has this property. It was proved by W. Taylor [5] that every congruence uniform varie...