In this paper, we introduce an untethered type of magnetically driven microtool (MMT) with a force sensing function to investigate the stimulus characteristics of aquatic microorganisms in a microfluidic chip. The microchip is composed of the proposed MMTs, which have a Si-Ni hybrid structure, a transparent cover made of polydimethylsiloxane (PDMS), a glass substrate, and a microspacer to prevent both friction during the force measurement and damage to the micropattern of the MMT. The fabrication and drive performance of the MMT, which is actuated by permanent magnets from the outside of the microchip, verified in basic experiments. Finally, we succeeded in on-chip manipulation and sensing of microorganisms using this MMT, which we found to be easy to use.

In this paper, we newly propose an on-chip force sensing by using a magnetically driven microtool (MMT) equipped with a frame structure for measurement of stimulant property of Pleurosira laevis. The design and fabrication of the force sensing structure with a displacement magnification mechanism based on beam deformation is discussed. Through the basic experiments, the advantages of the proposed layer fabrication technique and the performance of the force sensor are confirmed. The basic characteristics of P. laevis are also confirmed by using the developed MMT.

Many national libraries are making efforts to crawl and store various born-digital information, there are many difficult problems of the social, legal and technical aspects. In this paper, from the view points of long-term preservation of digital contents, we focus on the the urgent task of storage system, since the size of the web archive is increasing exponentially. In order to archive monotonously increasing contents, we discuss management of storage devices and file formats in web archive systems. Firstly, we propose an architecture of hierarchical storage system based on characteristics of storage devices and file compression formats. Next, we modify the file moving algorithm by using file access frequency. We also evaluate the performance of our proposed algorithm with predicted data based on actual statistics of a web archive system.

Frequent subtree mining has become increasingly important in recent years. In this paper, we present AMIOT algorithm to discover all frequent ordered subtrees in a tree-structured database. In order to avoid the generation of infrequent candidate trees, we propose the techniques such as right-and-left tree join and serial tree extension. Proposed methods enumerate only the candidate trees with high probability of being frequent without any duplication. The experiments on synthetic dataset and XML database show that AMIOT reduces redundant candidate trees and outperforms FREQT algorithm by up to five times in execution time.

No abstract available.