Lattice-based threshold-changeability for standard CRT secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.

Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Threshold MACs

The power of sharing computation in a cryptosystem is crucial in several real-life applications of cryptography. Cryptographic primitives and tasks to which threshold cryptosystems have been applied include variants of digital signature, identification, public-key encryption and block ciphers etc. It is desirable to extend the domain of cryptographic primitives which threshold cryptography can be applied to. This paper studies threshold message authentication codes (threshold MACs). Threshold cryptosystems usually use algebraically homomorphic properties of the underlying cryptographic primitives. A typical approach to construct a threshold cryptographic scheme is to combine a (linear) secret sharing scheme with an algebraically homomorphic cryptographic primitive. The lack of algebraic properties of MACs rules out such an approach to share MACs. In this paper, we propose a method of obtaining a threshold MAC using a combinatorial approach. Our method is generic in the sense that it is applicable to any secure conventional MAC by making use of certain combinatorial objects, such as cover-free families and their variants. We discuss the issues of anonymity in threshold cryptography, a subject that has not been addressed previously in the literature in the field, and we show that there are trade-offis between the anonymity and efficiency of threshold MACs.

An intentional class design model to engage first year students with threshold concepts using the academic discourse theories of Vygotsky and Laurillard

In the context of the first-year university classroom, this paper develops Vygotsky’s claim that ‘the relations between the higher mental functions were at one time real relations between people’. By taking the main horizontal and hierarchical levels of classroom discourse and dialogue (student-student, student-teacher, teacher-teacher) and marrying these with the possibilities opened up by Laurillard’s conversational framework, we argue that the learning challenge of a ‘troublesome’ threshold concept might be met by a carefully designed sequence of teaching events and experiences for first year students, and we provide a number of strategies that exploit each level of these ‘hierarchies of discourse’. We suggest that an analytical approach to classroom design that embodies these levels of discourse in sequenced dialogic methods could be used by teachers as a strategy to interrogate and adjust teaching-in-practice especially in the first year of university study.

Interactive content analysis : evaluating interactive variants of non-negative Matrix Factorisation and Latent Dirichlet Allocation as qualitative content analysis aids

This thesis addressed issues that have prevented qualitative researchers from using thematic discovery algorithms. The central hypothesis evaluated whether allowing qualitative researchers to interact with thematic discovery algorithms and incorporate domain knowledge improved their ability to address research questions and trust the derived themes. Non-negative Matrix Factorisation and Latent Dirichlet Allocation find latent themes within document collections but these algorithms are rarely used, because qualitative researchers do not trust and cannot interact with the themes that are automatically generated. The research determined the types of interactivity that qualitative researchers require and then evaluated interactive algorithms that matched these requirements. Theoretical contributions included the articulation of design guidelines for interactive thematic discovery algorithms, the development of an Evaluation Model and a Conceptual Framework for Interactive Content Analysis.

A new ambiguity acceptance test threshold determination method with controllable failure rate

The ambiguity acceptance test is an important quality control procedure in high precision GNSS data processing. Although the ambiguity acceptance test methods have been extensively investigated, its threshold determine method is still not well understood. Currently, the threshold is determined with the empirical approach or the fixed failure rate (FF-) approach. The empirical approach is simple but lacking in theoretical basis, while the FF-approach is theoretical rigorous but computationally demanding. Hence, the key of the threshold determination problem is how to efficiently determine the threshold in a reasonable way. In this study, a new threshold determination method named threshold function method is proposed to reduce the complexity of the FF-approach. The threshold function method simplifies the FF-approach by a modeling procedure and an approximation procedure. The modeling procedure uses a rational function model to describe the relationship between the FF-difference test threshold and the integer least-squares (ILS) success rate. The approximation procedure replaces the ILS success rate with the easy-to-calculate integer bootstrapping (IB) success rate. Corresponding modeling error and approximation error are analysed with simulation data to avoid nuisance biases and unrealistic stochastic model impact. The results indicate the proposed method can greatly simplify the FF-approach without introducing significant modeling error. The threshold function method makes the fixed failure rate threshold determination method feasible for real-time applications.

A novel ambiguity acceptance test threshold determination method with controllable failure rate

Ambiguity validation as an important procedure of integer ambiguity resolution is to test the correctness of the fixed integer ambiguity of phase measurements before being used for positioning computation. Most existing investigations on ambiguity validation focus on test statistic. How to determine the threshold more reasonably is less understood, although it is one of the most important topics in ambiguity validation. Currently, there are two threshold determination methods in the ambiguity validation procedure: the empirical approach and the fixed failure rate (FF-) approach. The empirical approach is simple but lacks of theoretical basis. The fixed failure rate approach has a rigorous probability theory basis, but it employs a more complicated procedure. This paper focuses on how to determine the threshold easily and reasonably. Both FF-ratio test and FF-difference test are investigated in this research and the extensive simulation results show that the FF-difference test can achieve comparable or even better performance than the well-known FF-ratio test. Another benefit of adopting the FF-difference test is that its threshold can be expressed as a function of integer least-squares (ILS) success rate with specified failure rate tolerance. Thus, a new threshold determination method named threshold function for the FF-difference test is proposed. The threshold function method preserves the fixed failure rate characteristic and is also easy-to-apply. The performance of the threshold function is validated with simulated data. The validation results show that with the threshold function method, the impact of the modelling error on the failure rate is less than 0.08%. Overall, the threshold function for the FF-difference test is a very promising threshold validation method and it makes the FF-approach applicable for the real-time GNSS positioning applications.

Implementing the self-management threshold learning outcome for law : some intentional design strategies from the current curriculum toolbox

There is a growing awareness of the high levels of psychological distress being experienced by law students and the practising profession in Australia. In this context, a Threshold Learning Outcome (TLO) on self-management has been included in the six TLOs recently articulated as minimum learning outcomes for all Australian graduates of the Bachelor of Laws degree (LLB). The TLOs were developed during 2010 as part of the Australian Learning and Teaching Council’s (ALTC’s) project funded by the Australian Government to articulate ‘Learning and Teaching Academic Standards’. The TLOs are the result of a comprehensive national consultation process led by the ALTC’s Discipline Scholars: Law, Professors Sally Kift and Mark Israel.1 The TLOs have been endorsed by the Council of Australian Law Deans (CALD) and have received broad support from members of the judiciary and practising profession, representative bodies of the legal profession, law students and recent graduates, Legal Services Commissioners and the Law Admissions Consultative Committee. At the time of writing, TLOs for the Juris Doctor (JD) are also being developed, utilising the TLOs articulated for the LLB as their starting point but restating the JD requirements as the higher order outcomes expected of graduates of a ‘Masters Degree (Extended)’, this being the award level designation for the JD now set out in the new Australian Qualifications Framework.2 As Australian law schools begin embedding the learning, teaching and assessment of the TLOs in their curricula, and seek to assure graduates’ achievement of them, guidance on the implementation of the self-management TLO is salient and timely.

Latent class analysis reveals distinct subgroups of patients based on symptom occurrence and demographic and clinical characteristics

Context Cancer patients experience a broad range of physical and psychological symptoms as a result of their disease and its treatment. On average, these patients report ten unrelieved and co-occurring symptoms. Objectives To determine if subgroups of oncology outpatients receiving active treatment (n=582) could be identified based on their distinct experience with thirteen commonly occurring symptoms; to determine whether these subgroups differed on select demographic, and clinical characteristics; and to determine if these subgroups differed on quality of life (QOL) outcomes. Methods Demographic, clinical, and symptom data from one Australian and two U.S. studies were combined. Latent class analysis (LCA) was used to identify patient subgroups with distinct symptom experiences based on self-report data on symptom occurrence using the Memorial Symptom Assessment Scale (MSAS). Results Four distinct latent classes were identified (i.e., All Low (28.0%), Moderate Physical and Lower Psych (26.3%), Moderate Physical and Higher Psych (25.4%), All High (20.3%)). Age, gender, education, cancer diagnosis, and presence of metastatic disease differentiated among the latent classes. Patients in the All High class had the worst QOL scores. Conclusion Findings from this study confirm the large amount of interindividual variability in the symptom experience of oncology patients. The identification of demographic and clinical characteristics that place patients are risk for a higher symptom burden can be used to guide more aggressive and individualized symptom management interventions.

The Threshold Learning Outcome on self-management for the Bachelor of Laws degree : a proposed focus for teaching strategies in the first year law curriculum

The Australian Learning and Teaching Council (ALTC) Discipline Scholars for Law, Professors Sally Kift and Mark Israel, articulated six Threshold Learning Outcomes (TLOs) for the Bachelor of Laws degree as part of the ALTC’s 2010 project on Learning and Teaching Academic Standards. One of these TLOs promotes the learning, teaching and assessment of self-management skills in Australian law schools. This paper explores the concept of self-management and how it can be relevantly applied in the first year of legal education. Recent literature from the United States (US) and Australia provides insights into the types of issues facing law students, as well as potential antidotes to these problems. Based on these findings, I argue that designing a pedagogical framework for the first year law curriculum that promotes students’ connection with their intrinsic interests, values, motivations and purposes will facilitate student success in terms of their personal well-being, ethical dispositions and academic engagement.

Supervised latent dirichlet allocation models for efficient activity representation

Local spatio-temporal features with a Bag-of-visual words model is a popular approach used in human action recognition. Bag-of-features methods suffer from several challenges such as extracting appropriate appearance and motion features from videos, converting extracted features appropriate for classification and designing a suitable classification framework. In this paper we address the problem of efficiently representing the extracted features for classification to improve the overall performance. We introduce two generative supervised topic models, maximum entropy discrimination LDA (MedLDA) and class- specific simplex LDA (css-LDA), to encode the raw features suitable for discriminative SVM based classification. Unsupervised LDA models disconnect topic discovery from the classification task, hence yield poor results compared to the baseline Bag-of-words framework. On the other hand supervised LDA techniques learn the topic structure by considering the class labels and improve the recognition accuracy significantly. MedLDA maximizes likelihood and within class margins using max-margin techniques and yields a sparse highly discriminative topic structure; while in css-LDA separate class specific topics are learned instead of common set of topics across the entire dataset. In our representation first topics are learned and then each video is represented as a topic proportion vector, i.e. it can be comparable to a histogram of topics. Finally SVM classification is done on the learned topic proportion vector. We demonstrate the efficiency of the above two representation techniques through the experiments carried out in two popular datasets. Experimental results demonstrate significantly improved performance compared to the baseline Bag-of-features framework which uses kmeans to construct histogram of words from the feature vectors.

Incremental and inevitable: Contextualising the Threshold Learning Outcomes for law

This article situates the development of the Threshold Learning Outcomes for law in relation to broader national and international trends in legal education and higher education regulation. It also addresses the significance of recent changes to the Australian higher education regulatory landscape catalysed by the current Government's commitment to reducing regulation and red tape for the sector.

Cooperative choice and its framing effect under threshold uncertainty in a provision point mechanism

This paper explores how threshold uncertainty affects cooperative behaviors in the provision of public goods and the prevention of public bads. The following facts motivate our study. First, environmental (resource) problems are either framed as public bads prevention or public goods provision. Second, the occurrence of these problems is characterized by thresholds that are interchangeably represented as "nonconvexity," "bifurcation," "bi-stability," or "catastrophes." Third, the threshold location is mostly unknown. We employ a provision point mechanism with threshold uncertainty and analyze the responses of cooperative behaviors to uncertainty and to the framing for each type of social preferences categorized by a value orientation test. We find that aggregate framing effects are negligible, although the response to the frame is the opposite depending on the type of social preferences. "Cooperative" subjects become more cooperative in negative frames than in positive frames, whereas "individualistic" subjects are less cooperative in negative frames than in positive ones. This finding implies that the insignificance of aggregate framing effects arises from behavioral asymmetry. We also find that the percentage of cooperative choices non-monotonically varies with the degree of threshold uncertainty, irrespective of framing and value orientation. Specifically, the degree of cooperation is highest at intermediate levels of threshold uncertainty and decreases as the uncertainty becomes sufficiently large.

High threshold of β1 integrin inhibition required to block collagen I-induced membrane type-1 matrix metalloproteinase (MT1-MMP) activation of matrix metalloproteinase 2 (MMP-2)

Background Matrix metalloproteinase-2 (MMP-2) is an endopeptidase that facilitates extracellular matrix remodeling and molecular regulation, and is implicated in tumor metastasis. Type I collagen (Col I) regulates the activation of MMP-2 through both transcriptional and post-transcriptional means; however gaps remain in our understanding of the involvement of collagen-binding ?1 integrins in collagen-stimulated MMP-2 activation. Methods Three ?1 integrin siRNAs were used to elucidate the involvement of ?1 integrins in the Col I-induced MMP-2 activation mechanism. ?1 integrin knockdown was analyzed by quantitative RT-PCR, Western Blot and FACS analysis. Adhesion assay and collagen gel contraction were used to test the biological effects of ?1 integrin abrogation. MMP-2 activation levels were monitored by gelatin zymography. Results All three ?1 integrin siRNAs were efficient at ?1 integrin knockdown and FACS analysis revealed commensurate reductions of integrins ?2 and ?3, which are heterodimeric partners of ?1, but not ?V, which is not. All three ?1 integrin siRNAs inhibited adhesion and collagen gel contraction, however only the siRNA showing the greatest magnitude of ?1 knockdown inhibited Col I-induced MMP-2 activation and reduced the accompanying upregulation of MT1-MMP, suggesting a dose response threshold effect. Re-transfection with codon-swapped ?1 integrin overcame the reduction in MMP-2 activation induced by Col-1, confirming the ?1 integrin target specificity. MMP-2 activation induced by TPA or Concanavalin A (Con A) was not inhibited by ?1 integrin siRNA knockdown. Conclusion Together, the data reveals that strong abrogation of ?1 integrin is required to block MMP-2 activation induced by Col I, which may have implications for the therapeutic targeting of ?1 integrin.