86 resultados para Pairings
Resumo:
La Criptografía Basada en la Identidad hace uso de curvas elípticas que satisfacen ciertas condiciones (pairingfriendly curves), en particular, el grado de inmersión de dichas curvas debe ser pequeño. En este trabajo se obtienen familias explicitas de curvas elípticas idóneas para este escenario. Dicha criptografía está basada en el cálculo de emparejamientos sobre curvas, cálculo factible gracias al algoritmo de Miller. Proponemos una versión más eficiente que la clásica de este algoritmo usando la representación de un número en forma no adyacente (NAF).
Resumo:
Hydrophobins are small (similar to 100 aa) proteins that have an important role in the growth and development of mycelial fungi. They are surface active and, after secretion by the fungi, self-assemble into amphipathic membranes at hydrophobic/hydrophilic interfaces, reversing the hydrophobicity of the surface. In this study, molecular dynamics simulation techniques have been used to model the process by which a specific class I hydrophobin, SC3, binds to a range of hydrophobic/ hydrophilic interfaces. The structure of SC3 used in this investigation was modeled based on the crystal structure of the class II hydrophobin HFBII using the assumption that the disulfide pairings of the eight conserved cysteine residues are maintained. The proposed model for SC3 in aqueous solution is compact and globular containing primarily P-strand and coil structures. The behavior of this model of SC3 was investigated at an air/water, an oil/water, and a hydrophobic solid/water interface. It was found that SC3 preferentially binds to the interfaces via the loop region between the third and fourth cysteine residues and that binding is associated with an increase in a-helix formation in qualitative agreement with experiment. Based on a combination of the available experiment data and the current simulation studies, we propose a possible model for SC3 self-assembly on a hydrophobic solid/water interface.
Resumo:
Corporate sponsorship of events contributes significantly to marketing aims, including brand awareness as measured by recall and recognition of sponsor-event pairings. Unfortunately, resultant advantages accrue disproportionately to brands having a natural or congruent fit with the available sponsorship properties. In three cued-recall experiments, the effect of articulation of sponsorship fit on memory for sponsor-event pairings is examined. While congruent sponsors have a natural memory advantage, results demonstrate that memory improvements via articulation are possible for incongruent sponsor-event pairings. These improvements are, however, affected by the presence of competitor brands and the way in which memory is accessed.
Resumo:
The research presented in this paper is part of an ongoing investigation into how best to incorporate speech-based input within mobile data collection applications. In our previous work [1], we evaluated the ability of a single speech recognition engine to support accurate, mobile, speech-based data input. Here, we build on our previous research to compare the achievable speaker-independent accuracy rates of a variety of speech recognition engines; we also consider the relative effectiveness of different speech recognition engine and microphone pairings in terms of their ability to support accurate text entry under realistic mobile conditions of use. Our intent is to provide some initial empirical data derived from mobile, user-based evaluations to support technological decisions faced by developers of mobile applications that would benefit from, or require, speech-based data entry facilities.
Resumo:
The visual system dissects the retinal image into millions of local analyses along numerous visual dimensions. However, our perceptions of the world are not fragmentary, so further processes must be involved in stitching it all back together. Simply summing up the responses would not work because this would convey an increase in image contrast with an increase in the number of mechanisms stimulated. Here, we consider a generic model of signal combination and counter-suppression designed to address this problem. The model is derived and tested for simple stimulus pairings (e.g. A + B), but is readily extended over multiple analysers. The model can account for nonlinear contrast transduction, dilution masking, and signal combination at threshold and above. It also predicts nonmonotonic psychometric functions where sensitivity to signal A in the presence of pedestal B first declines with increasing signal strength (paradoxically dropping below 50% correct in two-interval forced choice), but then rises back up again, producing a contour that follows the wings and neck of a swan. We looked for and found these "swan" functions in four different stimulus dimensions (ocularity, space, orientation, and time), providing some support for our proposal.
Resumo:
The research presented in this paper is part of an ongoing investigation into how best to incorporate speech-based input within mobile data collection applications. In our previous work [1], we evaluated the ability of a single speech recognition engine to support accurate, mobile, speech-based data input. Here, we build on our previous research to compare the achievable speaker-independent accuracy rates of a variety of speech recognition engines; we also consider the relative effectiveness of different speech recognition engine and microphone pairings in terms of their ability to support accurate text entry under realistic mobile conditions of use. Our intent is to provide some initial empirical data derived from mobile, user-based evaluations to support technological decisions faced by developers of mobile applications that would benefit from, or require, speech-based data entry facilities.
Resumo:
This paper describes a process to enhance the quality of higher education. At the heart of the process is a cross-sparring collaborative model, whereby institutions are critical friends. This is based on a prior self-evaluation, where the institution / programme identifies quality criteria it wants to improve. Part of the process is to ensure the documentation of best practices so that they can be shared with others in a so called market place. Linking the best practices to a criterion makes them searchable on a large scale. Optimal pairings of institutions can then take place for the cross-sparring activities.
Resumo:
Fusarium oxysporum forma specialis cubense is a soilborne phytopathogen that infects banana. The true evolutionary identity of this so called species, Fusarium oxysporum, is still unknown. Many techniques have been applied in order to gain insight for the observed genetic diversity of this species. The current classification system is based on vegetative compatibility groups (VCG's). Vegetative compatibility is a self non-self recognition system in which only those belonging to a VCG can form stable heterokaryons, cells containing two distinct nuclei. Heterokaryons in turn, are formed from hypha! anastomosis, the fusion of two hyphae. Furthermore, subsequent to heterokaryon formation potential mechanisms exist which may generate genetic variability. One is through viral transfer upon hyphal anastomosis. The other mechanism is a form of mitotic recombination referred to as the parasexual cycle. Very little research has been performed to directly obser.ve the cellular events; hypha! anastomosis, heterokaryon formation, and the parasexual cycle in Fusarium oxysporum f. sp. cubense. The purpose of this research was to design and use methods which would allow for the detection of hypha! anastomosis and heterokaryon formation, as well as any characteristics surrounding this event, within and between VCG's in Foe. First, some general growth properties were recorded: the number of nuclei per hypha, the size ofthe hyphal tip cell, the size of the cell adjacent to the hypha! tip (pre-tip) cell, and the number of cells to the first branch point. Second, four methods were designed in order to assay hyphal anastomosis and heterokaryon formation: 1) pairings on membrane: phase or brightfield microscopy, 2) pairings on membrane: fluorescence microscopy, 3) spore crosses: fluorescence microscopy, and 4) double picks in fractionated MMA. All of these methods were promtsmg.
Resumo:
A study was conducted to investigate the timing of the breeding season of western hedgehogs (Erinaceus europaeus) in a rural landscape in Ireland, their courtship activity and the first appearance and possible dispersal of juveniles. Between June 2008 and June 2010, 24 hedgehogs (18 ♂ and 6 ♀) were caught and monitored by radio tracking and direct following. A preponderance of males was recorded in both adults and juveniles at the study site and the sex ratio deviated significantly from a 1:1 ratio. Courtship behaviour took place between April and July and occurred almost exclusively in a nine ha pasture. An individual female paired with up to seven males in a season. The first appearance of juveniles was recorded in September (2008) and July (2009). The majority (n=22) of juvenile sightings, both alive and as road kill, occurred in July but they continued to be recorded up until November (n=3). The presence of juveniles at the study site in October 2008 and a pregnant female being found in September 2009 indicated that late litters occur in Ireland.
Resumo:
We discover novel topological effects in the one-dimensional Kitaev chain modified by long-range Hamiltonian deformations in the hopping and pairing terms. This class of models display symmetry-protected topological order measured by the Berry/Zak phase of the lower-band eigenvector and the winding number of the Hamiltonians. For exponentially decaying hopping amplitudes, the topological sector can be significantly augmented as the penetration length increases, something experimentally achievable. For power-law decaying superconducting pairings, the massless Majorana modes at the edges get paired together into a massive nonlocal Dirac fermion localized at both edges of the chain: a new topological quasiparticle that we call topological massive Dirac fermion. This topological phase has fractional topological numbers as a consequence of the long-range couplings. Possible applications to current experimental setups and topological quantum computation are also discussed.
Resumo:
Bilinear pairings can be used to construct cryptographic systems with very desirable properties. A pairing performs a mapping on members of groups on elliptic and genus 2 hyperelliptic curves to an extension of the finite field on which the curves are defined. The finite fields must, however, be large to ensure adequate security. The complicated group structure of the curves and the expensive field operations result in time consuming computations that are an impediment to the practicality of pairing-based systems. The Tate pairing can be computed efficiently using the ɳT method. Hardware architectures can be used to accelerate the required operations by exploiting the parallelism inherent to the algorithmic and finite field calculations. The Tate pairing can be performed on elliptic curves of characteristic 2 and 3 and on genus 2 hyperelliptic curves of characteristic 2. Curve selection is dependent on several factors including desired computational speed, the area constraints of the target device and the required security level. In this thesis, custom hardware processors for the acceleration of the Tate pairing are presented and implemented on an FPGA. The underlying hardware architectures are designed with care to exploit available parallelism while ensuring resource efficiency. The characteristic 2 elliptic curve processor contains novel units that return a pairing result in a very low number of clock cycles. Despite the more complicated computational algorithm, the speed of the genus 2 processor is comparable. Pairing computation on each of these curves can be appealing in applications with various attributes. A flexible processor that can perform pairing computation on elliptic curves of characteristic 2 and 3 has also been designed. An integrated hardware/software design and verification environment has been developed. This system automates the procedures required for robust processor creation and enables the rapid provision of solutions for a wide range of cryptographic applications.