2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)最新文献_第4页

Real-time motion object tracking using GPU 实时运动对象跟踪使用GPU

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126628

L. Ríha, H. El-Sayed

引用次数: 4

CudaRF: A CUDA-based implementation of Random Forests CudaRF:基于cuda的随机森林实现

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126612

Håkan Grahn, Niklas Lavesson, Mikael Hellborg Lapajne, Daniel Slat

引用次数: 50

Using semantic Web to build and execute ad-hoc processes 使用语义Web构建和执行临时流程

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126597

Reginaldo Mendes, Paulo F. Pires, Flávia Coimbra Delicato, T. Batista, J. Taheri, Albert Y. Zomaya

引用次数: 6

Fuzz-SSVS: A Fuzzy logic based voting scheme to improve protein secondary structure prediction Fuzzy - ssvs:一种基于模糊逻辑的改进蛋白质二级结构预测的投票方案

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126592

J. Taheri, Albert Y. Zomaya, Flávia Coimbra Delicato, Paulo F. Pires

引用次数: 1

Arabic text categorization based on rough set classification 基于粗糙集分类的阿拉伯文本分类

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126590

M. Yahia

引用次数: 7

A novel approach for system level synthesis of multi-core system architectures from TPG models 基于TPG模型的多核系统架构系统级综合的新方法

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126600

K. Yehia, M. Safar, Hassan A. Youness, Mohamed Abdelsalam, A. Salem

{"title":"A novel approach for system level synthesis of multi-core system architectures from TPG models","authors":"K. Yehia, M. Safar, Hassan A. Youness, Mohamed Abdelsalam, A. Salem","doi":"10.1109/AICCSA.2011.6126600","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126600","url":null,"abstract":"A multi-processor system is an integrated circuit containing multiple processor cores that implements most of the functionality of a complex electronic system and some other components like FPGA/ASIC on a single chip. In this paper, we present a novel approach to synthesize multi-core system architectures from Task Precedence Graphs (TPG) models. The front end engine applies efficient algorithm for scheduling and communication contention resolving to obtain the optimal multi-core system architecture in terms of number of processor cores, number of busses, task-to-processor/channel-to-bus mapping, optimal schedule, and hardware-software (HW-SW) partition. The scheduling and mapping algorithms produce the optimality of mapping tasks onto cores. The partitioning technique reduces the overall execution time and number of buses among the cores. The back end engine generates a SystemC simulation model using a well-known commercial tool model generation library. The viability and potential of the proposed algorithms are demonstrated by a case study and extensive experimental results to conclude that the proposed approach is an efficient scheme to obtain the optimality of scheduling, mapping and partitioning with hard and large task graph problems.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338964","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

Approaches to prediction of protein structure 蛋白质结构预测方法

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126616

Walaa F. Ahmed, W. Gomaa

{"title":"Approaches to prediction of protein structure","authors":"Walaa F. Ahmed, W. Gomaa","doi":"10.1109/AICCSA.2011.6126616","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126616","url":null,"abstract":"Protein structure prediction (PSP) is one of the most important and challenging problems in bioinformatics today. This is due to the fact that the biological function of the protein is determined by its structure. While there is a gap between the number of known protein sequences and the number of known structures, protein structure prediction aims at reducing this sequence-structure gap. Protein structure can be experimentally determined using either X-ray crystallography or Nuclear Magnetic Resonance (NMR). However, these empirical techniques are very time consuming, so computational models and the associated algorithms have been developed for protein structure prediction. Such computational models fall into three categories: the homology approach, threading, and the ab initio approach. In this paper we give a general introductory background to the area and a literature survey about the ab initio approach in particular. This approach depends on the chemical and physical properties of the constituent amino acids. Not all ab initio algorithms have the same performance, so we represent the general success keys for any such algorithm.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123216359","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

On optimal strategies in protecting computer networks 论计算机网络保护的最优策略

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126582

F. Szidarovszky, Yi Luo

{"title":"On optimal strategies in protecting computer networks","authors":"F. Szidarovszky, Yi Luo","doi":"10.1109/AICCSA.2011.6126582","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126582","url":null,"abstract":"Strategies of defending a computer network against random attacks are modeled by probabilistic methods. A single-stage model is introduced to find the optimal allocation of the resources of the administrator when the network has multiple possible targets. The location of the actual attack is random, the probability of which can be assessed by the administrator from previous interactions with the attacker and based on intelligence information. The expected value and the variance are combined to find the certain equivalent of the outcome, which depends on the allocation of the resources of the administrator between the vulnerabilities of the network. The mathematical model is a nonconvex programming problem, so application of standard optimization techniques cannot guarantee global optimum. By introducing new decision variables the problem can be transformed into a convex problem, the optimal solutions of which can be determined by a simple algorithm by solving a single-variable monotonic equation. This procedure makes the administrator able to find optimal resource allocations very fast and therefore can respond almost instantaneously.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126798149","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

A reliable peer-to-peer protocol for mobile Ad-Hoc wireless networks 用于移动Ad-Hoc无线网络的可靠点对点协议

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126585

M. Al-Mouhamed, I. Khan, S. Firdous

{"title":"A reliable peer-to-peer protocol for mobile Ad-Hoc wireless networks","authors":"M. Al-Mouhamed, I. Khan, S. Firdous","doi":"10.1109/AICCSA.2011.6126585","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126585","url":null,"abstract":"Reliable, fast, and power aware communication is needed for Ad-Hoc wireless networks. Current techniques based on client-server and Publish/Subscribe communication models are not suitable in multi-robot systems and generally for mobile applications. For this we propose a reliable peer-to-peer protocol based on a UDP Broadcast and Token Passing (UBTP). The protocol is implemented on a WLAN using the Stargate embedded system. For this, a customized UDP protocol with an imperative Poll-based communication is proposed. The protocol is implemented using (1) a communication thread (TC) and (2) a processing thread (TP). A test bed system which allows modules to run TC and TP, in addition to the generation of broadcast request is presented. We used symmetric code in each node. Evaluation reports the distribution of auction completion times for peer-to-peer operations. The evaluation reveals: (1) response times are comparable to UBTP operated at head node, (2) improved degree of reliability as at most 2 steps are sufficient for auctioning seven nodes, (3) proved fairness, and (4) comparable power consumption to simple UBTP.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124616542","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}

引用次数: 4

Application-centric Cloud management 以应用程序为中心的云管理

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2011-12-27 DOI: 10.1109/AICCSA.2011.6126627

Sunirmal Khatua, Anirban Ghosh, N. Mukherjee

引用次数: 12