2011 International Conference on Complex, Intelligent, and Software Intensive Systems最新文献_第3页

Using Self-led Critical Friend Topology Based on P2P Chord Algorithm for Node Localization within Cloud Communities 基于P2P弦算法的自引导临界友元拓扑在云社区节点定位中的应用

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.80

Stelios Sotiriadis, N. Bessis, N. Antonopoulos

{"title":"Using Self-led Critical Friend Topology Based on P2P Chord Algorithm for Node Localization within Cloud Communities","authors":"Stelios Sotiriadis, N. Bessis, N. Antonopoulos","doi":"10.1109/CISIS.2011.80","DOIUrl":"https://doi.org/10.1109/CISIS.2011.80","url":null,"abstract":"Resource provision within critical friend environment take place on a demand fashion and it is based on the aptitude of members to look across multiple locations for resource discovery and allocation. A major concern of such large scale and uncertain topology setting is the capability of members (nodes) to efficiently search and locate neighbouring participants. Here we adopt a Peer to Peer (P2P) approach in which every node in the network acts alike and discovers resources in a distributed coordination. More specifically, we propose the use of Chord algorithms, as a distributed peer to peer lookup protocol, put forward a new solution by assigning keys to different nodes. By specifying the aspect in which keys (data) are assigned to nodes, and how a node can determine the value for a given key, the algorithm locates the node responsible for that key. In the work herein we discuss a notable case, namely how Chord algorithms as a distributed P2P lookup protocol may determine provable solutions to the problem of efficient large scale Grid and Cloud resource localization. More specifically, the aforementioned proposal deals with the load balancing, scalability and availability of Grid and Cloud resources in a decentralized manner.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121861718","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

UVDict - A Machine Translation Dictionary for Vietnamese Language in UNL System UNL系统中越南语机器翻译词典

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.51

V. T. Hung, G. Fafiotte

引用次数: 8

FICHS: A Fuzzy-based Integrated CAC and Handover System for Cellular Networks 基于模糊的蜂窝网络综合CAC和切换系统

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.48

Gjergji Mino, Elis Kulla, Taku Ikebata, L. Barolli, Jiro Iwashige

引用次数: 3

Supporting the Security Awareness of GA-based Grid Schedulers by Artificial Neural Networks 用人工神经网络支持基于ga的网格调度程序的安全意识

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.47

Marcin Bogdański, J. Kolodziej, F. Xhafa

{"title":"Supporting the Security Awareness of GA-based Grid Schedulers by Artificial Neural Networks","authors":"Marcin Bogdański, J. Kolodziej, F. Xhafa","doi":"10.1109/CISIS.2011.47","DOIUrl":"https://doi.org/10.1109/CISIS.2011.47","url":null,"abstract":"Task scheduling and resource allocation remain still challenging problems in Computational Grids (CGs). Traditional computational models and resolution methods cannot effectively tackle the complex nature of Grid, where the resources and users belong to many administrative domains with their own access policies and users' privileges, and security and task abortion awareness are addressed as important scheduling criteria. In this paper we propose a neural network approach for supporting the security awareness of the genetic-based grid schedulers. Making a prior analysis of trust levels of the resources and security demand parameters of tasks, the neural network monitors the scheduling and task execution processes. The network learns patterns in input (tasks and machines initial characteristics) and outputs (information about resource failures and the resulting tasks and machines characteristics) data, and finally sub-optimal schedules are generated, which are then used to modify the initialization procedures of genetic scheduling algorithms. We extended the Hyper Sim-G Grid simulator framework by Neural Network module to evaluate the proposed model under the heterogeneity, the large-scale and dynamics conditions. The relative performance of GA-based and Neural Network GA-based schedulers is measured by the make span and flow time metrics. The obtained results showed the efficacy of the Neural Network approach to enhance the secure GA-based schedulers.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134646219","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

Survey of Trust Management on Various Networks 各种网络信任管理综述

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.122

Ping Zhang, A. Durresi, L. Barolli

引用次数: 37

An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures 一种改进的基于团的无序树编辑距离计算方法及其在聚糖结构比较中的应用

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.88

T. Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, A. Takasu, E. Tomita

{"title":"An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures","authors":"T. Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, A. Takasu, E. Tomita","doi":"10.1109/CISIS.2011.88","DOIUrl":"https://doi.org/10.1109/CISIS.2011.88","url":null,"abstract":"The tree edit distance is one of the most widely used measures for comparison of tree structured data and has been used for analysis of RNA secondary structures, glycan structures, and vascular trees. However, it is known that the tree edit distance problem is NP-hard for unordered trees while it is polynomial time solvable for ordered trees. We have recently proposed a clique-based method for computing the tree edit distance between unordered trees in which each instance of the tree edit distance problem is transformed into an instance of the maximum vertex weighted clique problem and then an existing clique algorithm is applied. In this paper, we propose an improved clique-based method. Different from our previous method, the improved method is basically a dynamic programming algorithm that repeatedly solves instances of the maximum vertex weighted clique problem as sub-problems. Other heuristic techniques, which do not violate the optimality of the solution, are also introduced. When applied to comparison of large glycan structures, our improved method showed significant speed-up in most cases.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117318242","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}

引用次数: 5

Green Metrics for Energy-aware IT Systems 节能IT系统的绿色指标

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.42

A. Kipp, Tao Jiang, M. Fugini

引用次数: 27

Multiscale SSR Tag Cloud Visualization for Biomarker Discovery 用于生物标志物发现的多尺度SSR标记云可视化

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.85

Jhen-Li Huang, Chien-Ming Chen, Tun-Wen Pai, Liang Wei Zeng, Ronshan Cheng

{"title":"Multiscale SSR Tag Cloud Visualization for Biomarker Discovery","authors":"Jhen-Li Huang, Chien-Ming Chen, Tun-Wen Pai, Liang Wei Zeng, Ronshan Cheng","doi":"10.1109/CISIS.2011.85","DOIUrl":"https://doi.org/10.1109/CISIS.2011.85","url":null,"abstract":"Tag cloud is an efficient visualization technique to help users rapidly understand the significant components within a tag based dataset. To make practical use of the visualization method, we proposed a cross-comparison mechanism for discovering Simple Sequence Repeat (SSR) biomarkers by annotating retrieved tag entries in various colors and font sizes to differentiate conservative status of two species groups. The identified SSR tag entries can represent the conservative and exclusive features among various species with respect to a specified functional gene set. Grouped SSR features of the same kind species can be classified and displayed simultaneously in order to compare evolutionary relationships. In addition, we applied different parameter settings for SSR discovery algorithms to generate multiscale tag clouds which provide different levels of significance of discovered repeat segments. In this study, several significant SSR patterns within eight skeletal development genes from 10 different species were illustrated and classified as notable features for the previously defined two groups of mammalian and fishery species. The proposed multiscale SSR tag clouds were demonstrated to be able to facilitate biologists on searching notable SSR biomarkers or putative gene regulatory elements in this study.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124921986","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

Using Cell Processors for Intrusion Detection through Regular Expression Matching with Speculation 基于猜测的正则表达式匹配的单元处理器入侵检测

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.38

Cătălina Radu, C. Leordeanu, V. Cristea, Daniel Luchaup

{"title":"Using Cell Processors for Intrusion Detection through Regular Expression Matching with Speculation","authors":"Cătălina Radu, C. Leordeanu, V. Cristea, Daniel Luchaup","doi":"10.1109/CISIS.2011.38","DOIUrl":"https://doi.org/10.1109/CISIS.2011.38","url":null,"abstract":"The main purpose of network intrusion detection systems is to determine whether incoming network traffic matches known attack signatures. To achieve this goal each of the stored signatures represents a description of an attack or an undesired event in the monitored network. The main weakness with existing signature matching algorithms is that they are essentially serial operations and it is hard for them to keep up with the growing network speed. The major bottleneck in intrusion detection systems is that they are able to scan only one byte at a time, which leads to increased latency and low throughput. Thus, there is a need for a novel approach which takes advantage of the increased computing power of newer architectures. This paper presents a method which uses the Cell architecture to run an adapted speculative parallel pattern matching algorithm. Furthermore, we demonstrate that the advantages brought by our of our approach are significant compared to the serial implementation and other parallel ones. We also emphasize the advantages brought by the characteristics of the Cell architecture.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122670783","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

Augmented Transitive Relationships in Direct Protein-Protein Interaction Prediction 直接蛋白质相互作用预测中的增强传递关系

2011 International Conference on Complex, Intelligent, and Software Intensive Systems Pub Date : 2011-06-30 DOI: 10.1109/CISIS.2011.87

Yi-Tsung Tang, Hung-Yu kao

{"title":"Augmented Transitive Relationships in Direct Protein-Protein Interaction Prediction","authors":"Yi-Tsung Tang, Hung-Yu kao","doi":"10.1109/CISIS.2011.87","DOIUrl":"https://doi.org/10.1109/CISIS.2011.87","url":null,"abstract":"The prediction of new protein¡Vprotein interactions is important to the discovery of the currently unknown function of various biological pathways. In addition, many databases of protein¡Vprotein interactions contain different types of interactions, including protein associations, physical protein associations and direct protein interactions. There are only a few studies that consider the issues inherent to the prediction of direct protein¡Vprotein interactions, that is, interactions between proteins that are actually in direct physical contact and are listed in known protein interaction databases. Predicting these interactions is a crucial and challenging task. Therefore, it is increasingly important to discover not only protein associations but also direct interactions. Many studies have predicted protein¡Vprotein interactions directly, by using biological features such as Gene Ontology (GO) functions and protein structural domains of two proteins with unknown interactions. In this article, we proposed an augmented transitive relationships predictor (ATRP), a new method of predicting potential direct protein¡Vprotein interactions by using transitive relationships and annotations of protein interactions. Our results demonstrate that ATRP can effectively predict unknown direct protein¡Vprotein interactions from existing protein interaction relationships. The average accuracy of this method outperformed GO-based prediction methods by a factor ranging from 28% to 62%.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128049635","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