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

6th international conference on Particle-Based Methods (PARTICLES) - Fundamentals and Applications

作者： Angeles, Luis Celis, Cesar Pontificia Univ Catolica Peru PUCP Dept Engn Av Univ 1801 Lima 32 Peru Pontificia Univ Catolica Peru PUCP Mech Engn Sect Av Univ 1801 Lima 32 Peru

ISBN: (纸本)9788412110111

the performance of discrete element method (DEM) simulations is highly dependent on the requirements of the associated algorithms in terms of computer memory usage and CPU time. In particular, computer CPU time heavily depends on the identification of neighbor particles and the computation of particle-particle interactions. Over the years several neighbor particles searching methods have been developed. Accordingly, in this work the performance of two of well-known searching methods, linked cell and Verlet tables algorithms, are assessed in the context of the development of a new DEM-based tool. More specifically, the neighbor searching methods performance and related computational costs are parametrically analyzed and an assessment of their suitability for carrying the intended numerical simulations is provided. the referred numerical simulations are performed accounting for a canonical configuration used for the verification of the algorithms included in the new computational tool under development. the referred tool incorporating state of the art physical and numerical models will be used for modelling following a CFD-DEM approach mineral transport and grinding processes present in concentrator plants.

关键词： discrete element method (DEM) Neighbor particles Searching methods

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Based Kinematic Modeling of 3-RRR Parallel Manipulator 1st

Deep Learning Based Kinematic Modeling of 3-RRR Parallel Man...

引用

1st international conference on Artificial Intelligence and Computer Visions, AICV 2020

作者： Sayed, Abdelrahman Sayed Azar, Ahmad Taher Ibrahim, Zahra Fathy Ibrahim, Habiba A. Mohamed, Nada Ali Ammar, Hossam Hassan Nile University Sheikh Zayed CityGiza12588 Egypt School of Engineering and Applied Sciences Nile University Campus Juhayna Square Sheikh Zayed District 6th of October CityGiza12588 Egypt Prince Sultan University Riyadh Saudi Arabia Faculty of Computers and Artificial Intelligence Benha University Banha Egypt

ISBN: (纸本)9783030442880

this paper presents a novel low cost design for a 3-RRR Planar Parallel Manipulator (PPM). these manipulators proved their superiority over serial manipulators due to their speed, precision and smaller work space where the work space area is accounted for in the design to ensure that the robot is performing its task in a smooth and simple way without getting into any singularity points. the challenge with PPM is to obtain the kinematic constraint equations of the manipulator due to their complex non-linear behavior. Screw theory is a new approach that is used to compute the direct and inverse kinematics based on the relation between each link and its’ predecessor. the design is then inserted into ADAMS to study its dynamical behavior and to obtain a data set that would be used in analyzing the system in MATLAB. A Neuro-Fuzzy Inference System (NFIS) model was constructed in order to predict the end-effector position inside the work space and it is tuned with Particle swarm optimization (PSO) and Genetic algorithm (GA). © 2020, Springer Nature Switzerland AG.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

FPGA Implementation of Low Power Image Compression Technique

FPGA Implementation of Low Power Image Compression Technique

引用

international conference on Advanced Computing and Communication Systems (ICACCS)

作者： R Dhanagopal C Rajeswari R Sureshkumar R Menaka Chennai Institute of Technology Chennai Chennai Institute of Technology Chennai Tamil Nadu India

ISBN: (数字)9781728151977

ISBN: (纸本)9781728151984

Booth multiplier has inherent advantage over normal binary multiplier. it's been adopted by Booth algorithm. this algorithm is replaced the conventional multiplier in the image compression algorithms like discrete cosine transform (DCT) to reduce the power dissipation. the goal is to implement a Booth multiplier, Integrate with DCT and to prove booth multiplier is best so to offer comparison of binary multiplier and booth multiplier. Reducing the power dissipation area is the main goal in the design of portable computing, image processing, video processing and communication devices. therefore different types of digital signal-processing chips are design with low power. In digital signal processing multiplier will play the major role to perform any applications. this proposed method will provide less power dissipation and less area.

关键词： discrete cosine transforms Computer architecture Signal processing algorithms Computational modeling Mathematical model Matlab Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

VI international conference Days of applied mathematics

引用

Journal of Physics: conference Series 2020年第1期1514卷

作者： Sandoval-Amador, A. Gelves Almeida, E. Salazar Torres, J.P. Dueñas Ramírez, L.M. Nino, E.D. Foundation of Researchers in Science and Technology of Materials Colombia Universidad Nacional Del Centro de la Provincia de Buenos Aires Tandil Argentina Universidad Simon Bolivar San Jose de Cucuta Colombia Universidad EAFIT Medellin Colombia

A Sandoval-Amador1,2, E Gelves Almeida3, J P Salazar Torres3, L M Dueñas Ramirez1,4 and E D V-Niño1 1 Foundation of Researchers in Science and Technology of Materials, Colombia 2 Universidad Nacional del Centro de la Provincia de Buenos Aires, Tandil, Argentina 3 Universidad Simón Bolívar, San José de Cúcuta, Colombia 4 Universidad EAFIT, Medellin, Colombia E-mail: foristom@***, anderson84f@*** Organizing Committee, international Scienctific Committee, National Scienctific Committee and all this titles are available in this pdf.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SIMULATION OF GEOLOGICAL FAULTS WIth discrete ELEMENT MEthOD 6

SIMULATION OF GEOLOGICAL FAULTS WITH DISCRETE ELEMENT METHOD

引用

6th international conference on Particle-Based Methods (PARTICLES) - Fundamentals and Applications

作者： Lisitsa, Vadim V. Tcheverda, Vladimir A. Koluykhin, Dmitry R. Sobolev Inst Math SB RAS 4 Koptug Ave Novosibirsk 630090 Russia Inst Petr Geol & Geophys SB RAS 3 Koptug Ave Novosibirsk 630090 Russia

ISBN: (纸本)9788412110111

We present an algorithm for simulation of the Earth's crust tectonic movements and formation of the geological faults and near-fault damage zones. the algorithms are based on the discrete Elements Method, and it is implemented using CUDA technology. We used to simulate faults formation due to different scenarios of tectonic movements. We considered the displacements with dipping angles varied from 30 to 90 degrees;i.e., up to vertical throw. For each scenario, we performed simulations for some statistical realizations. To characterize the simulated faults and damage zones, we consider the strains distribution and apply data clustering and Karhunen-Loeve analysis to distinguish between different forms of the fault zones. In particular, clustering analysis shows that displacements with high and low dip angles form completely different geological structures. Nearly vertical displacements, high dip angles, form wide V-shaped deformation zones, whereas the at displacements cause narrow fault-cores with rapidly decreasing strains apart from the fault core. Results of the presented simulations can be used to estimate mechanical and seismic properties of rocks in the vicinity of the faults and applied further to construct models for seismic modeling and interpretation, hydrodynamical simulations, history of matching simulation, etc.

关键词： DEM Geological Faults

来源：评论

学校读者我要写书评

暂无评论

Analysing Business Process Anomalies Using discrete-time Markov chains

Analysing Business Process Anomalies Using Discrete-time Mar...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Lingkai Yang Sally McClean Mark Donnelly Kashaf Khan Kevin Burke School of Computing Ulster University Jordanstown NI UK British Telecom Ipswich UK MACSI University of Limerick Limerick Ireland

ISBN: (纸本)9781728176505

Within a business context, anomalies can be viewed as indicators for inefficiencies or fraud, which impact upon product quality and customer satisfaction. the development of approaches to monitor, detect and predict anomalous business processes remains an important research topic. In this paper, we propose a method, combining discrete-time Markov chains (DTMCs) and hitting probabilities (HP), for detecting anomalies occurring in the execution of business processes. Our method extends standard DTMCs to be able to estimate the probability of occurring for a process instance even though it is partially recorded (i.e., the initial executions are missing). the proposed method, denoted as HPDTMC, does not rely on prior knowledge about anomalies and the business process and can be trained on datasets already consisting of anomalies. A řidák correction is applied to balance the probability of instances of varying length since naturally, process instances with more executions have lower sequence probability and more likely to be detected as anomalies by using DTMCs. We demonstrate the effectiveness of the method by evaluating it on two artificial datasets and one real-life dataset against seven classic anomaly detection methods. In the experiments, our approach reached an F 1 score of 0.904 on average. Moreover, the proposed method outperforms competitors under noisy conditions. the main contribution of this paper is the proposed noise-robust method which is able to detect fully or partially recorded process instances of varying lengths.

关键词： Simulation Markov processes Noise robustness IPTV Telecommunications Quality assessment Noise measurement

来源：评论

学校读者我要写书评

暂无评论

A Novel Forgery Detection Algorithm Based on Mantissa Distribution in Digital Images

A Novel Forgery Detection Algorithm Based on Mantissa Distri...

引用

international conference of Signal Processing and Intelligent Systems (ICSPIS)

作者： Arman Parnak Yasser Baleghi Javad Kazemitabar Faculty of Electrical & Computer Engineering Babol Noshirvani University of Technology Babol Iran

ISBN: (数字)9781728186290

ISBN: (纸本)9781728186306

Nowadays, digital image forgery detection is one of important topics in research world. In this paper, we propose a novel forgery detection algorithm using the logarithmic basis of Benford's law which states the mantissa of the logarithm of all practical numbers should be uniformly distributed. Based on this fact, the proposed method uses extracted features from mantissa distribution of discrete cosine transform (DCT) coefficients in JPEG images. Support vector machine (SVM) is used for classification to detect authentic and forged images based on these features. Results show that our proposed algorithm has the highest mean accuracy (99.78%), sensitivity (99.77%) and specificity (99.79%) in comparison with previous works on CASIA V1.0 dataset.

关键词： Support vector machines Digital images Signal processing algorithms Feature extraction Forgery discrete cosine transforms Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Alias-free discrete-time FIR System Realisation Using Hybrid Stratified Sampling

Alias-free Discrete-time FIR System Realisation Using Hybrid...

引用

international conference on Event-based Control, Communication, and Signal Processing (EBCCSP)

作者： Andrzej Tarczynski School of Computer Science and Engineering University of Westminster London UK

ISBN: (数字)9781728195810

ISBN: (纸本)9781728195827

this paper proposes a method for system realisation, where the realised system is described by a continuous-time, finite-duration impulse response. the proposed discrete-time implementation deploys Digital Alias-free Signal Processing. It means that despite the use of digital signal processing, the produced results do not suffer from aliasing. However, owing to the use of random sampling, the approach relies on constructing a suitable estimator of the system output. this paper shows that the proposed estimator is unbiased. It is also consistent, i.e. its variance goes to zero when the density of signal samples increasing. It is proven that under moderately restrictive assumptions, the estimator goes to zero proportionally to the fifth power of the average distance between the samples.

关键词： Signal processing Convergence Signal processing algorithms Bandwidth Fourier transforms Probability density function Interpolation

来源：评论

学校读者我要写书评

暂无评论

Parameter Tuning for Comparing Multi-Objective Evolutionary algorithms applied to System Identification Problems 6

Parameter Tuning for Comparing Multi-Objective Evolutionary ...

引用

6th IEEE international conference on Smart Instrumentation, Measurement and Application, ICSIMA 2019

作者： Samsuri, Saiful Farhan M. Ahmad, Robiah Zakaria, Mohd Zakimi Zain, Mohd Zarhamdy Md. Department of Applied Mechanics School of Mechanical Faculty of Engineering Universiti Teknologi Malaysia Skudai Johor81310 Malaysia UTM Razak Faculty of Technology and Informatics UTM International Campus Kuala Lumpur54100 Malaysia Arau Perlis01000 Malaysia

ISBN: (纸本)9781728139524

the parameter estimation tuning is one of the procedures of system identification. One of the identification problems is to find an optimal model structure especially for representing the complex multivariable dynamic systems. therefore, this problem needs to be solved by using multi-objective optimization with two objective functions namely minimum predictive error and model complexity. In this paper, the tuning of control parameters is studied before comparing multi-objective evolutionary algorithms. the framework is based on the system identification problems. In parameter tuning, two main qualitative parameters of evolutionary algorithms are focused on crossover rate and mutation rate. the multi-objective evolutionary algorithms used for this study are an elitist non-dominated sorting genetic algorithm (NSGA-II) and multi-objective optimization using differential evolution (MOODE). the different parameter settings are compared in order to obtain good parameter setting for NSGA-II and MOODE. then, the performance for both algorithms is also compared using Pareto front. the plotted graphs of two objective functions show the non-dominated fronts achieved by the algorithms. the results proved that MOODE shows an advantage in solving system identification problems in a multivariable nonlinear dynamic system. © 2019 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Comparison between EGSnrc and MCNPX for X-ray target in 6 MV photon beam 6

Comparison between EGSnrc and MCNPX for X-ray target in 6 MV...

引用

6th international conference on mathematics and Natural Sciences (CMNS) - On the Road Towards Sustainable Development

作者： Yani, S. Tursinah, R. Rhani, M. F. Haryanto, F. Arif, I. Inst Teknol Bandung Dept Phys Fac Math & Nat Sci Jalan Ganesa 10 Bandung Indonesia Akad Kebidanan Pelita Ibu Kendari Jalan Syech Yusuf 2 Kendari Indonesia Natl Nucl Energy Agcy Jalan Tamansari 71 Bandung Indonesia Natl Univ Canc Inst Singapore Dept Radiat Oncol Singapore Singapore

the Monte Carlo codes, EGSnrc and MCNPX, have been specifically developed to study the particles transport in linear accelerator used in radiotherapy. A simple X-ray target 6 MV photon beam geometry was chosen to highlight similarities and differences of particles transport algorithms implemented in these Monte Carlo codes. the purpose of this study was to compare the particles transport in X-ray target 6 MV photon beam using EGSnrc and MCNPX codes. this target has 0.2484 cm thickness consisting of 0.0899 cm Tungsten and 0.1575 Copper. the global cut-off energies used in the simulations for electron and photon were 500 KeV and 10 KeV, respectively. Monte Carlo simulations were performed for 6.4 MeV monoenergetic beam. the parameters used in this simulation were using the DEFAULT setting. the particles fluence, spectral distribution after target and simulation time were analysed in this simulation. the results showed that the spectrum from EGSnrc and MCNPX was not well-matched. there was under 5% difference, especially in the build-up region. Meanwhile, the EGSnrc was 2 to 3 times more efficient than MCNPX code to achieve certain statistical precision. this happened because the differences of transport algorithm and approximation in these MC codes. EGSnrc just follow photons and electrons during simulation, while MCNPX can simulate transport 34 types of particles, including neutrons. It also causes the simulation time difference between these two codes. MCNPX simulation took longer than the EGSnrc. However, in some cases, differences in results as well as simulation time between 2 codes can be ignored.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：