2010 13th IEEE International Conference on Computational Science and Engineering最新文献

A Framework: Workflow-Based Social Network Discovery and Analysis 一个框架:基于工作流的社会网络发现与分析

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.74

Jihye Song, Minjoon Kim, Haksung Kim, K. Kim

{"title":"A Framework: Workflow-Based Social Network Discovery and Analysis","authors":"Jihye Song, Minjoon Kim, Haksung Kim, K. Kim","doi":"10.1109/CSE.2010.74","DOIUrl":"https://doi.org/10.1109/CSE.2010.74","url":null,"abstract":"The purpose of this paper is to build a fundamental framework of discovering and analyzing a workflow-based social network formed through workflow-based organizational business operations. A little more precisely speaking, the framework formalizes a series of theoretical steps from discovering a workflow-based social network to analyzing the discovered social network. For the sake of the discovery phase, we conceive an algorithm that is able to automatically discover the workflow-based social network from a workflow procedure; while on the other hand, in the analysis phase we apply the degree centrality algorithm to the discovered social network, which is one of the well-known social network analysis algorithms in the literature. Consequently, the crucial implication of the framework is in quantifying the degree of work-intimacy among performers who are involved in enacting the corresponding workflow procedure. Also, as a conceptual extension of the framework, it can be applied to discovering and analyzing d gree centrality or collaborative closeness and betweenness among architectural components and nodes of collaborative cloud workflow computing environments.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116650448","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}

引用次数: 31

An Image Interpolation Based Reversible Data Hiding Method Using R-Weighted Coding 一种基于图像插值的r加权可逆数据隐藏方法

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.52

Y. Yalman, F. Akar, I. Erturk

引用次数: 24

An Approximate Timing Analysis Framework for Complex Real-Time Embedded Systems 复杂实时嵌入式系统的近似时序分析框架

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.21

Yue Lu, Thomas Nolte, J. Kraft

{"title":"An Approximate Timing Analysis Framework for Complex Real-Time Embedded Systems","authors":"Yue Lu, Thomas Nolte, J. Kraft","doi":"10.1109/CSE.2010.21","DOIUrl":"https://doi.org/10.1109/CSE.2010.21","url":null,"abstract":"To maintain, analyze and reuse many of today¡¯s Complex Real-Time Embedded Systems (CRTES) is very difficult and expensive, which, nevertheless, offers high business value in response to great concern in industry. In such context, not only functional behavior but also non-functional properties of systems have to be assured, i.e., Worst-Case Response Time (WCRT) of tasks has to be known. However, due to high complexity of such systems and the nature of the problem, the exact WCRT of tasks is impossible to find in practice, but may only be bounded. In addition, the existing relatively well developed theories for modeling and analysis of real-time systems are having problems which limit their application in the context. In this paper, we address this challenge by presenting a framework for approximate timing analysis of CRTES, namely AESIR-CORES, which provides a tight interval of WCRT estimates of tasks by the usage of two novel contributions. Our evaluation using three models inspired by two fictive but representative industrial CRTES indicates that AESIR-CORES can either successfully obtain the actual WCRT values, or have the potential to bound the unknown actual WCRT values from a statistical perspective.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127175911","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

A QoS-Optimal Automatic Service Composition Method Based on Backtracting Theory 基于回溯理论的qos最优自动服务组合方法

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.71

Wenmin Lin, Rutao Yang, Xiaojie Si, Lianyong Qi, Wanchun Dou

引用次数: 0

Research on Mining Rules from Multi-criterion Group Decision Making Based on Genetic Algorithms 基于遗传算法的多准则群决策规则挖掘研究

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.45

Xinqiao Yu, N. Xiong, Wei Zhang

引用次数: 0

Service Price Discrimination in Wireless Network 无线网络服务价格歧视

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.14

Zhide Chen, Li Xu

引用次数: 0

A Taxonomy for the Analysis of Scientific Workflow Faults 科学工作流故障分析的分类方法

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.59

M. Lackovic, D. Talia, Rafael Tolosana-Calasanz, J. A. Bañares, O. Rana

引用次数: 15

Runtime Configurable Service Process Model 运行时可配置服务流程模型

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.55

Liang Zhou, Jian Cao

引用次数: 0

GPU-RMAP: Accelerating Short-Read Mapping on Graphics Processors GPU-RMAP:加速图形处理器上的短读映射

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.29

Ashwin M. Aji, Liqing Zhang, Wu-chun Feng

{"title":"GPU-RMAP: Accelerating Short-Read Mapping on Graphics Processors","authors":"Ashwin M. Aji, Liqing Zhang, Wu-chun Feng","doi":"10.1109/CSE.2010.29","DOIUrl":"https://doi.org/10.1109/CSE.2010.29","url":null,"abstract":"Next-generation, high-throughput sequencers are now capable of producing hundreds of billions of short sequences (reads) in a single day. The task of accurately mapping the reads back to a reference genome is of particular importance because it is used in several other biological applications, e.g., genome re-sequencing, DNA methylation, and ChiP sequencing. On a personal computer (PC), the computationally intensive short-read mapping task currently requires several hours to execute while working on very large sets of reads and genomes. Accelerating this task requires parallel computing. Among the current parallel computing platforms, the graphics processing unit (GPU) provides massively parallel computational prowess that holds the promise of accelerating scientific applications at low cost. In this paper, we propose GPU-RMAP, a massively parallel version of the RMAP short-read mapping tool that is highly optimized for the NVIDIA family of GPUs. We then evaluate GPU-RMAP by mapping millions of synthetic and real reads of varying widths on the mosquito (Aedes aegypti) and human genomes. We also discuss the effects of various input parameters, such as read width, number of reads, and chromosome size, on the performance of GPU-RMAP. We then show that despite using the conventionally “slower” but GPU-compatible binary search algorithm, GPU-RMAP outperforms the sequential RMAP implementation, which uses the “faster” hashing technique on a PC. Our data-parallel GPU implementation results in impressive speedups of up to 14:5-times for the mapping kernel and up to 9:6-times for the overall program execution time over the sequential RMAP implementation on a traditional PC.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114330617","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}

引用次数: 24

LogGPH: A Parallel Computational Model with Hierarchical Communication Awareness 一种具有层次通信感知的并行计算模型

2010 13th IEEE International Conference on Computational Science and Engineering Pub Date : 2010-12-11 DOI: 10.1109/CSE.2010.40

Liang Yuan, Yunquan Zhang, Yuxin Tang, L. Rao, Xiangzheng Sun

引用次数: 17