Extreme temperatures and paediatric emergency department admissions

Background Children are particularly vulnerable to the effects of extreme temperatures. Objective To examine the relationship between extreme temperatures and paediatric emergency department admissions (EDAs) in Brisbane, Australia, during 2003–2009. Methods A quasi-Poisson generalised linear model combined with a distributed lag non-linear model was used to examine the relationships between extreme temperatures and age-, gender- and cause-specific paediatric EDAs, while controlling for air pollution, relative humidity, day of the week, influenza epidemics, public holiday, season and long-term trends. The model residuals were checked to identify whether there was an added effect due to heat waves or cold spells. Results There were 131 249 EDAs among children during the study period. Both high (RR=1.27; 95% CI 1.12 to 1.44) and low (RR=1.81; 95% CI 1.66 to 1.97) temperatures were significantly associated with an increase in paediatric EDAs in Brisbane. Male children were more vulnerable to temperature effects. Children aged 0–4 years were more vulnerable to heat effects and children aged 10–14 years were more sensitive to both hot and cold effects. High temperatures had a significant impact on several paediatric diseases, including intestinal infectious diseases, respiratory diseases, endocrine, nutritional and metabolic diseases, nervous system diseases and chronic lower respiratory diseases. Low temperatures were significantly associated with intestinal infectious diseases, respiratory diseases and endocrine, nutritional and metabolic diseases. An added effect of heat waves on childhood chronic lower respiratory diseases was seen, but no added effect of cold spells was found. Conclusions As climate change continues, children are at particular risk of a variety of diseases which might be triggered by extremely high temperatures. This study suggests that preventing the effects of extreme temperature on children with respiratory diseases might reduce the number of EDAs.

Sub-modelling for the ratchetting failure of insulated rail joints

Insulated rail joints are critical for train safety as they control electrical signalling systems; unfortunately they exhibit excessive ratchetting of the railhead near the endpost insulators. This paper reports a three-dimensional global model of these joints under wheel–rail contact pressure loading and a sub-model examining the ratchetting failures of the railhead. The sub-model employs a non-linear isotropic–kinematic elastic–plastic material model and predicts stress/strain levels in the localised railhead zone adjacent to the endpost which is placed in the air gap between the two rail ends at the insulated rail joint. The equivalent plastic strain plot is utilised to capture the progressive railhead damage adequately. Associated field and laboratory testing results of damage to the railhead material suggest that the simulation results are reasonable.

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.

Security evaluation of Rakaposhi Stream Cipher

Rakaposhi is a synchronous stream cipher, which uses three main components: a non-linear feedback shift register (NLFSR), a dynamic linear feedback shift register (DLFSR) and a non-linear filtering function (NLF). NLFSR consists of 128 bits and is initialised by the secret key K. DLFSR holds 192 bits and is initialised by an initial vector (IV). NLF takes 8-bit inputs and returns a single output bit. The work identifies weaknesses and properties of the cipher. The main observation is that the initialisation procedure has the so-called sliding property. The property can be used to launch distinguishing and key recovery attacks. The distinguisher needs four observations of the related (K,IV) pairs. The key recovery algorithm allows to discover the secret key K after observing 29 pairs of (K,IV). Based on the proposed related-key attack, the number of related (K,IV) pairs is 2(128 + 192)/4 pairs. Further the cipher is studied when the registers enter short cycles. When NLFSR is set to all ones, then the cipher degenerates to a linear feedback shift register with a non-linear filter. Consequently, the initial state (and Secret Key and IV) can be recovered with complexity 263.87. If DLFSR is set to all zeros, then NLF reduces to a low non-linearity filter function. As the result, the cipher is insecure allowing the adversary to distinguish it from a random cipher after 217 observations of keystream bits. There is also the key recovery algorithm that allows to find the secret key with complexity 2 54.