Perseveration in a guessing task by laying hens selected for high or low levels of feather pecking does not support classification of feather pecking as a stereotypy.

Feather pecking is a behaviour by which birds damage or destroy the feathers of themselves (self-pecking) or other birds (allo feather pecking), in some cases even plucking out feathers and eating these. The self-pecking is rarely seen in domestic laying hens but is not uncommon in parrots. Feather pecking in laying hens has been described as being stereotypic, i.e. a repetitive invariant motor pattern without an obvious function, and indeed the amount of self-pecking in parrots was found to correlate positively with the amount of recurrent perseveration (RP), the tendency to repeat responses inappropriately, which in humans and other animals was found to correlate with stereotypic behaviour. In the present experiment we set out to investigate the correlation between allo feather pecking and RP in laying hens. We used birds (N = 92) from the 10th and 11th generation (G10 and G11) of lines selectively bred for high feather pecking (HFP) and low feather pecking (LFP), and from an unselected control line (CON) with intermediate levels of feather pecking. We hypothesised that levels of RP would be higher, and the time taken (standardised latency) to repeat a response lower, in HFP compared to LFP hens, with CON hens in between. Using a two-choice guessing task, we found that lines differed significantly in their levels of RP, with HFP unexpectedly showing lower levels of RP than CON and LFP. Latency to make a repeat did not differ between lines. Latency to make a switch differed between lines with a shorter latency in HFP compared to LFP (in G10), or CON (in G11). Latency to peck for repeats vs. latency to peck for switches did not differ between lines. Total time to complete the test was significantly shorter in HFP compared to CON and LFP. Thus, our hypotheses were not supported by the data. In contrast, selection for feather pecking seems to induce the opposite effects than would be expected from stereotyping animals: pecking was less sequenced and reaction to make a switch and to complete the test was lower in HFP. This supports the hyperactivity-model of feather pecking, suggesting that feather pecking is related to a higher general activity, possibly due to changes in the dopaminergic system.

DAEDALUS at PAN 2014: Guessing tweet author's gender and age

This paper describes our participation at PAN 2014 author profiling task. Our idea was to define, develop and evaluate a simple machine learning classifier able to guess the gender and the age of a given user based on his/her texts, which could become part of the solution portfolio of the company. We were interested in finding not the best possible classifier that achieves the highest accuracy, but to find the optimum balance between performance and throughput using the most simple strategy and less dependent of external systems. Results show that our software using Naive Bayes Multinomial with a term vector model representation of the text is ranked quite well among the rest of participants in terms of accuracy.

Watermark-only security attack on DM-QIM watermarking:vulnerability to guided key guessing

This paper addresses the security of a specific class of common watermarking methods based on Dither modulation-quantisation index modulation (DM-QIM) and focusing on watermark-only attacks (WOA). The vulnerabilities of and probable attacks on lattice structure based watermark embedding methods have been presented in the literature. DM-QIM is one of the best known lattice structure based watermarking techniques. In this paper, the authors discuss a watermark-only attack scenario (the attacker has access to a single watermarked content only). In the literature it is an assumption that DM-QIM methods are secure to WOA. However, the authors show that the DM-QIM based embedding method is vulnerable against a guided key guessing attack by exploiting subtle statistical regularities in the feature space embeddings for time series and images. Using a distribution-free algorithm, this paper presents an analysis of the attack and numerical results for multiple examples of image and time series data.

Watermark-only security attack on DM-QIM watermarking:vulnerability to guided key guessing

This paper addresses the security of a specific class of common watermarking methods based on Dither modulation-quantisation index modulation (DM-QIM) and focusing on watermark-only attacks (WOA). The vulnerabilities of and probable attacks on lattice structure based watermark embedding methods have been presented in the literature. DM-QIM is one of the best known lattice structure based watermarking techniques. In this paper, the authors discuss a watermark-only attack scenario (the attacker has access to a single watermarked content only). In the literature it is an assumption that DM-QIM methods are secure to WOA. However, the authors show that the DM-QIM based embedding method is vulnerable against a guided key guessing attack by exploiting subtle statistical regularities in the feature space embeddings for time series and images. Using a distribution-free algorithm, this paper presents an analysis of the attack and numerical results for multiple examples of image and time series data.

The difference model with guessing explains interval bias in two-alternative forced- chocice detection procedures

The standard difference model of two-alternative forced-choice (2AFC) tasks implies that performance should be the same when the target is presented in the first or the second interval. Empirical data often show “interval bias” in that percentage correct differs significantly when the signal is presented in the first or the second interval. We present an extension of the standard difference model that accounts for interval bias by incorporating an indifference zone around the null value of the decision variable. Analytical predictions are derived which reveal how interval bias may occur when data generated by the guessing model are analyzed as prescribed by the standard difference model. Parameter estimation methods and goodness-of-fit testing approaches for the guessing model are also developed and presented. A simulation study is included whose results show that the parameters of the guessing model can be estimated accurately. Finally, the guessing model is tested empirically in a 2AFC detection procedure in which guesses were explicitly recorded. The results support the guessing model and indicate that interval bias is not observed when guesses are separated out.

Correction for guessing in choice reaction time

Additional theoretical and experimental results are presented for a choice reaction time performance model described by Oilman (1966). A formula is given for estimating the latency distribution of true recognition responses from the results of a single session; the estimate is invariant with respect to changes in the proportion of “guess” responses and with respect to fluctuations in the latency distribution of guesses. © 1967, Psychonomic Press. All rights reserved.

Algebraic attacks on clock-controlled stream ciphers

Stream ciphers are encryption algorithms used for ensuring the privacy of digital telecommunications. They have been widely used for encrypting military communications, satellite communications, pay TV encryption and for voice encryption of both fixed lined and wireless networks. The current multi year European project eSTREAM, which aims to select stream ciphers suitable for widespread adoptation, reflects the importance of this area of research. Stream ciphers consist of a keystream generator and an output function. Keystream generators produce a sequence that appears to be random, which is combined with the plaintext message using the output function. Most commonly, the output function is binary addition modulo two. Cryptanalysis of these ciphers focuses largely on analysis of the keystream generators and of relationships between the generator and the keystream it produces. Linear feedback shift registers are widely used components in building keystream generators, as the sequences they produce are well understood. Many types of attack have been proposed for breaking various LFSR based stream ciphers. A recent attack type is known as an algebraic attack. Algebraic attacks transform the problem of recovering the key into a problem of solving multivariate system of equations, which eventually recover the internal state bits or the key bits. This type of attack has been shown to be effective on a number of regularly clocked LFSR based stream ciphers. In this thesis, algebraic attacks are extended to a number of well known stream ciphers where at least one LFSR in the system is irregularly clocked. Applying algebriac attacks to these ciphers has only been discussed previously in the open literature for LILI-128. In this thesis, algebraic attacks are first applied to keystream generators using stop-and go clocking. Four ciphers belonging to this group are investigated: the Beth-Piper stop-and-go generator, the alternating step generator, the Gollmann cascade generator and the eSTREAM candidate: the Pomaranch cipher. It is shown that algebraic attacks are very effective on the first three of these ciphers. Although no effective algebraic attack was found for Pomaranch, the algebraic analysis lead to some interesting findings including weaknesses that may be exploited in future attacks. Algebraic attacks are then applied to keystream generators using (p; q) clocking. Two well known examples of such ciphers, the step1/step2 generator and the self decimated generator are investigated. Algebraic attacks are shown to be very powerful attack in recovering the internal state of these generators. A more complex clocking mechanism than either stop-and-go or the (p; q) clocking keystream generators is known as mutual clock control. In mutual clock control generators, the LFSRs control the clocking of each other. Four well known stream ciphers belonging to this group are investigated with respect to algebraic attacks: the Bilateral-stop-and-go generator, A5/1 stream cipher, Alpha 1 stream cipher, and the more recent eSTREAM proposal, the MICKEY stream ciphers. Some theoretical results with regards to the complexity of algebraic attacks on these ciphers are presented. The algebraic analysis of these ciphers showed that generally, it is hard to generate the system of equations required for an algebraic attack on these ciphers. As the algebraic attack could not be applied directly on these ciphers, a different approach was used, namely guessing some bits of the internal state, in order to reduce the degree of the equations. Finally, an algebraic attack on Alpha 1 that requires only 128 bits of keystream to recover the 128 internal state bits is presented. An essential process associated with stream cipher proposals is key initialization. Many recently proposed stream ciphers use an algorithm to initialize the large internal state with a smaller key and possibly publicly known initialization vectors. The effect of key initialization on the performance of algebraic attacks is also investigated in this thesis. The relationships between the two have not been investigated before in the open literature. The investigation is conducted on Trivium and Grain-128, two eSTREAM ciphers. It is shown that the key initialization process has an effect on the success of algebraic attacks, unlike other conventional attacks. In particular, the key initialization process allows an attacker to firstly generate a small number of equations of low degree and then perform an algebraic attack using multiple keystreams. The effect of the number of iterations performed during key initialization is investigated. It is shown that both the number of iterations and the maximum number of initialization vectors to be used with one key should be carefully chosen. Some experimental results on Trivium and Grain-128 are then presented. Finally, the security with respect to algebraic attacks of the well known LILI family of stream ciphers, including the unbroken LILI-II, is investigated. These are irregularly clock- controlled nonlinear filtered generators. While the structure is defined for the LILI family, a particular paramater choice defines a specific instance. Two well known such instances are LILI-128 and LILI-II. The security of these and other instances is investigated to identify which instances are vulnerable to algebraic attacks. The feasibility of recovering the key bits using algebraic attacks is then investigated for both LILI- 128 and LILI-II. Algebraic attacks which recover the internal state with less effort than exhaustive key search are possible for LILI-128 but not for LILI-II. Given the internal state at some point in time, the feasibility of recovering the key bits is also investigated, showing that the parameters used in the key initialization process, if poorly chosen, can lead to a key recovery using algebraic attacks.

L1 Learning Strategy Instruction does make a difference in EFL listening: An empirical study.

In language learning, listening is the basic skill which learners should begin to develop other skills, namely speaking, reading and writing. This sequence of language learning in most English as Foreign Language (EFL) settings goes against the stream, learning first reading and writing and later listening and speaking. This study investigates the effects of cognitive, process-based approach to instructing EFL listening strategies over 11 weeks during a semester in Persian (L1). Lower intermediate female participants (N = 50) came from a couple of EFL classrooms in an English Language Institute in Iran. The experimental group (n = 25) listened to their classroom activities using a methodology that led learners through four cognitive processes (guessing, making inference, identifying topics and repetition) in Persian was basically successful in EFL listening. The same teacher taught the control group (n = 25), which listened to the same classroom listening activities without any guided attention to the learning strategy process in Persian. A pre and post listening test made by a group of experts in the language institute tracked any development in light of cognitive learning strategy instruction in EFL listening through L1. The hypothesis was that the experimental group received the guided attention in L1 during the classroom listening activities made greater gains and was verified despite the partial improvement of the control group.

Enhancing foreign language learning through listening strategy delivered in L1: an experimental study

Listening used in language teaching refers to a complex process that allows us to understand spoken language. The current study, conducted in Iran with an experimental design, investigated the effectiveness of teaching listening strategies delivered in L1 (Persian) and its effect on listening comprehension in L2. Five listening strategies: Guessing, making inferences, identifying topics, repetition, and note-taking were taught over 14 weeks during a semester. Sixty lower intermediate female participants came from two EFL classrooms in an English language institute. The experimental class (n = 30) who listened to their classroom activities performed better (t value = 10.083) than the control class using a methodology that led learners through five listening strategies in Persian. The same teacher taught the students in the control class (n = 30), who listened to the same classroom listening activities without any of the above listening strategies. A pre and post listening test made by a group of experts in the language institute assessed the effect of teaching listening strategies delivered in L1. Results gathered on the post intervention listening test revealed that listening strategies delivered in L1 led to a statistically significant improvement in their discrete listening scores compared with the control group.

Collaborative intrusion detection framework : characteristics, adversarial opportunities and countermeasures

Complex Internet attacks may come from multiple sources, and target multiple networks and technologies. Nevertheless, Collaborative Intrusion Detection Systems (CIDS) emerges as a promising solution by using information from multiple sources to gain a better understanding of objective and impact of complex Internet attacks. CIDS also help to cope with classical problems of Intrusion Detection Systems (IDS) such as zero-day attacks, high false alarm rates and architectural challenges, e. g., centralized designs exposing the Single-Point-of-Failure. Improved complexity on the other hand gives raise to new exploitation opportunities for adversaries. The contribution of this paper is twofold. We first investigate related research on CIDS to identify the common building blocks and to understand vulnerabilities of the Collaborative Intrusion Detection Framework (CIDF). Second, we focus on the problem of anonymity preservation in a decentralized intrusion detection related message exchange scheme. We use techniques from design theory to provide multi-path peer-to-peer communication scheme where the adversary can not perform better than guessing randomly the originator of an alert message.

Teams rather than individuals : collaborative intrusion detection

We propose CIMD (Collaborative Intrusion and Malware Detection), a scheme for the realization of collaborative intrusion detection approaches. We argue that teams, respectively detection groups with a common purpose for intrusion detection and response, improve the measures against malware. CIMD provides a collaboration model, a decentralized group formation and an anonymous communication scheme. Participating agents can convey intrusion detection related objectives and associated interests for collaboration partners. These interests are based on intrusion objectives and associated interests for collaboration partners. These interests are based on intrusion detection related ontology, incorporating network and hardware configurations and detection capabilities. Anonymous Communication provided by CIMD allows communication beyond suspicion, i.e. the adversary can not perform better than guessing an IDS to be the source of a message at random. The evaluation takes place with the help of NeSSi² (www.nessi2.de), the Network Security Simulator, a dedicated environment for analysis of attacks and countermeasures in mid-scale and large-scale networks. A CIMD prototype is being built based on the JIAC agent framework(www.jiac.de).

Fever pitch

Queensland Theatre Company's season-opening production is a double bill: two one-person plays, two hours to pitch them and two dynamic actors (Hugh Parker and Barbara Lowing). Peter Houghton's works The Pitch and The China Incident caper somewhere in between stand-up comedy and Yes, Prime Minister. Both plays are about "double guessing the bullshit'', in the frenzied worlds of two success compulsives: Walter and Bea.

Ideal threshold schemes from orthogonal arrays

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.

A decision support framework for prioritization of engineering asset management activities under uncertainty

Engineers and asset managers must often make decisions on how to best allocate limited resources amongst different interrelated activities, including repair, renewal, inspection, and procurement of new assets. The presence of project interdependencies and the lack of sufficient information on the true value of an activity often produce complex problems and leave the decision maker guessing about the quality and robustness of their decision. In this paper, a decision support framework for uncertain interrelated activities is presented. The framework employs a methodology for multi-criteria ranking in the presence of uncertainty, detailing the effect that uncertain valuations may have on the priority of a particular activity. The framework employs employing semi-quantitative risk measures that can be tailored to an organisation and enable a transparent and simple-to-use uncertainty specification by the decision maker. The framework is then demonstrated on a real world project set from a major Australian utility provider.