Nucleotide sequences of an Australian and a Canadian isolate of potato leafroll luteovirus and their relationships with two European isolates

The genomes of an Australian and a Canadian isolate of potato leafroll virus have been cloned and sequenced. The sequences of both isolates are similar (about 93%), but the Canadian isolate (PLRV-C) is more closely related (about 98% identity) to a Scottish (PLRV-S) and a Dutch isolate (PLRV-N) than to the Australian isolate (PLRV-A). The 5'-terminal 18 nucleotide residues of PLRV-C, PLRV-A, PLRV-N and beet western yellows virus have 17 residues in common. In contrast, PLRV-S shows no obvious similarity in this region. PLRV-A and PLRV-C genomic sequences have localized regions of marked diversity, in particular a 600 nucleotide residue sequence in the polymerase gene. These data provide a world-wide perspective on the molecular biology of PLRV strains and their comparison with other luteoviruses and related RNA plant viruses suggests that there are two major subgroups in the plant luteoviruses.

Dietetic practice by Australian and Canadian dietitians with people with Parkinson's disease

Although Parkinson’s disease (PD) is a complex disease for which appropriate nutrition management is important, limited evidence is currently available to support dietetic practice. Existing PD-specific guidelines do not span all phases of the Nutrition Care Process (NCP). This study aimed to document PD-specific nutrition management practice by Australian and Canadian dietitians. DAA members and PEN subscribers were invited to participate in an online survey (late 2011). Eighty-four dietitians responded (79.8% Australian). The majority (70.2%) worked in the clinical setting. Existing non-PD guidelines were used by 52.4% while 53.6% relied on self-initiated literature reviews. Weight loss/malnutrition, protein intake, dysphagia and constipation were common issues in all NCP phases. Respondents also requested more information/evidence for these topics. Malnutrition screening (82.1%) and assessment (85.7%) were routinely performed. One-third did not receive referrals for weight loss for overweight/obesity. Protein intake meeting gender/age recommendations (69.0%), and high energy/high protein diets to manage malnutrition (82.1%) were most commonly used. Constipation management was through high fibre diets (86.9%). Recommendations for spacing of meals and PD medications varied with 34.5% not making recommendations. Nutritional diagnosis (70.2%) and stage of disease (61.9%) guided monitoring frequency. Common outcome measures included appropriate weight change (97.6%) and regular bowel movements (88.1%). With limited PD-specific guidance, dietitians applied best available evidence for other groups with similar issues. Dietitians requested evidence-based guidelines specifically for the nutritional management of PD. Guideline development should focus on those areas reported as commonly encountered. This process can identify the gaps in evidence to guide future research.

Affective events theory as a framework for understanding third-party consumer complaints

Poor complaint management may result in organizations losing customers and revenue. Consumers exhibit negative emotional responses when dissatisfied and this may lead to a complaint to a third-party organization. Since little information is available on the role of emotion in the consumer complaint process or how to manage complaints effectively, we offer an emotions perspective by applying Affective Events Theory (AET) to complaint behavior. This study presents the first application of AET in a consumption context and advances a theoretical framework supported by qualitative research for emotional responses to complaints. In contrast to commonly held views on gender and emotion, men as well as women use emotion-focused coping to complain.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

Multi-party computation with omnipresent adversary

Secure multi-party computation (MPC) protocols enable a set of n mutually distrusting participants P 1, ..., P n , each with their own private input x i , to compute a function Y = F(x 1, ..., x n ), such that at the end of the protocol, all participants learn the correct value of Y, while secrecy of the private inputs is maintained. Classical results in the unconditionally secure MPC indicate that in the presence of an active adversary, every function can be computed if and only if the number of corrupted participants, t a , is smaller than n/3. Relaxing the requirement of perfect secrecy and utilizing broadcast channels, one can improve this bound to t a  < n/2. All existing MPC protocols assume that uncorrupted participants are truly honest, i.e., they are not even curious in learning other participant secret inputs. Based on this assumption, some MPC protocols are designed in such a way that after elimination of all misbehaving participants, the remaining ones learn all information in the system. This is not consistent with maintaining privacy of the participant inputs. Furthermore, an improvement of the classical results given by Fitzi, Hirt, and Maurer indicates that in addition to t a actively corrupted participants, the adversary may simultaneously corrupt some participants passively. This is in contrast to the assumption that participants who are not corrupted by an active adversary are truly honest. This paper examines the privacy of MPC protocols, and introduces the notion of an omnipresent adversary, which cannot be eliminated from the protocol. The omnipresent adversary can be either a passive, an active or a mixed one. We assume that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold. We will also show that the existence of a t-resilient protocol for a group of n participants, implies the existence of a t’-private protocol for a group of n′ participants. That is, the elimination of misbehaving participants from a t-resilient protocol leads to the decomposition of the protocol. Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario). Therefore, privacy of all participants who properly follow the protocol will be maintained. We present a novel disqualification protocol to avoid a loss of privacy of participants who properly follow the protocol.

Assessment of costs : challenge to validity of client agreement between party entitled to costs and its solicitors

In ASIC v Atlantic 3 Financial (Aust) Pty Ltd [2006] QCA 540 the Queensland Court of Appeal dismissed an appeal from the decision of Mullins J at first instance in ASIC v Atlantic 3 Financial (Aust) Pty LTd [2006] QSC 152, the majority concluding that the client agreement in issue was not inconsistent with s48 of the Queensland Law Society Act 1952.

Party to litigation insolvent company - costs order against non-party liquidator

In Kimtran Pty Ltd v Downie [2003] QDC 043 the court allowed in part an appeal from the refusal by the Queensland Building Tribunal to order the respondent liquidators pay the appellants' costs of proceedings in the Tribunal. The decision involved an examination of authorities which have considered the circumstances in which it is in the interests of justice to make an order for costs against a non-party.

Should the court direct that costs ordered to be recovered on the indemnity basis be assessed by reference to a costs agreement between the successful party and their solicitors?

The decision in Hook v Boreham & QBE Insurance (Australia) Limited [2006] QDC 304 considered whether the court should go further than order that costs be assessed on the indemnity basis, but should also specify the basis by which those indemnity costs should be determined. The decision makes it clear that under r704(3) of the Uniform Civil Procedure Rules, questions of that nature are ordinarily preserved to the discretion of the Registrar.

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.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Influence and increased funding in Canadian public libraries : the case of Alberta in fiscal year 2009–10

This exploratory case study examined the role of social influence in the decision-making process to increase public library funding in the Canadian province of Alberta in the 2009–10 fiscal year. Using Robert Cialdini’s theory of factors of influence (i.e., commitment and consistency, authority, liking, social proof, scarcity, and reciprocity) as a framework for analysis, findings show that consistency and commitment and authority were relevant and that liking was also important. These findings are consistent with Cialdini’s theory, which suggests that the quality of relationships is one factor that can most strongly influence a decision maker. This study gives insight into the factors motivating those involved in public library funding allocation decisions. No prior studies have examined the construct of influence in decision making about funding for public libraries at any level of government.

The role of interpersonal influence in budget decision making: The Canadian public library experience

This study determined factors which influenced Canadian provincial (state) politicians when making funding decisions for public libraries. Using the case study methodology, Canadian provincial/state-level funding for public libraries in the 2009-2010 fiscal year was examined. The data were analyzed to determine whether Cialdini’s theory of influence and specifically any of the six tactics of influence (i.e., commitment and consistency, authority, liking, social proof, scarcity, and reciprocity) were instrumental in these budgetary decision-making processes. Findings show the principles of “authority,” “consistency and commitment,” and “liking” were relevant, and that “liking” was especially important to these decisions.

Wilds of the Canadian Rockies

A travel article about touring in the Rockies, Alberta. MORAINE Lake, held up by a crown of mountains near the small town of Lake Louise, is opal blue. You'd need a precious stone to cut the surface. And even on a hot morning in August, there are plenty around: diamonds of snow decorate the mountain tops and, in their reflections, slice the lake with white triangles. We are at the start of a track that climbs from the lake to Mt Temple, the tallest mountain in the area and two or three hours' walk away. When the track zigzags back, we glimpse the lake through gaps in the conifer forest...

Moved by spirit of Canadian nature

A travel article about a visit to Klemtu and the Great Bear Rainforest, British Columbia. A LOW-TIDE mark of rocks coated in orange seaweed borders the islands of the Great Bear Rainforest. Our seaplane stays low under the clouds. As we approach the village of Klemtu, turning into Finlayson Channel, the trees beneath us thicken against the shoreline like a concert crowd being pushed from behind. There's no gap between the dark, still sea and the front row of soaring conifers, seemingly no entry point into one of the last great wilderness areas.

Party tricks struggles for votes with a social media audience

With Ten’s new drama Party Tricks set for an October 6 premiere, coverage has focused on the social media campaign to promote the show. In advance of the screening, Ten has created in-character accounts for the lead characters, Kate Ballard (Asher Keddie) and David McLeod (Rodger Corser)...