6,432 research outputs found
Recommended from our members
The IAAF’s hyperandrogenism regulations suspended
No full textOn 27 July, the Court of Arbitration for Sport (‘CAS’) delivered a landmark ruling on the regulation of gender in sport. The decision explores how the categorisation of sport on the basis of sex can be best reconciled with the “biological reality” that human sex cannot necessarily be divided so clearly. Dr. Seema Patel, Senior Lecturer at Nottingham Trent University, Deputy Director of the Centre for Sports Law and author of ‘Inclusion and Exclusion in Competitive Sport: Socio-Legal and Regulatory Perspectives,’ reviews the case and suggests that sport regulation must be cautious of traditional criteria to determine eligibility in sports
Author interview: Q and A with Dr Ian Sanjay Patel on we’re here because you were there: immigration and the end of empire
No full textIn this author interview, we speak to Dr Ian Sanjay Patel about his new book, We’re Here Because You Were There: Immigration and the End of Empire, which explores post-war immigration laws, the afterlives of British imperial citizenship and related attempts to reimagine and rejuvenate British imperialism after 1945. Contributing to transnational histories of decolonisation, the book also explores the interconnections between human rights, post-war migration and international diplomacy. Author Interview with Dr Ian Sanjay Patel, author of We’re Here Because You Were There: Immigration and the End of Empire. Verso. 2021
Embedded in the Body: the Poetry, History and Politics of Migritude with Shailja Patel (2021-02-25)
No full textOnline discussion, reading and Q&A; Thursday, February 25 at 4:00PM CST; Shailja Patel is the bestselling author of Migritude, taught in over 100 colleges and universities worldwide. Patel's poems have been translated into 17 languages, and been featured in the Smithsonian. The Nobel Women's Initiative honored her with a Global Feminist Spotlight. She is currently a Research Associate at Five College Women's Studies Research Center.Women, Gender & Sexuality Studies program; Alworth Institute for International Studies; Department of Anthropology, Sociology & Criminology; English program; Writing Studies programPatel, Shailja. (2021). Embedded in the Body: the Poetry, History and Politics of Migritude with Shailja Patel (2021-02-25). Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/220654
The Patel trials: further evidence of the need to reform the Griffith Codes
No full textThis article argues that the two trials of Dr Jayant Patel for criminal medical negligence under s 288 of the Criminal Code 1899 Act (Qld) highlight the inadequacies of the duty provisions in the Griffith Codes of Queensland and Western Australia. The difficulties with these duty provisions extend beyond causation and go to the heart of the construction of the Griffith Codes. The fundamental problem lies in the wording of s 23 of both the Queensland and
the Western Australia Codes, the principal section dealing with criminal responsibility, which allows a prosecution for criminal negligence under two alternative routes with different standards of proof, and the importation of
common law criminal negligence into the duty provisions in the absence of a specified fault element in the relevant Code sections. It is further contended that other criminal law jurisdictions in Australia, such as the Criminal Code
1995 (Cth), offer a better model for the prosecution of criminal negligence cases that flow from breach of a specified duty. The article has greatly benefited from comments provided to the author by Justice HG Fryberg, who
conducted the second Patel trial
PanORAMa: Oblivious RAM with Logarithmic Overhead
No full textWe present PanORAMa, the first Oblivious RAM construction that achieves communication overhead for a database of blocks and for any block size while requiring client memory of only a constant number of memory blocks. Our scheme can be instantiated in the ``balls and bins model in which Goldreich and Ostrovsky [JACM 96] showed an lower bound for ORAM communication.
Our construction follows the hierarchical approach to ORAM design and relies on two main building blocks of independent interest: a \emph{new oblivious hash table construction} with improved amortized communication overhead for security parameter and , assuming its input is randomly shuffled; and a complementary \emph{new oblivious random multi-array shuffle construction}, which shuffles blocks of data with communication when the input has a certain level of entropy. We combine these two primitives to improve the shuffle time in our hierarchical ORAM construction by avoiding heavy oblivious shuffles and leveraging entropy remaining in the merged levels from previous shuffles. As a result, the amortized shuffle cost is asymptotically the same as the lookup complexity in our construction
CacheShuffle: A Family of Oblivious Shuffles
No full textWe consider oblivious two-party protocols where a client outsources N blocks of private data to a server. The client wishes to access the data to perform operations in such a way that the access pattern does not leak information about the data and the operations. In this context, we consider oblivious shuffling with a focus on bandwidth efficient protocols for clients with small local memory. In the shuffling problem, the N outsourced blocks, B_1,...,B_N, are stored on the server according to an initial permutation pi. The client wishes to reshuffle the blocks according to permutation sigma. Oblivious shuffling is a building block in several applications that hide patterns of data access. In this paper, we introduce a generalization of the oblivious shuffling problem, the K-oblivious shuffling problem, and provide bandwidth efficient algorithms for a wide range of client storage requirements. The task of a K-oblivious shuffling algorithm is to shuffle N encrypted blocks that were previously randomly allocated on the server in such a way that an adversarial server learns nothing about either the new allocation of blocks or the block contents. The security guarantee must hold when an adversary has partial information on the initial placement of a subset of K <=N revealed blocks. The notion of oblivious shuffling is obtained for K=N.
We first study the N-oblivious shuffling problem and start by presenting CacheShuffleRoot, that is tailored for clients with O(sqrt{N}) blocks of memory and uses approximately 4N blocks of bandwidth. CacheShuffleRoot is a 4x improvement over the previous best known N-oblivious shuffle for practical sizes of N. We then generalize CacheShuffleRoot to CacheShuffle that can be instantiated for any client memory size S and requires O(N log_S N) blocks of bandwidth. Next, we present K-oblivious shuffling algorithms that require 2N + f(K,S) blocks of bandwidth for all K and a wide range of S. Any extra bandwidth above the 2N lower bound depends solely on K and S. Specifically, for clients with O(K) blocks of memory, we present KCacheShuffleBasic that uses exactly 2N blocks of bandwidth. For clients with memory S <= K, we present KCacheShuffle, that requires 2N + O(K log_S K) blocks of bandwidth. Finally, motivated by applications to ORAMs, we consider the case where the server stores D dummy blocks whose contents are irrelevant in addition to the N real blocks. For this case, we design algorithm KCacheShuffleDummy that shuffles N+D blocks with K revealed blocks using O(K) blocks of client storage and approximately D+2N blocks of bandwidth
dc121p-patel
No full textAbstract Researchers have used machine learning algorithms to solve hard problems in a variety of domains, enabling exciting, new applications of computing. However, research results have not transferred to software solutions. In part, this is because developing software with machine learning algorithms is itself difficult. My dissertation work aims to understand why using machine learning is difficult and to create tools that lower the bar so that more developers can effectively use machine learning
- …
