2011 UKSim 5th European Symposium on Computer Modeling and Simulation最新文献_第3页

Detection of Microcalcifications in Mammograms Using Support Vector Machine

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.23

M. Sharkas, Mohamed Al-Sharkawy, D. Ragab

引用次数: 13

A New Routing Algorithm for Irregular Mesh NoCs without Virtual Channel 一种无虚拟信道的不规则网格noc路由新算法

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.53

Mehdi Mohtashamzadeh, Ladan Momeni, Arshin Rezazadeh, S. Baghbani, Asma Mahdipoor

引用次数: 0

Optimizing Cloud MapReduce for Processing Stream Data Using Pipelining 优化云MapReduce使用流水线处理流数据

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.76

Rutvik Karve, Devendra Dahiphale, Amit Chhajer

引用次数: 9

Intelligent Composition of Dynamic-Cost Services in Service-Oriented Architectures 面向服务体系结构中动态成本服务的智能组合

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.51

G. A. Ebrahim

{"title":"Intelligent Composition of Dynamic-Cost Services in Service-Oriented Architectures","authors":"G. A. Ebrahim","doi":"10.1109/EMS.2011.51","DOIUrl":"https://doi.org/10.1109/EMS.2011.51","url":null,"abstract":"Service-oriented architecture becomes a major computing practice in modern enterprise software systems. In several cases, the cost of the services could depend on the combination of the services utilized. In addition, there could be several constraints imposed on the service composition process. One of the important constraints is to impose an upper bound on the number of clients' usages of services in a period of time. Another important constraint is to restrict the number of service-providers that should be utilized. This constraint is normally needed to reduce the number of long-term relationships between the clients and the service-providers. In this paper, a new algorithm is introduced that tries to find the optimal set of services needed by the software designer to fit his computing requirements. It tries to minimize the overall incurred cost taking into consideration the dynamic-cost of the services occurred due to clients' usage patterns. In addition, it tries to minimize the number of service-providers utilized and maximize the overall QoS. In addition, it takes into account the constraints imposed on using the services. Genetic algorithms are adopted in tackling this problem, which are able to reach a near-optimal solution.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728127","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

Select the Appropriate Model for the Earth's Magnetic Field 为地球磁场选择合适的模型

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.59

K. Kianfar, Ahad Jafarpour Mahalleh, A. Moridi

引用次数: 1

Ontology-Based Data Instantiation Using Web Service 使用Web服务的基于本体的数据实例化

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.50

Rashin Rezazadeh, B. Shadgar, A. Osareh, Arshin Rezazadeh

{"title":"Ontology-Based Data Instantiation Using Web Service","authors":"Rashin Rezazadeh, B. Shadgar, A. Osareh, Arshin Rezazadeh","doi":"10.1109/EMS.2011.50","DOIUrl":"https://doi.org/10.1109/EMS.2011.50","url":null,"abstract":"The Semantic Web aims at creating a platform where information has its semantics and can be understood and processed by computers themselves with minimum human interference. Ontology theory and its related technology have been developed to help construct such a platform because ontology promises to encode certain levels of semantics for information and offers a set of common vocabulary for people or computer to communicate with. In this article, we introduced the open-source software called ontology instantiate. This software has been created for book ontology construction and instantiation using web services. This software helps users to instantiate ontology of book information on Amazon web site. This software also allows the user to merge another book ontology in its produced ontology and integrates them in the form unit ontology. This software for integration of these ontologies uses a wide range of similarity measures, including semantic similarity, string-based similarity and structural similarity. The tree is used for investigating the structural similarity. Dictionaries like Wikipedia, Word Net, Google and Yahoo is used for investigating semantic similarity and string-based similarity.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125427926","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

Design and Analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator Using ASIC Design Flow 基于ASIC设计流程的DNA序列比对加速器的高性能低功耗矩阵填充设计与分析

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.9

N. Khairudin, M. A. Haron, S. Junid, A. Halim, M. Idros, N. S. A. Razak

{"title":"Design and Analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator Using ASIC Design Flow","authors":"N. Khairudin, M. A. Haron, S. Junid, A. Halim, M. Idros, N. S. A. Razak","doi":"10.1109/EMS.2011.9","DOIUrl":"https://doi.org/10.1109/EMS.2011.9","url":null,"abstract":"Efficient sequence alignment is one of the most important and challenging activities in bioinformatics. Many algorithms have been proposed to perform and accelerate sequence alignment activities. Among them Smith-Waterman (S-W) is the most sensitive (accurate) algorithm. This paper presents a novel approach and analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator by using ASIC design flow. The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. The scope of study is by using the matrix filling method which is in parallel implementation of the Smith-Waterman algorithm. This method provides more efficient speed up compared to the traditional sequential implementation but at the same time maintaining the level of sensitivity. The methodology of this paper is using FPGA and Synopsis. This technique is used to implement the massive parallelism. The design was developed in Verilog HDL coding and synthesized by using LINUX tools. Matrix Cells with a design area 8808.307mm2 at 40ns clock period is the best design. Thus the power required at this clock period also smaller, dynamic power 111.1415uW and leakage power 212.9538 Nw. This is a large improvement over existing designs and improves data throughput by using ASIC design flow.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907349","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

Applying Formal Verification to a Cache Coherence Protocol in TLS 形式化验证在TLS缓存一致性协议中的应用

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.48

X. Lai, Cong Liu, Zhiying Wang

{"title":"Applying Formal Verification to a Cache Coherence Protocol in TLS","authors":"X. Lai, Cong Liu, Zhiying Wang","doi":"10.1109/EMS.2011.48","DOIUrl":"https://doi.org/10.1109/EMS.2011.48","url":null,"abstract":"Current hardware implementations of TLS (thread-level speculation) in both Hydra and Renau's SESC simulator use a global component to check data dependence violations, e.g. L2 Cache or hardware list. Frequent memory accesses cause global component bottlenecks. In this paper, we propose a cache coherence protocol using a distributed data dependence violation checking mechanism for TLS. The proposed protocol extends the traditional MESI cache coherence protocol by including several methods to exceed the present limits of centralized violation checking methods. The protocol adds an invalidation vector to each private L1 cache to record threads that violate RAW data dependence. It also adds a versioning priority register that compares data versions. Added to each private L1 cache block is a snooping bit which indicates whether the thread possesses a bus snooping right for the block. The proposed protocol is much more complicated than the traditional MESI protocol and hard to be completely verified only through simulation. So we applied formal verification to the proposed cache protocol to confirm its correctness. The verification result shows that the proposed protocol will function correctly in TLS system.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"123 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003950","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

The Impact of ICT on Computer Applications 资讯及通讯科技对电脑应用的影响

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.45

K. Nwizege, F. Chukwunonso, Charity Kpabeb, Shedrack Mmeah

引用次数: 2

On the TCP Flow Inter-arrival Times Dsitribution 关于TCP流到达时间分配

2011 UKSim 5th European Symposium on Computer Modeling and Simulation Pub Date : 2011-11-16 DOI: 10.1109/EMS.2011.34

L. Arshadi, A. Jahangir

引用次数: 10