Search

Your search keyword '"Joseph, David"' showing total 3,113 results
Start Over Author "Joseph, David"

Refine your results

more »

more »

more »

more »

more »

more »

more »
3,113 results on '"Joseph, David"'

1. Accelerating quantum imaginary-time evolution with random measurements

Author

Kolotouros, Ioannis, Joseph, David, and Narayanan, Anand Kumar

Subjects
Quantum Physics
Abstract

Quantum imaginary-time evolution (QITE) is a promising tool to prepare thermal or ground states of Hamiltonians, as convergence is guaranteed when the evolved state overlaps with the ground state. However, its implementation using a parameterized quantum circuit is impractical as the number of parameters $m$ increases, since each step in the evolution takes $\Theta(m^2)$ state preparations to calculate the quantum Fisher information matrix (QFIM). In this work, we accelerate QITE by rapid estimation of the QFIM, while conserving the convergence guarantees to the extent possible. To this end, we prove that if a parameterized state is rotated by a 2-design and measured in the computational basis, then the QFIM can be inferred from partial derivative cross correlations of the probability outcomes. One sample estimate costs only $\Theta(m)$ state preparations, leading to rapid QFIM estimation when a few samples suffice. The second family of estimators take greater liberties and replace QFIMs with averaged classical Fisher information matrices (CFIMs). In an extreme special case optimized for rapid (over accurate) descent, just one CFIM sample is drawn. We justify the second estimator family by proving rapid descent. Guided by these results, we propose the random-measurement imaginary-time evolution (RMITE) algorithm, which we showcase and test in several molecular systems, with the goal of preparing ground states., Comment: 18 pages, 7 figures

Published
2024

6. Grover's oracle for the Shortest Vector Problem and its application in hybrid classical-quantum solvers

Author

Prokop, Milos, Wallden, Petros, and Joseph, David

Subjects
Quantum Physics, Computer Science - Cryptography and Security
Abstract

Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major post-quantum secure cryptosystems base their security on the hardness of the Shortest Vector Problem (SVP). Finding the best classical, quantum or hybrid classical-quantum algorithms for SVP is necessary to select cryptosystem parameters that offer sufficient level of security. Grover's search quantum algorithm provides a generic quadratic speed-up, given access to an oracle implementing some function which describes when a solution is found. In this paper we provide concrete implementation of such an oracle for the SVP. We define the circuit, and evaluate costs in terms of number of qubits, number of gates, depth and T-quantum cost. We then analyze how to combine Grover's quantum search for small SVP instances with state-of-the-art classical solvers that use well known algorithms, such as the BKZ, where the former is used as a subroutine. This could enable solving larger instances of SVP with higher probability than classical state-of-the-art records, but still very far from posing any threat to cryptosystems being considered for standardization. Depending on the technology available, there is a spectrum of trade-offs in creating this combination., Comment: 29 pages, 5 figures

Published
2024

8. On finding dense sub-lattices as low energy states of a quantum Hamiltonian

Author

Rodríguez, Júlia Barberà, Gama, Nicolas, Narayanan, Anand Kumar, and Joseph, David

Subjects
Quantum Physics, Computer Science - Computational Complexity, Computer Science - Cryptography and Security
Abstract

Lattice-based cryptography has emerged as one of the most prominent candidates for post-quantum cryptography, projected to be secure against the imminent threat of large-scale fault-tolerant quantum computers. The Shortest Vector Problem (SVP) is to find the shortest non-zero vector in a given lattice. It is fundamental to lattice-based cryptography and believed to be hard even for quantum computers. We study a natural generalization of the SVP known as the $K$-Densest Sub-lattice Problem ($K$-DSP): to find the densest $K$-dimensional sub-lattice of a given lattice. We formulate $K$-DSP as finding the first excited state of a Z-basis Hamiltonian, making $K$-DSP amenable to investigation via an array of quantum algorithms, including Grover search, quantum Gibbs sampling, adiabatic, and Variational Quantum Algorithms. The complexity of the algorithms depends on the basis through which the input lattice is presented. We present a classical polynomial-time algorithm that takes an arbitrary input basis and preprocesses it into inputs suited to quantum algorithms. With preprocessing, we prove that $O(KN^2)$ qubits suffice for solving $K$-DSP for $N$ dimensional input lattices. We empirically demonstrate the performance of a Quantum Approximate Optimization Algorithm $K$-DSP solver for low dimensions, highlighting the influence of a good preprocessed input basis. We then discuss the hardness of $K$-DSP in relation to the SVP, to see if there is reason to build post-quantum cryptography on $K$-DSP. We devise a quantum algorithm that solves $K$-DSP with run-time exponent $(5KN\log{N})/2$. Therefore, for fixed $K$, $K$-DSP is no more than polynomially harder than the SVP.

Published
2023

9. Breathlessness without borders: a call to action for global breathlessness research

Author

Joseph David Clark, Kate Binnie, Maddie Bond, Michael Crooks, David C. Currow, Jordan Curry, Helen Elsey, Monsur Habib, Ann Hutchinson, Ireneous Soyiri, Miriam J. Johnson, Shreya Nair, Seema Rao, Noemia Siqueira-Filha, Anna Spathis, and Siân Williams

Subjects
Diseases of the respiratory system, RC705-779
Abstract

It is likely that the burden of breathlessness in low and middle-income countries (LMICs) is much higher than has been estimated using calculations of disease burden and expected prevalence of the symptom. However, most breathlessness research has been conducted in high-income countries and may not be relevant to LMICs. To address this issue, we convened an international breathlessness and global health workshop. Our multidisciplinary team of experts (global palliative care, respiratory medicine, epidemiology, palliative medicine, psychiatry, sport science, global public health and health economics) met at the University of Hull for a two-day workshop in May 2024. We had 8 presentations on key issues relevant to global breathlessness research. Our discussions focussed on unexplored questions and links between breathlessness and other health and social issues, in order to develop an agenda for global breathlessness research. Our discussions highlighted (1) the global burden of breathlessness generated by a range of lifestyle, environmental, disease and poverty-related factors, (2) the need for a global healthcare workforce that can address modifiable causes and the symptoms of breathlessness together using an integrated approach, (3) the value of information over clinical effectiveness when considering implementation of breathlessness self-management interventions, (4) Addressing non-clinical outcomes which are meaningful to individuals and families and (5) Developing a language for global breathlessness research which does not assume that the cause of breathlessness is diagnosed or treated. We present our discussions and recommendations for new approaches and paradigms for global breathlessness research to generate discussion—not to provide empirical evidence.

Published
2024
Full Text
View/download PDF

10. LEACE: Perfect linear concept erasure in closed form

Author

Belrose, Nora, Schneider-Joseph, David, Ravfogel, Shauli, Cotterell, Ryan, Raff, Edward, and Biderman, Stella

Subjects
Computer Science - Machine Learning, Computer Science - Computation and Language, Computer Science - Computers and Society
Abstract

Concept erasure aims to remove specified features from a representation. It can improve fairness (e.g. preventing a classifier from using gender or race) and interpretability (e.g. removing a concept to observe changes in model behavior). We introduce LEAst-squares Concept Erasure (LEACE), a closed-form method which provably prevents all linear classifiers from detecting a concept while changing the representation as little as possible, as measured by a broad class of norms. We apply LEACE to large language models with a novel procedure called "concept scrubbing," which erases target concept information from every layer in the network. We demonstrate our method on two tasks: measuring the reliance of language models on part-of-speech information, and reducing gender bias in BERT embeddings. Code is available at https://github.com/EleutherAI/concept-erasure.

Published
2023

11. Biochemical Recurrence Surrogacy for Clinical Outcomes After Radiotherapy for Adenocarcinoma of the Prostate.

Author

Roy, Soumyajit, Romero, Tahmineh, Michalski, Jeff, Feng, Felix, Efstathiou, Jason, Lawton, Colleen, Bolla, Michel, Maingon, Philippe, de Reijke, Theo, Joseph, David, Ong, Wee, Sydes, Matthew, Dearnaley, David, Tree, Alison, Carrier, Nathalie, Nabid, Abdenour, Souhami, Luis, Incrocci, Luca, Heemsbergen, Wilma, Pos, Floris, Zapatero, Almudena, Guerrero, Araceli, Alvarez, Ana, San-Segundo, Carmen, Maldonado, Xavier, Reiter, Robert, Nickols, Nicholas, Ma, T, Farrell, Matthew, Neilsen, Beth, Juarez, Jesus, Deng, Jie, Vangala, Sitaram, Avril, Norbert, Jia, Angela, Zaorsky, Nicholas, Sun, Yilun, Spratt, Daniel, Kishan, Amar, Rettig, Matthew, Steinberg, Michael, and Valle, Luca

Subjects
Male, Humans, Prostate, Prostatic Neoplasms, Androgen Antagonists, Prostate-Specific Antigen, Adenocarcinoma
Abstract

PURPOSE: The surrogacy of biochemical recurrence (BCR) for overall survival (OS) in localized prostate cancer remains controversial. Herein, we evaluate the surrogacy of BCR using different surrogacy analytic methods. MATERIALS AND METHODS: Individual patient data from 11 trials evaluating radiotherapy dose escalation, androgen deprivation therapy (ADT) use, and ADT prolongation were obtained. Surrogate candidacy was assessed using the Prentice criteria (including landmark analyses) and the two-stage meta-analytic approach (estimating Kendalls tau and the R2). Biochemical recurrence-free survival (BCRFS, time from random assignment to BCR or any death) and time to BCR (TTBCR, time from random assignment to BCR or cancer-specific deaths censoring for noncancer-related deaths) were assessed. RESULTS: Overall, 10,741 patients were included. Dose escalation, addition of short-term ADT, and prolongation of ADT duration significantly improved BCR (hazard ratio [HR], 0.71 [95% CI, 0.63 to 0.79]; HR, 0.53 [95% CI, 0.48 to 0.59]; and HR, 0.54 [95% CI, 0.48 to 0.61], respectively). Adding short-term ADT (HR, 0.91 [95% CI, 0.84 to 0.99]) and prolonging ADT (HR, 0.86 [95% CI, 0.78 to 0.94]) significantly improved OS, whereas dose escalation did not (HR, 0.98 [95% CI, 0.87 to 1.11]). BCR at 48 months was associated with inferior OS in all three groups (HR, 2.46 [95% CI, 2.08 to 2.92]; HR, 1.51 [95% CI, 1.35 to 1.70]; and HR, 2.31 [95% CI, 2.04 to 2.61], respectively). However, after adjusting for BCR at 48 months, there was no significant treatment effect on OS (HR, 1.10 [95% CI, 0.96 to 1.27]; HR, 0.96 [95% CI, 0.87 to 1.06] and 1.00 [95% CI, 0.90 to 1.12], respectively). The patient-level correlation (Kendalls tau) for BCRFS and OS ranged between 0.59 and 0.69, and that for TTBCR and OS ranged between 0.23 and 0.41. The R2 values for trial-level correlation of the treatment effect on BCRFS and TTBCR with that on OS were 0.563 and 0.160, respectively. CONCLUSION: BCRFS and TTBCR are prognostic but failed to satisfy all surrogacy criteria. Strength of correlation was greater when noncancer-related deaths were considered events.

Published
2023

15. TurboTLS: TLS connection establishment with 1 less round trip

Author

Aguilar-Melchor, Carlos, Bailleux, Thomas, Goertzen, Jason, Guinet, Adrien, Joseph, David, and Stebila, Douglas

Subjects
Computer Science - Cryptography and Security, Computer Science - Networking and Internet Architecture, C.2.2, E.3
Abstract

We show how to establish TLS connections using one less round trip. In our approach, which we call TurboTLS, the initial client-to-server and server-to-client flows of the TLS handshake are sent over UDP rather than TCP. At the same time, in the same flights, the three-way TCP handshake is carried out. Once the TCP connection is established, the client and server can complete the final flight of the TLS handshake over the TCP connection and continue using it for application data. No changes are made to the contents of the TLS handshake protocol, only its delivery mechanism. We avoid problems with UDP fragmentation by using request-based fragmentation, in which the client sends in advance enough UDP requests to provide sufficient room for the server to fit its response with one response packet per request packet. Clients can detect which servers support this without an additional round trip, if the server advertises its support in a DNS HTTPS resource record. Experiments using our software implementation show substantial latency improvements. On reliable connections, we effectively eliminate a round trip without any noticeable cost. To ensure adequate performance on unreliable connections, we use lightweight packet ordering and buffering; we can have a client wait a very small time to receive a potentially lost packet (e.g., a fraction of the RTT observed for the first fragment) before falling back to TCP without any further delay, since the TCP connection was already in the process of being established. This approach offers substantial performance improvements with low complexity, even in heterogeneous network environments with poorly configured middleboxes.

Published
2023

18. TurboTLS: TLS Connection Establishment with 1 Less Round Trip

Author

Aguilar-Melchoro, Carlos, Bailleux, Thomas, Goertzen, Jason, Guinet, Adrien, Joseph, David, Stebila, Douglas, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Garcia-Alfaro, Joaquin, editor, Kozik, Rafał, editor, Choraś, Michał, editor, and Katsikas, Sokratis, editor

Published
2024
Full Text
View/download PDF

19. On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH

Author

Hülsing, Andreas, Joseph, David, Majenz, Christian, Narayanan, Anand Kumar, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Reyzin, Leonid, editor, and Stebila, Douglas, editor

Published
2024
Full Text
View/download PDF

20. Exploring the Adoption Readiness of the Indian Generation for Social Media Payments: An In-Depth Analysis of WhatsApp Payments

Author

Joseph, David, Girish, S., Akan, Ozgur, Editorial Board Member, Bellavista, Paolo, Editorial Board Member, Cao, Jiannong, Editorial Board Member, Coulson, Geoffrey, Editorial Board Member, Dressler, Falko, Editorial Board Member, Ferrari, Domenico, Editorial Board Member, Gerla, Mario, Editorial Board Member, Kobayashi, Hisashi, Editorial Board Member, Palazzo, Sergio, Editorial Board Member, Sahni, Sartaj, Editorial Board Member, Shen, Xuemin, Editorial Board Member, Stan, Mircea, Editorial Board Member, Jia, Xiaohua, Editorial Board Member, Zomaya, Albert Y., Editorial Board Member, Castillo, Oscar, editor, Sudhakar Babu, Thanikanti, editor, and Aluvalu, Rajanikanth, editor

Published
2024
Full Text
View/download PDF

22. Iterative Quantum Optimization with Adaptive Problem Hamiltonian

Author

Zhu, Yifeng Rocky, Joseph, David, Ling, Cong, and Mintert, Florian

Subjects
Quantum Physics
Abstract

Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of qubits, however, poses the risk of finding only the optimum within the restricted space supported by this Hamiltonian. We describe an iterative algorithm in which a solution obtained with such a restricted problem Hamiltonian is used to define a new problem Hamiltonian that is better suited than the previous one. In numerical examples of the shortest vector problem, we show that the algorithm with a sequence of improved problem Hamiltonians converges to the desired solution., Comment: 6 pages, 4 figures

Published
2022
Full Text
View/download PDF

23. Long-Term Quality-of-Life Outcomes After Prostate Radiation Therapy With or Without High-Dose-Rate Brachytherapy Boost: Post Hoc Analysis of TROG 03.04 RADAR

Author

Ong, Wee Loon, Nikitas, John, Joseph, David, Steigler, Allison, Millar, Jeremy, Valle, Luca, Steinberg, Michael L., Ma, Ting Martin, Reiter, Robert E., Rettig, Matthew B., Nickols, Nicholas G., Chang, Albert, Zaorsky, Nicholas G., Spratt, Daniel E., Romero, Tahmineh, and Kishan, Amar U.

Published
2024
Full Text
View/download PDF

24. A suite of quantum algorithms for the shortest vector problem

Author

Joseph, David and Ling, Cong

Abstract

Crytography has come to be an essential part of the cybersecurity infrastructure that provides a safe environment for communications in an increasingly connected world. The advent of quantum computing poses a threat to the foundations of the current widely-used cryptographic model, due to the breaking of most of the cryptographic algorithms used to provide confidentiality, authenticity, and more. Consequently a new set of cryptographic protocols have been designed to be secure against quantum computers, and are collectively known as post-quantum cryptography (PQC). A forerunner among PQC is lattice-based cryptography, whose security relies upon the hardness of a number of closely related mathematical problems, one of which is known as the shortest vector problem (SVP). In this thesis I describe a suite of quantum algorithms that utilize the energy minimization principle to attack the shortest vector problem. The algorithms outlined span the gate-model and continuous time quantum computing, and explore methods of parameter optimization via variational methods, which are thought to be effective on near-term quantum computers. The performance of the algorithms are analyzed numerically, analytically, and on quantum hardware where possible. I explain how the results obtained in the pursuit of solving SVP apply more broadly to quantum algorithms seeking to solve general real-world problems; minimize the effect of noise on imperfect hardware; and improve efficiency of parameter optimization.

Published
2022
Full Text
View/download PDF

25. Asymmetric Effect of Shadow Economy on Environmental Pollution in Egypt: Evidence from Bootstrap NARDL Technique

Author

Awadh Ahmed Mohammed Gamal, Joseph David, Mohd Asri Mohd Noor, Mohd Yahya Mohd Hussin, and K. Kuperan Viswanathan

Subjects
Shadow Economy, Environmental Pollution, Globalisation, Egypt, Bootstrap NARDL and Dynamic NARDL Simulations, Environmental sciences, GE1-350, Energy industries. Energy policy. Fuel trade, HD9502-9502.5
Abstract

This study examines the asymmetric effect of shadow economy on environmental pollution in Egypt during the 1970 and 2022 period. Using the bootstrap nonlinear autoregressive distributed lag (NARDL) bounds-testing approach, the study presents evidence of nonlinear cointegrating relationship between environmental degradation (carbon emission) and shadow economic activities (alongside globalisation, urbanisation, GDP per capita, and industrial growth). In addition, the results demonstrate that the impact of shadow economy (SE) on environmental pollution (ENV) is nonlinear, with the positive shock in shadow economy promoting environmental degradation and negative shocks promoting environmental quality, both in the short- and long-run. However, the study discovered that the magnitude of the impact of the SE on ENV is larger in the short-run. This is further validated by the dynamic ARDL simulation technique which demonstrates that the immediate effect of the SE on ENV is large. Additionally, the results suggest that income growth, urbanisation, and industrial growth are important drivers of environmental pollution. Therefore, the study recommends the adoption, and most importantly, implementation, of policies and strategies geared towards reducing the shadow economy, and consequently environmental pollution.

Published
2024
Full Text
View/download PDF

26. Interplay Between Duration of Androgen Deprivation Therapy and External Beam Radiotherapy With or Without a Brachytherapy Boost for Optimal Treatment of High-risk Prostate Cancer

Author

Kishan, Amar U, Steigler, Alison, Denham, James W, Zapatero, Almudena, Guerrero, Araceli, Joseph, David, Maldonado, Xavier, Wong, Jessica K, Stish, Bradley J, Dess, Robert T, Pilar, Avinash, Reddy, Chandana, Wedde, Trude B, Lilleby, Wolfgang A, Fiano, Ryan, Merrick, Gregory S, Stock, Richard G, Demanes, D Jeffrey, Moran, Brian J, Tran, Phuoc T, Martin, Santiago, Martinez-Monge, Rafael, Krauss, Daniel J, Abu-Isa, Eyad I, Pisansky, Thomas M, Choo, C Richard, Song, Daniel Y, Greco, Stephen, Deville, Curtiland, McNutt, Todd, DeWeese, Theodore L, Ross, Ashley E, Ciezki, Jay P, Tilki, Derya, Karnes, R Jeffrey, Tosoian, Jeffrey J, Nickols, Nicholas G, Bhat, Prashant, Shabsovich, David, Juarez, Jesus E, Jiang, Tommy, Ma, T Martin, Xiang, Michael, Philipson, Rebecca, Chang, Albert, Kupelian, Patrick A, Rettig, Matthew B, Feng, Felix Y, Berlin, Alejandro, Tward, Jonathan D, Davis, Brian J, Reiter, Robert E, Steinberg, Michael L, Elashoff, David, Boutros, Paul C, Horwitz, Eric M, Tendulkar, Rahul D, Spratt, Daniel E, and Romero, Tahmineh

Subjects
Cancer, Clinical Research, Prostate Cancer, Urologic Diseases, Clinical Trials and Supportive Activities, Evaluation of treatments and therapeutic interventions, 6.1 Pharmaceuticals, Androgen Antagonists, Androgens, Brachytherapy, Data Analysis, Humans, Male, Middle Aged, Prostatic Neoplasms, Retrospective Studies, Oncology and Carcinogenesis, Public Health and Health Services
Abstract

ImportanceRadiotherapy combined with androgen deprivation therapy (ADT) is a standard of care for high-risk prostate cancer. However, the interplay between radiotherapy dose and the required minimum duration of ADT is uncertain.ObjectiveTo determine the specific ADT duration threshold that provides a distant metastasis-free survival (DMFS) benefit in patients with high-risk prostate cancer receiving external beam radiotherapy (EBRT) or EBRT with a brachytherapy boost (EBRT+BT).Design, settings, and participantsThis was a cohort study of 3 cohorts assembled from a multicenter retrospective study (2000-2013); a post hoc analysis of the Randomized Androgen Deprivation and Radiotherapy 03/04 (RADAR; 2003-2007) randomized clinical trial (RCT); and a cross-trial comparison of the RADAR vs the Deprivación Androgénica y Radio Terapía (Androgen Deprivation and Radiation Therapy; DART) 01/05 RCT (2005-2010). In all, the study analyzed 1827 patients treated with EBRT and 1108 patients treated with EBRT+BT from the retrospective cohort; 181 treated with EBRT and 203 with EBRT+BT from RADAR; and 91 patients treated with EBRT from DART. The study was conducted from October 15, 2020, to July 1, 2021, and the data analyses, from January 5 to June 15, 2021.ExposuresHigh-dose EBRT or EBRT+BT for an ADT duration determined by patient-physician choice (retrospective) or by randomization (RCTs).Main outcomes and measuresThe primary outcome was DMFS; secondary outcome was overall survival (OS). Natural cubic spline analysis identified minimum thresholds (months).ResultsThis cohort study of 3 studies totaling 3410 men (mean age [SD], 68 [62-74] years; race and ethnicity not collected) with high-risk prostate cancer found a significant interaction between the treatment type (EBRT vs EBRT+BT) and ADT duration (binned to

Published
2022

27. Quantum mean value approximator for hard integer value problems

Author

Joseph, David, Martinez, Antonio J., Ling, Cong, and Mintert, Florian

Subjects
Quantum Physics
Abstract

Evaluating the expectation of a quantum circuit is a classically difficult problem known as the quantum mean value problem (QMV). It is used to optimize the quantum approximate optimization algorithm and other variational quantum eigensolvers. We show that such an optimization can be improved substantially by using an approximation rather than the exact expectation. Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems, such as the shortest vector problem (SVP) investigated in this work., Comment: 3 Figures, 4 pages main text, 4 pages supplementary material

Published
2021
Full Text
View/download PDF

29. SDitH in the QROM

Author

Aguilar-Melchor, Carlos, Hülsing, Andreas, Joseph, David, Majenz, Christian, Ronen, Eyal, Yue, Dongze, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, van Leeuwen, Jan, Series Editor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Series Editor, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Series Editor, Pandu Rangan, C., Editorial Board Member, Sudan, Madhu, Series Editor, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Series Editor, Vardi, Moshe Y, Series Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Guo, Jian, editor, and Steinfeld, Ron, editor

Published
2023
Full Text
View/download PDF

30. The Return of the SDitH

Author

Aguilar-Melchor, Carlos, Gama, Nicolas, Howe, James, Hülsing, Andreas, Joseph, David, Yue, Dongze, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hazay, Carmit, editor, and Stam, Martijn, editor

Published
2023
Full Text
View/download PDF

33. Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later

Author

Joseph, David, Callison, Adam, Ling, Cong, and Mintert, Florian

Subjects
Quantum Physics
Abstract

Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardised for the post-quantum era, and a significant proportion of these rely on the hardness of problems like the Shortest Vector Problem to a quantum adversary. In this paper we describe two variants of a quantum Ising algorithm to solve this problem. One variant is spatially efficient, requiring only O(NlogN) qubits where N is the lattice dimension, while the other variant is more robust to noise. Analysis of the algorithms' performance on a quantum annealer and in numerical simulations show that the more qubit-efficient variant will outperform in the long run, while the other variant is more suitable for near-term implementation., Comment: 16 pages, 7 figures

Published
2020
Full Text
View/download PDF

34. Ticket to ride : an investigation into the use of blockchain technology in the rail industry

Author

Preece, Joseph David

Subjects
QA76 Computer software
Abstract

The rail industry in Great Britain is undergoing a renaissance. Rising passenger numbers, a steady freight industry, and numerous planned projects make this an exciting time to be involved. Nonetheless, the network relies upon many legacy systems that impede progress. This stifling of progress is noticeable in the digital domain in particular, where a cluster of impractical formats and systems leave swathes of data with untapped potential. The search for interoperability in the industry is not a new one; many have conducted investigations and projects, to no avail. Blockchains are an exciting new avenue of technology and are beginning to disrupt various industries. Despite this, few investigations exist into the potential use of the technology in the rail industry. From a purely technical perspective, the distributed nature of the technology has the potential to overcome the issues of data centralisation and the lack of trust amongst stakeholders. Nevertheless, as a new technology, it is not yet fully understood by those in the industry. This lack of understanding is a barrier to adoption and is as essential to consider as the technical implications. This thesis proposes a new model to aid the decision-making process of those seeking to use blockchain. We validate this model by utilising it for two rail-specific use cases. The first is to build a marketisable data-sharing platform for rail industry data. Within this project, we investigate both classical and post-quantum cryptographic approaches to the platform. The second is a brand new approach digital ticketing for the GB rail network, to initiate the process of replacing the legacy ticketing systems still in operation. We use blockchain technology as the core data store to achieve this. We demonstrate the viability of both use cases, supporting the appropriate deployment of blockchain technology in the rail industry.

Published
2021

35. Structure and dynamics of two-dimensional binary colloidal polycrystals and fluids

Author

Hutchinson, Joseph David and Dullens, Roel

Subjects
Glasses, Grain boundaries, Colloid science, Soft condensed matter, Metal crystals--Growth
Abstract

The structural and dynamic behaviour of two-dimensional binary colloidal polycrystals and fluids are studied through optical microscopy and optical tweezing. Firstly, grain size evolution in an impurity doped polycrystalline monolayer is studied. A model is developed, combining crystallisation and curvature driven grain growth, which works well in describing grain size evolution at different impurity concentrations. The amount of dopant is found to affect the frustration of crystallisation and pinning of grain boundaries. Next studied is grain rotation in polycrystals. The rate of rotation for a single grain is well described by a model combining grain size and the grain boundary misorientation. The rate of rotation induced grain coalescence is placed in the context of grain size evolution and the trajectories of particles and dislocations are studied. To study the pinning forces of impurities in grain boundaries, active microrheology with optical tweezing is utilised. A model accounting for grain boundary deformation, contact angles between the impurity and grain boundary, and elastic response from the crystal is used to measure the pinning force on the impurity. An anomalously high depinning force is found, corresponding to the creation of a entity analogous to a dislocation. Next, the thermal fluctuations of a grain boundary between two pinned impurities are studied for different impurity spacings. The form of the fluctuations is dominated by the mode with a wavelength twice the impurity spacing. This spacing is also found to impact the mobility of the grain boundary and the mean-squared displacement. Finally, a binary system is placed on an angle to set up sedimentation-diffusion equilibrium. The particle sizes and materials are chosen to prevent fractionation. The structure of the system is found to be amorphous for all area fractions. The entire system for different tilt angles is found to be diffusive, with dynamics slowing down with a steeper tilt angle. The cause of the diffusive dynamics at all area fractions is found to be due to dynamic heterogeneities, which propagate from low to high densities, with higher tilt angles having a greater activation energy for this mechanism.

Published
2021

37. Not-so-adiabatic quantum computation for the shortest vector problem

Author

Joseph, David, Ghionis, Alexandros, Ling, Cong, and Mintert, Florian

Subjects
Quantum Physics
Abstract

Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proven to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyse the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems., Comment: 15 pages total, 9 figures, journal submission to Phys Rev Research v2, corrected two typos (save --> safe, relies --> relies on)

Published
2019
Full Text
View/download PDF

39. Validation of prediction models for radiation-induced late rectal bleeding: Evidence from a large pooled population of prostate cancer patients

Author

Cicchetti, Alessandro, Fiorino, Claudio, Ebert, Martin A., Iacovacci, Jacopo, Kennedy, Angel, Joseph, David J., Denham, James W., Vavassori, Vittorio, Fellin, Gianni, Cozzarini, Cesare, Esposti, Claudio Degli, Gabriele, Pietro, Munoz, Fernando, Avuzzi, Barbara, Valdagni, Riccardo, and Rancati, Tiziana

Published
2023
Full Text
View/download PDF

41. The Return of the SDitH

Author

Aguilar-Melchor, Carlos, primary, Gama, Nicolas, additional, Howe, James, additional, Hülsing, Andreas, additional, Joseph, David, additional, and Yue, Dongze, additional

Published
2023
Full Text
View/download PDF

44. Does lower extremity fracture fixation technique influence neurologic outcomes in patients with traumatic brain injury? The EAST Brain vs. Bone multicenter trial

Author

Ghneim, Mira, Kufera, Joseph, Zhang, Ashling, Penaloza-Villalobos, Liz, Swentek, Lourdes, Watras, Jill, Smith, Alison, Hahn, Alexandra, Rodriguez Mederos, Dalier, Dickhudt, Timothy John, Laverick, Paige, Cunningham, Kyle, Norwood, Scott, Fernandez, Luis, Jacobson, Lewis E., Williams, Jamie M., Lottenberg, Lawrence, Azar, Faris, Shillinglaw, William, Slivinski, Andrea, Nahmias, Jeffry, Donnelly, Megan, Bala, Miklosh, Egodage, Tanya, Zhu, Clara, Udekwu, Pascal O., Norton, Hannah, Dunn, Julie A., Baer, Robert, McBride, Katherine, Santos, Ariel P., Shrestha, Kripa, Metzner, Caleb J., Murphy, Jade M., Schroeppel, Thomas J., Stillman, Zachery, OʼConnor, Rick, Johnson, Dirk, Berry, Cherisse, Ratner, Molly, Reynolds, Jessica K., Humphrey, Mackenzie, Scott, Mark, Hickman, Zachary L., Twelker, Kate, Legister, Candice, Glass, Nina E., Siebenburgen, Christa, Palmer, Brandi, Semon, Gregory R., Lieser, Mark, McDonald, Hannah, Bugaev, Nikolay, LeClair, Madison J., Stein, Deborah, Ghneim, Mira, Kufera, Joseph, Zhang, Ashling, Stein, Deborah, Penaloza-Villalobos, Liz, Swentek, Lourdes, Luo-Owen, Xian, Watras, Jill, Smith, Alison, Mederos, Dalier Rodriguez, Laverick, Paige, Cunningham, Kyle, Norwood, Scott, Fernandez, Luis, Eagleton, Austin, Jacobson, Lewis E., Williams, Jamie M., Lottenberg, Lawrence, Azar, Faris, Benitiez, Ayla, Shillinglaw, William, Nahmias, Jeffry, Donnelly, Megan, Alvarez, Claudia, Bala, Miklosh, Egodage, Tanya, Zhu, Clara, Armento, Isabella, Norton, Hannah, Tann, Kimberly, Dunn, Julie A., Baer, Robert, Smoot, Brittany, McBride, Katherine, Santos, Ariel P., Shrestha, Kripa, Burton, Erin, Mentzer, Caleb J., Murphy, Jade M., Mack, TJ, Schroeppel, Thomas J., Stillman, Zachery, Decker, Cassandra, O’Connor, Rick, Maung, Adrian, Johnson, Dirk, Berry, Cherisse, Ratner, Molly, Shah, Noor, Berry, Cherisse, Reynolds, Jessica K., Humphrey, Mackenzie, Williams, D. Clayton, Scott, Mark, Hickman, Zachary L., Twelker, Kate, Joseph, David, Legister, Candice, Glass, Nina E., Siebenburgen, Christa, Palmer, Brandi, Semon, Gregory R., Lieser, Mark, McDonald, Hannah, Bugaev, Nikolay, LeClair, Madison J., and Tatar, Antony

Published
2023
Full Text
View/download PDF

45. FDA approval summary for lonafarnib (Zokinvy) for the treatment of Hutchinson-Gilford progeria syndrome and processing-deficient progeroid laminopathies

Author

Suzuki, Mari, Jeng, Linda J.B., Chefo, Solomon, Wang, Yan, Price, Dionne, Li, Xiaohui, Wang, Jie, Li, Ruo-Jing, Ma, Lian, Yang, Yuching, Zhang, Xinyuan, Zheng, Nan, Zhang, Ke, Joseph, David B., Shroff, Hitesh, Doan, Jenny, Pacanowski, Michael, Smpokou, Patroula, Donohue, Kathleen, and Joffe, Hylton V.

Published
2023
Full Text
View/download PDF

47. Parental abusiveness experienced in childhood and premarital sexual permissiveness during adolescence

Author

Karifala Marah, Antony Fute, Mohamed Oubibi, Binghai Sun, Amani Abisai Lyanga, Njaratiana Mario Arthur Velo, Jocelyne Zafitsara, and Joseph David Madasi

Subjects
Parental abusiveness, Adolescent, Sexual permissiveness, Dual-parents family, Single-parents family, Science (General), Q1-390, Social sciences (General), H1-99
Abstract

Objective: This study compared the experiences of parental abusiveness in childhood and sexual permissiveness in adolescence between adolescents raised by dual parents and those raised by single parents. Method: The sampling process involved obtaining the sample size (N = 1037) based on statistical power calculations and the resources available, resulting in representativeness. The sampling frame consisted of students from different backgrounds (single-parent and two-parent families). A stratified random sampling helped to enhance the reliability and validity of the findings while minimizing potential biases. An online survey was used to collect data from the sampled students. An independent sample t-test analysis was done by using SPSS software and PROCESS macro of the SPSS to test the hypotheses. Results: A significant and positive correlation was found between parental abusiveness and sexual permissiveness. There was also a significant mean difference in parental abusiveness experience and sexual permissiveness between adolescents from different family types. In addition, the average sexual permissiveness for males was higher than that of female adolescents from the same type of families. Conclusion: Childhood life significantly influences adolescents’ characters throughout their entire life.

Published
2023
Full Text
View/download PDF

49. Imaging of Light-Enhanced Extracellular Vesicle-Mediated Delivery of Oxaliplatin to Colorectal Cancer Cells via Laser Ablation, Inductively Coupled Plasma Mass Spectrometry

Author

Kara Chandler, Josh Millar, George Ward, Christopher Boyall, Tom White, Joseph David Ready, Rawan Maani, Keith Chapple, Robert Tempest, Joseph Brealey, Catherine Duckett, Sarah Haywood-Small, Simon Turega, and Nick Peake

Subjects
laser-ablation inductively coupled plasma mass spectrometry, extracellular vesicle, oxaliplatin, photosensitizers, colorectal cancer, Cytology, QH573-671
Abstract

Extracellular vesicles (EVs) are lipid bilayer structures released by all cells that mediate cell-to-cell communication via the transfer of bioactive cargo. Because of the natural origin of EVs, their efficient uptake by recipient cells, capacity to stabilize and transport biomolecules and their potential for cell/tissue targeting and preferential uptake by cancer cells, they have enormous potential for bioengineering into improved and targeted drug delivery systems. In this work, we investigated the use of laser ablation inductively coupled plasma mass spectrometry (LA-ICP-MS) as a tool to measure the loading of platinum-based chemotherapeutic agents. The EV loading of oxaliplatin via co-incubation was demonstrated, and LA-ICP-MS imaging showed greater efficiency of delivery to colorectal cancer cells compared to free oxaliplatin, leading to enhanced cytotoxic effect. Further, the impact of EV co-loading with a porphyrin (C5SHU, known as ‘C5’) photosensitizer on oxaliplatin delivery was assessed. Fluorescence analysis using nano-flow cytometry showed dose-dependent EV loading as well as a trend towards the loading of larger particles. Exposure of OXA-C5-EV-treated colorectal cancer cells to light indicated that delivery was enhanced by both light exposure and porphyrins, with a synergistic effect on cell viability observed between oxaliplatin, EVs and light exposure after the delivery of the co-loaded EVs. In summary, this work demonstrates the utility of LA-ICP-MS and mass spectrometry imaging in assessing the loading efficiency and cellular delivery of platinum-based therapeutics, which would also be suitable for agents containing other elements, confirms that EVs are more efficient at delivery compared to free drugs, and describes the use of light exposure in optimizing delivery and therapeutic effects of EV-mediated drug delivery both in combination and independently of porphyrin-based photosensitizers.

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results