{"title":"Sharing a secret gray image in multiple images","authors":"Chinchen Chang, Tai-Xing Yu","doi":"10.1109/CW.2002.1180884","DOIUrl":"https://doi.org/10.1109/CW.2002.1180884","url":null,"abstract":"In a traditional visual cryptography scheme, a shared secret image can be revealed with no cryptographic computations. Unfortunately, the revealed secret image of a conventional visual cryptography scheme is almost black and white. Colored visual cryptography schemes based on modified visual cryptography were recently proposed. By means of a few additional computations, users can hide a colored secret image. However, the implementation complexity in these schemes depends on the number of colors appearing in the secret image. In other words, when the secret image contains a large number of colors, these schemes will become impractical. In this paper, we propose a new secret color image sharing scheme based on modified visual cryptography. This scheme provides a more efficient way of hiding a gray image (256 colors) in different shares. Furthermore, the size of the shares is fixed; it does not vary when the number of colors appearing in the secret image differs.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"50 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":"133744698","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":"A simulation approach to verification and validation of formal specifications","authors":"Shaoying Liu","doi":"10.1109/CW.2002.1180867","DOIUrl":"https://doi.org/10.1109/CW.2002.1180867","url":null,"abstract":"Specification simulation is an approach to verifying and validating specifications by well-selected sample data. In this paper we put forward a technique for simulation of formal specifications in order to detect potential faults and validate their desired functions. The important benefit of this technique is it allows us to simulate implicit specifications, which are usually defined with a pair of pre- and postconditions and may not be executable. We discuss ways of simulation case generation, evaluation of logical expressions, and simulation result analysis, and demonstrate how they are applied in practice by examples.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"5 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":"114045948","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":"Thai OCR error correction using genetic algorithm","authors":"B. Kruatrachue, K. Somguntar, K. Siriboon","doi":"10.1109/CW.2002.1180870","DOIUrl":"https://doi.org/10.1109/CW.2002.1180870","url":null,"abstract":"This paper presents an efficient method for Thai OCR error correction based on genetic algorithm (GA). The correction process starts with word graph construction from spell checking with dictionary, then a graph is searched for a corrected sentence with the highest perplexity (using language model, bi-gram and tri-gram) and word probability from OCR. For a long sentence, a search space is huge and can be resolved using GA. A list of nodes is used for chromosome encoding to represent all possible paths in a graph instead of standard binary string. The performance of the suggested technique is evaluated and compared to the full search for tested sentences of different size constructed from 10 nodes to 200 nodes word graphs.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"75 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":"123615635","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":"Distance education technologies: current trends and software systems","authors":"T. Shih","doi":"10.1109/CW.2002.1180858","DOIUrl":"https://doi.org/10.1109/CW.2002.1180858","url":null,"abstract":"This paper presents state-of-the-art technologies of distance education systems. A survey of current approaches in distance education is given, including a historical perspective of media technologies for learning. The paper also discusses current systems available and potential research directions to enhance these systems. Methodological and sociological issues of distance education are also discussed. A number of distance education tools implemented at Tamkang University, Taiwan are demonstrated.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"43 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":"124972229","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":"A novel datacube model supporting interactive web-log mining","authors":"Tadashi Ohmori, Yuichi Tsutatani, M. Hoshi","doi":"10.1109/CW.2002.1180909","DOIUrl":"https://doi.org/10.1109/CW.2002.1180909","url":null,"abstract":"Web-log mining is a technique to find \"useful\" information from access-log data. Typically, association rule mining is used to find frequent patterns (or sequence patterns) of visited pages from access logs and to build users' behavior models from those patterns. In this direction, there exists a difficulty that a human decision-maker must do such data mining process many times under different constraining conditions, different groups of pages, and different levels of abstraction. In order to support this process, this paper proposes a novel datacube model called itemset cube. This cube manages frequent itemsets under various conditions which are modeled by a n-dimensional space. An itemset cube is materialized, sliced, and rolled-up repeatedly in the same way as a traditional scalar datacube is done for interactive scalar-value analysis. Although this looks simple, fast execution of these operations on an itemset cube is difficult. It is because different cells in an itemset cube contain different numbers of records, but these cells must use the same threshold ratios in order to detect frequent itemsets of equal quality. In this paper, a datacube model for storing frequent itemsets is described, and then an efficient algorithm of associated operations is proposed. Its application to a real-life dataset is also demonstrated.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"116 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":"116396303","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":"Verification of Web service flows with model-checking techniques","authors":"S. Nakajima","doi":"10.1109/CW.2002.1180904","DOIUrl":"https://doi.org/10.1109/CW.2002.1180904","url":null,"abstract":"Web service is an emerging software technology to use remote services in the Internet. As it becomes pervasive, some \"language\" to describe Web service flows is needed to combine existing services flexibly. The flow essentially describes distributed collaborations and is not easy to write and verify, while the fault that the flow description may contain can only be detected at runtime. The faulty flow description is not desirable because a tremendous amount of publicly shared network resources are consumed. The verification of the Web service flow prior to its execution in the Internet is mandatory. This paper proposes to use the software model-checking technology for the verification of the Web service flow descriptions. For a concrete discussion, the paper adapts WSFL (Web Services Flow Language) as the language to describe the Web service flows, and uses the SPIN model-checker for the verification engine. The experiment shows that the software model-checking technology is usable as a basis for the verification of WSFL descriptions.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"22 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":"124074819","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":"Study of relative effectiveness of features in content-based image retrieval","authors":"S. Subramanya, Jui-Che Teng, Yongjian Fu","doi":"10.1109/CW.2002.1180876","DOIUrl":"https://doi.org/10.1109/CW.2002.1180876","url":null,"abstract":"Content-based retrieval in image databases requires appropriate features of images to be derived and used in the indexing and searching process. Fast and accurate retrieval is crucial from a user point of view. The kinds of features used, their organization in suitable data structures, and the similarity search scheme, directly affect the speed and quality of content-based retrieval. In this paper, we evaluate the relative significance of three different image features - geometry, moments, and Fourier descriptors in the context of content-based retrieval, and present experimental results. The evaluation metrics are retrieval quality and search time. These could be used to tune the search process which speeds up retrieval without significantly affecting retrieval quality.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"8 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":"126416478","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":"A hybrid method for estimating the Euclidean distance between two vectors","authors":"Chinchen Chang, Po-Wen Lu, J. Hsiao","doi":"10.1109/CW.2002.1180878","DOIUrl":"https://doi.org/10.1109/CW.2002.1180878","url":null,"abstract":"We propose an alternative method for estimating the Euclidean distance between an image block and a codeword. Our method incorporates the reduced code look-up table (RCLUT) method with an RCLUT-like method to allow alternative selection in the encoding phase in vector quantization (VQ). This method can speed up computation for distance estimation. It provides better image quality than the RCLUT method at the cost of extra storage. According to experimental results, our method provides better image quality than the RCLUT method.","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":"130324989","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":"A real-time configurable shader based on lookup tables","authors":"E. Ohbuchi, H. Unno","doi":"10.1109/CW.2002.1180919","DOIUrl":"https://doi.org/10.1109/CW.2002.1180919","url":null,"abstract":"This paper presents hardware architecture for a configurable shader with pre-filtered environment mapping and twist/bump pattern mapping. Our architecture enables per-pixel shading calculation, which can be programmed by means of lookup tables, random-access memories (RAMs) and read-only memories (ROMs), and provides real-time rendering with various shading and reflectance models, such as Blinn-Phong, Cook-Torrance, and Ward.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"38 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":"133327626","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":"A hierarchically structured constraint-based data model for solid modelling in a virtual reality environment","authors":"Y. Zhong, W. Müller-Wittig, Weiyin Ma","doi":"10.1109/CW.2002.1180924","DOIUrl":"https://doi.org/10.1109/CW.2002.1180924","url":null,"abstract":"A hierarchically structured constraint-based data model for solid modelling in a virtual reality environment is presented. The data model integrates a high-level constraint-based model for precise object definition, a mid-level CSG/Brep hybrid solid model for supporting hierarchical geometry abstractions and object creation, and a low-level polygon model for real-time visualization and interaction in the virtual reality environment. Constraints are embedded in the solid model and organized at different levels to reflect the entire solid modelling process from features and parts, to assemblies. This model not only provides precise object definition, but also supports real-time visualization and interaction in the VR environment. Furthermore, it has the potential to obtain precise 3D interactions and precise constraint-based manipulations can be deduced from the data model to carry out precise solid modelling in the VR environment.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"133 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":"122905868","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}