Atomic computing

Technological progress comes from pushing hard at the limitsof what is currently possible, not from merely following trendsothers have set. In computing a good illustration of this principleis the life and work of the 19th century computer pioneer CharlesBabbage (1791-1870), who spent most of his adult life tryingto build a digital computer. Babbage first invented such a machinein 1834. He called it the Analytical Engine.     

Top-down proteomic analysis by MALDI-TOF profiling: Concentration-independent biomarkers

Although numerous protein biomarkers have been correlated with advanced disease states, no new clinical assays have been developed. Goals often anticipate disease-specific protein changes that exceed values among healthy individuals, a property common to acute phase reactants. This review considers somewhat different approaches. It focuses on intact protein isoform ratios that present a biomarker without change in the total concentration of the protein. These will seldom be detected by peptide level analysis or by most antibody-based assays. For example, application of an inexpensive method to large sample groups resulted in observation of several polymorphisms, including the first structural polymorphism of apolipoprotein C1. Isoform distribution of this protein was altered and was eventually linked to increased obesity. Numerous other protein isoforms included C- and N-terminal proteolysis, changes of glycoisoform ratios and certain types of sulfhydryl oxidation. While many of these gave excellent statistical correlation with advanced disease, clinical utility was not apparent. More important may be that protein isoform ratios were very stable in each individual. Diagnosis by longitudinal analysis of the same individual might increase sensitivity of protein biomarkers by 20-fold or more. Protein changes that exceed the range of values found among healthy individuals may be uncommon.     

Visual lobe shape and search performance for targets of different difficulty

In quantitative models of visual search it has usually been assumed that visual lobe area shape was sufficiently regular to be approximated by a circle or ellipse. However, the irregularities in visual lobe shapes that have been found in studies involving extensive lobe mapping have suggested that lobe shape may have important implications for visual search performance and for the accuracy of mathematical models used for performance prediction. However, no systematic research on the relationship between the shape aspect of visual lobes and search performance seems to have been carried out and no comparisons of visual lobe shape characteristics under the effect of target difficulty have been reported. The current study was conducted to achieve two major objectives in two experiments. Experiment 1 used two different targets (letter 'O' and letter 'Y') to map the visual lobes of subjects in order to provide a systematic and quantitative comparison of lobe shape characteristics and experiment 2 was to investigate the correlation of visual lobe shape characteristics with visual search time under the effect of target difficulty. The visual lobes of 28 subjects were mapped on 24 imaginary and regularly spaced meridians originating from the centre of the visual field to resemble the full field mapping situation. Five categories of shape indices, viz. roundness, boundary smoothness, symmetry, elongation and shape regularity were investigated. The results of this study demonstrated that the visual lobe shapes of subjects elongate horizontally with medium level of roundness, high levels of boundary smoothness, symmetry and regularity for an easy target (O) against a homogeneous background of 'X's. When a difficult target (Y) was used, the visual lobes of the subjects were still elongated horizontally but to a smaller extent and with a low level of roundness, medium level of boundary smoothness and regularity and a similar high level of symmetry to the easy target. Moreover, significant correlations between shape indices and visual search time were found, suggesting mathematical models for predicting search time should not merely rely on area but also should consider visual lobe shape indices. Finally, a universal mathematical model containing several visual lobe shape indices was developed, which was applicable in the prediction of visual search time for a range of similar search tasks.     

Detecting change-points in Markov chains

Markov chains provide a flexible model for dependent random variables with applications in such disciplines as physics, environmental science and economics. In the applied study of Markov chains, it may be of interest to assess whether the transition probability matrix changes during an observed realization of the process. If such changes occur, it would be of interest to estimate the transitions where the changes take place and the probability transition matrix before and after each change. For the case when the number of changes is known, standard likelihood theory is developed to address this problem. The bootstrap is used to aid in the computation of p-values. When the number of changes is unknown, the AIC and BIC measures are used for model selection. The proposed methods are studied empirically and are applied to example sets of data.     

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₄.