Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300537
D. Hsu, A. Palumbo
In this paper, we examine a method for the fusion of ranked data in the context of a Cayley graph. We investigate this Cayley graph model for optimization of fusion by rank combination. We outline a method of data fusion by combination of weighted rankings. Information systems are represented as nodes in a Cayley graph. Our goal is to determine a metric of diversity and performance in this graph in order to build a model for optimizing fusion by rank combination. We use the Kendall distance between nodes in the Cayley graph of the symmetric group S/sub n/ as a measure of performance. In doing so we demonstrate that in S/sub 6/ there is a quadratic relationship between the weights of the fusion of two information systems and the performance of the fusion in our abstract space. From such a relationship we propose a set of functions for extrapolating optimal fusion weights in the symmetric group S/sub n/.
{"title":"A study of data fusion in Cayley graphs G(s/sub n/,p/sub n/)","authors":"D. Hsu, A. Palumbo","doi":"10.1109/ISPAN.2004.1300537","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300537","url":null,"abstract":"In this paper, we examine a method for the fusion of ranked data in the context of a Cayley graph. We investigate this Cayley graph model for optimization of fusion by rank combination. We outline a method of data fusion by combination of weighted rankings. Information systems are represented as nodes in a Cayley graph. Our goal is to determine a metric of diversity and performance in this graph in order to build a model for optimizing fusion by rank combination. We use the Kendall distance between nodes in the Cayley graph of the symmetric group S/sub n/ as a measure of performance. In doing so we demonstrate that in S/sub 6/ there is a quadratic relationship between the weights of the fusion of two information systems and the performance of the fusion in our abstract space. From such a relationship we propose a set of functions for extrapolating optimal fusion weights in the symmetric group S/sub n/.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456470","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300522
Debabrata Mondal, P. K. Jana
It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data index (PDI), proposed in this paper.
{"title":"Neighborhood property of OTIS-mesh optoelectronic computer","authors":"Debabrata Mondal, P. K. Jana","doi":"10.1109/ISPAN.2004.1300522","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300522","url":null,"abstract":"It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data index (PDI), proposed in this paper.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124173638","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300520
A. Sharma, A. Goswami, D. Gupta
Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). The extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.
数据库范式的最新趋势是结合模糊集来处理现实世界问题的不精确和模糊信息。本文利用模糊集和可能性理论的概念，Ee Peng Lilm et al.(1999)对TS-relational model进行了FTS关系模型的扩展。扩展模型通过合并各自的导出模糊数据库来集成本地模糊数据库，生成一组模糊多数据库的FTS关系。定义了一组处理FTS关系的代数运算，并证明了其正确性。提出了一套优化FTS代数表达式的代数规则。
{"title":"An extended relational algebra for fuzzy multidatabases","authors":"A. Sharma, A. Goswami, D. Gupta","doi":"10.1109/ISPAN.2004.1300520","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300520","url":null,"abstract":"Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). The extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816736","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300534
Xiao Chen, Jian Shen
Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.
{"title":"Reducing connected dominating set size with multipoint relays in ad hoc wireless networks","authors":"Xiao Chen, Jian Shen","doi":"10.1109/ISPAN.2004.1300534","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300534","url":null,"abstract":"Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275293","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300470
Frank Hsu, X.-D Hu, H.-J Huang, X.-H Jia
This paper discusses two optimal data replica placement problems in linear bus networks, one is to maximize data availability and the other to minimize data access cost. The optimal placements are constructed for these two problems under read-any/write-all and majority voting protocols, respectively. The obtained results show that these two problems have the same optimal solutions under read dominant, write dominant, and majority voting systems.
{"title":"Optimal data replica placements in linear bus networks","authors":"Frank Hsu, X.-D Hu, H.-J Huang, X.-H Jia","doi":"10.1109/ISPAN.2004.1300470","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300470","url":null,"abstract":"This paper discusses two optimal data replica placement problems in linear bus networks, one is to maximize data availability and the other to minimize data access cost. The optimal placements are constructed for these two problems under read-any/write-all and majority voting protocols, respectively. The obtained results show that these two problems have the same optimal solutions under read dominant, write dominant, and majority voting systems.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377153","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300523
N. Mir, Chwei-King Mok
The design and evaluation of a parallel-plane interconnection network are presented in this paper. The proposed network can be used in data networks as well as in distributed computing systems. The proposed network is a cyclic, deflection-routing based, and hierarchical network and is constructed recursively using the Manhattan-type topology as the basic building block. This network exhibits substantial improvement in performance over its building block two-dimensional network on characteristics such as throughput and fault tolerance and still preserves the ease of implementation. The simulation and analysis in this paper show that the proposed network performs comparably to the hypercube at a much lower cost, even a larger network is used. Unlike other switching networks that use a higher node degree to maintain a small network diameter as the networks grow, the proposed parallel architecture network takes advantage of the expandability in its basic building blocks. This feature of the parallel-plane network offers a low network diameter, while it maintains a fixed and small node degree.
{"title":"Performance of a parallel-plane switching network","authors":"N. Mir, Chwei-King Mok","doi":"10.1109/ISPAN.2004.1300523","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300523","url":null,"abstract":"The design and evaluation of a parallel-plane interconnection network are presented in this paper. The proposed network can be used in data networks as well as in distributed computing systems. The proposed network is a cyclic, deflection-routing based, and hierarchical network and is constructed recursively using the Manhattan-type topology as the basic building block. This network exhibits substantial improvement in performance over its building block two-dimensional network on characteristics such as throughput and fault tolerance and still preserves the ease of implementation. The simulation and analysis in this paper show that the proposed network performs comparably to the hypercube at a much lower cost, even a larger network is used. Unlike other switching networks that use a higher node degree to maintain a small network diameter as the networks grow, the proposed parallel architecture network takes advantage of the expandability in its basic building blocks. This feature of the parallel-plane network offers a low network diameter, while it maintains a fixed and small node degree.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128290565","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300541
Eric Y. K. Chan, H. Chan, K. M. Chan, Vivien P. S. Chan, S. Chanson, M. Cheung, C. Chong, Kam-pui Chow, Albert K. T. Hui, L.C.K. Hui, Luke C. K. Lam, W. C. Lau, K. Pun, Anthony Y. F. Tsang, W. Tsang, Sam C. W. Tso, D. Yeung, KY Yu
Distributed denial-of-service (DDoS) attack has turned into one of the major security threats in recent years. Usually the only solution is to stop the services or shut down the victim and then discard the attack traffic only after the DDoS attack characteristics (such as the destination ports of the attack packets) are known. In this paper, we introduce a generic DDoS attack detection mechanism as well as the design and setup of a testbed for performing experiments and analysis. Our results showed that the mechanism can detect DDoS attack. This enables us to proceed to the next steps of packet classification and traffic control.
{"title":"IDR: an intrusion detection router for defending against distributed denial-of-service (DDoS) attacks","authors":"Eric Y. K. Chan, H. Chan, K. M. Chan, Vivien P. S. Chan, S. Chanson, M. Cheung, C. Chong, Kam-pui Chow, Albert K. T. Hui, L.C.K. Hui, Luke C. K. Lam, W. C. Lau, K. Pun, Anthony Y. F. Tsang, W. Tsang, Sam C. W. Tso, D. Yeung, KY Yu","doi":"10.1109/ISPAN.2004.1300541","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300541","url":null,"abstract":"Distributed denial-of-service (DDoS) attack has turned into one of the major security threats in recent years. Usually the only solution is to stop the services or shut down the victim and then discard the attack traffic only after the DDoS attack characteristics (such as the destination ports of the attack packets) are known. In this paper, we introduce a generic DDoS attack detection mechanism as well as the design and setup of a testbed for performing experiments and analysis. Our results showed that the mechanism can detect DDoS attack. This enables us to proceed to the next steps of packet classification and traffic control.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066385","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300548
Han-Yu Chuang, Hongfang Liu, Fang-An Chen, Cheng-Yan Kao, D. Hsu
Microarray technology and experiment can produce thousands or tens of thousands of gene expression measurements in a single cellular mRNA sample. Selecting a list of informative differential genes from these measurement data has been the central problem for microarray analysis. Many methods to identify informative genes have been proposed in the past. However, due to the complexity of biological systems, each proposed method seems to perform nicely in a particular data set or specific experiment. It remains a great challenge to come up with a selection method for a wider spectrum of experiments and a broader variety of data sets. In this paper, we take the approach of method combination using data fusion and rank-score graph which have been used successfully in other application domains such as information retrieval, pattern recognition and tracking, and molecular similarity search. Our method combination is efficient and flexible and can be extended to become a general learning system for microarray gene expression analysis.
{"title":"Combination methods in microarray analysis","authors":"Han-Yu Chuang, Hongfang Liu, Fang-An Chen, Cheng-Yan Kao, D. Hsu","doi":"10.1109/ISPAN.2004.1300548","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300548","url":null,"abstract":"Microarray technology and experiment can produce thousands or tens of thousands of gene expression measurements in a single cellular mRNA sample. Selecting a list of informative differential genes from these measurement data has been the central problem for microarray analysis. Many methods to identify informative genes have been proposed in the past. However, due to the complexity of biological systems, each proposed method seems to perform nicely in a particular data set or specific experiment. It remains a great challenge to come up with a selection method for a wider spectrum of experiments and a broader variety of data sets. In this paper, we take the approach of method combination using data fusion and rank-score graph which have been used successfully in other application domains such as information retrieval, pattern recognition and tracking, and molecular similarity search. Our method combination is efficient and flexible and can be extended to become a general learning system for microarray gene expression analysis.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121637694","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300531
Amarnath K. Koundinya, A. Negi, V. N. Sastry
Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.
{"title":"Unicast routing algorithm with multiple quality-of-service parameters","authors":"Amarnath K. Koundinya, A. Negi, V. N. Sastry","doi":"10.1109/ISPAN.2004.1300531","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300531","url":null,"abstract":"Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126001141","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300530
Wei Yu
Communication service over the Internet has become an active research area, as the next generation Internet applications are requiring the integration of voice, video and data in the single IP infrastructure. In this paper, we propose a P2P-based architecture to efficiently provide communication service in large scale IP networks. By demonstrating the efficiency, two features are studied: one is the efficient communication software distribution feature and the other is the efficient conference feature.
{"title":"P2P-based infrastructure for efficient communication service in large scale IP networks","authors":"Wei Yu","doi":"10.1109/ISPAN.2004.1300530","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300530","url":null,"abstract":"Communication service over the Internet has become an active research area, as the next generation Internet applications are requiring the integration of voice, video and data in the single IP infrastructure. In this paper, we propose a P2P-based architecture to efficiently provide communication service in large scale IP networks. By demonstrating the efficiency, two features are studied: one is the efficient communication software distribution feature and the other is the efficient conference feature.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466329","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：