Constructing multiple unique input/output sequences using metaheuristic optimisation techniques

Multiple unique input/output sequences (UIOs) are often used to generate robust and compact test sequences in finite state machine (FSM) based testing. However, computing UIOs is NP-hard. Metaheuristic optimisation techniques (MOTs) such as genetic algorithms (GAs) and simulated annealing (SA) are effective in providing good solutions for some NP-hard problems. In the paper, the authors investigate the construction of UIOs by using MOTs. They define a fitness function to guide the search for potential UIOs and use sharing techniques to encourage MOTs to locate UIOs that are calculated as local optima in a search domain. They also compare the performance of GA and SA for UIO construction. Experimental results suggest that, after using a sharing technique, both GA and SA can find a majority of UIOs from the models under test

Testing a system specified using Statecharts and Z

A hybrid specification language SZ, in which the dynamic behaviour of a system is described using Statecharts and the data and the data transformations are described using Z, has been developed for the specification of embedded systems. This paper describes an approach to testing from a deterministic sequential specification written in SZ. By considering the Z specifications of the operations, the extended finite state machine (EFSM) defined by the Statechart can be rewritten to produce an EFSM that has a number of properties that simplify test generation. Test generation algorithms are introduced and applied to an example. While this paper considers SZ specifications, the approaches described might be applied whenever the specification is an EFSM whose states and transitions are specified using a language similar to Z

Splitting formulas for certain Waldhausen Nil-groups

For a group G that splits as an amalgamation of A and B over a common subgroup C, there is an associated Waldhausen Nil-group, measuring the "failure" of Mayer-Vietoris for algebraic K-theory. Assume that (1) the amalgamation is acylindrical, and (2) the groups A,B,G satisfy the Farrell-Jones isomorphism conjecture. Then we show that the Waldhausen Nil-group splits as a direct sum of Nil-groups associated to certain (explicitly describable) infinite virtually cyclic subgroups of G. We note that a special case of an acylindrical amalgamation includes any amalgamation over a finite group C.Comment: 12 page

Algebraic and combinatorial codimension-1 transversality

The Waldhausen construction of Mayer-Vietoris splittings of chain complexes over an injective generalized free product of group rings is extended to a combinatorial construction of Seifert-van Kampen splittings of CW complexes with fundamental group an injective generalized free product.Comment: Published by Geometry and Topology Monographs at http://www.maths.warwick.ac.uk/gt/GTMon7/paper6.abs.htm

Predicting Community Evolution in Social Networks

Nowadays, sustained development of different social media can be observed worldwide. One of the relevant research domains intensively explored recently is analysis of social communities existing in social media as well as prediction of their future evolution taking into account collected historical evolution chains. These evolution chains proposed in the paper contain group states in the previous time frames and its historical transitions that were identified using one out of two methods: Stable Group Changes Identification (SGCI) and Group Evolution Discovery (GED). Based on the observed evolution chains of various length, structural network features are extracted, validated and selected as well as used to learn classification models. The experimental studies were performed on three real datasets with different profile: DBLP, Facebook and Polish blogosphere. The process of group prediction was analysed with respect to different classifiers as well as various descriptive feature sets extracted from evolution chains of different length. The results revealed that, in general, the longer evolution chains the better predictive abilities of the classification models. However, chains of length 3 to 7 enabled the GED-based method to almost reach its maximum possible prediction quality. For SGCI, this value was at the level of 3 to 5 last periods.Comment: Entropy 2015, 17, 1-x manuscripts; doi:10.3390/e170x000x 46 page

Evolutionary analysis of the TPP-dependent enzyme family

The evolutionary relationships of the thiamine pyrophosphate (TPP)-dependent family of enzymes was investigated by generation of a neighbor joining phylogenetic tree using sequences from the conserved pyrophosphate (PP) and pyrimidine (Pyr) binding domains of 17 TPP-dependent enzymes. This represents the most comprehensive analysis of TPP-dependent enzyme evolution to date. The phylogeny was shown to be robust by comparison with maximum likelihood trees generated for each individual enzyme and also broadly confirms the evolutionary history proposed recently from structural comparisons alone (Duggleby 2006). The phylogeny is most parsimonious with the TPP enzymes having arisen from a homotetramer which subsequently diverged into an α2β2 heterotetramer. The relationship between the PP- and Pyr-domains and the recruitment of additional protein domains was examined using the transketolase C-terminal (TKC)-domain as an example. This domain has been recruited by several members of the family and yet forms no part of the active site and has unknown function. Removal of the TKC-domain was found to increase activity toward β-hydroxypyruvate and glycolaldehyde. Further truncations of the Pyr-domain yielded several variants with retained activity. This suggests that the influence of TKC-domain recruitment on the evolution of the mechanism and specificity of transketolase (TK) has been minor, and that the smallest functioning unit of TK comprises the PP- and Pyr-domains, whose evolutionary histories extend to all TPP-dependent enzymes