检索结果-内蒙古大学图书馆

20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006

作者： Vydyanathan, Nagavijayalakshmi Khanna, Gaurav Catalyurek, Umit Kurc, Tahsin Sadayappan, P. Saltz, Joel Dept. of Computer Science and Engineering Ohio State University Columbus OH 43210 United States Dept. of Biomedical Informatics Ohio State University Columbus OH 43210 United States Dept. of Electrical and Computer Engineering Ohio State University Columbus OH 43210 United States

ISBN: (纸本)1424400546

This paper proposes a novel strategy that uses hypergraph partitioning and K-way iterative mapping-refinement heuristics for scheduling a batch of data-intensive tasks with batch-shared I/O behavior on heterogeneous collections of storage and compute clusters. The strategy formulates file sharing among tasks as a hypergraph to minimize the I/O overheads due to duplicate file transfers and employs a K-way iterative mapping-refinement scheme to adapt to the heterogeneity of compute clusters and storage networks in the system. We evaluate the proposed approach through real experiments and simulations on application scenarios from two application domains;satellite data processing and biomedical imaging. Our experimental results show that our approach can achieve significant performance improvement over algorithms such as HPS, Shortest Job First, MinMin, MaxMin and Sufferage for workloads with high degree of shared I/O among tasks. © 2006 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A canonical correlation approach to heart beat detection in textile ECG measurements

A canonical correlation approach to heart beat detection in ...

引用

IET 3rd International Conference MEDSIP 2006: Advances in Medical, Signal and Information Processing

作者： Rattfalt, L. Ahlstrom, C. Berglin, L. Linden, M. Hult, P. Ask, P. Wiklund, U. Dept. of Biomedical Engineering Linköping University Linköping Sweden Swedish School of Textiles University College of Borås Borås Sweden Dept. of Computer Science and Electronics Mälardalen University Västerås Sweden Dept. of Biomedical Engineering and Informatics Umeå University Hospital Umeå Sweden

ISBN: (纸本)0863416586

Research in textile sensors has lead to new ways to measure electrocardiograms (ECG). However, additional disturbances from, for example, muscular noise and high skin-electrode impedances often result in poor signal quality. The paper contains a simple application of canonical correlation analysis (CCA) on multi channel ECG signals recorded with textile electrodes. Using CCA to solve the blind source separation (BSS) problem, we intend to separate the ECG signal from the various noise sources. The method (CCABSS) was compared to simple averaging of the ECG channels and to the independent component analysis method (ICA). A heart beat detector was used to evaluate the signal quality. Results show that the signal was completely lost while simulating various noise in 33%, 17% and 7% of the cases for averaging, ICA and CCA, respectively.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

Scheduling of tasks with batch-shared I/O on heterogeneous systems 06

Scheduling of tasks with batch-shared I/O on heterogeneous s...

引用

Proceedings of the 20th international conference on Parallel and distributed processing

作者： Nagavijayalakshmi Vydyanathan Gaurav Khanna Umit Catalyurek Tahsin Kurc P. Sadayappan Joel Saltz Dept. of Computer Science and Engineering The Ohio State University Columbus OH Dept. of Biomedical Informatics The Ohio State University Columbus OH and Dept. of Electrical and Computer Engineering The Ohio State University Columbus OH Dept. of Biomedical Informatics The Ohio State University Columbus OH Dept. of Computer Science and Engineering The Ohio State University Columbus OH and Dept. of Biomedical Informatics The Ohio State University Columbus OH

ISBN: (纸本)9781424400546

This paper proposes a novel strategy that uses hypergraph partitioning and K-way iterative mapping-refinement heuristics for scheduling a batch of data-intensive tasks with batch-shared I/O behavior on heterogeneous collections of storage and compute clusters. The strategy formulates file sharing among tasks as a hypergraph to minimize the I/O overheads due to duplicate file transfers and employs a K-way iterative mapping-refinement scheme to adapt to the heterogeneity of compute clusters and storage networks in the system. We evaluate the proposed approach through real experiments and simulations on application scenarios from two application domains; satellite data processing and biomedical imaging. Our experimental results show that our approach can achieve significant performance improvement over algorithms such as HPS, Shortest Job First, MinMin, MaxMin and Sufferage for workloads with high degree of shared I/O among tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ICA-based EEG spatio-temporal dipole source localization: A model study

ICA-based EEG spatio-temporal dipole source localization: A ...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Zou, Ling Zhu, Shan-An He, Bin Department of Computer Science and Technology Jiangsu Polytechnic University 213016 China College of Electrical Engineering Zhejiang University Hangzhou China Dept. of Biomedical Engineering University of Minnesota Minneapolis MN 55455 United States

ISBN: (纸本)3540344829

In this paper, we examine the performance of an Independent Component Analysis (ICA) based dipole localization approach to localize multiple source dipoles under noisy environment. Uncorrelated noise of up to 40% was added to scalp EEG signals. The performance of the ICA-based algorithm is compared with the conventional localization procedure using Simplex method. The present simulation results indicate the robustness of the ICA-based approach in localizing multiple dipoles of independent sources. © Springer-Verlag Berlin Heidelberg 2006.

关键词： biomedical engineering

来源：评论

学校读者我要写书评

暂无评论

An extensible global address space framework with decoupled task and data abstractions 20

An extensible global address space framework with decoupled ...

引用

20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006

作者： Krishnamoorthy, Sriram Catalyurek, Umit Nieplocha, Jarek Rountev, Atanas Sadayappan, P. Dept. of Computer Science and Engineering Ohio State University Columbus OH 43210 United States Dept. of Biomedical Informatics Ohio State University Columbus OH 43210 United States Computational Sciences and Mathematics Pacific Northwest National Laboratory Richland WA 99352 United States

ISBN: (纸本)1424400546

Although message passing using MPI is the dominant model for parallel programming today, the significant effort required to develop high-performance MPI applications has prompted the development of several parallel programming models that are more convenient. Programming models such as Co-Array Fortran, Global Arrays, Titanium, and UPC provide a more convenient global view of the data, but face significant challenges in delivering high performance over a range of applications. It is particularly challenging to achieve high performance using global-address-space languages for unstructured applications with irregular data structures. In this paper, we describe a global-address-space parallel programming framework with decoupled task and data abstractions. The framework centers around the use of task pools, where tasks specify operands in a distributed, globally addressable pool of data chunks. The data chunks can be addressed in a logical multi-dimensional "tuple" space, and are distributed among the nodes of the system. Locality-aware load balancing of tasks in the task pool is achieved through judicious mapping via hyper-graph partitioning, as well as dynamic task/data migration. The framework implements a transparent interface for out-of-core data, so that explicit orchestration of movement of data between disks and memory is not required of the programmer. The use of the framework for implementation of parallel blocksparse tensor computations in the context of a quantum chemistry application is illustrated. © 2006 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Using Space and Attribute Partitioned Partial Replicas for Data Subsetting and Aggregation Queries

Using Space and Attribute Partitioned Partial Replicas for D...

引用

International Conference on Parallel Processing (ICPP)

作者： Li Weng Umit Catalyurek Tahsin Kurc Gagan Agrawal Joel Saltz Dept of Computer Science and Engineering The Ohio State University Columbus OH USA Dept. of Biomedical Informatics The Ohio State University Columbus OH USA

Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-organized, and re-distributed across the storage system. In this paper we investigate methods for efficient execution of queries when replicas of a dataset exist; we assume the replicas have already been created and do not target the replica creation problem. We propose a cost model and algorithm for combined use of space partitioned and attribute partitioned replicas for executing data subsetting range queries. We extend the cost model and propose a greedy algorithm to address range queries with aggregation operations. The extended replica selection algorithm allows uneven partitioning of replicas across storage nodes. Different replicas can be partitioned across different subsets of storage nodes. We have implemented these techniques as part of an automatic data virtualization system and have evaluated the benefits of our techniques using this system. We demonstrate the efficacy of the algorithms on parallel machines using queries on datasets from oil reservoir simulation studies and satellite data processing applications

关键词： Costs Partitioning algorithms Data analysis Subcontracting Data mining Aggregates computer science biomedical engineering Data engineering biomedical informatics

来源：评论

学校读者我要写书评

暂无评论

An extensible global address space framework with decoupled task and data abstractions 06

An extensible global address space framework with decoupled ...

引用

Proceedings of the 20th international conference on Parallel and distributed processing

作者： Sriram Krishnamoorthy Umit Catalyurek Jarek Nieplocha Atanas Rountev S. Sadayappan Dept. of Computer Science and Engineering The Ohio State University Columbus OH Dept. of Biomedical Informatics The Ohio State University Columbus OH Computational Sciences and Mathematics Pacific Northwest National Laboratory Richland WA

ISBN: (纸本)9781424400546

Although message passing using MPI is the dominant model for parallel programming today, the significant effort required to develop high-performance MPI applications has prompted the development of several parallel programming models that are more convenient. Programming models such as Co-Array Fortran, Global Arrays, Titanium, and UPC provide a more convenient global view of the data, but face significant challenges in delivering high performance over a range of applications. It is particularly challenging to achieve high performance using global-address-space languages for unstructured applications with irregular data *** this paper, we describe a global-address-space parallel programming framework with decoupled task and data abstractions. The framework centers around the use of task pools, where tasks specify operands in a distributed, globally addressable pool of data chunks. The data chunks can be addressed in a logical multidimensional "tuple" space, and are distributed among the nodes of the system. Locality-aware load balancing of tasks in the task pool is achieved through judicious mapping via hyper-graph partitioning, as well as dynamic task/data migration. The framework implements a transparent interface for out-of-core data, so that explicit orchestration of movement of data between disks and memory is not required of the programmer. The use of the framework for implementation of parallel blocksparse tensor computations in the context of a quantum chemistry application is illustrated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A multiresolution enhancement to generic classifiers of subcellular protein location images

A multiresolution enhancement to generic classifiers of subc...

引用

IEEE International Symposium on biomedical Imaging

作者： T. Merryman K. Williams G. Srinivasa A. Chebird J. Kovacevic Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA Department of Science and Mathematics University of the Virgin Islands Saint Thomas U. S. Virgin Islands Dept. of Science and Mathematics St Thomas VI Biomedical Engineering Carnegie Mellon University Pittsburgh PA USA Biomedical Engineering Carnegie Mellon University Pittsburgh PA

We propose an algorithm for the classification of fluorescence microscopy images depicting the spatial distribution of proteins within the cell. The problem is at the forefront of the current trend in biology towards understanding the role and function of all proteins. The importance of protein subcellular location was pointed out by Murphy, whose group produced the first automated system for classification of images depicting these locations, based on diverse feature sets and combinations of classifiers. With the addition of the simplest multiresolution features, the same group obtained the highest reported accuracy of 91.5% for the denoised 2D HeLa data set. Here, we aim to improve upon that system by adding the true power of multiresolution adaptivity. In the process, we build a system able to work with any feature sets and any classifiers, which we denote as a generic classification system (GCS). Our system consists of multiresolution (MR) decomposition in the front, followed by feature computation and classification in each subband, yielding local decisions. This is followed by the crucial step of combining all those local decisions into a global one, while at the same time ensuring that the resulting system does no worse than a no-decomposition one. On a nondenoised data set and a much smaller number of features (a combination of texture and Zernicke moment features) and a neural network classifier, we obtain a high accuracy of 89.8%, effectively proving that the space-frequency localized information in the subbands adds to the discriminative power of the system

关键词： Image resolution Fluorescence Spatial resolution Protein engineering Microscopy biomedical engineering Humans Image analysis biomedical computing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Semantics, Web and Mining: Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2006年 4289 LNAI卷 v-vi页

作者： Berendt, Bettina Hotho, Andreas Mladenič, Dunja Semeraro, Giovanni Spiliopoulou, Myra Stumme, Gerd Van Someren, Maarten Ackermann, Markus Grobelnik, Marko Svátek, Vojtěch Institute of Information Systems Humboldt University Berlin Germany Knowledge and Data Engineering Group University of Kassel Germany J. Stefan Institute Ljubljana Slovenia Department of Informatics University of Bari Italy Faculty of Computer Science Otto-von-Guericke-Univ. Magdeburg Germany Informatics Institute University of Amsterdam Netherlands Dept. of Natural Language Processing Institute for Computer Science University of Leipzig Germany University of Economics Prague Czech Republic

来源：评论

学校读者我要写书评

暂无评论

COST292 experimental framework for TRECVID 2006

COST292 experimental framework for TRECVID 2006

引用

TREC Video Retrieval Evaluation, TRECVID 2006

作者： Ćalić, J. Krämer, P. Naci, U. Vrochidis, S. Aksoy, S. Zhangk, Q. Benois-Pineau, J. Saracoglu, A. Doulaverakis, C. Jarina, R. Campbell, N. Mezaris, V. Kompatsiaris, I. Spyrou, E. Koumoulos, G. Avrithis, Y. Dalkilic, A. Alatan, A. Hanjalic, A. Izquierdo, E. Dept. of Computer Science University of Bristol 2.11 MVB Woodland Road Bristol BS8 1UB United Kingdom LaBRI University of Bordeaux 1 351 cours de la Libération F-33405 Talence France Delft University of Technology Mekelweg 4 2628CD Delft Netherlands Informatics and Telematics Institute Centre for Research and Technology Hellas Thermi-Panorama Road P.O. Box 361 57001 Thermi-Thessaloniki Greece Department of Computer Engineering Bilkent University Bilkent 06800 Ankara Turkey Department of Electronic Engineering Queen Mary University of London Mile End London E1 4NS United Kingdom Department Of Electrical and Electronics Engineering Middle East Technical University 06531 Ankara Turkey Image Video and Multimedia Laboratory National Technical University of Athens 9 Iroon Polytechniou Str 157 80 Athens Greece Department of Computer Engineering Hacettepe University Cankaya 06532 Ankara Turkey Department of Telecommunications University of Zilina Univerzitna 1 010 26 Zilina Slovakia

In this paper we give an overview of the four TRECVID tasks submitted by COST292, European network of institutions in the area of semantic multimodal analysis and retrieval of digital video media. Initially, we present shot boundary evaluation method based on results merged using a confidence measure. The two SB detectors user here are presented, one of the Technical University of Delft and one of the LaBRI, University of Bordeaux 1, followed by the description of the merging algorithm. The high-level feature extraction task comprises three separate systems. The first system, developed by the National Technical University of Athens (NTUA) utilises a set of MPEG-7 low-level descriptors and Latent Semantic Analysis to detect the features. The second system, developed by Bilkent University, uses a Bayesian classifier trained with a "bag of subregions" for each keyframe. The third system by the Middle East Technical University (METU) exploits textual information in the video using character recognition methodology. The system submitted to the search task is an interactive retrieval application developed by Queen Mary, University of London, University of Zilina and ITI from Thessaloniki, combining basic retrieval functionalities in various modalities (i.e. visual, audio, textual) with a user interface supporting the submission of queries using any combination of the available retrieval tools and the accumulation of relevant retrieval results over all queries submitted by a single user during a specified time interval. Finally, the rushes task submission comprises a video summarisation and browsing system specifically designed to intuitively and efficiently presents rushes material in video production environment. This system is a result of joint work of University of Bristol, Technical University of Delft and LaBRI, University of Bordeaux 1.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：