Peer-led diabetes self-management programme for community-dwelling older people in China : study protocol for a quasi-experimental design

Aim. A protocol for a new peer-led self-management programme for communitydwelling older people with diabetes in Shanghai, China. Background. The increasing prevalence of type 2 diabetes poses major public health challenges. Appropriate education programmes could help people with diabetes to achieve self-management and better health outcomes. Providing education programmes to the fast growing number of people with diabetes present a real challenge to Chinese healthcare system, which is strained for personnel and funding shortages. Empirical literature and expert opinions suggest that peer education programmes are promising. Design. Quasi-experimental. Methods. This study is a non-equivalent control group design (protocol approved in January, 2008). A total of 190 people, with 95 participants in each group, will be recruited from two different, but similar, communities. The programme, based on Social Cognitive Theory, will consist of basic diabetes instruction and social support and self-efficacy enhancing group activities. Basic diabetes instruction sessions will be delivered by health professionals, whereas social support and self-efficacy enhancing group activities will be led by peer leaders. Outcome variables include: self-efficacy, social support, self-management behaviours, depressive status, quality of life and healthcare utilization, which will be measured at baseline, 4 and 12 weeks. Discussion. This theory-based programme tailored to Chinese patients has potential for improving diabetes self-management and subsequent health outcomes. In addition, the delivery mode, through involvement of peer leaders and existing community networks,is especially promising considering healthcare resource shortage in China.

Study protocol : Screening and treatment of alcohol-related trauma (START): a randomised controlled trial

Background: The incidence of mandibular fractures in the Northern Territory of Australia is very high, especially among Indigenous people. Alcohol intoxication is implicated in the majority of facial injuries, and substance use is therefore an important target for secondary prevention. The current study tests the efficacy of a brief therapy, Motivational Care Planning, in improving wellbeing and substance misuse in youth and adults hospitalised with alcohol-related facial trauma. Methods and design: The study is a randomised controlled trial with 6 months of follow-up, to examine the effectiveness of a brief and culturally adapted intervention in improving outcomes for trauma patients with at-risk drinking admitted to the Royal Darwin Hospital maxillofacial surgery unit. Potential participants are identified using AUDIT-C questionnaire. Eligible participants are randomised to either Motivational Care Planning (MCP) or Treatment as Usual (TAU). The outcome measures will include quantity and frequency of alcohol and other substance use by Timeline Followback. The recruitment target is 154 participants, which with 20% dropout, is hoped to provide 124 people receiving treatment and follow-up. Discussion: This project introduces screening and brief interventions for high-risk drinkers admitted to the hospital with facial trauma. It introduces a practical approach to integrating brief interventions in the hospital setting, and has potential to demonstrate significant benefits for at-risk drinkers with facial trauma.

A reliable real-time transport protocol for control systems over wireless networks

Deploying networked control systems (NCSs) over wireless networks is becoming more and more popular. However, the widely-used transport layer protocols, Transmission Control Protocol (TCP) and User Datagram Protocol (UDP), are not designed for real-time applications. Therefore, they may not be suitable for many NCS application scenarios because of their limitations on reliability and/or delay performance, which real-control systems concern. Considering a typical type of NCSs with periodic and sporadic real-time traffic, this paper proposes a highly reliable transport layer protocol featuring a packet loss-sensitive retransmission mechanism and a prioritized transmission mechanism. The packet loss-sensitive retransmission mechanism is designed to improve the reliability of all traffic flows. And the prioritized transmission mechanism offers differentiated services for periodic and sporadic flows. Simulation results show that the proposed protocol has better reliability than UDP and improved delay performance than TCP over wireless networks, particularly when channel errors and congestions occur.

Interventions for preventing abuse in the elderly (protocol)

This is the protocol for a review and there is no abstract. The objectives are as follows:The primary objective of the review is to assess the effectiveness of primary, secondary and tertiary intervention programmes utilised to reduce or prevent, or both, elderly abuse in organisational, institutional and community settings. We will also identify and report on adverse consequences or effects of the intervention/s in the review.The secondary objective is to investigate whether intervention?s effects are modified by types of abuse, types of participants, setting of intervention or cognitive status of the elderly.

Family-based programmes for preventing smoking by children and adolescents (Protocol)

This is the protocol for a review and there is no abstract. The objectives are as follows: To assess the effectiveness of interventions to help family members strengthen non-smoking attitudes and promote non-smoking by children and other family members by identifying and assessing RCT's that provide training, skills and support to family members to prevent smoking initiation. Hypothesis: This is an exploratory review, and only one hypothesis based on the literature review will be tested: "Interventions to help family members strengthen non-smoking attitudes and promote non-smoking by children and other family members are more effective in preventing children starting smoking than no intervention."

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.

Kerberos based security system for session initiation protocol

Session Initiation Protocol (SIP) is developed to provide advanced voice services over IP networks. SIP unites telephony and data world, permitting telephone calls to be transmitted over Intranets and Internet. Increase in network performance and new mechanisms for guaranteed quality of service encourage this consolidation to provide toll cost savings. Security comes up as one of the most important issues when voice communication and critical voice applications are considered. Not only the security methods provided by traditional telephony systems, but also additional methods are required to overcome security risks introduced by the public IP networks. SIP considers security problems of such a consolidation and provides a security framework. There are several security methods defined within SIP specifications and extensions. But, suggested methods can not solve all the security problems of SIP systems with various system requirements. In this thesis, a Kerberos based solution is proposed for SIP security problems, including SIP authentication and privacy. The proposed solution tries to establish flexible and scalable SIP system that will provide desired level of security for voice communications and critical telephony applications.

Complexity of increasing the secure connectivity in wireless ad hoc networks

We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. 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 shared 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 extends the first problem by 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 prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem.

Changes in Knee Biomechanics After a Hip-Abductor Strengthening Protocol for Runners With Patellofemoral Pain Syndrome

Context: Very few authors have investigated the relationship between hip-abductor muscle strength and frontal-plane knee mechanics during running. Objective: To investigate this relationship using a 3-week hip-abductor muscle-strengthening program to identify changes in strength, pain, and biomechanics in runners with patellofemoral pain syndrome (PFPS). Design: Cohort study. Setting: University-based clinical research laboratory. Patients or Other Participants: Fifteen individuals (5 men, 10 women) with PFPS and 10 individuals without PFPS (4 men, 6 women) participated. Intervention(s): The patients with PFPS completed a 3-week hip-abductor strengthening protocol; control participants did not. Main Outcome Measure(s): The dependent variables of interest were maximal isometric hip-abductor muscle strength, 2-dimensional peak knee genu valgum angle, and stride-to-stride knee-joint variability. All measures were recorded at baseline and 3 weeks later. Between-groups differences were compared using repeated-measures analyses of variance. Results: At baseline, the PFPS group exhibited reduced strength, no difference in peak genu valgum angle, and increased stride-to-stride knee-joint variability compared with the control group. After the 3-week protocol, the PFPS group demonstrated increased strength, less pain, no change in peak genu valgum angle, and reduced stride-to-stride knee-joint variability compared with baseline. Conclusions: A 3-week hip-abductor muscle-strengthening protocol was effective in increasing muscle strength and decreasing pain and stride-to-stride knee-joint variability in individuals with PFPS. However, concomitant changes in peak knee genu valgum angle were not observed.

The relationship between hip abductor muscle strength and magnitude of pelvic drop following a 3 week strengthening protocol in non-specific low back pain patients.

Purpose: To examine the relationship between hip abductor muscle (HABD) strength and the magnitude of pelvic drop (MPD) for patients with non-specific low back pain (NSLBP) and controls (CON) prior to and following a 3-week HABD strengthening protocol. At baseline, we hypothesized that NSLBP patients would exhibit reduced HABD strength and greater MPD compared to CON. Following the protocol, we hypothesized that strength would increase and MPD would decrease. Relevance: The Trendelenburg test (TT) is a common clinical test used to examine the ability of the HABD to maintain horizontal pelvic position during single limb stance. However, no study has specifically tested this theory. Moreover, no study has investigated the relationship between HABD strength and pelvic motion during walking or tested whether increased HABD strength would reduce the MPD. Methods: Quasi-experimental with 3-week exercise intervention. Fifteen NSLBP patients (32.5yrs,range 21-51yrs; VAS baseline: 5.3cm) and 10 CON (29.5yrs,range 22-47yrs) were recruited. Isometric HABD strength was measured using a force dynamometer and the average of three maximal voluntary contractions were normalized to body mass (N/kg). Two-dimensional MPD (degrees) was measured using a 60 Hz camera and was derived from two retroreflective-markers placed on the posterior superior iliac spines. MPD was measured while performing the static TT and while walking and averaged over 10 consecutive footfalls. NSLBP patients completed a 3-week HABD strengthening protocol consisting of 2 open-kinetic-chain exercises then all measures were repeated. Non-parametric analysis was used for group comparisons and correlation analysis. Results: At baseline, the NSLBP patients demonstrated 31% reduced HABD strength (mean=6.6 N/kg) compared to CON (mean=9.5 N/kg: p=0.03) and no significant differences in maximal pelvic frontal plane excursion while walking (NSLBP:mean=8.1°, CON:mean=7.1°: p=0.72). No significant correlations were measured between left HABD strength and right MPD (r=-0.37, p=0.11), or between right HABD strength and left MPD (r=-0.04, p=0.84) while performing the static TT. Following the 3-week strengthening protocol, NSLBP patients demonstrated a 12% improvement in strength (Post:mean=7.4 N/kg: p=0.02), a reduction in pain (VAS followup: 2.8cm), but no significant decreases in MPD while walking (p=0.92). Conclusions: NSLBP patients demonstrated reduced HABD strength at baseline and were able to increase strength and reduce pain in a 3-week period. However, despite increases in HABD strength, the NSLBP group exhibited similar MPD motion during the static TT and while walking compared to baseline and controls. Implications: The results suggest that the HABD alone may not be primarily responsible for controlling a horizontal pelvic position during static and dynamic conditions. Increasing the strength of the hip abductors resulted in a reduction of pain in NSLBP patients providing evidence for further research to identify specific musculature responsible for controlling pelvic motion.

A reliable real-time transport protocol for networked control systems over wireless networks

Deploying wireless networks in networked control systems (NCSs) has become more and more popular during the last few years. As a typical type of real-time control systems, an NCS is sensitive to long and nondeterministic time delay and packet losses. However, the nature of the wireless channel has the potential to degrade the performance of NCS networks in many aspects, particularly in time delay and packet losses. Transport layer protocols could play an important role in providing both reliable and fast transmission service to fulfill NCS’s real-time transmission requirements. Unfortunately, none of the existing transport protocols, including the Transport Control Protocol (TCP) and the User Datagram Protocol (UDP), was designed for real-time control applications. Moreover, periodic data and sporadic data are two types of real-time data traffic with different priorities in an NCS. Due to the lack of support for prioritized transmission service, the real-time performance for periodic and sporadic data in an NCS network is often degraded significantly, particularly under congested network conditions. To address these problems, a new transport layer protocol called Reliable Real-Time Transport Protocol (RRTTP) is proposed in this thesis. As a UDP-based protocol, RRTTP inherits UDP’s simplicity and fast transmission features. To improve the reliability, a retransmission and an acknowledgement mechanism are designed in RRTTP to compensate for packet losses. They are able to avoid unnecessary retransmission of the out-of-date packets in NCSs, and collisions are unlikely to happen, and small transmission delay can be achieved. Moreover, a prioritized transmission mechanism is also designed in RRTTP to improve the real-time performance of NCS networks under congested traffic conditions. Furthermore, the proposed RRTTP is implemented in the Network Simulator 2 for comprehensive simulations. The simulation results demonstrate that RRTTP outperforms TCP and UDP in terms of real-time transmissions in an NCS over wireless networks.

The effect of testing protocol on immature bovine thoracic spine segment stiffness

Introduction. In vitro spine biomechanical testing has been central to many advances in understanding the physiology and pathology of the human spine. Owing to the difficulty in obtaining sufficient numbers of human samples to conduct these studies, animal spines have been accepted as a substitute model. However, it is difficult to compare results from different studies, as they use different preparation, testing and data collection methods. The aim of this study was to identify the effect of repeated cyclic loading on bovine spine segment stiffness. It also aimed to quantify the effect of multiple freeze-thaw sequences, as many tests would be difficult to complete in a single session [1-3]. Materials and Methods. Thoracic spines from 6-8 week old calves were used. Each spine was dissected and divided into motion segments including levels T4-T11 (n=28). These were divided into two equal groups. Each segment was potted in polymethylemethacrylate. An Instron Biaxial materials testing machine with a custom made jig was used for testing. The segments were tested in flexion/extension, lateral bending and axial rotation at 37 degrees C and 100% humidity, using moment control to a maximum plus/minus 1.75 Nm with a loading rate of 0.3 Nm per second. Group (A) were tested with continuous repeated cyclic loading for 500 cycles with data recorded at cycles 3, 5, 10, 25, 100, 200, 300, 400 and 500. Group (B) were tested with 10 load cycles after each of 5 freeze thaw sequences. Data was collected from the tenth load cycle after each sequence. Statistical analysis of the data was performed using paired samples t-tests, ANOVA and generalized estimating equations. Results. The data were confirmed as having a normal distribution. 1. There were significant reductions in mean stiffness in flexion/extension (-20%; P=0.001) and lateral bending (-17%; P=0.009) over the 500 load cycles. However, there was no statistically significant change in axial rotation (P=0.152) 2. There was no statistically significant difference between mean stiffness over the five freeze-thaw sequences in flexion/extension (p=0.879) and axial rotation (p=0.07). However, there was a significant reduction in stiffness in lateral bending (-26%; p=0.007) Conclusion. Biomechanical testing of immature bovine spine motion segments requires careful interpretation. The effect of the number of load cycles as well as the number of freeze-thaw cycles on the stiffness of the motion segments depends on the axis of main movement.

Cryptographic techniques for managing computational effort

Availability has become a primary goal of information security and is as significant as other goals, in particular, confidentiality and integrity. Maintaining availability of essential services on the public Internet is an increasingly difficult task in the presence of sophisticated attackers. Attackers may abuse limited computational resources of a service provider and thus managing computational costs is a key strategy for achieving the goal of availability. In this thesis we focus on cryptographic approaches for managing computational costs, in particular computational effort. We focus on two cryptographic techniques: computational puzzles in cryptographic protocols and secure outsourcing of cryptographic computations. This thesis contributes to the area of cryptographic protocols in the following ways. First we propose the most efficient puzzle scheme based on modular exponentiations which, unlike previous schemes of the same type, involves only a few modular multiplications for solution verification; our scheme is provably secure. We then introduce a new efficient gradual authentication protocol by integrating a puzzle into a specific signature scheme. Our software implementation results for the new authentication protocol show that our approach is more efficient and effective than the traditional RSA signature-based one and improves the DoSresilience of Secure Socket Layer (SSL) protocol, the most widely used security protocol on the Internet. Our next contributions are related to capturing a specific property that enables secure outsourcing of cryptographic tasks in partial-decryption. We formally define the property of (non-trivial) public verifiability for general encryption schemes, key encapsulation mechanisms (KEMs), and hybrid encryption schemes, encompassing public-key, identity-based, and tag-based encryption avors. We show that some generic transformations and concrete constructions enjoy this property and then present a new public-key encryption (PKE) scheme having this property and proof of security under the standard assumptions. Finally, we combine puzzles with PKE schemes for enabling delayed decryption in applications such as e-auctions and e-voting. For this we first introduce the notion of effort-release PKE (ER-PKE), encompassing the well-known timedrelease encryption and encapsulated key escrow techniques. We then present a security model for ER-PKE and a generic construction of ER-PKE complying with our security notion.

Modelling client puzzles and denial-of-service resistant protocols

Denial-of-service (DoS) attacks are a growing concern to networked services like the Internet. In recent years, major Internet e-commerce and government sites have been disabled due to various DoS attacks. A common form of DoS attack is a resource depletion attack, in which an attacker tries to overload the server's resources, such as memory or computational power, rendering the server unable to service honest clients. A promising way to deal with this problem is for a defending server to identify and segregate malicious traffic as earlier as possible. Client puzzles, also known as proofs of work, have been shown to be a promising tool to thwart DoS attacks in network protocols, particularly in authentication protocols. In this thesis, we design efficient client puzzles and propose a stronger security model to analyse client puzzles. We revisit a few key establishment protocols to analyse their DoS resilient properties and strengthen them using existing and novel techniques. Our contributions in the thesis are manifold. We propose an efficient client puzzle that enjoys its security in the standard model under new computational assumptions. Assuming the presence of powerful DoS attackers, we find a weakness in the most recent security model proposed to analyse client puzzles and this study leads us to introduce a better security model for analysing client puzzles. We demonstrate the utility of our new security definitions by including two hash based stronger client puzzles. We also show that using stronger client puzzles any protocol can be converted into a provably secure DoS resilient key exchange protocol. In other contributions, we analyse DoS resilient properties of network protocols such as Just Fast Keying (JFK) and Transport Layer Security (TLS). In the JFK protocol, we identify a new DoS attack by applying Meadows' cost based framework to analyse DoS resilient properties. We also prove that the original security claim of JFK does not hold. Then we combine an existing technique to reduce the server cost and prove that the new variant of JFK achieves perfect forward secrecy (the property not achieved by original JFK protocol) and secure under the original security assumptions of JFK. Finally, we introduce a novel cost shifting technique which reduces the computation cost of the server significantly and employ the technique in the most important network protocol, TLS, to analyse the security of the resultant protocol. We also observe that the cost shifting technique can be incorporated in any Diffine{Hellman based key exchange protocol to reduce the Diffie{Hellman exponential cost of a party by one multiplication and one addition.

On the security of TLS renegotiation

The Transport Layer Security (TLS) protocol is the most widely used security protocol on the Internet. It supports negotiation of a wide variety of cryptographic primitives through different cipher suites, various modes of client authentication, and additional features such as renegotiation. Despite its widespread use, only recently has the full TLS protocol been proven secure, and only the core cryptographic protocol with no additional features. These additional features have been the cause of several practical attacks on TLS. In 2009, Ray and Dispensa demonstrated how TLS renegotiation allows an attacker to splice together its own session with that of a victim, resulting in a man-in-the-middle attack on TLS-reliant applications such as HTTP. TLS was subsequently patched with two defence mechanisms for protection against this attack. We present the first formal treatment of renegotiation in secure channel establishment protocols. We add optional renegotiation to the authenticated and confidential channel establishment model of Jager et al., an adaptation of the Bellare--Rogaway authenticated key exchange model. We describe the attack of Ray and Dispensa on TLS within our model. We show generically that the proposed fixes for TLS offer good protection against renegotiation attacks, and give a simple new countermeasure that provides renegotiation security for TLS even in the face of stronger adversaries.