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

Finite element implementation of general triangular mesh for Riesz derivative

Partial Differential Equations in Applied Mathematics 2021年 4卷

作者： Yin, Daopeng Mei, Liquan School of Mathematics and Statistics Xi'an Jiaotong University Xi'an 710049 China

In this work, we will study a calculation method of variation formula with Riesz fractional derivative. As far as we know, Riesz derivative is a non-local operator including 2n directions in n−dimension space, which the difficulties for computation of variation formula rightly bother us. In this paper, we will give an accurate method to cope with element of the stiffness matrix using polynomial basis function in the general domain meshed by unstructured triangle and the proof of diagonal dominance for Riesz fractional stiffness matrix. This method can be utilized to general fractional differential equation with Riesz derivative, which especially suitable for β close to 0.5 or 1. © 2021 The Author(s)

关键词： algorithm implementation Finite element methods Riesz fractional derivative Stiffness matrix

来源：评论

学校读者我要写书评

暂无评论

On-line identification methods as part of the tunnel ventilation control algorithm

引用

Transportation Research Procedia 2021年 55卷 961-968页

作者： Roman Michalík Jozef Hrbček Vojtech Šimák University of Žilina Faculty of Electrical Engineering and Information Technology Department of Control and Information Systems Univerzitná 8215/1 010 26 Žilina Slovakia

The paper presents algorithms of on-line methods of discrete parametric identification of pollutant concentrations in a tunnel tube and comparison of their properties. It describes the characteristics of an individual methods and a detailed evaluation in order to select the most suitable method for the identification of dynamical systems with a significant stochastic component and changing parameters. The aim of the paper is to propose discrete parametric identification methods for systems that have variable parameters. It is a choice of model structure and design of an algorithm that is able to monitor changes in system parameters. The article also describes ways to implement identification algorithms in PLC (Programmable Logic Controller) by programming the target device directly from the simulation environment MATLAB Simulink using the toolbox "B&R Automation Studio Target for Simulink". From a practical point of view, these algorithms serve to create an apparatus for optimizing the ventilation control in the tunnel and thus ensure the safe passage of vehicles through the tunnel.

关键词： PLC identification algorithm implementation ventilation control in the tunnel

来源：评论

学校读者我要写书评

暂无评论

algorithmic Design of an FPGA-Based Calculator for Fast Evaluation of Tsunami Wave Danger

引用

algorithmS 2021年第12期14卷 343页

作者： Lavrentiev, Mikhail Lysakov, Konstantin Marchuk, Andrey Oblaukhov, Konstantin Shadrin, Mikhail RAS Inst Automat & Electrometry SB Novosibirsk 630090 Russia RAS Inst Computat Math & Math Geophys SB Novosibirsk 630090 Russia

Events of a seismic nature followed by catastrophic floods caused by tsunami waves (the incidence of which has increased in recent decades) have an important impact on the populations of littoral regions. On the coast of Japan and Kamchatka, it takes nearly 20 min for tsunami waves to approach the nearest dry land after an offshore seismic event. This paper addresses an important question of fast simulation of tsunami wave propagation by mapping the algorithms in use in field-programmable gate arrays (FPGAs) with the help of high-level synthesis (HLS). Wave propagation is described by the shallow water system, and for numerical treatment the MacCormack scheme is used. The MacCormack algorithm is a direct difference scheme at a three-point stencil of a "cross" type;it happens to be appropriate for FPGA-based parallel implementation. A specialized calculator was designed. The developed software was tested for precision and performance. Numerical tests computing wave fronts show very good agreement with the available exact solutions (for two particular cases of the sea bed topography) and with the reference code. As the result, it takes just 17.06 s to simulate 1600 s (3200 time steps) of the wave propagation using a 3000 x 3200 computation grid with a VC709 board. The step length of the computational grid was chosen to display the simulation results in sufficient detail along the coastline. At the same time, the size of data arrays should provide their free placement in the memory of FPGA chips. The rather high performance achieved shows that tsunami danger could be correctly evaluated in a few minutes after seismic events.

关键词： algorithm implementation high-level synthesis tsunami wave numerical modeling

来源：评论

学校读者我要写书评

暂无评论

Exploring Concurrent and Stateless Evolutionary algorithms 1

引用

22nd International Conference on Applications of Evolutionary Computation (EvoApplications) Held as Part of EvoStar Conference

作者： Merelo, Juan J. Laredo, J. L. J. Castillo, Pedro A. Garcia-Valdez, Jose-Mario Rojas-Galeano, Sergio Univ Granada CITIC Granada Spain Univ Havre Normandie RI2C LITIS Le Havre France Inst Tecnol Tijuana Calzada Tecnol S-N Tijuana Mexico Univ Dist Francisco Jose de Caldas Sch Engn Bogota Colombia

ISBN: (数字)9783030166922

ISBN: (纸本)9783030166915;9783030166922

Creating a concurrent and stateless version of an evolutionary algorithm implies changes in its algorithmic model. From the performance point of view, the main challenge is to balance computation with communication, but from the evolutionary point of view another challenge is to keep diversity high so that the algorithm is not stuck in local minima In a concurrent setting, we will have to find the right balance so that improvements in both facets do not cancel out. In this paper we address such an issue, by exploring the space of parameters of a population based concurrent evolutionary algorithm that yields to find out the best combination for a particular problem.

关键词： Concurrent algorithms Distributed computing Stateless algorithms algorithm implementation Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Going Stateless in Concurrent Evolutionary algorithms 5th

Going Stateless in Concurrent Evolutionary Algorithms

引用

5th Workshop on Engineering Applications (WEA)

作者： Merelo, Juan J. Garcia-Valdez, Jose-Mario Univ Granada CITIC Granada Spain Inst Tecnol Tijuana Calzada Tecnol S-N Tijuana Mexico

ISBN: (纸本)9783030003500;9783030003494

Concurrent languages such as Perl 6 fully leverage the power of current multi-core and hyper-threaded computer architectures, and they include easy ways of automatically parallelizing code. However, to achieve more computational capability by using all threads and cores, algorithms need to be redesigned to be run in a concurrent environment;in particular, the use of a reactive, fully functional patterns need to turn the algorithm into a series of stateless steps, with simple functions that receive all the context and map it to the next stage. In this paper, we are going to analyze different versions of these stateless, reactive architectures applied to evolutionary algorithms, assessing how they interact with the characteristics of the evolutionary algorithm itself and show how they improve the scaling behavior and performance. We will use the Perl 6 language, which is a modern, concurrent language that was released recently and is still under very active development.

关键词： Concurrent algorithms Distributed computing Stateless algorithms algorithm implementation Performance evaluation Heterogeneous distributed systems

来源：评论

学校读者我要写书评

暂无评论

Introducing an Event-Based Architecture for Concurrent and Distributed Evolutionary algorithms 15th

Introducing an Event-Based Architecture for Concurrent and D...

引用

15th International Conference on Parallel Problem Solving from Nature (PPSN)

作者： Merelo Guervos, Juan J. Garcia-Valdez, J. Mario Univ Granada Granada Spain Inst Tecnol Tijuana Tijuana BC Mexico

ISBN: (纸本)9783319992532;9783319992525

Cloud-native applications add a layer of abstraction to the underlying distributed computing system, defining a high-level, self-scaling and self-managed architecture of different microservices linked by a messaging bus. Creating new algorithms that tap these architectural patterns and at the same time employ distributed resources efficiently is a challenge we will be taking up in this paper. We introduce KafkEO, a cloud-native evolutionary algorithms framework that is prepared to work with different implementations of evolutionary algorithms and other population-based metaheuristics by using micro-populations and stateless services as the main building blocks;KafkEO is an attempt to map the traditional evolutionary algorithm to this new cloud-native format. As far as we know, this is the first architecture of this kind that has been published and tested, and is free software and vendor-independent, based on OpenWhisk and Kafka. This paper presents a proof of concept, examines its cost, and tests the impact on the algorithm of the design around cloud-native and asynchronous system by comparing it on the well known BBOB benchmarks with other pool-based architectures, with which it has a remarkable functional resemblance. KafkEO results are quite competitive with similar architectures.

关键词： Cloud computing Microservices Distributed computing Event-based systems Kappa architecture Stateless algorithms algorithm implementation Performance evaluation Distributed computing Pool-based systems Heterogeneous distributed systems Serverless computing Functions as a service

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Spatial Laser Speckle Contrast implementations 8

Performance Analysis of Spatial Laser Speckle Contrast Imple...

引用

10th International Joint Conference on Biomedical Engineering Systems and Technologies

作者： Vaz, Pedro G. Humeau-Heurtier, Anne Figueiras, Edite Correia, Carlos Cardo, Joao Univ Coimbra Dept Phys LIBPhys UC P-3004516 Coimbra Portugal Univ Angers LARIS 62 Ave Notre Dame du Lac F-49000 Angers France Int Iberian Nanotechnol Lab Ultrafast Bio & Nanophoton Grp Braga Portugal

ISBN: (纸本)9789897582141

This work presents an analysis of the performances for four different implementations used to compute laser speckle contrast on images. Laser speckle contrast is a widely used imaging technique for biomedical applications. These implementations were tested using synthetic laser speckle patterns with different resolutions, speckle sizes, and contrasts. From the applied methods, three implementations are already known in the literature. A new alternative is proposed herein, which relies on two-dimensional convolutions, in order to improve the image processing time without compromising the contrast assessment. The proposed implementation achieves a processing time two orders of magnitude lower than the analytical evaluation. The goal of this technical manuscript is to help the developers and researchers in computing laser speckle contrast images.

关键词： Laser Speckle Imaging Spatial Contrast algorithm implementation MATLAB Convolution

来源：评论

学校读者我要写书评

暂无评论

Implementing a Self-structuring Data Learning algorithm

Implementing a Self-structuring Data Learning Algorithm

引用

Conference on Cyber Sensing

作者： Graham, James Carson, Daniel Ternovskiy, Igor Ohio Univ Athens OH 45701 USA Riverside Res Beavercreek OH 45431 USA Air Force Res Lab Sensors Directorate Wright Patterson AFB OH 45324 USA

ISBN: (纸本)9781510600676

In this paper, we elaborate on what we did to implement our self-structuring data learning algorithm. To recap, we are working to develop a data learning algorithm that will eventually be capable of goal driven pattern learning and extrapolation of more complex patterns from less complex ones. At this point we have developed a conceptual framework for the algorithm, but have yet to discuss our actual implementation and the consideration and shortcuts we needed to take to create said implementation. We will elaborate on our initial setup of the algorithm and the scenarios we used to test our early stage algorithm. While we want this to be a general algorithm, it is necessary to start with a simple scenario or two to provide a viable development and testing environment. To that end, our discussion will be geared toward what we include in our initial implementation and why, as well as what concerns we may have. In the future, we expect to be able to apply our algorithm to a more general approach, but to do so within a reasonable time, we needed to pick a place to start.

关键词： learning algorithm autonomous learning algorithm implementation data modeling

来源：评论

学校读者我要写书评

暂无评论

Maximum Likelihood Estimation and Non-Linear Least Squares Fitting implementation in FPGA Devices for High Resolution Hodoscopy

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2013年第5期60卷 3578-3584页

作者： Blasco, Jose M. Sanchis, Enrique Gonzalez, Vicente Martin, Jose D. Egea, Francisco J. Barrientos, Diego Granero, Domingo Sanchis-Sanchez, Enrique Univ Valencia Dept Fisioterapia Valencia Spain Univ Valencia Dept Engn Elect Escola Tecn Super Engn Valencia Spain Eresa Grp Med Valencia Spain

This work compares two possible solutions to achieve a high resolution in a hodoscope based on Plastic Scintillating Fibers (PSF) by obtaining the point of maximum interaction of the radioactive beam with the detector. The two fitting algorithms are the Maximum Likelihood Estimation and a non-linear least-squares fitting with the Levenberg-Marquardt algorithm. Both approaches have been tested, compared and implemented in Field Programmable Gate Array (FPGA) devices.

关键词： algorithm implementation beam calibration FPGA high-resolution hodoscopy maximum interaction

来源：评论

学校读者我要写书评

暂无评论

An image stabilization algorithm based on image feature-point matching

An image stabilization algorithm based on image feature-poin...

引用

2014 International Conference on Remote Sensing and Smart City(RSSC2014)

作者： J.R.Huang X.Y.Zhou College of Computer Science Sichuan Normal University College of Computer Science Chengdu Normal University

ISBN: (纸本)9781784660291

When shooting by airborne or vehicular cameras, the problem of image dithering is inevitable and it will lead to the dithering of frames in the videos captured by these cameras. On the basis of the analysis on camera motion model, the feature points were firstly found in videos after adaptively smoothing the videos. In terms of the fact that motion homogeneity was always included in the blocks extracted from the adjacent frames, the feature points in the current frame then were able to be found by matching blocks, once the feature points in the reference frames were determined. Based on these steps, the proposed algorithm is robust and effective to extract the feature points from videos. Compared with other methods, the proposed method works more accurately, steadily, and effectively, especially for the case that includes violent illumination.

关键词： image stabilization motion model feature points matching algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：