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

Supercomputing Conference

作者： Jie Tan Hanhua Chen Yonghui Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computing Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781450384421

ISBN: (纸本)9781665483902

To process large-scale real-time data streams, existing distributed stream processing systems (DSPSs) leverage different stream partitioning strategies. The one-to-many data partitioning strategy plays an important role in various applications. With one-to-many data partitioning, an upstream processing instance sends a generated tuple to a potentially large number of downstream processing instances. Existing DSPSs leverage an instance-oriented communication mechanism, where an upstream instance transmits a tuple to different downstream instances separately. However, in one-to-many data partitioning, multiple downstream instances typically run on the same machine to exploit multi-core resources. Therefore, a DSPS actually sends a data item to a machine multiple times, raising significant unnecessary costs for serialization and communication. We show that such a mechanism can lead to serious performance bottleneck due to CPU overload. To address the problem, we design and implement Whale, an efficient RDMA (Remote Direct Memory Access) assisted distributed stream processing system. Two factors contribute to the efficiency of this design. First, we propose a novel RDMA-assisted stream multicast scheme with a self-adjusting non-blocking tree structure to alleviate the CPU workloads of an upstream instance during one-to-many data partitioning. Second, we re-design the communication mechanism in existing DSPSs by replacing the instance-oriented communication with a new worker-oriented communication scheme, which saves significant costs for redundant serialization and communication. We implement Whale on top of Apache Storm and conduct comprehensive experiments to evaluate its performance with large-scale real world datasets. The results show that Whale achieves 56.6x improvement of system throughput and 97% reduction of processing latency compared to existing designs.

关键词： Costs Storms High performance computing Memory management Whales Distributed databases Throughput

来源：评论

学校读者我要写书评

暂无评论

Broken Scale Invariance and the Regularization of a Conformal Sector in Gravity with Wess-Zumino actions

arXiv

引用

arXiv 2023年

作者： Corianò, Claudio Cretì, Mario Maglio, Matteo Maria Dipartimento di Matematica e Fisica Università del Salento INFN Sezione di Lecce Via Arnesano Lecce73100 Italy National Center for HPC Big Data and Quantum Computing Italy Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Via Barsanti 14 Arnesano Lecce73010 Italy University of Heidelberg Philosophenweg 16 Heidelberg69120 Germany

We elaborate on anomaly induced actions of the Wess-Zumino (WZ) form and their relation to the renormalized effective action, which is defined by an ordinary path integral over a conformal sector, in an external gravitational background. In anomaly -induced actions, the issue of scale breaking is usually not addressed, since these actions are obtained only by solving the trace anomaly constraint and are determined by scale invariant functionals. We investigate the changes induced in the structure of such actions once identified in dimensional renormalization (DR) when the ǫ = d − 4 → 0 limit is accompanied by the dimensional reduction (DRed) of the field dependencies. We show that operatorial nonlocal modifications (∼ ǫ) of the counterterms are unnecessary to justify a scale anomaly. In this case, only the ordinary finite subtractions play a critical role in the determination of the scale breaking. This is illustrated for the WZ form of the effective action and its WZ consistency condition, as seen from a renormalization procedure. Logarithmic corrections from finite subtractions are also illustrated in a pure d = 4 (cutoff) scheme. The interplay between two renormalization schemes, one based on dimensional regularization (DR) and the second on a cutoff in d = 4, illustrates the ambiguities of DR in handling the quantum corrections in a curved background. Therefore, using DR in a curved background, the scale and trace anomalies can both be obtained by counterterms that are Weyl invariant only at d = 4. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Multicloud- auto scale with prediction and delta correction algorithm 2

Multicloud- auto scale with prediction and delta correction ...

引用

2nd International Conference on Intelligent computing, Instrumentation and Control Technologies, ICICICT 2019

作者： Harwalkar, Sudheendra Sitaram, DInkar Kidiyoor, Dhanaraj V Milan, L. D'Souza, Ornella Agarwal, Radhika Agarwal, Yamini Center for Cloud Computing and Big Data PES University Dept. of Computer Science Bangalore India

ISBN: (纸本)9781728102832

IT enabled enterprise organizations are embracing multi-cloud to handle their peak loads in addition to their private cloud (own data centers) and the market prediction indicates that by year 2020, about 80% of enterprise will have or working towards multi-cloud enablement for their IT needs. There are multiple products from third-party supporting multi-cloud and also some of the cloud service providers have already enabled the service using proprietary cloud management tools with custom built plug-ins. One of the major challenges in multi-cloud is efficient resource utilization and cost savings without vendor/broker lock-in. At present, multi-cloud interface standardization is still in draft. In this paper we propose handling of cloud burst at peak load with our OpenStack [9] Middleware Framework, which uses default OpenStack services. It also has built-in support for prediction, resource allocation and proactive workload migration techniques which can be integrated easily with cloud provider solutions. © 2019 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Medical image super-resolution algorithm based on multi-scale feature aggregation

Medical image super-resolution algorithm based on multi-scal...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xinyu Han Xun Gong School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu China Manufacturing Industry Chains Collaboration and InformationSupport Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

Ultrasound images are vital for medical diagnostics but often suffer from information loss and blurred details due to limitations in imaging systems and sensor technologies. Many researchers have proposed super-resolution algorithms to enhance medical images. But existing super-resolution methods struggle with the uneven distribution of noise and clarity. To address this, we propose a super-resolution algorithm for medical images based on multi-scale feature aggregation Leveraging the architecture of Unet as our primary framework, our method enhances output details through multi-scale hole convolutions. Taking into consideration the characteristics of ultrasonic images, we propose a frequency domain-based module to enhances edge information while effectively denoising the image. Furthermore, to improve the quality of the output images, we introduce an image processing module grounded in global information. The module ensures clarity while considering the overarching context, thereby preserving global consistency and enhancing output quality. We experiment on three datasets to demonstrate the effectiveness of our model. Additionally, significant improvements in medical image segmentation are observed, proving the practicability of our proposed approach.

关键词： Image segmentation Ultrasonic imaging Image edge detection Frequency-domain analysis Superresolution Noise reduction Noise Medical diagnosis Artificial intelligence Medical diagnostic imaging

来源：评论

学校读者我要写书评

暂无评论

Improvement of Low-Contrast Objective Detecting Capability for YOLOv5 Based on Receptive Field Enhancement and Redundant Feature Reuse

Improvement of Low-Contrast Objective Detecting Capability f...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingyu Xu Jiguo Yu Anming Dong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

YOLOv5s is a classic deep learning target detection framework with balanced speed and performance in recognition, which is widely used in industrial defect inspections. YOLOv5s relies on the residual structure in the C3 module for feature extraction, but due to its simple structure and the small, fixed convolution kernel, it is difficult to accurately and completely extract target features when applied to the detection of defects with inconspicuous features and irregular shapes, which results in a decrease in recognition accuracy. To solve this problem, this paper proposes an improved YOLO architecture based on receptive field enhancement and redundant feature reuse. Firstly, the method designs a redundant feature reuse module (RFRM) to replace the residual structure in the C3 module for feature extraction. This module can deepen the network with a smaller cost and enhance the network’s ability to extract features. Furthermore, the feature reuse process allows the network to deepen while retaining detailed information, enabling the network to classify and localize more accurately. Secondly, a simplified convolutional block attention module (SCBAM) is designed and embedded into the neck of the detection network. This module directs the detection network to focus more on inconspicuous defect features and reduce interference from background noise in the feature map, thereby improving the accuracy of defect classification and localization. Finally, a receptive field enhancement module (RFEM) is designed and inserted between the neck and head of the detection network. This module adds only a small computational cost to expand the receptive field of the network, enabling it to further extract and comb irregular features from the neck in a comprehensive manner, making the features reaching the detection head more complete. Applying the above improvements to defect detection, the experimental results show that the improved YOLO architecture based on receptive field enhancem

关键词： YOLO Head Accuracy Target recognition Shape Computer architecture Feature extraction

来源：评论

学校读者我要写书评

暂无评论

SDGFormer: An Efficient Convolution Network Structurally Similar to Transformer

SDGFormer: An Efficient Convolution Network Structurally Sim...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chaohao Wen Xun Gong School of Computing and Artificial Intelligence SWJTU Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education China National Engineering Laboratory of Integrated Transportation Big Data Application Technology SWJTU Chengdu China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province SWJTU Chengdu China

Deep Neural Networks (DNN) have achieved extraordinary success in many visual recognition tasks. Visual Transformer (ViT), which is derived from Natural Language Processing (NLP), has achieved state-of-the-art (SOTA) results on many tasks due to its capability of capturing long-range dependencies in visual data. However, Existing ViT models are challenging to deploy on devices due to their massive computational consumption, huge memory overhead, and reliance on large datasets. In this work, we address these issues by replacing some computationally expensive and memory-intensive modules in ViT with standard Convolutional Neural Network (CNN) modules. Firstly, we propose an efficient Self-Attention module called SDG-Attention (SDGA) with linear space and time complexity, and an economical FeedForward Network (FFN) composed of group convolution and shuffle channel (SFFN). Then, we develop a lightweight CNN model with SDGA and SFFN, SDGFormer, which embraces several priors of ViT and is LayerNorm-Free. We evaluate SDGFormer on ImageNet-1K and Mini-ImageNet, and the SDGFormer-S achieves a comparable top-1 accuracy of 77.6% on ImageNet-1K with 9.1M parameters and 1.6 GFlops regimes. Moreover, our SDGFormer-T achieves SOTA performance on Mini-ImageNet with 83.3% accuracy, demonstrating good generalization on small datasets without extra data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Efficient data Prefetch Strategy for Deep Learning Based on Non-volatile Memory 15th

An Efficient Data Prefetch Strategy for Deep Learning Based ...

引用

15th International Conference on Green, Pervasive, and cloud computing, GPC 2020

作者： Jiang, Wenbin Liu, Pai Jin, Hai Peng, Jing National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783030642426

Deep learning (DL) systems usually utilize asynchronous prefetch to improve data reading performance. However, the efficiency of the data transfer path from hard disk to DRAM is still limited by disk performance. The emerging non-volatile memory (NVRAM) provides a novel solution for this problem, while few existing researches have considered it. We propose a novel efficient data prefetch strategy for DL based on a heterogeneous memory system combining NVRAM with DRAM. Benefitting from the large capacity and fast reading speed of NVRAM, the strategy uses an asynchronous reading method named sliding NVRAM cache (SNC) to improve the performance of the data transfer paths. A sliding window is applied to map the data from disk to NVRAM and continuously update the data, while non-ideal writing performance of NVRAM can be remitted to a large extent in this strategy. Experiments show that SNC can improve the time performance of diverse deep neural networks training by more than 30%. © 2020, Springer Nature Switzerland AG.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

BED: A Block-Level Deduplication-Based Container Deployment Framework 15th

BED: A Block-Level Deduplication-Based Container Deployment ...

引用

15th International Conference on Green, Pervasive, and cloud computing, GPC 2020

作者： Zhang, Shiqiang Wu, Song Fan, Hao Zou, Deqing Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Scinece and Technology Wuhan430074 China

ISBN: (纸本)9783030642426

Container technology has gained great popularity in cloud environment since containers provide near-native performance and are lighter and less expensive than traditional virtual machines. However, starting up a non-local container, whose image is unavailable locally, is time-consuming. The reason is that pulling an image from a remote registry requires a long time. In this paper, we experimentally find that a lot of redundant data exists among image layers when we pull images from the registry. This redundant data causes additional pull time and makes the startup of a non-local container slower. To minimize the amount of pulled data while providing intact images, we propose a container deployment framework, BED, based on block-level deduplication. To be specific, BED stores an image layer as numerous data blocks and a fingerprint list which is generated based on these data blocks. When BED needs to pull an image, it pulls the fingerprint lists of the image, deduplicates these fingerprint lists, and pulls the data blocks non-existing locally from the registry. Based on the local and pulled blocks, BED reconstructs the image layers for a container. Experiments show that compared with original Docker, BED reduces the time of pulling images by 35% on average and saves about 48% data transmission in the network. © 2020, Springer Nature Switzerland AG.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Qing Liu Qian Gao Jun Fan Zhiqiang Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Ltd Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN— a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model’s effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets.

关键词： Measurement Bridges Contrastive learning Signal processing data processing Vectors Space exploration Resource management Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

How to use open-pFind in deep proteomics data analysis?—A protocol for rigorous identification and quantitation of peptides and proteins from mass spectrometry data

引用

Biophysics Reports 2021年第3期7卷 207-226页

作者： Guangcan Shao Yong Cao Zhenlin Chen Chao Liu Shangtong Li Hao Chi Meng-Qiu Dong School of Life Sciences Peking University National Institute of Biological Sciences Beijing Tsinghua Institute of Multidisciplinary Biomedical Research Tsinghua University Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) University of CASInstitute of Computing TechnologyCAS University of Chinese Academy of Sciences Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of Medicine and EngineeringBeihang University

High-throughput proteomics based on mass spectrometry（MS） analysis has permeated biomedical science and propelled numerous research projects. p Find 3 is a database search engine for high-speed and in-depth proteomics data analysis. p Find 3 features a swift open search workflow that is adept at uncovering less obvious information such as unexpected modifications or mutations that would have gone unnoticed using a conventional data analysis pipeline. In this protocol, we provide step-by-step instructions to help users mastering various types of data analysis using p Find 3 in conjunction with p Parse for data pre-processing and if needed, p Quant for quantitation. This streamlined p Parse-p Findp Quant workflow offers exceptional sensitivity, precision, and speed. It can be easily implemented in any laboratory in need of identifying peptides, proteins, or post-translational modifications, or of quantitation based on15N-labeling, SILAC-labeling, or TMT/i TRAQ labeling.

关键词： Protein identification Mass spectrometry Search engine Open-pFind Quantitation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：