Papers - KAMADA Tomio
-
Poster: Multi-Agent Transformer for Dynamic Allocation of Distributed Applications on the Edge
Ryota Matsumoto, Patrick Finnerty, Chikara Ohta, Tomio Kamada
IEEE Vehicular Networking Conference, VNC 255 - 256 2024
Edge computing has to potential to deliver vital low-latency services for ITS. However, due to the limited resources available on the edge, carefully allocating such services and adapting to changes in client distribution is necessary. In this poster, we show that a MAT reinforcement learning approach can perform better than heuristics.
-
Automatically balancing relocatable distributed collections Reviewed
Patrick Finnerty, Tomio Kamada, Chikara Ohta
Concurrency and Computation: Practice and Experience 35 ( 27 ) e7717 2023.4
-
Distributed Cell Set : A Library for Space-Dependent Communication/Computation Overlap on Manycore Cluster Reviewed
Yoshiki Kawanishi, Patrick Finnerty, Tomio Kamada, Chikara Ohta
Proceedings of the 14th International Workshop on Programming Models and Applications for Multicores and Manycores 2023.2
-
Hajime Migita, Taiyo Tanaka, Shuji Yamaguchi, Makoto Takenaka, Patrick Finnerty, Tomio Kamada, Chikara Ohta
2022 IEEE 8th World Forum on Internet of Things (WF-IoT) 2022.10
-
Supercharging the APGAS Programming Model with Relocatable Distributed Collections Reviewed
Patrick Finnerty, Yoshiki Kawanishi, Tomio Kamada, Chikara Ohta
Scientific Programming 2022.9
-
A study on optimization of polling scheduling for in-vehicle UWB wireless networks Reviewed
Chikara Ohta, Taiyo Tanaka, Hajime Migita, Shuji Yamaguchi, Makoto Takenaka, Patrick Finnerty, Tomio Kamada
IEICE Communications Express 11 ( 7 ) 429 - 434 2022.7
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
-
Integrating a global load balancer to an APGAS distributed collections library Reviewed
Patrick Finnerty, Tomio Kamada, Chikara Ohta
Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores 2022.4
-
Pedestrian Information Collation through Image-Based Person Identification for Pedestrian Information Sharing using V2V Communications. Reviewed
Enami Naoko, Uemura Saai, Asano Koh, Finnerty Patrick, Kamada Tomio, Ohta Chikara
IEICE Communications Express 11 ( 10 ) 625 - 629 2022
Publisher：The Institute of Electronics, Information and Communication Engineers
The purpose of this research is to share pedestrian information among multiple vehicles by vehicle-to-vehicle communication and detect the positions of all pedestrians around the vehicle. In the past, we have proposed a method of collating shared pedestrian information through image-based person Re-Identification (ReID). In this paper, in order to improve the accuracy of pedestrian information collation, the state-of-the-art ReID network is adapted to our scenario by fine-tuning. In addition, a new pedestrian image dataset for sharing pedestrian information was constructed. In our experiments using our dataset, the proposed method improved the pedestrian information collation accuracy.
-
Ryota Matsumoto, Patrick Finnerty, Chikara Ohta
IEICE Communications Express 2022
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
-
Radio resource allocation based on adaptive and maximum reuse distance for LTE-V2X sidelink mode 3 Reviewed
Daigo Yasuda, Patrick Finnerty, Tomio Kamada, Chikara Ohta
IEICE Communications Express 10 ( 10 ) 792 - 797 2021.10
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
LTE-V2X is one of the promising wireless technologies for Vehicle to Everything (V2X), which is expected to enhance the safety of road traffic. In this paper, we propose a radio resource allocation scheme for LTE-V2X Sidelink Mode 3. The reliability of packet transmission is seriously affected by changes in vehicle density. To cope with this issue, our new scheme reuses radio resources efficiently by calculating the range of protection from mutual interference based on the vehicle density. Compared with existing schemes, the proposed scheme successfully maintains a lower error rate of packet transmission regardless of the vehicle density.
-
Topic allocation method on edge servers for latency‐sensitive notification service Reviewed
Tomoya Tanaka, Tomio Kamada, Chikara Ohta
International Journal of Network Management 31 ( 6 ) 2021.6
Publisher：Wiley
DOI： 10.1002/nem.2173
Other Link： https://onlinelibrary.wiley.com/doi/full-xml/10.1002/nem.2173
-
Patrick Finnerty, Tomio Kamada, Chikara Ohta
Concurrency and Computation: Practice and Experience 2021.2
Publisher：Wiley
DOI： 10.1002/cpe.6224
Other Link： https://onlinelibrary.wiley.com/doi/full-xml/10.1002/cpe.6224
-
Error Factor Analysis of DNN-based Fingerprinting Localization through Virtual Space Reviewed
Takuto Jikyo, Tomio Kamada, Chikara Ohta, Takaharu Yaguchi, Kenji Oyama, Takenao Ohkawa, Ryo Nishide
2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC) 9 - 12 2021.1
-
Indoor localization based on CSI in dynamic environments through domain adaptation Reviewed
Liuyi Yang, Tomio Kamada, Chikara Ohta
IEICE COMMUNICATIONS EXPRESS 10 ( 8 ) 564 - 569 2021
Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
As the demand for indoor localization applications continues to grow, device-free localization based on Wi-Fi Channel State Information (CSI) has become a popular research topic. Wi-Fi signals are, however, easily affected by environmental factors such as furniture changes. These factors disable the original localization system, and rebuilding it will cost a lot of time and workforce. This is a major challenge of device-free Wi-Fi localization. To address this issue, we use a transfer learning method, "Integration of Global and Local Metrics for Domain Adaptation (IGLDA)," and improve it, aiming to adapt the original localization model to the changing environment. Consequently, the localization accuracy is improved from 26.3 % to 82.2 % by only recollecting 37.5 % of data.
-
Distributed topic management in publish-process-subscribe systems on edge-servers for real-time notification service Reviewed
Tomoya Tanaka, Tomio Kamada, Chikara Ohta
IEICE Communications Express 9 ( 12 ) 616 - 621 2020.12
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
The importance of real-time and data-driven notification has been growing for social services and Intelligent Transporting System (ITS). As an advanced version of Pub/Sub systems, publish-process-subscribe systems with MEC (Multi-access Edge Computing), where published messages are spooled and processed on edge servers, have been proposed. In this paper, we present a topic-based publish-process-subscribe system that allows a topic to be managed on multiple edge servers so that messages are processed near publishers and transferred to subscribers immediately. However, managing each topic on numerous edge servers can cause exhaustion of storage resources on edge servers. We introduce a simple topic allocation method on edge servers to discuss the problem. Experiments show the feasibility of our proposed system.
-
Tomoya Tanaka, Tomio Kamada, Chikara Ohta
2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS) 85 - 90 2020.9
-
Self-adjusting task granularity for Global load balancer library on clusters of many-core processors Reviewed
Patrick Finnerty, Tomio Kamada, Chikara Ohta
Proceedings of the Eleventh International Workshop on Programming Models and Applications for Multicores and Manycores 1 - 10 2020.2
-
Distributed Key-Value Storage for Edge Computing and Its Explicit Data Distribution Method Reviewed
Takehiro NAGATO, Takumi TSUTANO, Tomio KAMADA, Yumi TAKAKI, Chikara OHTA
IEICE Transactions on Communications E103.B ( 1 ) 20 - 31 2020.1
Publisher：Institute of Electronics, Information and Communications Engineers (IEICE)
-
Joint Channel and AP/STA Assignment for Infrastructure-Mode IEEE 802.11 Multi-Interface Wireless Mesh Networks Reviewed
TAKAHASHI Tomoki, KAMADA Tomio, OHTA Chikara, TAMURA Naoyuki, MAENO Taka
Proceedings of the 6th International Workshop on Smart Wireless Communications 12 - 17 2019.11
-
Distributed Key-Value Storage for Edge Computing and Its Explicit Data Distribution Method Reviewed
NAGATO Takehiro, TSUTANO Takumi, KAMADA Tomio, TAKAKI Yumi, OHTA Chikara
Proceedings of the 33th International Conference on Information Networking (ICOIN 2019) 2019.1
-
Person ReIDentification for Detection of Pedestrians in Blind Spots through V2V Communications. Reviewed
Kou Asano, Naoko Enami, Tomio Kamada, Chikara Ohta
Proceedings of IEEE Intelligent Transportation Systems Conference (ITSC2019) 764 - 770 2019
-
CARAVAN: A Framework for Comprehensive Simulations on Massive Parallel Machines Reviewed
Yohsuke Murase, Hiroyasu Matsushima, Itsuki Noda, Tomio Kamada
Massively Multi-Agent Systems II. MMAS 2018. Lecture Notes in Computer Science 11422 130 - 143 2019
-
Asymmetric Hidden Node Problem Aware Routing Metric for Wireless Mesh Networks. Reviewed
Keisuke Maesako, Yumi Takaki, Tomio Kamada, Chikara Ohta
Proceedings of IEEE Consumer Communications & Networking Conference (CCNC 2019) 1 - 7 2019
-
Takahiro Yamanishi, Takuto Jikyo, Tomio Kamada, Ryo Nishide, Chikara Ohta, Kenji Oyama, Takenao Ohkawa
IEICE Communications Express 2019
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
-
Takuto Jikyo, Takahiro Yamanishi, Tomio Kamada, Ryo Nishide, Chikara Ohta, Kenji Oyama, Takenao Ohkawa
IEICE Communications Express 2019
Publisher：Institute of Electronics, Information and Communications Engineers ({IEICE})
-
Efficient and reliable packet transfer protocol for wireless multihop bidirectional communications Reviewed
Yumi Takaki, Makoto Ando, Keisuke Maesako, Keisuke Fujita, Tomio Kamada, Chikara Ohta, Hisashi Tamaki
International Journal of Distributed Sensor Networks 14 ( 1 ) 2018.1
Publisher：SAGE Publications Ltd
In wireless multihop bidirectional communication environment, there is a possibility that packet collision and retransmission owing to the hidden node problem decrease efficiency of throughput. The aim of this article is to achieve efficient and reliable packet transmissions in such environments. To do so, we propose a packet transmission scheme named inter-flow network coding with passive acknowledgment. In inter-flow network coding with passive acknowledgment, it is necessary to optimize the encoding latency and to avoid passive acknowledgment packet collision, so we address these issues in this article. Finally, we also confirm that the inter-flow network coding with passive acknowledgment scheme is effective in terms of the collection ratio and delay through simulations.
-
A Study for Improvement of Throughput in High-Density Wireless Networks Using Transmitting Opportunity Control Reviewed
KAWASAKI Takahiro, TAKAKI Yumi, KAMADA Tomio, OHTA Chikara
Proceedings of the 32th International Conference on Information Networking (ICOIN 2018) 140 - 145 2018.1
Publisher：IEEE
-
Roadmap and research issues of multiagent social simulation using high-performance computing Reviewed
Noda, Itsuki, Ito, Nobuyasu, Izumi, Kiyoshi, Mizuta, Hideki, Kamada, Tomio, Hattori, Hiromitsu
Journal of Computational Social Science 1 ( 1 ) 155 - 166 2018
-
Platform design for large-scale artificial market simulation and preliminary evaluation on the K computer Reviewed
Takuma Torii, Tomio Kamada, Kiyoshi Izumi, Kenta Yamada
Artificial Life and Robotics 22 ( 3 ) 301 - 307 2017.9
Publisher：Springer Tokyo
Artificial market simulations have the potential to be a strong tool for studying rapid and large market fluctuations and designing financial regulations. High-frequency traders, that exchange multiple assets simultaneously within a millisecond, are said to be a cause of rapid and large market fluctuations. For such a large-scale problem, this paper proposes a software or computing platform for large-scale and high-frequency artificial market simulations (Plham: /plΛ m). The computing platform, Plham, enables modeling financial markets composed of various brands of assets and a large number of agents trading on a short timescale. The design feature of Plham is the separation of artificial market models (simulation models) from their execution (execution models). This allows users to define their simulation models without parallel computing expertise and to choose one of the execution models they need. This computing platform provides a prototype execution model for parallel simulations, which exploits the variety in trading frequency among traders, that is, the fact that some traders do not require up-to-date information of markets changing in millisecond order. We evaluated a prototype implementation on the K computer using up to 256 computing nodes.
-
Collective relocation for associative distributed collections of objects Reviewed
Daisuke Fujishima, Tomio Kamada
International Journal of Software Innovation 5 ( 2 ) 55 - 69 2017.4
Publisher：Taru Publications
The field of parallel computing has experienced an increase in the number of computing nodes, allowing broader applications, including computations that have irregular features. Some parallel programming languages handle object data structures and offer marshaling/unmarshaling mechanisms to transpose them. To manage data elements across computing nodes, some research on distributed collections has been conducted. This study proposes a distributed collection library that can handle multiple collections of object elements and change their distributions while maintaining associativity between their elements. This library is implemented on an object-oriented parallel programming language, X10. The authors assume pairs of associative collections such as vehicles and streets in a traffic simulation. When many vehicles are concentrated on streets assigned to certain computing nodes, some of these streets should be moved to other nodes. The authors' library assists the programmer in easily distributing the associative collections over the computing nodes and collectively relocating elements while maintaining the data sharing relationship among associative elements. The programmer can describe the associativity between objects by using both declarative and procedural methods. They show a preliminary performance evaluation of their library on a Linux cluster and the K computer.
-
Overlapping Communication and Computation for Large-Scale Artificial Market Simulation Reviewed
Daisuke Fujishima, Tomio Kamada, Takumi Torii, Kiyoshi Izumi
Proceedings of of 22nd International Symposium on Artificial Life and Robotics (AROB 2017) 708 - 713 2017.1
-
Introducing a multithread and multistage mechanism for the global load balancing library of X10 Reviewed
Kento Yamashita, Tomio Kamada
Journal of Information Processing 24 ( 2 ) 416 - 424 2016.3
Publisher：Information Processing Society of Japan
Load balancing is a major concern in massively parallel computing. X10 is a partitioned global address space language for scale-out computing and provides a global load balancing (GLB) library that shows high scalability over ten thousand CPU cores. This study proposes a multistage mechanism for GLB to assign execution stages to tasks and introduces a multithread design into GLB to allow efficient data sharing between CPU cores. The system gives high priority to tasks that are assigned to earlier stages and then proceeds with subsequent stage tasks. When a computing node runs out of tasks at the earliest stage, it requests tasks at the earliest stage from other nodes and awaits responses by processing subsequent stage tasks. When the system identifies the task termination at a certain stage, it executes a reduction operation over nodes. Programmers can define their reduction operations to gather or exchange results of completed tasks. This study provides the implementation method of the extended library and evaluates its runtime overhead using the K computer to a maximum of 256 nodes.
-
Platform Design for Large-Scale Artificial Market Simulation and Preliminary Evaluation on the K computer Reviewed
Takuma Torii, Tomio Kamada, Kiyoshi Izumi, Kenta Yamada
Proceedings of 21st International Symposium on Artificial Life and Robotics (AROB 2016) 492 - 497 2016.1
-
Redistribution Mechanism for Associative Distributed Collections of Objects Reviewed
Daisuke Fujishima, Tomio Kamada
2016 IEEE/ACIS 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS) 583 - 588 2016
Publisher：IEEE COMPUTER SOC
The field of parallel computing has experienced an increase in the number of computing nodes and parallel computing has widened its application to include computations that have irregular features. Some parallel programming languages handle object data structures and offer marshaling/unmarshaling mechanisms to transport them. To manage data elements spread over computing nodes, some research on distributed collections has been conducted. This study proposes a distributed collection library that can handle multiple collections of object elements and change their distributions while maintaining the associativity between their elements. This library is implemented on an object-oriented parallel programming language, X10. We suppose pairs of associative collections such as vehicles and streets in a traffic simulation. When many vehicles are concentrated on streets assigned to certain computing nodes, some of those streets should be moved to other nodes. Our library supports the programmer in easily distributing the associative collections over the computing nodes and re-allocating their elements while maintaining the data sharing relationship among associative elements. The programmer can describe the associativity between objects using both declarative and procedural methods.
-
Webアプリケーション向け結合ビューライブラリにおける更新内容の即時反映機能とその実装 Reviewed
畑谷 卓哉, 熊谷 良夫, 鎌田 十三郎
情報処理学会論文誌データベース（TOD） 8 ( 2 ) 68 - 77 2015.6
Publisher：情報処理学会
-
Roadmap for Multiagent Social Simulation on HPC Reviewed
Itsuki Noda, Nobuyasu Ito, Kiyoshi Izumi, Tomohisa Yamashita, Hideki Mizuta, Tomio Kamada, Yohsuke Murase, Sachiko Yoshihama, Hiromitsu Hattori
2015 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT), VOL 3 3 22 - 25 2015
Publisher：IEEE COMPUTER SOC
In this article, we show roadmaps of multiagent social simulation to illustrate directions of technological achievements. Compared with physical simulation, social simulation is still in a phase of establishing models of simulations. We focus three issues, 'undetermined model', 'obscure boundary', and 'incomplete data', and consider a way to overcome these issues by using huge computational powers of high-performance computing (HPC). We pick-up three applications, evacuation, road-traffic, and market, and estimate required computational cost for the real applications.
-
Client-Side Joined View Library to integrate CRUD Web services Reviewed
畑谷 卓哉, 熊谷 良夫, 鎌田 十三郎
第7回 Webとデータベースに関するフォーラム予稿集 2014.11
-
GLB: Lifeline-based global load balancing in X10 Reviewed International coauthorship
Wei Zhang, Olivier Tardieu, David Grove, Benjamin Herta, Tomio Kamada, Vijay Saraswat, Mikio Takeuchi
PPAA 2014 - Proceedings of the 2014 Workshop on Parallel Programming for Analytics Applications 31 - 40 2014
Publisher：Association for Computing Machinery
We present GLB, a programming model and an associated implementation that can handle a wide range of irregular parallel programming problems running over large-scale dis- tributed systems. GLB is applicable both to problems that are easily load-balanced via static scheduling and to prob- lems that are hard to statically load balance. GLB hides the intricate synchronizations (e.g., inter-node communication, initialization and startup, load balancing, termination and re- sult collection) from the users. GLB internally uses a version of the lifeline graph based work-stealing algorithm proposed by Saraswat et al [25]. Users of GLB are simply required to write several pieces of sequential code that comply with the GLB interface. GLB then schedules and orchestrates the par- allel execution of the code correctly and efficiently at scale. We have applied GLB to two representative benchmarks: Betweenness Centrality (BC) and Unbalanced Tree Search (UTS). Among them, BC can be statically load-balanced whereas UTS cannot. In either case, GLB scales well - achieving nearly linear speedup on different computer archi- tectures (Power, Blue Gene/Q, and K) - up to 16K cores. Copyright © 2014 ACM.
-
結合ビューや複数ビューを提供するWebデータ閲覧・編集環境におけるデータ整合性管理
熊谷 良夫, 仙波 雅也, KAMADA TOMIO
第5回データ工学と情報マネジメントに関するフォーラム 論文集 2013.3
-
An environment for information integration with editable views of joined Web services
熊谷 良夫, 仙波 雅也, 鎌田 十三郎
第4回データ工学と情報マネジメントに関するフォーラム 論文集 F1-3 (5pages) 2012.3
-
Web Data Store Service with Role-Based Access Control for Sharing Structured Data
仙波 雅也, 鎌田 十三郎
第4回データ工学と情報マネジメントに関するフォーラム 論文集 E9-3 (6pages) 2012.3
-
Joined view editor for mashups of web data stores Reviewed
Yoshio Kumagai, Masaya Senba, Takakazu Nagamine, Tomio Kamada
Proceedings - 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, SNPD 2012 488-493 488 - 493 2012
Recent years have witnessed the emergence of Web services that publish data that can be used as globally shared data resources, and Web data stores offer data resources that can be shared and modified by users or groups. We think associative data representation among Web data elements is important for the reuse of the data for various purposes even when treating personal/group data. This paper aims to provide a general-purpose widget for Web data browsing/editing where users can easily create and update their data elements that are associated with other data elements, and proposes a table editor for joined views of Web services. With our editor, the user can join multiple Web services, and edit the left/right elements on the joined view in a tabular grid. To support easy manipulation of associated data during the modification, our editor continuously provides the renewed view reflecting the modification. The user can also try out multiple modifications while checking their impact on the view, and decide later whether to commit the modifications to the Web data stores or to discard the modifications. This paper presents some illustrations that demonstrate the use of this joined view editor, discusses the design, and briefly describes its implementation. © 2012 IEEE.
-
Application Developments in Mashup Framework for Selective Browsing Reviewed
Takakazu Nagamine, Tomio Kamada
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT II, PROCEEDINGS 5982 456 - 459 2010
Publisher：SPRINGER-VERLAG BERLIN
We are developing a new mashup framework for creating flexible applications in which users can selectively browse through mashup items. The framework provides GUI components called widgets through which users can browse mashed-up data. selectively, and the system processes demand-driven creation of mashed-up data upon receiving access requests through widgets. In this demonstration, we introduce some applications with the above-mentioned features, and show how users can build these applications on our framework.
-
要求駆動によるマッシュアップとAJAX Widget による効率的な閲覧 Reviewed
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
日本ソフトウェア科学会 コンピュータソフトウェア Vol. 26, No. 3 2009.8
-
Proposal of a MJ-based AOP Language and Its Type System for Type-safeness of Reusable Aspects Reviewed
Naoki Kusano, Tomio Kamada
情報処理学会 論文誌 プログラミング（PRO） 2 ( 2 ) 105 - 131 2009.3
The separation of concerns is important for efficient software constructions. MJ provides a technique called "morphing" for specifying generic classes whose members are produced by iterating over members of other classes given by type parameters, with avoiding similar codes for individual members. MJ also has a type system that judges whether morphing classes are type safe on arbitrary instantiations of type parameters. On the other hand, MJ does not support AOP-like features to bring together code fragments spread over call-sites or declarations of members for multiple classes. This paper proposes an AOP core language based on MJ and its type system for safely reusable aspects. Our type system ensures that applications of the aspect keep the type safeness of various target programs. The novel factor of the type system is checking whether the aspect may pose problems such as conflicts of member signatures or violations in method overriding. To allow description of type-safe aspects, we adopt a new feature of unique naming into our AOP language, and make enhancements of typing rules.
-
マッシュアップデータの選択的閲覧における効率的な部分更新 Reviewed
Takakazu Nagamine, Sohei Ikeda, Tomio Kamada, Naoki Kusano
DBSJ Journal VOl.7, No.4, pp 1-6 2009.3
-
Application Framework with Demand-Driven Mashup for Selective Browsing Reviewed
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
JOURNAL OF UNIVERSAL COMPUTER SCIENCE 15 ( 10 ) 2109 - 2137 2009
Publisher：GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM
We are developing a new mashup framework for creating. exible applications in which users can selectively browse through mashup items. The framework provides GUI components called widgets through which users can browse mashed-up data selectively, and the system processes demand-driven creation of mashed-up data upon receiving access requests through widgets. The application developer has to only prepare a con. guration. le that species how to combine web services and how to display mashed-up data. This paper proposes a revised widget model for effective data display, and introduces practical applications that allow selective browsing. The revision of the widget model is to accept various GUI components, process user interactions, and provide cooperative widgets. To avoid conflict with lazy data creation, we introduce properties into widgets that are automatically maintained by the system and can be monitored by other widgets. The case study through the applications shows the situations where the initially browsed data helps users to terminate redundant searches, set effective filter settings, or change the importance of the criteria. Some applications display synoptic information through columns, maps, or distribution charts; such information is useful for selective browsing.
-
Knowledge-Amount Control for SAT Solvers with Keeping the Knowledge Utilization Ratio
MASUDA Kazuya, KAMADA Tomio
日本ソフトウェア科学会 第25回大会予稿集 10page(CD) 2008.9
-
Mashup Framework with partial data re-construction for some modification on input data
NAGAMINE Takakazu, KAMADA Tomio, IKEDA Sohei, KUSANO Naoki
電子情報通信学会 第19回データ工学ワークショップ論文集 1-8(WEB) 2008.3
-
Application framework with demand-driven mashup for selective browsing Reviewed
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
Proceedings of the 10th International Conference on Information Integration and Web-based Applications and Services, iiWAS 2008 33 - 40 2008
This paper proposes a mashup framework for creating flexible mashup applications in which the user can selectively browse through mashup items. Our framework provides a data management engine for on-demand data generation, and GUI components called widgets that can be used to browse through mashed-up data selectively. The application developer has to only prepare a mashup relation specifying the web service combinations and widget configurations specifying how to display the mashed-up data. On the basis of these configurations, widgets monitor user interactions and requests data from the data management engine that processes the demand-driven creation of mashed-up data. To enable selective browsing, a table widget, for instance, allows selection of columns to be displayed, provides a limited view with scroll bars, and filtering facilities. Our framework also offers a mechanism for widget coordination where a widget can change the display target according to states or events of other widgets. We introduce a sample application for tour planning using five cooperative widgets, and discuss the usability and performance advantages of our framework. Copyright 2008 ACM.
-
Adaptive Scheduling Mechanism and Memory Reduction Techniques for Efficient Demand-Driven XML Processing Reviewed
Masakazu Yamanaka, Tomio Kamada
情報処理学会論文誌：コンピューティングシステム pp. 225-235, Vol. 46, No. SIG 2005.8
-
モード切替機構をもつ分散環境向けJava集合ライブラリの提案 Reviewed
鎌田 十三郎, 森本 昌治, 二ッ森 大介
情報処理学会論文誌プログラミング 46, SIG1,97-109 2005.1
-
A programming environment for demand-driven processing of network XML data and its performance evaluation Reviewed
Masakazu Yamanaka, Kenji Niimura, Tomio Kamada
Proceedings of the 2005 ACM Symposium on Document Engineering pp. 207-216 207 - 216 2005
This paper proposes a programming environment for Java that processes network XML data in a demand-driven manner to return quick initial responses. Our system provides a data binding tool and a tree operation package, and the programmer can easily handle network XML data as tree-based operations using these facilities. For efficiency, demand-driven data binding allows the application to start the processing of a network XML document before the arrival of the whole data, and our tree operators are also designed to start the calculation using the initially accessible part of the input data. Our system uses multithread technology for implementation with optimization techniques to reduce runtime overheads. It can return initial responses quickly, and often shortens the total execution time due to the effects of latency hiding and the reduction of memory usage. Compared with an ordinary tree-based approach, our system shows a highly improved response and a 1-28% reduction of total execution time on the benchmark programs. It only needs 1-4% runtime overheads against the event-driven programs. Copyright 2005 ACM.
-
要求駆動型XML計算環境Nanafusiの実装と評価 Reviewed
新村 健治, 山中 真和, 鎌田 十三郎
情報処理学会論文誌：コンピューティングシステム（ＡＣＳ７） 238-247 2004.10
-
要求駆動型XML計算環境Nanafusiの実装と評価 Reviewed
新村 健治, 山中 真和, 鎌田 十三郎
In Proc. Of SACSIS2004 345-351 2004.5
-
並列計算機におけるキャッシュを意識した自動メモリ管理機構 Reviewed
松田 聡, 鎌田 十三郎
情報処理学会論文誌：コンピューティングシステム Vol.44,No.SIG11(ACS 3),126-136 2003
-
要求駆動による遠隔 XML データ処理の効率化 Reviewed
鎌田 十三郎, 新村 健治, 田中 敬一
In Proc. of SACSIS2003 373-380 2003
-
Data Mapping Tool for Efficient Processing of XML Streaming Data Reviewed
NIIMURA Kenji, KAMADA Tomio, TAMURA Naoyuki
Conference Proceedings of Japan Society for Software Science and Technology 19 ( 0 ) 6E2 - 6E2 2002
Publisher：Japan Society for Software Science and Technology
In order to efficiently process large XML data from networks andoutput the result to other sites, streaming processing is important toreduce memory usage and to get quick response. This paper proposes adata mapping tool for processing XML streaming data. Our tool showsXML stream as a typed tree structure, where the system lazily parsesthe data stream to construct each element of the tree receiving thefield access request from the user program. This tool also has afeature to customize the mapping functions from XML document to typedtree structure, and improves the reusability of the data processingprogram written by the users.