{"title":"\"Inclusive Bridging\" over Co-existential Entities: A Fundamental Structure of Deep Communication via \"Slow Information\"","authors":"O. Katai, T. Shiose, H. Kawakami","doi":"10.1109/ICKS.2007.1","DOIUrl":"https://doi.org/10.1109/ICKS.2007.1","url":null,"abstract":"This paper presents a novel way of deep communication with the use of \"slow information\" which affects the whole structure of the co-existential entities constituting a problem in hand. We focus our attentions to the distinction between \"natural systems\" and \"artificial systems\". We then focus on the two basic force (power) that constructs or destructs the whole structure of the entities. The former one is the associative or \"inclusive\" force and the latter the dissociative or \"exclusive\" force. We then relate them to the notions of Leibnizian space and time that are sometimes contrasted with Newtonian space and time. The inclusive force is regarded to be the original source of Leibnizian space and the exclusive force as that of Leibnizian time. Also, the former force is related to the slow information and the latter the fast information, that is, the one in Shannon's sense. These notions are then used to examine the construction and the destruction of co-existential structure of the problem. The final discussions are on practices in \"inclusive design\" workshops done in cooperation with an NPO","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"292 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120862999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
H. Kawanami, H. Masuyama, S. Kasahara, Y. Takahashi
{"title":"Performance Analysis of Optical Switched Networks with Two-Way Reservation","authors":"H. Kawanami, H. Masuyama, S. Kasahara, Y. Takahashi","doi":"10.1109/ICKS.2007.21","DOIUrl":"https://doi.org/10.1109/ICKS.2007.21","url":null,"abstract":"Performance of an optical burst switching with two-way reservation is analyzed using queueing theoretical approach in this paper. The switching considered hereafter exploits both the resource sharing nature of packet switching and the highspeed transmission capability of wavelength division multiplexing in optical networks. Under the switching architecture, when a group of packets to be addressed to the same edge node of an optical network and thus to be put in an optical burst gets ready for transmission at an edge node, the node sends a request for service to a centralized control node to get wavelength allocated for the duration of a burst transmission. After an offset interval, a designated wavelength is allocated to the request if available. The delay might cause the degradation of QoS, especially for real time applications. One of possible improvements in the above mechanism is for an edge node to send a request for a slot in advance before it counts an enough number of packets to fill up a slot and to expect that the remaining space in a slot is filled with packets arriving in an offset delay. We first describe a queueing model of a finite buffer where a batch of packets are served in a burst and then derive the probability distribution of the number of packets in the buffer. As for performance measures, we obtain the packet loss probability, the average transmission delay and the utilization factor of bursts","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133884814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Loosely Trusted Yet Secure Roaming Architecture for Public Wireless Internet Service","authors":"K. Ohira, Y. Huang, Takaaki Komura, Y. Okabe","doi":"10.1109/ICKS.2007.15","DOIUrl":"https://doi.org/10.1109/ICKS.2007.15","url":null,"abstract":"The demand of providing one's network bandwidth for another such as a business partner or a guest in a form like a so-called free wireless Internet access is rising. However, in some countries like Japan, the law concerning the responsibility of Internet service providers requires not only ISPs who operate roaming service but also anyone who provide access to the Internet to identify an illicit user when requested. Otherwise he himself may be treated as the illicit user. In this paper, we first categorize conventional roaming models and consider trust relationships in roaming. Conventional roaming models assume trust between a connectivity provider and an authenticator. Most measures are against abuse of a mobile user or a fake user as an attacker. Based on the consideration, we propose an autonomous distributed model account management architecture. With this architecture, when an illicit use occurs, every concerned party can find who do it even in the case that not only a mobile user but also a connectivity provider and/or an authenticator may do it. This is possible if a connectivity provider allows only traffics of some well known secure authentication protocols and user data which are authenticated with them to go through his network. This proposal makes it possible for a connectivity provider to provide access for a mobile user securely as easy as a free wireless access without trust with any authenticator","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133538031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stochastic and Robust Approaches to Optimization Problems under Uncertainty","authors":"M. Fukushima","doi":"10.1109/ICKS.2007.30","DOIUrl":"https://doi.org/10.1109/ICKS.2007.30","url":null,"abstract":"In the last decade, optimization models under uncertainty have drawn much attention and efficient algorithms have been developed for solving those problems. This article presents the author's recent attempts conducted in collaboration with a number of co-authors to deal with uncertainty in various optimization problems including complementarity problems, mathematical programs with equilibrium constraints, as well as applications in data mining, mathematical finance, and game theory","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Minoh, H. Obara, T. Funtatomi, M. Toyoura, K. Kakusho
{"title":"Direct Manipulation of 3D Virtual Objects by Actors for Recording Live Video Content","authors":"M. Minoh, H. Obara, T. Funtatomi, M. Toyoura, K. Kakusho","doi":"10.1109/ICKS.2007.10","DOIUrl":"https://doi.org/10.1109/ICKS.2007.10","url":null,"abstract":"In this article, we will describe our work aiming to realize direct manipulation of 3D virtual objects used as virtual props by a human playing a role of an actor for recording a live video content. For direct manipulation of the 3D virtual props, the actor wears a data glove, which is replaced by a realistic virtual hand in the same 3D shape as the actor's hand using chroma key before the video is delivered to viewers. When the virtual hand replaces the data glove on the actor's hand, its posture is adjusted so that it grasps the virtual props without misalignment. For modeling the virtual hand, the actor's hand is measured by the light stripe triangulation while moving with various postures. The 3D point set obtained as the result is segmented into the points corresponding to the parts of the actor's hand based on the difference in motion among those parts so that the segmented points are integrated into a 3D description of an articulated object. The 3D virtual objects used for virtual props are modeled by recovering the 3D shapes of the real objects by the volume intersection method. The 3D shape recovered by the method is improved using motion of the object and random pattern backgrounds","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"74 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Utsuro, Masatsugu Tonoike, S. Sato, S. Kurohashi
{"title":"Compiling Bilingual Lexicon for Technical Terms Using the Web","authors":"T. Utsuro, Masatsugu Tonoike, S. Sato, S. Kurohashi","doi":"10.1109/ICKS.2007.6","DOIUrl":"https://doi.org/10.1109/ICKS.2007.6","url":null,"abstract":"This paper studies how to exploit domains in the Web texts in the task of automatic compilation of bilingual technical term lexicon. First, we propose how to judge whether each technical term candidate is actually a term of the given domain, or a domain independent term of general use. Next, we propose how to estimate translation of a technical term, given its domain","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134324876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Review of SEASTAR2000 Promoted by the COE Bangkok Office: Sea Turtles, Mekong Giant Catfish, Dugongs and Human Beings","authors":"N. Arai","doi":"10.1109/ICKS.2007.25","DOIUrl":"https://doi.org/10.1109/ICKS.2007.25","url":null,"abstract":"We performed international studies at the COE Bangkok office established by the Informatics Research for Development of Knowledge Society Infrastructure in Thailand, The projects include the Southeast Asia sea turtle associative research (SEASTAR2000), the Mekong giant catfish tracking project (MCTP) and the dugong biological survey (DBS). All the species of the projects are heavily endangered and need a sufficient degree of protection. Very little is known of these species whilst the implementation of conservation measures is a pressing problem in Thailand and neighboring ASEAN countries. In these countries, the conservation policy sometimes poses some troubles because the area to be protected is also fishing ground where the local people live. We must appreciate the need for coexistence between the endangered species and the local people based on scientific knowledge","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130348244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Access Control of XML Documents and Business Rule Processing for Advanced Information Exchange","authors":"M. Iwaihara","doi":"10.1109/ICKS.2007.2","DOIUrl":"https://doi.org/10.1109/ICKS.2007.2","url":null,"abstract":"In this paper, we summarize our research results obtained through the COE program. Our topics are classified into two categories. One is access control of XML documents, and the other is business rule processing for e-commerce. The former is dealing with various aspects of regulating access to XML documents, so that unauthorized access to data can be prevented. The latter is dealing with formal treatment of business rules for advanced automated e-commerce systems. We studied modeling and querying business rules, and extracting business rules from Web pages. We also describe two topics in more detail, one is relevancy-based access control of XML documents, and the other is extracting global policies for efficient access control of XML documents","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122146935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximating Minimum k-partitions in Submodular Systems","authors":"H. Nagamochi","doi":"10.1109/ICKS.2007.3","DOIUrl":"https://doi.org/10.1109/ICKS.2007.3","url":null,"abstract":"In this paper, we consider the problem of computing a minimum k-partition of a finite set V with a set function f : 2<sup>V</sup> rarr Ropf, where the cost of a k-partition {V<sub>1</sub>, V<sub>2 </sub>,..., V<sub>k</sub>} is defined by Sigma<sub>1lesilesk</sub>f(V<sub>i</sub>). This problem contains the problem of partitioning a vertex set of an edge-weighted hypergraph into k components by removing the least cost of hyperedges. We show that, for a symmetric and submodular set function f, 2(1 - 1/k)-approximate solutions for all k isin [1, |V|] can be obtained in O(|V|<sup>3</sup>)-oracle time. This improves the previous best time bound by a factor of k = O(|V|)","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114502363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Introduction to Scenario Description Language Q","authors":"T. Ishida, S. Yamane","doi":"10.1109/ICKS.2007.14","DOIUrl":"https://doi.org/10.1109/ICKS.2007.14","url":null,"abstract":"One of the most important attributes of social agents is the ability to fluently interact with human communities. Interaction scenarios are seldom designed by computer professionals, and instead are most often specified by application designers such as sales managers, travel agencies, and school teachers. Our challenge is to extend agent technologies to ensure the social acceptance of agents in various applications. To this end, we have developed Q, a language for designing interaction scenarios among agents and human communities. Q can also act as an interface between computer professionals and application designers. This paper details the specifications of Q, and shows how to design and execute scenarios for social agents","PeriodicalId":413165,"journal":{"name":"Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}