{"title":"Range sum query processing in parallel data warehouses","authors":"Jianzhong Li, Gao Hong","doi":"10.1109/PDCAT.2003.1236437","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236437","url":null,"abstract":"Online analytical processing (OLAP) is a critical component of data warehouse. Most of today's OLAP applications work on data warehouses with a centralized structure in which a single database contains huge amounts of data. A range query is a very popular and important operation on OLAP data cube in finding trends or relations between attributes. Methods of computing range query in a centralized data warehouse environment have been well studied. But to the best of our knowledge, there is no literature to date to discuss how to deal with the range query in a PC cluster-based parallel data warehouse. We present a parallel data cube storage structure, called parallel hierarchical data cube (PHDC). The analytical results show that PHDC may achieve better load-balance and optimum speed-up for range sum queries.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046515","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":"A new anomaly detection method based on hierarchical HMM","authors":"Xiaoqiang Zhang, P. Fan, Zhongliang Zhu","doi":"10.1109/PDCAT.2003.1236299","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236299","url":null,"abstract":"The state transition, which is hidden in the hidden Markov model (HMM), can be used to characterize the intrinsic difference between normal action and intrusion behavior. So HMM is an efficient way to detect anomalies. A new anomaly detection method based on a hierarchical HMM is proposed based on the concept of normal database and abnormal database. It is shown by analysis and simulation results that the proposed method is effective to increase the accuracy of anomaly detection.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115362591","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":"Simplified authority model of partition rule based access control","authors":"Chen Song, She Kun, Zhou Ming-Tian","doi":"10.1109/PDCAT.2003.1236298","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236298","url":null,"abstract":"With the problem of the effective certificate revocation for partition rule based access control remaining, we provide a user authority model based on the nonpublic key certificate approach and implement security access control of the information domain. Based on the clearance structure of X.509 v4, this model accomplishes three main functions: authority trust facility, authority certificate and certificate storage. It implements security information exchange on heterogeneous platforms, and achieves secure access to target resources with another identity authentication method.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114251210","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":"Towards a conceptual model for context-aware adaptive services","authors":"J. Sun, J. Sauvola","doi":"10.1109/PDCAT.2003.1236265","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236265","url":null,"abstract":"Recent advances in both portable devices and wireless networks make mobile computing a reality. Embedded and invisible computing resources are paving the way to a new paradigm known as pervasive computing. More attention needs to be paid to the development of intelligent services in such a highly dynamic environment. We aim to present a conceptual model for context awareness based service adaptation methodology. We describe context in context space and represent it with 4-tuple. We then discuss context awareness in terms of both context organization and utilization. Finally, we introduce the notion of adaptation and present the framework for context-aware adaptive services.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114399594","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":"A new architecture of matched-filter bank for high-speed code acquisition of ZCZ-CDMA system","authors":"Xiaoxu Guo, Jie Chen, Yulin Qui, N. Suehiro","doi":"10.1109/PDCAT.2003.1236330","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236330","url":null,"abstract":"We propose a new architecture of matched-filter (MF) bank for the code acquisition of ZCZ-CDMA system. The ZCZ-CDMA system can accurately detect multipath properties and greatly improve data transmission efficiency by using the special properties of the zero correlation zones (ZCZ) sequence. As a traditional matched-filter bank is used to carry out the code acquisition and the despreading operations to realize the information transmission at 20Mbps in the ZCZ-CDMA system, the circuit scale is too large and the power consumption is too high. Using our proposed new matched-filter bank, the circuit scale and the power consumption is greatly reduced. The high-speed and lower power VLSI design of the new matched-filter bank is implemented on FPGA.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114716037","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 UML for modeling PDM system architectures","authors":"Liu Shu","doi":"10.1109/PDCAT.2003.1236415","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236415","url":null,"abstract":"A kind of PDM architecture, which is modeled by UML, is introduced. The main methods of designing and realizing PDM system based on UML are described. Finally, an example is given in order to provide methodical guidelines and hints. It can also be used as a tutorial for UML and for object-oriented development in general.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114839565","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":"A new scheme for IP traceback under DoS attack","authors":"Hai-tao Tian, Liu-sheng Huang, Yun-fei Lei, Guo-liang Chen","doi":"10.1109/PDCAT.2003.1236285","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236285","url":null,"abstract":"The problem of identifying the sources of a denial of service attack is among the hardest in the Internet security area, since attackers often use spoofed source IP addresses. We present a new scheme called MAC-based probabilistic packet marking (MPPM) for IP traceback under DoS attack. A router marks the packets stochastically with fragments of an edge composed of itself and the next hop router. Message authentication code (MAC) is used to link and authenticate fragments of routers' addresses in the marked attack packets. The main advantage of MPPM over known PPM schemes includes less attack packets required to converge, linear computation overhead and more precision. Moreover the optional authentication mechanism provides robustness against faked marks. MPPM also features low router cost and supports incremental deployment.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"496 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115888357","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}
B. Chapman, Oscar R. Hernandez, Lei Huang, Tien-Hsiung Weng, Zhenying Liu, L. Adhianto, Yi Wen
{"title":"Dragon: an Open64-based interactive program analysis tool for large applications","authors":"B. Chapman, Oscar R. Hernandez, Lei Huang, Tien-Hsiung Weng, Zhenying Liu, L. Adhianto, Yi Wen","doi":"10.1109/PDCAT.2003.1236416","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236416","url":null,"abstract":"A program analysis tool can play an important role in helping users understand and improve large application codes. Dragon is a robust interactive program analysis tool based on the Open64 compiler, which is an Open source C/C++/Fortran77/90 compiler for Intel Itanium systems. We designed and developed the Dragon analysis tool to support manual optimization and parallelization of large applications by exploiting the powerful analyses of the Open64 compiler. Dragon enables users to visualize and print the essential program structure of and obtains information on their large applications. Current features include the call graph, flow graph, and data dependences. Ongoing work extends both Open64 and Dragon by a new call graph construction algorithm and its related interprocedural analysis, global variable definition and usage analysis, and an external interface that can be used by other tools such as profilers and debuggers to share program analysis information. Future work includes supporting the creation and optimization of shared memory parallel programs written using OpenMP.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115474247","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":"Unicast routing in mobile ad hoc networks: present and future directions","authors":"Zhi Ren, W. Guo","doi":"10.1109/PDCAT.2003.1236318","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236318","url":null,"abstract":"Recent advances in portable computing and wireless technologies are opening up exciting possibilities for the future of wireless mobile networks. A MANET (mobile ad hoc networks) is a self-organizing and a self-configuring network which does not require fixed infrastructure. All nodes in it are capable of movement, and can be interconnected in an arbitrary manner. At present, unicast routing is a focus of research on MANETs. We present the unicast routing protocols for mobile ad hoc networks. We provide a detailed description of issues and protocols for unicast routing over MANETs. We discuss the future directions in research on unicast routing. We hope that the discussion presented here will be helpful to application developers in selecting an appropriate unicast protocol and pave the way for future research.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471761","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":"A modified HARQ scheme associated with non-uniform constellation","authors":"Hong Chen, Qingchun Chen, P. Fan","doi":"10.1109/PDCAT.2003.1236342","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236342","url":null,"abstract":"Multilevel quadrature amplitude modulation (MQAM) is an attractive modulation technique to achieve high data rate transmission without increasing the wireless bandwidth. But each bit that makes up a MQAM symbol exhibits a different degree of BER performance for MQAM (M>4) constellation with Gray encoding. This will degrade the performance of the decoder with respect to having relatively equal BER performance. A modified HARQ scheme associated with nonuniform constellation is proposed to maximize the system throughput. It is proposed to use the nonuniform constellation together with the symbol bits rearrangement in the retransmissions to average and improve the reliability of each bit gradually by means of code combining in the receiver. Simulation results demonstrate that the proposed scheme can reduce the average transmission number and increase the throughput effectively, compared with those HARQ schemes using one constellation or constellation rearrangement. In particular, the higher MQAM modulation alphabet size and the more inhomogeneous bit reliabilities, the higher gain can be achieved by using the proposed scheme.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124510842","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}