Parallel Real-Time Computation: Sometimes Quantity Means Quality

The primary purpose of parallel computation is the fast execution of computational tasks that require an inordinate amount of time to perform sequentially. As a consequence, interest in parallel computation to date has naturally focused on the speedup provided by parallel algorithms over their sequential counterparts. The thesis of this paper is that a second equally important motivation for using parallel computers exists. Specifically, the following question is posed: Can parallel computers, thanks to their multiple processors, do more than simply speed up the solution to a problem? We show that within the paradigm of real-time computation, some classes of problems have the property that a solution to a problem in the class, when computed in parallel, is far superior in quality than the best one obtained on a sequential computer. What constitutes a better solution depends on the problem under consideration. Thus, `better' means `closer to optimal' for optimization problems, `more secure' for cryptographic problems, and `more accurate' for numerical problems. Examples from these classes are presented. In each case, the solution obtained in parallel is significantly, provably, and consistently better than a sequential one. It is important to note that the purpose of this paper is not to demonstrate merely that a parallel computer can obtain a better solution to a computational problem than one derived sequentially. The latter is an interesting (and often surprising) observation in its own right, but we wish to go further. It is shown here that the improvement in quality can be arbitrarily high (and certainly superlinear in the number of processors used by the parallel computer). This result is akin to superlinear speedup --- a phenomenon itself originally thought to be impossible

Technical Report 2013-608 WHAT IS COMPUTATION?

Abstract Three conditions are usually given that must be satisfied by a process in order for it to be called a computation, namely, there must exist a finite length algorithm for the process, the algorithm must terminate in finite time for valid inputs and return a valid output, and finally the algorithm must never return an output for invalid inputs. These three conditions are advanced as being necessary and sufficient for the process to be computable by a universal model of computation. In fact, these conditions are neither necessary, nor sufficient. On the one hand, recently defined paradigms show how certain processes that do not satisfy one or more of the aforementioned properties can indeed be carried out in principle on new, more powerful, types of computers, and hence can be considered as computations. Thus the conditions are not necessary. On the other hand, contemporary work in unconventional computation has demonstrated the existence of processes that satisfy the three stated conditions, yet contradict the Church-Turing Thesis, and more generally, the principle of universality in computer science. Thus the conditions are not sufficient

WHAT IS COMPUTATION?

Three conditions are usually given that must be satisfied by a process in order for it to be called a computation, namely, there must exist a finite length algorithm for the process, the algorithm must terminate in finite time for valid inputs and return a valid output, and finally the algorithm must never return an output for invalid inputs. These three conditions are advanced as being necessary and sufficient for the process to be computable by a universal model of computation. In fact, these conditions are neither necessary, nor sufficient. On the one hand, recently defined paradigms show how certain processes that do not satisfy one or more of the aforementioned properties can indeed be carried out in principle on new, more powerful, types of computers, and hence can be considered as computations. Thus the conditions are not necessary. On the other hand, contemporary work in unconventional computation has demonstrated the existence of processes that satisfy the three stated conditions, yet contradict the Church-Turing Thesis, and more generally, the principle of universality in computer science. Thus the conditions are not sufficient

Quantum measurements and universal computation

The role played by parallelism in the theory of computation depends on the particular paradigm or computational environment considered, but its importance has been confirmed with the emergence of each novel computing technology. In this paper we study the implications of parallelism in quantum information theory and show that a parallel approach can make the difference between success and failure when trying to distinguish among (entangled) quantum states. A (perhaps surprising) consequence of this fact is the impossibility of constructing a Universal Computer, as defined herein

Self-Protecting Access Control: On Mitigating Privacy Violations with Fault Tolerance

Self-protecting access control mechanisms can be described as an approach to enforcing security in a manner that automatically protects against violations of access control rules. In this chapter, we present a comparative analysis of standard Cryptographic Access Control (CAC) schemes in relation to privacy enforcement on the Web. We postulate that to mitigate privacy violations, self-protecting CAC mechanisms need to be supported by fault-tolerance. As an example of how one might to do this, we present two solutions that are inspired by the autonomic computing paradigm1. Our solutions are centered on how CAC schemes can be extended to protect against privacy violations that might arise from key updates and collusion attacks

Efficient enforcement of dynamic cryptographic access control policies for outsourced data

Outsourcing of their data to third-party service providers is a cost-effective data management strategy for many organizations. Outsourcing, however, introduces new challenges with respect to ensuring the security and the privacy of the data. In addition to the need for standard access control policies, organizations must now be concerned with the privacy of their data and so hiding the data from the service provider is important. Simply encrypting the data before it is transmitted to the service provider is inefficient and vulnerable to security attacks when the access control policies change. Approaches based on two layers of encryption alleviate the privacy concern but still require re-encryption of the data when policies change. This paper presents a novel and efficient solution that employs two layers of encryption of the data and an encrypted data object containing the second access key. Changes to the access control policies are handled by re-encrypting the object containing the affected key, which is an efficient operation. The paper presents our key management approach, a security analysis of our approach, and an evaluation of the performance of a proof of concept implementation of our approach

Waterpipe tobacco use in the United Kingdom: A cross-sectional study among university students and stop smoking practitioners

© 2016 Jawad et al.This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Introduction: Despite cigarette-like adverse health outcomes associated with waterpipe tobacco smoking and increase in its use among youth, it is a much underexplored research area. We aimed to measure the prevalence and patterns of waterpipe tobacco use and evaluate tobacco control policy with respect to waterpipe tobacco, in several universities across the UK. We also aimed to measure stop smoking practitioners' encounter of waterpipe tobacco smoking. Methods: We distributed an online survey to six UK universities, asking detailed questions on waterpipe tobacco. Multivariable logistic regression models, adjusted for age, gender, ethnicity, graduate status, university and socioeconomic status (SES) assessed associations between waterpipe tobacco smoking (single use and dual use with cigarettes) and sociodemographic variables. SES was ascertained by average weekly self-spend on non-essentials. We also descriptively analysed data from a 2012 survey of stop smoking practitioners to assess the proportion of clients that used waterpipe regularly. Results: f 2217 student responses, 66.0%(95% CI 63.9-68.0%) had tried waterpipe tobacco smoking; 14.3%(95% CI 12.8-15.8%) reported past-30 day use, and 8.7% (95% CI 7.6-9.9%) reported at least monthly users. Past-30 day waterpipe-only use was associated with being younger (AOR 0.95, 95% CI 0.91-0.99), male (AOR 1.44, 95% CI 1.08-1.94), higher SES (AOR 1.16, 95% CI 1.06-1.28) and belonging to non-white ethnicities (vs. white, AOR 2.24, 95% CI 1.66-3.04). Compared to less than monthly users, monthly users were significantly more likely to have urges to smoke waterpipe (28.1% vs. 3.1%,

Parallel Computation : Models and Methods

X, 608 tr.; 24 cm