{"title":"An Approach to Implementing an Intelligent Web Search","authors":"V. Klyuev","doi":"10.1109/FCST.2008.12","DOIUrl":"https://doi.org/10.1109/FCST.2008.12","url":null,"abstract":"The retrieval efficiency of the presently used search tools cannot be significantly improved: A \"bag of words\" interpretation causes loosing semantics of texts. The functional approach to present English texts in the memory of computers makes it possible to keep semantic relations between words. These relations can be taken into account when indexing documents and when performing searching. Utilizing this approach, it is possible to use a natural language to express user queries. In many cases, this way is more usual for users to describe their information needs compared to the keyword style. The factoid question answering task is one of the possible its applications. Key components of the prototype of a system utilizing this approach are discussed.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126115763","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":"Inducing NNTrees Suitable for Hardware Implementation","authors":"H. Hayashi, Qiangfu Zhao","doi":"10.1109/FCST.2008.17","DOIUrl":"https://doi.org/10.1109/FCST.2008.17","url":null,"abstract":"Neural network tree (NNTree) is one of the efficient models for pattern recognition. One drawback in using an NNTree is that the system may become very complicated if the dimensionality of the feature space is high. To avoid this problem, we propose in this paper to reduce the dimensionality first using linear discriminant analysis (LDA), and then induce the NNTree. After dimensionality reduction, the NNTree can become much more simpler. The question is, can we still get good NNTrees in the lower dimensional feature space? To answer this question, we conducted experiments on several public databases. Results show that the NNTree obtained after dimensionality reduction usually has less number of nodes, and the performance is comparable with the one obtained without dimensionality reduction.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122933915","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":"Tracking and Repairing Damaged Databases Using Before Image Table","authors":"Meiyi Xie, Hong Zhu, Yu-cai Feng, Guanrong Hu","doi":"10.1109/FCST.2008.25","DOIUrl":"https://doi.org/10.1109/FCST.2008.25","url":null,"abstract":"Traditional damage assessment approaches can only locate damage caused by reading corrupted data in a post-intrusion database. This paper indicates another kind of damage spreading pattern characterized by omitting maliciously deleted data, which was not considered in previous studies. An extended recovery model arms at this problem is presented and a novel approach based on the model is proposed to recover a damaged database from malicious attacks. This approach can track the damage spreading more completely by maintaining before image tables (BI tables) in databases and analyzing transactions' potential-read to the BI tables. BI tables are also used for damage repair without accessing database logs. Experimental evaluation of the overhead of this method based upon TPC-C benchmark is also presented.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122196136","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":"Economical Solution for an Easy to Use Interactive Whiteboard","authors":"Zhixun Wang, James Louey","doi":"10.1109/FCST.2008.22","DOIUrl":"https://doi.org/10.1109/FCST.2008.22","url":null,"abstract":"This paper presents a new technology combining infrared tracking and Bluetooth communication to create an effective and low cost interactive whiteboard, the wiimote whiteboard. The author, a high school student, got the idea after he observed inattentive students and a deteriorating classroom environment on several occasions. After extensive research, he decided to solve the problem by building an interactive whiteboards. This paper gives the details, including how to gather the components, assemble the elements, install software, setup and calibrate the whiteboard. Due to the frequent low tracking resolution of the device, four methods of improving the tracking resolution are also provided, based on the author's many tests. Finally, the paper analyzes the basic theory, compares wiimote with the commercial whiteboard, introduces the history of the new technology, and lists a number of useful resources for referencing. With the help of the author's school and the advisor's funding, the device was successfully installed at Watertown High School of Connecticut.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189595","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":"MP-Templates Operating Toolkit in Movie-Based Programming","authors":"D. Vazhenin, A. Vazhenin","doi":"10.1109/FCST.2008.33","DOIUrl":"https://doi.org/10.1109/FCST.2008.33","url":null,"abstract":"The movie-based representation of algorithms and programs is in showing their features as a sequence of animation frames. Accordingly, any animation frame should visualize/animate a corresponding stage of a program/algorithm execution. Each movie-program frame (MP-frame) shows highlighted elements of parameterized data structures defining operations on them and reflecting algorithm logic. Each operation is tagged by a unique color. Special control lines allow referencing these colored areas as well as changing dynamically their sizes and placement. The key point is that elements in these areas are coloring not manually by a programmer, but automatically using MP-templates each of which specifies a particular principle depending on formal parameters.In this paper we describe an approach and tools to create and use MP-templates for movie-based programs. An MP-template is the major independent and self-sufficient component same as in conventional programming languages. A special visual technique is proposed for development of an optimal and correct MP-template for various possible parameters like placement coordinates, shape, order of scanning, etc. in order to decrease difficulties and time-consuming userpsilas actions. Also, a various handling concepts are introduced to manage the MP-templates library and use MP-templates in a movie-based programming process. A software toolkit implementing proposed features as well as usage examples will also be presented.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628090","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 Duplicate-Aware Data Replication","authors":"Jianfeng Zhu, Leihua Qin, Z. Dong, Zhou Jinli","doi":"10.1109/FCST.2008.34","DOIUrl":"https://doi.org/10.1109/FCST.2008.34","url":null,"abstract":"In this paper, we employ the data de-duplication technology to detect the duplicate data in the process of data replication. By avoiding duplicate data, data replication reduces the quantity of data transmission, and save the replication I/O bandwidth. In additional, the data consistency has been guaranteed in the same time. The work is a part of our project which is to build a wide-area disaster recovery system.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123845707","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":"Dynamic Spectrum Allocation MAC Protocol Based on Cognitive Radio for QoS Support","authors":"I. Joe, Seonbong Son","doi":"10.1109/FCST.2008.16","DOIUrl":"https://doi.org/10.1109/FCST.2008.16","url":null,"abstract":"To address inefficiency of the spectrum utilization and the limited available spectrum band, cognitive radio has emerged as a significant solution. In this paper, we propose a novel MAC protocol in multi-channel wireless networks by using dynamic spectrum allocation (DSA) based on cognitive radio for QoS support. According to the user request, variable spectrum is allocated for quality of service (QoS) guarantee through DSA mechanism. Dynamic spectrum allocation is implemented with the procedure of FRQ/FRP/ACK-hello over a control channel, DATA/ACK over allocated data channels. For cooperative detection, a hello message is exchanged periodically to enhance the spectrum sharing in our MAC protocol. In addition, the results of performance evaluation demonstrate that the proposed DSA-MAC protocol improves the throughput significantly, as compared to the IEEE 802.11 MAC.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724307","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 Invariant Pattern Recognition System Using the Bayesian Inference on Hierarchical Sequences with Pre-processing","authors":"Zunyi Tang, Wenlong Liu, Shuxue Ding","doi":"10.1109/FCST.2008.19","DOIUrl":"https://doi.org/10.1109/FCST.2008.19","url":null,"abstract":"The human being can understand real-world objects based on some kinds of invariable characteristics. Recently, a mathematical model for this has been proposed that is based on the Bayesian inference on hierarchical sequences by George, D. and Hawkins, J. (2004). It assumed that human brain cortex solves the invariance problem in a manner that is using a multi-hierarchical structure. When we applied the model to a line Drawing Recognition System (DRS), however, the performance was not as good as we had expected. This is especially the case when the hand input character is too small or too big. In this paper, we propose a method for improving this. Our method is based on a fact that human eyes are able to automatically focus on the object by its position, size, and lightness. That is, before the recognition, we perform a piece of pre-processing so that it can adjust the position, size and the lightness to make them most suitable for the recognition followed.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386790","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}
Dong Li, Liusheng Huang, Wei Yang, Youwen Zhu, Yonglong Luo, Zhili Chen, Lingjun Li, Y. Ye
{"title":"A Practical Three-Dimensional Privacy-Preserving Approximate Convex Hulls Protocol","authors":"Dong Li, Liusheng Huang, Wei Yang, Youwen Zhu, Yonglong Luo, Zhili Chen, Lingjun Li, Y. Ye","doi":"10.1109/FCST.2008.11","DOIUrl":"https://doi.org/10.1109/FCST.2008.11","url":null,"abstract":"Convex hulls problem is a special case of privacy-preserving geometry problem in the inquiry of secure multi-party computation. In the past, only in two-dimensional space privacy-preserving convex hulls have been investigated, and there is little focus in the three-dimensional space. However, three-dimensional privacy-preserving convex hulls can be applied in many fields, such as researching and exploration of the space, military, corporately finding the union range based on sensitive data from two parties. Approximate convex hulls have more advantages than conventional convex hulls in the theme of secure multi-party computation because it can hide the private points on the vertices. In this paper, we first present a practical privacy-preserving protocol to solve the three dimensional approximate convex hulls problem; we also discuss the correctness, security, and performance of our protocol.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129366932","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 Graph Based Risk Assessment Model for Network Information System","authors":"Xiaochun Xiao, Huan Wang, Gendu Zhang","doi":"10.1109/FCST.2008.26","DOIUrl":"https://doi.org/10.1109/FCST.2008.26","url":null,"abstract":"The risk assessment for network information system has experienced a stage from rule-based questionnaire investigation to model-based assessment. Many graph-based models have been proposed and applied to risk assessment. Attack Graph is widely used one. But attack graphs grow exponentially with the size of the network. In this paper, we propose a comprehensive framework for network vulnerabilities modeling and risk assessment by policy rules violations based on the access graph. As a complement to the attack graph approach, the access graph grows polynomially with the number of hosts and so has the benefit of scaling better to more practical, realistic size networks. This paper presents a novel risk assessment model for network information system based access graph. Compared with related works, our approach improves the performance and reduces the computational cost.","PeriodicalId":206207,"journal":{"name":"2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126558090","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}