{"title":"From dual-cube to metacube: efficient low-degree alternatives to hypercube","authors":"Yamin Li, S. Peng, Wanming Chu","doi":"10.1109/CW.2002.1180864","DOIUrl":"https://doi.org/10.1109/CW.2002.1180864","url":null,"abstract":"The hypercube has been widely used as the interconnection network in parallel computers. However, when dealing with the parallel computers of very large scale, the port limitation due to the technology greatly forbid the use of hypercube networks. The hypercube-based SGI Origin2000, a newly developed multiprocessor system, tried to solve this problem by introducing a Cray router. In this paper we first describe a hypercube-like network, called dual-cube, that was motivated by the structure of Origin2000. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a node in another cluster. The dual-cube mitigates the problem of port limitation in the large-scale hypercube network while keeps most of the topological properties of the hypercube network. Then, we describe an interconnection network that extends dual-cube into a more general network called metacube. The metacube has a two-level cube structure with two parameters representing the dimensions of the two-level cubes. Metacube is much more flexible than dual-cube and can solve the port limitation problem completely. The dual-cube and metacube networks can be applied to SGI Origin2000 to connect large number of processors without using Cray router.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823712","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":"Process of software evolution","authors":"T. Tamai","doi":"10.1109/CW.2002.1180854","DOIUrl":"https://doi.org/10.1109/CW.2002.1180854","url":null,"abstract":"A number of interesting phenomena can be observed when lifelong processes of object-oriented software are analyzed from the viewpoint of software evolution. This paper proposes a framework of software evolution studies and reports the results of empirical case studies and evolution patterns discovered through the analysis.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116884248","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":"Extensible requirements patterns of web application for efficient web application development","authors":"R. S. Wahono, Jingde Cheng","doi":"10.1109/CW.2002.1180908","DOIUrl":"https://doi.org/10.1109/CW.2002.1180908","url":null,"abstract":"Nowadays, web application has been going to be an e-business application. In the e-business environment, reducing time to market is a critical issue. Therefore, web application development process and time to market must be highly accelerated. On the other hand, a lot of redundant works actually occurred in the web application development. This paper presents the solutions for these problems, by proposing an extensible requirements pattern for efficient web application development. By reusing and reconstructing the extensible requirements patterns of web application, we can accelerate time to market and solve redundancy problems in web application development.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000706","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":"Multiple ant-colony optimization for network routing","authors":"K. Sim, W. Sun","doi":"10.1109/CW.2002.1180890","DOIUrl":"https://doi.org/10.1109/CW.2002.1180890","url":null,"abstract":"An ANT is a mobile agent that is capable of solving various kinds of routing and congestion problems in computer networking by continuously modifying routing tables in response to congestion. In a distributed problem solving paradigm, a society of ANTs (each contributing some information) collaborate to solve a larger problem. In recent years, ant-based algorithms were used to solve classical routing problems such as: traveling salesman problem, vehicle routing problem, quadratic assignment problem, connection-oriented/connectionless routing, sequential ordering, graph coloring and shortest common supersequence. This paper introduces the general idea of Ant-based algorithms with a focus on ant colony optimization (ACO), and their features, strengths, weaknesses and applications in network routing. The contribution of this paper is the proposal of a multiple ant-colony optimization (MACO) approach for network routing.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130228590","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":"Database semantics representation for natural language access","authors":"In-Su Kang, Jae-Hak J. Bae, Jong-Hyeok Lee","doi":"10.1109/CW.2002.1180869","DOIUrl":"https://doi.org/10.1109/CW.2002.1180869","url":null,"abstract":"In natural language database interfaces (NLDBI), manual construction of translation knowledge normally undermines domain portability because of its expensive human intervention. To overcome this, this paper proposes linguistically-motivated database semantics in order to systematically construct translation knowledge. Database semantics consists of two structures which are designed to function as a translation dictionary, and to contain selectional restriction constraints on domain classes. The database semantics is semi-automatically obtained from a semantic data model for a target database. Based on this database semantics, a conceptual NLDBI translation scheme is developed. Translating a natural language question into a database query suffers from the translation ambiguity problem, which has not received significant attention in this field. To deal with translation ambiguity, we suggest an ambiguity resolution method based on the proposed database semantics. Experiments showed the usefulness of the proposed database semantics and its disambiguation procedures.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"02 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127246686","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":"Shape modeling using cellular structured spaces","authors":"K. Ohmori, Wona Lee","doi":"10.1109/CW.2002.1180912","DOIUrl":"https://doi.org/10.1109/CW.2002.1180912","url":null,"abstract":"Abstraction is one of the most important concepts in computer science. It has been realized in object oriented programming as the form of class hierarchy. In this paper, new abstraction levels are introduced. This abstraction level can be applied in many fields of computer science, including computer graphics, image processing, database systems and design automation. In this paper the new abstraction level is applied to shape modeling. The abstraction level consists of homotopy, topological spaces, cellular structured spaces and Euclidean spaces. A teacup is used as an example of shape modeling using these abstraction levels.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129934791","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}
Jie Huang, Katsunori Kume, Akira Saji, Masahiro Nishihashi, Teppei Watanabe, W. Martens
{"title":"Robotic spatial sound localization and its 3D sound human interface","authors":"Jie Huang, Katsunori Kume, Akira Saji, Masahiro Nishihashi, Teppei Watanabe, W. Martens","doi":"10.1109/CW.2002.1180879","DOIUrl":"https://doi.org/10.1109/CW.2002.1180879","url":null,"abstract":"We describe a robotic spatial sound localization system using an auditory interface with four microphones arranged on the surface of a spherical robot head. The time difference and intensity difference from a sound source to different microphones are analyzed by measuring HRTFs around the spherical head in an anechoic chamber. It was found while the time difference can be approximated by a simple equation, the intensity difference is more complicated for different azimuth, elevation and frequency. A time difference based sound localization method was proposed and tested by experiments. A sound interface for human listeners is also constructed by four loudspeakers with a similar arrangement to the microphone set. This interface can be used as a 3D sound human interface by passing the four channel audio signals from the microphone set directly to the loudspeakers. It can also be used to create 3D sound with arbitrary spatial position which is determined by a virtual sound image or the sound localization system.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377791","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":"Result integration in a meta Web search engine","authors":"Baowen Xu, Weifeng Zhang, Hongji Yang","doi":"10.1109/CW.2002.1180874","DOIUrl":"https://doi.org/10.1109/CW.2002.1180874","url":null,"abstract":"A meta Web search engine first sends a user's search requests to its referenced search engines. The results returned by these search engines are then integrated by one result-integrating algorithm and returned to the user. Query precision, completeness and response speed are directly affected by the choice of result integration algorithm. By analyzing common result-integrating algorithms, this paper recommends several unproved algorithms to improve the coherence of search results.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128860506","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":"Autonomous and robust navigation for simulated humanoid characters in virtual environments","authors":"Torsten Fröhlich, D. Kullmann","doi":"10.1109/CW.2002.1180923","DOIUrl":"https://doi.org/10.1109/CW.2002.1180923","url":null,"abstract":"An important task for virtual characters is autonomous navigation in a virtual environment. This involves finding a way through the environment leading to a certain goal, avoiding obstacles such as walls, or surfaces not suitable for walking on. This paper presents an algorithm that analyzes a given scene database in a preprocessing phase in a fully automatic manner. It identifies storeys, rooms and stairs without the need of user guidance. During runtime, path planning works on data generated during the preprocessing phase working in real-time PC hardware.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123517771","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}
N. Sato, Minoru Udagawa, M. Uehara, Y. Sakai, H. Mori
{"title":"Reliable distributed search engine based on multiple meta servers","authors":"N. Sato, Minoru Udagawa, M. Uehara, Y. Sakai, H. Mori","doi":"10.1109/CW.2002.1180863","DOIUrl":"https://doi.org/10.1109/CW.2002.1180863","url":null,"abstract":"We have developed distributed search engine, called cooperative search engine (CSE), in order to retrieve fresh information. In CSE, a local search engine located in each Web server makes an index of local pages. And, a meta search server integrates these local search engines in order to realize a global search engine. This meta server is single point of failure in CSE. We propose redundancy, of meta search servers in order to increase availability of CSE. In this paper, we describe reliable architecture of CSE and its evaluations.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097165","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}