Researchers Database

JOE Kazuki

FacultyFaculty Division of Human Life and Environmental Sciences Research Group of Information and Communication Technology for Life
PositionProfessor
Last Updated :2022/10/06

researchmap

Profile and Settings

  • Name (Japanese)

    Jo
  • Name (Kana)

    Kazuki

Degree

  • Ph.D, Nara Institute of Science and Technology

Research Interests

  • 学習ベクトル量子化
  • ユーザ支援
  • プログラム支援
  • 原子分子素過程
  • MPI
  • 原子分子データ
  • データ分割
  • 原子構造
  • 気象学
  • 情報検索
  • 分散共有メモリ
  • 科学データ
  • データマイニング
  • COMA
  • 中間表現
  • メタデータ
  • PCクラスタ
  • 原子分子過程
  • 地球観測
  • 量子コンピュータ
  • 電子衝突断面積
  • 分散メモリ環境
  • 地球科学
  • 依存解析
  • 並列化コンパイラ
  • 分散処理
  • 自動並列化コンパイラ
  • Web
  • アーキテクチャ
  • 最適化
  • ベクトル化
  • 並列計算機
  • 情報システム
  • データ抽出
  • 自然言語処理
  • 並列化
  • ユ-ザ支援
  • データ分散
  • 命令セット
  • 並列処理
  • Laputaテスト
  • 依存関係解析
  • 自動並列化
  • ループ並列化
  • 視覚化
  • タスクグラフ
  • コンパイラ
  • 原子分子データベース
  • 機械学習
  • 粒度
  • データベース

Research Areas

  • Informatics, Software
  • Informatics, Information networks
  • Informatics, Computer systems
  • Humanities & social sciences, Library/information science, humanistic/social informatics
  • Natural sciences, Semiconductors, optical and atomic physics

Research Experience

  • 2009, Nara Women's University, 教授
  • 2006, Nara Women's University, Faculty of Science, 教授
  • 2005, Nara Women's University, 教授
  • 2004, Nara Women's University, 教授
  • 2001, 2003, Nara Women's University, Faculty of Science, 教授
  • 1999, 和歌山大学 奈良女子大学・システム工学部・理学部, 助教授・教授
  • 1998, Wakayama University, Faculty of Systems Engineering, 講師・助教授
  • 1997, Wakayama University, Faculty of Systems Engineering, 講師

Education

  • 1996, Nara Institute of Science and Technology, Graduate School, Division of Information Science, Information Systems
  • 1984, Osaka University, Faculty of Science, Dep. of Mathematics

Association Memberships

  • 情報処理学会数理モデル化と問題解決研究会
  • 情報処理学会
  • Information Processiong Scociety Japan
  • 情報処理学会論文誌数理モデル化と応用編集委員長

Ⅱ.研究活動実績

Published Papers

  • Refereed, 情報処理学会論文誌数理モデル化と応用, 仮想風景におけるVR酔い低減のための一手法, 笹山 琴由; 五味田 啓; 加藤 嘉明; 城 和貴, Mar. 2021, 14, 2, 13, 23
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, レーザー打音分析によるコンクリート内部状態の推定, 千代延 未帆; 城 和貴; 石川 由羽; 錦野 将元, Feb. 2021, 132, 4, 1, 6
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, 近代書籍における文字切り出し手法の検討, 飯田 紗也香; 竹本 有紀; 石川 由羽; 髙田 雅美; 城 和貴, Feb. 2021, 132, 4, 1, 6
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, 速度低下錯視を用いた VR 酔いの低減手法, 笹山琴由; 五味田啓; 加藤嘉明; 城和貴, Dec. 2020, 127, 11, 1, 6
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, GPを用いたJAZZ実時間自動生成システムの試作, 井上 彩; 城 和貴, Dec. 2020, 131, 18, 1, 6
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, 邦字新聞における近代文語体と現代口語体の自動翻訳の検討, 稲見 郁乃; 竹本 有紀; 石川 由羽; 高田 雅美; 上田 薫; 城 和貴, Dec. 2020, 131, 12, 1, 6
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, 地震予知を目的とした DEMETER 衛星データの雷ノイズ除去, 石通彩加; 竹本有紀; 石川由羽; 高田雅美; 城和貴, Feb. 2020, 127, 24, 1, 6
  • Refereed, Proceedings of the 1st International ACM Conference on Multimedia Information Retrieval, MIR2008, Co-located with the 2008 ACM International Conference on Multimedia, MM'08, Searching musical audio datasets by a batch of multi-variant tracks, Yi Yu; J. Stephen Downie; Lei Chen; Vincent Oria; Kazuki Joe, Multi-variant music tracks are those audio tracks of a particular song which are sung and recorded by different people (i.e., cover songs). As music social clubs grow on the Internet, more and more people like to upload music recordings onto such music social sites to share their own homeproduced albums and participate in Internet singing contests. Therefore it is very important to explore a computerassisted evaluation tool to detect these audio-based multivariant tracks. In this paper we investigate such a task: the original track of a song is embedded in datasets, with a batch of multi-variant audio tracks of this song as input, our retrieval system returns an ordered list by similarity and indicates the position of relevant audio track. To help process multi-variant audio tracks, we suggest a semantic indexing framework and propose the Federated Features (FF) scheme to generate the semantic summarization of audio feature sequences. The conjunction of federated features with three typical similarity searching schemes, K-Nearest Neighbor (KNN), Locality Sensitive Hashing (LSH), and Exact Euclidian LSH (E2LSH), is evaluated. From these findings, a computer-assisted evaluation tool for searching multi-variant audio tracks was developed to search over large musical audio datasets. Copyright 2008 ACM., 2008, 121, 127, International conference proceedings
  • Refereed, MM'08 - Proceedings of the 2008 ACM International Conference on Multimedia, with co-located Symposium and Workshops, COSIN: Content-based retrieval system for cover songs, Yi Yu; J. Stephen Downie; Fabian Moerchen; Lei Chen; Kazuki Joe; Vincent Oria, We develop a content-based audio COver Song IdeNtification (COSIN) system to detect/group cover songs.The COSIN takes music audio content as input and performs similarity searching to locate variants of the input (i.e., cover versions). Identified cover songs are returned in the rank order according to their similarity to the input.The COSIN also incorporates a set of tools to evaluate retrieval performance so researchers can explore different retrieval schemes and parameters (e.g. recall, precision).The COSIN utilizes a suite of techniques to detect cover songs including: Pitch + Dynamic Programming (DP), Chroma + DP, and Semantic Feature Summarization (SFS) + Hash-Based Approximate Matching (HBAM). Demonstration system shows that COSIN is a very potential music content retrieval tool. Running some music retrieval schemes on COSIN platform, recent experiments with SFS + LSH Variants demonstrate a nicely balanced efficiency (search speed) v. performance (search accuracy) tradeoff., 2008, 987, 988, International conference proceedings
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, 近代書籍における低出現頻度文字種の獲得, 藤田未希; 竹本有紀; 石川由羽; 髙田雅美; 城和貴, Dec. 2019, 126, 6, 1, 6, Symposium
  • Not Refereed, 情報処理学会数理モデル化と問題解決研究会, ホワイトボードからの文字抽出手法の検討, 山本祐美; 本郷仁志; 森吉弘; 城和貴, Dec. 2019, 126, 14, 1, 6, Symposium
  • Refereed, The 2019 International Conference on Parallel and Distributed Processing Techniques and Applications, Applying CNNs to Early-Modern Printed Japanese Character Recognition, Suzuka Yasunami; Norie Koiso; Yuki Takemoto; Yu Ishikawa; Masami Takata; Kazuki Joe, Aug. 2019, 189, 195, International conference proceedings
  • Refereed, The 2019 International Conference on Parallel and Distributed Processing Techniques and Applications, Structure of Neural Network Automatically Generating Fonts for Early-Modern Japanese Printed Books, Yuki Takemoto; Yu Ishikawa; Masami Takata; Kazuki Joe, Aug. 2019, 182, 188, International conference proceedings
  • Refereed, The 2019 International Conference on Parallel and Distributed Processing Techniques and Applications, Layout Analysis using Semantic Segmentation for Imperial Meeting Minutes, Sayaka Iida; Yuki Takemoto; Yu Ishikawa; Masami Takata; Kazuki Joe, Aug. 2019, 135, 141, International conference proceedings
  • Refereed, The 2018 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Optimization of Auto Mesh Generation Using Genetic Algorithm, JOE Kazuki; Rina Yamamoto; Yuki Takemoto; Yu Ishikawa, 2018, 354-360
  • Refereed, The 2018 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Automatic Font Generation for Early-Modern Japanese Printed Books, JOE Kazuki; Yuki Takemoto; Yu Ishikawa; Masami Takata, 2018, 326-332
  • Refereed, The 2018 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Refinement of a real-time super-resolution FPGA circuit, JOE Kazuki; Takashi Matsumoto; Mayo Sanada; Suzuka Yasunami, 2018, 347-353
  • Refereed, 2017 14th International Conference on Ubiquitous Robots and Ambient Intelligence, URAI 2017, Institute of Electrical and Electronics Engineers Inc., Estimating emotion of user via communicative stuffed-toy device with pressure sensors using fuzzy reasoning, Tomoko Yonezawa; Haruka Mase; Hirotake Yamazoe; Kazuki Joe, In this research, we aim to perform emotion estimation based on the touching manner of communication using our stuffed-toy device that we had previously proposed in order to reduce the user's stress. In this paper, we propose a method to classify a user's emotions into three types: comfort, discomfort, and unknown, by adopting a fuzzy reasoning using histogram distribution of peaks of pressure sensor values. The results of the experiment confirmed the accuracy of classification as 69.1% of the correct answer rate when the results estimated as unknown are included in the correct answers, and 63.1% of the correct answer rate when the unknown results are excluded from the correct answer. We also discuss improvements of future methods., 25 Jul. 2017, 916, 921, International conference proceedings
  • Refereed, The 2017 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Hand Shape Recognition using the sEMG of the Upper Extremity, JOE Kazuki; Mayuko Iwamoto; Yu Ishikawa; Masami Takata, 2017, 295-301
  • Refereed, The 2017 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Validation of EEG Authentication Accuracy with Electrode Slippage, JOE Kazuki; Yu Ishikawa; Kaori Nishibata; Masami Takata; Hiroyasu Kamo, 2017, 302-308
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 脳波から求めた複数特徴量の組み合わせによる生体認証, JOE Kazuki, 2017, 10, 1, 22-32
  • Refereed, The 2017 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Early-Modern Printed Character Recognition using Ensemble Learning, JOE Kazuki; Kaori Fujimoto; Yu Ishikawa; Masami Takata, 2017, 288-294
  • Refereed, The 2016 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Correlation of proximity voluntary muscles EMG and EEG, JOE Kazuki; Hitomi Oigawa; Yu Ishikawa; Tomohiro Umeda; Masami Takata, 2016, 401-407
  • Refereed, The 2016 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Real-Time Super Resolution: FPGA Implementation for the ICBI Algorithm, JOE Kazuki; Takashi Matsumoto; Arisa Yamamoto, 2016, 415-420
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 近代書籍を対象とした多フォント漢字認識, JOE Kazuki, 2016, 9, 2, 33-40
  • Refereed, The 2016 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Biometric Authentication based on Multi-feature Combination using EEG, JOE Kazuki; Yu Ishikawa; Kaori Nishibata; Masami Takata; Hiroyasu Kamo, 2016, 401-407
  • Refereed, The 2016 International Conference on Parallel and Distributed Processing Techniques and Applications, Final Edition, Comparison of Feature Extraction Methods for Early-Modern Japanese Printed Character Recognition, JOE Kazuki; Kazumi Kosaka; Kaori Fujimoto; Yu Ishikawa; Masami Takata, 2016, 408-414
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, A Music Composition Model with Genetic Programming -A Case Study of Chord Progression and Bassline-, JOE Kazuki, Jul. 2015, 2, 256-262
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, Sign Language Recognition using Leap Motion Controller, JOE Kazuki, Jul. 2015, 2, 263-269
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, An Effective and Interactive Training Data Collection Method for Early-Modern Japanese Printed Character Recognition, JOE Kazuki, Jul. 2015, 2, 276-282
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, Visualization of Sensory Weight for Shouldering Randseru, JOE Kazuki, Jul. 2015, 2, 297-303
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, Evaluating Elements of Communicative Stuffed-toy Device Describes Scripts on SNS, JOE Kazuki, Jul. 2015, 2, 310-316
  • Refereed, The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications, A Personal Classification Method Using Spatial Information of Multi-channel EEG, JOE Kazuki, Jul. 2015, 2, 229-235
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 活字データの分類を用いた進化計算による近代書籍からのルビ除去, JOE Kazuki, Mar. 2015, 8, 1, 72-79
  • Refereed, The 2014 International Conference on Parallel and Distributed Processing Techniques and Applications, Validation of EEG Personal Authentication with Multi-channels and Multi-tasks, JOE Kazuki, Jul. 2014, 2, 182-188
  • Refereed, 3rd International Conference on Pattern Recognition Applications and Methods, A Multi-Fonts Kanji Character Recognition Method for Early-Modern Japanese Printed Books with Ruby Characters, JOE Kazuki; Taeka Awazu; Manami Fukuo; Masami Takata, Mar. 2014, 637-645
  • Refereed, 7th International Joint Conference on Biomedical Engineering Systems and Technologies, Special Session on Multivariable Processing for Biometric Systems, Biometrics Authentication using Another Feature of Heartbeat Waveform, JOE Kazuki; Ryoko Nomura; Tomohiro Umeda; Naoko Yoshii; Masami Takata, Mar. 2014, 311-317
  • Refereed, SEMANTIC TECHNOLOGY, SPRINGER-VERLAG BERLIN, Ontology Construction Support for Specialized Books, Yuki Eguchi; Yuri Iwakata; Minami Kawasaki; Masami Takata; Kazuki Joe, In this paper, we present a support system for ontology construction just based on a given specialized book with lowest possible cost. The system tries to combine minimum hand and mostly automatic constructions. It extracts required information for the ontology design from the specialized book with presenting yes-no selections to an expert of the specialized book. The ontology construction is performed automatically just using the answers of the expert. The constructed ontology is reliably and highly technical since it is constructed on the basis of the specialized book. In addition, since user operations are restricted only to yes-no selection, any expert can make use of our system without any special knowledge about ontology., 2014, 8388, 159, 174, International conference proceedings
  • Refereed, 2014 7TH BIOMEDICAL ENGINEERING INTERNATIONAL CONFERENCE (BMEICON), IEEE, Biometrics Authentication Based on Chaotic Heartbeat waveform, Ryoko Nomura; Yu Ishikawa; Tomohiro Umeda; Masami Takata; Hiroyasu Kamo; Kazuki Joe, In this paper, we propose a personal authentication method using heartbeat waveforms to enhance the security in wireless communication. In the heartbeat waveforms of a human being, it is known that there are discriminative characteristic features and the mimicking is very difficult. Therefore, their application to personal authentication has been studied. Existing method performs personal authentication using a chaos indicator of ECG. In this paper, we propose an authentication method that extends the index in order to increase the accuracy of authentication. To validate that our personal authentication method is applicable, we perform some experiments to show that our method provides better authentication than existing one., 2014, 1-5, International conference proceedings
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 遺伝的プログラミングを用いた近代書籍からのルビ除去, JOE Kazuki, 2013, 6, 2, 53-62
  • Refereed, The 2013 International Conference on Parallel and Distributed Processing Techniques and Applications, Locality Analysis for Characterizing Applications Based on Sparse Matrices, JOE Kazuki, 2013, 2, 299-315
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 古典油彩画グレーズ技法シミュレーションの高速化, JOE Kazuki, 2013, 6, 1, 119-127
  • Refereed, 5th International Conference on Future Computational Technologies and Applications, Future Irregular Computing with Memory Accelerators, JOE Kazuki; Noboru Tanabe; Junko Kogou; Sonoko Tomimori; Masami Takata, 2013, 74-80
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 視覚障害者のための墨字学習支援システムの開発と評価, JOE Kazuki, 2013, 6, 2, 128-136
  • Refereed, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Character of graph analysis workloads and recommended solutions on future parallel systems, Noboru Tanabe; Sonoko Tomimori; Masami Takata; Kazuki Joe, Graph500 is a benchmark suite for big data analysis. Matrices used for Graph500 inherit the properties of graph analysis such as breadth first search for SNS and PageRank for web searching engine. Especially power saving is very important for its execution on future massively parallel processors and clouds. The spatial locality of sparse matrices used for Graph500 and its behaviors on cache memory are investigated. The experimental results show the spatial locality of sparse matrices used for Graph500 is very low. It is very difficult to solve the problem by just software approach because of the huge size and the randomness of their accesses. Therefore, we recommend hardwired scatter/gather functions at memory side. They improve the processing speed in an order of magnitude. For achieving both of low power and high throughput of random access, we recommend implementing hardwired scatter/gather functions on logic-base in Hybrid Memory Cube (HMC). We also describe brief considerations of the power saving in the case of low cache hit rate application such as graph500. For example, when the hit rate is 15%, the power saving ratio of memory access is about 30-fold. © Springer International Publishing Switzerland 2013., 2013, 8285, 1, 402, 415, International conference proceedings
  • Refereed, 情報処理学会論文誌数理モデル化と応用, α波構成要素の切出しと解析, JOE Kazuki, 2013, 6, 2, 93-103
  • Refereed, The 2012 International Conference on Parallel and Distributed Processing Techniques and Applications, AR Based Spatial Reasoning Capacity Training for Students, JOE Kazuki; Mai Hatano; Tomoko Yonezawa; Naoko Yoshii; Masami Takata, Jul. 2012, II, 750-755
  • Refereed, The 2012 International Conference on Parallel and Distributed Processing Techniques and Applications, Real Time Spatiotemporal Biological Stress Level Checking, JOE Kazuki; Marina Uchimura; Yuki Eguchi; Minami Kwasaki; Naoko Yoshii; Tomohiro Umeda; Masami Takata, Jul. 2012, II, 744-749
  • Refereed, ASIASIM 2012, PT I, SPRINGER-VERLAG BERLIN, Pre-motion Based VR Object Manipulation Definitions and Preliminary Experiments, Shiori Mizuno; Asuka Komeda; Naoko Yoshii; Tomoko Yonezawa; Masami Takata; Kazuki Joe, In this paper, we propose a new method to manipulate objects by using user's pre-motion in a VR environment. Users are provided with an instinctually easy interface to VR with using their natural behaviors as their commands for manipulating VR objects. Hand pre-shaping is known as human's unconscious behavior to face a small object to be grasped. The definitions of pre-motions are determined by users' initial behaviors. Therefore, we present the definitions to classify characteristics of the kinds of objects and pre-motions. Using the above definitions, we develop a prototype system to validate the classifications. Consequently, manipulating VR objects by pre-motion is possible and promising., 2012, 323, 499, +, International conference proceedings
  • Refereed, 5TH BIOMEDICAL ENGINEERING INTERNATIONAL CONFERENCE (BMEICON 2012), IEEE, Constitution and Phase Analysis of Alpha Waves, Yu Ishikawa; Masami Takata; Kazuki Joe, Alpha waves are electroencephalogram discovered by Hans Berger in 1929 and have been studied by many researchers. Recently the amplitude and the phase of alpha waves attract attention, and various studies are reported. So far the alpha waves are not concretely modeled to explain how they are constituted. In this paper, we analyze the phase of alpha waves for their future modeling. As pre-processing, we extract alpha wave data from EEGs and divide the data into alpha wave constituent waves. Analyzing the feature quantity of the alpha wave constituent waves, it turns out that the amplitude and the wavelength of alpha wave constituent waves are correlated with a constant time delay., 2012, International conference proceedings
  • Refereed, 情報処理学会論文誌コンピューティングシステム, 長行を折畳む疎行列ベクトル積方式とGather機能付メモリによる高速化, JOE Kazuki, 2012, 5, 4, 112-124
  • Refereed, ASIASIM 2012, PT I, SPRINGER-VERLAG BERLIN, A Multi-resolution Display Method for Digital Archives of Cultural Properties Using Polygon Reconsruction, Megumi Okumoto; Yuri Iwakata; Asuka Komeda; Tomoko Yonezawa; Masami Takata; Kazuki Joe, In this paper, we propose a multi-resolution display method for digital archives of cultural properties using polygon reconstruction. When digital archives of cultural properties are displayed in VR systems for research purpose, mesh resolution had to be changeable on the demand of user. Additionally, for user's comfortability, polygon reconstruction needs to be executed in real-time. History of preliminary polygon reductions is adopted for the proposed method so that polygon reconstruction is executed in real-time. To validate the VR system using the polygon reconstruction based multi-resolution display method, some experiments are performed. As the result of the experiments, the proposed method is performed within 1.0 second, which is considered as "real-time" by the definition of typical user-interface., 2012, 323, 190, +, International conference proceedings
  • Refereed, NVIDIA GTC Workshop Japan 2011, GPGPU向けメモリアクセラレータ, 田邊昇; Boonyasitpichai Nuttapon; 中條拓伯; 小郷絢子; 高田雅美; 城和貴, Jul. 2011, Scientific journal
  • Refereed, The 2011 International Conference on Parallel and Distributed Processing Techniques and Applications, A Real-time Analysis Environment for a Wireless BMI Device Enobio, JOE Kazuki; Yu Ishikawa; Sanae Teramae; Naoko Yoshii; Masami Takata, Jul. 2011, II, 739-744
  • Refereed, The 2011 International Conference on Parallel and Distributed Processing Techniques and Applications, Evaluation of the SVM Based Multi-Fonts Kanji Character Recognition Method for Early-Modern Japanese Printed Books, JOE Kazuki; Manami Fukuo; Yurie Enomoto; Naoko Yoshii; Masami Takata; Tsukasa Kimesawa, Jul. 2011, II, 727-732
  • Refereed, The 2011 International Conference on Parallel and Distributed Processing Techniques and Applications, Optimization of the Particle-based Volume Rendering for GPUs with Hiding Data Transfer Latency, JOE Kazuki; Kyoko Nakao; Erika Matsui; Naoko Yoshii; Masami Takata, Jul. 2011, II, 733-738
  • Refereed, PROCEEDINGS OF THE FIRST WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHM (IAAA'11), ASSOC COMPUTING MACHINERY, A Memory Accelerator with Gather Functions for Bandwidth-bound Irregular Applications, Noboru Tanabe; Boonyasitpichai Nuttapon; Hironori Nakajo; Yuka Ogawa; Junko Kogou; Masami Takata; Kazuki Joe, Compute intensive processing can be easily accelerated using processors with many cores such as GPUs. However, memory bandwidth limitation becomes serious year by year for memory bandwidth intensive applications such as sparse matrix vector multiplications (SpMV). In order to accelerate memory bandwidth intensive applications, we have proposed a memory system with additional functions of scattering and gathering. For the preliminary evaluation of our proposed system, we assumed that the throughput of the memory system was sufficient. In this paper, we propose a memory system with scattering and gathering using many narrow memory channels. We evaluate the feasible throughput of the proposed memory system based on DDR3 DRAM with the modified DRAMsim2 simulator. In addition, we evaluate the performance of SpMV using our method for the proposed memory system and a GPU. We have confirmed the proposed memory system has good performance and good stability for matrix shape variation using fewer pins for external memory., 2011, 35, 42, International conference proceedings
  • Refereed, PROCEEDINGS OF THE 19TH INTERNATIONAL EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING, IEEE COMPUTER SOC, Scaleable Sparse Matrix-Vector Multiplication with Functional Memory and GPUs, Noboru Tanabe; Yuuka Ogawa; Masami Takata; Kazuki Joe, Sparse matrix-vector multiplication on GPUs faces to a serious problem when the vector length is too large to be stored in GPU's device memory. To solve this problem, we propose a novel software-hardware hybrid method for a heterogeneous system with GPUs and functional memory modules connected by PCI express. The functional memory contains huge capacity of memory and provides scatter/gather operations. We perform some preliminary evaluation for the proposed method with using a sparse matrix benchmark collection. We observe that the proposed method for a GPU with converting indirect references to direct references without exhausting GPU's cache memory achieves 4.1 times speedup compared with conventional methods. The proposed method intrinsically has high scalability of the number of GPUs because intercommunication among GPUs is completely eliminated. Therefore we estimate the performance of our proposed method would be expressed as the single GPU execution performance, which may be suppressed by the burst-transfer bandwidth of PCI express, multiplied with the number of GPUs., 2011, 101, 108, International conference proceedings
  • Refereed, CHEMICAL PHYSICS LETTERS, ELSEVIER SCIENCE BV, Analysis of motion features for molecular dynamics simulation of proteins, Mayumi Kamada; Mikito Toda; Masakazu Sekijima; Masami Takata; Kazuki Joe, Recently, a new method for time series analysis using the wavelet transformation has been proposed by Sakurai et al. We apply it to molecular dynamics simulation of Thermomyces lanuginosa lipase (TLL). Introducing indexes to characterize collective motion of the protein, we have obtained the following two results. First, time evolution of the collective motion involves not only the dynamics within a single potential well but also takes place wandering around multiple conformations. Second, correlation of the collective motion between secondary structures shows that collective motion exists involving multiple secondary structures. We discuss future prospects of our study involving 'disordered proteins'. (C) 2010 Elsevier B.V. All rights reserved., Jan. 2011, 502, 4-6, 241, 247, Scientific journal
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 電車ノイズを含む地電位差データからの矩形状地震前駆的シグナル自動抽, JOE Kazuki, 2010, 3, 2, 22-31
  • Refereed, The 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, Optimization of GROMACS for CUDA Environments, JOE Kazuki; Noriko Hata; Masami Takata, 2010, II, 679-685
  • Refereed, The 2010 International Conference on Parallel and\nDistributed Processing Techniques and Applications, Feature Detection of Volume Data Based on Topology and its Application to Database Construction, JOE Kazuki; Keiko Kuriu; Masami Takata, 2010, II, 665-671
  • Refereed, The 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, A Music Composition Model with Genetic Programming, JOE Kazuki; Kyoko Komatsu; Tomomi Yamanaka; Masami Takata, 2010, II, 686-692
  • Refereed, The 2010 International Conference on Parallel and\nDistributed Processing Techniques and Applications,, Multi-Regression Analysis of Music Impressions for\nMusic Evaluation, JOE Kazuki; Tomomi Yamanaka; Kyoko Komatsu; Naoko Yoshii; Masami\nTakata, 2010, II, 693-702
  • Refereed, The 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, Update Dependence Analysis of Web Pages for Incremental Crawling, JOE Kazuki; Naomi Hiromichi; Naoko Yoshii; Masami Takata, 2010, II, 672-678
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, The Architecture of Visualization System using Memory with Memory-Side Gathering and CPUs with DMA-type Memory Accessing, JOE Kazuki; Noboru Tanabe; Manami Sasaki; Hironori Nakajo; Masami Takata; Kazuki Joe, 2009, II, 427-433
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, Modeling the Developing Process of Depth Perception for Elementary Students, JOE Kazuki; Naoko Yoshii; Masami Takata; Kazuki Joe, 2009, II, 735-741
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, Recognition of Multi-Fonts Character in Early-Modern Printed Books, JOE Kazuki; Chisato Ishikawa; Naomi Ashida; Yurie Enomoto; Masami Takata; Tsukasa Kimesawa; Kazuki Joe, 2009, II, 728-734
  • Refereed, 情報処理学会論文誌数理モデル化と応用, Iアプリによる数値計算実アプリケーションの実装例, JOE Kazuki, 2009, 2, 2, 38-46
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, Clustering the Temporal Sequences Feature of 3D Protain Structure, JOE Kazuki; Mayumi Kamada; Sachi Kimura; Mikito Toda; Masami Takata; Kazuki Joe, 2009, II, 749-755
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, Optimization of a GP Application for the Cell Processor, JOE Kazuki; Yuri Shirakawa; Chiho Misaka; Chisato Ishikawa; Masami Takata; Kazuki Joe, 2009, II, 742-748
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, A Deterioration Lawns Model Constructed from Image Data, JOE Kazuki; Yurie Enomoto; Chisato Ishikawa; Masami Takata; Kazuki Joe, 2009, II, 721-727
  • Refereed, The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, The Architecture of Visualization System using Memory with Memory-Side Gathering and CPUs with DMA-type Memory Accessing, JOE Kazuki; Noboru Tanabe, Jul. 2008, 2, 427-433
  • Refereed, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, Efficient query-by-content audio retrieval by Locality Sensitive Hashing and partial sequence comparison, Yi Yu; Kazuki Joe; J. Stephen Downie, This paper investigates suitable indexing techniques to enable efficient content-based audio retrieval in large acoustic databases. To make an index-based retrieval mechanism applicable to audio content, we investigate the design of Locality Sensitive Hashing (LSH) and the partial sequence comparison. We propose a fast and efficient audio retrieval framework of query-by-content and develop an audio retrieval system. Based on this framework, four different audio retrieval schemes, LSH-Dynamic Programming (DP), LSH-Sparse DP (SDP), Exact Euclidian LSH (E(2)LSH)DP, E(2)LSH-SDP, are introduced and evaluated in order to better understand the performance of audio retrieval algorithms. The experimental results indicate that compared with the traditional DP and the other three compititive schemes, E2LSH-SDP exhibits the best tradeoff in terms of the response time, retrieval accuracy and computation cost., Jun. 2008, E91D, 6, 1730, 1739, Scientific journal
  • Refereed, ISM: 2008 IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA, IEEE, Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs, Yi Yu; J. Stephen Downie; Fabian Moerchen; Lei Chen; Kazuki Joe, Cover song detection is becoming a very hot research topic when plentiful personal music recordings or performance are released on the Internet. A nice cover song recognizer helps us group and detect cover songs to improve the searching experience. The traditional detection is to match two musical audio sequences by exhaustive pairwise comparisons. Different from the existing work, our aim is to generate a group of concatenated feature sets based on regression modeling and arrange them by indexing-based approximate techniques to avoid complicated audio sequence comparisons. We mainly focus on using Exact Locality Sensitive Mapping (ELSM) to join the concatenated feature sets and soft hash values. Similarity-invariance among audio sequence comparison is applied to define an optimal combination of several audio features. Soft hash values are pre-calculated to help locate searching range more accurately. Furthermore, we implement our algorithms in analyzing the real audio cover songs and grouping and detecting a batch of relevant cover songs embedded in large audio datasets., 2008, 302, +, International conference proceedings
  • Refereed, The 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, Preliminary Modeling of Yeast with Alcohol Tolerant Property for the E-Cell System, JOE Kazuki; Mayumi Kamada; Natsu Nakajima; Chisato Ishikawa; Masami Takata; Kazuki Joe, 2008, II, 776-782
  • Refereed, The 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, Real-time 3D Movie Generation by Anaglyph for Live Streaming, JOE Kazuki; Yuki Kobori; Yuri Shirakawa; Chisato Ishikawa; Masami Takata; Kazuki Joe, 2008, II, 758-763
  • Refereed, HIGH-PERFORMANCE COMPUTING, SPRINGER-VERLAG BERLIN, Development of an interactive visual data mining system for atmospheric science, Chiemi Watanabe; Eriko Touma; Kazuko Yamauchi; Katsuyuki Noguchi; Sachiko Hayashida; Kazuki Joe, In atmospheric science, 3D visualization techniques have been mainly used to create impressive presentation in recent decades. However, from the viewpoint of utilize for visual data mining, 3D visualization methodology has difficulties in becoming wide spread because most conventional and established way is to make 2D diagrams consisting of two dimensions of a temporal transitional 3D grid. From these observations, we have been developing a quick look tool of atmospheric science data for 3d visual data mining. We expect that scientists can utilize this tool for finding out 2D diagrams from the data by using various 2D or 3D visualization methods, and become accustomed themselves to 3D visualization methods., 2008, 4759, 279, +, International conference proceedings
  • Refereed, GRAPP 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS THEORY AND APPLICATIONS, INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION, An interactive 3D visualization model by live streaming for remote scientific visualization, Eriko Touma; Satomi Hara; Mari Kurumi; Yuri Shirakawa; Chisato Ishikawa; Masami Takata; Takeshi Horinouchi; Kazuki Joe, Recent improvement of high-end GPUs has made it possible to perform real-time 3D visualization such as volume rendering and 3D contour plot for scientific data locally. A web browser based remote 3D visualization by visualization servers is attractive, but data transfer overhead prevents from performing interactive operations. We propose an interactive remote 3D visualization model by live streaming for geophysical fluids research. In this model, we use live streaming flash media for the web browser based operations keeping minimum quality of data analysis and minimum bit rate for live streaming of flash media. Preliminary experiments with a prototype system validate the effectiveness of our proposing model., 2008, 409, 414, International conference proceedings
  • Refereed, The 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, A Room Modeling Method for 3D Video, JOE Kazuki; Aya Isshiki; Ryuuki Sakamoto; Itaru Kitahara; Kiyoshi Kogure; Kazuki Joe, 2008, II, 751-757
  • Refereed, ISM WORKSHOPS 2007: NINTH IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA - WORKSHOPS, PROCEEDINGS, IEEE COMPUTER SOC, An evaluation of feature extraction for query-by-content audio information retrieval, Yi Yu; J. Stephen Downie; Kazuki Joe, Content-based audio information retrieval is one of the most interesting and fast-growing research areas. Suitable feature sets can help to reduce the tedious computation time and speed up retrieval. In this paper we report a study of the music spectral properties aimed at the acoustic-based music data similarity measurement and show that the spectral features of adjacent flames are highly correlated. Based on such a case study we mainly focus on making an evaluation of feature choice in the three aspects: storage, computation and retrieval ratio. The extensive evaluations confirm the effectiveness of feature merge in quickening sequence matching for query-by-content audio retrieval and show that MFCC with feature merge is the best tradeoff among storage requirement, computation cost and retrieval ratio., 2007, 297, +, International conference proceedings
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, アブストラクトを用いた原子分子物理学分野の論文分類支援システムの設計と実装, JOE Kazuki, 2007, 48, SIG15, 189-198
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, Construction of a Paper Classification System Using SVM, JOE Kazuki; Naomi Ashida; Masami Takata; Akira Sasaki; Hiroyasu Kamo; Naoyuki Nide, 2007, II, 759-765
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, Development of Molecular Dynamics Simulation based Flexible Docking System, JOE Kazuki; Sachi Kimura; Masakazu Sekijima; Masami Takata; Tamotsu Noguchi, 2007, II, 739-745
  • Refereed, ADVANCES IN MULTIMEDIA MODELING, PT 1, SPRINGER-VERLAG BERLIN, Similarity searching techniques in content-based audio retrieval via hashing, Yi Yu; Masami Takata; Kazuki Joe, With this work we study suitable indexing techniques to support efficient, content-based music retrieval in large acoustic databases. To obtain the index-based retrieval mechanism applicable to audio content, we pay the most attention to the design of Locality Sensitive Hashing (LSH) and the partial sequence comparison, and propose a fast and efficient audio retrieval framework of query-by-content. On the basis of this indexable framework, four different retrieval schemes, LSH-Dynamic Programming (DP), LSH-Sparse DP (SDP), Exact Euclidian LSH ((ELSH)-L-2)-DP, (ELSH)-L-2-SDP, are presented and estimated in order to achieve an extensive understanding of retrieval algorithms performance. The experiment results indicate that compared to other three schemes, (ELSH)-L-2-SDP exhibits best tradeoff in terms of the response time, retrieval ratio, and computation cost., 2007, 4351, LNCS4351, 397, 407, International conference proceedings
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, Auto Classification of Feces for Health Condition Analysis, JOE Kazuki; Miho Komatsubara; Chisato Ishikawa; Masami Takata; Hiroyasu Kamo; Naoyuki Nide, 2007, II, 979-985
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, Optimization of Molecular Dynamics Simulation on Cell Processor, JOE Kazuki; Manami Sasaki; Masakazu Sekijima; Masami Takata, 2007, II, 780-786
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, Dvelopment of SVM based Prediction System for Metalbinding Sites in Protein,, JOE Kazuki; Masami Nakazawa; Masami Takata; Kiyonobu Yokota; Tamotsu Noguchi; Masakazu Sekijima, 2007, II, 972-978
  • Refereed, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, 3D Visualization System Gateau for Atmospheric Science: Design Concept and Practical Evaluation, JOE Kazuki; Eriko Touma; Katsuyuki Noguchi; Masami Takata; Hiroyasu Kamo; Naoyuki Nide, 2007, II, 766-772
  • Refereed, 情報処理学会論文誌数理モデル化と応用, 情報爆発時代に向けた大気科学分野のための3次元可視化モデルの提案, JOE Kazuki, 2007, 48, SIG19, 86-97
  • Refereed, 1st Workshop on Learning the Semantics of Audio Signals, Index-based Similarity Searching with Partial Sequence Comparison for Query-by-Content Audio Retrieval, JOE Kazuki; Yi Yu; Masami Takata, Dec. 2006, 76-86
  • Refereed, 2nd IEEE International Conference on e-Science and Grid Computing, Automatic Viewpoint Selection for a Visualization I/F in a PSE, JOE Kazuki; Machiko Nakagawa; Masami Takata, ISBN0-7695-2734-5, Dec. 2006, CD-ROM
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, 可視化されたデータ依存の分類とその並列化手法への適用, JOE Kazuki, 2006, 47, SIG14, 179-186
  • Refereed, 1st Workshop on Learning the Semantics of Audio Signals, Index-based Similarity Searching with Partial Sequence Comparison for Query-by-Content Audio Retrieval, JOE Kazuki; Yi Yu; Masami Takata, 2006, 76-86
  • Refereed, The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications, Design and Implementation of Gateau API for HDF-EOS, JOE Kazuki; Kazuko Yamauchi; Eriko Touma; Hiroyasu Kamo; Naoyuki Nide; Sachiko Hayashida, 2006, 867-873
  • Refereed, The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications, A 3D Visualization System for Intuitive Analysis of Atmospheric Science, JOE Kazuki; Eriko Touma; Kazuko Yamauchi; Hiroyasu Kamo; Naoyuki Nide; Sachiko Hayashida, 2006, 860-866
  • Refereed, The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications, Design of an Integrated Database System for Short-Term Earthquake Prediction, JOE Kazuki; Chisato Ishikawa; Hiroyasu Kamo; Naoyuki Nide, 2006, 853-859
  • Refereed, The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications, Another RSS Reader with Visualization of Structured Documents and Effective Navigation, JOE Kazuki; Satomi Hara; Hiroyasu Kamo; Naoyuki Nide, 2006, 874-880
  • Refereed, Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, JOINT CONFERENCE INFORMATION SCIENCES, Rule-set evaluation of article relevance for autonomous bibliography databases, L Pichl; M Suzuki; D Kato; K Joe; A Sasaki, Text relevance assessment in data mining is usually dealt with by various artificial intelligence based methods. This paper focuses on one important case - computerized decision whether a certain scientific article contains numerical data of interest for a specialized research database or not. The area of applications covers activities of most major research data centers, with applications ranging from proteomics to fusion plasma research. As a part of coordinated research on plasma-process bibliography databases at the National Institute for Fusion Science in Japan (NIFS), we have recently developed a linux system that automates the process of data collection, data extraction and database input, with a customizable interface to relevance-assessment software modules. Here we deal with the article relevance assessment from two major viewpoints: a rule-based decision making system based on the analysis of figure and table caption texts, and a machine learning system that analyzes html abstracts of the articles. It is demonstrated that a combination of the two methods may result in a highly specific and sensitive relevance assessment system. Features unique in atomic and molecular data mining are also discussed., 2005, 1453, 1456, International conference proceedings
  • Refereed, 6th International Conference on Music Information Retrieval, Towards A Fast and Efficient Match Algorithm for Content-Based Music Retrieval on Acoustic Data, JOE Kazuki; Yi Yu; Chiemi Watanabe, 2005, 696-701
  • Refereed, DATABASES IN NETWORKED INFORMATION SYSTEMS, PROCEEDINGS, SPRINGER-VERLAG BERLIN, Networked mining of atomic and molecular data from electronic journal databases on the Internet, L Pichl; M Suzuki; K Joe; A Sasaki, Several centers of atomic and molecular data in the world maintain research databases for use in fusion plasma simulations, hadron therapy, modelling the universe and other areas. Among the data center activities, collection of experimental and theoretical results across the world has been of major importance. This includes the identification, relevance assessment and retrieval of journal articles, followed by the data extraction, data mining, format conversion and data input. The methodology of the process still largely relies on working groups of specialists and part-time human labor, in spite of recent modernization in journal publishing, especially the electronic journals newly available in subscription domain and the free-access online abstract databases. This work focuses on automating the above procedure to the maximum extent possible. In particular, we design a download robot that performs query search and abstract retrieval for the candidates of relevant articles over the internet at first stage,. followed by fultext retrieval (pdf format), text extraction and a deterministic relevance judgement. As a demonstration, we have also developed a bibliography database for electron-molecule collisions that automatically updates its contents over the internet in regular time intervals. The present work belongs to the project for evolutional data collecting system supported by a JSPS project which involves several research institutes., 2005, 3433, 159, 170, Scientific journal
  • Refereed, PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, C S R E A PRESS, Extracting seismic electronic signals from the Telluric Current Data for the Nigata Chuetsu earthquake by ICA, C Ishikawa; C Watanabe; T Nagao; K Joe, This paper presents the results where we apply ICA(Independent Component Analysis) to TCD(Telluric Current Data.) observed in 2004 when the Nigata Chuetsu earthquake occurred, and detect SESs (Seismic Electric Signals). Detecting SESs from TCD is an effective method for short-term, earthquake prediction. In Japan, however, detecting SESs from TCD is considered as a difficult task because of train noise embedded in TCD. It becomes easy if we can separate train noise and SESs. Therefore, we investigate the application of ICA for the separation., 2005, I, 488, 494, International conference proceedings
  • Refereed, PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, C S R E A PRESS, Text classification for constructing an atomic and molecular journal database by LVQ, H Kashiwagi; C Watanabe; A Sasaki; K Joe, Atomic and molecular, data is essential in various research fields. The reliable data have been found in journal papers, and experts have tried to accumulate them as their own database. We can obtain necessary data out of online journals as a digital paper with the progress of web search engines. We need to classify the online papers to obtain the data. However, the classification is difficult because there are just abstracts available on web pages, or the number of papers to be download are limited. Using an LVQ algorithm, we propose a method to know whether a given online paper contains the atomic and molecular data using just the abstract. In this paper, we report a prototype system and its implementation as well as preliminary experimental results., 2005, I, 481, 487, International conference proceedings
  • Refereed, PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, C S R E A PRESS, Visualization of seismic wave data by volume rendering and its application to an interactive query tool, A Uemura; C Watanabe; K Joe, We propose the Queryball model, which is a new style interaction model for a 3D visualization system. Queryball, which is a translucent ball, has search conditions, and two types of display methods. By locating a Queryball on the region of interest, users can observe just the objects they are interested in with emphasizing them and having other objects disappear. Users can change the region of interest by changing the area specification of the Queryball interactively. Although Queryball is useful for interactive analyze of various kinds of data, we need to consider and provide various usage of Queryball. In this paper, as the first step for providing such examples, we visualize seismic wave data and the underground structure of the earth. We apply some Queryballs to the results which are obtained by a volume rendering technique and an appropriate transfer function by examining the data distribution., 2004, I, 366, 372, International conference proceedings
  • Refereed, PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, C S R E A PRESS, A query description model and its implementation as an interactive query tool for visualization systems, A Ishida; C Watanabe; K Joe, In this paper, we describe the development of a query definition support environment for Queryball, which is a new style of interaction tools developed at Nara Women's University. Queryball is a translucent ball, which has query conditions and visualization methods. Users can apply a query just inside the ball, and modify the area where the query is applied by moving and overlapping Queryballs. We propose several query models for Queryball using a description model named visualization pipeline. Based on the models, we developed a Queryball definition support environment with two description modes; one is to use a script language, the other is to use a visual programming tool. By using the visual programming tool, user can browse and edit the definitions of Queryball easily, intuitively, and graphically., 2004, I, 359, 365, International conference proceedings
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, iアプリを用いた数値計算の可能性, JOE Kazuki, 2004, 46, SIG2, 47-55
  • Refereed, PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, C S R E A PRESS, A multi-objective genetic algorithm for program partitioning and data distribution using TVRG, M Takata; T Yamaguchi; C Watanabe; Y Nakamura; K Joe, We propose an algorithm that performs data distribution and parallelization simultaneously. The objectives of the simultaneous algorithm are to reduce the length of critical path and the total memory size. Regardless to say, memory usage for each processor must be balanced. To obtain an optimal solution, we first adopted a branch and bound method. Since the branch and bound method often fails in the case of a large task graph, we adopt a multi-objective genetic algorithm, that provides a near optimal solution. For effective simultaneous partitionings, we employ some edge sorting and ordering methods. The effectiveness of our simultaneous partitioning algorithms is shown by experimental results., 2004, I, 345, 351, International conference proceedings
  • Refereed, 4th International Conference on Atomic and Molecular Data and Their Applications, Design and implementation of an evolutional data collecting system for the atomic and molecular databases, JOE Kazuki; Akira Sasaki; Hiroe Kashiwagi; Chiemi Watanabe; Manabu Suzuki; Lukas Pichl; Masatoshi Ohishi; Daiji Kato; Masatoshi Kato; Takako Kato, 2004, 348-351
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, Webコミュニティ探索のための量子アルゴリズムの提案と検証, JOE Kazuki; 大音真由美; 中條拓伯, 2003, 44, SIG7, 26-34
  • Refereed, 情報処理学会論文誌:コンピュータシステム, 擬似スペクトル法を用いた乱流場の直接数値シミュレーションの並列化と性能評価, JOE Kazuki; 高田雅美; 山本義暢; 庄野逸; 功刀資彰, 2003, 44, SIG6, 45-54
  • Refereed, PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, C S R E A PRESS, Reduction and classification of input parameters for large-scale simulations, H Matsuyama; Y Matsuoka; M Koganeyama; C Watanabe; K Joe; Y Ueshima, Large-scale simulations in various fields are performed because they are available and inexpensive as a result of widespread use of high performance computers, networks and visualization methods. An integrated management system for simulation cycles has been developed. However, the existing management system often requires complex operation for data management. We investigate an autonomous agent system that advises the simulation users about management operation for large-scale simulations. Specifically, we develop an input parameter customizing agent which is a part of the agent system. As the first prototype of the agent, we analyze input parameter sets for large-scale simulations at JAERI Kansai Research Establishment Advanced Photon Research Center. In this paper, we propose an input parameter analysis method, input parameter sets are reduced to smaller dimensions using Principal Component Analysis (PCA), and classified using learning Vector Quantization (LVQ) according to simulation types. The validation of the input parameter analysis method is presented by experiments., 2003, III, 1127, 1133, International conference proceedings
  • Refereed, PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, C S R E A PRESS, Queryball: A new model for querying in immersive VR systems, C Watanabe; A Osugi; Y Masunaga; K Joe, In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. In immersive VR systems, users expect intuitive and heuristic interactive operations derived from empirical knowledge in the real world. As a possible method for the interactive operations, interaction by virtual tools has been proposed. However, intuitive and heuristic query interaction by virtual tools is too difficult to be performed, because query interaction in immersive VR systems cannot be represented as concrete virtual objects. Queryball is a new style of querying model for intuitive and heuristic query interaction. Queryball, which is a translucent ball, is defined as a quadruple of area specification, search condition, and two types of display methods. The search condition can be applied only to the virtual objects inside of the Queryball. The query results are shown to the user according to the display method. The position and radius of the Queryball changes when the user moves the Queryball interactively with observing the query results., 2003, III, 1106, 1112, International conference proceedings
  • Refereed, 日本データベース学会 Letters, Queryball: 没入型VRシステムのための対話的な問合せモデル, JOE Kazuki; 渡辺知恵美; 増永良文, 2003, 2, 2, 25-28
  • Refereed, PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, C S R E A PRESS, Specification of a parallel I/O control agent for large-scale simulation users, Y Matsuoka; H Matsuyama; M Koganeyania; C Watanabe; Y Ueshima; K Joe, An integrated management system for large-scale simulations saves the output data simulation results without considering the amount of empty space on the disks in the data servers. The present problem is inefficient operations on the data servers because each the disk sizes on the data server are unbalanced. We design and implement a prototype parallel I/O control agent for large-scale simulation data servers which supervises the data servers, makes suggestions to users and moves data flies between disks to keep disk sizes well-balanced., 2003, III, 1120, 1126, International conference proceedings
  • Refereed, 4th International Symposium on Independent Component Analysis and Blind Signal Separation, An Effective Evaluation Function for ICA to Separate Train Noise from Telluric Current Data, JOE Kazuki; Mika Koganeyama; Sayuri Sawa; Hayaru Shouno; Toshiyasu Nagao, 2003, 867-872
  • Refereed, The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, Design and Implementation of Unimodular Transformation on PROMIS, JOE Kazuki; Hisako Ishiuchi; Tomomi Yamaguchi; Hayaru Shouno, 2002, III, 1438-1443
  • Refereed, The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, Quantum Algorithm for Searching Web Communities, JOE Kazuki; Mayumi Oto; Masami Takata; Hiroaki Yoshida, 2002, I, 260-266
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, 量子コンピュータ実現に向けた量子命令セットについて, JOE Kazuki, 2002, 43, SIG7, 19-28
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, ICAを用いた地電流データからの電車ノイズおよび地震前兆シグナルの分離, JOE Kazuki, 2002, 43, SIG7, 92-104
  • Refereed, The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, An Improvement of Program Partitioning Based Genetic Algorithm, JOE Kazuki; Masami Takata; Hayaru Shouno, 2002, I, 215-221
  • Refereed, The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications,, Classification of Visualized Data Dependence, JOE Kazuki; Asami Iwasaka; Tomomi Yamaguchi; Mariko Sasakura; Hayaru Shouno, 2002, III, 1444--1450
  • Refereed, The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, Parallelization of Seismic Wave Calculation by Impulse Response\nFunctions, JOE Kazuki; Kyoko Fukuda; Toshihiko Hayakawa; Hayaru Shouno, 2002, III, 1465-1471
  • Refereed, International Workshop on Advanced Compiler Technology for High Performance and Embedded Systems, Task and Variable Representation Graph: An Intermediate Representation of Parallelizing Compilers for Distributed Shared Memory Systems, JOE Kazuki; Haneda, M; Shouno, H, 2001, 47-55
  • Refereed, PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, C S R E A PRESS, MIRAI: Automatic parallelizing and distributing compiler based on cc-COMA approach, T Uehara; T Nakanishi; M Mineo; S Saito; K Joe; A Fukuda; Y Kunieda, This paper describes the outline of the design and implementation of MIRAI, an automatic parallelizing and distributing compiler for PC clusters. The compiler is designed in cc-COMA framework, cc-COMA stands for "compiler-controlled cache only memory architecture" which is proposed as a basis for developing automatic parallelizing compilers. In this framework, the compiler generates object code along with the embedded software libraries to handle distributed shared memory provided by the runtime system. MIRAI generates object code for Fagus which is a software distributed shared memory system for a cluster of PCs. The compiler is also integrated with the visualization tool to allow users to restructure their program interactively., 2001, 1193, 1199, International conference proceedings
  • Refereed, PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, C S R E A PRESS, A possible instruction set for quantum computer architectures, M Oto; H Nakajo; K Joe, The research of quantum computers, which is a noteworthy topic nowadays, consists of two major directions: 1) quantum devices/elements and 2) algorithms on quantum Turing machine. Although both are quite important and basic research for quantum computers, we believe another approach from computer architecture side is required to obtain real quantum computers. We have investigated the possible architecture for quantum computers. In this paper, we first propose a possible instruction set for quantum computer architectures. Using the instructions, we present programs of five well-known quantum algorithms. Based on the program model, we furthermore propose a processor architecture for quantum computers., 2001, 1221, 1227, International conference proceedings
  • Refereed, 5th International Conference and Exhibition on High-Performance computing in the Asia-Pacific Region, Effective Parallelization of a Turbulent Flow Simulation, JOE Kazuki; Takata, M; Yamamoto, Y; Shouno, H; Kunugi, T, 2001, CD-ROM Proceedings
  • Refereed, PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, C S R E A PRESS, Detecting seismic electric signals by LVQ based clustering, K Fukuda; M Koganeyama; H Shouno; K Joe; T Nagao, Aiming at short-term prediction of earthquakes, we have proposed the use of neural networks for analyzing telluric current data observed by the VAN method. We have already tried a telluric CUM-Cat data analysis method with learning Vector Quantization. In this paper, we will show preliminary experimental results for categorization of telluric current data by its frequency for the Izu islands earthquakes in Japan., 2001, 1305, 1311, International conference proceedings
  • Refereed, 3rd International Conference on Independent Component Analysis and Blind Signal Separation, Separation of Train Noise and Seismic Electric Signals from Telluric Current Data by ICA, JOE Kazuki; Koganeyama, M; Shouno, H; Nagao, T, 2001, CD-ROM Proceedings
  • Refereed, PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, C S R E A PRESS, The design and implementation of a UIR interface for the MIRAI parallelizing compiler, T Yamaguchi; H Shouno; K Joe, Since UIRs (Universal Intermediate Representations) for parallelizing compilers are a complicated arid the data set involved is quite large. Implementation, porting and maintenance of various optimizations are quite difficult, To overcome this problem, we propose a set of standard operations to a UIR of a parallelizing compiler as a UIR interface. In this paper, the specification and implementation issues of the UIR interface arc presented, and implementation examples of several tool, transformation methods are given and evaluated., 2001, 1200, 1206, International conference proceedings
  • Refereed, INNOVATIVE ARCHITECTURE FOR FUTURE GENERATION HIGH-PERFORMANCE PROCESSORS AND SYSTEMS, IEEE COMPUTER SOC, A heuristic approach to improve a branch and bound based program partitioning algorithm, M Takata; Y Kunieda; K Joe, In this paper we propose several heuristics that improve the branch and bound based program partitioning algorithm proposed by Girkar et. al., and evaluate the effectiveness by experiments. The heuristic depends heavily on the element order of edges of a given task graph. Therefore, it is necessary to sort the edges carefully to make effective use of the heuristic. Different sorting methods are investigated and experimentally evaluated. Approximate solutions that provide a sufficient practical partitioning were obtained using the accelerated heuristic, and execution times and error compared to the optimal solutions decreased considerably by sorting the edges of the task graph., 2000, 105, 114, International conference proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Collaboration of Parafrase-2 and NaraView for effective parallelization supports, M Haneda; M Sasakura; U Nagashima; Y Kunieda; K Joe, To use parallel computer systems effectively, users need to reconstruct programs, and applications into parallel their sequential parallelization is not easy work for general users. Parallelizing compilers were developed to solve this problem but it is still quite difficult to parallelize applications correctly, efficiently, and automatically For this reason, some parallelization support tools are desired. NaraView, as one of the support tool, visualizes a given program by extracting internal information from a parallelizing compiler Parafrase-2. In this paper, we validate the usefulness of NaraView by parallelizing a real application., 2000, 635, 641, International conference proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Removing train noise from telluric current data by neural networks for automatic short-term earthquake prediction in Japan, M Koganeyama; M Sugita; T Nagao; K Joe, The goal of this research is to obtain a practicable and reliable method for short-term earthquake prediction to detect seismic electric signals in telluric current data, which is used for the VAN method, by computers automatically. In this paper we perform experiments to know Cf neural networks can be applied to the reduction of train noise from telluric current data, which is considered as the main problem for the effective use of the VAN method in Japan and describe the experimental results., 2000, 659, 665, International conference proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Accelerated program partitioning algorithm - An improvement of Girkar's algorithm, M Takata; Y Kunieda; K Joe, In this paper, we propose several heuristics that improve the branch and bound based program partitioning algorithm proposed by Girkar et. al., and indicate the effectiveness by experiments. The heuristic depends on the element order of edges of given task graphs deeply. Therefor, it is needed to sort edges pertinently for the effective use of the heuristic. The ways of sorting are investigated with experiments. As the results of the experiments, it turned out that approximate solutions, which provide enough practical partitionings, by accelerated heuristic is obtained, and execution times and errors to optimal solutions decrease considerably by sorting edges., 2000, 699, 705, International conference proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Intuitive data partitioning by a simple physical model and its visualization, M Sugita; M Outo; M Sasakura; Y Kunieda; K Joe, For the efficient use of distributed memory systems, we face to data partitioning problem as well as program partitioning problem. That is how data and tasks are divided into distributed memory modules. In this paper, we propose intuitive data partitioning using the capability of human's visual recognition. To take full advantage of the capability, we use visualized information of given programs to be partitioned. In our visualization system, data and tasks are represented by an intermediate representation of a parallelizing compiler, and roughly clustered according to access costs described by a physical model between data and tasks. Users can decide a partitioning of data and tasks by looking at the visualized information. We show several example figures generated by our system., 2000, 729, 735, International conference proceedings
  • Refereed, The 4th International Conference on Supercomputing in Nuclear Applications, Automatic Short-term Earthquake Prediction by Neural Network - System Design and Expected Amount of Computation for Learning -, JOE Kazuki; Koganeyama, M; Sugita, M; Nagao, T, 2000, CD-Rom Proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Design and implementation of an automatic parallelizing and distributing compiler with visualization tools and the runtime environment, Y Kunieda; K Joe; A Fukuda; T Uehara; S Saito; T Saito; M Sasakura; T Nakanishi, This paper describes the outline of the research project to develop a fully-automatic parallelizing and distributing compiler for distributed-memory machines. The compiler is designed on. the framework of "Compiler-controlled cache only memory architecture (cc-COMA)" which is to develop the compiler to generate object code along with the embedded software libraries to handle distributed shared memory provided by the runtime system. To realize automatic data partitioning and distribution, Data Partitioning Graph (DPG) is introduced as the universal intermediate representation (UIR) in the compiler. The compiler is integrated with the visualization tool to allow interactive restructuring of the program by users. The runtime environment to realize software-controlled COMA runtime environment on networks of workstations (NOWs) is also provided., 2000, 713, 719, International conference proceedings
  • Refereed, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, C S R E A PRESS, Wind: a Low-Costs Communication module for software DSM systems, S Saito; A Hayashi; T Uehara; K Joe; Y Kunieda, We are developing a Lour-Costs Communication module named "Wind" for software DSM(Distributed Shared Memory) systems. Wind is built in a Linux kernel, and can, copy directly each packet from the buffer for UDP (User Datagram Protocol) into the specified location, of virtual address space which assigned far a user process without any context switches between the kernel and the user process. Therefore Wind males it possible that user processes even, on a heavy load computer can receive every packet without loss. Wind is mainly aimed at transporting one page data of DSM. This paper shows an implementation and performance evaluations of Wind., 2000, 721, 727, International conference proceedings
  • Refereed, INNOVATIVE ARCHITECTURE FOR FUTURE GENERATION HIGH-PERFORMANCE PROCESSORS AND SYSTEMS, IEEE COMPUTER SOC, Laurasia and Wind: a compiler-controlled software DSM for WS/PC clusters, T Uehara; S Saito; K Joe; Y Kunieda, We have proposed an approach to build an automatic parallelizing compiler for various parallel computer architectures by providing COMA (Cache-Only Memory Architecture) environment that can be controlled by the compiler. This paper presents the design and implementation of a software DSM (Distributed Shared Memory) system named "Laurasia". It also describes a Low-Costs Communication module named "Wind" which is developed to accelerate the performance of Laurasia. Laurasia is designed to run on a cluster of UNIX Workstations or PCs, and Wind is built in a Linux kernel to eliminate context switches between the kernel and the user process., 2000, 87, 93, International conference proceedings
  • Refereed, INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, KLUWER ACADEMIC/PLENUM PUBL, NaraView: An interactive 3D visualization system for parallelization of programs, M Sasakura; K Joe; Y Kunieda; K Araki, For effective use of parallelizing compilers, an interactive environment which allows users to find more parallelism is needed. As the first step towards building such an environment, we have developed a program visualization system named NaraView. In this paper, we describe two visualization methods in NaraView. One is Program Structure View which illustrates the hierarchical loop structure of a given program and suggests which parts of the program can be parallelized. Another is the Data Dependence View which visualizes each data dependence on every variable or array element which is accessed in a specific loop. By using these views, users can easily understand which part of the program can be parallelized further. We also show several examples to demonstrate the efficiency of these methods., Apr. 1999, 27, 2, 111, 129, Scientific journal
  • Refereed, Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems, IEEE Computer Society, A heuristic approach to improve a branch and bound based - Program partitioning algorithm, Masami Takata; Yoshitoshi Kunieda; Kazuki Joe, In this paper, we propose several heuristics that improve the branch and hound based program partitioning algorithm proposed by Girkar et. al, and evaluate the effectiveness by experiments. The heuristic depends heavily on the element order of edges of a given task graph. Therefore, it is necessary to sort the edges carefully to make effective use of the heuristic. Different sorting methods are investigated and experimentally evaluated. Approximate solutions that provide a sufficient practical partitioning were obtained using the accelerated heuristic, and execution times and error compared to the optimal solutions decreased considerably by sorting the edges of the task graph., 1999, 1999-, 105, 113, International conference proceedings
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, リリース・コンシステンシ・モデルとその実現の形式的仕様記述について, JOE Kazuki, 1999, 40, SIG9, 1-17
  • Refereed, ACM ICS Workshop on Scheduling Algorithms for Parallel / Distributed Computing -- From Theory to Practice--, A Visualization Method for a Universal Intermediate Representation of Parallelizing Compilers, JOE Kazuki; Sasakura, M; Kunieda, Y; Araki, K, 1999, 55-62
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, 変数オリエンティッドなデータ依存関係モデルの提案, JOE Kazuki, 1999, 40, SIG2, 45-54
  • Refereed, Journal of Supercomputing, Kluwer Academic Publishers, Object-oriented framework for loop parallelization, Youichi Omori; Akira Fukuda; Kazuki Joe, Generation of efficient parallel code is a major goal of a well-designed and developed parallelizing compiler. Another important goal is portability of both compiler system and the resulting output source codes. The various choices of current and future parallel computer architectures as well as the cost of developing a parallelizing compiler make portability a very important design goal. Since the design of parallelizing compilers is considerably move complex than designing conventional compilers, it is very important to achieve both efficiency and portability. To meet this dual goal, we have investigated the application of object oriented design to parallelizing compilers. Our parallelizing compiler design is based on abstractions of intermediate representations of loops and their class definitions. In this paper, we address the problem of loop parallelization and propose a framework where the loop parallelization process is divided into three phases and the optimization of loops is performed via a cyclic application of these three phases. The class of each phase is hierarchically derived from intermediate representations of loops. This facilitates the portability of the resulting parallelizing compilers. Furthermore, one of the phases uses a reservation table of hardware resources in order to obtain optimized parallel programs for given hardware resources. The validation of the proposed framework is given through the application of the object oriented design on an example program which is then parallelized efficiently., 1999, 13, 1, 57, 69, Scientific journal
  • Refereed, International Conference on Parallel Architectures and Compilation Techniques, The Modulo Interval: A Simple and Practical Representation for Program Analysis, JOE Kazuki; Nakanishi, T; Polychronopoulos, C. D; Fukuda, A, 1999, 91-96
  • Refereed, ACM ICS Workshop on Scheduling Algorithms for Parallel / Distributed Computing -- From Theory to Practice--, Introducing Artificial Neural Networks to estimate lower bounds for a Branch and Bound Based Program Partitioning Algorithm, JOE Kazuki; Saito, T; Nakanishi, T; Sasakura, M; Kunieda,\n Y; Fukuda, A, 1999, 13-20
  • Refereed, 情報処理学会論文誌:数理モデル化と応用, A Combined Data and Program Partitioning Algorithm for Distributed Memory Parallel Computers, JOE Kazuki; Nakanishi, T; Polychronopoulos, C; Fukuda, A, 1999, 40, SIG9, 30-41
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, C S R E A PRESS, An implementation of loop transformations with a Universal Intermediate Representation interface library, K Kambe; T Nakanishi; K Joe; Y Kunieda; F Kako, This paper presents an implementation of a Universal Intermediate Representation (UIR) interface library for a parallelizing compiler Narafrase, and experimental evaluation results of the interface library through the implementation of two well-known loop transformations, loop distribution and loop permutation, are obtained. The UIR interface separates designers (who implement UIRs) and users (who implement program transformations). Therefore the interface library mal;es most program transformations independent of implementation, details of the UIR data structures, which encapsulate all information, necessary to exploit parallelism. Furthermore. we can obtain the portability of program transformations to other compiler environments with the interface library. By the experimental evaluation results, we prove that we can develop loop transformation techniques easily and efficiently with the interface library including not only a primitive library set (basic library functions) but also an. application, library set (sophisticated library functions)., 1999, IV, 1905, 1911, International conference proceedings
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, C S R E A PRESS, Converting different intermediate representations of parallelizing compilers: A case study, N Soyama; T Nakanishi; K Joe; Y Kunieda; F Kako, Many researchers of parallelizing compilers have proposed various design and implementation schemes of intermediate representations (IRs) for the last several decades. The foundation of ms seems to reach some common ideas, nevertheless they have actually spent much time to complete the foundation of ms individually. Recently the concept of universal IRs (UIRs) has been proposed for such general purpose schemes. According to the schemes, different IRs should be integrated even after Weir implementations, but it may be hard to obtain common UIRs practically. lit. this paper, we compare different Ins of two parallelizing compilers, then we show the possibility of the conversion of different Ins. As a result, we find that it is practically possible to convert different IRs except some implementation details of the IR data structures, and there are many similarities between different IRs., 1999, IV, 1874, 1880, International conference proceedings
  • Refereed, INNOVATIVE ARCHITECTURE FOR FUTURE GENERATION HIGH-PERFORMANCE PROCESSORS AND SYSTEMS, IEEE COMPUTER SOC, cc-COMA: the compiler-controled COMA as a framework for parallel computing, S Saito; T Uehara; K Joe; Y Kunieda, In order to provide a fully-automatic parallelzing compiler with the function of both automatic data partitioning and distribution, we propose a compiler-controlled cache only memory architecture (cc-COMA). The cc-COMA runtime system is based on a, software-emulated COMA which covers a variety of parallel architectures from NUMA to NOW. The compiler generates both the user code and control code for the emulated cache based on the Entry Consistency model. The runtime system of cc-COMA executes the generated code following the suggestions of the compiler. In this paper we present art outline of what we call cc-COMA system. It is also described about an implementation of the cc-COMA runtime system for networks of workstations, named Laurasia., 1999, 114, 119, International conference proceedings
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, C S R E A PRESS, The design and implementation of cc-COMA as a platform for distributed-memory machines, T Uehara; S Saito; K Joe; Y Kunieda, "Compiler-controlled cache only memory architecture (cc-COMA)" is proposed as a framework to develop fully-automatic parallelizing compilers for distributed-memory machines. A cc-COMA system consists of the runtime system to realize virtually shared memory like a COMA machine on the distributed memory and the compiler which generates object code along with the embedded primitives to maintain the cache coherency. This paper presents all experimental implementation of a cc-COMA runtime environment named "Laurasia". Laurasia realizes the software-controlled COMA runtime environment on networks of workstations (NOW's) along with the compiler interface to maintain coherency among the nodes. The experimental result shows that the performance of parallel programs can be dramatically improved by the embedded code inserted by the compiler that controls the cache coherency., 1999, V, 1946, 1952, International conference proceedings
  • Refereed, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, Analytic modeling of updating based Cache coherent parallel computers, K Joe; A Fukuda, In this paper, we apply the Semi-markov Memory and Cache coherence Interference (SMCI) model, which we had proposed for invalidating based cache coherent parallel computers, to an updating based protocol. The model proposed here, the SMCI/Dragon model, can predict performance of cache coherent parallel computers with the Dragon protocol as well as the original SMCI model for the Synapse protocol. Conventional analytic models by stochastic processes to describe parallel computers have the problem of numerical explosion in the number of states necessary as the system size increases. We have already shown that the SMCI model achieved both the small number of states to describe parallel computers with the Synapse protocol and the inexpensive computation cost to predict their performance. In this paper, we demonstrate generality of the SMCI model by applying it to the another cache coherence protocol, Dragon, which has opposite characteristics than Synapse. We show the number of states required by constructing the SMCI/Dragon model is only 21 which is as small as SMCI/Synapse, and the computation cost is also the order of microseconds. Using the SMCI/Dragon model, we investigate several comparative experiments with widely known simulation results. We found that there is only a 5.4% differences between the simulation and the SMCI/Dragon model., Jun. 1998, E81D, 6, 504, 512, Scientific journal
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, C S R E A PRESS, Specification and verification of memory consistency models for shared-memory multiprocessor systems, S Takata; K Taguchi; K Joe; A Fukuda, In this paper we will formally specify and verify memory consistency models for shared-memory multiprocessor systems, focusing on causal memory consistency model, by use of a formal specification technique proposed by Taguchi and Araki. The formal specification technique includes a language, which is based on the combination of the Z notation and CCS (Calculus of Communicating Systems), and the state-based CCS semantics, which integrates Z and CCS semantics. Causal memory requires that a read operation obtains the value that is consistent with other causally related read and write operations. A formal definition, implementation and verification of the causal memory have already been presented by Ahamad and Hutto. We will formally specify the behavior of the causal memory by the combination of Z and CCS and verify that the specified causal memory meets the causal memory consistency condition using the extended state-based CCS semantics., 1998, 40, SIG2, 923, 930, International conference proceedings
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, C S R E A PRESS, NaraView: a visualization system for parallelization of programs, M Sasakura; K Joe; Y Kunieda; K Araki, For effective use of parallel computers, a tool which assists users to know the way of parallelization is needed. Since we believe visualization is a useful tool for parallelization, we are developing a tool named NaraView which visualizes the information from parallelizing compilers for helping users to understand programs. In this paper, we propose two visualization methods in NaraView, which are 3D visualization of program structure and data dependence., 1998, 931, 932, International conference proceedings
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, C S R E A PRESS, Specification and verification of memory consistency models for shared-memory multiprocessor systems, S Takata; K Taguchi; K Joe; A Fukuda, In this paper we will formally specify and verify memory consistency models for shared-memory multiprocessor systems, focusing on causal memory consistency model, by use of a formal specification technique proposed by Taguchi and Araki. The formal specification technique includes a language, which is based on the combination of the Z notation and CCS (Calculus of Communicating Systems), and the state-based CCS semantics, which integrates Z and CCS semantics. Causal memory requires that a read operation obtains the value that is consistent with other causally related read and write operations. A formal definition, implementation and verification of the causal memory have already been presented by Ahamad and Hutto. We will formally specify the behavior of the causal memory by the combination of Z and CCS and verify that the specified causal memory meets the causal memory consistency condition using the extended state-based CCS semantics., 1998, 2, 923, 930, International conference proceedings
  • Refereed, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, C S R E A PRESS, NaraView: a visualization system for parallelization of programs, M Sasakura; K Joe; Y Kunieda; K Araki, For effective use of parallel computers, a tool which assists users to know the way of parallelization is needed. Since we believe visualization is a useful tool for parallelization, we are developing a tool named NaraView which visualizes the information from parallelizing compilers for helping users to understand programs. In this paper, we propose two visualization methods in NaraView, which are 3D visualization of program structure and data dependence., 1998, 27, 2, 931, 932, International conference proceedings
  • Refereed, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, Naraview: An interactive 3d visualization system for parallelization of programs, Mariko Sasakura; Kazuki Joe; Keijiro Araki, For effective use of parallelizing compilers, an interactive environment which allows users to instruct the way of parallelization is needed. As the first step to build such an environment, we have developped a program visualization system named Nara View. The system provides two powerful methods for 3D visualization of program structure and data dependence. 3D visualization of program structure illustrates a hierarchical loop structure of given programs and suggests which parts of the program have been parallelized. 3D visualization of data dependence explains each data dependence on any variable or array element which is accessed at a specific loop. By using these methods, users can easily understand which part of the program should be more parallelized. We also show several examples to demonstrate the efficiency of these methods., 1997, 1336, 231, 242, International conference proceedings
  • Refereed, COMPSAC 97 : TWENTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, I E E E, COMPUTER SOC PRESS, A parallelizing compiler by object oriented design, Y Omori; K Joe; A Fukuda, Applying conventional compiler design methodology to a parallelizing compiler, ids internal data structures tend to get too complicated quickly, Thus, we introduce object oriented design from the problem analysis stage and achieve the following improvements: 1) consistent modeling from the theory to the implementation, 2) reduced program sire through improved reusability based on better class design methodology, and 3) flexible coding through a stub class far parallelization. We extract objects based on stream and thus clarify similarities and differences to the conventional design schemes. Then, we show the framework of the internal classes used in our parallelizing compiler which enhances design-level reusability in C++ implementation of the compiler. Furthermore, toe provide a virtual class to be used as a unit of MIMD style parallel execution and mate it a common representation among different parallelization algorithms. Finally, we compare our design against SUIF, which abo uses C++, and show the improvements on the design classes., 1997, 232, 239, International conference proceedings
  • Refereed, Journal of Supercomputing, Kluwer Academic Publishers, Object-oriented framework for loop parallelization, Youichi Omori; Akira Fukuda; Kazuki Joe, Generation of efficient parallel code is a major goal of a well-designed and developed parallelizing compiler. Another important goal is portability of both compiler system and the resulting output source codes. The various choices of current and future parallel computer architectures as well as the cost of developing a parallelizing compiler make portability a very important design goal. Since the design of parallelizing compilers is considerably move complex than designing conventional compilers, it is very important to achieve both efficiency and portability. To meet this dual goal, we have investigated the application of object oriented design to parallelizing compilers. Our parallelizing compiler design is based on abstractions of intermediate representations of loops and their class definitions. In this paper, we address the problem of loop parallelization and propose a framework where the loop parallelization process is divided into three phases and the optimization of loops is performed via a cyclic application of these three phases. The class of each phase is hierarchically derived from intermediate representations of loops. This facilitates the portability of the resulting parallelizing compilers. Furthermore, one of the phases uses a reservation table of hardware resources in order to obtain optimized parallel programs for given hardware resources. The validation of the proposed framework is given through the application of the object oriented design on an example program which is then parallelized efficiently., 1999, 13, 1, 57, 69, Scientific journal
  • Refereed, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, Analytic modeling of cache coherence based parallel computers, K Joe; A Fukuda, In this paper, we propose an analytic model using a semi-markov process for parallel computers which provides hardware support for a cache coherence mechanism. The model proposed here, the Semi-markov Memory and Cache coherence Interference model, can be used for the performance prediction of cache coherence based parallel computers since it can be easily applied to descriptions of the waiting states due to network contention or memory interference of both normal data accesses and cache coherence requests. Conventional analytic models using stochastic processes to describe parallel computers have the problem of numerical explosion in the number of states necessary as the system size increases even for simple parallel computers without cache coherence mechanisms. The number of states required by constructing our proposing analytic model, however, does not depend on the system size but only on the kind of cache coherence protocol. For example, the number of states for the Synapse cache coherence protocol is only 20, as is described in this paper. Using the proposed analytic model, we investigate several comparative experiments with widely known simulation results. We found that there is only a 7.08 % difference between the simulation and our analytic model, while our analytic model can predict the performance of a 1,024 processor system in the order of microseconds., Jul. 1996, E79D, 7, 925, 935, Scientific journal
  • Refereed, The 1996 International Conference on Parallel and Distributed Processing Techniques and Applications, A Data Block Mapping Method to Reduce Cache Coherence Overhead, JOE Kazuki; Koita, T; Fukuda, A, 1996, 2, 691-701
  • Refereed, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, Estimating minimum execution time of perfect loop nests with loop-carried dependences, Tsuneo Nakanishi; Kazuki Joe; Constantine D. Polychronopoulos; Keijiro Araki; Akira Fukuda, We propose a scheme to estimate exact minimum parallel execution time of perfect loop nests with loop-carried dependences at iteration and instruction-level parallelism. We formulate the problem of the estimation as an integer programming problem and solve it with a branch-and-bound scheme combined with the simplex method. Execution time obtained with the proposed scheme is useful to evaluate effects of applications of various optimization or parallelizing techniques for iteration or instruction-level oarallel execution of loons., 1997, 1239, 97, 599, International conference proceedings
  • Refereed, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, Estimating minimum execution time of perfect loop nests with loop-carried dependences, Tsuneo Nakanishi; Kazuki Joe; Constantine D. Polychronopoulos; Keijiro Araki; Akira Fukuda, We propose a scheme to estimate exact minimum parallel execution time of perfect loop nests with loop-carried dependences at iteration and instruction-level parallelism. We formulate the problem of the estimation as an integer programming problem and solve it with a branch-and-bound scheme combined with the simplex method. Execution time obtained with the proposed scheme is useful to evaluate effects of applications of various optimization or parallelizing techniques for iteration or instruction-level oarallel execution of loons., 1997, 1239, 97, 599, International conference proceedings
  • Refereed, Lecture Notes in Computer Science 1124, Applying the Semi-Markov Memory and Cache Coherence Interference Model to an Updating Based Cache Coherence Protocol, JOE Kazuki; Fukuda, A, 1996, 706-713
  • Refereed, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, 3D visualization of program structure and data dependence for parallelizing compilers and parallel programming, Mariko Sasakura; Satoko Kiwada; Kazuki Joe; Tsuneo Nakanishi; Keijiro Araki, For effective use of parallel computers, a tool which assists users to know the way of parallelization is needed. Since we believe visualization is a useful tool for parallelization, we are developing a tool named NaraView for parallelizing Fortran programs. In this paper, we propose two visualization methods in NaraView, which are 3D visualization of program structure and data dependence., 1997, 1239, 591, 593, International conference proceedings
  • Refereed, International Symposium on Parallel and Distributed Supercomputing, An Analysis of the SCIDDLE Library on a Workstation Cluster: A Step Towards a Globally Distributed Locally Parallel Processing Environment, JOE Kazuki; Saito, T; Luthi, H; Arbenz, P; Fukuda, A; Araki, K, 1995, 104-111
  • Refereed, International Conference on Parallel Processing, CDPP Algorithm: Combined Data and Program Partitioning, JOE Kazuki; Nakanishi, T; Saito, H; Fukuda, A; Araki, K, 1995, II, 177-181
  • Refereed, International Conference on Parallel Architectures and Compilation Techniques, A Loop Parallelization Technique for Linear Dependence Vector, JOE Kazuki; Kitasuga, T; Schouten, D; Fukuda, A; Araki, K, 1995, 285-289
  • Refereed, High Performance Computing Conference'94, The Semi-Markov Memory and Cache Coherence Interference Model, JOE Kazuki; Fukuda, A, 1994, 254-265
  • Refereed, International Computer Symposium, A Parametric Simulator For a Parallel Computer Using Address-Trace, JOE Kazuki; Omori, Y; Fukuda, A; Araki, K, 1994, 979-985
  • Refereed, Lecture Notes of Computer Science 892, The Data Partitioning Graph: Extending Data and Control Dependencies for Data Partitioning, JOE Kazuki; Nakanishi, T; Polychronopoulos, C; Fukuda, A; Araki, K, 1994, 170-185
  • Refereed, 2nd International Workshop on Massive Parallelism: Hardware, Software and Applications, An Analytic Model for a Hierarchical Parallel System, JOE Kazuki; Fukuda, A, 1994, 287-304
  • Refereed, SUPERCOMPUTING '93, PROCEEDINGS, I E E E, COMPUTER SOC PRESS, A DISTRIBUTED SHARED-MEMORY MULTIPROCESSOR - ASURA - MEMORY AND CACHE ARCHITECTURES, S MORI; H SAITO; M GOSHIMA; M YANAGIHARA; T TANAKA; D FRASER; K JOE; H NITTA; S TOMITA, 1993, 740, 749, International conference proceedings
  • Refereed, International Workshop on Performance Evaluation on Parallel Systems, An Analytic Model for a Parallel Computer, -- Prediction of Shared Block Behavior --, JOE Kazuki; Fukuda, A, 1993, 67-74
  • Refereed, IJCNN INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-3, I E E E, APOLONN BRINGS US TO THE REAL WORLD - LEARNING NONLINEAR DYNAMICS AND FLUCTUATIONS IN NATURE, M SATO; K JOE; T HIRAHARA, 1990, A581, A587, International conference proceedings
  • Refereed, 2nd Neural Information Processing System, A Large-Scale Neural Network Which Recognizes Hanwritten Kanji Characters, JOE Kazuki; Mori, Y, 1990, 415-422
  • Refereed, Concurrency: Practice and Experience, Construction of a large‐scale neural network: Simulation of handwritten Japanese character recognition on NCUBE, Kazuki Joe; Yoshihiro Mori; Sei Miyake, This paper describes how new learning methods may make it possible for a large‐scale, hierarchical neural network to recognize most Japanese handwritten characters. This is a very large and complex task, as the Japanese character set consists of about 3000 categories which can be written in many different ways. Such a difficult task can lead a neural network to converge very slowly and to yield recognition rates that are uneven between categories. To address these problems we here propose five learning methods as modifications of the conventional back‐propagation learning rule. These methods produce fast convergence, even recognition rates over all categories, and adequate recognition of test samples. We also describe how a large‐scale neural network can be built by dividing the recognition task into several subtasks, with networks for each subtask, and then integrating these subnetworks in a large network with a hierarchical structure. In a hierarchical network, the upper level network directly integrates outputs from each lower level network. Application of that network to handwritten Japanese character recognition has resulted in poor recognition, because lower level networks do not know about unknown input patterns, and the direct integration of ambiguous outputs from many lower level networks confuses the upper level network. We propose a new integration method which provides each subnetwork with more information as to how close an input pattern is to the categories of that subnetwork. This method resulted in high recognition performance for character recognition. We here described the above methods, and report the performance of our implementation of a neural network for the recognition of 71 Hiragana characters, and describe our implementation of this network on a hypercube concurrent computer. Copyright © 1990 John Wiley & Sons, Ltd, 1990, 2, 2, 79, 107, Scientific journal
  • Refereed, International Conference on Fuzzy Logic and Neural Networks, Learning Chaotic Dynamics by Recurrent Neural Networks, JOE Kazuki; Sato, M; Murakami, Y, 1990, 601-604
  • Refereed, 4th Conference of Hypercube Concurrent Computers and Applications, Simulation of a Large-Scale Neural Network on a Parallel Computer -- An Application for Handwritten Japanese Character Recognition--, JOE Kazuki; Mori, Y; Miyake, S, 1989, 2, 1111-1118
  • Seibutsu Butsuri, The Biophysical Society of Japan General Incorporated Association, 3P046 Time-series Analysis of Protein Structure using Feature of Motion(Protein: Structure & Function,The 48th Annual Meeting of the Biophysical Society of Japan), Kamada Mayumi; Toda Mikito; Sekijima Masakazu; Takata Masami; Joe Kazuki, 2010, 50, 2, S153

MISC

  • -2 2020, 127, 11, 1, 6
  • 2- 2020, 131, 18, 1, 6
  • 2- 2020, 131, 12, 1, 6
  • -2 2021, 132, 14, 1, 6
  • -2 2021, 132, 4, 1, 6
  • Not Refereed, 5TH BIOMEDICAL ENGINEERING INTERNATIONAL CONFERENCE (BMEICON 2012), IEEE, Constitution and Phase Analysis of Alpha Waves, Yu Ishikawa; Masami Takata; Kazuki Joe, 2012, 98, 98, Summary international conference
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Prediction of metal binding sites from protein sequence, NAKAZAWA Masami; TAKATA Masami; YOKOTA Kiyonobu; NOGUCHI Tamotsu; SEKIJIMA Masakazu; JOE Kazuki, Metal ion binding has a profound effect on the structure and the function of proteins. Metal proteins play very important roles in life activity. One third of known proteins require metal binding to play their functions. Although conformation of proteins is investigated by using X-ray crystallographic analysis and NMR, these engineered methods require a long time to get information about the binding of metal ion. In this paper, we propose a method for extracting known binding information of metal ion and protein from the PDB (Protein Data Bank), and prediction metal ion binding sites in proteins by using SVM., 26 Feb. 2009, 73, 19, 213, 216
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Feature Detection with Temporal Sequences for 3D Protain Structure Prediction, KIMURA Sachi; TODA Mikito; SEKIJIMA Masakazu; TAKATA Masami; NOGUCHI Tamotsu; JOE Kazuki, Protains move by heat fluctuation with varing their frequency time by time. Such movement can be studied by wavelet analysis applied to frequency change. In this paper, we propose a wavelet based 3D protain structure analysis method to cluster protain structures by movement patterns., 26 Feb. 2009, 73, 19, 97, 100
  • Not Refereed, 第16 回「ハイパフォーマン スコンピューティングとアーキテクチャの評価」に関する北海道ワークショップ(HOKKE-2009)2009-ARC-174/HPC-119, Cell/B.E.とDIMMnetを併用 した大容量ボリュームレンダリングの並列処理性能, 田邊昇; 佐々木愛美; 中條拓伯; 高田雅美; 城和貴, 2009, -
  • Not Refereed, IEICE technical report, The Institute of Electronics, Information and Communication Engineers, Feasibility Study of a Remote Interactive Real-time Visualization System for Huge Data, TANABE Noboru; SASAKI Manami; NAKAJO Hironori; JOE Kazuki, Remote interactive real-time visualization for huge size of data from supercomputer is needed. We propose the remote interactive real-time visualization system using live streaming in H.264 encoding for several Giga byte class volume data. In this paper, feasibility study for the completion of making this system in two years is described. In the case for extremely larger volume data size than the capacity of on-board memory of a COTS GPU card, the probability of accessing remote memory beyond the host interface from the GPU is getting larger. In addition, encoding for video streaming is needed for remote visualization. Therefore, we investigate not only for using many GPUs but also for using many SpursEngines which is one of successors of Cell Broadband Engine (Cell/B. E.) made by Toshiba. From the standpoint of effective use of host interface bandwidth, we investigate for architectural supports in accessing huge memory on volume rendering. From the standpoint of better response and usability for scientists, we investigate for the strategy of volume data compression and pruning when the operators do not always need highest-resolution in visualization., 29 Jul. 2008, 108, 180, 43, 48
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, E-Cell System を用いたアルコール耐性酵母に関するモデル構築, 鎌田 真由美; 仲嶋 なつ; 石川 千里; 高田 雅美; 城 和貴, 14 Jul. 2008, 70, 27, 30
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Room Modeling Method for 3D Video, ISSHIKI Aya; SAKAMOTO Ryuuki; KITAHARA Itaru; KOGURE Kiyoshi; JOE Kazuki, This paper proposes a method to reconstruct the 3D shape model of background regions simply for generating a 3D video, As the progress of computer vision technologies continues, many 3D video systems have been developed that tend to focus on automatic 3D reconstruction to capture target (foreground) objects. On the other hand, the 3D shapes of background regions such as walls and floors are generally made manually using 3D modeling software, i.e., CAD, or as a textured cube that just assumes the room. If we make background models using 3D modeling software, the quality is very high but it costs a lot of time and money. On the other hand, just making a cube is too simple to represent the outer space with sufficient appearance. To solve this problem, we propose a method to reconstruct the background model with simple operations but whose quality remains higher than cubes. In our method, a user needs only to segment multiple background images into several boxes by indicating their vertices as the corresponding points. Prom these data, the 3D coordinates of the vertices are calculated by using a stereo vision algorithm., 07 Jul. 2008, 2008, 65, 1, 4
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Real-time 3D Movie Generation by Anaglyph for Live Streaming, KOHORI Yuki; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, Stereographic pictures are in the public limelight because of the recent innovative improvement of PCs. With high performance computing, image processing is no longer a hard task. Nowadays, Stereographic movies come under the spotlight. The current PCs are so powerful that real-time creation of movie is possible. Meanwhile recent broadband networks enable the streaming of various contents. Especially, live streaming movies are used in various fields. In this paper, -we propose real-time 3D movie generation by anaglyph for live streaming. Using two USB cameras, each captured image is filtered to composite Stereographic image in real-time, and resultant 3D movie is immediately delivered by live streaming. Some experimental results validate that our system is enough practical., 07 Jul. 2008, 2008, 65, 5, 8
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Construction of an Ethanol-Tolerant Yeast Model using the E-cell System, KAMADA Mayumi; NAKAJIMA Natsu; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In brewing Japanese sake, since ethanol reaches to a high concentration by using a peculiar manufacturing method, yeast with strong alcohol tolerance is needed. Such yeast can be obtained through huge number of trial and error processes with huge cost and long time. To avoid this problem, we try to model the response mechanism of alcohol-tolerant yeast by computer simulation based on known parameters from existing literatures. We hope new insight will be obtained by our model. In this paper, we model a simple metabolism of 1,3-β glucan synthesis, which is the major components of cell well, and a signaling pathway of the Pkcl-MAPK cascade using the E-Cell system., 07 Jul. 2008, 2008, 65, 27, 30
  • Not Refereed, IEICE technical report, The Institute of Electronics, Information and Communication Engineers, Development of the training support software for writing motions, YOSHINO Kanako; TAKATA Masami; TENPAKU Seiichi; JOE Kazuki, We develop a training system of hand-write training for children with difficulty of writing motions. The typical training methods are used to trace and to draw characters on a paper, but it is difficult to support the individual ability of the children. A rehabilitation system for handwriting works on a portable type game console, Nintendo DS. So, various learning programs can be provided automatically and repetition study on it is easier than existing paper based one. Moreover, it is an advantage that the learner can study with continued interest since it is provided as games. In this report, we will suggest several training methods of writing motions and describe the software development., 22 May 2008, 108, 67, 79, 83
  • Not Refereed, 電子情報通信学会技術研究報告. SP, 音声, 社団法人電子情報通信学会, 書字運動の訓練支援ソフトウェアの開発(福祉と音声処理,一般), 芳野可奈子; 高田雅美; 天白成一; 城和貴, 我々は,書字運動に困難を抱える児童の書字訓練用に新たにソフトウェアを開発している.従来から利用されている典型的な訓練方法に,紙の上で文字をなぞり書きをする手法があるが,個々の能力に適した対応をするには難しい.新たに開発している書字学習用のリハビリテーション用のソフトウェアは,携帯型ゲーム機ニンテンドーDS上で動作するため,多彩な学習プログラムの自動提供,ならびに紙上で行うよりも反復学習が容易である.さらに,ゲーム性を加えることで学習者の興味を持続できることも利点である.本稿では,書字運動の訓練手法の提案とそれを踏まえた開発中のソフトウェアについて述べる., 22 May 2008, 108, 66, 79, 83
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 「情報処理学会論文誌:数理モデル化と応用」の編集にあたって, 城和貴, 15 Mar. 2008, 49, 4
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, E-Cell System を用いた酵母菌のストレス応答MAPK経路のモデル構築, 仲嶋 なつ; 鎌田 真由美; 石川 千里; 高田 雅美; 城 和貴, 04 Mar. 2008, 68, 1, 4
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, リアルタイム Queryball の開発に向けて, 勅使河原; 佑美; 来見 真理; 石川 千里; 高田 雅美; 城 和貴, 04 Mar. 2008, 68, 5, 8
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Simulation Model for Stress Response MAPK Pathway of Yeast for the E-Cell System, NAKAJIMA Natsu; KAMADA Mayumi; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, It is supposed that yeasts with alcoholic tolerance are suitable to generate high density alcohol in the process of Nippon Shuzo Brewery. Actually, a lot of compensation including the yeast extinction though various experiments are conducted to discover such yeasts. We try to model the response mechanism of yeast cells to alcohol by computer simulation to reduce such compensation. It pays attention to the relation between alcoholic tolerance and yeast cell wall. In this paper, we model a partial cell wall synthesis Pkc1-MAPK pathway using the E-Cell System., 04 Mar. 2008, 2008, 17, 1, 4
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Toward the Development of Real-time Queryball, TESHIGAWARA Yumi; KURUMI Mari; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, Queryball is a tool to understand objects in three-dimensional space. By overlapping a translucent globe with 3D object, it can quiry to the part where the object and the globe come in succession. It can change the display method with visually checking according to various directions. However, the display speed the volume rendering of Queryball to the present stage slows the large size of the object data, and is not for practical use. Therefore, performance improvement by applying GPGPU to the volume rendering part in real time is necessary., 04 Mar. 2008, 2008, 17, 5, 8
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Generation and Evaluation of Directivity Filter using GP, MISAKA Chiho; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, The recent advancement of image processing technology expands its utilization. Many algorithms of the image data processing lack versatility since they are designed for their limited targets. We have studied automatic generation of image-processing filters by GP. In this paper, we focus on edge detection filters to be generated automatically. In our previous experiments, pure GP was applied for auto-generation of edge detection filter. The resultant filters were not enough learned to detect every directions of edges. Therefore, in this paper, we propose a method for GP to learn the directivity of given edge., 04 Mar. 2008, 2008, 17, 21, 24
  • Not Refereed, The first International Workshop on Super Visualization (IWSV’08) in conjunction with the 22nd ACM International Conference on Supercomputing (2008), Feasibility Study of a Remote Interactive Real-Time Visualization System Using Live Streaming, Noboru Tanabe; Hironori Nakajo; Kazuki Joe, 2008, -
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, 特定ユーザのための嗜好分析パターン抽出の一手法, 児玉理映子; 石川千里; 高田雅美; 城和貴, ユーザの嗜好に合致する商品を提示するレコメンド法が注目されている.しかしながら,従来のレコメンド法では全てのユーザを満足させることはできない.そこで,満足できないと考えられる特定ユーザの嗜好を抽出する新たなレコメンド法を提案する.本稿では,特定ユーザとして興味の有無が明確なオタクを採用した.オタクの嗜好を抽出するにあたってまずオタクの定義をし,その定義に基づいて選出したユーザをオタクとする.またオタク以外のユーザを一般人とする.このオタクと一般人のWebアクセスログから決定木を生成しネツト上での行動パターンを抽出し分析する.分析結果からオタクは一般人と比べ膨大な情報量を持つコンテンツを閲覧していることが示された., 20 Dec. 2007, 2007, 128, 61, 64
  • Not Refereed, IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), Effective Method for Web Exploration with a Novel GUI for Easy and Intuitive Understanding, Shibata Yuko; Yamauchi Kazuko; Ishikawa Chisato; Takata Masami; Joe Kazuki, Lately, Web space has been one of the most important resources for information exploration. However, users are sometimes confused because of various information floods in the Web space. In this paper, we introduce a method which extracts important sentences and keywords from plural Web documents provided from search results to acquire necessary information more effectively. Furthermore, we developed a GUI which supports visually easy and intuitive understanding for the users. Our method with the GUI reduces users' burden for web exploration drastically., 20 Dec. 2007, 2007, 128, 81, 84
  • Not Refereed, IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), An automatic texture-mapping method for 3D scanner data, Mochinaga Ayaka; Tarui Sachi; Ishikawa Chisato; Takata Masami; Joe Kazuki, Huge cost is required to create 3D objects from 3D scanner data. In this paper, we propose a method of automatic detection of the position where texture-mapping should be applied for the 3D object. For the determination of texture-mapping position, the position where shapes of texture images and 3D objects are almost same should be selected. Our method detects the mapping position automatically with matching the mask of the rendered picture of the 3D object to the photograph picture as a texture image. We also apply the SSDA method for fast matching. To validate the efficiency of our method, experimental automatic mapping is applied to 3D objects of three kind of shellfish specimens., 20 Dec. 2007, 2007, 128, 85, 88
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, リアルタイムアナグリフ動画像生成, 小堀由貴; 白川有莉; 石川千里; 高田雅美; 城和貴, 近年,映画やゲーム,アートから遊園地のアトラクションに至るまでの実にさまざまな分野で三次元可視化技術が利用されている.本稿では,そのような可視化技術のなかでも特に立体視に注目し,その実現のために2台のUSBカメラから撮影した映像をOpenCVを用いてリアルタイムでアナグリフ映像に変換して出力することを試みる.またOpenCVによる処理速度低下の欠点を克服するために,映像(動画)や音声を扱うためのフレームワークであるDirectShowをキャプチャ部分にのみ取り入れて,変換処理の高速化を図る., 20 Dec. 2007, 2007, 128, 89, 92
  • Not Refereed, IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), A Simulation Model for Connected Glucan Synthesis of Yeast for the E-Cell System, Kamada Mayumi; Nakajima Natsu; Ishikawa Chisato; Takata Masami; Joe Kazuki, Brewing of sake generates high concentration of ethanol, so we need to obtein yeast with the ethanol tolerance property. There have been a lot of research experiments to find such yeast. Recently, it turned out that how yeast cells response to ethanol on a gene level. The gene level experiments require huge cost and time, so we try to model the response mechanism of yeast cells to ethnol for computer simulation. In This paper, we model a simple metabolism of 1, 3-b-glucan synthesis using the E-cell system., 20 Dec. 2007, 2007, 128, 113, 120
  • Not Refereed, IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), 3D Visualization Function for Gfdnavi of Geophysical Fluid, Kurumi Mari; Tohma Eriko; Ishikawa Chisato; Takata Masami; Joe Kazuki, In recent years, visualization technology is essential for various scientific research. Especially, Simulation or measurement results are used as forms of visualization results to be well analyzed. In this paper, we add 3D visualization functions to Gfdnavi with outputting visualization results to client-sides through a remote X-window as well as the performance improvement with GPGPU., 20 Dec. 2007, 2007, 128, 163, 166
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Pattern Extraction Method to Analyze Favorite of Specific Users, KODAMA Rieko; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, Recommendation methods that offer goods to users according to their favorite attract attention recently. However, existing recommendation methods cannot be applied to all users in even. So, we propose a new recommendation method that extracts specific users who are not happy with recommended goods. In this paper, we adopt Otakus, whose interest is clear, as specific users. First, for extracting Otaku's favorite, otaku is defined, and several users selected according to the definition are regarded as otakus. The access pattern on the Internet is extracted from web access log of the otakus and other standard people to be analyzed. The result shows that otaku browses more copious contents than other standard people., 20 Dec. 2007, 2007, 128, 61, 64
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 複数Webページの重要文抽出および直感的理解を支援するためのGUIの開発, 柴田裕子; 山内和子; 石川千里; 高田雅美; 城和貴, 近年,Web空間は情報収集における重要な情報源のひとつとなった.しかし,Web空間には多種多様な情報が氾濫しているため,検索エンジンを用いて必要な情報を得ようとしても検索結果の数は膨大であり,ユーザが情報過多による混乱を起こす恐れがある.そこで本研究では,より効率的に必要な情報を取得するため,検索結果から得られる複数Web文書から重要文とキーワードを抽出するモデルを提案する.本稿では,モデルの提案と同時にユーザの直感的理解を視覚的に支援するGUIの開発を行った.本モデルでは,検索結果として得られる複数の文書に目を通さなければならないという人間にかかる負担を軽減させることを目的としている., 20 Dec. 2007, 2007, 128, 81, 84
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 3Dスキャナのための自動テクスチャマッピング手法, 持永彩華; 樽井沙知; 石川千里; 高田雅美; 城和貴, 3Dスキャナを使用した3Dオブジェクト化の作業には多くのコストを要する.そこで本稿では,3Dオブジェクトに対して,テクスチャマッピングを施す位置を自動検出する手法を提案する.テクスチャマッピングを施す位置選択において,テクスチャとして用いる写真内の画像形状が,3Dオブジェクトと一致する位置へのマッピングがより最適であると考えられる.本手法では,3Dオブジェクトのレンダリング画像と,実物の写真画像とのマスク情報をマッチングすることで,テクスチャマッピングを行う位置を自動的に検出する.マッチング計算にSSDA法を適用することにより,計算の高速化を図る.評価実験として,貝標本の3Dオブジェクトに自動マッピングを施す., 20 Dec. 2007, 2007, 128, 85, 88
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, リアルタイムアナグリフ動画像生成, 小堀由貴; 白川有莉; 石川千里; 高田雅美; 城和貴, 近年,映画やゲーム,アートから遊園地のアトラクションに至るまでの実にさまざまな分野で三次元可視化技術が利用されている.本稿では,そのような可視化技術のなかでも特に立体視に注目し,その実現のために2台のUSBカメラから撮影した映像をOpenCVを用いてリアルタイムでアナグリフ映像に変換して出力することを試みる.またOpenCVによる処理速度低下の欠点を克服するために,映像(動画)や音声を扱うためのフレームワークであるDirectShowをキャプチャ部分にのみ取り入れて,変換処理の高速化を図る., 20 Dec. 2007, 2007, 128, 89, 92
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, E-cell systemを用いた酵母菌のグルカン合成に関するモデル構築, 鎌田真由美; 仲嶋なつ; 石川千里; 高田雅美; 城和貴, 清酒醸造工程では,特有の製法で高濃度アルコールが生成される.清酒の発酵を行う酵母菌には,アルコール耐性を持つものが適しており,そのような酵母菌を発見するために現在様々な研究や実験が行われている.その中で,酵母菌のアルコール耐性については,遺伝子レベルで徐々に明らかになってきている.しかしながら,実際の酵母菌を用いた実験には,多くのコストを必要とする.そこで,アルコール耐性に関するシミュレーションモデルを構築し,アルコール耐性に関する新たな知見の獲得を試みる.本稿では,まず細胞壁の主成分であるグルカンに着目し,汎用細胞シミュレーションソフトであるE-Cell Systemを用いて,1,3-βグルカン合成に関する簡潔な代謝経路についてモデル構築を行う., 20 Dec. 2007, 2007, 128, 113, 120
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), 3D Visualization Function for Gfdnavi of Geophysical Fluid, KURUMI Mari; TOHMA Eriko; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In recent years, visualization technology is essential for various scientific research. Especially, Simulation or measurement results are used as forms of visualization results to be well analyzed. In this paper, we add 3D visualization functions to Gfdnavi with outputting visualization results to client-sides through a remote X-window as well as the performance improvement with GPGPU., 20 Dec. 2007, 2007, 128, 163, 166
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 情報爆発時代に向けた大気科学分野のための3次元可視化モデルの提案, 当麻英梨子; 高田雅美; 城和貴, 本稿では,Shneidermanが提唱する情報可視化に求められる7種の主要な操作機能を基にした3次元可視化モデルを提案する.提案する可視化モデルでは,情報爆発が生じている分野の1つである大気科学分野を対象とし,大量のデータ分析を可能とする.そのために,全体像と詳細情報の2種類の表示を用いる.この2種類の表示を効果的に使い分けることによって,大量のデータの中から効率良く特徴的現象を発見することが可能となる.インタフェースにおいては,Shneidermanが提唱する対話設計における8つの黄金律を採用する.提案モデルの有効性を示すために,モデルの適用によって開発した大気科学分野のための3次元可視化システムを用い,実際に生じた大気現象の可視化を行う., 15 Dec. 2007, 48, 19, 86, 98
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, アブストラクトを用いた原子分子物理学分野の論文分類支援システムの設計と実装, 柏木裕恵; 高田雅美; 佐々木明; 城和貴, 原子・分子と電子の衝突による電離・励起の断面積データは様々な分野で活用され,原子分子物理学分野の論文に記載されている.ゆえに,これらのデータを利用するためには原子分子物理学分野の数多くの論文から情報を収集し,目的のデータが掲載されている論文を探し出す必要がある.論文は一般にオンラインジャーナルより入手するが,論文の閲覧が有料である等の問題から原子分子物理学分野のすべての論文を入手することは実質不可能である.そこで本論文では無料で入手でき,誰でも閲覧可能であるアブストラクトを用いて,データが掲載されている論文を探し出す支援をするシステムを開発する.従来,論文分類手法として多く用いられている機械学習法を本システムにも適用し,アブストラクトだけを用いて論文を分類することが可能であることを検証する., 15 Oct. 2007, 48, 15, 189, 198
  • Not Refereed, Proceedings of the Society Conference of IEICE, The Institute of Electronics, Information and Communication Engineers, AS-2-4 Statistical View of Extracting Seismic Electric Signals from the Telluric Current Data by ICA, Ishikawa Chisato; Takata Masami; Nagao Toshiyasu; Joe Kazuki, 29 Aug. 2007, 2007, "S, 22"-"S-23"
  • Not Refereed, Proceedings of the Society Conference of IEICE, The Institute of Electronics, Information and Communication Engineers, AS-2-5 A Web System for Telluric Current Data Analyses for Short Term Earthquake Prediction, Toyoshima Yoshimi; Ishikawa Chisato; Takata Masami; Nagao Toshiyasu; Joe Kazuki, 29 Aug. 2007, 2007, "S, 24"-"S-25"
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Construction of a Paper Classification System Using SVM, ASHIDA Naomi; TAKATA Masami; SASAKI Akira; KAMO Hiroyasu; NIDE Naoyuki; JOE Kazuki, A huge number of of journal papers on the web make it time-consuming for researchers to find the papers about particular topics they are interested in. Therefore, the searching process is highly expected to be automated. Conventional text classification methods are applicable to the automatic searching if the main texts of the papers are provided. However, we can not obtain the main texts but only the abstracts of the on-line papers freely. In this paper, we propose a paper classification technique using SVM for on-line physics papers. In this paper, we show the efficiency of our proposing technique., 25 Jun. 2007, 2007, 64, 21, 24
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Auto Classification of Feces for Health Condition, KOMATSUBARA Miho; ISHIKAWA Chisato; TAKATA Masami; KAMO Hiroyasu; NIDE Naoyuki; JOE Kazuki, In this paper, we propose a system to classify shape of feces. In the proposed system, a chain code and elliptic Fourier descriptors are applied. To evaluate the system, a recall and a misidentification rates are calculated, and the recall rate is emphasized in this paper. The effectiveness of the proposed system is established. As the result, each recall rate becomes more than 75%., 25 Jun. 2007, 2007, 64, 25, 28
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), 3D Visualization System Gateau for Atmospheric Science: Design Concept and Practical Evaluation, TOUMA Eriko; NOGUCHI Katsuyuki; TAKATA Masami; KAMO Hiroyasu; NIDE Naoyuki; JOE Kazuki, Atmospheric scientists tend to use a 2D visualization method rather than 3D visualization for data analysis because 3D visualization requires some expert knowledge. We have developed a 3D visualization system Gateau for atmospheric scientists who are not familiar with visualization programming. Gateau accepts various data formulas used in atmospheric science, reconstruct the analysis procedure which atmospheric scientists perform with 3D visualization, and leads to the discovery of target phenomenon. The resultant visualization can be used for presentation. In this paper, we explain a conventional visualization method in atmospheric science field, give the 3D visualization system overview, and describe practical evaluation., 25 Jun. 2007, 2007, 64, 29, 32
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Optimization of Molecular Dynamics Simulation on Cell Processor, SASAKI Manami; SEKIJIMA Masakazu; TAKATA Masami; JOE Kazuki, Molecular dynamics simulations to analyze biological molecular functions are expected to clarify the principle of fluctuation of a protein that participates in a disease, and to discover peptides that are bound to the protein. Such simulations require large-scale and complicated calculation as typical scientific simulations. Furthermore, the molecular dynamic simulation is based on the calculation precision by femto second. In this paper, we report that a molecular dynamic simulator is implemented on the Cell Broadband Engine in PLAYSTATION3 to reduce the calculation time., 25 Jun. 2007, 2007, 64, 37, 40
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 「情報処理学会論文誌 : 数理モデル化と応用」の編集にあたって, 城和貴, 15 Mar. 2007, 48, 6
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Case Study of Explore the Relationship Between Food and Health Condition, LI Danyang; TAKATA Masami; JOE Kazuki, Recently, the size of memory storage is getting larger by advancement of science. As a result, information found in reservoir data has great variety and complexity. Therefore, it is necessary to get useful information from the data, which is hard to treat by the previous statistic analyses, or the database, which has variety of formats. To do so, the data mining is useful technique. This article tries to find the relationship between ingested food and condition of health without human prejudices and make new important indicator of controlling human health by employing data mining technique. Also the experiment is held to find the association-rules between food and condition of health., 03 Mar. 2007, 2007, 19, 77, 80
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of the handwriting training software on Nintendo DS, YOSHINO Kanako; TAKATA Masami; TENPAKU Seiichi; JOE Kazuki, We are newly developing training software for dyslexia disorder that is a type of learning disorder (LD). Person of dyslexia disorder has a trouble of the reading and writing of the character, and typical training methods are used to trace and to draw the character just on paper. The rehabilitation software for handwriting newly developed works on the portable type game machine, Nintendo DS. The repetition study on the game machine is easier than that of doing on paper. Moreover, it is an advantage that the learner can study with continued interest by adding the game. In this report, the content of the development background and the software developing now is described., 03 Mar. 2007, 2007, 19, 81, 84
  • Not Refereed, 情報処理学会研究報告, 情報処理学会, Auto View Selectionを実現する一手法, 中川真智子; 高田雅美; 城和貴, 21 Dec. 2006, 2006, 135, 49, 52
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, Auto View Selectionを実現する一手法(セッション3), 中川真智子; 高田雅美; 城和貴, 近年科学技術及び可視化技術の発達に伴い,多様な三次元可視化表示が行えるようになった.膨大で複雑なデータの可視化が可能になったことで,有益な知見を得るための視点の選択は重要となってくる.しかし,視点選択の定義は目的や対象によって異なってくるため,規格化された選択基準は存在しない,本稿では既存のモデルを改良し,複数の要素を組み合わせる事で視点の自動選択を行う., 21 Dec. 2006, 2006, 135, 49, 52
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, 短期地震研究のための統合的なマルチデータベースの設計(セッション3), 豊島良美; 石川千里; 高田雅美; 城和貴, 本稿では,既存の地電流を用いたオンラインシステムに,データベース機能を追加するための設計について述べる.地震による被害を減少させるためには,高精度な短期地震予測が不可欠である.予測を高精度に行うためには,様々な観測データを使用しなければならない.この際,いかに膨大なデータを効率的に扱えるかが問題となるが,多くのデータを効率的に扱うためにはデータベースを作成して利用すれば良い., 21 Dec. 2006, 2006, 135, 65, 68
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, 熱揺らぎを考慮したドッキングシステムの開発(セッション5), 木村紗知; 佐々木愛美; 関嶋政和; 高田雅美; 野口保; 城和貴, ドッキングシミュレーションは,タンパク質が別のタンパク質やペプチドなどと結合する現象をシミュレーションするものである.しかし,既存のドッキングプログラムはいずれも生体内で揺らいでいるタンパク質を氷のように固まったものとして扱うことが多く,結合するリガンドの挙動を正しく評価することが難しい.本稿では,この問題を回避し,生体内での揺らいでいるタンパク質とリガンドの結合を求めるために,分子動力学シミュレーションとドッキングシミュレーションを組み合わせたシステムの開発手法についての提案をおこなう., 21 Dec. 2006, 2006, 135, 119, 126
  • Not Refereed, 情報処理学会研究報告. BIO, バイオ情報学, 社団法人情報処理学会, SVMを用いた金属イオン結合部位予測システムの開発(セッション6), 中澤昌美; 高田雅美; 横田恭宣; 野口保; 関嶋政和; 城和貴, 金属イオンの結合は,タンパク質の構造や機能の変化に大きな影響を与える.ゲノム配列がシーケンサーにより網羅的に読解されていくのに対して,タンパク質の立体構造はNMRやX線結晶解析によって解かれることから,あるゲノム配列が得られてから立体構造や金属イオン結合情報が明らかになるまでには相当の時間が要される.そこで本研究では,既知の金属イオンとタンパク質の結合情報をデータベースから抽出し,SVMによる機械学習から,タンパク質と金属イオンとの結合予測を行うシステム開発をしている., 21 Dec. 2006, 2006, 135, 157, 164
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, Auto View Selectionを実現する一手法(セッション3), 中川真智子; 高田雅美; 城和貴, 近年科学技術及び可視化技術の発達に伴い,多様な三次元可視化表示が行えるようになった.膨大で複雑なデータの可視化が可能になったことで,有益な知見を得るための視点の選択は重要となってくる.しかし,視点選択の定義は目的や対象によって異なってくるため,規格化された選択基準は存在しない,本稿では既存のモデルを改良し,複数の要素を組み合わせる事で視点の自動選択を行う., 21 Dec. 2006, 2006, 135, 49, 52
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design of an integrated multi-database system for short-term earthquake prediction, TOYOSHIMA Yoshimi; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In this paper, we present the design of database functions for our online system that analyses telluric current data. Highly precise short-term earthquake predictions are necessary to avoid the damage in earthquakes. To make the highly precise predictions, we should use various observation data. In this case, it becomes a problem how we can treat enormous data effectively. To solve the problem, we construct databases and use the databases., 21 Dec. 2006, 2006, 135, 65, 68
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of Flexible Docking System by Using Molecular Dynamics Simulation, KIMURA Sachi; SASAKI Manami; SEKIJIMA Masakazu; TAKATA Masami; NOGUCHI Tamotsu; JOE Kazuki, Some proteins combine with the other protein, peptide, or a metal atom. This phenomenon is called "docking". The docking simulation reappears the docking. Protein is fluctuating inside of human body. However, it is that the existing docking simulation program treats a protein as rigid. Therefore, we can't show the behavior combining ligand exactly. To avoid this problem, we reappear to bind flexible protein and ligand. We think that it is able to get by using molecular dynamic simulation and docking simulation. In this paper, we will describe the development method of this system., 21 Dec. 2006, 2006, 135, 119, 126
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, SVMを用いた金属イオン結合部位予測システムの開発(セッション6), 中澤昌美; 高田雅美; 横田恭宣; 野口保; 関嶋政和; 城和貴, 金属イオンの結合は,タンパク質の構造や機能の変化に大きな影響を与える.ゲノム配列がシーケンサーにより網羅的に読解されていくのに対して,タンパク質の立体構造はNMRやX線結晶解析によって解かれることから,あるゲノム配列が得られてから立体構造や金属イオン結合情報が明らかになるまでには相当の時間が要される.そこで本研究では,既知の金属イオンとタンパク質の結合情報をデータベースから抽出し,SVMによる機械学習から,タンパク質と金属イオンとの結合予測を行うシステム開発をしている., 21 Dec. 2006, 2006, 135, 157, 164
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 可視化されたデータ依存の分類とその並列化手法への適用, 山口智美; 笹倉万里子; 城和貴, 自動並列化コンパイラの研究では,長い間,ループ変換理論やデータ依存解析の理論的な研究が行われてきた.一方,並列システムは共有メモリ,分散メモリ,クラスタ,Gridと様々なトレンドが出現しており,自動並列化コンパイラがすべてに実装されるのを期待することは現実的ではない.現に多くの研究者が各々のアプリケーションの並列最適化を行うのに,MPI, OpenMP, HPF等の環境を使っている.ところが並列プログラミング初学者には,ループ変換理論やデータ依存解析を直接利用するには敷居が高く,自動並列化コンパイラ研究で培われてきた研究成果を利用できないという問題点があった.本論文では,並列プログラミング初学者がデータ依存関係を目視により直観的に理解し,得られたパターンからループ変換手法を対話的に通用する手法について提案し,その具体例について報告する., 15 Oct. 2006, 47, 14, 179, 186
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design and implementation of a paper classification system using abstracts, KASHIWAGI Hiroe; TAKATA Masami; SASAKI Akira; JOE Kazuki, In the research field of text classification, classifying papers requires the body of the papers so far. When we look for some kind of papers on the web, we can obtain downloadable abstracts freely in general. But we cannot use the conventional text classification methods to make sure of the necessary paper, because we have just the abstracts without their bodies. Therefore we propose a paper classification system using just abstracts. We adopt LVQ, a pattern recognition technique, to implement a paper classification system. In this paper, we show our system can classify papers efficiently by abstract., 14 Sep. 2006, 2006, 95, 33, 36
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design of an lntegrated Database System for Short-term Earthquake Prediction, ISHIKAWA Chisato; KAMO Hiroyasu; NIDE Naoyuki; JOE Kazuki, It is known that various electromagnetic methods have been investigated for the short-term earthquake prediction. To make integrated investigation of these methods and find some correlations of earthquakes and various phenomenon, an integrated database system for short-term earthquake prediction is needed. In this paper, we present the design of an integrated database system for the ICA (Independent Component Analysis) method and observed TCD (Telluric current data)., 26 Jun. 2006, 2006, 68, 27, 30
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Gateau: A 3D Visualization System for lntuitive Analysis of Atmospheric Science, TOUMA Eriko; YAMAUCHI Kazuko; KAMO Hiroyasu; NIDE Naoyuki; HAYASHIDA Sachiko; JOE Kazuki, By recent progress in hardware, 3D visualization including VolumeRendering is adopted in various fields. Though CG is used in the atmospheric field, the scientists mainly use 2D visualization. So, we develop a 3D visualization system Gateau for atmospheric science. Gateau is a quick-look tool that enables the atmospheric scientists to observe 30 grid data with only a few instructions without 3D visualization programming knowledge. Without any manual, the users can understand how to use it interactively on the basis of simple interfaces, and accept multiple input formats including HDF-EOS, which is expected to be the standard file format to distribute earth observation satellite data., 26 Jun. 2006, 2006, 68, 31, 34
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design and lmplementation of Gateau API for HDF-EOS, YAMAUCHI Kazuko; TOUMA Eriko; KAMO Hiroyasu; NIDE Naoyuki; HAYASHIDA Sachiko; JOE Kazuki, Gateau, which we have been developing, is a system that helps atmospheric scientists analyze data by visualizing earth observation data used in atmospheric science research. In this investigation, we have selected HDF-EOS as a data format for Gateau. The HDF-EOS format recently increases among data distributed as earth observation data. We implement an HDF-EOS read function to Gateau. Atmospheric scientists can perform 3D visualization without writing programs using the original API called the HDF-EOS library. In this paper, we describe the implementation of the HDF-EOS read function to Gateau., 26 Jun. 2006, 2006, 68, 35, 38
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Another RSS Reader with Visualization of Structured Documents and Effective Navigation, HARA Satomi; KAMO Hiroyasu; NIDE Naoyuki; JOE Kazuki, As the number of weblog users increase, RSS readers, which collect update information delivered as RSS feeds from such web sites, become popular to be used. Most of the commonly used RSS readers are in a tasteless style. In contrast, we aim to make a new type of RSS readers with the concepts of 'pleasure' and 'comfort' in mind. This paper describes two types of visual RSS readers with a high regard for unconscious views. The one is called 'RSSViewer', which tempts the people around it into seeing it passively, and the other is called 'RSSwalker', with which users can choose articles by moving their viewpoints actively with emphasis on pleasure and comfort., 26 Jun. 2006, 2006, 68, 39, 42
  • Not Refereed, 日本データベース学会letters, 日本データベース学会, 網羅的なシミュレーションにおける空間的パターン発見のためのデータマイニング手法の開発, 石田愛; 渡辺知恵美; 城和貴, Jun. 2006, 5, 1, 145, 148
  • Not Refereed, 言語処理学会年次大会発表論文集, 科学論文からの原子分子データの収集,データベース化の自動化支援に関する研究, 佐々木明; 村田真樹; 柏木裕恵; 城和貴; ピフル ルカーシュ; 加藤太治; 村上泉, 13 Mar. 2006, 12th, 943, 946
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 「情報処理学会論文誌: 数理モデル化と応用」の編集にあたって, 城和貴, 15 Dec. 2005, 46, 17
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Automatic data classification and visualization by LVQ in advanced photon research, UESHIMA Yutaka; SAITOH Kanji; MATSUYAMA Hitomi; JOE Kazuki, It makes the burden too heavy for a researcher that a researcher must classify image data and visualize multi-dimensional data opportunely in the advanced photon research. The amount of data which a researcher must manage continues to increase. On the other hand, the know-how of classification and visualization is kept only in an individual researcher. Therefore, quality of data management, classification, visualization and conservation, is not only homogeneous. Of course, there is no guarantee that treatment of data is presented in exactly the same form as previous treatment. To dissolve these problems, we have developed and tested a support system of data analysis using the Learning Vector Quantization (LVQ) which is a kind of neural network model., 21 Sep. 2005, 2005, 93, 1, 4
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Query-by-Example Music Retrieval Modeling based on Spectral Correlation, YU Yi; WATANABE Chiemi; JOE Kazuki, Content based music retrieval is attracting more and more research interest. Suitable feature sets and similarity match approaches can help to reduce the tedious computation time and speed up the retrieval. This article mainly contributes in the two-fold to acoustic based music retrieval : 1. we report a study of the music spectral property and show that the spectral features of adjacent frames are highly correlated; 2. on the basic acoustic characteristics analysis we propose a fast and efficient Query-by-Example Music Retrieval modeling focused on spectral correlation. The extensive evaluations confirm the effectiveness of the proposed retrieval model for both monophonic and polyphonic music. The simulation results are analyzed with a theoretical approach that seeks to obtain the mathematical relation for our retrieval system parameters such as Spectral Correlation (SC) threshold, storage, and computation., 21 Sep. 2005, 2005, 93, 5, 8
  • Not Refereed, 原子衝突研究協会研究会講演概要集, 計算機による原子分子物理学の研究情報のデータベース構築の研究, 佐々木明; 上島豊; 村田真樹; 柏木裕恵; 城和貴; PICHL Lukas; 村上泉; 加藤太治; 加藤隆子, 23 Aug. 2005, 30th, 81, 82
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Detecting Nigata earthquake's Seismic electric signals by using ICA, ISHIKAWA Chisato; NAGAO Toshiyasu; JOE Kazuki, This article reports the result where we apply ICA (Independent Component Analysis) to telluric current data (TCD) that observed in 2004 when Nigata earthquake occured, and detecte Seismic electric signals (SESs). Detecting SESs from TCD is an effective method for short-term earthquake prediction. In Japan, detecting SESs from TCD is considered as a difficult task becouse of train noise embedded in TCD. However, it becomes easy if we can separate train noise and SESs. Therefore, we investigate the application of ICA for the separation., 09 Mar. 2005, 2005, 20, 57, 61
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, iアプリを用いた数値計算の可能性, 高田雅美; 柴山智子; 渡辺知恵美; 庄野逸; 城和貴, 携帯電話会社NTT Docomoの提供するiアプリは,携帯端末において,様々なJavaアプリケーションを実行することが可能であるiアプリ対応の携帯端末は,計算機としては貧弱ではあるが,ネットワーク機能.計算リソースを有しており,2003年11月の時点では,その市場稼動台数は,2,000万台を突破している.本研究では,アイドル状態にある携帯端末において,iアプリを用いた数値計算を行うための分散処理システムによって,計算リソースを有効活用する方法を提案する.個々め携帯端末は,貧弱な計算リソースしか持たないため,処理すべき計算問題は,分散化される必要がある.そこで,我々は,この分散処理のための1つのアプローチとして分散遺伝的アルゴリズムをiアプリによって実装し,計算問題解決のためのプロトタイプを作成した., 15 Jan. 2005, 46, 2, 47, 55
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), QueryPainter: a Paint - like Interface of a Query Interaction Tool for Visualization Systems, ISHIDA Ai; WATANABE Chiemi; JOE Kazuki, In this paper, we describe about development of a query definition support environment for Queryball, which is a new style of interaction tool developed at Nara Women's University. Queryball is a translucent ball, which has query conditions and visualization methods. Users can apply the query only inside the ball, and modify the query applied area by moving and overlapping of Queryballs. So far, when users use the Queryball system, users must describe programming scripts to define the query definitions. In this paper, we describe about development of support tool which supports to define these query definitions without describing any scripts. By using this tool, users can define query definitions easily. In addition, we proposed paint-like tool. It can specify the query applied area like using a paint-soft., 13 Sep. 2004, 2004, 92, 1, 4
  • Not Refereed, Transactions of Visualization Society of Japan, The Visualization Society of Japan, 3D Visualization of Polar Stratospheric Data by Using PV-WAVE:an attempt of interactive visual data mining, Nakagawa Machiko; WATANABE Chiemi; HAYASHIDA Sachiko; JO Kazuki, In recent years visualization technologies are used not only for presentation but also for visual data mining which are techniques for mining new knowledge by visualizing and analyzing the data from multiple view point. In this paper, we considered about visual data mining for atmospheric data, and actually implemented the interactive visualization system which lends to visual data mining using the polar stratospheric data., 01 Jul. 2004, 24, 1, 53, 54
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of a query description support environment in a query interaction tool for visualization systems, ISHIDA Ai; WATANABE Chiemi; JOE Kazuki, In this paper, we describe about development of a query definition support environment for Queryball, which is a new style of interaction tool developed at Nara Women's University. Queryball is a translucent ball, which has query condition and visualization methods. Users can apply the query only inside the ball, and modify the query applied area by moving and overlapping of Queryballs. We propose the query model of Queryball using a description model named visualization pipeline. Based on this model, we developed the Queryball definition support envionment with two description modes ; one is to use a script language, the other is to use a visual programing tool. By using the visual programing tool, user can browse and edit the definition of Queryball graphically and easily., 01 Mar. 2004, 2004, 18, 23, 26
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of An Interactive Inquiry Tool for Visualization Systems and its Application to Seismic Wave Data, UEMURA Ai; WATANABE Chiemi; JOE Kazuki, We propose the Queryball model, which is a new style interaction model for a 3D visualization system. Queryball, which is a translucent ball, has search condition, and two types of display methods. By locating a Queryball on the region of interest, users can observe just the objects They are interested in with emphasizing them and having other objects disappear. Users can change the region of interest by changing the area specification of the Queryball interactively. Although Queryball is useful for interactive analyze of various kinds of data, we need to consider and provide a variety usage of Queryball for various application area of visualization. In this paper, we visualize seismic wave data and the underground structure of the earth, to apply some Queryballs to the results. We apply a volume rendering technique, and use an appropriate transfer function by examining the data distribution., 01 Mar. 2004, 2004, 18, 27, 30
  • Not Refereed, 日本データベース学会letters, 日本データベース学会, Queryball: VRシステムのための対話的な問合せモデル, 渡辺知恵美; 増永良文; 城和貴, Oct. 2003, 2, 2, 25, 28
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Queryball : Interactive Query Model for Immersive VR Systems, WATANABE Chiemi; MASUNAGA Yoshifumi; JOE Kazuki, In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. Queryball is a new style of querying model for intuitive and heuristic query interaction. Queryball, which is a translucent ball, is defined as a quadruple of area specification, search condition, and two types of display methods. The search condition can be applied only to the virtual objects inside of the Queryball. The query results are shown to the user according to the display method. The position and radius of the Queryball changes when the user moves the Queryball interactively with observing the query results., 16 Jul. 2003, 2003, 71, 257, 263
  • Not Refereed, IEICE technical report. Data engineering, The Institute of Electronics, Information and Communication Engineers, Queryball : Interactive Query Model for Immersive VR Systems, WATANABE Chiemi; MASUNAGA Yoshifumi; JOE Kazuki, In this paper, we propose a powerfiil and convenient querying model, "Queryball", for users to query in immersive VR systems. Queryball is a new style of querying model for intuitive and heuristic query interaction. Queryball, which is a translucent ball, is defined as a quadruple of area specification, search condition, and two types of display methods. The search condition can be applied only to the virtual objects inside of the Queryball. The query results are shown to the user according to the display method. The position and radius of the Queryball changes when the user moves the Queryball interactively with observing the query results., 10 Jul. 2003, 103, 191, 55, 60
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Queryball : A New Model for Querying in Immersive VR sytems, WATANABE Chiemi; OSUGI Ayumi; MASUNAGA Yoshifumi; JOE Kazuki, In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. Queryball is a new style of querying model for intuitive and heuristic query interaction. Queryball, which is a translucent ball, is defined as a quadruple of area specification, search condition, and two types of display methods. The search condition can be applied only to the virtual objects inside of the Queryball The query results are shown to the user according to the display method. The position and radius of the Queryball changes when the user moves the Queryball interactively with observing the auerv results., 24 Jun. 2003, 2003, 65, 5, 8
  • Not Refereed, 情報処理学会論文誌. コンピューティングシステム, 社団法人情報処理学会, 擬似スペクトル法を用いた乱流場の直接数値シミュレーションの並列化と性能評価, 高田雅美; 山本義暢; 庄野逸; 功刀資彰; 城和貴, 自由界面における乱流を計算機で解析する場合,直接数値シミュレーションと呼ばれる手法により数値解を求める場合がある.この数値解の精度をあげるためには,しばしば擬似スペクトル法が用いられる.本研究では,擬似スペクトル法を用いた乱流解析プログラムを分散メモリ環境対象の並列プログラムに変換し,その性能評価を行った.擬似スペクトル法は,流体の時間発展方程式を解く際,フーリエ変換を用いて波数空間で計算を行う.この際,通常の並列化で使われるstrip miningによる実空間の均等分割によって配列データの分割を行った場合,通信時間と通信オーバヘッドが膨大になる可能性がある.本論文では,この擬似スペクトル法を用いた乱流解析プログラムを並列化するために,通信時間と通信オーバヘッドを考慮し,複数の配列を処理する際に,1つの配列がなるべく少数のプロセッサに割り当てられるように分割し,なおかつ,複数の配列の演算が同時処理できるような方針で実装を行った.提案する並列化手法の有効性を検討するために,並列プログラムをMessage Passing Interface を用いて実装し,安価な分散メモリ環境において性能評価を行った.その結果,現実的な実行時間で解が得られることを確認した., 15 May 2003, 44, 6, 45, 54
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 情報処理学会, A Quantum Algorithm to Search for Web Communities and Inspection, OTO MAYUMI; NAKAJO HIRONORI; JOE KAZUKI, 15 May 2003, 44, 8, 26, 34
  • Not Refereed, IEICE technical report. Neurocomputing, The Institute of Electronics, Information and Communication Engineers, Naive Mean Field Approximation for Error Correcting Code Problem, TAKATA Masami; SHOUNO Hayaru; OKADA Masato; JOE Kazuki, In the communication theory, solving error correcting code problem is a important subject. Recently, to reveal the charactericity of the erroro correcting code, several reseachers applied statistical-mechanical approach to this problem. In our research, we treated the error correcting code as the Bayes inference framework. We used MPM (Maximizer of the Posterior Marginals) inference, that is a kind of Bayes inference, and, moreover, applied naive mean field approximation. In the field of the artificial neural network, this approximation is applied for reduction of the computational cost by substitution of the stochastic binary units with the deteministic continuousu value units. However, there exsists few report of the performance of this approximation by quantitatively. Therefore, we evaluated the performance of this approximation by analysis and compare it with the compuater simulation., 11 Mar. 2003, 102, 730, 143, 148
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Parallel I/O Control Agent for Large - scale Simulation Database, MATSUOKA Yuki; MATSUYAMA Hitomi; KOGANEYAMA Mika; UESHIMA Yutaka; JOE Kazuki, An integrated management system for large-scale simulation saves the output data of simulations without consideration of the disk size on the date server. The present problem is an inefficient operation of the data server because each disk size on the data server is unbalanced. We design and implement a prototype of the parallel I/O control agent for large-scale simulation database which supervises the data server, makes suggestions to users and moves data files to the other disks to keep each disk size well-barances., 03 Mar. 2003, 2003, 20, 1, 4
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, パネル討論「数理モデルの今後の展望」, 城和貴, 03 Mar. 2003, 2003, 20
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design and Implementation of an Automatic Learning Agent System for Large - scale Simulation Cycles, MATSUYAMA Hitomi; MATSUOKA Yuki; KOGANEYAMA Mika; UESHIMA Yutaka; JOE Kazuki, Recently, as high performance computers with advanced network technology and effective visualization methods become availabl, large-scale simulations for various research fields are performed. Some management systems for the simulation cycles have been developed. However, it is a burden for users to operate the system because they need to have knowledge for the simulation and the operation is complicated. Thus, we design and implement a prototype of an automatic learning agent system for the large-scale simulation cycles., 28 Nov. 2002, 2002, 114, 17, 20
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Extraction of Train Noise affects Telluric Current Data at Two Different Observation Points by ICA and Its Statistical Evaluation, SAWA Sayuri; KOGANEYAMA Mika; SHOUNO Hayaru; NAGAO Toshiyasu; JOE Kazuki, The method of detecting irregular changes of electric current in Telluric Current Data (TCD) has attracted notice recently as an effective method for short-term earthquake prediction. We call such irregular changes Seismic Electric Signals (SESs), which are sometimes observed before earthquake. However, since most of the TCD collected in Japan is affected by train noise, detecting SESs in TCD itself is considered as an extremely arduous job. The purpose of our research is to separate train noise and SESs automatically by ICA. Train noise and the SES are considered as independent source signals. It has been confirmed by our experiments that train noise observed at Matsushiro, Nagano can be separated by ICA. In this paper, we apply ICA to TCD observed at two different observation points which seems to contain the same train noise and evaluate the results by a statistical method., 28 Nov. 2002, 2002, 114, 95, 98
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 量子コンピュータ実現に向けた量子命令セットについて(<特集>量子計算), 大音真由美; 中條拓伯; 高田司郎; 城和貴, 量子コンピュータ開発に向けた研究は始まったばかりで,量子素子・デバイスと,量子チューリング機械上のアルゴリズムの2つの興味深い課題が研究されている.これらの研究は非常に重要な基礎研究である.しかし,我々は,量子コンピュータを実現するためには,量子コンピュータ.アーキテクチャ,および,そのシステム・ソフトウェア側からの研究が不可欠であると確信している.そこで,本論文では,量子コンピュータ・アーキテクチャ構築の準備として,量子コンピュータ実現に向けた量子命令セットを提案する.具体的には,まず,現在までに提案されている5つの量子アルゴリズムに共通な量子基本操作を抽出する.次に,それら量子基本操作を実現するために,量子ユニットモデルとそのモデル上で実行する量子命令セットを提案する.さらに,この命令セットを上記5つの量子アルゴリズムのコーディングに適用することで,提案する量子命令セットの有効性を示す.最後に,今後の課題である量子コンピュータ・アーキテクチャの枠組みの一例を示す., 15 Sep. 2002, 43, 7, 19, 28
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, ICAを用いた地電流データからの電車ノイズと地震前兆シグナルの分離, 小金山美賀; 庄野逸; 長尾年恭; 城和貴, 地電流データ中には,地震前兆シグナルと呼ばれている異常電流が観測されることがある.近年,地電流データからの地震前兆シグナルの検出は,短期地震予知の有効な手法の1つとして注目されている.しかし,我が国では地電流データ中の多くに観測されている電車ノイズの影響で,地震前兆シグナルの検出が困難となっている.本研究では信号分離技術であるICA(独立成分分析:Independent Component Analysis)を用いて,独立信号であると考えられる電車ノイズや地震前兆シグナルの自動分離を試みている.本論文では,地電流データにICAを適用し,その結果と評価について報告する., 15 Sep. 2002, 43, 7, 92, 104
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Attempt to Classify Visualized Data Dependence, IWASAKA Asami; YAMAGUCHI Tomomi; SHOUNO Hayaru; SASAKURA Mariko; JOE Kazuki, Recently, in the field of scientific calculation, the tendency to introduce parallel computer becomes increase. Therefore, converting methods from conventional sequential programs to correspondent parallel ones are required. However, vast amounts of skill and knowledge for the parallel programming are needed to programmer. In this study, we propose introducing the 3D visualization system called NaraView as those programming environment. Naraview analyze the data dependence in the programming code, and visualize their relations. Since the parallelizable code have typical features, NaraView would reveal them visually. We showed the effective parallelizing method, which have those typical features in the loop structure with concrete program code., 04 Mar. 2002, 2002, 19, 41, 44
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), The Design and Implementation of Unimodular Transformations for the Parallelizing Compiler PROMIS, ISHIUCHI Hisako; YAMAGUCHI Tomomi; SHOUNO Hayaru; JOE Kazuki, For parallelizing compilers, many loop transformations have been proposed as optimization methods to exploit parallelism. However, since these methods have been designed separately, each method has its own conditions and effect to be applied. Therefore, even if we implement many loop transformations in a compiler, it is difficult to determine which combinatorial use of the transformations is optimal. Another transformation, which is called Unimodular, has the same effect to the combination of some transformations. Some transformation may get the optimal combination regarding to parallelism. In this paper, we describe the implementation of the unimodular transformation to the Parallelizing Compiler PROMIS, which is developed at the University of Illinois., 04 Mar. 2002, 2002, 19, 45, 48
  • Not Refereed, 情報処理学会第64回全国大会予稿集, 特別トラック 4D-04, 汎用量子コンピュータのモデルとシミュレータの構想, 古屋 良二朗; 中條 拓伯; 城 和貴, 2002, 249, 252
  • Not Refereed, 第43回プログラミング・シンポジウム 報告集, 量子コンピュータの命令セットアーキテクチャの一提案とそのシミュレータの構想, 中條 拓伯; 古屋 良二郎; 大音 真由美; 城和貴, 2002, 173, 184
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 「情報処理学会論文誌 : 数理モデル化と応用」の発行にあたって, 城和貴, 15 Dec. 2001, 42, 14
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, ニューラルネットを用いた地電流データからの電車ノイズ除去, JOE Kazuki, 短期地震予知の手法として, 近年, VAN法という観測方法で採取された地電流データから地震前兆シグナルを検出し, 短期的な地震予知を行う方法が注目されている.しかし, 我が国では, 地電流データ中の多くの占める電車ノイズの影響で, 地電流データから地震前兆シグナルを検出することが困難になっている.そこで, 我々は, ニューラルネットを利用して, 地電流データから地震前兆シグナルを自動的に検出し, 実用的かつ信頼性の高い短期地震予知を行う研究に着手している.本論文では, その第1ステップとして, 地震前兆シグナルを検出する際に問題となっている電車ノイズを除去するニューラルネットの構築法とその評価について報告する., 15 Dec. 2001, 42, 14, 124, 133
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Analysis of Telluric Current Data for Short - term Earthquake Prediction -Applications and Evaluations by ICA-, KOGANEYAMA Mika; SHOUNO Hayaru; NAGAO Toshiyasu; JOE Kazuki, Seismic electric signals(SESs)are sometimes contained in telluric current data(TCD). The method of detecting SESs in TCD has attracted notice recently as an effective method for short-term earthquake prediction. However, since most of the TCD collected in Japan is affected by train noise, therefore detecting SESs in TCD itself is considered as an extremely arduous job. The goal of our research is to obtain a method for detecting SESs, which is difficult because of train noises. The SES and train noise are considered as independent source signal. Therefore we tried to apply ICA(Independent Component Analysis)to several TCDs. We have already confirmed that train noises could be separated from several TCDs at Matsushiro, Nagano. In this paper, we apply ICA to TCD at Sasadani, Fukui in which there are more train noises than Matsushiro, and evaluate the results., 19 Nov. 2001, 2001, 110, 9, 12
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Quantum Computer Architecture with the Intention of Trying Simulation, FURUYA RYOUJIROU; OTO MAYUMI; JOE KAZUKI; NAKAJO HIRONORI, Quantum Computing is currently a hot research topic. In this research field, there are two main streams ; one is the research on new efficient quantum algorithms, and the other is on implementation of quantum devices in the domain of experimental physics. On the supposition that a quantum computer system could be realized in the near future, we are investigating an abstract model of a general-purpose quantum computer. In this paper, we propose a quantum computer architecture and define a quantum instruction set and an internal architecture of the processor with a view to try simulation. This abstract model is a fundamental design part in conducting simulation of executing quantum instructions., 19 Nov. 2001, 2001, 110, 19, 22
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), The Overview of the Parallelizing Compiler PROMIS - NWU, YAMAGUCHI Tomomi; ISHIUCHI Hisako; IWASAKA Asami; HANEDA Masayo; SHOUNO Hayaru; JOE Kazuki, Compilers have been regarded as a cost expensive software. However, the implementation cost tends to be reduced recently by various new software development technologies. For example, software developments with object oriented technolgies require extremely inexpensive costs compared with conventional ones. Besides such software engineering approach, low-cost developments of compilers by the re-use of compiler components are expected. We are developing such a low-cost compiler by replacing the intermediate representation of PROMIS developed at UIUC with our new intermediate representation, aiming at other concepts for the compiler. In this report, we introduce the concept of the parallelizing compiler PROMIS-NWU which is under development at Nara Women's University., 25 Jul. 2001, 2001, 76, 79, 84
  • Not Refereed, IEICE technical report. Neurocomputing, The Institute of Electronics, Information and Communication Engineers, Separation of Train Noise and Seismic Electric Signals from Telluric Current Data by ICA, KOGANEYAMA Mika; SHOUNO Hayaru; SUGITA Moyo; NAGAO Toshiyasu; JOE Kazuki, The method of detecting seismic electric signals (SESs) in telluric current data (TCD) observed by the VAN method has attracted notice recently as a method for short-term earthquake prediction. However, since most of the TCD collected in Japan is affected by train noise, detecting SESs in TCD itself is considered as an extremely arduous job. The goal of this research is to obtain a method for detecting SESs, which is difficult for experts of VAN method because of train noises. The SES and train noise are considered as independent source signal. Therefore we tried to apply several TCDs which are observed at Matsushiro, Nagano to ICA. As a result, it turned out that train noise and SESs are separated by ICA., 20 Jul. 2001, 101, 238, 79, 85
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Telluric Current Data Analysis by Learning Vector Quantization II, FUKUDA Kyoko; KOGANEYAMA Mika; NAGAO Toshiyasu; JOE Kazuki, Aiming at short prediction of earthquake, we have proposed the use of neural networks for analyzing telluric current data observed by VAN method. We succeeded to make train noises be separated from telluric current data by back propagation method. In our last paper, we proposed a telluric current data analysis method by using Learning Vector Quantization for curent data for Matsushiro. In this paper, we will show preliminary experiment result for categorization of telluric current data for Izu islands earthquakes., 15 Mar. 2001, 2001, 27, 33, 36
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), An Implementation of a Primitive API of a UIR Interface for a Parallelizing Compiler, YAMAGUCHI Tomomi; JOE Kazuki, This paper presents an implementation of a primitive API that constructs a Universal Intermediate Representation(UIR) interface library for parallelizing compiler. We investigate how to design the UIR interface library through the implementation of two well-known loop transformations; loop distribution and loop permutation., 15 Mar. 2001, 2001, 27, 37, 40
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Improvement in the speed of NaraView by DirectX, SHIBAYAMA Tomoko; JOE Kazuki, NaraView is a tool which supprts parallelizations of given programs with the advantage of human's visual perception ability. This paper describes the re-implementation of NaraView with DirectX, after the comparison of OpenGL and DirectX., 15 Mar. 2001, 2001, 27, 41, 44
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Parallelization and Evaluation of a Turbulent Flow Simulation, TAKATA Masami; YAMAMOTO Yoshinobu; KUNUGI Tomoaki; JOE Kazuki, In this paper, we present parallelization methods for a direct numerical simulation using Message Passing Interface. The parallelized programs for 4 processors and 8 processors have been implemented, and we show that execution time of the parallelized programs are about 1/4 and 1/8 compared with the original sequential program respectively by experimental results., 26 Jan. 2001, 2001, 10, 1, 6
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Telluric Current Data Analysis by Learning Vector Quantization, FUKUDA Kyoko; KOGANEYAMA Mika; NAGAO Toshiyasu; JOE Kazuki, Aiming at short prediction of earthquake, we have proposed the use of neural networks for analyzing telluric current data observed by VAN method. We succeeded to make train noises be separated from telluric current data by back propagation method. In this paper, we propose a telluric current data analysis method by using Learning Vector Quantization, and show preliminary experiment results for categorization of telluric current data., 21 Nov. 2000, 2000, 108, 25, 28
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, NaraViewのParafrase-2との連携における効果的な並列化支援, 羽田昌代; 笹倉万里子; 長嶋雲兵; 國枝義敏; 城和貴, 並列計算機を効果的に使用するために, アプリケーションの並列化を自動で行う自動並列化コンパイラが開発されているが, これを用いても正確で効果的な並列化を行うことは極めて難しい.このため自動並列化コンパイラには, その使用を支援するツールが開発されていることが多い.我々が, これまでに開発している並列化支援ツールNaraViewは並列化コンパイラParafrase-2から得られる中間表現の情報を抽出し, 与えられたプログラムの視覚化を行う.本稿では実アプリケーションの並列化を通してNaraViewのより有効な使用について述べる., 26 Jun. 2000, 2000, 60, 17, 20
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 短期地震予知のためのニューラルネットを用いた地電流データからの電車ノイズ除去, 小金山美賀; 杉田望代; 長尾年恭; 城和貴, 我々は, VAN法を用いて観測される地電流データから, 地震前兆シグナルを計算機により自動的に検出し, より実用的かつ信頼性の高い短期地震予知を行う研究に着手している.本稿では, 地震前兆シグナルを検出する際に問題となる電車ノイズの除去が, ニューラルネットを用いることによって, 可能かどうかの実験を行い, その結果について報告する., 26 Jun. 2000, 2000, 60, 29, 32
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Parallelization of Real Applications with NaraView : A Case Study, HANEDA Masayo; SASAKURA Mariko; JOE Kazuki, To use parallel computer systems effectively, users need to reconstruct their sequential appreciation into parallel programs, and such parallelization is not an easy work for general users. To solve such a problem, parallelizing compilers are developed, but it is still quite difficult to parallelize applications correctly, efficiently, and automatically. For this reason, some parallelization support tools are desired. NaraView, as such a support tool, visualizes the given programs by extracting internal information from a parallelizing compiler Parafrase-2. In this paper, we validate the ability of NaraView by parallelizing a real application., 02 Jun. 2000, 2000, 57, 39, 44
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Improving a Program Partitioning Algorithm using a Neural Network, SAITO Tetsuya; TAKATA Masami; JOE Kazuki; KUNIEDA Yoshitoshi; FUKUDA Akira, This paper proposes an artificial neural network based approach to estimate lower bounds for a program partitioning algorithm with branch and bound method. The program partitioning algorithm is implemented without lower bounds and enough numbers of randomly generated task graph sets are investigated with the algorithm. The internal states of the algorithm are analyzed to design an architecture of neural networks to estimate lower bounds for the algorithm. The designed neural network is confirmed to have the ability to learn(estimate)lower bounds corresponding to the characteristics parameters of given task graph sets. Finally the artificial neural network based approach with a branch and bound based partitioning algorithm is described., 07 Feb. 2000, 2000, 16, 21, 24
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A data partitioning method and its visualization assuming that variable access costs are described as gravity, SUGITA Moyo; OUTO Mayumi; SASAKURA Mariko; JOE Kazuki, To obtain effective parallel processing in distributed memory systems, facing to data partitioning problems, we should investigate how data and task are arranged and divided into distributed memories. In this paper, we describe a data partitioning problem in distributed memory systems and an intermidiate representation of a parallelizing compiler, explain the support of clustering by gravity as a physical model, give an account of its visualization, and propose a data partitioning method with combination of the visualization. In addition, we report a prototype., 07 Feb. 2000, 2000, 16, 33, 36
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), The implementation of Laurasia : a software DSM system to realize compiler - controlled COMA environment., UEHARA Tetsutaro; SAITO Shoichi; JOE Kazuki; KUNIEDA Yoshitoshi, We have proposed an approach to bridge a gap among communication mechanisms of various parallel computer architectures by providing COMA(Cache-Only Memory Architecture)environment that can be controlled by automatic parallelizing compilers. This paper presents the implementation of a software DSM(Distributed Shared Memory)system on clusters of workstations running UNIX, which is developed for a compiler based on the approach. The system manages shared memory based on Entry consistency model. The system achieves the transfer rate of approximately 4 to 6MB / s for the shared pages when the network is based on 100BASE-TX., 07 Jan. 2000, 2000, 1, 49, 54
  • Not Refereed, 情報処理学会 「第7回MPSシンポジウム」 新しい計算パラダイム ~量子/分子コンピュータ最前線~ 論文集, 汎用量子コンピュータ・アーキテクチャの構想, 大音 真由美; 中條 拓伯; 城 和貴, 2000, Vol.2000, No.16, 77, 80
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, リリース・コンシステンシ・モデルとその実現の形式的仕様記述について, 高田司郎; 田口研治; 城和貴; 福田晃, 我々は,形式的仕様記述言語Zの表記法とプロセス代数value-passing CCSを統合した形式手法を用いて,分散共有メモリシステムの振る舞いを定義したメモリ・コンシステンシ・モデルとそれらの実現の形式的な仕様記述と検証の研究を行っている.メモリ・コンシステンシ・モデルは,ストア命令やロード命令などに諸々のプログラム順序を定義してメモリアクセスを制約するものと,いつどのようにこれら命令の同期を取るべきかというプログラマの指定によりメモリアクセスを制約するものに大別される.我々は,以前,前者の代表としてコーザル・メモリ・コンシステンシ・モデルを取り上げ,このモデルと実現の形式的な仕様記述と検証に対するこの形式手法の有効性を報告した.そこで,本論文では,後者の代表としてリリース・コンシステンシ・モデルを取り上げ,このモデルと実現の形式的な仕様記述と検証を行なう.これら代表的な二つのモデルと実現の形式的仕様記述と検証を示すことで,この形式手法のメモリ・コンシステンシ・モデルに対する有効性を確認した., 15 Dec. 1999, 40, 9, 1, 17
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 地電流観測データのニューラルネットワークによる解析, 小金山美賀; 長尾年恭; 城和貴, 我々は,VAN法を用いて観測した地電流データをニューラルネットワークにより自動的に解析し,短期地震予知を行う研究に着手している.本稿では,予備実験として,地電流データから地震前兆波を検出しやすくするために,地電流データに含まれている電車のノイズ波を学習,識別するニューラルネットワークを構築し,その検証について報告する.さらに,元データにfftを用いたフィルタリングを行うことによって,学習の高速化が可能であるかどうかを検証する., 25 Nov. 1999, 99, 96, 1, 4
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 実用的な近似解を与えるプログラム分割アルゴリズム, 齋藤哲哉; 高田雅美; 城和貴; 國枝義敏; 福田晃, 本論文では,Girkarのプログラム分割アルゴリズムに対してヒューリスティックスを導入し,最適な解が得られる保証はないが,実用的に問題のない程度の近似解が得られることを示す.我々が提案するヒューリスティックスは,対象となるタスク・グラフの枝のリストの並びに注目し,ある枝の位置を基点とし,そこから選択した枝までの距離の平均値を切り上げた値と最大値を評価値として利用する.この評価値によって,いくつ先まで分枝操作をするかを決定し,得られた暫定値を下限値として限定操作を行う.実験の結果,十分に実用的な近似解が得られることがわかった., 25 Nov. 1999, 99, 96, 29, 32
  • Not Refereed, 電子情報通信学会技術研究報告. IE, 画像工学, 社団法人電子情報通信学会, 自動並列化コンパイラ内部情報の三次元視覚化システム, 城和貴; 杉田望代, 本稿では、自動並列化コンパイラにおける統一的中間表現について概説し、その一例であるデータ分割グラフ(DPG)の特徴を紹介する。そして、一般的な視覚化の有効性を述べた後、DPGの視覚化を提案する。DPGのデータアクセス情報は、変数単位でデータが表現され、アクセスの種類も分けられており、詳細な内容を含んでいる。そこで、最適なデータのメモリ配置の支援を目的とする、DPGの変数アクセス情報の視覚化の提案を行う。さらに、そのプロトタイプ実装について報告した後、具体例をもって本提案の有効性を検証する。, 28 Oct. 1999, 99, 400, 59, 66
  • Not Refereed, 電子情報通信学会技術研究報告. DSP, ディジタル信号処理, 社団法人電子情報通信学会, 自動並列化コンパイラ内部情報の三次元視覚化システム, 城和貴; 杉田望代, 本稿では、自動並列化コンパイラにおける統一的中間表現について概説し、その一例であるデータ分害1jグラフ(DPG)の特徴を紹介する。そして、一般的な視覚化の有効性を述べた後、DPGの視覚化を提案する。DPGのデータアクセス情報は、変数単位でデータが表現され、アクセスの種類も分けられており、詳細な内容を含んでいる。そこで、最適なデータのメモリ配置の支援を目的とする、DPGの変数アクセス情報の視覚化の提案を行う。さらに、そのプロトタイプ実装について報告した後、具体例をもって本提案の有効性を検証する。, 28 Oct. 1999, 99, 396, 59, 66
  • Not Refereed, 電子情報通信学会技術研究報告. ICD, 集積回路, 電子情報通信学会, 自動並列化コンパイラ内部情報の三次元視覚化システム, 城和貴; 杉田望代, 本稿では、自動並列化コンパイラにおける統一的中間表現について概説し、その一例であるデータ分割グ簗霞宵門翼;・4義1理胃z胃本壜53エソ品畠容を含んでいる。そこで、最適なデータのメモリ配置の支援を目的とする、DPGの変数アクセス情報の視覚化の提案を行う。さらに、そのプロトタイプ実装について報告した後、具体例をもって本提案の有効性を検証する。, 28 Oct. 1999, 99, 398, 59, 66
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 周期性を有する配列参照パターンの解析手法について, 小崎光倫; 中西恒夫; 城和貴; 福田晃, 分散メモリ型並列計算システムにおいては,通信オーバーヘッドの問題から,各プロセッサが頻繁に参照するデータをそのローカルメモリに局所的に配置するデータ配置最適化が極めて重要である.しかしながら,科学技術計算アプリケーションでは,ループ中で複雑な配列参照が行われ,その参照パターンを明確に把握するのは非常に難しく,コンパイル時に十分にデータ配置最適化を行うことが困難である.本稿では,実行時に配列参照に関するログをとることにより,そのログから配列参照の周期性の解析を試みる.配列参照周期が明らかになれば,データ配置最適化などの最適化処理への利用が期待される., 21 Sep. 1999, 99, 76, 1, 4
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, データ分割グラフの3次元視覚化, 杉田望代; 笹倉万里子; 城和貴, 本稿では、自動並列化コンパイラにおける統一的中間表現について概説し、その一例であるデータ分割グラフ(DPG)の特徴を紹介する。そして、一般的な視覚化の有効性を述べた後、DPGの視覚化を提案する。DPGのデータアクセス情報は、変数単位でデータが表現され、アクセスの種類も分けられており、詳細な内容を含んでいる。そこで、最適なデータのメモリ配置の支援を目的とする、DPGの変数アクセス情報の視覚化の提案を行う。さらに、そのプロトタイプ実装について報告した後、具体例をもって本提案の有効性を検証する。, 21 Sep. 1999, 99, 76, 21, 24
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, 分枝限定法を用いたプログラム分割の下界に対する考察, 高田雅美; 齊藤哲哉; 中西恒夫; 城和貴, 本稿では,非循環であるタスクグラフを対象としたGirkarのプログラム分割アルゴリズムを見直し,その改良として下限値の1つを提案し,実験によって有効性を示した.下限値を用いた探索の制限により多くの場合,探索時間は短くなり,解についても最適解が返された.稀に解が最適とならない場合もあるが,最適解からの誤差は小さいので,解は近似である.また,Girkarのアルゴリズムではメモリ不足となり実行不可能となるタスクグラフについても,実行結果を得ることを可能とした., 02 Aug. 1999, 99, 67, 79, 84
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, 異なるコンパイラ中間表現の相互変換に関する考察, 曽山典子; 神戸和子; 城和貴; 加古富志雄, 中間表現の研究は永い年月をかけて多くの研究者によって研究されてきた.中間表現の基本構成は共通の認識によって構築されているにもかかわらず,多くのコンパイラでは独自の中間表現を構築し,その実装に多くの時間を費やしている.近年,コンパイラ技術の融合を図るべく統一的中間表現が提案されているが,すでに開発されたコンパイラ技術との融合は困難である.本稿では,すでに実装された異なる中間表現を比較し,それらの相互変換の可能性を調べ,その結果,2つの異なる中間表現は実装上の細部では困難な部分もあるが,概ね可能であることがわかった.同時に各構造体の構成成分がおおよそ同じであることがわかった., 02 Aug. 1999, 99, 67, 85, 90
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, 配列参照パターンによるプログラム並列化・最適化支援, 奥田宗継; 中西恒夫; 笹倉万里子; 城和貴; 福田晃, 「控え目な並列化.最適化」を行う自動並列化コンパイラは,しばしばプログラムの並列化・最適化に失敗し,出力されたプログラムに並列化・最適化の余地が残っていることが多い.プログラマが並列化・最適化に必要な情報を取得し,並列化・最適化を手動で適用するインタラクティブコンパイル環境の実現が望まれる.本稿では,並列化支援視覚化システムNaraViewを用いてループにおける配列参照パターンを視覚化し,並列化・最適化を施す方法に関する議論を行う., 02 Aug. 1999, 99, 67, 145, 150
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, 自動並列化コンパイラの統一的中間表現とインターフェースを用いたコード変換の実装, 羽田昌代; 神戸和子; 中西恒夫; 城和貴, 自動並列化コンパイラで逐次プログラムを並列化する時の手法としてコード変換がある.従来のコード変換はそれぞれの対応する中間表現上で実装が行われており適用順序が任意ではない等の不都合があった.これらの中間表現を統一し,その一つの中間表現に対して変換を行うことが提案されている.本稿では,この統一的中間表現とそのインターフェースを用いて,コード変換手法の一つであるインライン展開を実装し,その結果を検討し統一的中間表現を用いることの意義について議論を行う., 02 Aug. 1999, 99, 67, 151, 156
  • Not Refereed, 情報処理学会研究報告. [ハイパフォーマンスコンピューティング], 社団法人情報処理学会, WindowsNT上でのクロス開発環境を目指す並列化支援ツールの開発, 水原隆道; 平尾智也; 齊藤哲哉; 笹倉万里子; 城和貴; 國枝義敏, 現在の自動並列化コンパイラでは,逐次プログラムを効率良く完全に自動並列化することは困難である.より効率の良い並列化を行うためには,利用者がどの部分をどのように並列化するかを,明示的に指示する必要がある.並列化支援可視化システムNaraViewでは,並列化の度合いを含むプログラム構造,データの依存関係などの情報を視覚化して利用者に提示することが可能である.我々は,NaraViewをWindowsNT上に移植し,従来の機能に加えてソースプログラムとの連係を図る.さらに,ユーザーインターフェイスの改善や,自動並列化コンパイラParafrase-2との連係を強化したシステムを開発し,評価を行う., 02 Aug. 1999, 99, 66, 35, 40
  • Not Refereed, 情報処理学会研究報告. [ハイパフォーマンスコンピューティング], 社団法人情報処理学会, タンパク質分子構造を例とする高性能計算結果の可視化システムの試作, 平尾智也; 水原隆道; 齊藤哲哉; 安藤誠; 秋山泰; 城和貴; 國枝義敏, 高性能計算を通じて生成される膨大な計算結果の可視化手法の研究の一環として,我々はタンパク質分子構造の高度な可視化を行なう"ProteinView"システムを作成した.ProteinViewはWindows95/98/NT4.0上で動作し,タンパク質分子の立体構造を三次元の仮想空間内に効率よく表示するとともに,ジョイスティックを用いて操作者の視点位置を滑らかに移動させることができる.従来のシステムの多くが,分子構造全体を外部から眺めることに重点を置いてきたのに対し,本手法では巨大分子の内部空間における分子の局所構造の詳細な検討が容易に行なえる.本稿では,ProteinViewの設計上の特徴や,実装手法などを述べる., 02 Aug. 1999, 99, 66, 125, 130
  • Not Refereed, Technical report of IEICE. SS, The Institute of Electronics, Information and Communication Engineers, A Formal Specification of Distributed Shared Memory, TAKATA SHIRO; TAGUCHI KENJI; JOE KAZUKI; FUKUDA AKIRA, In this paper, we formally specify and verify some memory consistency models and their implementations that define the behavior of multiple memory accesses on distributed shared memory systems, using a formal method that combines the Z notation and value-passing CCS. Memory consistency models can be classified into two groups. One group includes systems which constrain memory accesses by specifying various program orders of write and read operations. The other includes systems which constrain. memory accesses by programmers specifying how and when synchronization of write and read operations should be made. In this paper, we deal with "Causal Memory Consistency Model" as a representative of the former group and "Release Consistency Model" as a representative of the latter group. We conclude that this formal method is feasible enough for the formal specification and verification of both types of memory consistency models., 19 Mar. 1999, 98, 676, 41, 48
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 剰余区間演算 : データフロー解析のための数学的ツール, 中西恒夫; 城和貴; PolychronopoulosConstantine D; 福田晃, 実数上の区間に対する演算体系として区間演算がある. 本来, 区間演算は浮動小数点計算の丸め誤差解析を行うために考案されたものであるが, プログラム解析にも応用されている. しかしながら, プログラムのループの指標あるいは配列変数の添字等に用いられるのは専ら整数であり, 従来の実数上の区間ではプログラム解析に必要な情報を十分に表現できない. 本稿では, 区間演算を拡張し, 実数上の区間に含まれる整数の集合に対する演算体系, 剰余区間演算を定義し, その数学的性質を明らかにする. さらに, 自動ベクトル化/並列化コンパイラにおいて行われるデータフロー解析への剰余区間演算の応用を検討する., 18 Feb. 1999, 99, 15, 37, 42
  • Not Refereed, 情報処理学会論文誌. 数理モデル化と応用, 社団法人情報処理学会, 変数オリエンティッドなデータ依存関係モデルの提案, 笹倉万里子; 城和貴; 國枝義敏; 荒木啓二郎, プログラムを特徴づける性質の一つとしてデータ依存関係がある. これまで, データ依存関係は, ソースプログラムの文の間の関係としてコンパイラの内部表現で表されていた. しかし近年, ユーザによるプログラムの理解, 最適化や並列化の観点から, ユーザによるデータ依存関係の理解が重要性を増している. そこで本論文では, ユーザへのデータ依存関係の提示を主目的として, 変数を中心としてデータ依存関係を記述するモデルを提案し, それを用いたデータ依存関係の視覚化法について述べる. また, 提案するデータ依存関係の表現法と従来の表現法との対応について述べる., 15 Feb. 1999, 40, 2, 45, 54
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, リリース・コンシステンシ・モデルとその実現の形式的仕様記述について, 高田司郎; 田口研治; 城和貴; 福田晃, 我々は, 分散共有メモリシステムの振る舞いを定義したメモリ・コンシステンシ・モデルとその実現の形式的な仕様記述とその検証の研究を行っている.我々は, 仕様記述言語Zとvalue-passing CCSを統合した形式的技法をコーザル・メモリ・コンシステンシ・モデルに適用した結果, そのモデルと実現の形式的仕様記述, および, その実現の検証がこの技法で一貫して行えることを確認した.そこで, 本稿では, リリース・コンシステンシ・モデルに同様の形式的技法を適用して, そのモデルとその同期に関する実現の形式的仕様記述を行った., 26 Nov. 1998, 98, 105, 81, 86
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, A Combined Data and Program Partitioning Algorithm for Distributed Memory Multiprocessors, 中西恒夫; 城和貴; ConstantineD.Polychronopoulos; 福田晃, In this paper we propose an algorithm to perform data partitioning and program partitioning simultaneously on the Data Partitioning Graph, an intermediate representation for parallelizing compilers. Conventional and, therefore, conservative parallelizing compilers usually activate program partitioning prior to data partitioning. However, on distributed memory multiprocessors, since communication costs change depending on a data partitioning and distribution decision, it is quite difficult to partition a program effectively with consideration of data partitioning. The proposed algorithm reso..., 26 Nov. 1998, 98, 105, 87, 92
  • Not Refereed, 情報処理, 社団法人情報処理学会, PDPTA'98, 城和貴, 15 Sep. 1998, 39, 9, 940, 941
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 変数オリエンティッドなデータ依存関係モデルの提案, 笹倉万里子; 城和貴; 國枝義敏; 荒木啓二郎, プログラムを特徴づける性質の一つとしてデータ依存関係がある.これまで, データ依存関係は, ソースプログラムの文の間の関係としてコンパイラの内部表現で表されていたが, ユーザに提示されることはなかった.しかし近年, ユーザによるプログラムの理解, 最適化や並列化の観点から, ユーザによるデータ依存関係の理解が重要性を増している.そこで本論文では, ユーザへのデータ依存関係の提示を主目的として, 変数を中心としてデータ依存関係記述するモデルを提案し, それを用いたデータ依存関係の視覚化法について述べる.また, 提案するデータ依存関係の表現法と従来の表現法との対応について述べる., 24 Jul. 1998, 98, 67, 31, 36
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Implementation of a Parallelizing Compiler with a Universal Intermediate Representations : Translating of Source Codes into Universal Intermediate Representations, Tanaka Eiji; Nakanishi Tsuneo; Joe Kazuki; Yamashita Masafumi, Intermediate representations used in present parallelizing compilers do not express data-flow informations explicitly required by optimization techniques for data partitioning, distribution, or transfer but data dependences between tasks. Thus those optimization techniques are performed outside intermediate representations and it makes consistent parallelization or optimization difficult. Narafrase, which is a parallelizing compiler implemented in a part of our works, aims to perform consistent parallelization or optimization by using a common intermediate representation among all parallelization/optimization techniques implemented in itself. We use the DPG as the common intermediate representation, which represents data-flow information explicitly. In this paper we report implementation of the translation pass which constructs a DPG from a given source code., 23 Jan. 1998, 98, 7, 19, 24
  • Not Refereed, The Transactions of the Institute of Electronics,Information and Communication Engineers., The Institute of Electronics, Information and Communication Engineers, Estimating Minimum Parallel Execution Time of Loops with Loop-Carried Dependences, NAKANISHI Tsuneo; JOE Kazuki; POLYCHRONOPOULOS Constantine; ARAKI Keijiro; FUKUDA Akira, 本論文では, ループの最小並列実行時間を算出する一手法を提案する. ループを完全に展開したコードのタスクグラフの節点, 枝のそれぞれに, 当該タスクの実行時間, 当該依存に関与する通信の時間をコストとして与えた場合, クリティカルパス -すなわちパスを構成する節点, 枝のコストの合計が最大となるパス- のコストはループの最小並列実行時間を与える. しかしながら, ループを完全に展開することは, 計算時間ならびに消費記憶量の点で実用上好ましくない. 本論文で述べる手法は, 問題を整数計画問題として定式化し, ループを一切展開することなく, このクリティカルパスのコストを算出する. また本論文では, 定式化された整数計画問題を解く分枝限定法ベースのアルゴリズムを実装する. 実装アルゴリズムは, ループを展開したコードのタスクグラフ上のクリティカルパスを与える. Livermoreベンチマークカーネルを用いた評価の結果, 実装アルゴリズムの計算時間は十分実用的であり, かつループの大きさ(繰返し数)に依存しないことが確認された., 25 Sep. 1997, 80, 9, 763, 773
  • Not Refereed, 全国大会講演論文集, 社団法人情報処理学会, An Object-Oriented Class Generation to Enable the Scalar Expansion on Multiprocessors, 大森洋一; 城和貴; 福田晃, マルチプロセッサを対象とした並列化コンパイラは, 従来のコンパイラと比べて複雑なデータ構造を使用するため, 保守性が犠牲になりやすい。その反面, マルチプロセッサには多様なアーキテクチャが存在するので, コンパイラ内部の柔軟性を向上させるのが重要な課題となっている。そこで我々は, オブジェクト指向に基づく並列化コンパイラの設計と, それに基づく試作を行なっている。本稿では, オブジェクト指向に基づくコンパイラ設計の拡張性を検証するために, ループ・プライベイタイゼーション(loop privatization)と呼ばれる並列化手法をクラスとして組み込み, 十分な部品化が可能であることを示す。, 24 Sep. 1997, 55, 1, 331, 332
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, データ分割配置を考慮するループディストリビューション, 中西恒夫; 城和貴; PolychronopoulosConstantine D; 荒木啓二郎; 福田晃, 本稿では, 自動並列化コンパイラの中間表現であるデータ分割グラフ上で, データ分割配置とループディストリビューションを同時に行うアルゴリズムを提案する. 従来の一般的なループディストリビューションアルゴリズムでは, ループネストは可能な限り細かく分割され, また並列化なループは全て並列化される. しかしながら, 通信オーバーヘッドが比較的大きな分散メモリ型並列計算機上では, 過剰なループネストの分割と並列化は, プロセッサ間通信のために当該ループネストの実行時間が引き延ばされる結果に陥る. 提案アルゴリズムでは, データ転送コストを考慮の上で適正なループネストの分割と並列化を行う., 20 Aug. 1997, 97, 76, 13, 18
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), An Object - Oriented Description of Loop Parallelization, OMORI Yoichi; JO Kazuki; FUKUDA Akira, Object-oriented design is an answer to ease complexity of developping parallelizing compilers. The inside of compilers increases the flexibility, because the parallelizing phase is devided into three sub-phases and gets feedbacks of hardware conditions. In this paper, the chief effort is devoted to clarify the class stands for an intermediate presentation of loop and its parallelism. The class offers basic data structures departed from algorithms to parallelize loops, therefore the extensionability also increases., 19 Aug. 1997, 97, 75, 115, 120
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Views and their connection in Nara View, SASAKURA Mariko; KIWADA Satoko; JOE Kazuki; ARAKI Keijiro, Parallelizing compilers aim to transform any sequential program to a parallel program automatically. But, general strategy of choosing the best transformation method have not been known. Therefore, we are developing a visualization system named NaraView, which provides an interactive compilation or programming environment for parallel computer user. In this paper, we describe views and their connection in NaraView., 24 Jan. 1997, 97, 11, 9, 16
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, Communication-Parallelism Graphによるデータ自動分割手法, 齊藤哲哉; 城和貴; 福田晃, 逐次のアプリケーションをワークステーションクラスタのような分散環境の上で分散化しようとするとき、データをどのように分割し配置するかが大きな問題となる。分散化を行うソフトウェアの多くは、これらの作業を利用者に任せているが、自動的に行う手法もいくつか提案されている。本稿では、データの分割と配置を一度に決定することができる通信-並列性グラフ(communication-Parallelism Graph)を用いて、逐次のアプリケーションをリモートプロシージャコールベースの分散化コンパイラSCIDDLEでコンパイルできる形式に変換するトランスレータの実装方針について述べる。, 24 Jan. 1997, 97, 11, 25, 30
  • Not Refereed, 電子情報通信学会論文誌, ループ最小並列実行時間を算出する一手法, JOE Kazuki, 1997, J80-D-I, 9, 763-773
  • Not Refereed, 知能情報・高度情報処理シンポジウム報告書, 1997, cc-COMAの概要, 城和貴, 1997
  • Not Refereed, 並列処理シンポジウムJSPP'97 (チュートリアル講演), Sep, 情報処理学会, メモリ・コンシステンシ・モデルの諸定義と解釈例, 城和貴, 1997
  • Not Refereed, 並列処理シンポジウムJSPP'97(チュートリアル講演), 情報処理学会, メモリ・コンシステンシ・モデルの諸定義と解釈例, 城和貴, 1997, 149, 163
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 分散型構造解析手法の負荷分散への適用, 小板隆浩; 城和貴; 福田晃, 分散システムを有効に利用するためには, システム内の各ノード間の負荷の違いを均等にする負荷分散が必要となる. 分散管理型の負荷分散は, それぞれのノードにおいて負荷を管理し, 負荷の転送を行ない, 大規模システムへの適用において有効である. 我々は、大規模分散システムの負荷分散手法として、構造物の変形解析として定式化されている分散型の解析手法を、負荷分散の問題に応用し、問題を定式化する。この構造物の解析手法は、隣接するノード間の部分通信により実現されており、大規模システムの負荷分散手法として応用も可能である. 提案手法をシミュレーシヨンにより評価した., 26 Nov. 1996, 96, 118, 41, 47
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), 3D Visualization of Data Dependence for Parallelization Support, KIWADA Satoko; SASAKURA Mariko; NAKANISHI Tsuneo; JOE Kazuki; FUKUDA Akira; ARAKI Keijiro, Recent improvement of graphic workstations allows a frequet use of 3D visualization of information. 3D visualization has a great advantage of treating complex information as well as a large amount of data. In this paper, we propose a 3D visualization method for data dependence which parallelizing compilers may detect. Using the method, users can analyze their parallel programs to find redundant dependence which keep their programs to be parallelized. This is a function of NaraView, which is an integrated environment of a parallelizing compiler and its user-interface with 3D visualization., 04 Oct. 1996, 96, 97, 37, 42
  • Not Refereed, IPSJ Magazine, Information Processing Society of Japan (IPSJ), Analytic Modelling Techniques for Parallel Computers, JOE Kazuki; FUKUDA Akira, 15 Jun. 1996, 37, 6, 528, 535
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, ループによって運ばれる依存を有するループの並列実行時間の見積り, 中西恒夫; 城和貴; PolychronopoulostConstantine D; 福田晃; 荒木啓二郎, ループは並列性の重要な源であり、またプログラムの実行時間の大部を占める。そのためこれまで、マルチプロセッサ用に様々なループのイタレーション単位(中粒度)での最適化技法が提案、使用されてきた。一方、スーパースカラ技術をはじめとする、近年のプロセッサ内部における細粒度並列処理技術の普及により、ループボディ内での最適化技法が重要になりつつある。ループ全体の並列実行時間の下限は、こうした異なる粒度での最適化手法の効果を、統一的かつ定量的に評価するのに有用な尺度であろう。ループ全体の並列実行時間の下限は、ループを完全に展開したコードの依存グラフのクリテイカルバスのコストを求めることにより得ることができる。しかしながら、ループを完全に展開することは実用上極めて問題である。本稿では、問題を整数計画問題に帰着させ、このクリティカルパスのコストを、ループを一切展開することなく得る手法を提案する。さらに提案手法を実装、実際のプログラムに適用し、提案手法が実用的な時間でクリテイカルバスのコストを与えることを示す。, 05 Mar. 1996, 96, 23, 25, 30
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, SMCIモデルのアップデート型キャッシュ・コヒーレンス・プロトコルへの適用, 城和貴; 福田晃, 本稿では、既に我々の提案している、インバリデーション型キャッシュ・コヒーレンス・プロトコルを採用した並列計算機に対する解析モデル、Semi-markov Memory and Cache coherence Interference (SMCI)モデルの、アップデート型キャッシュ・コヒーレンス・プロトコルへの適用について報告する。本稿で提案するSMCI/Dragonモデルは、元のSMCIモデル同様、代表的なアップデート型プロトコルであるDragonを採用した並列計算機の性能予測を行なう。確率過程等を利用したこれまでの解析モデルでは、並列システムの大規模化に伴い、状態数の爆発的増化という避けがたい問題があった。SMCIモデルでは、状態数はシステムの規模に無関係に定まる。本稿で報告するDragonプロトコルに対する状態数は20である。, 05 Mar. 1996, 96, 24, 3, 8
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 整数計画問題としてのループ並列実行時間の下限算出問題, 中西恒夫; 城和貴; PolychronopoulosConstantine D; 福田晃; 荒木啓二郎, 並列処理の分野において、プログラムの並列実行時間の見積りは、静的スケジューリング、自動並列化等の応用で重要な問題である。特に、プログラム中のループには多くの並列実行可能部分が潜在するため、ループ部の並列実行時間の見積りに対する需要は大きい。ループ全体の並列実行時間の下限は、ループを展開したコードの依存グラフを生成し、そのクリティカルパスのコストを算出することにより得ることができるが、この方法はループの大きさに対するスケーラビリティの点で劣る。本稿では、ループを展開することなく、ループを展開したコードの依存グラフのクリティカルパスのコスト-すなわちループ全体の並列実行時間の下限-を算出する問題を、整数計画問題に帰貴させ、単体法ならびに分技限定法を用いて解く。これにより、問題解決にかかる時間はループの大きさに依存せず、大規模なループの並列実行時間の下限の算出が可能となる。, 22 Jan. 1996, 96, 10, 13, 18
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Compiler Implementation Framework with the Hierarchical Task Graph, MARUKAWA Kazushi; JOE Kazuki; CRAIG David; POLYCHRONOPOULOS Constantine; FUKUDA Akira, It is the goal of our project to develop a new compiler as an infrastructure for research on parallelizing and optimizing compilers. The system is constructed by passes which depend only intermediate representation. Therefore each pas was applied any time independent of other passes. The intermediate representaion for such system must be unified to keep consistency among passes. This paper argues that the HTG (Hierarchical Task Graph), which was initiated by CSRD, is suitable as a universal intermediate representation for such system, and presents an implementation framework with it., 18 Oct. 1995, 95, 97, 1, 6
  • Not Refereed, 情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告, 社団法人情報処理学会, 共有メモリ型並列計算機の解析モデル, 城和貴; 福田晃, キャッシュ・メモリを有した共有メモリ型並列計算機に対する、セミマルコフ過程を利用した解析モデルを提案する。提案されるSMCI(Semi-markov Memory and Cache coherence Interference)モデルは、キャッシュ・コヒーレンス制御命令や通常のデータ・リクエストの、ネットワーク競合やメモリ競合による待ち状態を、実際の並列プログラムに特有のパラメータを与えることにより、容易に記述できる。また、並列計算機自体のシステム構成も人力パラメータとして与えることができるため、さまざまなシステム構成を持つ並列計算機の、アプリケーションごとの性能評価を容易かつ詳細に得ることができる。これまでのマルコフ連鎖等を利用した並列計算機の解析モデルと異なり、SMCIモデルにおける状態数は、プロセッサ台数やメモリ・サービス時間に依存せず、評価対象とする並列計算機の採用しているキャッシュ・コヒーレンス・プロトコルによってのみ決定する。従って、SMCIモデルの計算時間は本質的にシステムの規模に左右されない。, 20 Sep. 1995, 95, 93, 13, 18
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Visualizing Hierarchical Task Graphs, Sasakura Mariko; Kiwada Satoko; Joe Kazuki; Araki Keijiro, For parallelizing compilers which generate parallelized programs from sequential programs, it is important to provide parallelization assist systems which help users to understand programs, debug, and extract parallelism that are hardly found out by only compilers. In this paper, we propose a program visualizing system which is based on HTG(Hierarchical Task Graph). The HTG was designed and implemented as an intermediate expression of the Parafrase-2 which is a parallelizing compiler developed in Ilinois Univ. We discuss an outline of our system and a method of visualizing graphs for HTG., 24 Aug. 1995, 95, 82, 25, 32
  • Not Refereed, 情報処理学会研究報告. PRO, [プログラミング], 社団法人情報処理学会, OMT法による並列化コンパイラ中間言語フレームワークの構築, 大森洋一; 城和貴; 福田晃; 荒木啓二郎, 現在、コンパイル時におけるプログラム並列化手法が数多く提案されているが、それらの間の関係は必ずしも明らかでない。このため、各手法の組合せあるいは相互評価ができにくい。そこで、今後の研究を進めるにあたり、共通の条件により比較・検討できる環境が望まれる。この環境は、1.実装技術に左右されにくい。2.理論的に明解である。3.汎用性が高く、安定している。といった性質を備えているのが望ましい。本稿では、オブジェクト指向設計法の1種であるOMTを用いて、それぞれの手法を系統的に整理し、中間言語のフレームワーク生成の可能性を検討する。特に、コンパイラの中心となる意味解析木について解析結果を述べる。, 24 Aug. 1995, 95, 82, 33, 40
  • Not Refereed, 情報処理学会研究報告. マルチメディア通信と分散処理研究会報告, 社団法人情報処理学会, ワークステーションクラスタにおけるSCIDDLEライブラリの評価, 齊藤哲哉; 城和貴; Luthi PeterHans; ArbenzPeter; 福田晃; 荒木啓二郎, SCIDDLEは、並列アプリケーションを並列コンピュータやワークステーションクラスタといった非均質なネットワーク環境に分散化するツールである。我々は、次世代のスーパーコンピューティング環境構築のための第一段階として、SCIDDLEの性能評価を行った。これにより、非同期呼び出しの制御を行う関数がシステムの性能に大きく影響することがわかった。また、実際にSCIDDLE上で動作する化学計算アプリケーションDISCOについても性能評価を行い、SCIDDLEがアプリケーションの性能にどのような影響を与えているかを調べた。これらの結果から、筆者らの提案する次世代のスーパーコンピューティング環境、すなわち、広域分散局所並列処理環境構築への指針を示す。, 13 Jul. 1995, 95, 61, 91, 96
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), HDPG : Hierarchical Data Partitioning Graph, Nakanishi Tsuneo; Joe Kazuki; Polychronopoulos Constantine D.; Fukuda Akira; Araki Keijiro, In this paper we propose HDPG-Hierarchical Data Partitioning Graph-as an intermediate representation for parallelized compilers. Traditional data partitioning techniques cope with loop parallelism and tend to get an optimal solution in a loop rather than in multiple loops. HDPG, which is an extension of HTG (Hierarchical Task Graph), can provide with a framework for data partitioning coping with functional parallelism at various granulalities. Using HDPG compilers can obtain an optimal data partitioning in a given program, moreover do partition data matching with the hierarchy in architectures such as the memory hierarchy., 22 Jul. 1994, 94, 68, 89, 94
  • Not Refereed, 情報処理学会研究報告. [プログラミング-言語基礎実践-], Information Processing Society of Japan (IPSJ), A Loop Parallelization Technique for Linear Dependence Vector, Kitasuka Teruaki; Joe Kazuki; Fukuda Akira; Araki Keijiro, In this paper, we propose loop parallelization technique and iteration alignment technique using cosets. The targeted loops are with linear dependence vector, rather than with constant vector. Early work of loop parallelization with linear dependence vector sacrifices parallelism and do not consider interprocessor communication. The technique we propose is based on cosets. It extracts more parallelism and considers interprocessor communication. The loops of n iterations are parallelized with O(log(n)) steps, which are allocated to processors to reduce interprocessor communication cost., 21 Jul. 1994, 94, 65, 25, 32
  • Not Refereed, 情報処理学会研究報告. 計算機アーキテクチャ研究会報告, 社団法人情報処理学会, DPG:データ分割グラフ, 中西恒夫; 城和貴; 福田晃; 荒木啓二郎, 本稿では,並列化コンパイラの中間表現としてデータ分割グラフDPGを提案する.これまで,中間表現として用いられてきたタスクグラフは,タスク間依存関係は表現されていたが,データ依存の源である変数そのものは表現されておらず,データ分割には適用し難いものであった.一方,データ分割はad-hocな手法が多く,また本来同時に考慮されるべき,スケジューリングなどのプロセッサ間の通信コストに絡む問題とは分けて論じられる嫌いがあった.DPGは変数をグラフ中に表現することにより,一般性の高いデータ分割手法を提供し,さらにはデータ分割をプロセッサ間通信コストの種々の問題と同時に取り扱うための土台を提供する., 27 Jan. 1994, 94, 13, 121, 128
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), An Analytic Model for a Multiprocessor Computer -Prediction of a Shared Block Behavior-, Joe Kazuki; Fukuda Akira, Develping an analytic model for a cache based shared memory parallel computer, a part of modelling for a cach coherence control is one of the most important and difficult stuff. Some previous model attempted to focus on shared blocks from the view point of cache coherence mechanism under the assumption of infinit cache size. Although the model is simple, there is the unavoidable assumption that the miss hit of private block does not affect the shared block behavior. Considering a large-scaled number crunching, there are many applications which can not ignore the affection of such a miss hit. In this paper, we propose a new analytic model of a parallel computer with finite cache size where the miss hit of private blocks affects shared block behavior. Using Markov process, our model predicts the state of a shared block when a cache hit ratio of private block is given., 19 Aug. 1993, 93, 72, 81, 88
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), A Parametric Simulator for Multiprocessor Using Adress Trace, Omori Youichi; Joe Kazuki; Fukuda Akira; Araki Keijirou, Conventinally, an evaluation of a multiprocessor computer larger than existing computers has been usually performed by using analytic model or probablistic simulation. But, in some cases, they don't have enough ability to stand for real machines. Trace-driven simulation results in very similar to real machines. It takes too long execution time and needs too much memory to stand for a large scale multiprocessor. So, based on the Trace-driven simulation, using probabilistic model in independent modules, we save not only memory but also execution time. And the difference of result from pure Trace-driven simulation is only 5% or less., 19 Aug. 1993, 93, 72, 113, 120
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), An Analytic Model for a Multiprocessor Computer -Comparison with a Simulation-, Joe Kazuki; Fukuda Akira, In this paper, we propose an analytic model using a semi-markov process for a parallel computer with cache memory. The proposed model can be used for the performance evaluation or analysis of a parallel computer with cache memory because it can be easily applied to describing the cache coherence control and the waiting states for network arbitrations or memory contention. Furthermore, the model is so flexible that it allows various kind of system parameters and it offers efficient input parameters. Using the proposed analytic model, we investigate some comparative experiments with widely known simulation. The result shows that there is only 4.36% difference between the actual simulation and our analytic model while the analytic model can evaluate a 1,024 processor system within 1/100 second., 11 Jun. 1993, 93, 49, 17, 24
  • Not Refereed, 生物の科学「遺伝」別冊, 裳華房, ノイマン型からニュ-ロコンピュ-タ-へ (脳研究とニュ-ロコンピュ-タ--学習・記憶のメカニズムを探る) -- (ニュ-ロコンピュ-タ), 三宅誠; 城和貴, Nov. 1989, p96, 101
  • Not Refereed, 89'信学秋全大,SD-11-4, 階層型ニューラルネットの統合, 城和貴, 1989, 6.282, 6.283
  • Not Refereed, テレビジョン学会誌, 社団法人映像情報メディア学会, 5)読唇による単音節の認識([画像表示研究会視覚情報研究会画像通信システム研究会]合同), 積山薫; 城和貴; 梅田三千雄, 20 Mar. 1988, 42, 3
  • Not Refereed, 信学技法,PRU88-94, ニューラルネットの学習における新しいタイプの教師, 城和貴, 1988
  • Not Refereed, 信学技報, PRU88-94, ニューラルネットワークの学習における新しいタイプの教師, 城和貴, 1988
  • Not Refereed, ITE Technical Report, The Institute of Image Information and Television Engineers, Lipreading Japanese syllables, Sekiyama Kaoru; Joe Kazuki; Umeda Michio, Human lipreading abilities were investigated. A VCR (VTR) was used to display a female narrator who spoke 100 Japanese syllables. The subjects were 40 normal adults. They were assigned to one of two narrators and participated in 3 experimental sessions of 100 syllables. The result showed: (a) Although only 15% of the syllables were reported correctly, 80% of vowels and 20% of consonants were read correctly. (b) By overlooking some types of errors, such as confusion within labials, within voiced and voiceless pairs, and so forth, 35% of syllables were recognized correctly. (c) Labials were almost perfectly discriminated from non-labials. (d) Stimulus-response patterns suggested features specific to a narrator as well as some common to narrators. (e) Practice effect were found., Jan. 1988, 12, 1, 33, 40
  • Not Refereed, 情報処理学会論文誌, 情報処理学会, 「情報処理学会論文誌:数理モデル化とその応用」の編集にあたって, 城 和貴; JOE Kazuki; 北 栄輔; KITA Eisuke, 48
  • 日本ソフトウエア科学会大会論文集, Prototype of a Visualizing System for Protein Molecular Structures: ProteinView., 平尾智也; 水原隆道; 斉藤哲哉; 安藤誠; 秋山泰; 城和貴; 国枝義敏, 1999, 16th
  • 研究報告ハイパフォーマンスコンピューティング(HPC), Characterization of Graph500 Benchmark Based on Suitability for Cache of Sparse Matrices, 田邊 昇; 冨森 苑子; 高田 雅美; 城 和貴, Graph500 はビッグデータ解析や疎行列処理のベンチマークとも言われており,近年注目を集めている.本論文では Graph500 の疎行列や,その Randomize や先行研究の Vertex sorting の有無を制御した行列のキャッシュメモリへの適合性を,空間的局所性の観点から解析した.その結果,Graph500 の疎行列の空間的局所性は極めて低く,疎行列ベクトル積 (SpMV) を行う場合にはベクトルのアクセスの際に,キャッシュラインには平均して 1 個程度しか有効なデータは載っていないことが判った.ランダマイズによりその傾向が強まる.Vertex sorting は空間的局所性にはあまり作用しなかった.上記行列の SpMV 実行時の GPU の L1 キャッシュヒット率は,Vertex sorting の効果が小さく,グラフサイズ (SCALE) が大きくなるほど低下した.データサイズの大きさと非零要素配置のランダム性のため,キャッシュアウェアなソフトウェア最適化が困難である.特に空間的局所性の低さに伴う問題は現時点では未開拓な性能改善要因である.ゆえに,Graph500 や Green Graph500 の競争で優位に立つには,1 桁程度のメモリトラフィック削減による高速化や省電力化が期待できるメモリ側の Gather 機能が有望である.Graph500 is a benchmark suite for big data analysis and sparse matrix processing which receives attention in these years. The spatial locality of sparse matrices used for Graph500 and their variations which are controlled in adoption of randomization and vertex sorting which is a technique of preceding work are investigated. We show the spatial locality of sparse matrices used for Graph500 is very low and there is about 1 or a little more valid data on a cache line for the memory accesses issued by sparse matrix-vector multiplications (SpMV) in average. The tendency is increased by randomization. The effect of vertex sorting does not have big effects on spatial locality. Effect of vertex sorting on L1 hit rate of GPU on processing SpMV for the above matrices is small and is degraded when the size of graph (i.e. SCALE) becomes larger. It is very difficult to solve the problem by just software approach because of the huge size of sparse matrices and the randomness of their accesses to degrade the optimization against their cache awareness. Especially problems caused by low spatial locality are frontiers of improvement, now. Therefore, hardwired gather functions at memory side is promising for taking advantage in the Graph500 lists, which improve the processing speed due to reduction of memory traffic in an order of magnitude., 14 Feb. 2013, 2013, 30, 1, 7
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Learning Heart Rate Date by Neural Networks and its application, 赤尾 維; 野村 涼子; 石川 由羽; 高田 雅美; 城 和貴, In recent years, increasing medical burden due to the increase of rapid progress and lifestyle diseases of aging becomes a problem, preventive medicine to make personal health management has been required. Wearable device that can manage health in real time has been developed for this purpose. Also known to be able to estimate the psychological stress by analysis of heart rate variability. Since stable heart rate data is required to estimate the psychological stress, completion of removal or missing values of the noise is important. When obtaining the heartbeat on the wearable terminal in daily life, it may not be acquired contamination and temporary data noise. So to perform learning of heart rate by using a neural network in this study, we propose a method to complement leaving the personality of individual defects in heart rate data., 24 Feb. 2015, 2015, 17, 1, 6
  • IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), Development of real time respiration monitoring system by using standing wave radars, 高木 里穂; 石川 由羽; 高田 雅美; 梅田 智弘; 城 和貴, Sudden infant death syndrome is a disease that a well-looking baby of up to one year stops his/her breathing without any reason, and comes to die. To prevent babies from this disease, some kind of systems that check baby's breathing circulating system to detect abnormal foretaste is required. Such error detection for baby's breathing circulating can be realized by standing wave radars, which measures the distance of target objects precisely. Measuring series of displacements to the breast of a baby by using standing wave radars. we apply Fourier transform analysis for the frequency band of baby's breathing, and we present the development of respiration monitoring system to observe of baby's breathing., 19 Jan. 2015, 2015, 1, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of real time respiration monitoring system by using standing wave radars, 高木 里穂; 石川 由羽; 高田 雅美; 梅田 智弘; 城 和貴, Sudden infant death syndrome is a disease that a well-looking baby of up to one year stops his/her breathing without any reason, and comes to die. To prevent babies from this disease, some kind of systems that check baby's breathing circulating system to detect abnormal foretaste is required. Such error detection for baby's breathing circulating can be realized by standing wave radars, which measures the distance of target objects precisely. Measuring series of displacements to the breast of a baby by using standing wave radars. we apply Fourier transform analysis for the frequency band of baby's breathing, and we present the development of respiration monitoring system to observe of baby's breathing., 19 Jan. 2015, 2015, 1, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of Reasoning System for Answering Question using Machine Learning, Yuri Iwakata; Minami Kawasaki; Yuki Eguchi; Yuu Ishikawa; Masami Takata; Joe Kazuki, In this paper, we develop a system to guess the answer of the questions. In the system, once training data is created with language analysis and feature vectors of question statements, then a learning machine is performed for pattern classification. By using the system, the answer can be obtained. LVQ(Learning Vector Quantization) is known as a representative method of supervised learning for multi class classification. LVQ needs the number of classes as initialization. Kernel principal component analysis and gap statistic are methods for getting number of classes. Since kernel principal component analysis is a method for estimating visually and gap statistic is a method for unsupervised learning, there is not suitable for the proposed system. AP(Affinity Propagation),which is a method of unsupervised learning, is not necessary to determine the number of classes in advance. Hence, we propose a method for performed supervised learning to estimate number of classes through AP is improved using LVQ., 02 Dec. 2014, 2014, 10, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Partial recognition of three-dimensional object In volume data, Eri Nagao; Yu Ishikawa; Masami Takata; Joe Kazuki, In this paper, we propose a method of partial recognition for three dimensional object in volume data. In hospitals, MRI (magnetic resonance imaging) and CT (Computed Tomography), which take photos as slice images, are often adapted to obtain information in inner of body. By constructing slice images to a three-dimensional object, users understand information of slice images intuitively. By an automatic partial recognition, location of pathology can be clear speedy. In the proposed method, slice images are transformed into volume data and a partial recognition is performed using LVQ (Learning Vector Quantization) with the three-dimentional SIFT features., 02 Dec. 2014, 2014, 9, 1, 6
  • 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, The Institute of Electronics, Information and Communication Engineers, Ruby Removal Filters by Genetic Programming using the classification of printing type data for Early-Modern Japanese Printed Books, 粟津 妙華; 高田 雅美; 城 和貴, In National Diet Library, books which are possessed in library as "the digital library from meiji era" are open to the public on Web. Since these are shown as image data and cannot search using document contents, an automatic text conversion is needed. There is a major obstacle to text conversion. It is ruby. Ruby can not be removed in the histogram method. Therefore, we have proposed a ruby removal method for early-modern Japanese printed books. However, since the proposed method is based on the external information added to the books, the feasibility is low. In this paper, we propose a method to remove the ruby automatically from early-modern Japanese printed books by generating ruby removal formula in Genetic Programming using the training data was based on the data of book image., 25 Jun. 2014, 114, 105, 117, 122
  • IPSJ SIG technical reports, Information Processing Society of Japan (IPSJ), Ruby Removal Filters by Genetic Programming using the classification of printing type data for Early-Modern Japanese Printed Books, 粟津妙華; 高田雅美; 城和貴, In National Diet Library, books which are possessed in library as "the digital library from meiji era" are open to the public on Web. Since these are shown as image data and cannot search using document contents, an automatic text conversion is needed. There is a major obstacle to text conversion. It is ruby. Ruby can not be removed in the histogram method. Therefore, we have proposed a ruby removal method for early-modern Japanese printed books. However, since the proposed method is based on the external information added to the books, the feasibility is low. In this paper, we propose a method to remove the ruby automatically from early-modern Japanese printed books by generating ruby removal formula in Genetic Programming using the training data was based on the data of book image., 18 Jun. 2014, 2014, 20, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Ruby Removal Filters by Genetic Programming using the classification of printing type data for Early-Modern Japanese Printed Books, 粟津妙華; 高田雅美; 城和貴, In National Diet Library, books which are possessed in library as "the digital library from meiji era" are open to the public on Web. Since these are shown as image data and cannot search using document contents, an automatic text conversion is needed. There is a major obstacle to text conversion. It is ruby. Ruby can not be removed in the histogram method. Therefore, we have proposed a ruby removal method for early-modern Japanese printed books. However, since the proposed method is based on the external information added to the books, the feasibility is low. In this paper, we propose a method to remove the ruby automatically from early-modern Japanese printed books by generating ruby removal formula in Genetic Programming using the training data was based on the data of book image., 18 Jun. 2014, 2014, 20, 1, 6
  • IEICE technical report. Dependable computing, The Institute of Electronics, Information and Communication Engineers, Definition and potential trends of CSoC (Configurable System-on-Chip), MATSUMOTO TAKASHI; JOE KAZUKI, In those days when SoC(System-on-Chip) is to be practical by enough large integration degree of LSIs, the development of ASIC(Application Specific IC), which allows differentiation by product or company, was still shriving. Such trends gave Japanese semiconductor industries a prediction that SoC type ASIC development would spread to be accelerated, and the ASIC development was widely encouraged. However, it is ASSP (Application Specific Standard Product) for general customers that is survived among various SoCs because of soaring development costs for highly integrated LSIs. In this way, the current hot LSI target is ASSP as SoCs. Many products of the ASSP SoCs provide much more functions on a chip than corresponding to the number of external pins so that users can select the functions they need and/or the roles of the external pins they use. We call such ASSP SoC with the above features CSoC. In this paper we describe the necessity of the CSoC survived in semiconductor products, and discuss the future of the CSoC., 15 Mar. 2014, 113, 498, 157, 162
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Analysis of the Relation between the Number of Necessary Training Data and Each Category for Multi-Fonts Kanji Character Recognition Method, 粟津妙華; 福尾真実; 高田雅美; 城和貴, Since the fonts of the Kanji character in early-modern Japanese printed books dating from the Meiji era to the first half of Showa era (AD1868-1945) has the greatly different feature from the standard fonts determined by JIS. We have been proposed the multi-fonts Kanji character recognition method suitable for early-modern Japanese printed books. In this paper, the multi-fonts Kanji character recognition method is applied to 1000 kinds of Kanji characters, and the relationship the between the feature of Kanji characters and the numbers of necessary training data is analyzed. In our proposed method, when Kanji characters are recognized with the PDC feature and SVM, the training data is needed. However, it was not analyzing about the relation between Kanji characters and the number of necessary training data. Therefore, the reration between the feature of Kanji characters and the number of necessary training data is analyzed using the feature value of Kanji characters by PDC vector and the change of recognition rate for each category of training data., 24 Feb. 2014, 2014, 10, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Feature Extraction for Electroencephalographic Personal Identification, Yu Ishikawa; Chinami Yoshida; Masami Takata; Kazuki Joe, In this report we investigate feature extraction methods effective for biometric identification using brain waves. We extract power spectrum of theta, alpha, beta and gamma waves for the quantity of personal characteristic. We measure the brain waves of five tasks in multichannel electroen-cephalograph and analyze each error rate. As a result, the theta wave generates the lowest error rate, especially for the right hemisphere and occipital lowered in the image task case. The error rate by 16 channel and 5 tasks was 3.8%., 24 Feb. 2014, 2014, 20, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Barrier-free level determination of a building using the ontology, Momoyo Matsumoto; Masami Takata; Kazuki Joe; Kazuki Joe, In this research, we construct a 3D surface model, which is translated in information of standing wave radar. The standing wave radar can measure distance to an object without contact. In the information of the standing wave radar, an optimal combination algorithm is adopted. Then, once the three-dimensional information is transformed into the two-dimensional coordinates, a 3D surface model is constructed by using the Delaunay triangulation., 24 Feb. 2014, 2014, 15, 1, 6
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Modeling of physical activity including Non-Exercise Activity Thermogenesis using plural triaxial accelerometers, Kyoko Nakao; Tomohiro Umeda; Masami Takata; Kazuki Jo, The metabolism by physical activity of low exercise intensity in daily life (Non-Exercise Activity Thermogenesis: NEAT), account for 20-30% of total energy expenditure of the people, its individual difference is large. Therefore, we propose the modeling for estimating energy expenditure of any physical activities including not only exercise but also NEAT. Energy expenditure is in proportion to body weight. Accordingly we model by limiting the energy expenditure of the body having a large specific gravity in the whole body. To capture more accurate movement of the body, we use three-axis acceleration data of the three points, right thoracic and left thoracic and lumbar. We propose a model of energy expenditure by physical activity including NEAT from momentum, kinetic energy, impulse, and work., 24 Feb. 2014, 2014, 21, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 一般社団法人情報処理学会, 疎行列ベクトル積性能を決める諸要因, 田邊昇; 冨森苑子; 高田雅美; 城和貴, 疎行列ベクトル積 (SpMV) は多くの場合にキャッシュアーキテクチャとの相性が悪い.並列処理においては負荷不均衡が性能に与える影響も大きい.これまでは SpMV 性能を決める要因として,キャッシュのヒット率や一行あたりの非零要素数の平均,最大値,分散が注目されていた.しかし,それらと性能との相関が不明瞭であり,SpMV の挙動は長年にわたり謎に包まれていた.それは SpMV の最適化や,効率的な疎行列ライブラリ構築の障害であった.本報告では,SpMV 性能を左右する様々な要因をアプリケーション依存の要因とプラットフォーム依存の要因に分けて考察した.それを踏まえて行列の非零要素配置から導かれる時間的局所性と空間的局所性等のアプリ依存パラメータを導入した SpMV 性能モデルを構築した.その上でフロリダ大コレクションから抜粋した 115 種の疎行列と GPU を用いて SpMV 性能モデルの評価実験を行った.その結果,GPU 上で実行する場合は Padding に関する補正と小さな行列での補正が必要であることと,長行を折り畳むなど適切な負荷分散がなされた場合はキャッシュのヒット率よりも,空間的局所性やインデックス転送の抑制の方が実効性能に敏感であることが明らかになった., 24 Feb. 2014, 2014, 7, 1, 10
  • IPSJ SIG Notes. CVIM, Information Processing Society of Japan (IPSJ), A feature extraction method using color bounds for 3D geometric data, Nozomi Yanagisawa; Masami Takata; Kazuki Joe, In this paper, we propose a feature extraction method using color bound in order to find concavo-convex shape. The concavo-convex shape is constructed to border lines, of which reflectance rates are widely difference in a surface of a measurement 3D model. Since each color has a difference reflectance rate, the border lines are called as color bounds. A position of a color bound in a 3D model becomes equal to the edge position related to the color bound in a 2D picture. Therefore, through the position of the color bound is combined with the edge position, texture mapping can be performed exactly. To evaluate the proposed method, we adopt to 3D models, which are obtained by VIVID910., 21 Nov. 2013, 2013, 20, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 一般社団法人情報処理学会, アーキテクチャの進歩を促進するGraph500ベンチマークのあり方, 田邊昇; 冨森苑子; 高田雅美; 城和貴, Graph500 はビッグデータ解析や疎行列処理のベンチマークとも言われており,Top500 を補うものとしても近年注目を集めてきた.従来の Graph500 参照実装は従来の計算機が苦手とする疎行列ベクトル積系応用全般を代表し,計算機の発展を促進する力があった.一方,ビットマップ式訪問管理と Hybrid BFS アルゴリズムがデファクトになる流れにある.筆者らの予備調査の結果,それらを実装した Pre release 版 Graph500 はキャッシュに適合し,メモリアクセス負荷が大幅に軽減され,本来とは異質なワークロードになることが明らかになってきた.本報告では,計算機の発展を促進する観点から,スーパーコンピュータのランキングに利用されるベンチマークの役割と,その望ましいあり方を考察する.さらに Hybrid 動作における局所性とキャッシュ挙動の観点から上記の予備調査結果を補強するとともに,Graph500 の将来について考察する., 23 Sep. 2013, 2013, 18, 1, 9
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Access Locality in Hybrid Solution of Graph500, Noboru Tanabe; Sonoko Tomimori; Masami Takata; Kazuki Joe, Graph500 is a benchmark suite for big data analysis and sparse matrix processing which receives attention in these years. Since the use of a bitmap to mark the visit of vertices and Beamer's Hybrid BFS algorithm to make a part of a sparse matrix be accessed are reported, we believe that such methods are to be a de facto standard. In this paper, from the viewpoint of reference locality, we analyze the memory access characteristics of pre-release version implemented with OpenMP and the two methods for the latest Graph500 reference code. As the results, we confirm that the number of memory accesses, a spatial locality metric of row index that shows performance degradation in the case of cache misses, and temporal locality (average working set sizes) that shows the resistance to cache misses, change drastically. We confirmed that the reduction rate of the number of memory accesses and temporal locality are accelerated in proportion to the target graph sizes. It means that the Graph500 with Hybrid method is another benchmark suite to measure the characteristics of optimized BFS implementation, while the conventional Graph500 represents most applications with sparse matrix vector multiplications that are not efficiently performed on conventional computer systems to require the improvement of computer systems. Furthermore, the hot spots against processing times do not include the functions to perform BFS, and we find it is no longer the benchmark for search speed practically. To investigate the essential meaning of the benchmarks, we propose appropriate and practical rules that do not damage it., 24 Jul. 2013, 2013, 27, 1, 8
  • 研究報告計算機アーキテクチャ(ARC), Scatter/Gatherをどこで行なうべきか?-低電力で高スループットなランダムアクセスのために-, 田邊昇; 冨森苑子; 高田雅美; 城和貴, HPC における反復解法のみならず、近年ではビッグデータ解析のニーズの高まりにより、大量データへのランダムアクセスの低電力化・高スループット化のニーズが高まっている。キャッシュベースの CPU や GPU において、キャッシュから溢れる配列に対して Scatter/Gather を行なうと、ライン内の空間的局所性の欠乏により消費電力とスループットの両面で深刻な問題が発生する。特に電力やメモリスループットが不足する将来の大規模計算基盤においては、この問題が年々深刻さを増す。本報告では、上記の問題の解決策として、Scatter/Gather 機能を Hybrid Memory Cube 内で行なうことを提案する。提案方式の電力やスループットに関するメリットについて、モデルを構築しつつ、Graph500 ベンチマーク課題行列に対する疎行列ベクトル積を実例に考察する。, 19 Mar. 2013, 2013, 4, 1, 7
  • 年会論文集, 日本教育情報学会, 10J05 教材開発(奥行き学習教材(特許第5226821号))の報告と今後の課題(タブレット端末と教材開発,一般研究), 吉井 直子; Peterson Ward; 高田 雅美; 吉住 秀; 城 和貴, 算数・数学で学習する幾何分野,特に空間図形(3次元物体)の理解を高めるための教材開発・教材研究を行っている.初めに奥行き知覚の実験を行い,得られた実験データからオクリュージョン(重なり)効果を検証した.そこでオクリュージョンを用いた「奥行き学習教材」を開発し,2013年3月に特許権を取得した.本稿では特許発明の過程を報告し,教材の活用方法を紹介する.また知的財産権について述べる., 2013, 29, 406, 407
  • 研究報告計算機アーキテクチャ(ARC), Sparse matrices suitability for cache memory based on temporal locality, 冨森 苑子; 田邊 昇; 高田 雅美; 城 和貴, エクサスケールマシンは複雑なメモリシステムとなることが予想されている.同マシンへの適用を視野に入れた疎行列ライブラリの実現に向け,本報告では疎行列のキャッシュへの適合性分類において,疎行列の形状から得られる列インデックス列の空間的局所性と時間的局所性に関する指標を併用することを提案する.さらに,提案指標をフロリダ大学の疎行列コレクションを用いて評価した.その結果,空間的局所性だけで説明できなかった諸現象が説明可能になった. L1 キャッシュヒット率と時間的局所性の指標値との間に相関を確認できた.さらに,両指標を用いたメモリアクセス機構選択基準を与える方程式を導出した.In Japan, memory system of ExaFLOPS machines is expected more complex. In this paper, we propose a new characteristic of sparse matrices about spatial locality and temporal locality of row-index sequences in order to classify suitability for cache memory systems. Moreover, we evaluate proposal characteristic using University of Florida Sparse Matrix Collection. As a result, it became possible to explain phenomenons which could not be explained only by spatial locality. It is confirmed that there are the correlations between temporal locality and the general purpose cache (L1) hit rate. Moreover, we developed the equation for access method selection based on proposed characteristics., 06 Dec. 2012, 2012, 28, 1, 8
  • 研究報告数理モデル化と問題解決(MPS), Extraction of Alpha Wave Constituent Waves and Its Phase Analysis, 石川 由羽; 高田 雅美; 城 和貴, α 波は 1929 年に Hans Berger によって発見された脳波であり,現在,多くの研究者によって研究されている.近年では,主に α 波の振幅や位相に注目が集まっており,様々な研究結果が報告されている.しかし,今現在, α 波がどのように構成されているかを示す具体的なモデル化は行われていない.本論文では α 波のモデル化を目指して, α 波の位相分析を行う.前処理として,脳波から α 波データを抽出し,そのデータを α 波構成波に分割する. α 波構成波の特徴から,振幅と波形幅は時間遅延の相関があることが認められる.Alpha waves are electroencephalogram discovered by Hans Berger in 1929 and have been studied by many researchers. Recently the amplitude and the phase of alpha waves attract attention, and various studies are reported. So far the alpha waves are not concretely modeled to explain how they are constituted. In this paper, we analyze the phase of alpha waves for their future modeling. As pre-processing, we extract alpha wave data from EEGs and divide the data into alpha wave constituent waves. Analyzing the feature quantity of the alpha wave constituent waves, it turns out that the amplitude and the wavelength of alpha wave constituent waves are correlated possibly with some time delay., 29 Nov. 2012, 2012, 34, 1, 6
  • 研究報告バイオ情報学(BIO), Development of Inference Part for Book Ontology, 岩片悠里; 川嵜美波; 江口由記; 高田雅美; 城和貴, 本稿では,教科書を基に作られたオントロジーから情報を得るための推論部の開発を行う.推論エンジンは既存のものを用い,推論規則を新たに定義する.この推論部では,ユーザから与えられた問題文から,答えの導出を行う.これにより,ユーザの負担を軽減させることを可能にする.さらに,専門書の知識を基に推論の知識モデルとなる書籍オントロジーを作成することによって,効率的な情報の取得を目指す.In this paper, we develop inference part for an ontology that is based on the textbook. We use an existing inference engine and define new inference rules. By using this inference part, the answer can be derived from a problem statement. Thus, it is possible to reduce the burden on users. The book ontology is construted based on the textbook as knowledge model of the inference. Therefore, it is possible to retrieve information efficiently., 29 Nov. 2012, 2012, 32, 1, 6
  • 研究報告バイオ情報学(BIO), Ruby Removal Filters using Genetic Programming for Early-Modern Japanese Printed Books, 粟津妙華; 高田雅美; 城和貴, 国立国会図書館では,所蔵する明治から昭和前期の近代書籍を近代デジタルライブラリとして WEB 上でページごとの画像データとして公開しているが,文書内容での検索を行うことができない.そのため,自動でのテキストデータ化が望まれている.その際,問題となっているのがルビである.現在のルビを直線的に除去する技術は,規格に沿った現在の書籍を対象としたものであるため,現在の書籍とは違う特性を持つ近代書籍には適用できない.そこで,本研究では,遺伝的プログラミングを用いて,曲線的に出版者・時代ごとの専用ルビ除去式の生成を行う.In National Diet Library, books which are possessed in library as "the digital library from meiji era" are open to the public on WEB. Since these are shown as image data and cannot search using document contents, an automatic text conversion is needed. However, ruby is a disturbing text conversion. Since existing techniques of linearly removing ruby had developed for books of the current standard, the techniques are inapplicable to early-modern Japanese books, which have a specific characteristic different from characters of current books. In this paper, we propose a method to remove ruby from early-modern Japanese books using Genetic Programming., 29 Nov. 2012, 2012, 17, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Development of Inference Part for Book Ontology, 岩片悠里; 川嵜美波; 江口由記; 高田雅美; 城和貴, 本稿では,教科書を基に作られたオントロジーから情報を得るための推論部の開発を行う.推論エンジンは既存のものを用い,推論規則を新たに定義する.この推論部では,ユーザから与えられた問題文から,答えの導出を行う.これにより,ユーザの負担を軽減させることを可能にする.さらに,専門書の知識を基に推論の知識モデルとなる書籍オントロジーを作成することによって,効率的な情報の取得を目指す.In this paper, we develop inference part for an ontology that is based on the textbook. We use an existing inference engine and define new inference rules. By using this inference part, the answer can be derived from a problem statement. Thus, it is possible to reduce the burden on users. The book ontology is construted based on the textbook as knowledge model of the inference. Therefore, it is possible to retrieve information efficiently., 29 Nov. 2012, 2012, 32, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Spatiotemporal stress indicator using LF/HF, 内村麻里奈; 江口由記; 川嵜美波; 吉井直子; 梅田智広; 高田雅美; 城和貴, 人間にとって快適な環境とはその環境下でどれくらいの割合で人がストレスを感じないかという指標で与えられるべきである.この環境とは時空間に渡るものであり,同じ場所でも時間帯や季節によってその指標は変動すべきものである.そこで,本論文では,ある時空間にいる多数の人間のストレスレベルを集約分析することで時空間ストレス指標を得ることを提案する.また,既に報告した個人のストレスレベルを時空間でリアルタイム表示させるツールの機能を拡張することで,多数の人間のストレスレベルを表示させるツールを試作する.このツールを利用することで,直観的に時空間ストレス指標を確認し,ストレスが高い場所を回避することもできる.よって,時空間ストレス指標を用いることで,ストレスを避けることが可能となり,より快適な生活を送ることができる.Comfortable environment for humans should be evaluated by indicator which is how many people do not have stress there. This environment represents spatiotemporal space. The indicator should change depending on time and season not even the same place. In this paper, we suggest a spatiotemporal stress indicator which is calculated for aggregating and analyzing many people's stress levels in spatiotemporal space. In addition we expand the tool, which displays individual stress levels in real time spatiotemporal space, to display other people's spatiotemporal stress levels. Using this tool, it is possible to avoid going to the place which hava a high stress level by confirming spatiotemporal stress levels intuitively. Thus, it helps to spend our healthy life by using a spatiotemporal stress indicator., 29 Nov. 2012, 2012, 2, 1, 6
  • 研究報告バイオ情報学(BIO), Extraction of Alpha Wave Constituent Waves and Its Phase Analysis, 石川 由羽; 高田 雅美; 城 和貴, α 波は 1929 年に Hans Berger によって発見された脳波であり,現在,多くの研究者によって研究されている.近年では,主に α 波の振幅や位相に注目が集まっており,様々な研究結果が報告されている.しかし,今現在, α 波がどのように構成されているかを示す具体的なモデル化は行われていない.本論文では α 波のモデル化を目指して, α 波の位相分析を行う.前処理として,脳波から α 波データを抽出し,そのデータを α 波構成波に分割する. α 波構成波の特徴から,振幅と波形幅は時間遅延の相関があることが認められる.Alpha waves are electroencephalogram discovered by Hans Berger in 1929 and have been studied by many researchers. Recently the amplitude and the phase of alpha waves attract attention, and various studies are reported. So far the alpha waves are not concretely modeled to explain how they are constituted. In this paper, we analyze the phase of alpha waves for their future modeling. As pre-processing, we extract alpha wave data from EEGs and divide the data into alpha wave constituent waves. Analyzing the feature quantity of the alpha wave constituent waves, it turns out that the amplitude and the wavelength of alpha wave constituent waves are correlated possibly with some time delay., 29 Nov. 2012, 2012, 34, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Ruby Removal Filters using Genetic Programming for Early-Modern Japanese Printed Books, 粟津妙華; 高田雅美; 城和貴, 国立国会図書館では,所蔵する明治から昭和前期の近代書籍を近代デジタルライブラリとして WEB 上でページごとの画像データとして公開しているが,文書内容での検索を行うことができない.そのため,自動でのテキストデータ化が望まれている.その際,問題となっているのがルビである.現在のルビを直線的に除去する技術は,規格に沿った現在の書籍を対象としたものであるため,現在の書籍とは違う特性を持つ近代書籍には適用できない.そこで,本研究では,遺伝的プログラミングを用いて,曲線的に出版者・時代ごとの専用ルビ除去式の生成を行う.In National Diet Library, books which are possessed in library as "the digital library from meiji era" are open to the public on WEB. Since these are shown as image data and cannot search using document contents, an automatic text conversion is needed. However, ruby is a disturbing text conversion. Since existing techniques of linearly removing ruby had developed for books of the current standard, the techniques are inapplicable to early-modern Japanese books, which have a specific characteristic different from characters of current books. In this paper, we propose a method to remove ruby from early-modern Japanese books using Genetic Programming., 29 Nov. 2012, 2012, 17, 1, 6
  • IEICE technical report. Computer systems, The Institute of Electronics, Information and Communication Engineers, Cache Memory Suitability for the Graph Analysis Workloads, TANABE Noboru; TOMIMORI Sonoko; TAKATA Masami; JOE Kazuki, Graph500 is a benchmark suite for big data analysis which receives attention in these years. The spatial locality of sparse matrices used for Graph500 and the university of Florida sparse matrix collection is investigated. We show the spatial locality of sparse matrices used for Graph500 is very low and there is about 1 or a little more valid data on a cache line for the memory accesses issued by sparse matrix-vector multiplications (SpMV) in average. It is very difficult to solve the problem by just software approach because of the huge size of sparse matrices and the randomness of their accesses to degrade the optimization against their cache awareness. Therefore, hardwired gather functions at cache memory side is promising for taking advantage in the Graph500 lists, which improve the processing speed in an order of magnitude., 05 Oct. 2012, 112, 237, 67, 72
  • 年会論文集, 日本教育情報学会, 2PC1 教材開発と知的財産権(教材開発,一般研究,教育情報と人材育成~未来を育む子供たちのために~), 吉井 直子; 篠澤 和恵; 高田 雅美; 城 和貴, 算数・数学で学習する図形(幾何分野)の理解を高めるための教材開発を行い,2013年3月に特許権を取得した.そして,開発した教材を用いて3歳児から5歳児を対象に「算数セミナー」を開催している.本稿では,教育実践と指導用テキスト開発の報告を行うとともに,知的財産権の重要性について述べる., 2015, 31, 264, 265
  • 研究報告数理モデル化と問題解決(MPS), Construction of the range image by using a standing wave radar, 張 菁; 梅田 智広; 高田 雅美; 城 和貴, 本研究では,定在波レーダで得られた情報から 3D サーフェイスモデルを構築する.定在波レーダは,非接触で対象物までの距離を測定することができる.定在波レーダを用いて取得した距離情報を処理対象として最適組み合わせアルゴリズムを適用し,その 3 次元距離情報を 2 次元座標に変換し,ドロネー三角分割法を用いて 3 D サーフィスモデルの構築を目指す.In this research, we construct a 3D surface model, which is translated in information of standing wave radar. The standing wave radar can measure distance to an object without contact. In the information of the standing wave radar, an optimal combination algorithm is adopted. Then, once the three-dimensional information is transformed into the two-dimensional coordinates, a 3D surface model is constructed by using the Delaunay triangulation., 24 Feb. 2014, 2014, 19, 1, 6
  • ハイパフォーマンスコンピューティングと計算科学シンポジウム論文集, 次世代HPC・Enterprise統合基盤のためのアプリ上の共通の特徴, 田邊昇; 冨森苑子; 高田雅美; 城和貴, 31 Dec. 2013, 2014, 43, 43
  • 先進的計算基盤システムシンポジウム論文集, Xeon(R) PhiTMのGather命令とHMC内のGatherの差異, 冨森苑子; 田邊昇; 高田雅美; 城和貴, 15 May 2013, 2013, 126, 127
  • ハイパフォーマンスコンピューティングと計算科学シンポジウム論文集, Graph500競争を独走するための未開拓領域の予備評価, 田邊昇; 冨森苑子; 高田雅美; 城和貴, 08 Jan. 2013, 2013, 85, 85
  • 研究報告バイオ情報学(BIO), Design of a Portal Site for Textizing Early-Modern Printed Books, 黒田 佳世; 榎本 友里枝; 高田 雅美; 城 和貴, 本稿では,本の見開き画像をテキスト化する際に生じる誤認識を修正する機能をもつポータルサイトを設計する.対象とする画像は,国会図書館が所有する近代書籍のデジタル画像とする.このデジタル画像に対して,近代書籍専用の活字文字認識を適用することによりテキスト化は可能であるが,誤認識が生じる.これを修正するために,デジタル画像とテキスト文書を用いる.提案するポータルサイトでは,テキスト文書と画像データを対応させるメタデータを作成することによって,テキストに対応する画像を表示させることを可能にする.In this paper,we present a design of a portal site which has functions for correcting erratums.These erratums are caused when the facing images,which are owned by Digital Library from Meiji Era in National Diet Library,are transformed into text documents.Although those images can be transformed by using an OCR,which is specialized in early-modern printed books,the OCR infrequently cause erratums.So,to correct them, we take by means of those images and text documents. In this case,we make the metadata by which text can be corresponded to image ., 09 Dec. 2010, 2010, 35, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, Evaluation of Loop Transformation methods with CUDA, KOGOU JUNKO; TAKATA MASAMI; JOE KAZUKI, 本縞では,既存のプログラムを高速化するために,GPGPU (General Purpose Computing on Graphic Processing Unit) のためのループ再構築手法を適用し,評価する.GPGPU で用いる GPU (Graphic Processing Unit) として,tesla C1060 を採用する.tesla C1060 では GPGPU 用開発環境である CUDA が使用可能である.本縞において,ループ再構築手法例としてストリップマイニングとループ交換を取り上げる.これらのループ再構築手法に対してサンプル・プログラムを適用した際の性能評価を行う.その結果,ストリップマイニングでは分割数の変化によってループアンローリングが適用され,実行時間に影響がでることが分かった.一方ループ交換では,データへのアクセス順序を考慮することによって高速化が可能であることが判明した.これらの結果を踏まえ,実プログラムにおける性能を評価するために,k-means 法にストリップマイニングを,メディアンフィルタにループ交換を適用する.In this paper, we improve and evaluate loop transformation methods in GPGPU (General Purpose Computing on Graphic Processing Unit) for speedup of existing programs. To adopt GPGPU, we use tesla C1060, which is known as a GPU (Graphic Processing Unit). In tesla C1060, CUDA, which is one of development environments for GPGPU, can be used. In this paper, we target strip mining and loop interchange, which are loop transformation methods. To evaluate these loop transformation methods, we validate the performance of these loop transformation methods using simple sample programs. As the result in strip mining, execution time is effected by loop unrolling, which is changed at division number. On the other hand, in loop interchange, through access order to data is attentioned, speed-up can be done. To evaluate the performance in existing programs, we adopt strip mining to k-means and loop interchange to median filter in the light of the results., 21 Sep. 2010, 2010, 6, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 情報処理学会, Performance Estimation of a Huge Sparse Matrix-Vector Multiplication on a Hetero Environment Constructed by PCI express with GPU and Functional Memory, OGAWA Yuka; TANABE Noboru; TAKATA Masami; JOE Kazuki, 本報告では,疎行列ベクトル積のベクトルがデバイスメモリに入りきらないほど大きな問題向けに,GPU が PCI express 越しに Gather 機能を有する大容量機能メモリをアクセスするシステムを用いた並列処理方式を提案する.フロリダ大の疎行列コレクションを用いて提案方式の性能評価を行った.その結果,間接アクセスの直接アクセス化により,単体性能は既存研究の最大 4.1 倍に向上した.GPU 内キャッシュが溢れる心配も無い.GPU 間通信を完全に排除可能にした構成によりスケーラビリティは保証されており,PCI express のバースト転送バンド幅で制約される単体性能にノード数を乗じたものが並列実効性能となる.In this report, we propose a parallel processing strategy for huge scale sparse matrix-vector product whose vector cannot be held on a device memory. The strategy uses a system connected by PCI express with GPUs and functional memories with gather function. We evaluate the performance of proposed strategy with University of Florida Sparse Matrix Collection. The result shows the 4.1 times acceleration over the existing performance record with a GPU in the maximum case. There is no risk of performance degradation by overflowing cache capacity on GPU. Because of the architecture without inter-GPU communications, scalability is guaranteed. Therefore, parallel effective performance is the product of number of nodes and single GPU performance limited by burst transfer bandwidth of PCI express., 27 Jul. 2010, 2010, 20, 1, 9
  • 研究報告数理モデル化と問題解決(MPS), Evaluation of Loop Transformation methods with CUDA, HATA NORIKO; TAKATA MASAMI; JOE KAZUKI, 本稿では,GPU のための最適化を施すことによる GROMACS の性能改良について述べる.その最適化には CUDA を用いる.GPU を用いた GROMACS の実行については,GROMACS-OpenMM が既に開発されている.しかしながら,ベンチマークの結果,GROMACS-OpenMM による実行した際,CPU のみで GROMACS を実行した時と比べ,ほとんど実行時間が変わらないシミュレーションや,むしろ遅くなるシミュレーションも存在する.そこで,GROMACS-OpenMM の改良を行う.GROMACS は大規模なプログラムである.そこで,本稿では,関数やメモリアクセスの最適化に焦点を当てる.In this paper, we present some performance improvement of GROMACS for GPUs, which is a well-known application for analysis of molecule, with several optimizations. The optimizations are applied for CUDA. An exsisting GROMACS for GPU, GROMACS-OpenMM has already been developed. However, by our benchmarking results, the execution time of some sample programs of GROMACS-OpenMM are nearly equal or longer than that in GROMACS on a CPU. Therefore, GROMACS with GPU should be improved. Since GROMACS consists of huge number of modules, in this paper, we focus on function calls and memory access., 05 Jul. 2010, 2010, 10, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, Development of Real-time stereo Queryball, 勅使河原 佑美; 石川 千里; 高田 雅美; 城 和貴, 3 次元空間内のオブジェクトを理解するための機能の 1 つとして Queryball がある.Queryball はオブジェクトに半透明の球体を重ね合わせることにより,オブジェクトと球体が重なる部分に対して問合せることができ,オブジェクトの表示方法を変えたり,様々な方向からオブジェクトを視認したりできる.しかし,現段階の Queryball のボリュームレンダリングでの表示速度はオブジェクトデータのサイズが大きくなるほど遅くなり,実用には向かない.そこで,Queryball をリアルタイムで実行するために,ボリュームレンダリング部分に GPGPU を用いることによって,高速化を図る.また,オブジェクトをよりリアルに理解するために 3 次元立体視を行う.Queryball is a tool to understand objects in three-dimensional space. By overlapping a translucentglobe with 3D object, it can quiry to the part where the object and the globe come in succession. It can change the display method with visually checking according to various directions. However, the display speed the volume rendering of Queryball to the present stage slows the large size of the object data, and is not for practical use. Therefore, performance improvement by applying GPGPU to the volume rendering part in real time is necessary. In addition, the system offers three-dimensional stereoscopic vision for user to understand the object more realistically., 25 Feb. 2010, 2010, 31, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, Virtual View Generation in Hallway of Cybercity Buildings from Video Sequences, 吉田 幸代; 高田 雅美; 城 和貴, リアルな建物のモデルの作成はサイバーシティアプリケーションの実装において,最も重要なタスクの 1 つである.本稿では見え方を重視し,且つユーザの位置を任意に変更できる臨場感ある屋内空間モデル作りについて考える.具体的には、ユーザの位置によって表示するテクスチャを動的に変更する手法を提案する.既存の見え方を重視した手法では、全方位カメラで撮影した写真をモザイキングし.1 枚の大きなパノラマ画像を用意し,半球にマッピングすることでサイバースペースを作成している.この既存の手法は.大抵街等の建物の外観を対象としており,広い空間作りに適している.廊下といった.屋内の狭い空間作りには不向きである.そこで本稿ではホモグラフィや SIFT を使用し,臨場感を維持しつつ,特に廊下といった狭い空間作りの手法を考えた.ユーザが空間内で移動したとき,ユーザの位置に合致したテクスチャに切り替える.臨場感を維持し,自由に空間内を移動できるようにもする.Appearance of Three-dimensional (3D) building model is one of the most important components in a cyber city implementation and application. In this paper, we propose an approach for generating more freely and higher quality appearance of cyber city by using digital Video sequences than existing ones. This technique is updated depending on positions of the virtual view, and maps texture. In existing techniques, a large panoramic image is given by mosaicing all-directional camera.since the object of the techniques is large space such as city scenes, the techniques are unsuitable for small space such as indoor corridor. Therefore, the proposed a system aims to cyber city, which create automatically, for small space using homography, Scale Invariant Feature Transform (SIFT) and Video sequences. When users change their location in VR space, the system change textures newly. The system keeps realistic sensation and free from location's limits., 25 Feb. 2010, 2010, 26, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, A Consistent Using Method for Two Different Web Archiving Collections, 梅山 章子; 高田 雅美; 城 和貴, 本稿では,国立国会図書館が運営しているウェブアーカイブの WARP が抱える問題に対処するため,差分収集による新なサーバも同時に使う手法について報告する.差分収集とは,ウェブサイトの更新が行われる毎にリアルタイムで収集,保存を行い,WARP を補うサーバとなる.このサーバは,ウェブアーカイブ用アプリケーションの Wayback を用いて構築する.また,1 つのウェブアーカイブサーバとして両サーバが相対的に機能するかを確認するため,プロトタイプを設計する.この際,簡易版 WARP の構築,簡易版 WARP と差分収集サーバのインタフェースを実装する.WARP is a Web archive system in National Diet Library based on fixed interval collection. Since WARP does not have the incremental collection method, it is desired that a new incremental Web archiving system collaborates with WARP. Such the incremental collection server can be constructed with Wayback applications. Thus,we design a prototype system using WARP and the Wayback based server. Each server needs to work alone while any query must be recognized by the both servers. We use a simple WARP based server and implement the interface between the simple WARP and the Wayback based server., 25 Feb. 2010, 2010, 32, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, Evaluation of Insolation Calculation with considering Reflection, 寺前 早苗; 石川 千里; 高田 雅美; 城 和貴, 本稿では,レイトレーシング法の光線追跡を利用した日照量算出の一手法を,実際の都市データに適用した実験結果について述べる.各建造物における総照射量や直接光・反射光別の照射回数を 1 時間ごとに 1 日分算出し,太陽方向や建造物の位置関係などによる違いを確認する.また,毎月 1 日における 1 日の総照射量を 1 年分調べることで,季節による日照量の違いについても確認する.なお,実験に使用したデータは,2 値化された地図画像から日照量算出手法に適したデータ形式に変換したものであり,その変換手順についても述べる.In this paper, we report the experimental result where we apply the routine to calculate the amount of sunlight using ray tracing to real buildings data. We calculate the amount of sunlight and irradiation frequency of direct or reflect light every hour, and confirm the defference by sun direction and buildings position. We also calculate them every month, and contrast the defference by season. In addition, we introduce a method that converts binarized map images into the data format for calculation of insolation., 25 Feb. 2010, 2010, 36, 1, 6
  • 研究報告バイオ情報学(BIO), 情報処理学会, Motion based Time Series Analysis for 3D Protein Structures, KAMADA MAYUMI; TODA MIKITO; TAKATA MASAMI; JOE KAZUKI, 本稿では,ウェーブレット変換と特異値分解により熱揺らぎをするタンパク質の時系列データから動きの特徴を抽出できると考え,得られる動きの特徴を用いて骨格原子の集団運動性に関する解析を行う.まず骨格原子の集団運動性と構造間での相関関係について確認し,機能において重要となる 2 次構造に着目し解析を行う.その結果,2 次構造における相関関係や動き方の違いを確認する.To extract motion feature from the temporal sequence data of proteins with heat fluctuations, we present a feature detection method using a wavelet transform and singular value decomposition in this paper. The extracted features are analysed for collective motion of framework atoms. We investigate collectivity of atom motion and correlation between structures, and analyze secondary structures that play a critical role in the function. As the result, we find correlation and difference motion between secondary structures., 25 Feb. 2010, 2010, 5, 1, 8
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 情報処理学会, Design of a Volume Rendering Method for a Hetero Environment Constructed by PCI express with Functional Memory and COTS, YOSHINO Yuko; TANABE Noboru; OGAWA Yuka; TAKATA Masami; JOE Kazuki, 本報告では,筆者らが提案している可視化システムにおける 「アクセラレータが PCI express 越しに機能メモリをアクセスする」 という概念を推進するために,ボリュームレンダリングに注目した提案システム向けアルゴリズムを検討し,PCI express の特性を評価する.さらに,その環境に適したボリュームレンダリングを C-ray をベースに設計する. C-ray は Cell/B.E. 用に最適化されたボリュームレンダリングの実装例であり,我々の開発しているシステムは PPE が入っていないので,C-ray をそのまま用いることはできない.そのための移植手法の検討が本稿の目的である.In this report, aiming at our concept of "Accelerators access function memory via PCI express ", we investigate a volume rendering algorithm for our system to evaluate the characteristics of PCI-express. In addition, we design a volume rendering algorithm based on the C-ray for the hetero environment. The C-ray is the optimized implementation of volume rendering for the Cell/B.E. Broadband Engine. Since our system does not have PPEs, we can not apply the C-ray to our system. The purpose of this report is to investigate the re-design of the C-ray for our system., 23 Nov. 2009, 2009, 1, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, Development of an Interactive Real-time Remote Visualization System, KOHORI Yuki; KURUMI Mari; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, 今日,医療現場や気象研究などにおいて三次元可視化手法を利用した解析が活用されている.これら三次元可視化では計算量ならびにデータ量が莫大である一方,その中から解析すべき部分を見つけ出すためには対話的操作が重要となってくる.そこで我々は,遠隔にいる複数の使用者がリアルタイムで解析が可能となる対話的実時間遠隔可視化システムの開発に着手している.本稿では,このシステムで利用されるサーバからの画像配信のための手法について提案する.この手法により,サーバから実時間での画像配信が可能となり,サーバとクライアント間のストレスのない対話的操作の実現が期待できる.Nowadays, 3D visualization based analysis is well-known for various fields such as medical front and weather research. Although they are computation and memory intensive, the users require interactive operations such that they detect a part of space inside of the given 3 dimensional data. To deal with the contradictive processes, we start the development of an interactive real-time remote visualization system, which allows users to perform real-time analysis from remote sites. In this paper, we present a live streaming method for real-time remote visualization. Using the method, we get interactive operations between remote users and real-time visualization servers., 03 Sep. 2009, 2009, 19, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 情報処理学会, Architecture based on Accesses to Functional Memory Through PCI express for Applications with Random Accesses, 田邊 昇; 芳野 裕子; 小川 裕佳; 佐々木 愛美; 高田 雅美; 城 和貴, 本報告では,筆者らが提案した可視化装置における 「アクセラレータが PCI express 越しに機能メモリをアクセスする」 という概念を,ポストベクトル機向けに整理する.ボリュームレンダリングを例として提案装置向けアルゴリズムを検討した.さらに,本用途への GPU 利用の可能性や PCI express の特性を評価した.乱数やボリュームレンダリングの履歴 index を用いた配列間接参照実験では、ミッドレンジ GPU は理論ピークの 1.3% の実効バンド幅でデバイスメモリをアクセスした.このバンド幅は PCI express と機能メモリにより置き換え可能と考えられる.よって,本概念はランダムアクセス型応用を加速するアクセラレータ向けのメモリ容量向上策や、ECC 付加による信頼性強化策として有望である。In this report, we organize the concept on our visualization machine as for the post-vector supercomputer. The proposed concept is the architecture with accelerators accessing functional memory through PCI express. We investigate the volume rendering algorithm for the machine based on the concept. Moreover, we evaluate the feasibility of using GPU and the performance of PCI express for this use. In the experiment of indirect array accesses using random index and index trace on volume rendering, a mid-range GPU accessed device memory with 1.3% bandwidth compared to the theoretical peak. This bandwidth seemed to be able to be replaced with PCI express and functional memory. Therefore, this concept is promising for accelerator running applications with random accesses both to overcome limitation of device memory capacity, and to improve robustness of memory using ECC., 28 Jul. 2009, 2009, 25, 1, 8
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), The construction of paint deterioration model for lawns, ENOMOTO Yurie; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, By this study, we build a model to predict color maintenance for lawns and relations of the green paint. On the model construction, We use the analysis results of the deterioration change of lawns which get really scatter examination paint. We understand the durability of the color of lawns and relations of the density of paint by simulating with this model. We can scatter the green paint which does not affect the quality of the turf in an appropriate time. And it is always expected with good leaf color and can maintain lawns., 10 Dec. 2008, 2008, 126, 17, 20
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Approach of Insolation Calculation that considered Reflection, TARUI Sachi; YOSHINO Yuko; TERAMAE Sanae; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In this paper, we introduce the calculation routine to calculate amount of sunlight using ray tracing. In this approach, we calculate amount of sunlight to considered influence of cover and reflection. Photovoltaic generation has the problem that the electrical energy obtained by the setting position of photovoltaic facility differ greatly. Then, we expect to pinpoint a place which can obtain more electrical energy by applying this approach. And, because it is the calculation to large-scale data, we introduce the definition of the data structure and calculation approach to reduce data and memories., 10 Dec. 2008, 2008, 126, 45, 48
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Developping Environment for Contents Useing Satellite Data for a Multipurpose, TANAKA Rina; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In this report, we generate a stereoscopic vision image in real time that we can handle for various queries by compiling satellite data into a database, and adding meta data to suggest a function of the web content to display. We use Ajax to make interactive movement on the Web. In addition, the stereoscopic vision generatesd by a anagliph image. The satellite data were used so far only in limited technical fields such as the business and study use, but general users can use these contents easily., 10 Dec. 2008, 2008, 126, 5, 8
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Design of Web Album using Flash, SHIGEMI Sanami; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In this paper, we report the design of a Web album using Flash. For the automatic generation of the Web album, tools are developed showing related images and documents. The related images are used instead of photograph. A web album for a person should not be generated just from his/her related images. Therefore, by having related documents such as the fashion or the music of the days of birth, we can make the web album., 10 Dec. 2008, 2008, 126, 1, 4
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of the Update Space Estimate Technique to Use for Collection for a Difference in the Web Archive and the Evaluation, HIROMICHI Naomi; ISHIKAWA Chisato; TAKATA Masami; JOE Kazuki, In this report, We develop a technique to estimate the update period of a Web page. We build a database collecting a Web page to validate this technique. This is used corresponding to the update, the change and the deletion of the Web page in a Web archive. On development, We assume the distribution type of the interval when a Web page is updated beforehand. Therefore We can apply a boot strap method., 10 Dec. 2008, 2008, 126, 41, 44
  • 情報処理学会論文誌数理モデル化と応用(TOM), 情報処理学会, 「情報処理学会論文誌:数理モデル化と応用」の編集にあたって, 城和貴; 北栄輔(ゲスト・エディタ); 北 栄輔; KITA Eisuke, 15 Dec. 2007, 48, 19, i, i
  • 年会論文集, 日本教育情報学会, エッジ画像における奥行き知覚を利用した教育への一提案 (教育資料・実践(2)), 吉井 直子; 高田 雅美; 城 和貴, 初等中等教育現場では,黒板を使用する機会が多い.黒板にかいたは3次元物体は,エッジ画像に近くなる.そこで,本稿ではエッジ画像を用いて奥行き知覚の能力を調べる.実験結果から回帰分析によって発達モデル式を構築する.さらに,モデル式の精度評価を行い,エッジ画像の奥行き知覚について,男子と女子の間には発達の違いがあることを理論値で示す.最後に,それを補完するために教育場面で活用できる教材を提案する., Aug. 2010, 26, 170, 173
  • 年会論文集, 日本教育情報学会, 視覚特性(オクリュージョン効果)を利用した教育への試み, 吉井 直子; 石川 千里; 高田 雅美; 城 和貴, 初等中等教育現場では印刷物をよく使用する.ところが,子どもの2次元画像の認識に関する既存研究は少なく,男女別画像別に分析したものは,我々が知る限り存在しない.そこで,奥行き知覚の発達過程について実験を行い考察した.実験結果から,2次元画像の奥行き知覚について男子と女子の間には発達の違いがあること,黒板にかかれた空間図形などのエッジ画像では正解率が低くなることが検証できた.そこで,この問題を補完する一例としてオクリュージョン(重なり)効果を採り上げる., Aug. 2009, 25, 156, 159
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Multi-Fonts Character Recognition for Early-Modern Printed Books, ASHIDA Naomi; TAKATA Masami; KIMESAWA Tsukasa; JOE Kazuki, National Diet Library has a public web site as Early-Modern Digital Library for books in Meiji and Taisho periods. Since the archive is digitalized as images, text search for the books is not applicable and, therefore, required. Conventional OCR systems are not a good tool for such modern books because they have various font sets and most of them are very noizy. In this paper, we propose a character recognition method for early-modern printed books., 26 Feb. 2009, 2009, 19, 205, 208
  • IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Development of telluric current analysis portal for short-term earthquake prediction, TOYOSHIMA Yoshimi; ISHIKAWA Chisato; TAKATA Masami; NAGAO Toshiyasu; JOE Kazuki, In this paper, we present the development of an analysis system for telluric current data. By using the proposed system, analytical results are collected to support researchers. Necessary functions are examined to construct the proposed system. We also verify that the system satisfies these necessary functions to meet the demands., 26 Feb. 2009, 2009, 19, 209, 212
  • 研究報告数理モデル化と問題解決(MPS), A training method of spatial reasoning capacity using AR, 秦野 真衣; 米澤 朋子; 吉井 直子; 高田 雅美; 城 和貴, 本稿では,子どもの空間認識能力を高めるための AR を用いた新たな学習方法を提案する.AR を用いる利点として,物体を実際に動かすことで子どもでも直感的に,動作と視覚の両方の感覚を使って扱うことができる点がある.また,空中に浮いている立体などの仮想立体でも提示することが可能である.本学習方法は,イメージの中で物体を回転させやすくなるような支援を行っている.学習者は AR 空間の中に表示された物体を別の角度から見る場合を想像し,想像された物体を新たに作成するものである.この学習方法による空間認識能力の学習効果を調べるために,小学生を対象とした実験と実験結果による分析を行っている.In this research, we propose a method to progress spatial reasoning capacity of children with Augmented Reality(AR). AR has two advantages. First, children can use AR tools viscerally with sence of action and vision, since this tool can be moved actually. Second, AR tools with AR can display virtual solids like floating solid. An AR tool, which is based on the proposed method, supports to make image which rotates objects more easily. Learner images rotated objects which was displayed in AR. Then, they make this imaged objects. To evaluate spatial reasoning capacity in the AR tool, we experiment and analyze in regard to elementary school children., 23 Feb. 2012, 2012, 33, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Practical technique in the Kanji character clipping of the Digital Library from the Meiji Era, 福尾 真実; 高田 雅美; 城 和貴, 本研究では,近代デジタルライブラリーが所蔵する画像データから上手く文字を切り出す実際的手法の開発を行う.国立国会図書館では近代デジタルライブラリーとして,所蔵する書籍を Web 上で一般公開している.これらは,画像データとして公開されており,文書内容を用いた検索が行えないため,早急なテキスト化が求められている.そのため,近代書籍に特化した多フォント漢字認識手法が提案されている.しかし,ルビが振られた書籍からは上手く文字が切り出せず,認識ができない.そこで本稿では書籍の本文からルビを取り除く手法を開発する.In this research, we develop a practical technique to clip the kanji character well from the image data that the digital library from meiji era houses. The national diet library in Japan is opened to the public as the digital library from meiji era on the Web. There are shown as image data. Since it is impossible to perform full text search, it should be converted to text data. Therefore, it has been proposed the multi-fonts kanji character recognition method for early-modern Japanese printed books. Kanji characters with rubi occur that the kanji character clipping and recognition are badly constructed. In this paper, we propose a technique to remove the rubi from body of the book., 23 Feb. 2012, 2012, 34, 1, 6
  • 研究報告バイオ情報学(BIO), Design Ontology of Stress to Recognize and Improve Presymptomatic Diseases, 洞渕 彩未; 高田 雅美; 森本 恵子; 城 和貴, 本研究では,オントロジー技術を用いて,ストレスに関する情報の関係性を示したストレスオントロジーを設計する.開発システムでは,センサデバイスで取得した生体情報とオントロジーを利用することで,各ユーザ専用の未病の認識と改善に効果的な情報を提供する.開発するオントロジーでは,Web 上に溢れている情報を収集し,機械が処理できる形式で管理する.本論文では,設計したオントロジーと生体データを用いた処理の評価と,矛盾を検出し最適化する手法についても考察する.In this paper, we show the design of the stress ontology which describes the information of stress affection. Using the developed system, we provide the information which is effective for the presymptomatic various diseases. Using the ontology, we collect the information from the web to re-construct the ontology. In this paper, we explain the design of our health care ontology and its practical use for the real. The structure optimization and the removal of contradiction of the proposed ontology is an important research topics., 24 Nov. 2011, 2011, 26, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Polygon reduction for effective 3D model rendering on different platforms, 水野 志織; 奥本 萌; 高田 雅美; 城 和貴, 本研究では,効果的に表示できる最小のポリゴン数の定義を行う.近年,文化財のデジタルデータによる保存が行われている.しかし,ポリゴンのデータ量は莫大で,高い処理能力を持った計算機が必要とされる.一般公開を行う場合,処理能力の低い計算機への適用がなされるべきである.そのため,ポリゴンリダクションを用いて莫大なデータ量を少なくする必要がある.この際,適切なポリゴン数に削減すべきである.この数を定義するために,評価実験を行う.この実験結果として,3次元モデルを表示するピクセル数の50倍が最適であることが分かる.In our research, we define the minimum number of polygons for effective rendering. Recently cultural property is preserved in digital data. Since polyangular data is large, a high performance computer is needed. If it is shown to the public, a low performance should be targeted. Therefore, polygons are reduced to a valid number. We try to define the minimum number. As a result, we find that the number of polygon should be 50 times as many as the number of pixels for rendering 3D models., 24 Nov. 2011, 2011, 16, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Design Ontology of Stress to Recognize and Improve Presymptomatic Diseases, 洞渕 彩未; 高田 雅美; 森本 恵子; 城 和貴, 本研究では,オントロジー技術を用いて,ストレスに関する情報の関係性を示したストレスオントロジーを設計する.開発システムでは,センサデバイスで取得した生体情報とオントロジーを利用することで,各ユーザ専用の未病の認識と改善に効果的な情報を提供する.開発するオントロジーでは,Web 上に溢れている情報を収集し,機械が処理できる形式で管理する.本論文では,設計したオントロジーと生体データを用いた処理の評価と,矛盾を検出し最適化する手法についても考察する.In this paper, we show the design of the stress ontology which describes the information of stress affection. Using the developed system, we provide the information which is effective for the presymptomatic various diseases. Using the ontology, we collect the information from the web to re-construct the ontology. In this paper, we explain the design of our health care ontology and its practical use for the real. The structure optimization and the removal of contradiction of the proposed ontology is an important research topics., 24 Nov. 2011, 2011, 26, 1, 6
  • 研究報告バイオ情報学(BIO), Additional Test of Food Image Recognition by MKL, 内村 麻里奈; 高田 雅美; 城 和貴, 本研究では食事画像認識をする.食事のカロリーなどの情報を必要としているユーザがいる.しかしながら,食事の種類はとても多いため,一般ユーザにとって,正しい食事の情報をえることは困難である.この問題を解決するために,食事画像を使って専門家がアドバイスするシステムがある.ただし,このシステムでは,処理能力に限界がある.そこで,食事画像に対して,画像認識技術を適用することによって,認識の自動化を行う.分類機の1つとして,SVM(Support Vector Machine) がある.この SVM は,入力された画像の特徴を用いて,正しく分類することができる.食事の種類は多いため,複数の特徴で表す必要がある.そのため,これらの特徴を SVM で利用するために,統合しなければならない.このための手法として,MKL(Multiple Kernel Learning) を用いる.この MKL を用いた SVM の性能を調べるために,85 種類の食事画像を用いて,実験を行う.In this paper, we recognize food image. Users need information about food calorie so on. However, it is too difficult to have correct information about food because of variety foods. To solve this problem, the system which specialists advise with food image has been developed. However, this system has a limitation in capacity. Therefore, food images should be recognized automatically by using image-recognition technique. SVM (Support Vector Machine) is one of supervised learning. The SVM can classify correctly with given image features. A number of features are needed to treat so many food. These features have to be combined by using SVM. Consequently, MKL (Multiple Kernel Learning) should be adopted. We experiment with 85 categories of food images to find out quality of SVM using MKL., 24 Nov. 2011, 2011, 17, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), Additional Test of Food Image Recognition by MKL, 内村 麻里奈; 高田 雅美; 城 和貴, 本研究では食事画像認識をする.食事のカロリーなどの情報を必要としているユーザがいる.しかしながら,食事の種類はとても多いため,一般ユーザにとって,正しい食事の情報をえることは困難である.この問題を解決するために,食事画像を使って専門家がアドバイスするシステムがある.ただし,このシステムでは,処理能力に限界がある.そこで,食事画像に対して,画像認識技術を適用することによって,認識の自動化を行う.分類機の1つとして,SVM(Support Vector Machine) がある.この SVM は,入力された画像の特徴を用いて,正しく分類することができる.食事の種類は多いため,複数の特徴で表す必要がある.そのため,これらの特徴を SVM で利用するために,統合しなければならない.このための手法として,MKL(Multiple Kernel Learning) を用いる.この MKL を用いた SVM の性能を調べるために,85 種類の食事画像を用いて,実験を行う.In this paper, we recognize food image. Users need information about food calorie so on. However, it is too difficult to have correct information about food because of variety foods. To solve this problem, the system which specialists advise with food image has been developed. However, this system has a limitation in capacity. Therefore, food images should be recognized automatically by using image-recognition technique. SVM (Support Vector Machine) is one of supervised learning. The SVM can classify correctly with given image features. A number of features are needed to treat so many food. These features have to be combined by using SVM. Consequently, MKL (Multiple Kernel Learning) should be adopted. We experiment with 85 categories of food images to find out quality of SVM using MKL., 24 Nov. 2011, 2011, 17, 1, 6
  • 研究報告バイオ情報学(BIO), Polygon reduction for effective 3D model rendering on different platforms, 水野 志織; 奥本 萌; 高田 雅美; 城 和貴, 本研究では,効果的に表示できる最小のポリゴン数の定義を行う.近年,文化財のデジタルデータによる保存が行われている.しかし,ポリゴンのデータ量は莫大で,高い処理能力を持った計算機が必要とされる.一般公開を行う場合,処理能力の低い計算機への適用がなされるべきである.そのため,ポリゴンリダクションを用いて莫大なデータ量を少なくする必要がある.この際,適切なポリゴン数に削減すべきである.この数を定義するために,評価実験を行う.この実験結果として,3次元モデルを表示するピクセル数の50倍が最適であることが分かる.In our research, we define the minimum number of polygons for effective rendering. Recently cultural property is preserved in digital data. Since polyangular data is large, a high performance computer is needed. If it is shown to the public, a low performance should be targeted. Therefore, polygons are reduced to a valid number. We try to define the minimum number. As a result, we find that the number of polygon should be 50 times as many as the number of pixels for rendering 3D models., 24 Nov. 2011, 2011, 16, 1, 6
  • 研究報告計算機アーキテクチャ(ARC), Memory Accelerator for Irregular Applications - From the Context of Exa FLOPS Machine, 田邊 昇; Boonyasitpichai Nuttapon; 中條 拓伯; 小郷 絢子; 高田 雅美; 城 和貴, Byte/FLOP を現在より下げざるを得ない Exa FLOPS 級マシンにおいて,国内では階層キャッシュが重要視されている.一方,不規則型応用は必要な Byte/FLOP が大きく,かつ,文科省の重点指定アプリの中でも大きな比率をしめており,日本の Exa FLOPS 級マシンの文脈において対応が重要である.本報告では Gather 機能を有するメモリシステムについて上記の文脈上で考察する。その判断材料として現状の GPU のキャッシュヒット率と,キャッシュを前段に併用した Gather 機能を有するメモリシステムについて疎行列ベクトル積の性能評価を行なった.その結果,キャッシュによる性能向上は限定的で,その容量の 10 倍程度のベクトルサイズまでで頭打ちとなった.不規則型応用に対して再利用性に高速化原理をおくキャッシュに頼りきることは危険であり,Gather 機構が重要であることが確認された.In Japan, hierarchical cache is currently given high priority for memory system of Exa FLOPS machine whose Byte/FLOP ratio must be smaller than current supercomputers. On the other hand, irregular applications require higher Byte/FLOP ratio. Since these occupy a large part of MEXT-selection of focused applications, supporting irregular applications is important in the context of Japanese Exa FLOPS machine. In this report, a memory system with gather functions is reconsidered in the context of Exa FLOPS machine. We explored hit ratio of a current GPU's cache and performance of memory system with gather function and its preliminary stage cache for sparse matrix vector multiplication. As a result, performance gain by the additional cache is limited and disappeared for vector with about 10times higher size than the cache capacity. It is confirmed that the importance of gather function for irregular applications is higher than that of cache whose acceleration principle is based on reusability., 21 Nov. 2011, 2011, 14, 1, 8
  • 研究報告数理モデル化と問題解決(MPS), Development of an e-learning Support Method using e-WOM and its Evaluation, 松本 多恵; 高田 雅美; 城 和貴, 本稿では,e-口コミを用いた新たな学習支援手法を提案する.この手法の目的は,1)高いドロップアウト率,2)モチベーション維持の困難さ,3)少ないインタラクティブ性という 3 つの e-learning が抱える問題を解決することである.提案する学習支援手法は,従来の学習支援と大きく異なり,メンターなどの学習支援者を必要とせず,学習者自らが意欲的・主体的に学習をする仕掛けを与えるものである.我々は,この e-口コミを発生させるために,消費者購買行動モデルの 1 つである AISAS に着目する.このモデルを応用し,マンガ教材を利用した e-learning 学習教材の開発を行う.開発された教材が e-learning が抱える問題を解決する方法として有効であることをアンケートから示す.In this paper, we propose an e-learning support method using e-WOM (e-Word of Mouth) for three problems in e-learning: 1) learners drop out at high rate 2) it is difficult to maintain motivation 3) it has few interactive. The proposed method is a lot different from existing methods. The proposed method does not need support persons such like a mentor, and set up a case that learners work aspiringly and actively. To go on e-WOM, we adopt AISAS, which is a model for buying behavior. We put AISAS into the development of the e-learning support method using comic learning tools. To validate the method, we have questionnaires., 08 Sep. 2011, 2011, 27, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), Performance Evaluation of a GPU Enhanced with a Memory Accelerator by Using CG-method, 小郷 絢子; 田邊 昇; 高田 雅美; 城 和貴, 本報告では,係数行列や解ベクトルが GPU 上に載りきらないほど大きな連立一次方程式を共役勾配法 (CG法) で解く際に,メモリアクセラレータの利用を提案する.提案アクセラレータは GDDR5 ポートなどに接続され,デバイスメモリの厳しい容量制約を緩和するとともに,Gather 機能によりキャッシュや GDDR 系メモリが苦手とする間接アクセスを連続アクセス化する.本報告では,フロリダ大学の疎行列コレクションを用いて提案方式の性能評価を行った.その結果,テクスチャキャッシュが効くような小さな行列でも,単体性能はテクスチャキャッシュを用いる既存手法の 1.05~2.01 倍に向上した.従来手法は行列サイズを大きくした時,GPU 内キャッシュのヒット率が低下し,性能低下する.解ベクトルがデバイスメモリ容量を超えると PCI express を通過する通信により,さらなる性能低下が予想される.それに対し,本手法はそれらの心配が無い.In this paper, we propose the use of memory accelerator to solve systems of liner equation, which coefficient matrices and solution vector unable to be had on board by CG method. In the case of existing method, when the size of matrix is increase, performance decrease because of hit probability on GPU cache decrease. We predict that performance decrease because of access of exceed access, the case solution vector is over device memory capacity. In contrast, there is no risk, thanks to this method. Proposed accelerator is connected to such as GDDR5 port, it ease severe capacity limit, and make indirect access which is unsuitable for cache and GDDR memory into direct access using gather function. In this paper, we evaluate the performance of proposed strategy with University of Florida Sparse Matrix Collection. The result showed from the 1.05 to the 2.01 times acceleration over the case of existing performance record with the texture cache, even if small matrix which has effect of texture cache., 20 Jul. 2011, 2011, 15, 1, 10
  • 研究報告ハイパフォーマンスコンピューティング(HPC), 情報処理学会, Relaxing the Dependency of Matrix Shape on the Performance of Sparse Matrix Vector Product Using a GPU and an Extended Memory, 田邊 昇; Boonyasitpichai Nuttapon; 中條 拓伯; 小川 裕佳; 高田 雅美; 城 和貴, GPUのメモリシステムにおける不連続アクセスにおける問題を解決するために筆者らは先行研究でScatter/Gather機能を有する拡張メモリシステムを提案した。疎行列ベクトル積に対する評価も行ない,提案拡張メモリシステム側の疎行列ベクトル積に対するスループットをPCI expressのバンド幅以上にできることを示した。しかし,疎行列ベクトル積に関しては評価行列が1つのみであった。本報告ではその種類を増やした実験によって,提案方式の性能の行列形状依存性について評価した.その結果,提案方式は行列の形状に性能が鈍感で,高い実行性能を安定して提供できることがわかった.In order to overcome the problems of discontinuous accessing in memory systems of various processors, we have proposed an extended memory system which has an additional function of scattering and gathering. In this paper, we have confirmed the assumption on feasibility of throughput of the memory system is correct or not with a simulator based on DRAMsim2 with various matrices. As the result, we have confirmed proposed system has good stability for matrix figure., 08 Mar. 2011, 2011, 11, 1, 8
  • 研究報告数理モデル化と問題解決(MPS), 情報処理学会, A Multiple Faces Detection Method using GPU, 久保 友理恵; 高田 雅美; 城 和貴, 本稿では,複数の人物の顔を高速に検出するプログラム開発のために,GPU (Graphic Processing Unit) を用いた高速化の一手法を検討する.GPU として,NVIDIA 社の tesla C1060 を採用する.tesla C1060 では,GPGPU (General Purpose Computing on Graphic Processing Unit) 用開発環境である CUDA が使用可能である.顔検出には高速に検出可能な Haar-Like 特徴を用いた AdaBoost ベースの識別器を利用する.検討手法では,入力画像上をランダムに選んだ複数の位置から走査を開始し,Haar-Like 特徴演算を GPU で行うことによって,CPU での実装より高速な処理を可能にする.In this paper, we present some optimization techniques for multiple faces detection using GPU. As the target platform, we use tesla C1060 which is widely know as a high-end GPU. We use CUDA as the development environment for GPGPU. To detect face, we use a classifier based on AdaBoost with using Haar-Like features which can detect the face positions very quickly. In this case, we perform the Haar-Like feature calculation on tesla C1060 to demonstrate a faster implementation rather than CPUs., 28 Feb. 2011, 2011, 21, 1, 6
  • 年会論文集, 日本教育情報学会, 幼児の大画面3DCG体験学習会の報告と今後の課題 (日本教育情報学会 第27回年会 教育情報のイノベーション--デジタル世代をどう導くか) -- (初中等教育での学習教育支援・実践と情報教育), 吉井 直子; 篠沢 和恵; 高田 雅美; 城 和貴, 幼稚園教育は,新幼稚園教育要領にも記されているように環境を通して行う活動を基本としている.本稿では,我々の実施している,幼児を対象とした「大画面3DCG体験学習会」について報告する.これは,新たな環境となりつつある3DCGの最新技術に幼児が触れ,サイエンスやテクノロジーに関心を持つきっかけを与えることを目的とするものである.アンケート結果から,2D作品鑑賞と比較すると,3DCG体験の方がより幼児たちは興味や関心を持つという傾向が示唆される.また3年間実施した経験から,今後幼稚園教育で利用するための課題について述べる., Aug. 2011, 27, 150, 153
  • 年会論文集, 日本教育情報学会, 3B1 エッジ画像における幼児期の奥行き知覚の特徴(一般研究 初中等教育の情報教育1,教育情報のイノベーション~デジタル世代をどう導くか~), 吉井 直子; 高田 雅美; 城 和貴, 幼児が効果的に形の学習を行うためには,適切な教材が必要である.そこで,本稿では,物体の輪郭を取り出すエッジ抽出が施されたエッジ画像を用いて実験を行い,幼児の奥行き知覚に関する特徴を考察する.実験結果から,5歳児男子は5歳児女子より奥行きをよく知覚していること,5歳児女子は個人差が大きく,平行に並ぶものより重なりがあるものをよく知覚できるということが検証できた., 2011, 27, 258, 259
  • 研究報告数理モデル化と問題解決(MPS), Development and Evaluation of a Sumiji Learning Support System for Visually Impaired People, 松本 多恵; 伊奈 諭; 高田 雅美; 城 和貴, 情報通信機器を活用したコミュニケーションは視覚障害者と晴眼者との有効な情報伝達手段であるが,視覚障害者には大きな壁が存在する.それは 『漢字仮名交じり文』 を作成することである.視覚障害者が使用する点字には,ひらがな,カタカナ,漢字の区別がなく,表音文字だけをどんどん読み進んで文字の意味を理解するため, 『墨字』 という大きな壁にぶち当ってしまう.これまでも視覚障害者向けに点字ワープロ等が開発されてきたが,これらの機器を有効に活用するためには,視覚障害者の墨字リテラシー強化が必要不可欠である.そこで我々は,筆順に着目し,触覚と音声ガイドによる自学自習および対面指導を支援するシステムを開発し,視覚障害者を被験者とした評価実験を行った.We develop a Sumiji learning support system for visually impaired people. The system is based on hand writing using tactile stroke order to be displayed. In order to validate the system, we perform experimental evaluation of the system with visually impaired people. As a result, it is clarified that our system is very effective for the blind to learn Sumiji. Its hand writing is accompanied by shortening of acquisition time and the improvement in the rate of learning is compared with the conventional face to face instruction., 12 Sep. 2012, 2012, 1, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), 古典油彩画グレーズ技法シミュレーションの高速化, 篠澤和恵; 楜沢順; 高田雅美; 城和貴, コンピュータ上での絵具の発色シミュレーションは,グラフィックソフトウェアへの応用が期待できる.古典油彩画における 「グレーズ」 は,薄く溶いた透明な絵具の層を重ねる技法であり,混色で表現できない色調を,重色によって表現するものである.その発色は,放射伝達方程式を解くことによって求められる.しかし従来手法は,異なる絵具でグレーズを行う方法が示されておらず,高精度な解を得るには計算量が大きくなるため,グラフィックソフトウェアへの応用には不向きである.本研究では,まず従来手法を異なる絵具の層に対応できるように拡張する.さらに,係数行列を分解し,刻み幅を固定することにより,高精度な解を小さい計算量で得ることが可能な数値解法を提案する.また,実際の油絵具のデータを用いて数値実験を行い,高精度な解が,従来手法の約 4 % ~ 7 %の計算時間で求められることを示す., 12 Sep. 2012, 2012, 7, 1, 6
  • 研究報告数理モデル化と問題解決(MPS), The Kanji character recognition evalution for the modern book of the same pablisher, 福尾 真実; 高田 雅美; 城 和貴, 本研究では,同一出版者の近代書籍に対する漢字認識実験を行う.国立国会図書館では,近代デジタルライブラリーとして,所蔵している書籍を Web 上で公開している.これらは画像データとして公開されており,文書内容を用いた検索は行えない.そのため早急なテキスト化が求められている.書籍のスキャンは,見開きの状態で行われている.ゆえに,テキスト化を行う際,文書の傾き補正を行う必要があるが,本稿では新たな角度補正の手法を提案する.また,出版者で使用しているフォントが異なっており文字認識が困難となっている.そこで,本稿では同一出版者の近代書籍に対し漢字の認識実験を行う.In this research, we perform the kanji recognition experiment for the modern book of the same publisher. In National Diet Library, a book possessing as the digital library from meiji era is shown on Web. These are shown as image data and cannot perform the search using document contents. Therefore it is demanded an immediate text becoming it. The scan of the book is carried out in the state of the spread. In addition, fonts using in publishers are different, and character recognition becomes difficult. When we become the text of the book, it is necessary to make the degree of leaning revision of the document, but suggests technique of new angle revision in this report. Therefore we perform the recognition experiment of the kanji for the modern book of the same publisher in this paper., 12 Sep. 2012, 2012, 26, 1, 6
  • 研究報告ハイパフォーマンスコンピューティング(HPC), Preliminary Evaluation for Classifying Suitability for Cache Memory of Sparse Matrices, 冨森 苑子; 田邊 昇; 高田 雅美; 城 和貴, エクサスケールマシンは複雑なメモリシステムとなることが予想されている.同マシンへの適用を視野に入れた疎行列ライブラリの実現に向け,本報告では疎行列のキャッシュへの適合性分類に資する疎行列の特性に関する新しい指標として 「列インデックス列の空間的局所性」 を提案する.さらに,入力疎行列および Fold 法前処理後の提案指標の値をフロリダ大学の疎行列コレクションを用いて評価した.その結果,疎行列ベクトル積処理性能と L1 キャッシュヒット率と新指標の間には有意な相関関係があることが確認できた.よって,従来から指摘していた行列サイズと併せ,本指標をアプリ固有の最適化を避けたメモリアクセス機構や前処理アルゴリズム自動選択の指標の一つとする.In Japan, memory system of ExaFLOPS machines is expected more complex. In this paper, we propose a new characteristic of sparse matrices about spatial locality of row-index sequences in order to classify suitability for cache memory systems. Moreover, we evaluate proposal characteristic of input matrices and pre-processes (folding). Test matrices are chosen from University of Florida Sparse Matrix Collection. As a result, it is confirmed that there are significant correlations between performance of Sparse Matrix-Vector Product(SpMV) and the general purpose cache (L1) hit rate. Therefore, our characteristic is suitable for auto-tuning pre-processes and memory access mechanisms to avoid application specific optimization in conjunction with matrix size (the number of rows)., 25 Jul. 2012, 2012, 17, 1, 7
  • 先進的計算基盤システムシンポジウム論文集, 大規模疎行列やメモリシステムの特性を考慮した高速な汎用疎行列ライブラリ実現に向けて, 冨森苑子; 田邊昇; 小郷絢子; 高田雅美; 城和貴, 09 May 2012, 2012, 65, 66
  • ハイパフォーマンスコンピューティングと計算科学シンポジウム論文集, Application for Sparse Matrix Computation of a Memory Accelerator with Gather Functions, 田邊 昇; 小郷 絢子; 小川 裕佳; 高田 雅美; 城 和貴, 17 Jan. 2012, 2012, 32, 41
  • 情報処理学会論文誌数理モデル化と応用(TOM), Information Processing Society of Japan (IPSJ), A Combined Data and Program Partitioning Algorithm for Distributed Memory Multiprocessors, TSUNEO NAKANISHI; KAZUKI JOE; CONSTANTINED.POLYCHRONOPOULOS; AKIRA FUKUDA, In this paper we propose an algorithm to perform data partitioning and program partitioning simultaneously on an intermediate representation for parallelizing compilers which we have proposed, the Data Partitioning Graph. Conventional and, therefore, conservative parallelizing compilers usually activate program partitioning prior to data partitioning. However, on distributed memory multiprocessors it is quite difficult to partition a program effectively with consideration of data partitioning since communication costs change depending on a data partitioning and distribution decision. The proposed algorithm resolves this conflict by handling these inseparable partitioning problems simultaneously with an a algorithm., 15 Dec. 1999, 40, 9, 30, 41
  • 情報処理学会研究報告数理モデル化と問題解決(MPS), 一般社団法人情報処理学会, リリース・コンシステンシ・モデルとその実現の形式的仕様記述について, 高田司郎; 田口研治; 城和貴; 福田晃, 我々は,分散共有メモリシステムの振る舞いを定義したメモリ・コンシステンシ・モデルとその実現の形式的な仕様記述とその検証の研究を行っている.我々は,仕様記述言語Zとvalue-passing CCSを統合した形式的技法をコーザル・メモリ・コンシステンシ・モデルに適用した結果,そのモデルと実現の形式的仕様記述,および,その実現の検証がこの技法で一貫して行えることを確認した.そこで,本稿では,リリース・コンシステンシ・モデルに同様の形式的技法を適用して,そのモデルとその同期に関する実現の形式的仕様記述を行った., 26 Nov. 1998, 1998, 105, 87, 92
  • 情報処理学会論文誌. 数理モデル化と応用, Information Processing Society of Japan (IPSJ), Editor's Message, JOE K.; Kita E, 15 Aug. 2006, 47, 15, i

Books etc

  • コンピュータアーキテクチャ入門, サイエンス社, JOE Kazuki, Jan. 2014, Not Refereed, 9784781913285
  • Lecture Notes in Computer Science 4759, Springer, JOE Kazuki, Jan. 2008, Not Refereed
  • International Journal of High Performance Computing and Networks, Vol.2, No.1 Special Issue on ISHPC-V, InderScience, JOE Kazuki, 編集, 2005, Not Refereed
  • International Journal of High Performance Computing and Networks, Vol.1, No.4 Special Issue on ISHPC-V, InderScience, JOE Kazuki, 編集, 2004, Not Refereed
  • International Journal of Parallel Programming, Vol.31, No.1, Plenum Press,, JOE Kazuki, 編集, 2003, Not Refereed
  • Lecture Notes in Computer Science 2858, Springer, JOE Kazuki; Veidenbaum, A; Amano, H; Aiso, H, 編集, 2003, Not Refereed
  • Innovative Architecture for Future Generation High-Performance Processors and Systems 2003, IEEE CS press, JOE Kazuki; Alex Veidenbaum, 編集, 2003, Not Refereed
  • Innovative Architecture for Future Generation High-Performance Processors and Systems 2002, IEEE CS press, JOE Kazuki; Alex Veidenbaum, 編集, 2002, Not Refereed
  • Lecture Notes in Computer Science 2327, Springer, JOE Kazuki; Zima, H; Sato, M; Seo, Y; Shimasaki, M, 編集, 2002, Not Refereed
  • Innovative Architecture for Future Generation High-Performance Processors and Systems 2001, IEEE CS press, JOE Kazuki; Alex Veidenbaum, 編集, 2001, Not Refereed
  • Lecture Notes in Computer Science 1940, Springer, JOE Kazuki; Valero, M; Kitsuregawa, M; Tanaka, H, 編集, 2000, Not Refereed
  • International Journal of Parallel Programming Vol.28, No.2, Plenum Press,, JOE Kazuki, 2000, Not Refereed
  • Lecture Notes in Computer Science 1615, Springer, JOE Kazuki; Polychronopoulos, C; Fukuda, A; Tomita, S, 編集, 1999, Not Refereed
  • Innovative Architecture for Future Generation High-Performance Processors and Systems '98, IEEE CS press, JOE Kazuki; Alex Veidenbaum, 編集, 1999, Not Refereed
  • International Journal of Parallel Programming, Vol.27, No.2, Plenum Press,, JOE Kazuki, 編集, 1999, Not Refereed
  • Innovative Architecture for Future Generation High-Performance Processors and Systems '97, IEEE CS press, JOE Kazuki; Alex Veidenbaum, 編集, 1998, Not Refereed
  • Lecture Notes in Computer Science 1336, Springer, JOE Kazuki; Polychronopoulos, C; Araki, K; Amamiya, M, 編集, 1997, Not Refereed

Presentations

  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 近代文語体と現代口語体の自動翻訳への試み, Dec. 2018, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 帝国議会会議録におけるレイアウト解析手法の比較, Sep. 2018, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, FPGA実装されたICBIの性能評価, Mar. 2018, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 透過型HMD上での日本語文字切り出しの一手法, Feb. 2017, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 近代書籍用フォントの自動生成, Feb. 2017, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 計測位置のずれを考慮した脳波個人認証の検討, Feb. 2017, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, DCGANを用いたイラスト画像生成の一手法, Feb. 2017, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 調剤薬局用薬剤売買のためのレコメンドシステム, Dec. 2016, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, コミュニケーションぬいぐるみデバイスにおける圧力センサを用いた感情推定の一手法, Dec. 2016, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, Myoを用いた腕の表面筋電位解析, Sep. 2016, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 遺伝的アルゴリズムを用いたQWOPの運動学習の一手法, Sep. 2016, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, DeepLearningを用いたSNSからの知識抽出の一手法, Mar. 2016, 情報処理学会, False
  • JOE Kazuki, 進化計算シンポジウム2015, GPを用いた活字風手書き文字の生成, Dec. 2015, 進化計算学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 上肢神経系セルフチェックのためのHapLogを用いた評価システムの試作, Sep. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 近代書籍用OCRのための学習用特定フォントセットの自動生成手法, Sep. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 脳波計測位置のずれが脳波個人認証に与える影響, Sep. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 呼吸変動解析によるストレス指標の提案, Jun. 2015, 情報処理学会, False
  • JOE Kazuki, バイオメトリクス研究会, 心拍波形の振幅と面積を用いた個人認証の提案, Jun. 2015, 電子情報通信学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, COG分類を考慮した遺伝子発現プロファイルデータのクラスタリング手法, Jun. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, Leap Motion Controllerを用いた指文字認識, Feb. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, ニューラルネットワークを用いた心拍データの学習と利用, Feb. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会コンシューマ・デバイス&システム研究会, 定在波レーダを用いたリアルタイム呼吸モニタリングシステムの開発, Jan. 2015, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, ボリュームデータにおける三次元物体の部分認識, Dec. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 機械学習を用いた問題解答のための推論システムの開発, Dec. 2014, 情報処理学会, False
  • JOE Kazuki, 第19回日本バーチャルリアリティ学会大会, VR用体感アミューズメントアプリの開発, Sep. 2014, 日本バーチャルリアリティ学会, False
  • JOE Kazuki, 第19回日本バーチャルリアリティ学会大会, プリシェイピングを利用したVRユーザのモーション認識, Sep. 2014, 日本バーチャルリアリティ学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 活字データの分類を用いた進化計算による近代書籍からのルビ除去, Jun. 2014, 情報処理学会, False
  • JOE Kazuki, 人工知能学会第32回セマンティックウェブとオントロジー研究会, スマートヘルスケアのための身体活動レコメンドシステム, Mar. 2014, 人工知能学会, False
  • JOE Kazuki, 人工知能学会第32回セマンティックウェブとオントロジー研究会, オントロジーの概念自動追加, Mar. 2014, 人工知能学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 定在波レーダを用いた距離画像の構築, Feb. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, オントロジーを用いた建造物のバリアフリー度判定, Feb. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 脳波個人認証のための特徴抽出, Feb. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 多フォント漢字認識手法における各カテゴリと必要教師データ数の分析, Feb. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 複数の3軸加速度センサを用いたNon-Exercise Activity Thermogenesisを含む身体活動のモデル化, Feb. 2014, 情報処理学会, False
  • JOE Kazuki, 情報処理学会ハイパフォーマンスコンピューティング研究会, アーキテクチャの進歩を促進するGraph500ベンチマークのあり方, Sep. 2013, 情報処理学会, False
  • JOE Kazuki, 情報処理学会ハイパフォーマンスコンピューティング研究会, Graph500のHybrid解法に内在する局所性, Jul. 2013, 情報処理学会, False
  • JOE Kazuki, 情報処理学会計算機アーキテクチャ研究会, Scatter/Gatherをどこで行なうべきか?-低電力で高スループットなランダムアクセスのために-, Mar. 2013, 情報処理学会, False
  • JOE Kazuki, 情報処理学会ハイパフォーマンスコンピューティング研究会, 疎行列のキャッシュ適合性に基づくGraph500ベンチマークの特性解析, Feb. 2013, 情報処理学会, False
  • JOE Kazuki, 情報処理学会計算機アーキテクチャ研究会, 時間的局所性を考慮した疎行列のキャッシュ適合性, Dec. 2012, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 書籍オントロジーのための推論部の開発, Nov. 2012, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, LF/HFを用いた時空間ストレス指標の提案, Nov. 2012, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 定在波レーダを用いた呼吸モニタリングシステムの開発, Nov. 2012, 情報処理学会, False
  • JOE Kazuki, 情報処理学会数理モデル化と問題解決研究会, 同一出版者の近代書籍に対する漢字認識評価, Sep. 2012, 情報処理学会, False
  • JOE Kazuki, 情報処理学会ハイパフォーマンスコンピューティング研究会, 疎行列のキャッシュへの適合性分類に関する予備評価, Jul. 2012, 情報処理学会, False
  • JOE Kazuki, 数理モデル化と問題解決研究会, ARを用いた空間認識能力向上のための学習方法, Mar. 2012, 情報処理学会, False
  • JOE Kazuki, 数理モデル化と問題解決研究会, 近代デジタルライブラリーの文字切り出しにおける実際的手法, Mar. 2012, 情報処理学会, False
  • JOE Kazuki, 数理モデル化と問題解決研究会, MKLによる食事画像認識の追試, Dec. 2011, 情報処理学会, False
  • JOE Kazuki, 数理モデル化と問題解決研究会, 異なる端末における効果的な3D表示のためのポリゴンリダクション法, Dec. 2011, 情報処理学会, False
  • JOE Kazuki, 進化計算シンポジウム2011, 進化計算による裏抜け除去, Dec. 2011, 進化計算学会, False
  • JOE Kazuki, 数理モデル化と問題解決研究会, 未病の認識・改善に有効なストレスオントロジーの設計, Dec. 2011, 情報処理学会, False
  • JOE Kazuki, HPC研究会, メモリアクセラレータで強化したGPUのCG法による評価, Jul. 2011, 情報処理学会, False

Awards

  • PDPTA2006 Achievement Award, The 2006 International Conference on Parallel and Distributed Processing Technologies and Applications, Jun. 2006
  • 情報処理学会数理モデル化と問題解決研究会功労賞, 情報処理学会数理モデル化と問題解決研究会, Mar. 2006
  • PDPTA2005 Achievement Award, The 2005 International Conference on Parallel and Distributed Processing Technologies and Applications, Jun. 2005
  • PDPTA2002 Achievement Award, 2002
  • PDPTA2001 Achievement Award, 2001
  • 第1回ATR 研究開発賞, 1991

Industrial Property Rights

  • Patent right, ニューラルネットにおける学習方法1, JOE Kazuki, 2046960
  • Patent right, ・ニューラルネットにおける学習方法3, JOE Kazuki, 1949819
  • Patent right, 高速アレイ・アクセス方式, JOE Kazuki, 2594062
  • Patent right, ニューラルネットにおける学習方法2, JOE Kazuki, 2094529
  • Patent right, ニューラルネットにおける学習方法4, JOE Kazuki, 2054649

Research Projects

  • 2020, 2022, 20H04483, Principal investigator
  • 2017, 2019, 近代書籍からの知の抽出, 科学研究費補助金, 0, 0, 0, Competitive research funding

Ⅲ.社会連携活動実績

1.公的団体の委員等(審議会、国家試験委員、他大学評価委員,科研費審査委員等)

  • 2001, 2004, Society
  • 2001, 2004, Society
  • 情報処理学会, 代表会員, 2001, 2004, Society
  • 情報処理学会数理モデル化と問題解決研究会, 主査, 2001, 2004, Society
  • Information Processiong Scociety Japan, 関西支部幹事, 2002, 2003, Society
  • 2002, 2003, Society


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.