发布求助
文献互助 智能选刊 最新文献

2008 IEEE 8th International Conference on Computer and Information Technology Workshops最新文献

筛选
英文 中文
Packet Combining Scheme with Bit Oriented XORed of All Bits of Packet: An Idea 面向位的包的所有位的xor的包合并方案:一个想法
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.12
C. Bhunia
{"title":"Packet Combining Scheme with Bit Oriented XORed of All Bits of Packet: An Idea","authors":"C. Bhunia","doi":"10.1109/CIT.2008.WORKSHOPS.12","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.12","url":null,"abstract":"Packet combining scheme is a well defined simple error correction scheme with erroneous copies at the receiver. The scheme fails to correct errors when errors occur in the same bit locations of the erroneous copies. In some earlier works, several schemes such as multiple packet combining scheme (MPC) and packet reversed packet combining scheme (PRPC) that will correct error if occurs at the same bit location of the erroneous copies, are studied. A combined protocol of PRPC and MPC that offers higher throughput and better correction capability is studied elsewhere. In an earlier work, a simple scheme of XORed based mini packet combining scheme that will correct error(s) at the receiver is studied. In this paper we study a new scheme of XORed based full packet combining scheme. While the earlier scheme fits to correct only single bit error, the proposed scheme will correct up to multiple bit error.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"43 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":"131105021","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}
引用次数: 3
Advanced Binarization Method for Music Score Recognition Using Local Thresholds 基于局部阈值的高级二值化乐谱识别方法
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.101
Jaemyeong Yoo, Nguyen Dinh Toan, Deokjai Choi, Hyuk-Ro Park, Gueesang Lee
{"title":"Advanced Binarization Method for Music Score Recognition Using Local Thresholds","authors":"Jaemyeong Yoo, Nguyen Dinh Toan, Deokjai Choi, Hyuk-Ro Park, Gueesang Lee","doi":"10.1109/CIT.2008.WORKSHOPS.101","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.101","url":null,"abstract":"Application technology of mobile phone has been developing for the delivery of various contents over a simple voice channel. Music score recognition is one of such application services provided by mobile phone manufacturers which transform a music score taken by the phone camera into a midi file. For the successful recognition of the music score, the input image should be properly binarized to be fed into the recognition process. In this paper, Adaptive binary algorithm is proposed which exploits local thresholds with several levels to deal with illumination changes over the entire image. Experimental results shown advanced performance of music score recognition.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"41 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":"132164491","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}
引用次数: 3
The Checkpoint Interval Optimization of Kernel-Level Rollback Recovery Based on the Embedded Mobile Computing System 基于嵌入式移动计算系统的内核级回滚恢复检查点间隔优化
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.36
Zhan Zhang, Decheng Zuo, Y. Ci, Xiaozong Yang
{"title":"The Checkpoint Interval Optimization of Kernel-Level Rollback Recovery Based on the Embedded Mobile Computing System","authors":"Zhan Zhang, Decheng Zuo, Y. Ci, Xiaozong Yang","doi":"10.1109/CIT.2008.WORKSHOPS.36","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.36","url":null,"abstract":"Due to the limited resources of the embedded mobile computing systems, such as wearable computers, PDAs or sensor nodes, reducing the overhead of the software implemented fault tolerance mechanism is a key factor in reliability design. Two checkpoint interval optimization techniques of kernel level rollback recovery mechanism are discussed. Step checkpointing algorithm modulates checkpoint intervals on-line according to the characteristics of software or hardware environment-dependent system that the failure rate fluctuates acutely shortly after the system fails. Checkpoint size monitoring and threshold-control technique adjusts the checkpoint interval by predicting the amount of data to be saved. Combining these two techniques can effectively improve the performance of the embedded mobile computer system.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"6 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":"114400047","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}
引用次数: 9
Applying Particle Swarm Optimization to Prioritizing Test Cases for Embedded Real Time Software Retesting 应用粒子群算法对嵌入式实时软件重测测试用例进行优先排序
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.104
K. Hla, Young-Sik Choi, Jong Sou Park
{"title":"Applying Particle Swarm Optimization to Prioritizing Test Cases for Embedded Real Time Software Retesting","authors":"K. Hla, Young-Sik Choi, Jong Sou Park","doi":"10.1109/CIT.2008.WORKSHOPS.104","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.104","url":null,"abstract":"In recent years, complex embedded systems are used in every device that is infiltrating our daily lives. Since most of the embedded systems are multi-tasking real time systems, the task interleaving issues, dead lines and other factors needs software units retesting to follow the subsequence changes. Regression testing is used for the software maintenance that revalidates the old functionality of the software unit. Testing is one of the most complex and time-consuming activities, in which running of all combination of test cases in test suite may require a large amount of efforts. Test case prioritization techniques can take advantage that orders test cases, which attempts to increase effectiveness in regression testing. This paper proposes to use particle swarm optimization (PSO) algorithm to prioritize the test cases automatically based on the modified software units. Regarding to the recent investigations, PSO is a multi-object optimization technique that can find out the best positions of the objects. The goal is to prioritize the test cases to the new best order, based on modified software components, so that test cases, which have new higher priority, can be selected in the regression testing process. The empirical results show that by using the PSO algorithm, the test cases can be prioritized in the test suites with their new best positions effectively and efficiently.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"15 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":"114726163","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}
引用次数: 60
The Effect of MIMO Antenna Modes and Vehicle Speed on Channel Throughput of Mobile WiMAX for Multimedia Services MIMO天线模式和车辆速度对多媒体业务移动WiMAX信道吞吐量的影响
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.14
J. Mar, C. Ko, Shao-En Chen, Chung-Hao Li
{"title":"The Effect of MIMO Antenna Modes and Vehicle Speed on Channel Throughput of Mobile WiMAX for Multimedia Services","authors":"J. Mar, C. Ko, Shao-En Chen, Chung-Hao Li","doi":"10.1109/CIT.2008.WORKSHOPS.14","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.14","url":null,"abstract":"The radio coverage of 2.5 GHz mobile WiMAX for five different terrain categories, three antenna modes and 90% service reliability are estimated using a combination of COST-231 Hata and SUI Erceg models. Based on the planned cells, the call holding time in a given cell and channel throughput of the mobile WiMAX for multimedia services are simulated to observe the relationship among vehicle speed, antenna mode, and operation environment and channel throughput.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"124 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":"117114251","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}
引用次数: 1
CINETOON: A Semi-automated System for Rendering Black/White Comic Books from Video Streams 从视频流中渲染黑白漫画书的半自动系统
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.42
Dong-Sung Ryu, Soo-Hyun Park, Jeong-Won Lee, Do-Hoon Lee, Hwan-Gue Cho
{"title":"CINETOON: A Semi-automated System for Rendering Black/White Comic Books from Video Streams","authors":"Dong-Sung Ryu, Soo-Hyun Park, Jeong-Won Lee, Do-Hoon Lee, Hwan-Gue Cho","doi":"10.1109/CIT.2008.WORKSHOPS.42","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.42","url":null,"abstract":"In this paper we propose CINETOON, a semi-automated system which can generate black/white comic books from a sequence of video streams obtained from cinemas. CINETOON provides an intuitive interface to render comics. Our system consists of four major components : Key Frame Extractor, Image-based Comic Cut Converter, Background Effect Stylizer and Comic Elements Renderer. First, to capture the frame image from the video stream, we generate a workspace file which includes the frame images and script files. Second, the comic converter is decoupled into two processes: image binarization and stroke extraction. We introduce one novel black/white binarization algorithm for the frame images. Third, in order to segment foreground object, we propose a simple and straightforward algorithm implemented in the background effect stylizer. Also CINETOON provides some classes of shape-controllable icons such as word balloon, stylized fonts, speed line and specialized icons. The comic pages produced by our system show that CINETOON was so successful to make a comic book from a well-known cinema in a reasonable time and manual intervention.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"28 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":"126003129","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}
引用次数: 6
Voltage Emergence Prevention for Energy-Efficient Real-Time Task Synchronization 基于节能实时任务同步的电压紧急预防
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.114
Ya-Shu Chen, Tay-Jyi Lin
{"title":"Voltage Emergence Prevention for Energy-Efficient Real-Time Task Synchronization","authors":"Ya-Shu Chen, Tay-Jyi Lin","doi":"10.1109/CIT.2008.WORKSHOPS.114","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.114","url":null,"abstract":"This paper proposes an energy-efficient real-time synchronization protocol with voltage emergency prevention. The protocol locks the processor frequency in a proper way to avoid voltage emergency, and assigns tasks frequencies to minimize the energy consumption under real-time constraint. Extensive simulations were performed to provide insights. The energy consumption could be reduced up to 30% in the experiments, compared to the previous works.","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":"129934199","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}
引用次数: 2
Building Domain Independent Ontology for Web 2.0 构建面向Web 2.0的领域独立本体
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.103
E. Nyamsuren, Ho‐Jin Choi
{"title":"Building Domain Independent Ontology for Web 2.0","authors":"E. Nyamsuren, Ho‐Jin Choi","doi":"10.1109/CIT.2008.WORKSHOPS.103","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.103","url":null,"abstract":"In this paper we are proposing an information integration approach based on minimalist-upper ontology that can be applied among Web 2.0 applications. Instead of following conventional ontology engineering principles we are proposing to facilitate the use of collective intelligence, one of the major locomotives of Web 2.0, for the development of minimalist-upper ontology that can be shared among more specific domain ontologies thereby facilitating information exchange and integration.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"82 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":"132429457","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}
引用次数: 3
Web Services Composition with Incomplete QoS Information 具有不完整QoS信息的Web服务组合
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.13
Yanping Chen
{"title":"Web Services Composition with Incomplete QoS Information","authors":"Yanping Chen","doi":"10.1109/CIT.2008.WORKSHOPS.13","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.13","url":null,"abstract":"Web services composition becomes an ideal choice for enterprise level integration. This paper focuses on the problem of how to select the existed Web services so as to compose a complex service with incomplete QoS information constrains. We first proposed a model of composite service based on Markov process, and then a novel service composition algorithm was designed and implemented, which is built on the k-armed bandit theory to solve the service selection problem. Finally, we carried out extensive experiment on E-Wsframe to verify the solution proposed in the paper. Experimental results show that our method can ensure both the functions and QoS of composite services when selecting and composing Web services at runtime.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"212 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":"123286841","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}
引用次数: 4
Adaptive Similarity Measurement Using Relevance Feedback 使用相关反馈的自适应相似性测量
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.40
Chu-Hui Lee, Meng-Feng Lin
{"title":"Adaptive Similarity Measurement Using Relevance Feedback","authors":"Chu-Hui Lee, Meng-Feng Lin","doi":"10.1109/CIT.2008.WORKSHOPS.40","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.40","url":null,"abstract":"Content-based image retrieval (CBIR) is the core technology for many applications. Many researchers have interested in how to extract the important features in the image for the CBIR. However, different applications have their own emphasized image features. In this paper, we proposed a novel customized relevance feedback (RF) mechanism which can set adaptive weights of similarity measurement for each database image from the user feedback. Through this mechanism, we could analyze customized retrieval habit and standpoint to gauge proper features to adjust similarity measurement. System can improve the retrieval precision/recall, and make each user satisfied with retrieval results. Moreover, the experiments present improved ratio of precision (or recall) is notable.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"25 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":"121431245","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信