Using OGRO and CertiVeR to improve OCSP validation for Grids

Authentication and authorization in many distributed systems rely on the use of cryptographic credentials that in most of the cases have a defined lifetime. This feature mandates the use of mechanisms able to determine whether a particular credential can be trusted at a given moment. This process is commonly named validation. Among available validation mechanisms, the Online Certificate Status Protocol (OCSP) stands out due to its ability to carry near real time certificate status information. Despite its importance for security, OCSP faces considerable challenges in the computational Grid (i.e. Proxy Certificate’s validation) that are being studied at the Global Grid Forum’s CA Operations Work Group (CAOPS-WG). As members of this group, we have implemented an OCSP validation infrastructure for the Globus Toolkit 4, composed of the CertiVeR Validation Service and our Open GRid Ocsp (OGRO) client library, which introduced the Grid Validation Policy. This paper summarizes our experiences on that work and the results obtained up to now. Furthermore we introduce the prevalidation concept, a mechanism analogous to the Authorization Push-Model, capable of improving OCSP validation performance in Grids. This paper also reports the results obtained with OGRO’s prevalidation rules for Grid Services as a proof of concept.

Distance preserving flattening of surface sections

Curved cross-sections extracted from medical volume images are useful for analyzing nonplanar anatomic structures such as the aorta arch or the pelvis. For visualization and for performing distance measurements, extracted surface sections need to be adequately flattened. We present two different distance preserving surface flattening methods which preserve distances according to a user-specified center of interest and according to user-specified orientations. The first method flattens surface sections by preserving distances along surface curves located within planes having a user specified constant orientation. The second method flattens surfaces along curves located within radial planes crossing the center of interest. We study and compare the properties of the two flattening methods by analyzing their distortion maps. Thanks to a multiresolution approach, we provide surface flattening at interactive rates, allowing users to displace their focus point while visualizing the resulting flattened surface. These distance preserving flattening methods provide new means of inspecting curved cross-sections extracted from medical images.     

A note on the complexity of program evaluation

A simple problem concerning evaluation of programs is shown to be nonelementary recursive. The problem is the following: Given an input-free programP (i.e. all variables are initially 0) without nested loops using only instructions of the formx ← 1, x ← x + y, \(x \leftarrow x\dot - y\) ,do x... end, doesP output 0? This problem has time complexity \(2^{2^{ {\mathinner{\mkern2mu\raise1pt\hbox{.}\mkern2mu \raise4pt\hbox{.}\mkern2mu\raise7pt\hbox{.}\mkern1mu}} ^2 } } \) }cn-levels for some constantc. Other results are presented which show how the complexity of the 0-evaluation problem changes when the nonlooping instructions are varied. For example, it is shown that 0-evaluation is PSPACE-complete even for the case when the nonlooping instructions are onlyx ← x + 1,if x = 0then y ←y \(y \leftarrow y\dot - 1\) .     

On restricted one-counter machines

Let be the class of real-time nondeterministic one-counter machines whose counters make at mostone reversal. Let ₁ (respectively, ₂) be the subclass consisting of machines whose only nondeterministic move is in the choice of when to reverse the counter (respectively, when to start using the counter). ₁ and ₂ are among the simplest known classes of machines for which the universe problem has been shown undecidable. (The universe problem for a class of machines is the problem of deciding if an arbitrary machine in the class accepts all its inputs.) Here, we show that the classes of languages accepted by machines in ₁ and ₂ are incomparable. Moreover, the union of the language classes is properly contained in the class defined by . We also, briefly, look at the closure properties of these machines.This research was supported in part by NSF Grant MCS78-01736.     

Inflating examples to obtain rules

A new machine learning system is presented in this article. It is called INNER and induces classification rules from a set of training examples. The process followed by this system starts with the random selection of a subset of examples that are iteratively inflated in order to cover the surroundings provided that they are inhabited by examples of the same class, thus becoming rules that will be applied by means of a partial matching mechanism. The rules so obtained can be seen as clusters of examples and represent clear evidence to support explanations about their future classifications and may be used to build intelligent advisors. The whole algorithm can be seen as a set of elastic transformations of examples and rules and produces concise, accurate rule sets, as is experimentally demonstrated in the final section of the article. © 2003 Wiley Periodicals, Inc.     

The Biopolitics of Thirdspace: Urban Segregation and Resistance in Puerto Rico’s Luis Lloréns Torres Public Housing Project

The public housing programme in Puerto Rico was highly influenced by a culturally engrained logic of colonialism that aimed to achieve a behavioural transformation of the residents of public housing based on white “criollo” norms and conducts. To this day, the process of Othering with which these bodies are understood and viewed has recurrently been reproduced and redeployed utilizing the island’s old racial/colonial hierarchies. Criminality and drug-related activities are the main discursive agents employed to stigmatize the communities that live inside public housing in Puerto Rico. It is constantly inferred that most of its residents break with the behavioural norms that the rest of the population abides by. This argument is constantly utilized to perpetuate the cultural lens that views these sectors as lazy, unruly and dangerous. This highly prejudiced misconception justified the police occupations and the fences that were erected in and around public housing premises during the 1990s. However, most of these communities rarely view themselves as victims, and it is this paper’s argument that they are constantly and collectively enacting political and physical spaces of dissent, resistance and encounter that – however momentarily – are able to overturn some of these powerful ideological and spatial constructs.     

Shot boundary detection using Zernike moments in multi-GPU multi-CPU architectures

This paper presents an analysis of a Multi-GPU Multi-CPU environment, along with the different possible hybrid combinations. The analysis has been performed for a shot boundary detection application, based on Zernike moments, although it is general enough to be applied to many different application areas. A deep study of the performance, bottlenecks and design challenges is carried out showing the validity of this approach and achieving very high frame per second rates. In this paper, Zernike calculations are carried out on GPUs, taking advantage of a packing strategy proposed to minimize host-device communication time.     

Synthesis and applications of molybdenum (IV) oxide

Molybdenum dioxide (MoO₂) is a transition metal oxide with unusual metal-like electrical conductivity and high catalytic activity toward reforming hydrocarbons. This review covers the synthesis techniques used to fabricate MoO₂ in a variety of morphologies and particle sizes. Processing from molybdenum ore and reduction from MoO₃ are also covered, with emphasis on reduction mechanisms and kinetic considerations. Discussions of various solution-based and gas phase synthesis techniques shed light on strategies to achieve various unique morphologies, which leads into a brief discussion of nanoscale MoO₂. Nanoscale MoO₂ is of interest for important technological applications including catalysts for partial oxidation of hydrocarbons, solid oxide fuel cell anodes, and high-capacity reversible lithium ion battery anodes.     

Asymmetric Intermolecular Mizoroki-Heck Reaction: From Phosphine/Phosphinite-Nitrogen to Phosphite-Nitrogen Ligands

This review discusses the latest developments in ligand design for the Pd-catalyzed asymmetric intermolecular Mizoroki-Heck reaction, from the successful phosphine/phosphinite-nitrogen ligands to the recently reported phosphite-nitrogen ligands. The presence of a biaryl phosphite group offers several advantages as a ligand scaffold for this process.     

An online optimum voltage estimation and real‐time MPP tracking for a PV system

In this paper, a photovoltaic system topology incorporating a new maximum power point tracking (MPPT) controller method is presented. This method uses an autotuning estimator and a PI controller to make the system work in the maximum power point. The controller is formulated based on the bijectivity in the photovoltaic generator characteristic; therefore, if the optimal voltage is reached, this means that the maximum of power is obtained. The proposed MPPT algorithm is implemented on a dSpace DS1104 controller board. In order to demonstrate the efficiency of the proposed algorithm in real time, an experimental setup using a boost converter connected to a resistive load is successfully implemented and studied. The obtained experimental results prove the validity of the proposed MPPT algorithm.