{"title":"Geometric querying of time-dependent data for data mining in molecular dynamics","authors":"O. Sourina, N. Korolev","doi":"10.1109/CW.2004.36","DOIUrl":"https://doi.org/10.1109/CW.2004.36","url":null,"abstract":"Temporal databases and data warehouses are essential components of intelligent information systems in cyberworlds. We describe a geometric model for querying time-dependent data in databases and warehouses. An implementation and application of the model for querying of results of numerical simulation in molecular dynamics is discussed. Data are interpreted geometrically as multidimensional points with time dimension. A geometric query is a query solid of any shape specified by its parameters, location and time. These queries are formulated with geometric objects and operations over them to form the query solid. The geometric objects and operations are described with implicit functions. With the uniform geometric model for querying time-dependent data, 3D visualization tools can be naturally incorporated into the molecular dynamics visualization system to pose the queries.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117068604","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":"Speculative planning with delegation","authors":"Tolga Abaci, J. Cíger, D. Thalmann","doi":"10.1109/CW.2004.57","DOIUrl":"https://doi.org/10.1109/CW.2004.57","url":null,"abstract":"This paper presents a novel method of collaborative problem solving for intelligent agents in virtual environments. We describe a planner for STRIPS-like domains enhanced by techniques of \"delegated computing\". Instead of having one central planner with complete information about the world, the concept of delegation is used. In this way, we achieve agent collaboration in a dynamic system, where each of the agents has its own partial plan, but the plans are implicitly coordinated towards a common goal. We demonstrate these techniques in a virtual reality simulation with virtual humans solving a logistical problem.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116276450","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":"Integrating network services of Windows and UNIX for single sign-on","authors":"Jun Futagawa","doi":"10.1109/CW.2004.39","DOIUrl":"https://doi.org/10.1109/CW.2004.39","url":null,"abstract":"We propose a practical method of building an enterprise system that realizes an environment where enterprise network users can access all authorized network resources seamlessly with a single password regardless of the platforms such as Windows, UNIX, and other network services. The proposed method is based on Lightweight Directory Access Protocol (LDAP) and Samba suite. Apart from ours many single sign-on solutions have been proposed and commercialized. However, the previous solutions still suffer from proprietary restrictions caused by too much dependency on Microsoft Windows Server OS and its client access license (ACL) for Windows domain environment. Our method solves this problem, providing the system administrators with uniform authentication methods at both OS and application levels at minimal cost, and provides the users with reflexible and uniform interface to data storage and resources regardless of the platforms. We also touch upon the problems of migration from an old system to our integrated system.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"24 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114025288","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 improvement for accessing patterns through clustering in interactive VRML environments","authors":"Shao-Shin Hung, Ting-Chia Kuo, D. Liu","doi":"10.1109/CW.2004.19","DOIUrl":"https://doi.org/10.1109/CW.2004.19","url":null,"abstract":"Since the walkthrough system may contain large-scale VRML models, the massive objects are always stored and scattered in the storage units of the walkthrough system. But this situation will increase the search time and reduce the system performance. However, this problem is never considered in the traditional walkthrough system. In this paper, we present an efficient clustering method to improve the efficiency of accessing objects. Meanwhile, the clustering methodology is particularly appropriate for the exploration of interrelationships among objects to reduce the access time. In other words, we introduce the relationships among transactions, views and objects. Based on these relationships, the clustering algorithm will determine how to cluster these objects efficiently. Besides, we suggest two clustering criteria ntra-pattern similarity table and inter-pattern frequency table. Our experimental evaluation on the walkthrough data set shows that our algorithm doesn't only significantly cut down the access time, but also enhance the performance of our system.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132019568","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":"Paradigm of information security as interdisciplinary comprehensive science","authors":"S. Tsujii","doi":"10.1109/CW.2004.48","DOIUrl":"https://doi.org/10.1109/CW.2004.48","url":null,"abstract":"The concept of information security is \"the dynamic process for establishing an integrated and complete system designed to form, without infringing freedom broadened by IT (information technology), and with closer coordination among technologies, administration and management techniques, legal and social systems and information morals in order to make compatible improved usability and efficiency and enhanced security, protected privacy and minimized surveillance, or monitoring, over people\". This paper considers the paradigm of information security as an interdisciplinary comprehensive science and the way to develop human resources, both of which are required to establish information security.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"41 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133138146","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}
Baowen Xu, Peng Wang, Jianjiang Lu, Yanhui Li, Dazhou Kang
{"title":"Bridge ontology and its role in semantic annotation","authors":"Baowen Xu, Peng Wang, Jianjiang Lu, Yanhui Li, Dazhou Kang","doi":"10.1109/CW.2004.24","DOIUrl":"https://doi.org/10.1109/CW.2004.24","url":null,"abstract":"Multiontologies environment is common such as the semantic annotation applications based on multiontologies. Based on analyzing and classifying the relationships between multiontologies, we propose the idea of bridge ontology, and present its detailed structure too. To deal with the semantic annotation problem based on multiontologies, a new approach is proposed which employing bridge ontology to express the complex relationships between multiontologies. The bridge ontology is a peculiar ontology, which can be created and maintained conveniently, and is effective in the applications based on multiontologies. The approach using bridge ontology has the advantages of low-cost, scalable, robust in the Web circumstance, avoiding the unnecessary ontology extending and integration, and promoting ontology reuse.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125853258","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":"Slicing Web application based on hyper graph","authors":"Junhua Wu, Baowen Xu, Jixiang Jiang","doi":"10.1109/CW.2004.56","DOIUrl":"https://doi.org/10.1109/CW.2004.56","url":null,"abstract":"Program slicing is an available method that is widely used in program understanding, analyzing, debugging, testing, maintaining. There are many solutions for slicing procedural program and object-oriented program. But traditional slicing method usually based on PDG and SDG that is not suitable to a Web application because of Web's special characteristics. This paper suggests a kind of slicing method that use hyper graph to define dependency of elements named PDSG (program dependence hyper graph). PDSG can describe dependence of the Web elements better than PDG. This method also makes the slicing algorithm simpler and the slice captured is integrated in semantics.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457398","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":"Toward E-appearance of human face and hair by age, expression and rejuvenation","authors":"A. Bastanfard, H. Takahashi, M. Nakajima","doi":"10.1109/CW.2004.65","DOIUrl":"https://doi.org/10.1109/CW.2004.65","url":null,"abstract":"Recently, Web based facial appearance systems have received more attention by various aspects and applications like online systems. Therefore there is a request for a system to have an ability of predict and render different appearance effects on facial images for online systems. Here, an E-appearance system is proposed to predict the essential effects of facial images with different appearance. Given facial image data of the same person in two different appearance, quotient image then capture appearance characteristic of image. Then, together with warping technique we map the characteristic to any other particular persons face in order to generate new facial appearance. The technique makes experiments on different facial appearance.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126215489","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":"Barcode readers using the camera device in mobile phones","authors":"E. Ohbuchi, H. Hanaizumi, L. Hock","doi":"10.1109/CW.2004.23","DOIUrl":"https://doi.org/10.1109/CW.2004.23","url":null,"abstract":"This paper shows new algorithms and the implementations of image reorganization for EAN/QR barcodes in mobile phones. The mobile phone system used here consists of a camera, mobile application processor, digital signal processor (DSP), and display device, and the source image is captured by the embedded camera device. The introduced algorithm is based on the code area found by four corners detection for 2D barcode and spiral scanning for 1D barcode using the embedded DSP. This algorithm is robust for practical situations and the DSP has good enough performance for the real-time recognition of the codes. The performance of our image processing is 66.7 frames/sec for EAN code and 14.1 frames/sec for QR code image processing, and this is sufficient performance for practical use. The released mobile phone had performance of 5-10 frames/sec including OS and subsystem overheads.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610921","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":"3D character model creation from cel animation","authors":"Yutaka Ono, Bing-Yu Chen, T. Nishita","doi":"10.1109/CW.2004.1","DOIUrl":"https://doi.org/10.1109/CW.2004.1","url":null,"abstract":"When creating a cel animation, the animators often use 3D character models to add some effects on the character or to generate intermediate images between the keyframes. However, it is a troublesome and time-consuming task to create a 3D model. In this paper, we present an easy-to-use approach for creating a set of consistent 3D character models from the user-specified strokes on a 2D image sequence. The created consistent 3D models can be used in cel animation editing systems for adding shadowing effects, textures, etc. Moreover, since the vertices of the consistent 3D models have one-to-one correspondence among the frames, by using 3D morphing techniques, this approach can also be used to generate intermediate images between the key frames.","PeriodicalId":157902,"journal":{"name":"2004 International Conference on Cyberworlds","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133146226","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}