We present a theoretical model describing Ogston (pore size comparable to or larger than the characteristic molecular dimension) sieving of rigid isotropic and anisotropic biomolecules in nanofluidic molecular filter ...
详细信息
We present a theoretical model describing Ogston (pore size comparable to or larger than the characteristic molecular dimension) sieving of rigid isotropic and anisotropic biomolecules in nanofluidic molecular filter arrays comprising of alternating deep and shallow regions. Starting from a quasi-one-dimensional drift-diffusion description, which captures the interplay between the driving electric force, entropic barrier and molecular diffusion, we derive explicit analytical results for the effective mobility and trapping time. Our results elucidate the effects of field strength, device geometry and entropic barrier height, providing a robust tool for the design and optimization of nanofilter/nanopore systems. Specifically, we show that Ogston sieving becomes negligible when the length of shallow region becomes sufficiently small, mainly due to efficient diffusional transport through the short shallow region. Our theoretical results are in line with experimental observations and provide important design insight for nanofluidic systems.
In this paper, we propose a resource broker, which providing a friendly interface for accessing available and appropriate resources via user credentials, is developed on a platform constructed by employing the Globus ...
详细信息
In this paper, we present a peer-to-peer file sharing platform combined with Data Grid system for mobile devices. Facing the limit of network bandwidth and unstable signal strength in wireless network, wireless peer-t...
详细信息
Data privacy preservation has become one of the major concerns in the design of practical data-mining applications. In this paper, a novel data distortion approach based on structural partition and Sparsified Singular...
详细信息
In our paper [1], the name of one of the authors is incorrectly given. Included here also is the biography with the missing IEEE membership information.
In our paper [1], the name of one of the authors is incorrectly given. Included here also is the biography with the missing IEEE membership information.
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exp...
详细信息
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.
In this paper, we propose a resource broker, which providing a friendly interface for accessing available and appropriate resources via user credentials, is developed on a platform constructed by employing the Globus ...
详细信息
In this paper, we propose a resource broker, which providing a friendly interface for accessing available and appropriate resources via user credentials, is developed on a platform constructed by employing the Globus toolkit. This broker not only deploys a domain-based network information model and its dynamic version to measure network status by invoking Network Weather Service (NWS) on grid computing environments, but also uses the Ganglia and NWS tools to monitor resource status and network-related information. Based on the actual value of network bandwidth and preserving the advantages of our previous model, a network bandwidth-award job scheduling algorithm for grid resource brokerage is then developed for communication-intensive job execution. Furthermore, the network information and resource status collected are all up-to-date so that the resource broker can effectively match appropriate grid resources and userspsila requests to improve execution.
The objective of this paper is to implement and evaluate a cluster computing environment by clustering idle PCs (personal computer) with Diskless slave nodes on campuses in order to obtain the effectiveness of the lar...
详细信息
The objective of this paper is to implement and evaluate a cluster computing environment by clustering idle PCs (personal computer) with Diskless slave nodes on campuses in order to obtain the effectiveness of the largest computer potency. Two sets of cluster platforms BCCD and DRBL are used to compare parallel computingperformance. The objective is to prove that DRBL has better performance than BCCD in this experiment. In order to achieve the objective of a platform for Free Software Teaching, DRBL is applied to the computer classroom, enabling PCs to be manually or automatically switched among different OS (operating system) of Windows, Free Software Teaching and PC Cluster. The bioinformatics program, mpiBLAST, is executed smoothly in the Cluster architecture as well. Through comparing various aspects of performance, including performance of Switch, Swap, this paper is attempted to find out the best Cluster environment in computer classroom at school. Finally, HPCC is used to demonstrate Cluster performance.
Data grids are a very important and useful technique for solving problems created by the large amounts of data scientific experiments and simulations produce. Data replication, a technique much discussed by data grid ...
详细信息
Data grids are a very important and useful technique for solving problems created by the large amounts of data scientific experiments and simulations produce. Data replication, a technique much discussed by data grid researchers in past years, creates multiple copies of files and stores them in convenient locations to shorten file access times. In this paper, we propose a dynamic replication maintenance service for maintaining data in grid environments. Replicas are adjusted to appropriate locations using Bayesian Networks (BN). The maintenance strategy we propose is called Implicit Dynamic Maintenance Service with Bayesian Network (IDMSBN).
This paper proposed a two layer authorization mechanism, including traditional password system and rhythm recognition. The whole system includes two phases: preprocessing and usual operation for users. In preprocessin...
详细信息
This paper proposed a two layer authorization mechanism, including traditional password system and rhythm recognition. The whole system includes two phases: preprocessing and usual operation for users. In preprocessing phase, users type password in a specific rhythm in order to record and analyse the characteristics of behaviour of users. In the second phase, how to verify a user in usual operation is described. The main recognition procedure consists of two stages: password check and rhythm recognition separately. User shall input correct password in correct rhythm. Here rhythm is a sequence of beats with various time intervals in between. The beat is in correspondent with every key down event. In the authorization procedure, system will check ID and password first. At the same time, system will record all time intervals of key down events. After recording all time intervals, system compares the characteristics of the resultant rhythm with that in user database. If the distance is under some threshold of error tolerance, user will be authorized. Otherwise, entering system will not be approved. The proposed two layer authorization method successfully enhances the security and efficiency of password system. The proposed distance calculation enables our calculation to be much cost effective than that of other rhythm recognition methods.
暂无评论