Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)最新文献

筛选
英文 中文
Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data 水平分区数据保护隐私的ID3算法
Mingjun Xiao, K. Han, Liusheng Huang, Jingyuan Li
{"title":"Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data","authors":"Mingjun Xiao, K. Han, Liusheng Huang, Jingyuan Li","doi":"10.1109/GCC.2006.73","DOIUrl":"https://doi.org/10.1109/GCC.2006.73","url":null,"abstract":"For the problem of decision tree classification with privacy concerns, we propose several efficient secure multi-party computation protocols to construct a privacy preserving ID3 algorithm over horizontally partitioned data among multiple parties. Our algorithm presents the first solution to privacy preserving decision tree classification among more than two parties. We also make a performance comparison with the existing solution, which is only applicable to the twoparty case. The result shows that our solution has a significantly better performance.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121233622","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}
引用次数: 65
A Run-Time Scheduling Policy for Dependent Tasks in Grid Computing Systems 网格计算系统中依赖任务的运行时调度策略
Hui Jin, Yanxiang He, Weidong Wen, Haowen Liu
{"title":"A Run-Time Scheduling Policy for Dependent Tasks in Grid Computing Systems","authors":"Hui Jin, Yanxiang He, Weidong Wen, Haowen Liu","doi":"10.1109/PDCAT.2005.44","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.44","url":null,"abstract":"This paper presents a run-time scheduling policy to map tasks to resources in grid computing systems based on Multi-Agent System (MAS). This policy schedules tasks in run-time and avoids the waste of resources. A simulation result is presented to prove the availability of this policy.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127365608","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
An Agent-Based Deadlock Detection/Resolution Algorithm for the AND Model 基于agent的AND模型死锁检测/解决算法
Xin Cheng, Xiaozong Yang, F. Jin
{"title":"An Agent-Based Deadlock Detection/Resolution Algorithm for the AND Model","authors":"Xin Cheng, Xiaozong Yang, F. Jin","doi":"10.1109/PDCAT.2005.68","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.68","url":null,"abstract":"Previous edge-chasing Deadlock Detection algorithms for Distributed Data Base systems (DDBS) have the n steps time limitation to detect a deadlock cycle of size n in the wait-for graph (WFG). This paper proposes an agent based edge-chasing algorithm to speed up the detection process. The blocked nodes in our algorithm know their predecessors and successors simultaneously, enables they find the cycle of size 2 locally and the cycle of size n in n-2 (nge2) steps. The detection agents are assigned the originator’s priority to decrease the detection overhead, and they are forwarded or discarded momentarily to avoid the false detection. Our algorithm is built on an AND model, a retreat-inform scheme is adopted to deal with the cycle overlap problem. The correctness of the algorithm is formally proven by the invariant verification technique.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262972","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
A Window-based Algorithm for Skyline Queries 基于窗口的Skyline查询算法
Jing Yu, Xin Liu, Guo-hua Liu
{"title":"A Window-based Algorithm for Skyline Queries","authors":"Jing Yu, Xin Liu, Guo-hua Liu","doi":"10.1109/PDCAT.2005.58","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.58","url":null,"abstract":"Given a set of points, the skyline comprises the points that are not dominated by other points. A point dominates another point if it is as good or better in all dimensions and better in at least one dimension. Skyline queries are important for several database applications, including customer information systems, decision support, and data visualization. In this paper we propose a window-based algorithm for skyline queries, which transforms skyline queries into many different dynamic window queries. Though the first window query we get the first skyline point, then we only need to search the points in the valid region we defined, so it is not necessary to retrieve all the points in the space and prune query space effectively and significantly. The window queries only visit the possible skyline points, and only visit each point once, the number of the accessed data points decreases significantly, the query result is sound and complete.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123745112","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
Gabor Filterbank and Its Application in the Fingerprint Texture Analysis Gabor滤波器组及其在指纹纹理分析中的应用
Yang Xu, Xuedong Zhang
{"title":"Gabor Filterbank and Its Application in the Fingerprint Texture Analysis","authors":"Yang Xu, Xuedong Zhang","doi":"10.1109/PDCAT.2005.144","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.144","url":null,"abstract":"The algorithm of fingerprint feature extraction based on using Gabor filterbank is proposed in order to overcome the drawback of traditional minutiaebased. Through studying texture information of fingerprint image and analyzing the reason of Gabor filterbank applied to texture, the model of Gabor filter was established. A quick and simple method of center point searching is presented. The result of comparison experiment shows the validity of Gabor-based.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720745","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}
引用次数: 12
JSChord: A Peer-to-Peer System to Achieve Max Throughput JSChord:实现最大吞吐量的点对点系统
Yifeng Shao, Feng Hong, Minglu Li
{"title":"JSChord: A Peer-to-Peer System to Achieve Max Throughput","authors":"Yifeng Shao, Feng Hong, Minglu Li","doi":"10.1109/PDCAT.2005.159","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.159","url":null,"abstract":"The variance of job size is a significant factor for designing peer-to-peer system which leads to the born of JSChord(Job Size based Chord). JSChord is a peerto- peer overlay constructed on Chord aimed to exploit the variance of job size. The fundamental idea of JSChord is to group several Chord rings together to distribute the jobs according to their size. JSChord has achieved better performance than Chord with its special routing algorithm as shown in the simulation.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115054428","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
Coalgebraic Component Specification and Verification in RSL RSL中的共代数组件规范与验证
S. Meng, B. Aichernig, Zhang Naixiao
{"title":"Coalgebraic Component Specification and Verification in RSL","authors":"S. Meng, B. Aichernig, Zhang Naixiao","doi":"10.1109/PDCAT.2005.100","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.100","url":null,"abstract":"Research on non-structural system group decision-making problems largely depends on the knowledge and experience of the experts for tactical analysis. The usual method of voting may result in a great loss of information in case of much renunciation, and the accuracy of voting can therefore be directly influenced.This paper proposes a new solution to non-structural system group decision-making problems by taking advantage of the characteristics of correlate and the information easy to lose to make an overall analysis of the ayes, blackballs and renunciation polls for an accurate result.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122444884","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 Message-based Software Architecture Style for Distributed Application 面向分布式应用的基于消息的软件体系结构样式
Guozhen Tan, Xinpeng Li, Jiankun Wu, Hongzhuo Zhao, Chengxu Li
{"title":"A Message-based Software Architecture Style for Distributed Application","authors":"Guozhen Tan, Xinpeng Li, Jiankun Wu, Hongzhuo Zhao, Chengxu Li","doi":"10.1109/PDCAT.2005.19","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.19","url":null,"abstract":"Software Architecture (SA) is emerging as an important research area in software engineering and forms the backbone for building successful softwareintensive systems. Based on practical requirements, especially the requirements of distributed applications and Internet applications, a new architectural style referred to as TreeSA is proposed. The primary elements of TreeSA and he message routing mechanism are discussed. Finally, an application based on TreeSA is outlined.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124622784","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
A Novel High Gray Scale Data Driver for Passive Matrix OLED Displays 一种用于无源矩阵OLED显示器的新型高灰度数据驱动
Hong-Jae Shin, Sun-Bo Woo, Seung-Jun Shin, K. Kwack, Tae-Whan Kim
{"title":"A Novel High Gray Scale Data Driver for Passive Matrix OLED Displays","authors":"Hong-Jae Shin, Sun-Bo Woo, Seung-Jun Shin, K. Kwack, Tae-Whan Kim","doi":"10.1109/PDCAT.2005.32","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.32","url":null,"abstract":"A novel data driver for passive matrix organic lightemitting devices (OLEDs) with high gray scale images was designed. The proposed circuit consisted of a main current bias circuit as well as sample & hold circuits in each channel of the data driver to compensate a current offset. These results indicate that a designed data driver by using a current offset compensation technique holds promise for potential applications in passive matrix OLED displays with high gray scale images.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"55 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911756","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
Chocolat/SMV: A Translator from CafeOBJ into SMV 巧克力/SMV: CafeOBJ到SMV的翻译
K. Ogata, Masahiro Nakano, Masaki Nakamura, K. Futatsugi
{"title":"Chocolat/SMV: A Translator from CafeOBJ into SMV","authors":"K. Ogata, Masahiro Nakano, Masaki Nakamura, K. Futatsugi","doi":"10.1109/PDCAT.2005.98","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.98","url":null,"abstract":"Chocolat/SMV is a translator that takes a CafeOBJ specification of a transition system called an OTS and generates an SMV specification of a finite version of the OTS. The primary purpose of the translation is to find errors lurked in CafeOBJ specifications of OTSs with SMV.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121318784","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}
引用次数: 7
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学术官方微信
小红书