Papers - KAMADA Tomio
-
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