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

International conference on Advanced Information Technologies (ICAIT)

作者： Yan Naing Htun Bawin Aye Aung Aung Higher Education Center Pyin Oo Lwin Myanmar

ISBN: (数字)9781728183640

ISBN: (纸本)9781728183657

Digital processing of remotely sensed image data has been great importance in recent times. This research work discusses task distribution method in parallel image processing and load balancing under the circumstance of multi-tasks and multi-processors in remote sensing. Task distribution method can speed up computation and improve efficiency and perform larger computations which are not possible on single processor system. The tasks are distributed based on the segmentation of color and the Support Vector Machine (SVM) is used to classify the indices of the input image and intends to design and improve the color segmentation based task distribution method for index classification using machine learning. In the system, the RGB satellite image is used as an input image and the output is the four indices of forest, building, road and land The results of the system are more accurate and less time consumption than non-distributed computing methods. It is implemented in MATLAB platform with parallel computation toolbox because the system can solve computationally and data-intensive tasks using multicore processors and clusters of computer.

关键词： Task analysis image color analysis image segmentation Program processors Indexes Support vector machines Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Mixed-precision methods to Reconstruct Numerical Ocean Simulations

Mixed-precision Methods to Reconstruct Numerical Ocean Simul...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Jiayi Lai Lin Gan Lanning Wang College of Global Change and Earth System Science Beijing Normal University Beijing China Tsinghua University Beijing China

In the development of numerical model, the numerical accuracy of variables is limited due to the constraints of mass conservation and energy conservation. Therefore, there may be some variables that occupy more memory than actually needed under certain circumstances. It has been proved by a large number of numerical experiments that reducing the numerical accuracy of certain variables is able to improve the calculation performance with tolerant accuracy loss. But how to explore and determine the exact number and its precision remains a challenging part and exsiting efforts are still largely relying on manually trials. This paper puts forward methods to firstly offer statistic analysis on how to locate the right data for precision reduction, and how to avoid overflow caused by precision reduction. Furthermore, two climate scenario are used as testbeds. The results show that proposed method has the feasibility of alleviating the memory pressure and improving the overall performance, while still maintain tolerant accuracy of model variables.

关键词： Statistical analysis Oceans Propagation High performance computing Numerical simulation Mathematical models Encoding

来源：评论

学校读者我要写书评

暂无评论

Scalable Knowledge Graph Analytics at 136 Petaflop/s

Scalable Knowledge Graph Analytics at 136 Petaflop/s

引用

International conference on High Performance Computing, Networking, Storage and Analysis (SC)

作者： Kannan, Ramakrishnan Sao, Piyush Lu, Hao Herrmannova, Drahomira Thakkar, Vijay Patton, Robert Vuduc, Richard Potok, Thomas Oak Ridge Natl Lab Oak Ridge TN 37830 USA Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781728199986

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship -mining problem as one of computing all -pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the FloydWarshall algorithm for distributed -memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (distributed Accelerated Semiring All -Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4,096 nodes (24,576 GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136 x 1015 floating-point operations per second (136 petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70 % of the best possible performance given our computation (in the single -precision tropical semiring or "min -plus" algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence -driven natural language processing workflows at scale.

关键词： Shortest path problem High Performance Computing parallel Algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel DEM Imaging Algorithm for Complex Terrain Based on GNSS-InBSAR System

A Novel DEM Imaging Algorithm for Complex Terrain Based on G...

引用

IEEE International conference on Radar

作者： Jian Gao Feifeng Liu Zhanze Wang Ruihong Lv Zhixiang Xu Key Laboratory of Electronic and Information Technology in Satellite Navigation (Beijing Institute of Technology) Ministry of Education Beijing Institute of Technology China Beijing China

ISBN: (纸本)9781665468893

Global Navigation Satellite System (GNSS) based interferometric synthetic aperture radar(InSAR) can be considered as a distributed system. It is required to use digital elevation model (DEM) to obtain high-accuracy interferometric phase. However, using coarse DEM directly will make the edge of target's PSF distorted due to its low two-dimensional resolution. In this paper, a DEM imaging method that combines fitting and smoothing processing is proposed. The fitting processing is based on moving least square and the gaussian kernel with symmetrical transformation is used to realize the smooth effect. The experimental results show that the correlation coefficient of the associated points in imaging pairs has been improved, which proves the effectiveness of the algorithm.

关键词： Global navigation satellite system Smoothing methods image resolution Spaceborne radar image edge detection Fitting Imaging

来源：评论

学校读者我要写书评

暂无评论

Study of large axial space rebinning algorithm in γ-photon industrial tomography image reconstruction

引用

JOURNAL OF INSTRUMENTATION 2021年第12期16卷

作者： Wang, M. Zhao, M. Yao, M. Liu, J. Guo, R. Nanjing Univ Aeronaut & Astronaut Coll Automat Engn 29 Gen Rd Nanjing 211106 Peoples R China

The accuracy of the existing single slice and Fourier rebinning algorithms depends on the projection angle of the line of response. The increase of such projection angle with the detector size, typical in the large axial space of gamma-photon industrial detection, and the loss of some projection data after rebinning, result in the degradation of the image quality. In addition, those algorithms consider the probability of positron annihilation equally distributed along the line of response, which prevents to estimate accurately the positions of the annihilation point, and can originate artifacts and noise in the reconstructed image. In this work, we propose an alternative large axial space rebinning algorithm. In that algorithm, initially the line of response is divided into transverse and axial components. Then, each line of response is uniformly rebinned into all the 2D sinogram data intersecting with it. To improve the accuracy of the estimate of the annihilation point location and suppress the noise effectively, we assign a Gaussian weight coefficient to the projection data, and optimise the rebinning algorithm with it. Finally, we reconstruct the image on the basis of the 2D sinograms with the optimised weights. On the computational side, the algorithm is also accelerated by making use of parallel computing. Both simulation and experimental results show that the proposed method improves the contrast and spatial resolution of 2D reconstructed images. Furthermore, the reconstruction time is not affected by the new method, which is therefore expected to meet the demand of gamma-photon industrial inspection imaging.

关键词： Data processing methods Detection of defects Inspection with gamma rays

来源：评论

学校读者我要写书评

暂无评论

The Research of Implementation Method of Canny Edge Detection of Video on FPGA

The Research of Implementation Method of Canny Edge Detectio...

引用

Information Science, parallel and distributed Systems (ISPDS), International conference on

作者： Li Quan Tan Bin He School of information science and technology Beijing University of chemical technology

ISBN: (数字)9781728196688

ISBN: (纸本)9781728196695

Edge detection algorithm has an important application in video image processing. The algorithm overcomes the shortcomings of traditional video image edge detection methods, and significantly improves the quality of video image edge detection. However, the amount of calculation is very large, and the traditional implementation method is difficult to meet the real-time requirements of video image edge detection, and the implementation cost is high. In this design, field programmable gate array (FPGA) is used as the core to construct and implement Canny video image edge detection system. Firstly, the video image is collected by ov7725 camera in real time; then, the edge detection of video image based on Canny algorithm is implemented in FPGA. Finally, the effect of Canny video image edge detection is compared and analyzed. This design has a good reference value for canny video image edge detection.

关键词： image edge detection Information science image filtering

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Software Effort Estimation via Cascaded Adversarial Auto-Encoder 1

引用

21st International conference on parallel and distributed Computing, Applications, and Technologies, PDCAT 2020

作者： Qi, Fumin Jing, Xiao-Yuan Zhu, Xiaoke Jia, Xiaodong Cheng, Li Dong, Yichuan Fang, Ziseng Ma, Fei Feng, Shengzhong College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computer Wuhan University Wuhan China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China National Supercomputing Center in Shenzhen Guangzhou Guangdong China School of Computer Science Qufu Normal University Rizhao China

ISBN: (数字)9783030692445

ISBN: (纸本)9783030692438

In Software Effort Estimation (SEE) practice, the data drought problem has been plaguing researchers and practitioners. Leveraging heterogeneous SEE data collected by other companies is a feasible solution to relieve the data drought problem. However, how to make full use of the heterogeneous effort data to conduct SEE, which is called as Heterogeneous Software Effort Estimation (HSEE), has not been well studied. In this paper, we propose a HSEE model, called Dynamic Heterogeneous Software Effort Estimation (i.e., DHSEE), which leverages the adversarial auto-encoder and convolutional neural network techniques. Meanwhile, we have investigated the scenario of conducting HSEE with dynamically increasing effort data. Experiments on ten public datasets indicate that our approach can significantly outperform the state-of-the-art HSEE method and other competing methods on both static and dynamic SEE scenarios. © 2021, Springer Nature Switzerland AG.

关键词： Drought

来源：评论

学校读者我要写书评

暂无评论

Improving Pattern Matching performance in Genome sequences using Run Length Encoding in distributed Raspberry Pi Clustering Environment 3

Improving Pattern Matching performance in Genome sequences u...

引用

3rd International conference on Computing and Network Communications, CoCoNet 2019

作者： Kanani, Pratik Padole, Mamta Department of Computer Science and Engineering Maharaja Sayajirao University of Baroda Vadodara390001 India

Genomics and bioinformatics have grown as an independent field and are an area of active research currently. In this work, we first discuss the idea of the genome, its importance and wide-ranging applications in healthcare and medicine. We then give a brief overview of the various file formats used presently to store and manipulate genomic data along with their benefits and shortcomings. Moving on, we analyze and elaborate on how parallel and distributed computing can help in processing large files with genomic data and more importantly address the problem of pattern matching. In particular, we introduce the raspberry-pi and discuss in detail how a Raspberry Pi can accomplish the pattern matching task and how a Raspberry-Pi cluster can enable parallel computing to improvise the performance. This work also includes a brief account of various high-level application programming interfaces and libraries that can be used to parse genomic data like BioPython and Fuzzywuzzy. We conclude this work by summarizing some techniques that can be used for encoding and compressing files with genomic data like Run-Length encoding and genome differential compression respectively among other methods. The proposed work improvises the Genome pattern matching time by more than 50% in a distributed Raspberry Pi Computing environment. This system is useful to detect a particular genome-based abnormality where different pieces of Genome records are present on the different nodes in distributed computing and the input is given to find the disease. It can detect the abnormality within a short time. Also the different approach used here is to use Raspberry Pi based clustering to save cost and the energy. © 2020 The Authors. Published by Elsevier B.V.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Q-processors for real-time image processing

Q-processors for real-time image processing

引用

conference on Photonics Applications in Astronomy, Communications, Industry, and High Energy Physics Experiments

作者： Timchenko, Leonid, I Kokriatskaia, Natalia, I Pavlov, Sergii, V Stepaniuk, Dmytro S. Kutaev, Yuriy F. Kotyra, Andrzej Sagymbai, Aigul Abdihanov, Adil State Univ Infrastruct & Technol Kiev Ukraine Vinnytsia Natl Tech Univ Vinnytsia Ukraine Lublin Univ Technol Nadbystrzycka 38d PL-20618 Lublin Poland LN Gumilyov Eurasian Natl Univ ENU Astana Kazakhstan

ISBN: (数字)9781510639881

ISBN: (纸本)9781510639881

In the paper was considered increase of processors performance for solution of image recognition and images analysis (IRIA) problems is very actual for applied mathematics and related branches of science and technology, where the progress is achieved by real-time scale (RTS). The paper presents the main developments of the authors in a such vital and immortal for functioning of Q-processors problems as organization, comparative analysis of QQ-transformation (QQT) structure an neurolike structure, completeness and sufficient of Q-characteristics decomposition, algorithms of image restoration from the set of its Q-characteristics, noise-immunity and information content of QQT, result of comparative mathematical modeling, etc. Which are suggested in a number of papers, however, the analysis, performed in our paper, of certain problems dealing with methodology of generalized Q-transformation. Extreme simplicity of hardware realization provides achievement of maximum possible parallelism of data processing at minimum values of energy consumption and dimension - weight characteristics

关键词： generalized spatial-related preparation image recognition parallel hierarchical methods

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of Nonconvex distributed Stochastic Zeroth-order Coordinate Method

Convergence Analysis of Nonconvex Distributed Stochastic Zer...

引用

IEEE conference on Decision and Control

作者： Shengjun Zhang Yunlong Dong Dong Xie Lisha Yao Colleen P. Bailey Shengli Fu OS-CAR Laboratory University of North Texas Denton TX USA School of Artificial Intelligence and Automation the MOE Key Laboratory of Image Processing and Intelligent Control and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan China University of North Texas Denton TX USA

ISBN: (纸本)9781665436601

This paper investigates the stochastic distributed nonconvex optimization problem of minimizing a global cost function formed by the summation of n local cost functions. We solve such a problem by involving zeroth-order (ZO) information exchange. In this paper, we propose a ZO distributed primal–dual coordinate method (ZODIAC) to solve the stochastic optimization problem. Agents approximate their own local stochastic ZO oracle along with coordinates under an adaptive smoothing parameter. We show that the proposed algorithm achieves the convergence rate of ${\mathcal{O}}(\sqrt p /\sqrt T )$ for general nonconvex cost functions. We demonstrate the efficiency of proposed algorithms through a numerical example in comparison with the existing state-of-the-art centralized and distributed ZO algorithms.

关键词： Smoothing methods conferences Benchmark testing Cost function Approximation algorithms Information exchange Convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：