{"title":"Synchronous parallel GA with nearly zero sequential computations","authors":"N. Okamoto, Q. Zhao","doi":"10.1109/CW.2002.1180893","DOIUrl":"https://doi.org/10.1109/CW.2002.1180893","url":null,"abstract":"Generally speaking, genetic algorithms (GAs) can provide global optimal solutions with higher probability. However, compared with conventional approaches, GAs are usually more time consuming. To solve this problem, different parallel GAs (PGAs) have been proposed in the literature. A direct method is to employ many slave processors for individual evaluation, and a master processor to synchronize the whole evolution process. This method is good in the sense that it does not change any properties (say, convergence) of GAs. However, according to Amdahl's (1967) law, this method cannot speedup the evolution process very much, because the percentage of sequential computation is relatively large. We make two proposals: one is to keep all genetic materials inside the slave processors, and the other is to ask the slaves to perform crossover and mutation as well. The former reduces data transmission time, and the latter reduces sequential computing time directly. With these proposals, we have succeeded to achieve almost m times speedup when we use m slaves. This is verified through experiments.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"27 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":"115123465","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":"Key exchange protocols for multiparty communication services","authors":"Chao-Wen Chan, Chinchen Chang","doi":"10.1109/CW.2002.1180885","DOIUrl":"https://doi.org/10.1109/CW.2002.1180885","url":null,"abstract":"Network technology is improving distributed applications. The parties in distributed applications need to exchange secret information to perform a specific task, and these parties form a specific group. Secret message exchanges in the group are likely to be in a secret conference over a network. To perform secret message exchange, one needs a common secret key to encrypt or decrypt messages. The basic idea behind our method is to pass a secret line through a published point. Any attacker who uses only one point cannot recover the secret line. Only the party who knows two points of the secret line can recover the line. Based on this idea, we propose new key exchange protocols and a message exchange protocol. The secret key established through the proposed method is a set of the secret points. Moreover, because the secret key is a set of secret points, it can support the dynamic part of a dynamic peer group that allows new parties to join and parties to leave the group.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"144 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":"116694633","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":"Efficient data compression methods for multi-dimensional sparse array operations","authors":"Chun-Yuan Lin, Yeh-Ching Chung, Jenshiuh Liu","doi":"10.1109/CW.2002.1180861","DOIUrl":"https://doi.org/10.1109/CW.2002.1180861","url":null,"abstract":"For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage (CRS/CCS) schemes are the two common used data compression schemes for sparse arrays in the traditional matrix representation (TMR). When extended to higher dimensional sparse arrays, array operations using the CRS/CCS schemes usually do not perform well. We propose two data compression schemes, extended Karnaugh map representation Compressed Row/Column Storage (ECRS/ ECCS) for multi-dimensional sparse arrays based on the EKMR scheme. To evaluate the proposed schemes, both theoretical analysis and experimental tests are conducted. In theoretical analysis, we analyze CRS/CCS and ECRS/ECCS schemes in terms of the time complexity, the space complexity, and the range of their usability for practical applications. In experimental test, we compare the performance of matrix-matrix addition and matrix-matrix multiplication sparse array operations that use the CRS/CCS and ECRS/ECCS schemes. The experimental results show that sparse array operations based on the ECRS/ECCS schemes outperform those based on the CRS/CCS schemes for all test samples.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"3 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":"123785876","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}
Noor Alamshah Bolhassan, W. Martens, Michael Cohen
{"title":"Beyond flat panning and zooming: dolly-enhanced SQTVR","authors":"Noor Alamshah Bolhassan, W. Martens, Michael Cohen","doi":"10.1109/CW.2002.1180925","DOIUrl":"https://doi.org/10.1109/CW.2002.1180925","url":null,"abstract":"This paper describes a novel solution to limitations associated with interactive display of immersive stereographic imagery via Apple's QuickTime Virtual Reality (QTVR) technology. A unique multinode implementation providing Stereographic QTVR (termed here SQTVR) enables display of pairs of images exhibiting binocular parallax, and the stereoscopic depth percept that results is enhanced by motion parallax inherent in a subtle translation of the viewpoint through the displayed 3D scene. Stereoscopic depth is maintained as a user pans freely through a complete 360/spl deg/ horizontal panorama, while the system imposes a slight dollying in and out of the scene as a user's view rotates left or right. In addition, SQTVR solves two problems that can be observed when users of conventional QTVR technology change viewing positions, and these are problems that generally interfere with a user's sense of immersion and telepresence. First, objects that should be revealed (\"disoccluded\") by a change in viewing position remain occluded behind objects in the foreground of the image. Second, objects that should loom large as they approach the viewing position are displayed in an unchanging proportion relative to image elements in the background. SQTVR's multinode implementation addresses these two limitations of conventional QTVR technology in a natural way by tiling a plane with equilateral triangles connecting potential viewing positions.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"98 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":"122603160","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":"An agent based e-marketplace over e-business","authors":"Ying-Hong Wang, Wen-Nan Wang, Chen-An Wang, An-Cheng Cheng","doi":"10.1109/CW.2002.1180894","DOIUrl":"https://doi.org/10.1109/CW.2002.1180894","url":null,"abstract":"E-business can help a company or enterprise to extend its market place to an unlimited region. Through Internet and WWW the limitation of distance and region are broken for business behaviors. The agent technique is one of the important technologies developed to support the Internet applications. Especially, the Internet and WWW technologies have broken the limitation of space of enterprise marketing, and the agent techniques solve the problems of temporality. In this paper, a mechanism is proposed for an e-marketplace based on agents and mobile agents. The paper discusses research issues which include the platform of mobile agents, the types and classifications of agents and mobile agents, behaviors of commerce transactions and processing models, negotiation mechanisms, etc. Based on the proposed mechanism of e-marketplace, the applications of e-commerce will be more effective, easier to develop, and more creating the marketing of business.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"110 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":"131740876","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}
Yutaka Ono, Bing-Yu Chen, T. Nishita, Jieqing Feng
{"title":"Free-form deformation with automatically generated multiresolution lattices","authors":"Yutaka Ono, Bing-Yu Chen, T. Nishita, Jieqing Feng","doi":"10.1109/CW.2002.1180915","DOIUrl":"https://doi.org/10.1109/CW.2002.1180915","url":null,"abstract":"Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods, allows the user to deform a model easily by moving a set of control points, collectively called the lattice. Although the FFD method can be used for both global and local deformations, the user must define a suitable lattice manually or use a simple shaped lattice such as a parallelepiped. Therefore, we propose a new FFD method that automatically generates the lattices with which both types of deformations can be achieved. Our method refines a bounding box of the model and generates a set of finer lattices, which hierarchically approximate the shape of the model. Through adjusting the control points of the generated lattices, both global and local deformations of the model can be achieved easily. Moreover, the method allows hierarchical deformation of the model by combining different levels of lattice.","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":"130806654","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":"Internet voting: concerns and solutions","authors":"Chuankun Wu, R. Sankaranarayana","doi":"10.1109/CW.2002.1180888","DOIUrl":"https://doi.org/10.1109/CW.2002.1180888","url":null,"abstract":"Internet voting systems, catering to different requirements, have been widely implemented and used. Some have been successful, while others have experienced unexpected problems. This paper overviews the concerns of using Internet voting and tries to give solutions. Tradeoffs between the advantages and disadvantages of employing Internet voting are also addressed. A simple protocol is designed to show that technical problems identified in the literature can be solved fairly easily, though some seem subtle. This study reveals that the main concerns of adopting Internet voting for critical elections are not cryptographic tools, but hardware and software reliability, and social and political issues. After discussing possible concerns about Internet voting and possible solutions or comments, we propose steps to enable Internet voting to be adopted even for critical elections.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"13 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":"127871151","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":"Direct segmentation for reverse engineering","authors":"M. Vanco, G. Brunnett","doi":"10.1109/CW.2002.1180856","DOIUrl":"https://doi.org/10.1109/CW.2002.1180856","url":null,"abstract":"In reverse engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate consecutive steps as surface fitting. In this paper we present a step segmentation method with subsequent classification of simple algebraic surfaces. Our method is direct in the sense that it operates directly on the point set in contrast to other approaches that are based on a triangulation of the data set. The segmentation process involves a fast algorithm for k-nearest neighbors search and an estimation of first and second order surface properties. First order segmentation, based on normal vectors, provides an initial subdivision of the surface and detects sharp edges as well as flat or highly curved areas. One of the main features of our method is to proceed by alternating the steps of segmentation and normal vector estimation. Second order segmentation subdivides the surface according to principal curvatures and provides a sufficient foundation for the classification of simple algebraic surfaces. If the boundary of the original object contains such surfaces the segmentation is optimized based on the result of a surface fitting procedure.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"90 B4 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":"124400838","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":"Function-based 3D web visualization","authors":"Lai Feng Min, A. Sourin, K. Levinski","doi":"10.1109/CW.2002.1180910","DOIUrl":"https://doi.org/10.1109/CW.2002.1180910","url":null,"abstract":"This paper describes how the web-based visualization can be greatly improved using the function-based shape modeling technique. The improvement is possible because the proposed function-defined VRML shape node allows the content creators to describe any complex models with relatively small functions compared to the large-size polygonal mesh based VRML nodes. These function-defined shapes can be used together with the common VRML shapes. The proposed node has a few implementations capable of visualizing geometric shapes defined with HyperFun language as well as in any proprietary function-defined data formal. For fast visualization of the function-defined shapes, we have developed an improved continuation polygonization algorithm specifically designed for VRML visualization. The design, the implementation details, and the application examples of the proposed node are discussed.","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":"130698719","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}
Pizzanu Kanonchayos, T. Nishita, Y. Shinagawa, T. Kunii
{"title":"Topological morphing using Reeb graphs","authors":"Pizzanu Kanonchayos, T. Nishita, Y. Shinagawa, T. Kunii","doi":"10.1109/CW.2002.1180914","DOIUrl":"https://doi.org/10.1109/CW.2002.1180914","url":null,"abstract":"Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their contours to create morphing between 3D objects having different topology. The proposed method specifies the correspondence between of the input objects by using the graph isomorphic theory. Then the super Reeb graph, which has the equivalent topological information to the Reeb graphs of the two input objects, is constructed and used to conduct the sequence of the morphing. The evolutions of the topology that occur during the morph can be specified by the transformation of the Reeb graphs and their contours of the input objects. Reeb graph-based modeling allows the users precisely and intuitively control the morph because the topological information of the objects, represented by the structures of the Reeb graphs, is explicit and easy to understand Moreover, the contours of the Reeb graphs also represent the geometrical information of the objects. The examples of morphing between different topological shapes are demonstrated.","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":"131559069","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}