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

2008 International Conference on Advanced Computer Theory and Engineering最新文献

筛选
英文 中文
A Kind of Structural Differential Point of S-Graph Based on Betweenness Centrality 一类基于中间性中心性的s图结构差分点
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.106
Y. Diao, Jun Yu Li
{"title":"A Kind of Structural Differential Point of S-Graph Based on Betweenness Centrality","authors":"Y. Diao, Jun Yu Li","doi":"10.1109/ICACTE.2008.106","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.106","url":null,"abstract":"Using S-Graph(SG) to model the complex system,the complexity of system results in the complexity of SG, but it dose not change. So, we look for a new method to find its main places and edges. Based on betweenness centrality of place that are used to grasp the main structure of the complex SG (the main places), the structural differential point of SG based on betweenness centrality (SDPSG-BC) is developed, according to some rules, a new net system with the main places that betweenness centrality of places are greater than else places is constructed.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069403","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
The Establishment of an Integrated Management Model - An Experience in Taiwan Hospital 综合管理模式的建立——台湾医院的经验
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.194
Yu-Hua Yan, Shuo-fen Hsu, S. Fang, C. Kung
{"title":"The Establishment of an Integrated Management Model - An Experience in Taiwan Hospital","authors":"Yu-Hua Yan, Shuo-fen Hsu, S. Fang, C. Kung","doi":"10.1109/ICACTE.2008.194","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.194","url":null,"abstract":"In the present study, the secondary data analysis was utilized to evaluate the efficiency of the integrated management model (IMM) on the pap smear test for screening of the women's uterine cervical cancer. The data of female patients receiving a pap smear test were collected both before (from July to December, 2006) and after (from January to June, 2007) inducing the IMM in a regional hospital in Tainan. The result revealed an increment of participation rate from 2.792% to 3.389% among the female patients in the OPD (out-patient department) ( test, p=0.000). Although, the post-IMM participation rate was still much lower than that of general hospital data in Taiwan. Since IMM has been proved efficacious for the management of various diseases, there should be some problems in our IMM for the female uterine cervical cancer's prevention and management. Studies on those influencing factor should be soon carried out, and strategy for resolution of such problems should be soon designed and documented, we decided.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"15 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125626367","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
JPEG Image Steganalysis Improvement Via Image-to-Image Variation Minimization 通过图像到图像的变化最小化改进JPEG图像隐写分析
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.94
Chiew Kang Leng, J. Pieprzyk
{"title":"JPEG Image Steganalysis Improvement Via Image-to-Image Variation Minimization","authors":"Chiew Kang Leng, J. Pieprzyk","doi":"10.1109/ICACTE.2008.94","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.94","url":null,"abstract":"In this research, we introduce an approach to enhance the discriminative capability of features by employing image-to-image variation minimization. In order to minimize image-to-image variation, we will estimate the cover image from the stego image by decompressing the stego image, transforming the decompressed image and re compressing back. Since the effect of the embedding operation in an image steganography is actually a noise adding process to the image, applying these three processes will smooth out the noise and hence the estimated cover image can be obtained.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121089818","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
Fast Fractal Image Compression Base on Block Property 基于分块特性的快速分形图像压缩
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.195
C. Kung, W. Yang, C. Ku, C.Y. Wang
{"title":"Fast Fractal Image Compression Base on Block Property","authors":"C. Kung, W. Yang, C. Ku, C.Y. Wang","doi":"10.1109/ICACTE.2008.195","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.195","url":null,"abstract":"Fractal image compression is promising both theoretically and practically. The encoding speed of the traditional full search method is a key factor rendering the fractal image compression unsuitable for real-time application. The primary objective of this paper is to investigate the comprehensive coverage of the principles and techniques of fractal image compression. In this paper, the novel image quality index (structure similarity, SSIM) and block property classifier employed for the fractal image compression is investigated. Experimental results show that the scheme speeds up the encoder 10 times faster and the visual effect is better in comparison to the full search method.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126570826","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}
引用次数: 21
A New Approach for Image Encryption Using Chaotic Logistic Map 一种基于混沌逻辑映射的图像加密新方法
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.177
M. Sabery, M. Yaghoobi
{"title":"A New Approach for Image Encryption Using Chaotic Logistic Map","authors":"M. Sabery, M. Yaghoobi","doi":"10.1109/ICACTE.2008.177","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.177","url":null,"abstract":"In this paper, a new method is proposed for image encryption based on a chaotic maps. Replacing the image pixels and changing the gray level values used simultaneously. First, a chaotic logistic map system used to shuffling pixels then the gray level values changed using same orbit. Initial condition of the system choosed using a 80 bit secret key. Experimental results show that the method is resistive via common attacks. The entropy obtained from this method is 7.9975 that is very close to 8 a ideal value.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125804966","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}
引用次数: 34
Bridging Hierarchical Ontologies for Interoperability and Query Reformulation 桥接互操作性和查询重构的层次本体
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.212
M. Safyan, S. Khan, K. Latif, A. Masood
{"title":"Bridging Hierarchical Ontologies for Interoperability and Query Reformulation","authors":"M. Safyan, S. Khan, K. Latif, A. Masood","doi":"10.1109/ICACTE.2008.212","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.212","url":null,"abstract":"Ontology merging and integration is a collaborative process. We overcome the traditional integration approaches and propose bridge ontology architecture to cope with representational heterogeneity among ontologies for interoperability. It handles all the possible complications of relationships among the ontologies during matching and mapping phases. Proposed architecture accommodates class-based, relation-based, instances-based, and composite-based mapping. We also propose an approach to prioritize the relationships to improve the performance during mapping process. Proposed architecture is a generic solution and can be used to interoperate ontologies as a standard.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072916","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
Greedy-Algorithm of KSORD Supporting Multi-language Phrase Recognition 支持多语言短语识别的KSORD贪婪算法
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.38
Peng Li, Qing Zhu, Chao Tian, Shan Wang
{"title":"Greedy-Algorithm of KSORD Supporting Multi-language Phrase Recognition","authors":"Peng Li, Qing Zhu, Chao Tian, Shan Wang","doi":"10.1109/ICACTE.2008.38","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.38","url":null,"abstract":"With the rapid development of information retrieval technology and daily increasing information in the Internet, common users can retrieve many text-based database and get part of the information through the search engines such as Google, and Baidu. However, there is a great amount of data contained in the background relational database of web pages. So there are many researches focusing on the search in these relational database with keywords, compared with these researches, our algorithms are mainly based on bags using the greedy algorithms and supporting the phrase recognition by utilizing multiple dictionaries. We make a comparison between our algorithm and the existing ones. The experiment results shows that our algorithm owns not only the feature of effectiveness but also the feature of efficiency.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112388","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
Implementing an ACO Routing Algorithm for AD-HOC Networks AD-HOC网络中蚁群算法的实现
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.175
M. Golshahi, M. Mosleh, M. Kheyrandish
{"title":"Implementing an ACO Routing Algorithm for AD-HOC Networks","authors":"M. Golshahi, M. Mosleh, M. Kheyrandish","doi":"10.1109/ICACTE.2008.175","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.175","url":null,"abstract":"A mobile ad-hoc network is a set of mobile nodes that communicate with each other through the airwave. These networks have a high flexibility and have no central infrastructure or supervisor. In this type of networks, the topology is in change always, and the important problem in them is finding the path between source and destination. In this paper, we introduce a multi path hybrid routing algorithm for mobile ad-hoc networks. This algorithm is based on swarm intelligence algorithms and ant colony optimization (ACO), particularly. By mapping arithmetic and engineering problems on to biological societies, these methods attempt to solve the problems. In the presented algorithm, the number of neighbors of a node has been used to select the next hop. This algorithm is efficient and scalable and has a high adaptability. We introduce this algorithm as Node Neighbor Number Algorithm (NNNA).","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121436069","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}
引用次数: 14
Metagraph-Based Substructure Pattern Mining 基于元图的子结构模式挖掘
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.100
D. Gaur, A. Shastri, R. Biswas
{"title":"Metagraph-Based Substructure Pattern Mining","authors":"D. Gaur, A. Shastri, R. Biswas","doi":"10.1109/ICACTE.2008.100","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.100","url":null,"abstract":"The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. Graph based data mining has become quite popular in the last few years. In this paper author presented Metagraph based data mining as a new approach in the field of traditional graph based mining. Metagraph is a new graph theoretic construct having set-to-set mapping in place of node to node as in conventional graph structure. We investigate new approaches for frequent Metagraph-based pattern mining in Metagraph datasets. We propose an algorithm for metagraph graph-based Substructure pattern mining which discovers frequent substructures without candidate generation. We apply a new lexicographic order for metagraphs, and map each sub metagraph to a unique minimum DFS code as its canonical label. Based on this lexicographic order. We develop an algorithm which adapts the depth-first search strategy to mine frequent connected submetagraph efficiently.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127863478","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}
引用次数: 47
The LGR Method for Task Scheduling in Computational Grid 计算网格中任务调度的LGR方法
2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI: 10.1109/ICACTE.2008.24
N. J. Navimipour, L.M. Khanli
{"title":"The LGR Method for Task Scheduling in Computational Grid","authors":"N. J. Navimipour, L.M. Khanli","doi":"10.1109/ICACTE.2008.24","DOIUrl":"https://doi.org/10.1109/ICACTE.2008.24","url":null,"abstract":"In the grid systems, scheduling is a major issue in their operation, which is also an important problem in other area such as manufacturing, process control, economics, operation research and, etc. One motivation of grid computing is to aggregate the power of widely distributed resources, and provi.de non-trivial services to users. To achieve this goal, an efficient grid scheduling system is an essential part of the grid.This paper presents and evaluates a new method for task scheduling in grid computing systems to minimize its execution time. With regard to that this problem is a NP-Hard problem; so the evolutionary algorithms are the best choice for solving this problem. In this paper, contrary to prior ways, the new string representation and crossover operator has been used, communication costs hasn't been ignored and presents as a major factor for reaching to optimum solution.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516784","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}
引用次数: 25
首页 上一页 下一页 尾页
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学术官方微信