Development of a handy oil-skimmer

金沢大学大学院自然科学研究科環境創成金沢大学工学部Recently marine-pollution by high-viscous oil leaked from wrecked ships has been becoming a remarkable problem in the world. Japan government is renewing old oil recovery vessels with new concept. The oil recovery vessels are available on the open sea, but unworkable in a narrow space. We have developed a handy oil recovery system which is portable and used for supplementing the weak point of the oil recovery vessel. The system consists of a water jet oil-skimmer and a gravity oil/water separator. The oil skimmer has a high-pressure water jet pump inside the suction mouth and a long shaft which is used as a conduit of the recovered fluid as well as a spring-hanging device which enables an operator to easily manipulate it from the deck of the ship. After 3-year research and experiments, we have completed the system successfully. The system will be soon installed on our oil recovery vessels. © 2004 IEEE

Medaka as a model for ECG analysis and the effect of verapamil

The heart of the medaka, a small fish native to East Asia, has electrophysiological aspects similar to mammalian hearts. We found that the heart rates of medaka were more similar to humans than mice or rats. Medaka exhibited similar electrocardiogram patterns to those of humans, suggesting a similarity in cardiac impulse formation and propagation. Their hearts also exhibited similar responsiveness to verapamil, a calcium channel antagonist; atropine, a parasympathetic nerve blocker; propranolol, a sympathetic β-adrenergic blocker; and isoproterenol, a sympathetic β-adrenergic agonist. We successfully analyzed action potentials and cardiac contractile forces in vivo. Verapamil affected action potential duration and reduced heart rate, suggesting the importance of voltage-dependent calcium channels in determining the heart rhythm of medaka. We also analyzed the expression of the voltage-dependent calcium channel β2 subunit, which participates in channel formation in cardiac myocytes, and found that splice variant type-2 was the only major transcript in the heart. Our results indicate that medaka could be an appropriate animal model for studying cardiovascular pharmacology

Characterization of medaka ECG as a model for cardiological analysis

This data set is the summary of the electrophysiological experiment in medaka, which contains cell size of cardiomycyte and ECG and heart rate change by drugs and temperature, frequency analysis data. It was used in the study on Yonekura and Murakami (2017)

Self-Indexed Grammar-Based Compression by Edit Sensitive Parsing

A space-economical self-index on the grammar-based compression is proposed. The algorithm by (Sakamoto et al. 2009) approximates the optimum compression for a given string within O(log*u log u) ratio for the string length u. Adopting this algorithm with a new succinct data structure for full binary tree, a grammar-based compression represented by a CFG in Chomsky normal form is transformed to a compressed index. The index size is 2nlog n+hlog n+nlog h+4n+o(nlog n) bits, where n is the number of different variables in the grammar-based compression G and h is the height of G bounded by O(log u). The time to count occurrences for a pattern P of length m is estimated to O(mlog^2 n + occ_c(log nlog m+h)), where occ_c is the occurrence number of core of P, which is derived from alphabet reduction in (Cormode and Muthukrishnan 2007). The parameter occ_c is almost equal to the occurrence of P for sufficiently long P. Experiments for large text data also show the time/space efficiency and the high performance for long pattern search compared with other compact index structures

Self-Indexed Grammar-Based Compression by Edit Sensitive Parsing

A space-economical self-index on the grammar-based compression is proposed. The algorithm by (Sakamoto et al. 2009) approximates the optimum compression for a given string within O(log*u log u) ratio for the string length u. Adopting this algorithm with a new succinct data structure for full binary tree, a grammar-based compression represented by a CFG in Chomsky normal form is transformed to a compressed index. The index size is 2nlog n+hlog n+nlog h+4n+o(nlog n) bits, where n is the number of different variables in the grammar-based compression G and h is the height of G bounded by O(log u). The time to count occurrences for a pattern P of length m is estimated to O(mlog^2 n + occ_c(log nlog m+h)), where occ_c is the occurrence number of core of P, which is derived from alphabet reduction in (Cormode and Muthukrishnan 2007). The parameter occ_c is almost equal to the occurrence of P for sufficiently long P. Experiments for large text data also show the time/space efficiency and the high performance for long pattern search compared with other compact index structures