UNIFOLIATA regulates leaf and flower morphogenesis in pea

Background The vegetative phenotype of the pea mutant unifoliata (uni) is a simplification of the wild-type compound leaf to a single leaflet. Mutant uni plants are also self-sterile and the flowers resemble known floral meristem and organ identity mutants. In Antirrhinum and Arabidopsis, mutations in the floral meristem identity gene FLORICAULA/LEAFY (FLO/LFY) affect flower development alone, whereas the tobacco FLO/LFY homologue, NFL, is expressed in vegetative tissues, suggesting that NFL specifies determinacy in the progenitor cells for both flowers and leaves. In this paper, we characterised the pea homologue of FLO/LFY. Results The pea cDNA homologue of FLO/LFY, PEAFLO, mapped to the uni locus in recombinant-inbred mapping populations and markers based on PEAFLO cosegregated with uni in segregating sibling populations. The characterisation of two spontaneous uni mutant alleles, one containing a deletion and the other a point mutation in the PEAFLO coding sequences, predicted that PEAFLO corresponds to UNI and that the mutant vegetative phenotype was conferred by the defective PEAFLO gene. Conclusions The uni mutant demonstrates that there are shared regulatory processes in the morphogenesis of leaves and flowers and that floral meristem identity genes have an extended role in plant development. Pleiotropic regulatory genes such as UNI support the hypothesis that leaves and flowers derive from a common ancestral sporophyll-like structure. The regulation of indeterminacy during leaf and flower morphogenesis by UNI may reflect a primitive function for the gene in the pre-angiosperm era.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Mechanisms of change in psychotherapy for people diagnosed with schizophrenia : the role of narrative reflexivity in promoting recovery

Narrative reflexivity was investigated as a potential mechanism of therapeutic change during a 12 - 18 month trial of Metacognitive Narrative Psychotherapy for people diagnosed with schizophrenia. Participants were nine adult clients (8 male, 1 female) aged between 25-65 years (M = 44, SD = 12.76) with a diagnosis of schizophrenia consistent with DSM-IV criteria and seven female provisional psychologists aged between 25-29 years (M = 26.8 years, SD = 1.47 years). Recovery and narrative reflexivity were measured at three time points using the Recovery Assessment Scale (RAS) and the Narrative Processes Coding System (NPCS). Results were reported descriptively due to limited sample size (n = 9). The majority of clients (n = 7) reported an increase in recovery over the course of treatment. For six clients, an overall increase in recovery was associated with an increase in narrative reflexivity. This study provides preliminary support for narrative reflexivity as a potential mechanism of therapeutic change in the psychotherapy of people diagnosed with schizophrenia.

Universal codes from switching strategies

We discuss algorithms for combining sequential prediction strategies, a task which can be viewed as a natural generalisation of the concept of universal coding. We describe a graphical language based on Hidden Markov Models for defining prediction strategies, and we provide both existing and new models as examples. The models include efficient, parameterless models for switching between the input strategies over time, including a model for the case where switches tend to occur in clusters, and finally a new model for the scenario where the prediction strategies have a known relationship, and where jumps are typically between strongly related ones. This last model is relevant for coding time series data where parameter drift is expected. As theoretical contributions we introduce an interpolation construction that is useful in the development and analysis of new algorithms, and we establish a new sophisticated lemma for analysing the individual sequence regret of parameterised models.

Revisiting Polya's summation techniques using a spreadsheet : from addition tables to Bernoulli polynomials

Recurrence relations in mathematics form a very powerful and compact way of looking at a wide range of relationships. Traditionally, the concept of recurrence has often been a difficult one for the secondary teacher to convey to students. Closely related to the powerful proof technique of mathematical induction, recurrences are able to capture many relationships in formulas much simpler than so-called direct or closed formulas. In computer science, recursive coding often has a similar compactness property, and, perhaps not surprisingly, suffers from similar problems in the classroom as recurrences: the students often find both the basic concepts and practicalities elusive. Using models designed to illuminate the relevant principles for the students, we offer a range of examples which use the modern spreadsheet environment to powerfully illustrate the great expressive and computational power of recurrences.

Broadcast anti-jamming systems

In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.

Relationship between expectation management and client retention in online Cognitive Behavioural Therapy

Background Engaging clients from the outset of psychotherapy is important for therapeutic success. However, there is little research evaluating therapists’ initial attempts to engage clients. This article reports retrospective analysis of data from a trial of online Cognitive Behavioural Therapy (CBT) for depression. Qualitative and quantitative methods were used to evaluate how therapists manage clients’ expectations at the outset of therapy and its relationship with client retention in the therapeutic intervention. Aims To develop a system to codify expectation management in initial sessions of online CBT and evaluate its relationship with retention. Method Initial qualitative research using conversation analysis identified three different communication practices used by therapists at the start of first sessions: no expectation management, some expectation management, and comprehensive expectation management. These findings were developed into a coding scheme that enabled substantial inter-rater agreement (weighted Kappa = 0.78; 95% CI: 0.52 to 0.94) and was applied to all trial data. Results Adjusting for a range of client variables, primary analysis of data from 147 clients found comprehensive expectation management was associated with clients remaining in therapy for 1.4 sessions longer than those who received no expectation management (95% CI: -0.2 to 3.0). This finding was supported by a sensitivity analysis including an additional 21 clients (1.6 sessions, 95% CI: 0.2 to 3.1). Conclusions Using a combination of qualitative and quantitative methods, this study suggests a relationship between expectation management and client retention in online CBT for depression, which has implications for professional practice. A larger prospective study would enable a more precise estimate of retention.

Indonesian LIS professionals’ understanding of Library 2.0 : a pilot study

The literature around Library 2.0 remains largely theoretical with few empirically studies and is particularly limited in developing countries such as Indonesia. This study addresses this gap and aims to provide information about the current state of knowledge on Indonesian LIS professionals’ understanding of Library 2.0. The researchers used qualitative and quantitative approaches for this study, asking thirteen closed- and open-ended questions in an online survey. The researchers used descriptive and in vivo coding to analyze the responses. Through their analysis, they identified three themes: technology, interactivity, and awareness of Library 2.0. Respondents demonstrated awareness of Library 2.0 and a basic understanding of the roles of interactivity and technology in libraries. However, overreliance on technology used in libraries to conceptualize Library 2.0 without an emphasis on its core characteristics and principles could lead to the misalignment of limited resources. The study results will potentially strengthen the research base for Library 2.0 practice, as well as inform LIS curriculum in Indonesia so as to develop practitioners who are able to adapt to users’ changing needs and expectations. It is expected that the preliminary data of this study could be used to design a much larger and more complex future research project in this area.

The effect of prior visual information on recognition of speech and sounds

To identify and categorize complex stimuli such as familiar objects or speech, the human brain integrates information that is abstracted at multiple levels from its sensory inputs. Using cross-modal priming for spoken words and sounds, this functional magnetic resonance imaging study identified 3 distinct classes of visuoauditory incongruency effects: visuoauditory incongruency effects were selective for 1) spoken words in the left superior temporal sulcus (STS), 2) environmental sounds in the left angular gyrus (AG), and 3) both words and sounds in the lateral and medial prefrontal cortices (IFS/mPFC). From a cognitive perspective, these incongruency effects suggest that prior visual information influences the neural processes underlying speech and sound recognition at multiple levels, with the STS being involved in phonological, AG in semantic, and mPFC/IFS in higher conceptual processing. In terms of neural mechanisms, effective connectivity analyses (dynamic causal modeling) suggest that these incongruency effects may emerge via greater bottom-up effects from early auditory regions to intermediate multisensory integration areas (i.e., STS and AG). This is consistent with a predictive coding perspective on hierarchical Bayesian inference in the cortex where the domain of the prediction error (phonological vs. semantic) determines its regional expression (middle temporal gyrus/STS vs. AG/intraparietal sulcus).

Malleability attacks on multi-party key agreement protocols

Multi-party key agreement protocols indirectly assume that each principal equally contributes to the final form of the key. In this paper we consider three malleability attacks on multi-party key agreement protocols. The first attack, called strong key control allows a dishonest principal (or a group of principals) to fix the key to a pre-set value. The second attack is weak key control in which the key is still random, but the set from which the key is drawn is much smaller than expected. The third attack is named selective key control in which a dishonest principal (or a group of dishonest principals) is able to remove a contribution of honest principals to the group key. The paper discusses the above three attacks on several key agreement protocols, including DH (Diffie-Hellman), BD (Burmester-Desmedt) and JV (Just-Vaudenay). We show that dishonest principals in all three protocols can weakly control the key, and the only protocol which does not allow for strong key control is the DH protocol. The BD and JV protocols permit to modify the group key by any pair of neighboring principals. This modification remains undetected by honest principals.

Software watermarking resilient to debugging attacks

In 2006, Gaurav Gupta and Josef Pieprzyk presented an attack on the branch-based software watermarking scheme proposed by Ginger Myles and Hongxia Jin in 2005. The software watermarking model is based on replacing jump instructions or unconditional branch statements (UBS) by calls to a fingerprint branch function (FBF) that computes the correct target address of the UBS as a function of the generated fingerprint and integrity check. If the program is tampered with, the fingerprint and/or integrity checks change and the target address is not computed correctly. Gupta and Pieprzyk's attack uses debugger capabilities such as register and address lookup and breakpoints to minimize the requirement to manually inspect the software. Using these resources, the FBF and calls to the same is identified, correct displacement values are generated and calls to FBF are replaced by the original UBS transferring control of the attack to the correct target instruction. In this paper, we propose a watermarking model that provides security against such debugging attacks. Two primary measures taken are shifting the stack pointer modification operation from the FBF to the individual UBSs, and coding the stack pointer modification in the same language as that of the rest of the code rather than assembly language to avoid conspicuous contents. The manual component complexity increases from O(1) in the previous scheme to O(n) in our proposed scheme.

The complete mitochondrial genome of the yellow coaster, Acraea issoria (Lepidoptera: Nymphalidae: Heliconiinae: Acraeini): sequence, gene organization and a unique tRNA translocation event

In this paper, the complete mitochondrial genome of Acraea issoria (Lepidoptera: Nymphalidae: Heliconiinae: Acraeini) is reported; a circular molecule of 15,245 bp in size. For A. issoria, genes are arranged in the same order and orientation as the complete sequenced mitochondrial genomes of the other lepidopteran species, except for the presence of an extra copy of tRNAIle(AUR)b in the control region. All protein-coding genes of A. issoria mitogenome start with a typical ATN codon and terminate in the common stop codon TAA, except that COI gene uses TTG as its initial codon and terminates in a single T residue. All tRNA genes possess the typical clover leaf secondary structure except for tRNASer(AGN), which has a simple loop with the absence of the DHU stem. The sequence, organization and other features including nucleotide composition and codon usage of this mitochondrial genome were also reported and compared with those of other sequenced lepidopterans mitochondrial genomes. There are some short microsatellite-like repeat regions (e.g., (TA)9, polyA and polyT) scattered in the control region, however, the conspicuous macro-repeats units commonly found in other insect species are absent.

The complete mitochondrial genome of Spilonota lechriaspis Meyrick (Lepidoptera: Tortricidae)

We determined the nucleotide sequence of the mitochondrial genome (mtgenome) of Spilonota lechriaspis Meyrick (Lepidoptera: Tortricidae). The entire closed circular molecule is 15,368 bp and contains 37 genes with the typical gene complement and order for lepidopteran mtgenomes. All tRNAs except tRNASer(AGN) can be folded into the typical cloverleaf secondary structures. The protein-coding genes (PCGs) have typical mitochondrial start codons, with the exception of COI, which uses the unusual CGA one as is found in all other Lepidoptera sequenced to date. In addition, six of 13 PCGs harbor the incomplete termination codons, a single T. The A+T-rich region contains some conserved structures that are similar to those found in other lepidopteran mtgenomes, including a structure combining the motif 'ATAGA', a 19-bp poly(T) stretch and three microsatellite (AT)n elements which are part of larger 122+ bp macrorepeats. This is the first report of macrorepeats in a lepidopteran mtgenome.

Introspective service interface synthesis in business networks

Service mismatches involve the adaptation of structural and behavioural interfaces of services, which in practice incurs long lead times through manual, coding e ort. We propose a framework, complementary to conventional service adaptation, to extract comprehensive and seman- tically normalised service interfaces, useful for interoperability in large business networks and the Internet of Services. The framework supports introspection and analysis of large and overloaded operational signa- tures to derive focal artefacts, namely the underlying business objects of services. A more simpli ed and comprehensive service interface layer is created based on these, and rendered into semantically normalised in- terfaces, given an ontology accrued through the framework from service analysis history. This opens up the prospect of supporting capability comparisons across services, and run-time request backtracking and ad- justment, as consumers discover new features of a service's operations through corresponding features of similar services. This paper provides a rst exposition of the service interface synthesis framework, describing patterns having novel requirements for unilateral service adaptation, and algorithms for interface introspection and business object alignment. A prototype implementation and analysis of web services drawn from com- mercial logistic systems are used to validate the algorithms and identify open challenges and future research directions.

Review and future options for computer modelling in the sugar industry

Computer modelling has been used extensively in some processes in the sugar industry to achieve significant gains. This paper reviews the investigations carried out over approximately the last twenty five years,including the successes but also areas where problems and delays have been encountered. In that time the capability of both hardware and software have increased dramatically. For some processes such as cane cleaning, cane billet preparation, and sugar drying, the application of computer modelling towards improved equipment design and operation has been quite limited. A particular problem has been the large number of particles and particle interactions in these applications, which, if modelled individually, is computationally very intensive. Despite the problems, some attempts have already been made and knowledge gained on tackling these issues. Even if the detailed modelling is wanting, a model can provide some useful insights into the processes. Some options to attack these more intensive problems include the use of commercial software packages, which are usually very robust and allow the addition of user-supplied subroutines to adapt the software to particular problems. Suppliers of such software usually charge a fee per CPU licence, which is often problematic for large problems that require the use of many CPUs. Another option to consider is using open source software that has been developed with the capability to access large parallel resources. Such software has the added advantage of access to the full internal coding. This paper identifies and discusses the detail of software options with the potential capability to achieve improvements in the sugar industry.