13538048
Error Free Self-assembly Using Error Prone Tiles
DNA self-assembly is emerging as a key paradigm for nano-technology, nano-computation, and several related disciplines. In nature, DNA self-assembly is often equipped with explicit mechanisms for both error prevention and error correction. For artificial self-assembly, these problems are even more important since we are interested in assembling large systems with great precision. 
 
We present an error-correction scheme, called snaked proof-reading, which can correct both growth and nucleation errors in a self-assembling system. This builds upon an earlier construction of Winfree and Bekbolatov [11], which could correct a limited class of growth errors. Like their construction, our system also replaces each tile in the system by a k × k block of tiles, and does not require changing the basic tile assembly model proposed by Rothemund and Winfree [8]. 
 
We perform a theoretical analysis of our system under fairly general assumptions: tiles can both attach and fall off depending on the thermodynamic rate parameters which also govern the error rate. We prove that with appropriate values of the block size, a seed row of n tiles can be extended into an n × n square of tiles without errors in expected time $\widetilde{O}(n)$, and further, this square remains stable for an expected time of $\widetilde{\Omega}(n)$. This is the first error-correction system for DNA self-assembly that has provably good assembly time (close to linear) and provable error-correction. The assembly time is thesame, up to logarithmic factors, as the time for an irreversible, error-free assembly. 
 
We also did a preliminary simulation study of our scheme. In simulations, our scheme performs much better (in terms of error-correction) than the earlier scheme of Winfree and Bekbolatov, and also much better than the unaltered tile system. 
 
Our basic construction (and analysis) applies to all rectilinear tile systems (where growth happens from south to north and west to east). These systems include the Sierpinski tile system, the square-completion tile system, and the block cellular automata for simulating Turing machines. It also applies to counters, a basic primitive in many self-assembly constructions and computations.
20735579
Kinetically stable task assignment for networks of microservers
• Job titles for all employees • Most recent payroll data (wages, hours, job codes, and dates of hire) • Union contracts • Employee handbooks or benefit descriptions • Summary plan descriptions for health and retirement plans • Benefit costs summaries or insurance bills For a detailed listing of information that BLS economists typically request, please visit the National Compensation Survey Web site at http://www.bls.gov/ncs/collection.htm. What is the National Compensation Survey (NCS)?
15293705
Design and evaluation of a multi-agent collaborative Web mining system
Most existing Web search tools work only with individual users and do not help a user benefit from previous search experiences of others. In this paper, we present the Collaborative Spider, a multi-agent system designed to provide post-retrieval analysis and enable across-user collaboration in Web search and mining. This system allows the user to annotate search sessions and share them with other users. We also report a user study designed to evaluate the effectiveness of this system. Our experimental findings show that subjects' search performance was degraded, compared to individual search scenarios in which users had no access to previous searches, when they had access to a limited number (e.g., 1 or 2) of earlier search sessions done by other users. However, search performance improved significantly when subjects had access to more search sessions. This indicates that gain from collaboration through collaborative Web searching and analysis does not outweigh the overhead of browsing and comprehending other users' past searches until a certain number of shared sessions have been reached. In this paper, we also catalog and analyze several different types of user collaboration behavior observed in the context of Web mining.
26701472
Interface descriptions for enterprise architecture
This paper describes our experiences in implementing a repository-based system that records and manages architectural information for an organization-wide set of enterprise information systems. The system is called Interface Descriptions for Enterprise Architecture (IDEA). The IDEA system business case and system creation are discussed, and the use of the system is exemplified by applying it to a set of information systems within a large corporation. We show how the existence of a managed enterprise architecture description enables an important set of analyses: risk analyses, architecture analyses, and change management analyses. Finally, we discuss how the IDEA system has the potential to catalyze even more profound change by changing how the various systems' stakeholders interact.
33677672
A Study of Hybrid Neural Network Approaches and the Effects of Missing Data on Traffic Forecasting
In this paper we present an application of hybrid neural network approaches and an assessment of the effects of missing data on motorway traffic flow forecasting. Two hybrid approaches are developed using a Self-Organising Map (SOM) to initially classify traffic into different states. The first hybrid approach includes four Auto-Regressive Integrated Moving Average (ARIMA) models, whilst the second uses two Multi-Layer Perception (MLP) models. It was found that the SOM/ARIMA hybrid approach out-performs all individual ARIMA models, whilst the SOM/MLP hybrid approach achieves superior forecasting performance to all models used in this study, including three naïve models. The effects of different proportions of missing data on Neural Network (NN) performance when forecasting traffic flow are assessed and several initial substitution options to replace missing data are discussed. Over-all, it is shown that ARIMA models are more sensitive to the percentage of missing data than neural networks in this context.
5510684
Robust motion-based image segmentation using fusion
To support real-time tracking of objects in video sequences, there has been considerable effort directed at developing optical flow and general motion-based image segmentation algorithms. The goal is to segment multiple moving objects in the image based on their relative motion. This task can be complicated by the presence of lighting variations. Furthermore, a combination of multiple motions and complex lighting effects can lead to dramatic image variations that may not be adequately accounted for by a single motion-based segmentation algorithm. We propose to fuse the results of multiple motion segmentation algorithms to improve the system robustness. Our approach uses the expectation maximization (EM) algorithm as a fusion engine. It also uses principal components analysis (PCA) to perform dimensionality reduction to improve the performance of the EM algorithm and reduce the processing burden. The performance of the proposed fusion algorithm has been demonstrated in the "smart airbag" application of monitoring occupants in a moving automobile to determine if they are too close to the instrument panel (airbag). Through fusion of the outputs of multiple algorithms we are able to reduce the percentage of pixels missed on the target by 35.
14259579
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information losing. In this paper, we propose a new classification methodology, called fault tolerance XCS in integer (FTXI), by extending XCS to handle conditions in integers and integrating the mechanism of fault tolerance in the context of data mining into the framework of XCS. We also design and generate appropriate artificial data sets for examining and verifying the proposed method. Our experiments indicate that FTXI can provide the least rule number, obtain high prediction accuracy, and offer rule readability, compared to C4.5 and XCS in integer without fault tolerance.