The Case of Richard Tomlinson: The Spy Who E-mailed Me

This article considers the issues raised by the Richard Tomlinson affair. The authors discuss the following implications: First, the effective regulation and control of the Intelligence Services, concentrating upon the terms of Official Secrets legislation. Second, adequate legal safeguards for the internet. The authors discuss, inter alia , the problems of jurisdictional control, international regulation and technical possibilities for control. Finally, the authors assess the impact of the United Kingdom Government's proposals for a Freedom of Information Act and their impact upon the internet and the Intelligence Services. The authors contend that the Official Secrets Act 1989 is still in need of reform, regulation of the internet requires a paradigm shift in attitude, from all concerned and that the proposed Freedom of Information Bill requires overhauling.     

Characterizations of reduction classes modulo oracle conditions

It is known that nondeterministic polynomial time truth-table reducibility is exactly the same as nondeterministic polynomial time Turing reducibility. Here we study the standard nondeterministic reducibilities (conjunctive, bounded truth-table, bounded positive truth-table, and many-one) and show that each is a restriction of nondeterministic polynomial time Turing reducibility corresponding to acceptance modulo a set of oracle conditions. Then we show that the reduction classes of these reducibilities are classes of formal languages and as such have language theoretic characterization theorems. The same program is carried out for polynomial space.This research was supported in part by the National Science Foundation under Grants MCS77-23493, MSC80-11979, MCS81-20263, and MCS83-12472. The work of the second author was also supported by the United States-Israel Educational Foundation (Fulbright Award).     

Passivation of pyrite due to surface treatment

Two samples of naturally occurring pyrite were treated with acetyl acetone, silanes, humic acids, lignin-NaOH mixture, and oxalic acid. The corrosion rate of pyrite was observed to decrease significantly due to the surface treatment by the chemicals used in this study. Surface characterization methods indicate that phenyl triacetoxy silane forms a passive coating a few Angstroms thick on the pyrite, thus preventing its dissolution in 1M H₂SO₄.     

Dynamical synapses enhance neural information processing: gracefulness, accuracy, and mobility

Experimental data have revealed that neuronal connection efficacy exhibits two forms of short-term plasticity: short-term depression (STD) and short-term facilitation (STF). They have time constants residing between fast neural signaling and rapid learning and may serve as substrates for neural systems manipulating temporal information on relevant timescales. This study investigates the impact of STD and STF on the dynamics of continuous attractor neural networks and their potential roles in neural information processing. We find that STD endows the network with slow-decaying plateau behaviors: the network that is initially being stimulated to an active state decays to a silent state very slowly on the timescale of STD rather than on that of neuralsignaling. This provides a mechanism for neural systems to hold sensory memory easily and shut off persistent activities gracefully. With STF, we find that the network can hold a memory trace of external inputs in the facilitated neuronal interactions, which provides a way to stabilize the network response to noisy inputs, leading to improved accuracy in population decoding. Furthermore, we find that STD increases the mobility of the network states. The increased mobility enhances the tracking performance of the network in response to time-varying stimuli, leading to anticipative neural responses. In general, we find that STD and STP tend to have opposite effects on network dynamics and complementary computational advantages, suggesting that the brain may employ a strategy of weighting them differentially depending on the computational purpose.     

Recursive segmentation and recognition templates for image parsing

In this paper, we propose a Hierarchical Image Model (HIM) which parses images to perform segmentation and object recognition. The HIM represents the image recursively by segmentation and recognition templates at multiple levels of the hierarchy. This has advantages for representation, inference, and learning. First, the HIM has a coarse-to-fine representation which is capable of capturing long-range dependency and exploiting different levels of contextual information (similar to how natural language models represent sentence structure in terms of hierarchical representations such as verb and noun phrases). Second, the structure of the HIM allows us to design a rapid inference algorithm, based on dynamic programming, which yields the first polynomial time algorithm for image labeling. Third, we learn the HIM efficiently using machine learning methods from a labeled data set. We demonstrate that the HIM is comparable with the state-of-the-art methods by evaluation on the challenging public MSRC and PASCAL VOC 2007 image data sets.     

Skinner's dark year and Walden Two..

Points out that although it was offered simply as a fictional application of radical behaviorism to the design of society, Skinner's utopian novel Walden Two possessed strong emotional connotations for him. The "dark year," a period during his youth when he failed as a creative writer, displayed many earmarks of a major identity crisis. Walden Two was written during a mid-life crisis when identity issues again became highly salient for Skinner. The novel incorporated issues from both periods into its picture of an ideal society and helped him to resolve his developmental conflicts. He emerged with a restructured identity as public advocate for a behavioristic science of human conduct. (18 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Cumulating Retrieval Inhibition in Semantic and Lexical Domains.

In 3 experiments the authors examined changes in successive exemplar generation percentages within categories defined semantically (e.g., fruit-P, fruit-A, fruit-M) and by 1st letter (e.g., insect-C, sport-C, car-C), with a mixed control condition (e.g., fruit-P, insect-C, disease-M). Retrieval success declined across 12 successive items in both semantic and letter categories, with no change for the mixed condition. This retrieval inhibition is unrelated to taxonomic frequency of exemplars within either letter or semantic categorical structures. Furthermore, semantic retrieval inhibition appears to be long lasting, suggested by the decline in retrieval percentage across successive 12-item blocks in both the mixed and letter conditions. The authors suggest that different mechanisms underlie the inhibition found in the semantic (suppression) and letter (interference) conditions. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Redux: A Dynamic Dataflow Tracer

Redux is a tool that generates dynamic dataflow graphs. It generates these graphs by tracing a program's execution and recording every value-producing operation that takes place, building up a complete computational history of every value produced. For that execution, by considering the parts of the graph reachable from system call inputs, we can choose to see only the dataflow that affects the outside world. Redux works with program binaries, and thus is not restricted to programs written in any particular language.We explain how Redux works, and show how dynamic dataflow graphs give the essence of a program's computation. We show how Redux can be used for debugging and program slicing, and consider a range of other possible uses.     

Typing correspondence assertions for communication protocols

Woo and Lam propose correspondence assertions for specifying authenticity properties of security protocols. Prior work on checking correspondence assertions depends on model-checking and is limited to finite-state systems. We propose a dependent type and effect system for checking correspondence assertions. Since it is based on type-checking, our method is not limited to finite-state systems. This paper presents our system in the simple and general setting of the π-calculus. We show how to type-check correctness properties of example communication protocols based on secure channels. In a related paper, we extend our system to the more complex and specific setting of checking cryptographic protocols based on encrypted messages sent over insecure channels.