{"title":"Notice of Violation of IEEE Publication PrinciplesA study of relevance feedback on retrieved documents in vector-space-modeled system","authors":"Zhang Ruiling, Xu Hongsheng, Li Yanfei","doi":"10.1109/ICCSIT.2008.40","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.40","url":null,"abstract":"Relevance feedback is one of the techniques applied in a vector-space-modeled information retrieval system to enhance retrieval effectiveness. The feedback process usually has the user rate the documents retrieved as relevant or non-relevant. Most past studies apply the information of document relevance to the modification of the vector that is used to manifest the user's information interest. In this study, we have identified additional information obtained from relevance feedback that was not fully studied in the past from the rated relevant/non-relevant documents for application. The information pertains to is about the situations of term appearances in the relevant/non-relevant documents. We have developed a method together with an IR system to demonstrate the application of the information of term appearance situation. Experiments have also been conducted to study its effect. The experimental results preliminarily show that the information of the term appearance situation could be extracted and appropriately applied to enhance retrieval effectiveness.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750973","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":"MRI Head Space-based Segmentation for Object Based Volume Visualization","authors":"Zhen Zheng, Xie Mei","doi":"10.1109/ICCSIT.2008.59","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.59","url":null,"abstract":"Brain image 3D reconstruction and segmentation is one important part of it, and plays a critical role in computer vision of brain, functional analysis in brain and clinical application. The paper illustrates some wide-prevailed 3D reconstruction method applied to brain image and a method of combining ray-casting with segmentation. We describe a method applied to one implementation of space-based segmentation, which shows the region of interest (ROI) that can help clinicians detect and evaluate segmentation.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693443","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-Jae Kang, Chei-Yol Kim, Kangho Kim, Sung-In Jung
{"title":"Proportional Disk I/O Bandwidth Management for Server Virtualization Environment","authors":"Dong-Jae Kang, Chei-Yol Kim, Kangho Kim, Sung-In Jung","doi":"10.1109/ICCSIT.2008.77","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.77","url":null,"abstract":"Many virtual machines are operated concurrently on a same physical machine. And service running on each virtual machine has different I/O requirement and priority. But, we can't guarantee that it has proper I/O bandwidth, because the I/O of virtual machine is treated as that of a process in normal system and there is no means to manage the I/O bandwidth for virtual machine. Therefore, we are hard to allocate I/O bandwidth to several virtual machines equally or discriminately. To solve the upper described problems, we propose a virtual machine-aware proportional share queuing scheduler, VM-PSQ, in server virtualization environment. To do that, we designed virtual machine unit scheduler and adopted the concept of time slice and schedule token to support the proportional share of I/O bandwidth. It recognizes each virtual machine I/O as independent system I/O. It enables us to allocate I/O bandwidth among many virtual machines equally or discriminately according to service priority or I/O requirement. This can make a good use of limited I/O bandwidth and guarantee the performance of specific virtual machine.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127439685","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 Efficient and Provably-Secure Identity-based Signcryption Scheme for Multiple PKGs","authors":"Zhengping Jin, Huijuan Zuo, Hongzhen Du, Q. Wen","doi":"10.1109/ICCSIT.2008.65","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.65","url":null,"abstract":"In this paper, based on the scheme proposed by Barreto et al in ASIACRYPT 2005, an identity-based signcryption scheme in multiple private key generator (PKG) environment is proposed, which mitigates the problems referred to users' private keys escrow and distribution in single PKG system. For security of the scheme, it is proved to satisfy the properties of message confidentiality and existential signature-unforgeability, assuming the intractability of the q-strong Diffie-Hellman problem and the q-bilinear Diffie-Hellman inversion problem. For efficiency, compared with the state-of-the-art signcryption schemes of the same kind, our proposal needs less pairing computations and is shown to be the most efficient identity-based signcryption scheme for multiple PKGs up to date.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122653437","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":"The Two-Level-Turn-Model Fault-tolerant Routing Scheme in Tori with Convex Faults","authors":"Lingfu Xie, Du Xu, Qing Yao, Lei Song","doi":"10.1109/ICCSIT.2008.86","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.86","url":null,"abstract":"In this paper, we would present a fault-tolerant wormhole routing scheme, called two-level-turn-model scheme, in the tori with convex faults. The reason why we choose the convex faults is that the shape of the convex faults is instrumental to design an effective fault-tolerant routing algorithm. Compared with many other solutions, which mainly focus on providing extra virtual channels to tolerate the faults, one of the advantages of our solution is that it is based on the turn model, which itself could tolerate some faults for some messages. At the same time, our solution could work effectively no matter where the fault region locates and no matter whether the fault regions are connected. In our solution, two patterns of the turn model are complementary to tolerate the faults. With a few limits to the shape of the convex faults, at most five virtual channels per physical channel are required to avoid the deadlock.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847776","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}
K. Khan, R. Zaman, A. V. Reddy, K. Reddy, T. S. Harsha
{"title":"An Efficient Destination Sequenced Distance Vector Routing Protocol for Mobile Ad Hoc Networks","authors":"K. Khan, R. Zaman, A. V. Reddy, K. Reddy, T. S. Harsha","doi":"10.1109/ICCSIT.2008.122","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.122","url":null,"abstract":"One of the popular wireless network architectures is mobile Ad Hoc Network (MANET) which can be deployed easily in almost any environment, without any underlying backbone and infrastructure support. The MANET Nodes (Routers and Hosts) can move randomly and re-organize themselves into an arbitrary network. In this paper, an efficient DSDV (Eff-DSDV) Protocol is proposed for Ad Hoc networks. Eff-DSDV overcomes the problem of stale routes, and thereby improves the performance of standard DSDV. The proposed protocol has been implemented in the NCTUns Simulator and performance comparison has been made with conventional DSDV using performance metrics like packet-delivery ratio, end-end delay, dropped packets, routing overhead. It has been found from the analysis that the performance of Eff-DSDV is superior to regular DSDV.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129764030","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":"Static Checking by Means of Abstract Interpretation","authors":"K. Musumbu","doi":"10.1109/ICCSIT.2008.10","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.10","url":null,"abstract":"Dynamic checking are usually easier to use, because the concept are established and wide well know. But they are usually limited to systems whose state space is finite. In an other part, certain faults cannot be detected dynamically, even by keeping track of the history of the state space. Indeed, the classical problem of finding the right test cases is far from trivial and limit the abilities of dynamic checkers further. Static checking have the advantage that they work on a more abstract level than dynamic checker and can verify system properties for all inputs. Problem, it is hard to assure that a violation of a modeled property corresponds to a fault in the concrete system. We propose an approach, in which we generate counter-examples dynamically using the abstract interpretation techniques.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129927729","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}
Xuepeng Wang, Tiemin Ma, Yan Yan, Qiu-yu Zhang, Y. Liu
{"title":"The Research of Conflict-Detection Algorithm of Concurrency Control Based on Rough Set","authors":"Xuepeng Wang, Tiemin Ma, Yan Yan, Qiu-yu Zhang, Y. Liu","doi":"10.1109/ICCSIT.2008.32","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.32","url":null,"abstract":"Concurrency control is one of the key factors in computer supported cooperative work. Through researching conflict of concurrency control mechanism and CSCW, this paper introduces the rough set into the conflict-detection, and forms a new algorithm idea. Also, the paper analysis the feasibility of the new algorithm and gives an example.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130364639","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 Quick Development Framework Based on Process/Data Relationship Model","authors":"N. Chen","doi":"10.1109/ICCSIT.2008.107","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.107","url":null,"abstract":"This paper proposes a novel quick development framework based on process/data relationship model (PDRM). With support of PDRM, requirement is described and refined, then transformed into prototype that can provide lively experience for customers, making customers probe system and discover deficiency as early as possible. Once deficiency is discovered, customers can amend requirement and rebuild PDRM, thus business process is evolved. Finally a simple case study is provided to demonstrate how to use PDRM.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130542159","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}
Li Dan-mei, Zhou Hui, Lan Wei-Chun, Shao Shi-huang
{"title":"A Fuzzy Discrete Event System Approach for Air Conditioning System Control","authors":"Li Dan-mei, Zhou Hui, Lan Wei-Chun, Shao Shi-huang","doi":"10.1109/ICCSIT.2008.162","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.162","url":null,"abstract":"Air conditioning (AC) system is a nonlinear, asynchronous and uncertain natured system. In this paper a fuzzy discrete event systems (FDES) is introduced in the research of air conditioning control. A fuzzy automaton for air conditioning system is given. A modeling method is proposed and a control model has been set up for the air conditioning system. Cost optimization is based on set up priorities in events combination and effectiveness function optimization is based on forward-looking tree. The simulation results show that the optimal control can be better resolved with FDES in air conditioning system. Practically application of this method is observed reduce in energy consumption of the system.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130620150","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}