919 resultados para open field


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Event report on the Open Access and Research 2013 conference which focused on recent developments and the strategic advantages they bring to the research sector.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The writing of award winning tartan noir author, Denise Mina, “crime queen of Glasgow” has been identified with “explicitly feminist politics,” and Mina herself claims, as a feminist, she wants to use crime fiction to present a “narrative about very disempowered people becoming empowered.” This paper explores how Mina’s avowed stance on feminism plays out in her novel, The Field of Blood (2005), and examines whether her concerns are reflected in the embodied actions of her young protagonist, would-be investigative journalist, Paddy Meehan. It asks whether Mina has succeeded in working against entrenched patriarchal codes of crime fiction’s dominant narrative construction or whether her feminist intentions have been undermined by traditional stereotypical conventions of the genre.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Disjoint top-view networked cameras are among the most commonly utilized networks in many applications. One of the open questions for these cameras' study is the computation of extrinsic parameters (positions and orientations), named extrinsic calibration or localization of cameras. Current approaches either rely on strict assumptions of the object motion for accurate results or fail to provide results of high accuracy without the requirement of the object motion. To address these shortcomings, we present a location-constrained maximum a posteriori (LMAP) approach by applying known locations in the surveillance area, some of which would be passed by the object opportunistically. The LMAP approach formulates the problem as a joint inference of the extrinsic parameters and object trajectory based on the cameras' observations and the known locations. In addition, a new task-oriented evaluation metric, named MABR (the Maximum value of All image points' Back-projected localization errors' L2 norms Relative to the area of field of view), is presented to assess the quality of the calibration results in an indoor object tracking context. Finally, results herein demonstrate the superior performance of the proposed method over the state-of-the-art algorithm based on the presented MABR and classical evaluation metric in simulations and real experiments.