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

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Wang, Li Fu, Tom Z. J. Ma, Richard T. B. Winslett, Marianne Zhang, Zhenjie Yitu Technol Shanghai Peoples R China Adv Digital Sci Ctr Singapore Singapore Natl Univ Singapore Singapore Singapore UIUC Champaign IL USA

ISBN: (纸本)9781450356435

Elasticity is highly desirable for stream systems to guarantee low latency against workload dynamics, such as surges in arrival rate and fluctuations in data distribution. Existing systems achieve elasticity using a resource-centric approach that repartitions keys across the parallel instances, i.e. executors, to balance the workload and scale operators. However, such operator-level repartitioning requires global synchronization and prohibits rapid elasticity. We propose an executor-centric approach that avoids operator-level key repartitioning and implements executors as the building blocks of elasticity. By this new approach, we design the Elasticutor framework with two level of optimizations: i) a novel implementation of executors, i.e., elastic executors, that perform elastic multi-core execution via efficient intra-executor load balancing and executor scaling and ii) a global model-based scheduler that dynamically allocates CPU cores to executors based on the instantaneous workloads. We implemented a prototype of Elasticutor and conducted extensive experiments. We show that Elasticutor doubles the throughput and achieves up to two orders of magnitude lower latency than previous methods for dynamic workloads of real-world applications.

关键词： streaming system distributed system load balancing elasticity

来源：评论

学校读者我要写书评

暂无评论

Red Blood Cells Segmentation: A Fully Convolutional Network Approach 16

Red Blood Cells Segmentation: A Fully Convolutional Network ...

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Sadafi, Ario Radolko, Martin Serafeimidis, Iosif Hadlak, Steffen Univ Rostock Rostock Germany Arivis AG Munich Germany

ISBN: (纸本)9781728111414

Red blood cell segmentation in microscopic images is the first step for various clinical studies carried out on blood samples such as cell counting, cell shape identification, etc. Conventional methods while often showing a high accuracy are heavily depending on the acquisition modality. Deep learning approaches have shown to be more robust regarding such modalities and still showing a comparable accuracy. In this paper, we first investigate necessary steps to apply a specific type of deep learning methods, namely fully convolutional networks, to red blood cell segmentation. Based on data given and constraints imposed by our partners mainly regarding a high throughput of their data we then describe an exemplary application. First results show, that even with a focus on high performance a good accuracy above 90% can be reached.

关键词： Microscopic image analysis Red blood cells Cell Segmentation Fully convolutional networks

来源：评论

学校读者我要写书评

暂无评论

基于Hadoop技术的大规模数据分布式存储技术研究

引用

自动化与仪器仪表 2024年第10期 182-186页

作者：魏迎咸阳职业技术学院陕西咸阳712000

随着数据信息的规模不断增加,数据存储技术引来的全新的调整,为了提升大规模数据的信息存储能力,研究设计了Hadoop生态系统的核心组件,对大规模数据分布式存储的处理方法。Hadoop分布式文件系统通过其独特的存储机制和高容错性,有效地... 详细信息

随着数据信息的规模不断增加,数据存储技术引来的全新的调整,为了提升大规模数据的信息存储能力,研究设计了Hadoop生态系统的核心组件,对大规模数据分布式存储的处理方法。Hadoop分布式文件系统通过其独特的存储机制和高容错性,有效地管理了大型文件的存储问题。而MapReduce模型则简化了并行数据处理的复杂性,使得对大规模数据集的处理变得更加高效和可靠。结果显示,分布式处理方式的图片处理速度总是小于单机处理方式,二者处理速度最大相差1502230 ms。研究提出的方法,对系统的CPU占用率更低,可以使系统处理更多的数据信息,该方法对系统CPU的占用率最高仅63%左右。研究提出的数据存储技术可以减小系统面对大规模数据时的压力,为大规模数据存储提供了一种新的技术方案。

关键词： Hadoop技术分布式存储数据存储大规模数据

来源：评论

学校读者我要写书评

暂无评论

基于Hadoop的景区人流密度预测模型设计与实现

引用

电子设计工程 2021年第18期29卷 39-43页

作者：马骞西安航空职业技术学院陕西西安710089

针对景区人流监控精细化、高效化的需求,文中对视频图像的背景建模与轮廓提取方法进行研究,构建了面向海量计算需求的人流密度预测模型。该模型需要对输入模型的图像质量进行检测,校核图像的分辨率、像素是否满足算法的输入要求。对图... 详细信息

针对景区人流监控精细化、高效化的需求,文中对视频图像的背景建模与轮廓提取方法进行研究,构建了面向海量计算需求的人流密度预测模型。该模型需要对输入模型的图像质量进行检测,校核图像的分辨率、像素是否满足算法的输入要求。对图像的背景引入混合高斯模型进行建模,并借助图像的前景边缘检测描绘人体轮廓,基于Canny算子对人体轮廓进行跟踪、提取特征,以这些轮廓为基础实现人流密度的计算。将最终的提取结果输入到神经网络中,根据时间分布完成人流的预测。在算法的实现上考虑到计算需求,文中搭建了7个计算集群的Hadoop分布式计算平台,实现了算法的分布式存储和并行化计算。计算结果表明,相较于传统算法,该算法提取的人体轮廓更精细、轮廓长度更长,漏检率由13.21%降低到5.24%,人流的预测精度达到了92.43%,提升了7.12%。

关键词：边缘监测背景建模图像处理 Hadoop 人流预测

来源：评论

学校读者我要写书评

暂无评论

Indigo: A Domain-Specific Language for Fast, Portable image Reconstruction 32

Indigo: A Domain-Specific Language for Fast, Portable Image ...

引用

27th International Heterogeneity in Computing Workshop in conjunction with 32nd IEEE International parallel and distributed processing Symposium (IPDPS)

作者： Driscoll, Michael Brock, Benjamin Ong, Frank Tamir, Jonathan Liu, Hsiou-Yuan Lustig, Michael Fox, Armando Yelick, Katherine Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA

ISBN: (纸本)9781538643686

Linear operators used in iterative methods like conjugate gradient have typically been implemented either as "matrix-driven" subroutines backed by explicit sparse or dense matrices, or as "matrix-free" subroutines that implement specific linear operations directly (e.g. FFTs). The matrix-driven approach is generally more portable because it can target widely-available BLAS libraries, but it can be inefficient in terms of time and space complexity. In contrast, the matrix-free approach is more performant because it leverages structure in operations, but it requires each operator be re-implemented on each new platform. To increase performance and portability, we propose a hybrid approach that represents linear operators as expression trees. Leaf nodes in the tree are either matrix-free or matrix-driven operators, and interior nodes represent mathematical compositions (sums, products, transposes) or structural compositions (stacks, block diagonals, etc.) of the leaf operators. This representation enables expert-guided reordering and fusion transformations that can improve performance or reduce memory pressure. We implement our approach in a domain-specific language called Indigo. We assess Indigo on image reconstruction problems arising in four application areas: magnetic resonance imaging, ptychography, magnetic particle imaging, and fluorescent microscopy. We give performance results from vendor BLAS libraries, and we introduce specializations to Sparse BLAS routines that achieve near-Roofline performance on multi-core, many-core, and GPU systems.

关键词： Sparse matrices image reconstruction Algorithms Vegetation Production facilities Imaging Integrated circuits"

来源：评论

学校读者我要写书评

暂无评论

distributed parallel Simulation of Primary Sample Space Metropolis Light Transport 18th

Distributed Parallel Simulation of Primary Sample Space Metr...

引用

18th International Conference on Algorithms and Architectures for parallel processing (ICA3PP)

作者： Wu, Changmao Zhang, Changyou Sun, Qiao Chinese Acad Sci Inst Software Lab Parallel Software & Computat Sci Beijing Peoples R China

ISBN: (纸本)9783030050511;9783030050504

Monte-Carlo rendering algorithms are known for producing highly realistic images, but at a significant computational cost, because they rely on tracing up to trillions of light paths through a scene to simulate physically based light transport. For this reason, a large body of research exists on various techniques for accelerating these costly algorithms. As one of the Monte-Carlo rendering algorithms, PSSMLT (Primary Sample Space Metropolis Light Transport) is widely used nowadays for photorealistic rendering. Unfortunately, the computational cost of PSSMLT is still very high since the space of light paths in high-dimension and up to trillions of paths are typically required in such path space. Recent research on PSSMLT has proposed a variety of optimized methods for single node rendering, however, multi-node rendering for PSSMLT is rarely mentioned due in large part to the complicated mathematical model, complicated physical processes and the irregular memory access patterns, and the imbalanced workload of light-carrying paths. In this paper, we present a highly scalable distributed parallel simulation framework for PSSMLT. Firstly, based on light transport equation, we propose the notion of sub-image with certain property for multi-node rendering and theoretically prove that the whole set of sub-images can be combined to produce the final image;Then we further propose a sub-image based assignment partitioning algorithm for multi-node rendering since the traditional demand-driven assignment partitioning algorithm doesn't work well. Secondly, we propose a physically based parallel simulation for the PSSMLT algorithm, which is revealed on a parallel computer system in master-worker paradigm. Finally, we discuss the issue of granularity of the assignment partitioning and some optimization strategies for improving overall performance, and then a static/dynamic hybrid scheduling strategy is described. Experiments show that framework has a nearly linear speedup along wi

关键词： Primary sample space metropolis light transport Physically based ray tracing Assignment partitioning Hybrid scheduling distributed computing Performance optimization

来源：评论

学校读者我要写书评

暂无评论

DEEP image CLUSTERING USING CONVOLUTIONAL AUTOENCODER EMBEDDING WITH INCEPTION-LIKE BLOCK 25

DEEP IMAGE CLUSTERING USING CONVOLUTIONAL AUTOENCODER EMBEDD...

引用

25th IEEE International Conference on image processing (ICIP)

作者： Wang, Qiang Xu, Jiaqing Li, Rongchun Qiao, Peng Yang, Ke Li, Shijie Dou, Yong Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781479970612

image clustering is one of the challenging tasks in machine learning, and has been extensively used in various applications. Recently, various deep clustering methods has been proposed. These methods take a two-stage approach, feature learning and clustering, sequentially or jointly. We observe that these works usually focus on the combination of reconstruction loss and clustering loss, relatively little work has focused on improving the learning representation of the neural network for clustering. In this paper, we propose a deep convolutional embedded clustering algorithm with inception-like block (DCECI). Specifically, an inception-like block with different type of convolution filters are introduced in the symmetric deep convolutional network to preserve the local structure of convolution layers. We simultaneously minimize the reconstruction loss of the convolutional autoencoders with inception-like block and the clustering loss. Experimental results on multiple image datasets exhibit the promising performance of our proposed algorithm compared with other competitive methods.

关键词： Deep Clustering Convolutional Autoencoders Kullback-Leibler divergence

来源：评论

学校读者我要写书评

暂无评论

Brain Tumor Segmentation by Texture Feature Extraction with the parallel Implementation of Fuzzy C-Means using CUDA on GPU 5

Brain Tumor Segmentation by Texture Feature Extraction with ...

引用

5th IEEE International Conference on parallel, distributed and Grid Computing (PDGC)

作者： Saxena, Sanjay Shama, Suraj Int Inst Informat Technol Bhubaneswar IIIT Bhuban Dept Comp Sci & Engn Bhubaneswar India

ISBN: (纸本)9781728106465

Exact segmentation of the brain tumor is one of the imperative tasks in medical image processing and its analysis as it deals with extracting the information of the tumorous region from the brain MRI sequences. Automated segmentation and detection of brain tumors from the brain MRI is an exigent issue caused by the texture, size, shape, and location. In this paper, a significant method of brain tumor segmentation from the FLAIR MRI sequences is by classifying local window followed by parallel fuzzy c means clustering. Fuzzy c- means methods have shown their efficiency in extracting a variety of objects in several medical image processing applications. However, one of the major issues of these algorithms is high computational requirements at the time of dealing with large data set. Nowadays, NVIDIA's GPU plays an extremely essential role in implementing such time-consuming algorithms to reduce the time complexity. Our experiments based on NCI-MICCAI BRATS 2017 FLAIR MRI of HGG (High-Grade Glioma) demonstrate the efficiency of the implemented parallel algorithm. For the segmentation of tumorous region, a mechanism of sliding window is implemented on CPU (host) in which a 45 X 45 sized window is taken to classify whether that particular window is having tumor region or not. For perfect segmentation at the GPU (device) side, fuzzy c means technique is used to get the exact location of the tumor. Approx 17.6 speed up obtained, for the BRATS data sets over the implementation of the algorithm on CPU. Apart from speed up significant dice similarity coefficients are obtained which shows the efficient segmentation in the reasonable time.

关键词： Brain Tumor Segmentation Computed Unified Device Architecture Graphics processing Unit High Performance Computing Texture Feature Extraction Fuzzy C-means

来源：评论

学校读者我要写书评

暂无评论

Fish Detection and Tracking in Pisciculture Environment using Deep Instance Segmentation

Fish Detection and Tracking in Pisciculture Environment usin...

引用

IEEE Region 10 International Conference TENCON

作者： C.S. Arvind R Prajwal Prithvi Narayana Bhat A Sreedevi K N Prabhudeva RV College of Engineering Bengaluru India Karnataka Veterinary Animal and Fisheries Sciences University Bidar India

This study presents a novel approach in detecting and tracking of fish in pisciculture. Pisciculture in general involves challenging tasks of counting and monitoring fish in natural or nature like, man-made habitats such as inland fisheries for breeding, feeding and sorting purposes. These are presently achieved using conventional methods that are inefficient when implemented in large-scale commercial productions. To overcome such difficulties and improve the efficiency of the processes, images of fish and fish seeds are captured in natural murky water habitats through a vision sensor on board an unmanned aerial vehicle (UAV). In this research paper, a deep instance segmentation algorithm called Mask R-CNN along with GOTURN tracking algorithm is employed for real time fish detection and tracking. A comparison study is also carried out (i) fish detection on high resolution images (ii) fish detection on high resolution image multi-region parallel processing (iii) fish detection on high resolution image multi-region parallel processing with tracking. The results are found to be accurate with image multi-region parallel processing along with tracking, with an F1 score of 0.91 at 16 frames per seconds on in-land fishes environment.

关键词： Fish Aquaculture Unmanned aerial vehicles Training Machine learning image segmentation Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Q-Graph: Preserving Query Locality in Multi-Query Graph processing 1

Q-Graph: Preserving Query Locality in Multi-Query Graph Proc...

引用

1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and Systems (GRADES) and Network Data Analytics (NDA)

作者： Mayer, Christian Mayer, Ruben Grunert, Jonas Rothermel, Kurt Tariq, Muhammad Adnan Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany

ISBN: (纸本)9781450356954

Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis, i.e., processing multiple graph queries in parallel on a shared graph. These applications generate a dynamic number of localized queries around query hotspots such as popular urban areas. However, existing graph processing systems are not yet tailored towards these properties: The employed methods for graph partitioning and synchronization management disregard query locality and dynamism which leads to high query latency. To this end, we propose the system Q-Graph for multi-query graph analysis that considers query locality on three levels. (i) The query-aware graph partitioning algorithm Q-cut maximizes query locality to reduce communication overhead. (ii) The method for synchronization management, called hybrid barrier synchronization, allows for full exploitation of local queries spanning only a subset of partitions. (iii) Both methods adapt at runtime to changing query workloads in order to maintain and exploit locality. Our experiments show that Q-cut reduces average query latency by up to 57 percent compared to static query-agnostic partitioning algorithms.

关键词： distributed Graph processing Graph Query Query-cut Graph Partitioning Hybrid Barrier Synchronisation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：