BACKGROUND The aim was to evaluate and validate a bowel disease questionnaire in patients attending an out-patient gastroenterology clinic in Greece. METHODS This was a prospective study. Diagnosis was based on detailed clinical and laboratory evaluation. The questionnaire was tested on a pilot group of patients. Interviewer-administration technique was used. One-hundred-and-forty consecutive...

The statistical analysis in Q-methodology is based on factor analysis followed by a factor rotation. Currently, the most common factor extraction methods are centroid and principal component extractions and the common techniques for factor rotation are manual rotation and varimax rotation. However, there are some other factor extraction methods such as principal axis factoring and factor rotati...

This paper analyses the stream cipher SSC2 [ZCC00]. We describe some weaknesses and attacks exploiting these weaknesses. The strongest attack needs about 2 words of known key stream and has a time complexity of about 2.

Rabbit stream cipher is one of the finalists of eSTREAM project which uses 128-bit secret keys. Prior to us, the attacks on Rabbit has been all focused on the bias analysis and the best result showed the distinguishing attack with complexity 2. Our analysis in this paper, is based on chosen IV analysis on reduced N-S round of Rabbit though using multi cube tester. For this purpose we show for a...

A graph G is said to be d-distinguishable if there is a d-coloring of G which no non-trivial automorphism preserves. That is, 9χ : G !f1; : : : ;dg; 8φ 2 Aut(G)nfidg;9v;χ(v) 6= χ(φ(v)): It was conjectured that if jGj> jAut(G)j and the Aut(G) action on G has no singleton orbits, then G is 2-distinguishable. We give an example where this fails. We partially repair the conjecture by showing that w...

We give interpretations of some known key agreement protocols in the framework of category theory and in this way we give a method of constructing of many new key agreement protocols.

In this paper we will provide two linear approximating for the stream cipher Salsa20, the both are probable to form distinguishing attack with about 64 2 blocks of keystream.

We consider infinite graphs. The distinguishing number D(G) of a graph G is the minimum number of colours in a vertex colouring of G that is preserved only by the trivial automorphism. An analogous invariant for edge colourings is called the distinguishing index, denoted by D′(G). We prove that D′(G) 6 D(G) + 1. For proper colourings, we study relevant invariants called the distinguishing chrom...

Let Σ be a surface. We prove that rigidity indices of graphs which admit a polyhedral embedding in Σ and 5-connected graphs admitting an embedding in Σ are bounded by a constant depending on Σ. Moreover if the Euler characteristic of Σ is negative, then the separation index of graphs admitting a polyhedral embedding in Σ is also bounded. As a side result we show that distinguishing number of bo...

Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum number of labels needed so that G has a distinguishing labeling. In this paper, we present O(n log n)-time algorithms that compute the distinguishing numbers of trees and forests. Unlike most of the previous work in t...