Multiconditional Approximate Reasoning with Continuous Piecewise Linear Membership Functions

It is shown that, for some intersection and implication functions, an exact and efficient algorithm exists for the computation of inference results in multiconditional approximate reasoning on domains which are finite intervals of the real numbers, when membership functions are restricted to functions which are continuous and piecewise linear. An implementation of the algorithm is given in the functional programming language Miranda

Eavesdropping on GSM: state-of-affairs

In the almost 20 years since GSM was deployed several security problems have been found, both in the protocols and in the - originally secret - cryptography. However, practical exploits of these weaknesses are complicated because of all the signal processing involved and have not been seen much outside of their use by law enforcement agencies. This could change due to recently developed open-source equipment and software that can capture and digitize signals from the GSM frequencies. This might make practical attacks against GSM much simpler to perform. Indeed, several claims have recently appeared in the media on successfully eavesdropping on GSM. When looking at these claims in depth the conclusion is often that more is claimed than what they are actually capable of. However, it is undeniable that these claims herald the possibilities to eavesdrop on GSM using publicly available equipment. This paper evaluates the claims and practical possibilities when it comes to eavesdropping on GSM, using relatively cheap hardware and open source initiatives which have generated many headlines over the past year. The basis of the paper is extensive experiments with the USRP (Universal Software Radio Peripheral) and software projects for this hardware.Comment: 5th Benelux Workshop on Information and System Security (WISSec 2010), November 201

Twistor space, Minkowski space and the conformal group

It is shown that the conformal group of compactified Minkowski space is isomorphic to a group of rays of semilinear transformations of twistor space. The action of the conformal group on twistor space is given by an explicit realisation of this isomorphism. In this way we determine the transformation of twistor space under space inversion and time inversion

On the type and the standardform of induced UA representations

We derive to which of the three types an irreducible UA representation which is obtained with the procedure of generalised induction belongs. We analyse the question whether or not the irreducible induced UA representations are on standardform. The results hold as well for induced PUA representations

On the determination of factor systems of PUA representations

A method is developed to obtain a complete set of inequivalent factor systems of PUA � representations of a group with a subgroup of index two from the factor systems of this subgroup

Efficient algorithms for approximate reasoning

We present algorithms for approximate reasoning computations, for some intersection and implication functions, which are as efficient as E.H. Mamdani et al.'s (1975) interpolation method. Implementations of the algorithms are given in the functional language Mirand

On the factor systems of the Shubnikov space groups

The procedure of Backhouse for the determination of a complete set of inequivalent factor systems of the symmorphic Shubnikov space groups of type I is generalized for all Shubnikov space groups of types I and 111. The results are used to obtain a method for the construction of a set of inequivalent factor systems of the Shubnikov space groups of types I1 and IV

Induced PUA representations and selection rules

Well known properties of induced unitary representations are generalised for induced PUA representations. They are applied to obtain an expression for the multiplicities in the Clebsch-Gordon series of induced PUA representations. Finally we show how these multiplicities can be used for the determination of selection rules

Empathic Agent Technology (EAT)

A new view on empathic agents is introduced, named: Empathic Agent Technology (EAT). It incorporates a speech analysis, which provides an indication for the amount of tension present in people. It is founded on an indirect physiological measure for the amount of experienced stress, defined as the variability of the fundamental frequency of the human voice. A thorough review of literature is provided on which the EAT is founded. In addition, the complete processing line of this measure is introduced. Hence, the first generally applicable, completely automated technique is introduced that enables the development of truly empathic agents

Emotional Prosody Measurement (EPM): A voice-based evaluation method for psychological therapy effectiveness

The voice embodies three sources of information: speech, the identity, and the emotional state of the speaker (i.e., emotional prosody). The latter feature is resembled by the variability of the F0 (also named fundamental frequency of pitch) (SD F0). To extract this feature, Emotional Prosody Measurement (EPM) was developed, which consists of 1) speech recording, 2) removal of speckle noise, 3) a Fourier Transform to extract the F0-signal, and 4) the determination of SD F0. After a pilot study in which six participants mimicked emotions by their voice, the core experiment was conducted to see whether EPM is successful. Twenty-five patients suffering from a panic disorder with agoraphobia participated. Two methods (storytelling and reliving) were used to trigger anxiety and were compared with comparable but more relaxed conditions. This resulted in a unique database of speech samples that was used to compare the EPM with the Subjective Unit of Distress to validate it as measure for anxiety/stress. The experimental manipulation of anxiety proved to be successful and EPM proved to be a successful evaluation method for psychological therapy effectiveness