Ultrasonic Doppler measurement of renal artery blood flow

Studies were made of (1) blood flow redistribution during lower body negative pressure (LBNP), (2) the profile of blood flow across the mitral annulus of the heart (both perpendicular and parallel to the commissures), (3) testing and evaluation of a number of pulsed Doppler systems, (4) acute calibration of perivascular Doppler transducers, (5) redesign of the mitral flow transducers to improve reliability and ease of construction, and (6) a frequency offset generator designed for use in distinguishing forward and reverse components of blood flow by producing frequencies above and below the offset frequency. Finally methodology was developed and initial results were obtained from a computer analysis of time-varying Doppler spectra

Study of behavioral modifications resulting from exposure to high let radiation

Animal irradiations, behavioral studies, neurological studies, and nuclear medicine studies are discussed

An exploratory randomised controlled trial comparing telephone and hospital follow-up after treatment for colorectal cancer

Aim:  Following treatment for colorectal cancer it is common practice for patients to attend hospital clinics at regular intervals for routine monitoring, although debate persists on the benefits of this approach. Nurse-led telephone follow-up is effective in meeting information and psycho-social needs in other patient groups. We explored the potential benefits of nurse-led telephone follow-up for colorectal cancer patients. Method:  Sixty-five patients were randomised to either telephone or hospital follow-up in an exploratory randomised trial. Results:  The telephone intervention was deliverable in clinical practice and acceptable to patients and health professionals. Seventy-five percent of eligible patients agreed to randomization. High levels of satisfaction were evident in both study groups. Appointments in the hospital group were shorter (median 14.0 minutes) than appointments in the telephone group (median 28.9 minutes). Patients in the telephone arm were more likely to raise concerns during consultations. Conclusion:  Historical approaches to follow-up unsupported by evidence of effectiveness and efficiency are not sustainable. Telephone follow-up by specialist nurses may be a feasible option. A main trial comparing hospital and telephone follow-up is justified although consideration needs to be given to trial design and practical issues related to the availability of specialist nurses at study locations

GraphSE2^2: An Encrypted Graph Database for Privacy-Preserving Social Search

In this paper, we propose GraphSE$^2$, an encrypted graph database for online social network services to address massive data breaches. GraphSE$^2$ preserves the functionality of social search, a key enabler for quality social network services, where social search queries are conducted on a large-scale social graph and meanwhile perform set and computational operations on user-generated contents. To enable efficient privacy-preserving social search, GraphSE$^2$ provides an encrypted structural data model to facilitate parallel and encrypted graph data access. It is also designed to decompose complex social search queries into atomic operations and realise them via interchangeable protocols in a fast and scalable manner. We build GraphSE$^2$ with various queries supported in the Facebook graph search engine and implement a full-fledged prototype. Extensive evaluations on Azure Cloud demonstrate that GraphSE$^2$ is practical for querying a social graph with a million of users.Comment: This is the full version of our AsiaCCS paper "GraphSE$^2$: An Encrypted Graph Database for Privacy-Preserving Social Search". It includes the security proof of the proposed scheme. If you want to cite our work, please cite the conference version of i

Towards Communication-Efficient Quantum Oblivious Key Distribution

Oblivious Transfer, a fundamental problem in the field of secure multi-party computation is defined as follows: A database DB of N bits held by Bob is queried by a user Alice who is interested in the bit DB_b in such a way that (1) Alice learns DB_b and only DB_b and (2) Bob does not learn anything about Alice's choice b. While solutions to this problem in the classical domain rely largely on unproven computational complexity theoretic assumptions, it is also known that perfect solutions that guarantee both database and user privacy are impossible in the quantum domain. Jakobi et al. [Phys. Rev. A, 83(2), 022301, Feb 2011] proposed a protocol for Oblivious Transfer using well known QKD techniques to establish an Oblivious Key to solve this problem. Their solution provided a good degree of database and user privacy (using physical principles like impossibility of perfectly distinguishing non-orthogonal quantum states and the impossibility of superluminal communication) while being loss-resistant and implementable with commercial QKD devices (due to the use of SARG04). However, their Quantum Oblivious Key Distribution (QOKD) protocol requires a communication complexity of O(N log N). Since modern databases can be extremely large, it is important to reduce this communication as much as possible. In this paper, we first suggest a modification of their protocol wherein the number of qubits that need to be exchanged is reduced to O(N). A subsequent generalization reduces the quantum communication complexity even further in such a way that only a few hundred qubits are needed to be transferred even for very large databases.Comment: 7 page

Low latency via redundancy

Low latency is critical for interactive networked applications. But while we know how to scale systems to increase capacity, reducing latency --- especially the tail of the latency distribution --- can be much more difficult. In this paper, we argue that the use of redundancy is an effective way to convert extra capacity into reduced latency. By initiating redundant operations across diverse resources and using the first result which completes, redundancy improves a system's latency even under exceptional conditions. We study the tradeoff with added system utilization, characterizing the situations in which replicating all tasks reduces mean latency. We then demonstrate empirically that replicating all operations can result in significant mean and tail latency reduction in real-world systems including DNS queries, database servers, and packet forwarding within networks

The influence of emotional reaction on help seeking by victims of school bullying

Research has started to focus on how victims of school bullying cope, but there is still very little understanding if why pupils cope in one way and not another. This paper aimed to examine the effects of gender, school-stage, frequency of victimization and different emotions (anger, vengeance, self-pity, indifference, and helplessness) upon the choice of social support that children report using. Questionnaires were completed by 6282 Maltese schoolchildren aged between 9 and 14 years old. Analyses revealed that specific patterns of emotion and victimization predict whether pupils report using certain sources of social support. Results are discussed in relation to their relevance for possible intervention, future research needs and implications for the theoretical framework used

Spatially resolved spectroscopy of monolayer graphene on SiO2

We have carried out scanning tunneling spectroscopy measurements on exfoliated monolayer graphene on SiO$_2$ to probe the correlation between its electronic and structural properties. Maps of the local density of states are characterized by electron and hole puddles that arise due to long range intravalley scattering from intrinsic ripples in graphene and random charged impurities. At low energy, we observe short range intervalley scattering which we attribute to lattice defects. Our results demonstrate that the electronic properties of graphene are influenced by intrinsic ripples, defects and the underlying SiO$_2$ substrate.Comment: 6 pages, 7 figures, extended versio

Practical private database queries based on a quantum key distribution protocol

Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum key distribution protocol, with changes only in the classical post-processing of the key. This approach makes our scheme both easy to implement and loss-tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved, relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both user and database. We think that there is scope for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.Comment: 7 pages, 2 figures, new and improved version, clarified claims, expanded security discussio