Preliminary assessment of cognitive impairments in canine idiopathic epilepsy

In humans, epilepsy can induce or accelerate cognitive impairment (CI). There is emerging evidence of CI in dogs with idiopathic epilepsy (IE) from recent epidemiological studies. The aim of our study was to assess CI in dogs with IE using two tests of cognitive dysfunction designed for use in a clinical setting. Dogs with IE (n=17) were compared against controls (n=18) in their performance in two tasks; a spatial working memory task and a problem-solving task. In addition, owners completed the Canine Cognitive Dysfunction Rating (CCDR) scale for their dog. The groups did not differ statistically with respect to age and breed. Dogs with IE performed significantly worse than controls on the spatial working memory task (P=0.016), but not on the problem solving task (P=0.683). CCDR scores were significantly higher in the IE group (P=0.016); however, no dogs reach the recommended threshold score for CCD diagnosis. Our preliminary data suggest that dogs with IE exhibit impairments in a spatial working memory task. Further research is required to explore the effect of IE on other cognitive abilities in dogs with a larger sample, characterising the age of onset, nature and progression of any impairments and the impact of anti-epileptic drugs

ADN: An Information-Centric Networking Architecture for the Internet of Things

Forwarding data by name has been assumed to be a necessary aspect of an information-centric redesign of the current Internet architecture that makes content access, dissemination, and storage more efficient. The Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures are the leading examples of such an approach. However, forwarding data by name incurs storage and communication complexities that are orders of magnitude larger than solutions based on forwarding data using addresses. Furthermore, the specific algorithms used in NDN and CCNx have been shown to have a number of limitations. The Addressable Data Networking (ADN) architecture is introduced as an alternative to NDN and CCNx. ADN is particularly attractive for large-scale deployments of the Internet of Things (IoT), because it requires far less storage and processing in relaying nodes than NDN. ADN allows things and data to be denoted by names, just like NDN and CCNx do. However, instead of replacing the waist of the Internet with named-data forwarding, ADN uses an address-based forwarding plane and introduces an information plane that seamlessly maps names to addresses without the involvement of end-user applications. Simulation results illustrate the order of magnitude savings in complexity that can be attained with ADN compared to NDN.Comment: 10 page

Nonlinear behavior of shells of revolution under cyclic loading

A large deflection elastic-plastic analysis is presented, applicable to orthotropic axisymmetric plates and shells of revolution subjected to monotonic and cyclic loading conditions. The analysis is based on the finite-element method. It employs a new higher order, fully compatible, doubly curved orthotropic shell-of-revolution element using cubic Hermitian expansions for both meridional and normal displacements. Both perfectly plastic and strain hardening behavior are considered. Strain hardening is incorporated through use of the Prager-Ziegler kinematic hardening theory, which predicts an ideal Bauschinger effect. Numerous sample problems involving monotonic and cyclic loading conditions are analyzed. The monotonic results are compared with other theoretical solutions

Space debris characterization in support of a satellite breakup model

The Space Kinetic Impact and Debris Branch began an ambitious program to construct a fully analytical model of the breakup of a satellite under hypervelocity impact. In order to provide empirical data with which to substantiate the model, debris from hypervelocity experiments conducted in a controlled laboratory environment were characterized to provide information of its mass, velocity, and ballistic coefficient distributions. Data on the debris were collected in one master data file, and a simple FORTRAN program allows users to describe the debris from any subset of these experiments that may be of interest to them. A statistical analysis was performed, allowing users to determine the precision of the velocity measurements for the data. Attempts are being made to include and correlate other laboratory data, as well as those data obtained from the explosion or collision of spacecraft in low earth orbit

On the communication cost of entanglement transformations

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR pairs, and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to require no communication whatsoever, the best known protocol for dilution, discovered by Lo and Popescu [Phys. Rev. Lett. 83(7):1459--1462, 1999], requires a number of bits to be exchanged which is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of ``embezzling entanglement'' [W. van Dam and P. Hayden, quant-ph/0201041].Comment: 9 pages, 1 figure. Added a reference and some further explanations. In v3 some arguments are given in more detai