The human tissue kallikrein and kallikrein-related peptidase family

The human kallikrein-related peptidases are a subgroup of trypsin and chymotrypsin-like serine peptidases that are characterized by their homology to tissue kallikrein or kallikrein 1 (KLK1) encoded by the KLK1 gene (reviewed in[1-4]). The human KLK locus spans an approximately 320 kb region on chromosome 19q13.3-13.4 and contains fifteen genes encoding KLK1 and fourteen other kallikrein-related peptidases, KLK2-KLK15, which have been named contiguously in the locus in the order of their discovery [5-8] (Figure 606.1). It is the largest contiguous cluster of serine protease encoding genes in the human genome which has evolved from gene duplication of KLK1 and then subsequent reduplication of the newly evolved KLK genes [2]. The high conservation noted for KLK1-KLK3 (62-77%) reflects the proposed duplication of the KLK1 gene that produced the KLK2 gene which further generated the KLK3 gene. In contrast, the newer KLK4-KLK15 proteases share much less similarity, from 24-66%, although strong homology between KLK4 and KLK5, KLK9 and KLK11, and KLK10 and KLK12 suggests these genes are duplications of each other [2]...

Time-aware topic recommendation based on micro-blogs

Topic recommendation can help users deal with the information overload issue in micro-blogging communities. This paper proposes to use the implicit information network formed by the multiple relationships among users, topics and micro-blogs, and the temporal information of micro-blogs to find semantically and temporally relevant topics of each topic, and to profile users' time-drifting topic interests. The Content based, Nearest Neighborhood based and Matrix Factorization models are used to make personalized recommendations. The effectiveness of the proposed approaches is demonstrated in the experiments conducted on a real world dataset that collected from Twitter.com.

How activation, entanglement, and searching a semantic network contribute to event memory

Free association norms indicate that words are organized into semantic/associative neighborhoods within a larger network of words and links that bind the net together. We present evidence indicating that memory for a recent word event can depend on implicitly and simultaneously activating related words in its neighborhood. Processing a word during encoding primes its network representation as a function of the density of the links in its neighborhood. Such priming increases recall and recognition and can have long lasting effects when the word is processed in working memory. Evidence for this phenomenon is reviewed in extralist cuing, primed free association, intralist cuing, and single-item recognition tasks. The findings also show that when a related word is presented to cue the recall of a studied word, the cue activates it in an array of related words that distract and reduce the probability of its selection. The activation of the semantic network produces priming benefits during encoding and search costs during retrieval. In extralist cuing recall is a negative function of cue-to-distracter strength and a positive function of neighborhood density, cue-to-target strength, and target-to cue strength. We show how four measures derived from the network can be combined and used to predict memory performance. These measures play different roles in different tasks indicating that the contribution of the semantic network varies with the context provided by the task. We evaluate spreading activation and quantum-like entanglement explanations for the priming effect produced by neighborhood density.

Neighbourhood disadvantage, individual-level socioeconomic position, and self-reported chronic arthritis : a cross-sectional multilevel study

Objective: To examine the association between individual- and neighborhood-level disadvantage and self-reported arthritis. Methods: We used data from a population-based cross-sectional study conducted in 2007 among 10,757 men and women ages 40–65 years, selected from 200 neighborhoods in Brisbane, Queensland, Australia using a stratified 2-stage cluster design. Data were collected using a mail survey (68.5% response). Neighborhood disadvantage was measured using a census-based composite index, and individual disadvantage was measured using self-reported education, household income, and occupation. Arthritis was indicated by self-report. Data were analyzed using multilevel modeling. Results: The overall rate of self-reported arthritis was 23% (95% confidence interval [95% CI] 22–24). After adjustment for sociodemographic factors, arthritis prevalence was greatest for women (odds ratio [OR] 1.5, 95% CI 1.4–1.7) and in those ages 60–65 years (OR 4.4, 95% CI 3.7–5.2), those with a diploma/associate diploma (OR 1.3, 95% CI 1.1–1.6), those who were permanently unable to work (OR 4.0, 95% CI 3.1–5.3), and those with a household income <$25,999 (OR 2.1, 95% CI 1.7–2.6). Independent of individual-level factors, residents of the most disadvantaged neighborhoods were 42% (OR 1.4, 95% CI 1.2–1.7) more likely than those in the least disadvantaged neighborhoods to self-report arthritis. Cross-level interactions between neighborhood disadvantage and education, occupation, and household income were not significant. Conclusion: Arthritis prevalence is greater in more socially disadvantaged neighborhoods. These are the first multilevel data to examine the relationship between individual- and neighborhood-level disadvantage upon arthritis and have important implications for policy, health promotion, and other intervention strategies designed to reduce the rates of arthritis, indicating that intervention efforts may need to focus on both people and places.

An Android application sandbox system for suspicious software detection

Smartphones are steadily gaining popularity, creating new application areas as their capabilities increase in terms of computational power, sensors and communication. Emerging new features of mobile devices give opportunity to new threats. Android is one of the newer operating systems targeting smartphones. While being based on a Linux kernel, Android has unique properties and specific limitations due to its mobile nature. This makes it harder to detect and react upon malware attacks if using conventional techniques. In this paper, we propose an Android Application Sandbox (AASandbox) which is able to perform both static and dynamic analysis on Android programs to automatically detect suspicious applications. Static analysis scans the software for malicious patterns without installing it. Dynamic analysis executes the application in a fully isolated environment, i.e. sandbox, which intervenes and logs low-level interactions with the system for further analysis. Both the sandbox and the detection algorithms can be deployed in the cloud, providing a fast and distributed detection of suspicious software in a mobile software store akin to Google's Android Market. Additionally, AASandbox might be used to improve the efficiency of classical anti-virus applications available for the Android operating system.

Near Infrared Spectroscopy Evaluation of Articular Cartilage : Decision-Making in Arthroplasty : Real-Time Assessment of Articular Cartilage

Current diagnostic methods for assessing the severity of articular cartilage degenerative conditions, such as osteoarthritis, are inadequate. There is also a lack of techniques that can be used for real-time evaluation of the tissue during surgery to inform treatment decision and eliminate subjectivity. This book, derived from Dr Afara’s doctoral research, presents a scientific framework that is based on near infrared (NIR) spectroscopy for facilitating the non-destructive evaluation of articular cartilage health relative to its structural, functional, and mechanical properties. This development is a component of the ongoing research on advanced endoscopic diagnostic techniques in the Articular Cartilage Biomechanics Research Laboratory of Professor Adekunle Oloyede at Queensland University of Technology (QUT), Brisbane Australia.

Optimally increasing secure connectivity in multihop wireless ad hoc networks

We consider the problem of how to maximize secure connectivity of multi-hop wireless ad hoc networks after deployment. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by secret keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one is based of increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We show that both problems are NP-hard and MAX-SNP (i.e., it is NP-hard to approximate them within a factor of 1 + e for e > 0 ) with a reduction to MAX3SAT problem. Thus, we design and implement a fully distributed algorithm for authenticated key establishment in wireless sensor networks where each sensor knows only its one- hop neighborhood. Our witness based approaches find witnesses in multi-hop neighborhood to authenticate the key establishment between two sensor nodes which do not share a key and which are not connected through a secure path.

Civil procedure : commentary and materials (4th ed)

This book provides a comprehensive analysis of the practical and theoretical issues encountered in Australian civil procedure, including alternative dispute resolution. Each chapter features in-depth questions and notes together with lists of further reading to aid understanding of the issue. It also examines and discusses each substantive and procedural step in the trial process. Topics include jurisdiction of a court to consider a matter, alternative dispute resolution, limitations of actions, commencing proceedings, pleading, gathering evidence, trial and appeal, costs and practice directions. Each of the state, territory and federal procedures is covered.

Collaborating to develop research data management services and collections

The Queensland University of Technology (QUT) Library, like many other academic and research institution libraries in Australia, has been collaborating with a range of academic and service provider partners to develop a range of research data management services and collections. Three main strategies are being employed and an overview of process, infrastructure, usage and benefits is provided of each of these service aspects. The development of processes and infrastructure to facilitate the strategic identification and management of QUT developed datasets has been a major focus. A number of Australian National Data Service (ANDS) sponsored projects - including Seeding the Commons; Metadata Hub / Store; Data Capture and Gold Standard Record Exemplars have / will provide QUT with a data registry system, linkages to storage, processes for identifying and describing datasets, and a degree of academic awareness. QUT supports open access and has established a culture for making its research outputs available via the QUT ePrints institutional repository. Incorporating open access research datasets into the library collections is an equally important aspect of facilitating the adoption of data-centric eresearch methods. Some datasets are available commercially, and the library has collaborated with QUT researchers, in the QUT Business School especially strongly, to identify and procure a rapidly growing range of financial datasets to support research. The library undertakes licensing and uses the Library Resource Allocation to pay for the subscriptions. It is a new area of collection development for with much to be learned. The final strategy discussed is the library acting as “data broker”. QUT Library has been working with researchers to identify these datasets and undertake the licensing, payment and access as a centrally supported service on behalf of researchers.