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

ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.最新文献

筛选
英文 中文
An adaptive migratory home protocol for software DSM systems 软件DSM系统的自适应迁移家园协议
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503122
Chang-Yi Lin, Jiazheng Zhou, Yeh-Ching Chung
{"title":"An adaptive migratory home protocol for software DSM systems","authors":"Chang-Yi Lin, Jiazheng Zhou, Yeh-Ching Chung","doi":"10.1109/ITRE.2005.1503122","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503122","url":null,"abstract":"In software distributed shared memory systems, home-based protocols are very good designs because of easy implementation, little memory overheads and good performance. The home-based protocols can be divided into two categories, the fix home protocol and the migratory home protocol. The fix home protocol produces less number of page faults than the migratory home protocol. The migratory home protocols can save the number of diff creating and diff propagation. For an application program, its execution behavior is suitable for the fixed home protocol in some time periods and is suitable for the migratory home protocol in some other time periods. A protocol that can be adapted between the fixed home protocol and the migratory home protocol is important for the performance of an application program. In this paper, we proposed an adaptive migratory home protocol, which combines the advantages of the fixed home and the migratory home protocols. In the adaptive migratory home protocol, the home node of a page can change the state of the page according the application behavior. To evaluate the adaptive migratory home protocol, we have implemented the proposed protocol along with the home-based protocol and the migratory home protocol. We tested eight application programs for the three protocols on the same platform. The experimental result shows that the home-based protocol works well for applications with sharing access pattern. The migratory home protocol has good performance for migratory access pattern. The performance of the adaptive migratory home protocol is in between these two protocols and performs well for most of the applications.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124544599","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}
引用次数: 0
Structure learning of Bayesian networks using a semantic genetic algorithm-based approach 基于语义遗传算法的贝叶斯网络结构学习
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503164
S. Shetty, Min Song
{"title":"Structure learning of Bayesian networks using a semantic genetic algorithm-based approach","authors":"S. Shetty, Min Song","doi":"10.1109/ITRE.2005.1503164","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503164","url":null,"abstract":"A Bayesian network model is a popular technique for data mining due to its intuitive interpretation. This paper presents a semantic genetic algorithm (SGA) to learn a complete qualitative structure of a Bayesian network from a database. SGA builds on recent advances in the field and focuses on the generation of initial population, crossover, and mutation operators. Particularly, we introduce two semantic crossover and mutation operators that aid in faster convergence of the SGA. The crossover and mutation operators in SGA incorporate the semantic of the Bayesian network structures to learn the structure with very minimal errors. SGA has been proved to perform better than existing classical genetic algorithms for learning Bayesian networks. We present empirical results to prove the fast convergence of SGA and the predictive power of the obtained Bayesian network structures.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115692156","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}
引用次数: 15
GC* -tree: a generic index for perceptual similarity search GC* -tree:用于感知相似性搜索的通用索引
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503092
S. Sheu, Jia-Rong Wu
{"title":"GC* -tree: a generic index for perceptual similarity search","authors":"S. Sheu, Jia-Rong Wu","doi":"10.1109/ITRE.2005.1503092","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503092","url":null,"abstract":"Similarity search is an intuitive, easy-to-use function, indispensable for MM DBMS. Myriad heuristics were exploited to faithfully represent MM objects for efficient search engine designs. However, the demand to incorporate more representative features for generality incurs great challenge to search speed improvement. A simple linear scan can often outperform many elaborate designs. Particularly, most distance metrics used barely certify perceptual similarity due to contamination of irrelevant features. Alternative non-metric distance functions to selectively choose a dynamic proper subset of holistic features, despite better perceptual accuracy offered, would create non-uniformity against indexing. In this paper, we propose a generic index structure and its supportive search algorithm to attain both accuracy and speed for perceptual similarity search. The idea is to confine the true perceptual distance within the range specified by the upper/lower bound functions we developed. This allows effective pruning and dramatic search time reduction in our solution, which achieves 44% performance gain over linear scan.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128184408","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
Blind inverse halftoning via hybrid denoising and estimation 基于混合去噪和估计的盲反半调
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503093
Haihong Zheng, Ping Zeng, Yueping Kong
{"title":"Blind inverse halftoning via hybrid denoising and estimation","authors":"Haihong Zheng, Ping Zeng, Yueping Kong","doi":"10.1109/ITRE.2005.1503093","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503093","url":null,"abstract":"By using the advantages of denoising and estimation method, a blind inverse halftoning algorithm is proposed .It is called blind since we do not require the knowledge of the halftone kernel. The proposed scheme first designs a denoising preprocessor based on the edge measure (EM) of noisy halftone and an initial estimate is achieved with the preprocessor. Then using edge-preserving Huber Markov random field model, the initial estimate is updated via MAP estimation. A fast matrix operation estimation method is developed to accelerate the process. Distinct features of the proposed approach include efficient edge preserving ability while smoothing the halftone patterns, an excellent PSNR performance with comparable low time complexity and memory buffer.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132838558","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
Teachers' online professional development learning persistence and interaction perception 教师在线专业发展、学习持久性与互动感知
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503142
L. Chen, Hsieng-Cheng Tseng, Chi-Hui Lin
{"title":"Teachers' online professional development learning persistence and interaction perception","authors":"L. Chen, Hsieng-Cheng Tseng, Chi-Hui Lin","doi":"10.1109/ITRE.2005.1503142","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503142","url":null,"abstract":"The purposes of this study were to investigate types of interaction that teachers perceived to be important for professional development online learning and to determine the impact of interaction attributes on teacher persistence. The study concluded that teacher considered all types of interaction are important for teacher professional development online learning and teachers' perception of content interaction in the online course was correlated to course persistence.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122533027","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
Soft computing approach to steganalysis of LSB embedding in digital images 数字图像中嵌入LSB的隐写分析方法
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503077
Ryan G. Benton, Henry Chu
{"title":"Soft computing approach to steganalysis of LSB embedding in digital images","authors":"Ryan G. Benton, Henry Chu","doi":"10.1109/ITRE.2005.1503077","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503077","url":null,"abstract":"Steganography methods embed hidden data in digital images to provide a means of secret communication. Steganalysis methods detect such embedded data based on statistical analysis of a digital image. We experimented with using decision trees for detecting messages hidden in the least significant bit plane of an image and compared their results to those obtained using multilayered feedforward neural networks.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123902183","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}
引用次数: 16
Robust image hashing based on SPIHT 基于SPIHT的鲁棒图像哈希
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503078
Shih-Hsuan Yang, Chin-Feng Chen
{"title":"Robust image hashing based on SPIHT","authors":"Shih-Hsuan Yang, Chin-Feng Chen","doi":"10.1109/ITRE.2005.1503078","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503078","url":null,"abstract":"Media hashing is an important resolving skill of copyright infringement. In this paper, a novel robust image hashing scheme is proposed. The set partitioning in hierarchical trees (SPIHT) algorithm, widely employed in image compression, is used to extract the identification information of images. The sorting pass of SPIHT records the spatial distribution of significant wavelet coefficients, termed the significance map. We build the hash values from the significance maps and the associated autocorrelograms. To verify the robustness of the proposed methods, experiments are conducted on the Stir mark benchmarking system. The proposed hash sequence in autocorrelogram achieves good performance with reasonable complexity.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122586254","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}
引用次数: 17
Hierarchical distance-based clustering for interactive VRML traversal patterns 交互式VRML遍历模式的基于层次距离的聚类
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503171
Shao-Shin Hung, Jin-Lin Hou, Wei Feng Huang, D. Liu
{"title":"Hierarchical distance-based clustering for interactive VRML traversal patterns","authors":"Shao-Shin Hung, Jin-Lin Hou, Wei Feng Huang, D. Liu","doi":"10.1109/ITRE.2005.1503171","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503171","url":null,"abstract":"Since massive objects are stored in the storage systems, and may be scattered, this situation increases the search time to access the objects. However, traditional VRML system never considers the problem of how to reduce access times of objects in the storage systems. Meanwhile, clustering methodology is particularly appropriate for the exploration of interrelationships among objects to cut down the access time. Besides, we introduce the relationship measures among traversal paths, views and objects. Based on these relationship measures, the clustering algorithm will determine how to cluster and the optimal physical organization of those VRML objects on disks. In addition, we suggest two clustering criteria - intra-pattern similarity matrix and inter-pattern distance table. Our experimental evaluation on the VRML data set shows that our algorithm doesn't only significantly cut down the access time, but also enhance the accuracy of data prefetch.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132766215","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
A challenge to the GUI-centric paradigm of information education for the general public 对以gui为中心的大众信息教育范式的挑战
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503170
Chao-Kuei Hung, Yen-Liang Shen
{"title":"A challenge to the GUI-centric paradigm of information education for the general public","authors":"Chao-Kuei Hung, Yen-Liang Shen","doi":"10.1109/ITRE.2005.1503170","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503170","url":null,"abstract":"We contrast the current paradigm of information education for the general public with that of mathematics and of foreign languages. This contrast exposes the questionable mentality, in IT education, of emphasizing ease of use at the cost of life-span of knowledge and the combinatorial nature of knowledge. We propose for educators to carefully choose only software tools that conform to the longevity and combine-ability criteria. This includes insisting on teaching technologies that are cross-platform and support open interfaces. The prevalent view of information technology as a field of commerce is identified as a possible source of confusion and the free/libre/open source software movement as a possible cure. GUI and ease of use are more clearly seen as convenience and help, instead of the main body of knowledge when we constantly remind ourselves of the analogy. Hopefully investment in future IT education for the general public will have longer term effectiveness and produce the combinatorial explosion effect as we see in other fields of education.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134621338","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
Combinatorial model and aspect-oriented extension of architecture description language 组合模型和体系结构描述语言的面向方面的扩展
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503123
Jingjun Zhang, Zhang Yang, Furong Li
{"title":"Combinatorial model and aspect-oriented extension of architecture description language","authors":"Jingjun Zhang, Zhang Yang, Furong Li","doi":"10.1109/ITRE.2005.1503123","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503123","url":null,"abstract":"Component-based software development approach is one of the most promising solutions for the emerging high development cost, low productivity, unmanageable software quality and high risk. This approach, however, encounters some problems about unseparated crosscutting concerns that are easy to lead to the code-tangling and code-scattering. Aspect-oriented programming enables the handling of crosscutting concerns and implements the separation of concerns. It will help to understand the software system better and strengthen the adaptability, maintainability and reusability of the final software. This paper defines the aspect model at first, and then the static and dynamic combinatorial semantic between component and aspect are described. The definition is an extension of traditional architecture model. Based on the definition, we extend the XADL by introducing the aspect, which enhances the nonfunctional properties description capability of ADL. Furthermore, using the ATM system as an example, we illustrate how to describe the system with the label we defined.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134065819","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信