Ketamine effects on the urogenital system--changes in the urinary bladder and sperm motility

Different doses of ketamine (10 mg/kg, 20 mg/kg, 30 mg/kg, 40 mg/kg, 50 mg/kg, and 60 mg/kg) were injected i.p. (I.P.), respectively, to male ICR mice to determine the optimal dosage for chronic administration. At and above 40 mg/kg I.P. injection, mice had almost no hindlimb movement during swimming test. Subsequently, 30 mg/kg was used as the dose for the study in the toxicity of long-term ketamine administration on urinary bladder and sperm motility. The treatment group were subdivided into two (n = 10 each group); one received daily ketamine treatment i.p. for 3 months and another group for 6 months. Corresponding number of mice in control groups (n = 5 each group) received saline injection instead of ketamine. Terminal dUTP nick and labeling (TUNEL) study and Sirius red staining were carried out on the sectioned slides of the urinary bladders to study the degree of apoptosis in both epithelium and muscular layers of the urinary bladder and the relative thickness of the muscular layers in this organ was also computed. Apoptosis in the bladder epithelium was observed initially in the 3-month ketamine treated mice and the number of apoptotic cells was significantly different (P < 0.05) between the 3-month and 6-month ketamine treated mice and the control. The relative thickness of muscular layers in the bladder wall also decreased significantly (P < 0.05) when the 6-month treated mice and the control were compared. Sirius red staining revealed increase of collagen in the urinary bladder of the treated mice, most evidently 6 months after ketamine treatment. In addition, the sperm motility was studied and there was a statistically significant difference between the control and ketamine treated groups in the percentages of sperms which were motile (P < 0.05). This suggested that the chronic administration of ketamine affected the genital system as well.     

Efficient arbitrated quantum signature and its proof of security

In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.     

Cancellable biometrics and annotations on BioHash

Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges of identity frauds. For example, the sole biometric approach suffers from the privacy invasion and non-revocable issues. Passwords and tokens are easily forgotten and lost. To address these issues, the notion of cancellable biometrics was introduced to denote biometric templates that can be cancelled and replaced with the inclusion of another independent authentication factor. BioHash is a form of cancellable biometrics which mixes a set of user-specific random vectors with biometric features. In verification setting, BioHash is able to deliver extremely low error rates as compared to the sole biometric approach when a genuine token is used. However, this raises the possibility of two identity theft scenarios: (i) stolen-biometrics, in which an impostor possesses intercepted biometric data of sufficient high quality to be considered genuine and (ii) stolen-token, in which an impostor has access to the genuine token and used by the impostor to claim as the genuine user. We found that the recognition rate for the latter case is poorer. In this paper, the quantised random projection ensemble based on the Johnson–Lindenstrauss Lemma is used to establish the mathematical foundation of BioHash. Based on this model, we elucidate the characteristics of BioHash in pattern recognition as well as security view points and propose new methods to rectify the stolen-token problem.     

Engineering linear F(ab')2 fragments for efficient production in Escherichia coli and enhanced antiproliferative activity

We developed a novel bivalent antibody fragment, the linear(L-) F(ab')₂, comprising tandem repeats of a heavy chain fragmentV_H–C_H1–V_H–C_H1 cosecreted with a light chain.Functional humanized L-F(ab')₂ directed against p185^HER2 wassecreted from Escherichia coli at high titer (100 mg/l) andpurified to homogeneity. The L-F(ab')₂ binds two equivalentsof antigen with an apparent affinity (K_d = 0.46 nM) that iswithin 3-fold of the corresponding thioether-linked F(ab')₂fragment The N-terminal site binds antigen with an affinity(K_d = 1.2 nM) that is 4-fold greater than that for the C-terminalsite, as shown by the comparison of L-F(ab')₂ variants containinga single functional binding site. L-F(ab')₂ has greater antiproliferativeactivity than the thioether-linked F(ab')₂ against the p185^HER2-overexpressingtumor cell line BT474. Linear and thioether-linked F(ab')₂ havevery similar pharmacokinetic properties in normal mice, andtheir serum permanence times are respectively 7- and 8-foldlonger than the corresponding Fab fragment L-F(ab')₂ offersa facile route to bivalent antibody fragments that are potentiallysuitable for clinical applications, and that may have improvedbiological activity compared with thioether-linked F(ab')₂ fragments.     

The Electrochemical Response of Single Crystalline Copper Nanowires to Atmospheric Air and Aqueous Solution

In this paper, single crystalline copper nanowires (CuNWs) have been electrochemically grown through anodic aluminum oxide template. The environmental stability of the as‐obtained CuNWs in both 40% relative humidity (RH) atmosphere and 0.1 m NaOH aqueous solution has been subsequently studied. In 40% RH atmosphere, a uniform compact Cu₂O layer is formed as a function of exposure time following the logarithmic law and epitaxially covers the CuNW surfaces. It is also found that the oxide layers on CuNWs are sequentially grown when subjected to the cyclic voltammetry measurement in 0.1 m NaOH solution. An epitaxially homogeneous Cu₂O layer is initially formed over the surface of the CuNW substrates by solid‐state reaction (SSR). Subsequently, the conversion of Cu₂O into epitaxial CuO based on the SSR takes place with the increase of applied potential. This CuO layer is partially dissolved in the solution forming Cu(OH)₂, which then redeposited on the CuNW surfaces (i.e., dissolution‐redeposition (DR) process) giving rise to a mixed polycrystalline CuO/Cu(OH)₂ layer. The further increase of applied potential allows the complete oxidation of Cu₂O into CuO to form a dual‐layer structure (i.e., CuO inner layer and Cu(OH)₂ outer layer) with random orientations through an enhanced DR process.     

Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requires the fewest number of joins to navigate among the data elements. We know that the general problem is intractable. The problem may still be intractable even when the hypergraph is acyclic and each hyperedge is in Boyce–Codd normal form (BCNF). As we show here, however, given an acyclic hypergraph with each hyperedge in BCNF, a polynomial-time algorithm exists that generates a largest possible redundancy-free XML storage structure. Successively generating largest possible scheme trees from among hyperedges not already included in generated scheme trees constitutes a reasonable heuristic for finding the fewest possible scheme trees. For many practical cases, this heuristic finds the set of redundancy-free XML storage structures with the fewest number of scheme trees. In addition to a correctness proof and a complexity analysis showing that the algorithm is polynomial, we also give experimental results over randomly generated but appropriately constrained hypergraphs showing empirically that the algorithm is indeed polynomial.     

How to construct identity-based signatures without the key escrow problem

The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by adopting multiple Private Key Generators (PKGs). Recently, there was a proposal that attempted to reduce the trust of the PKG by allowing a malicious PKG to be caught if he reveals the user’s identity-based private key illegally. Nonetheless, the proposal does not consider that the PKG can simply decrypt the ciphertext instead of revealing the private key itself (in the case of identity-based encryption schemes). The aim of this paper is to present an escrow-free identity-based signature (IBS) scheme, in which the malicious PKG will be caught if it releases a signature on behalf of the user but signed by itself. We present a formal model to capture such a scheme and provide a concrete construction.     

Quart-parametric interpolations for intersecting paths

The intersecting path is an important tool path generation method. This paper proposes an approach for the quart-parametric interpolation of intersecting paths. The objective of our approach is that the intersecting paths for surface machining can be directly interpolated within the computer numerical control (CNC) system. This enables the CNC interpolator to process the intersecting paths without geometric approximation as in existing approaches and take into consideration any specific feedrate profiles and further machining dynamical issues along the path.The interpolation of the intersection of two general parametric surfaces is transferred into interpolation of its projection curves and the time trajectories of four parameters along the intersecting curves are obtained. Our strategy is to carry out the quart-parametric interpolation based on the projection interpolation. The feedrate control method is developed, and then the interpolation algorithms for two projection curves are proposed. An error reduction scheme is presented to alleviate point deviation from the drive parametric surface. Simulations of quart-parametric interpolation have been carried out to verify the effectiveness of the proposed algorithm.