A Demonstration of High-Throughput Electrophoresis

Automating electrophoresis significantly reduces the time required for loading a large number of samples, increases the speed of electrophoresis analysis, and maximizes the resolution power (clear separation of fragments) of this technique. In addition, automation increases the precision of electrophoresis analysis. Here we demonstrate an automated, high-throughput method of loading 96 samples simultaneously onto an electrophoresis gel, using the Apogent Discoveries Tango™ system and the Invitrogen™ E-Gel® 96 system.     

In-band amplified spontaneous emission noise filtering with adispersion-imbalanced nonlinear loop mirror

This paper reports the removal of in-band amplified spontaneous emission (ASE) noise in a 10 Gb/s noise-loaded return-to-zero (RZ) signal using a dispersion-imbalanced loop mirror. The resulting receiver sensitivity is improved from -37.0 dBm to -37.7 dBm. The dependence of receiver sensitivity on the loop mirror bias is also investigated, and the optimal bias point is found to be where the loop transmissivity decreases with increasing input power     

Guidance of eye movements during conjunctive visual search: The distractor-ratio effect.

The distractor-ratio effect refers to the finding that search performance in a conjunctive visual search task depends on the relative frequency of two types or subsets of distractors when the total number of items in a display is fixed. Previously, Shen, Reingold, and Pomplun (2000) examined participants' patterns of eye movements in a distractor-ratio paradigm and demonstrated that on any given trial saccadic endpoints were biased towards the smaller subset of distractors and participants flexibly switched between different subsets across trials. The current study explored the boundary conditions of this tendency to flexibly search through a smaller subset of distractors by examining the influence of several manipulations known to modulate search efficiency, including stimulus discriminability (Experiment 1), within-dimension versus cross-dimension conjunction search and distractor heterogeneity (Experiment 2). The results indicated that the flexibility of visual guidance and saccadic bias exemplified by the distractor-ratio effect is a robust phenomenon that mediates search efficiency by adapting to changes in the relative informativeness of stimulus dimensions and features. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm

An interactive proof system is calledperfect zero-knowledge if the probability distribution generated by any probabilistic polynomial-time verifier interacting with the prover on input theoremϕ, can be generated by another probabilistic polynomial-time machine which only getsϕ as input (and interacts with nobody!). In this paper we present aperfect zero-knowledge proof system for a decision problem which is computationally equivalent to the Discrete Logarithm Problem. Doing so we provide additional evidence to the belief thatperfect zero-knowledge proof systems exist in a nontrivial manner (i.e., for languages not inBPP). Our results extend to the logarithm problem in any finite Abelian group. This research was partially supported by the Fund for Basic Research Administered by the Israeli Academy of Sciences and Humanities. An early version of this paper appeared inAdvances in Cryptology —Crypto 88 (Proceedings), S. Goldwasser (ed.), pp. 57–70, Lecture Notes in Computer Science, vol. 403, Springer-Verlag, Berlin, 1990.     

Time course of phonological activation during reading: Evidence from eye fixations.

Eye fixation data suggest that readers use orthographic codes rather than phonological codes to activate word meanings. Whereas proofreading data show that readers are less likely to detect homophonic errors (e.g., He was in his silk stocking feat) than nonhomophonic errors (e.g., He was in his silk stocking fate), the eye fixations revealed that readers initially experienced as much difficulty encountering a homophonic error as a nonhomophonic one. However, homophony facilitated the recovery process, thus suggesting that phonology has its influence after lexical access. Exp 1 showed that the findings were consistent whether the error was the lower frequency homophone (stocking feat) or the higher frequency homophone (feet of courage). Exp 2 showed that proofreading responses are unreliable indices of error detection because even when readers fail to make an overt error detection response, their eye fixations reveal that they have detected the error. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A community-oriented programme for rehabilitation of persons with arthritis

A community-oriented programme for rehabilitation of persons with arthritis is described. It combines an 8-week ambulatory rehabilitation course (including patient education) at a rehabilitation institution, with long-term self-rehabilitation (at patients' homes), supervised by primary-care nurses. Sixty persons (mean age 54; 80% females) with a 13-year average duration of arthritis, were suffering pain, physical limitations, difficulties in social activities, tension and a tendency to depression. They had completed the course and a 12-month self-rehabilitation at home, and were assessed with the Arthritis Impact Measurement Scales (AIMS) questionnaire on admission to the course, at its completion and 1 year thereafter. Assessment upon completion of the course showed improvement in all areas studied. Measurements at follow-up showed that the majority carried out self-rehabilitation activities and preserved the improved functional status. The programme provided a much-needed service to arthritis sufferers living in the community, and promoted both the reorientation of institution-based rehabilitation professionals towards the community and self-rehabilitation and the cooperation between the institution and primary care.     

On Learning Visual Concepts and DNF Formulae

We consider the problem of learning DNF formulae in the mistake-bound and the PAC models. We develop a new approach, which is called polynomial explainability, that is shown to be useful for learning some new subclasses of DNF (and CNF) formulae that were not known to be learnable before. Unlike previous learnability results for DNF (and CNF) formulae, these subclasses are not limited in the number of terms or in the number of variables per term; yet, they contain the subclasses of k-DNF and k-term-DNF (and the corresponding classes of CNF) as special cases. We apply our DNF results to the problem of learning visual concepts and obtain learning algorithms for several natural subclasses of visual concepts that appear to have no natural boolean counterpart. On the other hand, we show that learning some other natural subclasses of visual concepts is as hard as learning the class of all DNF formulae. We also consider the robustness of these results under various types of noise.An earlier version of this paper appeared in the Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory, COLT93.Current address: Department of Computer Science, Technion, Israel. e-mail:eyalk@cs.technion.ac.il     

Cryptographic Hash Functions from Expander Graphs

We propose constructing provable collision resistant hash functions from expander graphs in which finding cycles is hard. As examples, we investigate two specific families of optimal expander graphs for provable collision resistant hash function constructions: the families of Ramanujan graphs constructed by Lubotzky-Phillips-Sarnak and Pizer respectively. When the hash function is constructed from one of Pizer’s Ramanujan graphs, (the set of supersingular elliptic curves over with ℓ-isogenies, ℓ a prime different from p), then collision resistance follows from hardness of computing isogenies between supersingular elliptic curves. For the LPS graphs, the underlying hard problem is a representation problem in group theory. Constructing our hash functions from optimal expander graphs implies that the outputs closely approximate the uniform distribution. This property is useful for arguing that the output is indistinguishable from random sequences of bits. We estimate the cost per bit to compute these hash functions, and we implement our hash function for several members of the Pizer and LPS graph families and give actual timings.     

Antioxidant activity of 1,3-dicaffeoylquinic acid isolated from Inula viscosa

Inula viscosa is a perennial herbaceous plant used topically in folk medicine as an anti-scabies, anti-inflammatory, and wound-healing agent. We examined the antioxidant activity of the methanolic extract of I. viscosa. We isolated and identified several polyphenolic antioxidants from I. viscosa leaves and focused on 1,3-dicaffeoylquinic acid (1,3-diCQA). Antioxidant activity was measured using ABTS and DPPH assays, which measure antioxidant activity. The concentrations of 1,3-diCQA required for the inhibition of oxidation were lower than those required by other known antioxidants. 1,3-diCQA inhibited oxidative damage caused by various factors, including FeSO₄ and AAPH (2,2′-azobis(2-amidinopropane) dehydrochloride). Antioxidant activity can also be detected by the ability of a compound to scavenge reactive oxygen species (ROS). 1,3-diCQA was found to scavenge hydroxyl radical and superoxide radicals, as measured by electron spin resonance (ESR). These data demonstrate that 1,3-diCQA exhibits antioxidant properties, probably through the involvement of a direct scavenging effect on several free radicals.