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

international symposium on Logistics and Industrial Informatics, LINDI

作者： Sándor Szénási Zoltán Vámossy Miklós Kozlovszky Doctoral School of Applied Informatics Óbuda University Budapest Hungary John von Neumann Faculty of Informatics Óbuda University Budapest Hungary Laboratory of Parallel and Distributed Computing MTA SZTAKI Budapest Hungary

The processing of microscopic tissue images is nowadays done more and more using special immunodiagnostic-evaluation software products. Often to evaluate the samples, the first step is determining the number and location of cell nuclei. To do this, one of the most promising methods is the region growing, but this algorithm is very sensitive to the appropriate setting of different parameters. Due to the large number of parameters and due to the big set of possible values setting those parameters manually is a quite hard task, so we developed a genetic algorithm to optimize these values. The first step of the development is the statistical analysis of the parameters, and the determination of the important features, to extract valuable information for a to-be-implemented genetic algorithm that will perform the optimization.

关键词： Optimization Genetic algorithms Gold Standards Medical services Shape Databases

来源：评论

学校读者我要写书评

暂无评论

A Coarse-grained parallel Algorithm for the Matrix Chain Order Problem 12

A Coarse-grained Parallel Algorithm for the Matrix Chain Ord...

引用

Simulation Multiconference

作者： Dilson R. Higa Marco A. Stefanes Federal University of Mato Grosso do Sul

ISBN: (纸本)9781618397881

The matrix chain order problem (MCOP) is an important example of dynamic programming problem. It has a simple definition and is frequently used to represent a larger class of dynamic programming problems, called Non-serial Polyadic Problems. This paper presents a coarse-grained solution for the MCOP with O(n~3/p~3) time and O(1) communication steps in worst case. The paper will also present the experimental results of an implementation of the algorithm. In our experiments we got speedups reaching 6.61 with 32 processes. As far as we know, that is the faster solution to the problem in distributed memory computing both the point of view theoretical as practical.

关键词： Dynamic programming Matrix chain order Coarse-grained multicomputer dynamic programming parallel algorithms PROBLEM SOLUTION linearly ordered set matrices

来源：评论

学校读者我要写书评

暂无评论

Agent-based integration of rescue systems for first responders

Agent-based integration of rescue systems for first responde...

引用

international symposium on Applied Machine Intelligence and Informatics (SAMI)

作者： Z. Balogh E. Gatial O. Habala L. Hluchý Institute of Informatics Department of Parallel and Distributed Computing Slovak Academy of Sciences Bratislava Slovakia

Routine operations of emergency first responders are usually well managed. The situation is different for mass casualty emergencies where more people and properties are threatened. In such situations there are no predefined plans in place and mitigation is solved mostly through crisis management. Teams managing such acute accidents are often working in information insufficiency. Timely information exchange between involved agencies, common understanding of data and fast provision of knowledge can save lives and protect properties. Useful information is heterogeneous and is distributed across many organizations in disparate information sources in many formats with different access policies and in varying quality. The information sources range from sensors deployed on incidence sites, publicly available data sources, corporate legacy systems, documents stored on remote locations to human end-users providing information using mobile devices. This article addresses operational challenges of First Responders and complementary challenges in accessing and analyzing information from multiple sources to provide advanced capabilities for command and control in emergency response. Herein we propose to use an agent-based infrastructure for supporting such interoperability. We propose to build the framework amplifying an agent infrastructure developed in scope of the SECRICOM EU integrated project. In this article we focus mainly on the conceptual architecture of such integration framework.

关键词： Crisis management Fires Sensors Accidents Emergency services Mobile agents Informatics

来源：评论

学校读者我要写书评

暂无评论

Towards Auction-Based HPC computing in the Cloud

引用

Computer Technology and Application 2012年第7期3卷 499-509页

作者： Moussa Taifi Justin Y. Shi Abdallah Khreishah Computer and Information Sciences Department Temple University Philadelphia PA 19122 USA

Cloud computing is expanding widely in the world of IT infrastructure. This is due partly to the cost-saving effect of economies of scale. Fair market conditions can in theory provide a healthy environment to reflect the most reasonable costs of computations. While fixed cloud pricing provides an attractive low entry barrier for compute-intensive applications, both the consumer and supplier of computing resources can see high efficiency for their investments by participating in auction-based exchanges. There are huge incentives for the cloud provider to offer auctioned resources. However, from the consumer perspective, using these resources is a sparsely discussed challenge. This paper reports a methodology and framework designed to address the challenges of using HPC （High Performance computing） applications on auction-based cloud clusters. The authors focus on HPC applications and describe a method for determining bid-aware checkpointing intervals. They extend a theoretical model for determining checkpoint intervals using statistical analysis of pricing histories. Also the latest developments in the SpotHPC framework are introduced which aim at facilitating the managed execution of real MPI applications on auction-based cloud environments. The authors use their model to simulate a set of algorithms with different computing and communication densities. The results show the complex interactions between optimal bidding strategies and parallel applications performance.

关键词： Auction-based cloud computing fault tolerance cloud HPC （high performance computing）

来源：评论

学校读者我要写书评

暂无评论

On the Use of GPUs in Realizing Cost-Effective distributed RAID

On the Use of GPUs in Realizing Cost-Effective Distributed R...

引用

international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Aleksandr Khasymski M. Mustafa Rafique Ali R. Butt Sudharshan S. Vazhkudai Dimitrios S. Nikolopoulos Virginia Polytechnic Institute and State University USA Oak Ridge National Laboratory USA Queen's University Belfast UK

The exponential growth in user and application data entails new means for providing fault tolerance and protection against data loss. High Performance computing (HPC) storage systems, which are at the forefront of handling the data deluge, typically employ hardware RAID at the backend. However, such solutions are costly, do not ensure end-to-end data integrity, and can become a bottleneck during data reconstruction. In this paper, we design an innovative solution to achieve a flexible, fault-tolerant, and high-performance RAID-6 solution for a parallel file system (PFS). Our system utilizes low-cost, strategically placed GPUs - both on the client and server sides - to accelerate parity computation. In contrast to hardware-based approaches, we provide full control over the size, length and location of a RAID array on a per file basis, end-to-end data integrity checking, and parallelization of RAID array reconstruction. We have deployed our system in conjunction with the widely-used Lustre PFS, and show that our approach is feasible and imposes acceptable overhead.

关键词： Arrays Graphics processing unit Encoding Hardware Acceleration Kernel

来源：评论

学校读者我要写书评

暂无评论

computing Capacity and Connectivity in Cognitive Radio Ad-Hoc Networks

Computing Capacity and Connectivity in Cognitive Radio Ad-Ho...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Qiang-Sheng Hua Haisheng Tan Yuexuan Wang Hongxing Li Dongxiao Yu Francis C.M. Lau Chuan Wu Institute for Theoretical Computer Science Institute for Interdisciplinary Information Sciences Tsinghua University Beijing China Department of Computer Science University of Hong Kong Hong Kong China

ISBN: (纸本)9781467350648

We present some unique challenges in cognitive radio ad-hoc networks (CRAHNs) that are not present in conventional single-channel or multi-channel wireless ad-hoc networks. We first briefly survey these challenges and their potential impact on the design of efficient algorithms for several fundamental problems in CRAHNs. Then, we describe our recent contributions to the capacity maximization problem [29] and the connectivity problem [32]. The capacity maximization problem is to maximize the overall throughput utility among multiple unicast sessions; the connectivity problem is to find a connected subgraph from the given cognitive radio network where each secondary node is equipped with multiple radios. By assuming the physical interference model and asynchronous communications, we reformulate the above two problems where the capacity maximization problem is to find the maximum number of simultaneously transmitting links in secondary networks, and the connectivity problem is to construct a spanning tree over secondary networks using the fewest timeslots. We discuss the challenging issues for designing distributed approximation algorithms and give a preliminary framework for solving these two problems.

关键词： Ad hoc networks Protocols Interference Throughput Approximation algorithms Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

distributed PrefixSpan Algorithm Based on MapReduce

Distributed PrefixSpan Algorithm Based on MapReduce

引用

2012 international symposium on Information Technologies in Medicine and Education(ITME2012)

作者： WEI Yong-qing Basic Education Department Shandong Police College Jinan,China LIU Dong Shandong Provincial Key Laboratory for distributed Computer Software Novel Technology Shandong Normal University Jinan China.DUAN Lin-shan Shandong Normal University Jinan China

For mining sequential patterns on massive data set,the distributed sequential pattern mining algorithm based on MapReduce programming model and PrefixSpan is *** tasks are decomposed to many small tasks,the Map function is used to mine each Prefix-Projected sequential pattern,and the projected databases were constructed *** simplifies the search space and acquires a higher mining *** the intermediate values are passed to a Reduce function which merges together all these values to produce a possibly smaller set of *** theoretical analyses and experimental results show MR-PrefixSpan reduces the time of scanning *** solves the problem of mining massive data effectively,has considerable speedup and scaleup performances with an increasing number of processors on the Hadoop platform.

关键词： cloud computing parallel dispose MapReduce model PrefixSpan algorithm sequential pattern Hadoop platform

来源：评论

学校读者我要写书评

暂无评论

Transparent and Efficient Shared-State Management for Optimistic Simulations on Multi-core Machines

Transparent and Efficient Shared-State Management for Optimi...

引用

international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Alessandro Pellegrini Roberto Vitali Sebastiano Peluso Francesco Quaglia High Performance and Dependable Computing Systems Research Group DIIAG University of Roma La Sapienza Italy

Traditionally, Logical Processes (LPs) forming a simulation model store their execution information into disjoint simulations states, forcing events exchange to communicate data between each other. In this work we propose the design and implementation of an extension to the traditional Time Warp (optimistic) synchronization protocol for parallel/distributed simulation, targeted at shared-memory/multicore machines, allowing LPs to share parts of their simulation states by using global variables. In order to preserve optimism's intrinsic properties, global variables are transparently mapped to multi-version ones, so to avoid any form of safety predicate verification upon updates. Execution's consistency is ensured via the introduction of a new rollback scheme which is triggered upon the detection of an incorrect global variable's read. At the same time, efficiency in the execution is guaranteed by the exploitation of non-blocking algorithms in order to manage the multi-version variables' lists. Furthermore, our proposal is integrated with the simulation model's code through software instrumentation, in order to allow the application-level programmer to avoid using any specific API to mark or to inform the simulation kernel of updates to global variables. Thus we support full transparency. An assessment of our proposal, comparing it with a traditional message-passing implementation of variables' multi-version is provided as well.

关键词： Synchronization Proposals Protocols Kernel Arrays Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Dynamic Sliding Mode Control Applied in parallel Robot System

Dynamic Sliding Mode Control Applied in Parallel Robot Syste...

引用

10th international symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Zhu Caihong Zhang Hongtao Suzhou Vocat Univ Dept Elect Informat Engn Suzhou Peoples R China

ISBN: (纸本)9780769544151

parallel robot has many good features, such as high rigidity, great load and high precision. Directed against the parallel robot mechanism with AC servo-motor drive, a model of controlling system was established. A kind of dynamic sliding mode control algorithm was designed, and the stability of this control algorithm was analyzed. A simulative experiment of trajectory tracking was made on the Matlab / Simulink. The simulation result was given to prove the validity of the variable structure controller, and a good performance in tracking, and the high-accuracy real time control of the parallel robot mechanism is implemented.

关键词： parallel robot sliding mode control servo motor trajectory tracking

来源：评论

学校读者我要写书评

暂无评论

parallel Domain Decomposition Methods for Ray-Tracing on multi-cores and multi-processors

Parallel Domain Decomposition Methods for Ray-Tracing on mul...

引用

10th international symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Venet, Cedric Magoules, Frederic Ecole Cent Paris Appl Math & Syst Lab Chatenay Malabry France

ISBN: (纸本)9780769544151

In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam-tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. parallel numerical experiments, carried out on a real world problem-namely the acoustic pollution analysis within a large city-illustrate the performance of this new domain decomposition method.

关键词： Domain decomposition methods parallel and distributed computing Acoustics Ray-tracing methods Beam-tracing methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：