6008889
Frequency Distribution of TATA Box and Extension Sequences on Human Promoters
TATA box is one of the most important transcription factor binding sites. But the exact sequences of TATA box are still not very clear yet. In this study, we conducted a dedicated analysis on the frequency distribution of TATA Box and its extension sequences on human promoters. Sixteen TATA elements derived from TATA Box motif, TATAWAWN, were classified into three distribution patterns: peak, bottom-peak and bottom. Fourteen TATA extension sequences (up to two base extensions) were predicted to be the new TATA Box elements because of their high motif factors, which indicate their statistical significance. Statistical analysis on the promoters of mouse, zebrafish and drosophila melanogaster verified seven of these elements. It was also observed that the distribution of TATA elements on the promoters of housekeeping genes are very similar with their distribution on the promoters of tissue specific genes in human.
12866276
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm tries its best to keep the system in the global fairness status using job deviation. We present three strategies: best node, best neighbour, and random selection, for job deviation. A number of experiments are conducted for the comparison of the three strategies, and the results show that the best neighbour strategy is the best among the proposed strategies. Furthermore, the proposed algorithm with best neighbour strategy is better than the traditional round robin algorithm in term of processing delay, and the proposed algorithm needs very limited system information and is robust.
19007096
A Self-Learning System for Identifying Harmful Network Information
Network information identification is a “hot” topic currently. This paper designs a self-learning system using neural network algorithm for identifying the harmful network messages of both Chinese and English languages. The system segments the message into words and creates key word vector which characterizes the harmful network information. The BP algorithm is taken advantage of to train the neural network. The result of training and studying of the neural network can be applied onto many network applications based on message identification. The result of experiments demonstrates that our system has a high degree of accuracy.
5267471
Fault-Tolerant Servers for Anycast Communication
Plenty of research has been done for any cast service, but few research touches the fault-tolerant problem based on the best of our knowledge. In this paper, we propose and analyse a fault-tolerant model, called twin server model, for anycast communication to provide reliable and continuous anycast services. We select a twin server in an anycast group for a given anycast server, the primary server. If the twin server suspects that its primary server is dead, it will take the unfinished job(s) of its primary server. We propose two algorithms: the server failure detecting algorithm and the server failure broadcasting algorithm. We then analyse the performance change when a primary server fails using queue theory and obtain some interesting conclusions. At the end, we summary the paper and present the future work.
5173801
Load Balance Algorithms for Anycast
Increasingly, replicated anycast servers are being used to deliver network applications and service ever increasing user requests. Therefore, the strategies used to guarantee network bandwidth prerequisites and perform load balancing across the nodes of an anycast group are critical to the performance of online applications. In this paper, we model user requests, network congestion and latency, and server load using a combination of hydro-dynamics and queuing theory to develop an efficient job distribution strategy. Current, anycast research does not explicitly consider the system load of nodes within an anycast groups when distributing requests. Therefore, the performance of a heavily loaded anycast system can quickly become congested and uneven as jobs are routed to closely linked nodes which are already saturated with requests. In comparison, the nodes of further away systems remain relatively unused because of other issues such as network bandwidth and latency during these times. Our system redirects requests from busy systems to the idle, remotely linked nodes, to process requests faster in spite of slower network access. Using an empirical study, we show this technique can improve request performance, and throughput with minimal network probing overhead.
19315936
Lease Based Addressing for Event-Driven Wireless Sensor Networks
Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose an addressing mechanism for event-driven wireless sensor networks. The proposed scheme eliminates the need for network wide Duplicate Address Detection (DAD) and enables reuse of addresses.
16218050
A tool for constructing service replication systems
Service replication as a key to providing high availability, fault tolerance and good performance in distributed systems. However, building a service replication system is a difficult and complex task. This paper describes a tool that mimics the design of the remote procedure call (RPC) system to support building distributed service replication systems. The tool includes an interface definition language for describing a replica group, a language preprocessor and a runtime library system.
12677842
ADAM: another database of abbreviations in MEDLINE
MOTIVATION
Abbreviations are an important type of terminology in the biomedical domain. Although several groups have already created databases of biomedical abbreviations, these are either not public, or are not comprehensive, or focus exclusively on acronym-type abbreviations. We have created another abbreviation database, ADAM, which covers commonly used abbreviations and their definitions (or long-forms) within MEDLINE titles and abstracts, including both acronym and non-acronym abbreviations.


RESULTS
A model of recognizing abbreviations and their long-forms from titles and abstracts of MEDLINE (2006 baseline) was employed. After grouping morphological variants, 59 405 abbreviation/long-form pairs were identified. ADAM shows high precision (97.4%) and includes most of the frequently used abbreviations contained in the Unified Medical Language System (UMLS) Lexicon and the Stanford Abbreviation Database. Conversely, one-third of abbreviations in ADAM are novel insofar as they are not included in either database. About 19% of the novel abbreviations are non-acronym-type and these cover at least seven different types of short-form/long-form pairs.


AVAILABILITY
A free, public query interface to ADAM is available at http://arrowsmith.psych.uic.edu, and the entire database can be downloaded as a text file.
17339667
The design and implementation of an active replication scheme for distributing services in a cluster of workstations
Replication is the key to providing high availability, fault tolerance, and enhanced performance in a cluster of workstations (COWs). However, building such a system remains as a difficult and challenging task, mainly due to the difficulty of maintaining data consistency among replicas and the lack of easy and efficient tools supporting the development procedure. In this paper we propose an active replication scheme in which data consistency can be maintained. Based on the active replication scheme, we present an object-oriented design pattern and a constructing tool to simplify the design and implementation of service replications in COWs.
1954273
An architecture for building reliable distributed object-based systems
This paper proposes an architecture for designing fault-tolerant distributed object systems. The proposed architecture attempts to bring advances in client-server, remote procedure call, reliable group communication, and object orientation technologies under a unified architecture to ease application developers' work of building reliable distributed systems. The resulting application systems should be enhanced with modularity and flexibility.
2813000
Detecting and tolerating failures in a loosely integrated heterogeneous database system
This article presents the design and prototype implementation of a fault detection and fault tolerance facility based on the reactive system model for a loosely integrated heterogeneous database system running on a network of workstations. The database system consists of a number of fully autonomous databases that, through their willingness, can share some portion of their information. Sensors (functions that expose some part of the state of an object) are placed on individual databases and system objects (such as traders, agents, and other sensors). Other databases and system objects, and applications can subscribe to a sensor and therefore are notified whenever the sensor value changes. The fault detection mechanism uses sensors to monitor individual databases and system objects and to detect database or system faults. The fault tolerance mechanism uses actuators (functions that can change the state of an object) to react on database or system faults.