2‐D/3‐D displays based on switchable lenticulars

Abstract— An attractive concept for 3‐D displays is the one based on LCDs equipped with lenticular lenses. This enables autostereoscopic multiview 3‐D displays without a loss in brightness. A general issue in multiview 3‐D displays is their relatively low spatial resolution because the pixels are divided among the different views. To overcome this problem, we have developed switchable displays, using liquid‐crystal (LC) filled switchable lenticulars. In this way, it is possible to have a high‐brightness 3‐D display capable of fully exploiting the native 2‐D resolution of the underlying LCD. The feasibility of LC‐filled switchable lenticulars was shown in several applications. For applications in which it is advantageous to be able to display 3‐D and 2‐D content simultaneously, a 42‐in. locally switchable prototype having a matrix electrode structure was developed. These displays were realized using cylindrically shaped lenticular lenses in contact with LC. An alternative for these are lenticulars based on gradient‐index (GRIN) LC lenses. Preliminary results for such switchable GRIN lenses are presented as well.     

On spiking neural P systems and partially blind counter machines

A k-output spiking neural P system (SNP) with output neurons, , generates a tuple of positive integers if, starting from the initial configuration, there is a sequence of steps such that during the computation, each O _i generates exactly two spikes aa (the times the pair aa are generated may be different for different output neurons) and the time interval between the first a and the second a is n _i . After the output neurons generate their pairs of spikes, the system eventually halts. We give characterizations of sets definable by partially blind multicounter machines in terms of k-output SNPs operating in a sequential mode. Slight variations of the models make them universal.     

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.     

Central electron temperature estimations of TJ-II neutral beam injection heated plasmas based on the soft x ray multi-foil technique

The core electron temperature (T(e0)) of neutral beam heated plasmas is determined in TJ-II stellarator by using soft x ray detectors with beryllium filters of different thickness, based on the method known as the foil absorption technique. T(e0) estimations are done with the impurity code IONEQ, making use of complementary information from the TJ-II soft x ray tomography and the VUV survey diagnostics. When considering the actual electron density and temperature profile shapes, an acceptable agreement is found with Thomson scattering measurements for 8 different magnetic configurations. The impact of the use of both neutral beam injectors on the T(e0) measurements is addressed. Also, the behaviour of T(e0) during spontaneous profile transitions is presented.     

Cognitive-Behavioral and Humanistic Group Treatment for Children With Learning Disabilities: A Comparison of Outcomes and Process.

The authors of this study examined the outcomes and processes of 2 types of group treatment--cognitive-behavioral treatment groups (CBTG) and humanistic group therapy (HGT)--offered to 200 elementary schoolchildren in a center for students with learning disabilities in Israel. Results indicated that the addition of either type of group treatment to individual academic assistance was more effective than the latter alone on most measures. In fact, on the majority of measures, group treatment without academic assistance was more effective than just individual assistance. Finally, HGT was more effective than CBTG on most measures. Most of the outcomes were sustained at follow-up, and some even increased from termination to follow-up, although effect sizes were quite low. Process measures included the Client Behavior System and the therapist Helping Skills System, which were measured at 5 points in time. Differences between the 2 treatment types were revealed on both process measures, including differences in the growth curve of these behaviors. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

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.     

Real-time animated stippling

We present an approach to produce animations of 3D models using stippling as a rendering style. Our technique ensures frame-to-frame coherence as the model moves and changes over time.