{"title":"Behavourial Modeling in Mammography","authors":"Brian A. Hope","doi":"10.1109/CIT.2008.WORKSHOPS.78","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.78","url":null,"abstract":"An evolutionary autonomous agent approach to image feature extraction does provide a more effective means of searching an image environment, overcoming the potential combinatorial explosion experienced by more traditional image processing techniques. This approach is also suited to more difficult image processing tasks where the features being searched for are either not visible or not easily distinguishable by the human vision system. This paper proposes the development of an evolutionary based image processing application for mammography.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123386780","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":"Identification of Chinese Event and Their Argument Roles","authors":"Tan Hongye, Zhao Tiejun, Zheng Jiaheng","doi":"10.1109/CIT.2008.WORKSHOPS.54","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.54","url":null,"abstract":"Event detection and recognition is a major task in ACE evaluation plan. In this paper, we focus on solving the two subtasks: (1) event detection and classification, (2) their argument role identification. For the first subtask, the strategy of local feature selection and explicit discrimination of positive and negative features is used in order to ensure the performance of each type. For the second subtask, the approach based on multi-level patterns is presented in order to improve the coverage of patterns and to use various language information. Experiments on the ACE2005 corpus show that performance of the first subtask is satisfying with the 83.5% macro-average F1-measure. And experiments of the second subtask show that the method based on multi-level patterns is very promising.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124921121","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}
N. MirMotahhary, Y. Mafinejad, F. Atbaei, A. Kouzani
{"title":"An Adaptive Policy-Based Vertical Handoff Algorithm for Heterogeneous Wireless Networks","authors":"N. MirMotahhary, Y. Mafinejad, F. Atbaei, A. Kouzani","doi":"10.1109/CIT.2008.WORKSHOPS.109","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.109","url":null,"abstract":"The next generation of wireless networks is envisioned as convergence of heterogeneous radio access networks. Since technologies are becoming more collaborative, a possible integration between IEEE 802.16 based network and previous generation of telecommunication systems (2G, ..., 3G) must be considered. A novel quality function based vertical handoff (VHO) algorithm, based on proposed velocity and average receive power estimation algorithms is discussed in this paper. The short-time Fourier analysis of received signal strength (RSS) is employed to obtain mobile speed and average received power estimates. Performance of quality function based VHO algorithm is evaluated by means of measure of quality of service (QoS). Simulation results show that proposed quality function, brings significant gains in QoS and more efficient use of resources can be achieved.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824883","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 Effective Error Concealment for H.264/AVC","authors":"NamRye Son, S. Jeong","doi":"10.1109/CIT.2008.WORKSHOPS.106","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.106","url":null,"abstract":"To transmit video bit stream over low bandwidth such as mobile channel, high bit rate algorithm like H.264/AVC codec is exploited. In transmitting high compressed video bit-stream over low bandwidth, packet loss causes severe degradation in image quality. In this paper, a new error concealment algorithm for recovery of missing or erroneous motion vector is proposed. Considering that the missing or erroneous motion vectors in blocks are closely correlated with those of neighboring blocks. The proposed approach is that missing or erroneous motion vector is recovered by grouping the movements of neighboring blocks by their homogeneity. Motion vectors of neighboring block are grouped according to average linkage algorithm clustering and a representative value for each group is determined to obtain the candidate motion vector sets. As a test result, simulation results show that the proposed method dramatically improves complex time compared to existing H.264/AVC error concealment method. Also the proposed method is similar to existing H.264/AVC in terms of visual quality.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129678834","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":"Fire Surveillance System Using an Omni-directional Camera for Remote Monitoring","authors":"ByoungChul Ko, Hyun-Jae Hwang, In-Gyu Lee, J. Nam","doi":"10.1109/CIT.2008.WORKSHOPS.11","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.11","url":null,"abstract":"This paper proposes new video-based fire surveillance and remote monitoring system for real-life application. Most previous video-based fire detection systems using color information and temporal variations of pixels produce frequent false alarms due to the use of many heuristic features. Plus, they need several cameras to overcome the dead angle problem of a normal CCD camera. Thus, to overcome these problems, probabilistic models of fire are generated based on the fact that fire pixel values in consecutive frames change constantly and these models are applied to a Bayesian Networks to detect real fire from videos. In our system, we use an omni-directional camera instead of a normal CCD camera to remove the dead angle problem. After then, the fire region is captured by pan-tilt camera and transferred to cell phone for remote monitoring. The proposed system was successfully applied to various fire-detection tasks in real-world environments and effectively distinguished fire from fire-colored moving objects.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529285","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":"Sustaining Learners in WBT Environments through Service-Oriented Formative Assessment","authors":"I-Ching Chen, Shueh-Cheng Hu, Dong-Her Shih","doi":"10.1109/CIT.2008.WORKSHOPS.72","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.72","url":null,"abstract":"Web-based training gains popularity due to the pervasiveness of Web applications, abundant hyper media contents, and other attractive attributes. However, previous experience and research indicate that learners in Web-based learning environments tend to drop out when they lose orientation or have insufficient interaction with support providers during self-directed learning process. Formative assessment activities can not only identify weakness of learners, but also can provide guidance toward ultimate learning goals through interactions with learners. Various instructional resources have been designed to enrich e-learning context, and most of these resources are integrated proprietarily within Web-based learning platforms. The service oriented approach, which enables a more flexible way for architecting software systems, could be applied in a variety of domains, including those with the purpose of pedagogy. This research work aims to investigate a method of enhancing interactivity in Web-central learning environments by means of blending formative assessment services into instructional processes. A proof-of-concept prototype has been implemented and the preliminary usage shows that the interactions between self-directed learners and support-providers are critical to sustaining those learners as well as better learning achievements.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"100 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133085602","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":"Performance of Iris Based Hard Fuzzy Vault","authors":"E. Reddy, I. R. Babu","doi":"10.1109/CIT.2008.WORKSHOPS.20","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.20","url":null,"abstract":"Blend of cryptography and biometrics results an emerging architecture known as Crypto-biometrics which produces high level security. Fuzzy vault is a cryptographic construction used to store iris biometric templates which are binded by a random key extracted from same iris textures. Though the fuzzy vault provides better security, it is affected by cross matching, non uniform nature of biometric data. To overcome these limitations, we propose a scheme that hardens both fuzzy vault and secret key using password based on iris textures. By using password an additional layer of security is embedded to achieve high level security.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116897010","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 C4ISR Architecture Simulation Validation with UML and Object-Based Petri Nets","authors":"Xiaohui Bai","doi":"10.1109/CIT.2008.WORKSHOPS.61","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.61","url":null,"abstract":"C4ISR (command, control, communication, computer, intelligence, surveillance and reconnaissance) architecture is the important method to ensure the quality of system design. One method of C4ISR architecture validation is to transform the C4ISR architecture products to executable models. Through analyzing model execution process and result, the performance of C4ISR architecture can be tested. Based on the different advantage of UML (Unified Modeling Language) and Petri nets, the paper applies some kinds of views in UML to describe the relative C4ISR system architecture products. Considering the relationship among the products, the UML view of products is transformed to OPN (object-based Petri nets) simulation model according to the transformation rules. So the dynamic behavior of system can be displayed by those simulation model, and whether the relation of time-order, information flow and interface is reasonable, or the system function satisfies the military requirement , and the change of system state is correct, can be checked evidently. At last, the paper gives a case in the air defense system using simulation validation method proposed by it.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"358 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098004","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":"Finding Dependency Trees from Binary Data","authors":"Chaofeng Sha, Dao Tao, Aoying Zhou, Weining Qian","doi":"10.1109/CIT.2008.WORKSHOPS.92","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.92","url":null,"abstract":"Much work has been done in finding interesting subsets of items, since it has broad applications in financial data analysis, e-commerce, text data mining, and so on. Though the well-known frequent pattern mining attracted much attention in research community, recently, more work has been devoted to analysis of more sophisticated relationships among items. Chow-Liu tree and low-entropy tree, for example, were used to summarize the frequent patterns. In this paper, we consider finding a novel dependency tree from binary data. It has several advantages over previous related work. Firstly, we propose a novel distance measure between items based on information theory, which captures the expected uncertainty in the item pairs and the mutual information between them. Based on this distance measure, we present a simple yet efficient algorithm for finding the dependency trees from binary data. We also show how our new approach can find applications in frequent pattern summarization. Our running example on synthetic dataset shows that our approach achieves good results compared to existing popular heuristics.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114512190","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":"Using Semantic Web Technologies in Visualizing Medicinal Vocabularies","authors":"J. Puustjarvi, L. Puustjarvi","doi":"10.1109/CIT.2008.WORKSHOPS.19","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.19","url":null,"abstract":"The number of new medications and medicinal knowledge increases all the time. Further, as each drug has its unique indications, cross-reactivity, complications and costs also the management and dissemination of medication information becomes still more complex giving rise for potential medication errors. However, by utilizing the Semantic Web technologies in visualizing medication information this complexity can be alleviated in many ways. In this paper we report our work on developing an electronic medicinal vocabulary. It deviates from other medicinal vocabularies in that the terms and their relationships are graphically illustrated and additional queries can be made on the graphical presentation. The supported visualization format is a variation of the concept mapping.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126160815","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}