1,721,029 research outputs found
Experimental investigation into the influence of a keying flap on the keying behaviour of plate anchors
No full textPlate anchors are used in deep and ultra-deep waters to anchor floating offshore structures. Once installed vertically under the seabed with the aid of a suction follower they must be rotated or "keyed" in order to mobilize full anchor capacity. A keying flap attached to the top of the anchor is commonly used, aiming at reducing the vertical translation component of the installation path during keying, although its efficiency appears to be uncertain. To quantify the performance of this keying flap and to understand its mechanism, centrifuge tests were performed on an anchor model, using Particle Image Velocimetry (PIV) to monitor the trajectory of the anchor and the behaviour of the keying flap through examination of the soil failure mechanism upon keying. Results indicated that the keying flap did not affect the anchor trajectory, except by introducing an offset to the loading.</p
Continuously non-malleable codes with split-state refresh
Full text linkNon-malleable codes for the split-state model allow to encode a message into two parts, such that arbitrary independent tampering on each part, and subsequent decoding of the corresponding modified codeword, yields either the same as the original message, or a completely unrelated value. Continuously non-malleable codes further allow to tolerate an unbounded (polynomial) number of tampering attempts, until a decoding error happens. The drawback is that, after an error happens, the system must self-destruct and stop working, otherwise generic attacks become possible. In this paper we propose a solution to this limitation, by leveraging a split-state refreshing procedure. Namely, whenever a decoding error happens, the two parts of an encoding can be locally refreshed (i.e., without any interaction), which allows to avoid the self-destruct mechanism. An additional feature of our security model is that it captures directly security against continual leakage attacks. We give an abstract framework for building such codes in the common reference string model, and provide a concrete instantiation based on the external Diffie-Hellman assumption. Finally, we explore applications in which our notion turns out to be essential. The first application is a signature scheme tolerating an arbitrary polynomial number of split-state tampering attempts, without requiring a self-destruct capability, and in a model where refreshing of the memory happens only after an invalid output is produced. This circumvents an impossibility result from a recent work by Fuijisaki and Xagawa (Asiacrypt 2016). The second application is a compiler for tamper-resilient RAM programs. In comparison to other tamper-resilient compilers, ours has several advantages, among which the fact that, for the first time, it does not rely on the self-destruct feature
The mother of all leakages: How to simulate noisy leakages via bounded leakage (almost) for free
No full textThe mother of all leakages: How to simulate noisy leakages via bounded leakage (almost) for free
No full text
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Women in Technology: Why are Undergraduate Women Underrepresented in the field of Information Technology
Full text linkThe University of Nevada, Reno Libraries will promptly respond to removal requests related to content that violates intellectual property laws, data protections, or has been uploaded without creator consent. Takedown notices should be directed to our ScholarWolf team ([email protected]) with information about the object, including its full URL and the nature of your complaint.Technology in modern society is booming. Products encompassing everything from recreational applications to vocational enterprise/executive software are becoming more integrative and omnipresent in their use. In order to meet increasing demand, the technology workforce has also increased its pace, both in development and employment. As the need for more professionals has grown, so has the gender gap between men and women working in Information Technology. This thesis will seek to explore the reasons why, despite the relevance and increasing number of jobs in the technology workforce, there are relatively few women employed in information systems and computer science related fields
Functional Credentials
No full textAbstractA functional credential allows a user to anonymously prove possession of a set of attributes that fulfills a certain policy. The policies are arbitrary polynomially computable predicates that are evaluated over arbitrary attributes. The key feature of this primitive is the delegation of verification to third parties, called designated verifiers. The delegation protects theprivacy of the policy: A designated verifier can verify that a user satisfies a certain policy without learning anything about the policy itself. We illustrate the usefulness of this property in different applications, including outsourced databases with access control. We present a new framework to construct functional credentials that does not require (non-interactive) zero-knowledge proofs. This is important in settings where the statements are complex and thus the resulting zero-knowledge proofs are not efficient. Our construction is based on any predicate encryption scheme and the security relies on standard assumptions. A complexity analysis and an experimental evaluation confirm the practicality of our approach.</jats:p
- …
