Rapid production of a plasmid DNA encoding a malaria vaccine candidate via amino-functionalized poly(GMA-co-EDMA) monolith

Malaria is a global health problem; an effective vaccine is urgently needed. Due to the relative poverty and lack of infrastructure in malaria endemic areas, DNA-based vaccines that are stable at ambient temperatures and easy to formulate have great potential. While attention has been focused mainly on antigen selection, vector design and efficacy assessment, the development of a rapid and commercially viable process to manufacture DNA is generally overlooked. We report here a continuous purification technique employing an optimized stationary adsorbent to allow high-vaccine recovery, low-processing time, and, hence, high-productivity. A 40.0 mL monolithic stationary phase was synthesized and functionalized with amino groups from 2-Chloro-N,N- diethylethylamine hydrochloride for anion-exchange isolation of a plasmid DNA (pDNA) that encodes a malaria vaccine candidate, VR1020-PyMSP4/5. Physical characterization of the monolithic polymer showed a macroporous material with a modal pore diameter of 750 nm. The final vaccine product isolated after 3 min elution was homogeneous supercoiled plasmid with gDNA, RNA and protein levels in keeping with clinical regulatory standards. Toxicological studies of the pVR1020-PyMSP4/5 showed a minimum endotoxin level of 0.28 EU/m.g pDNA. This cost-effective technique is cGMP compatible and highly scalable for the production of DNA-based vaccines in commercial quantities, when such vaccines prove to be effective against malaria. © 2008 American Institute of Chemical Engineers.

The suffix-free-prefix-free hash function construction and its indifferentiability security analysis

In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed. In addition, these indifferentiability results do not depend on the Merkle–Damgård (MD) strengthening in the padding functionality of the hash functions. We propose a generic n -bit-iterated hash function framework based on an n -bit compression function called suffix-free-prefix-free (SFPF) that works for arbitrary IV s and does not possess MD strengthening. We formally prove that SFPF is indifferentiable from a random oracle (RO) when the compression function is viewed as a fixed input-length random oracle (FIL-RO). We show that some hash function constructions proposed in the literature fit in the SFPF framework while others that do not fit in this framework are not indifferentiable from a RO. We also show that the SFPF hash function framework with the provision of MD strengthening generalizes any n -bit-iterated hash function based on an n -bit compression function and with an n -bit chaining value that is proven indifferentiable from a RO.

EPC: a provably secure permutation based compression function

The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.

Hierarchical deterministic Bitcoin wallets that tolerate key leakage (short paper)

A Bitcoin wallet is a set of private keys known to a user and which allow that user to spend any Bitcoin associated with those keys. In a hierarchical deterministic (HD) wallet, child private keys are generated pseudorandomly from a master private key, and the corresponding child public keys can be generated by anyone with knowledge of the master public key. These wallets have several interesting applications including Internet retail, trustless audit, and a treasurer allocating funds among departments. A specification of HD wallets has even been accepted as Bitcoin standard BIP32. Unfortunately, in all existing HD wallets---including BIP32 wallets---an attacker can easily recover the master private key given the master public key and any child private key. This vulnerability precludes use cases such as a combined treasurer-auditor, and some in the Bitcoin community have suspected that this vulnerability cannot be avoided. We propose a new HD wallet that is not subject to this vulnerability. Our HD wallet can tolerate the leakage of up to m private keys with a master public key size of O(m). We prove that breaking our HD wallet is at least as hard as the so-called "one more" discrete logarithm problem.

Practical attack on NLM-MAC scheme

The NLM stream cipher designed by Hoon Jae Lee, Sang Min Sung, Hyeong Rag Kim is a strengthened version of the LM summation generator that combines linear and non-linear feedback shift registers. In recent works, the NLM cipher has been used for message authentication in lightweight communication over wireless sensor networks and for RFID authentication protocols. The work analyses the security of the NLM stream cipher and the NLM-MAC scheme that is built on the top of the NLM cipher. We first show that the NLM cipher suffers from two major weaknesses that lead to key recovery and forgery attacks. We prove the internal state of the NLM cipher can be recovered with time complexity about nlog7×2, where the total length of internal state is 2⋅n+22⋅n+2 bits. The attack needs about n2n2 key-stream bits. We also show adversary is able to forge any MAC tag very efficiently by having only one pair (MAC tag, ciphertext). The proposed attacks are practical and break the scheme with a negligible error probability.

Combining initial segments of lists

We propose a new way to build a combined list from K base lists, each containing N items. A combined list consists of top segments of various sizes from each base list so that the total size of all top segments equals N. A sequence of item requests is processed and the goal is to minimize the total number of misses. That is, we seek to build a combined list that contains all the frequently requested items. We first consider the special case of disjoint base lists. There, we design an efficient algorithm that computes the best combined list for a given sequence of requests. In addition, we develop a randomized online algorithm whose expected number of misses is close to that of the best combined list chosen in hindsight. We prove lower bounds that show that the expected number of misses of our randomized algorithm is close to the optimum. In the presence of duplicate items, we show that computing the best combined list is NP-hard. We show that our algorithms still apply to a linearized notion of loss in this case. We expect that this new way of aggregating lists will find many ranking applications.

Numerical analysis for the time distributed-order and Riesz space fractional diffusions on bounded domains

Subdiffusion equations with distributed-order fractional derivatives describe some important physical phenomena. In this paper, we consider the time distributed-order and Riesz space fractional diffusions on bounded domains with Dirichlet boundary conditions. Here, the time derivative is defined as the distributed-order fractional derivative in the Caputo sense, and the space derivative is defined as the Riesz fractional derivative. First, we discretize the integral term in the time distributed-order and Riesz space fractional diffusions using numerical approximation. Then the given equation can be written as a multi-term time–space fractional diffusion. Secondly, we propose an implicit difference method for the multi-term time–space fractional diffusion. Thirdly, using mathematical induction, we prove the implicit difference method is unconditionally stable and convergent. Also, the solvability for our method is discussed. Finally, two numerical examples are given to show that the numerical results are in good agreement with our theoretical analysis.

Stability and convergence of a new finite volume method for a two-sided space-fractional diffusion equation

In this paper, we consider a two-sided space-fractional diffusion equation with variable coefficients on a finite domain. Firstly, based on the nodal basis functions, we present a new fractional finite volume method for the two-sided space-fractional diffusion equation and derive the implicit scheme and solve it in matrix form. Secondly, we prove the stability and convergence of the implicit fractional finite volume method and conclude that the method is unconditionally stable and convergent. Finally, some numerical examples are given to show the effectiveness of the new numerical method, and the results are in excellent agreement with theoretical analysis.

A Novel High Order Space-Time Spectral Method for the Time Fractional Fokker--Planck Equation

The fractional Fokker-Planck equation is an important physical model for simulating anomalous diffusions with external forces. Because of the non-local property of the fractional derivative an interesting problem is to explore high accuracy numerical methods for fractional differential equations. In this paper, a space-time spectral method is presented for the numerical solution of the time fractional Fokker-Planck initial-boundary value problem. The proposed method employs the Jacobi polynomials for the temporal discretization and Fourier-like basis functions for the spatial discretization. Due to the diagonalizable trait of the Fourier-like basis functions, this leads to a reduced representation of the inner product in the Galerkin analysis. We prove that the time fractional Fokker-Planck equation attains the same approximation order as the time fractional diffusion equation developed in [23] by using the present method. That indicates an exponential decay may be achieved if the exact solution is sufficiently smooth. Finally, some numerical results are given to demonstrate the high order accuracy and efficiency of the new numerical scheme. The results show that the errors of the numerical solutions obtained by the space-time spectral method decay exponentially.

A Raman and infrared spectroscopic characterisation of the phosphate mineral phosphohedyphane Ca2Pb3(PO4)3Cl from the Roote mine, Nevada, USA

Phosphohedyphane Ca2Pb3(PO4)3Cl is rare Ca and Pb phosphate mineral that belongs to the apatite supergroup. We have analysed phosphohedyphane using SEM with EDX, and Raman and infrared spectroscopy. The chemical analysis shows the presence of Pb, Ca, P and Cl and the chemical formula is expressed as Ca2Pb3(PO4)3Cl. The very sharp Raman band at 975 cm−1 is assigned to the PO43-ν1 symmetric stretching mode. Raman bands noted at 1073, 1188 and 1226 cm−1 are to the attributed to the PO43-ν3 antisymmetric stretching modes. The two Raman bands at 835 and 812 cm−1 assigned to the AsO43-ν1 symmetric stretching vibration and AsO43-ν3 antisymmetric stretching modes prove the substitution of As for P in the structure of phosphohedyphane. A series of bands at 557, 577 and 595 cm−1 are attributed to the ν4 out of plane bending modes of the PO4 units. The multiplicity of bands in the ν2, ν3 and ν4 spectral regions provides evidence for the loss of symmetry of the phosphate anion in the phosphohedyphane structure. Observed bands were assigned to the stretching and bending vibrations of phosphate tetrahedra. Some Raman bands attributable to OH stretching bands were observed, indicating the presence of water and/or OH units in the structure.

Excitation of bound plasmons along nanoscale stripe waveguides: A comparison of end and grating coupling techniques

In this paper we excite bound long range stripe plasmon modes with a highly focused laser beam. We demonstrate highly confined plasmons propagating along a 50 μm long silver stripe 750 nm wide and 30 nm thick. Two excitation techniques were studied: focusing the laser spot onto the waveguide end and focusing the laser spot onto a silver grating. By comparing the intensity of the out-coupling photons at the end of the stripe for both grating and end excitation we are able to show that gratings provide an increase of a factor of two in the output intensity and thus out-coupling of plasmons excited by this technique are easier to detect. Authors expect that the outcome of this paper will prove beneficial for the development of passive nano-optical devices based on stripe waveguides, by providing insight into the different excitation techniques available and the advantages of each technique.

Integrated reporting and directors’ concerns about personal liability exposure: Law reform options

Integrated reporting () holds significant promise as a new reporting paradigm that is holistic, strategic, responsive, material, and relevant across multiple time frames. However, its uptake in Australia is being hampered by directors’ concerns about personal liability exposure, particularly for forward-looking statements that subsequently prove to be unfounded. This article seeks to illuminate the bases for these liability concerns by outlining the similarities between and the operating and financial review requirements under the Corporations Act 2001 (Cth), and the relevant grounds for liability for misleading and deceptive disclosures, and breach of directors’ duties. In light of this discussion, this article proposes four possible reform options, ranging from minor adaptations to the Framework to far-reaching reforms of the Corporations Act. As assurance is desirable to ensure that reliance can be placed on integrated reports, the development of a legal safe harbour for auditors of forward-looking information is also canvassed.

Using decision trees to understand structure in missing data

Objectives Demonstrate the application of decision trees – classification and regression trees (CARTs), and their cousins, boosted regression trees (BRTs) – to understand structure in missing data. Setting Data taken from employees at three different industry sites in Australia. Participants 7915 observations were included. Materials and Methods The approach was evaluated using an occupational health dataset comprising results of questionnaires, medical tests, and environmental monitoring. Statistical methods included standard statistical tests and the ‘rpart’ and ‘gbm’ packages for CART and BRT analyses, respectively, from the statistical software ‘R’. A simulation study was conducted to explore the capability of decision tree models in describing data with missingness artificially introduced. Results CART and BRT models were effective in highlighting a missingness structure in the data, related to the Type of data (medical or environmental), the site in which it was collected, the number of visits and the presence of extreme values. The simulation study revealed that CART models were able to identify variables and values responsible for inducing missingness. There was greater variation in variable importance for unstructured compared to structured missingness. Discussion Both CART and BRT models were effective in describing structural missingness in data. CART models may be preferred over BRT models for exploratory analysis of missing data, and selecting variables important for predicting missingness. BRT models can show how values of other variables influence missingness, which may prove useful for researchers. Conclusion Researchers are encouraged to use CART and BRT models to explore and understand missing data.

Start making sense: Applying a salutogenic model to architectural design for psychiatric care

Purpose This paper aims to look into the significance of architectural design in psychiatric care facilities. There is a strong correlation between perceptual dysfunction and psychiatric illness, and also between the patient and his environment. As such, even minor design choices can be of great consequence in a psychiatric facility. It is of critical importance, therefore, that a psychiatric milieu is sympathetic and does not exacerbate the psychosis. Design/methodology/approach This paper analyses the architectural elements that may influence mental health, using an architectural extrapolation of Antonovsky’s salutogenic theory, which states that better health results from a state of mind which has a fortified sense of coherence. According to the theory, a sense of coherence is fostered by a patient’s ability to comprehend the environment (comprehensibility), to be effective in his actions (manageability) and to find meaning (meaningfullness). Findings Salutogenic theory can be extrapolated in an architectural context to inform design choices when designing for a stress-sensitive client base. Research limitations/implications In the paper an architectural extrapolation of salutogenic theory is presented as a practical method for making design decisions (in praxis) when evidence is not available. As demonstrated, the results appear to reflect what evidence is available, but real evidence is always desirable over rationalist speculation. The method suggested here cannot prove the efficacy or appropriateness of design decisions and is not intended to do so. Practical implications The design of mental health facilities has long been dominated by unsubstantiated policy and normative opinions that do not always serve the client population. This method establishes a practical theoretical model for generating architectural design guidelines for mental health facilities. Originality/value The paper will prove to be helpful in several ways. First, salutogenic theory is a useful framework for improving health outcomes, but in the past the theory has never been applied in a methodological way. Second, there have been few insights into how the architecture itself can improve the functionality of a mental health facility other than improve the secondary functions of hospital services.

Evaluation of a patient-specific finite-element model to simulate conservative treatment in adolescent idiopathic scoliosis

Study design Retrospective validation study. Objectives To propose a method to evaluate, from a clinical standpoint, the ability of a finite-element model (FEM) of the trunk to simulate orthotic correction of spinal deformity and to apply it to validate a previously described FEM. Summary of background data Several FEMs of the scoliotic spine have been described in the literature. These models can prove useful in understanding the mechanisms of scoliosis progression and in optimizing its treatment, but their validation has often been lacking or incomplete. Methods Three-dimensional (3D) geometries of 10 patients before and during conservative treatment were reconstructed from biplanar radiographs. The effect of bracing was simulated by modeling displacements induced by the brace pads. Simulated clinical indices (Cobb angle, T1–T12 and T4–T12 kyphosis, L1–L5 lordosis, apical vertebral rotation, torsion, rib hump) and vertebral orientations and positions were compared to those measured in the patients' 3D geometries. Results Errors in clinical indices were of the same order of magnitude as the uncertainties due to 3D reconstruction; for instance, Cobb angle was simulated with a root mean square error of 5.7°, and rib hump error was 5.6°. Vertebral orientation was simulated with a root mean square error of 4.8° and vertebral position with an error of 2.5 mm. Conclusions The methodology proposed here allowed in-depth evaluation of subject-specific simulations, confirming that FEMs of the trunk have the potential to accurately simulate brace action. These promising results provide a basis for ongoing 3D model development, toward the design of more efficient orthoses.