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

discrete algorithm for a Disk Morphological Filter Based on Piecewise Linear Interpolation

MEASUREMENT TECHNIQUES 2022年第8期65卷 577-583页

作者： Zakharov, O. V. Laptev, A. G. Lysenko, V. G. Milovanova, E. A. Tabachnikova, N. A. Yuri Gagarin State Tech Univ Saratov Russia LLC Lapik Saratov Russia Russian Res Inst Metrol Serv Moscow Russia

The use of six-axis coordinate measuring machines (Lapik) for measuring the roughness of complex surfaces is characterized by nonuniform discretization along the coordinate axes. One of the elements of the applied software is a morphological filtering algorithm that takes into account such non-uniform discretization. In the discrete algorithm, the primary roughness profile was subjected to piecewise linear interpolation, and the disk structural element was described continuously, which reduced the error in determining the disk element center during morphological operations. The algorithm accuracy was tested on real and model examples, and the resulting filtering error in measuring the roughness parameters was approximately 3%. The performance of the proposed basic discrete and alpha forms of the algorithm was compared. The advantage of the algorithm developed with the high unevenness of initial data is presented. The filtration time for 10,000 points of the roughness profile does not exceed 0.05 s.

关键词： roughness profile filtering morphological filter discrete algorithm piecewise linear interpolation

来源：评论

学校读者我要写书评

暂无评论

GMDS-ZNN Model 3 and its Ten-Instant discrete algorithm for Time-Variant Matrix Inversion Compared With Other Multiple-Instant Ones

引用

IEEE ACCESS 2020年 8卷 228188-228198页

作者： Wu, Dongqing Zhang, Yunong Guo, Jinjin Li, Zhenyu Ming, Liangjie Zhongkai Univ Agr & Engn Sch Computat Sci Guangzhou 510225 Peoples R China Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Guangdong Key Lab Modern Control Technol Guangzhou 510070 Peoples R China Minist Educ Key Lab Machine Intelligence & Adv Comp Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Elect & Informat Technol Guangzhou 510006 Peoples R China

The online time-variant matrix inversion problem has attracted extensive attention and study, because of its considerable appearance and application in scientific research and industrial production. For various control optimization problems, the demand for the high-precision and rapid-convergence of matrix inversion algorithm is increasing. It remains an ongoing challenge due to the rigorous requirements of precision and convergence of the algorithm. In this paper, on the basis of our previous works, by using Zhang neural network (ZNN) method, a continuous time-variant matrix inversion model, which is also a Getz-Marsden dynamic system (i.e., GMDS-ZNN model 3), is proposed. Besides, a general ten-instant Zhang et al discretization (ZeaD) formula is presented and investigated, with corresponding theoretical results being provided. Next, by applying this general formula to discretize the continuous time-variant matrix inversion model, a general ten-instant discrete time-variant matrix inversion (DTVMI) algorithm with the sixth-order precision is proposed. For comparison, four other DTVMI algorithms, with the second-, third-, fourth-, and fifth-order precisions, are also proposed and presented, respectively, by using other ZeaD formulas to discretize the continuous time-variant matrix inversion model. Besides, for the situation of coefficient matrix derivative being unknown, we provided the formula of estimating it with the fifth-order precision. With the help of the proposed matrix derivative estimation formula, the actual application field of GMDS-ZNN model 3 is expanded evidently. Finally, theoretical analyses and simulation experiment results highlight the effectiveness and accuracy of the proposed GMDS-ZNN model 3 and DTVMI algorithms.

关键词： Digital TV Heuristic algorithms Numerical models Convergence Mathematical model Optimization Hardware Time-variant matrix inversion Getz-Marsden dynamic system ten-instant ZeaD formula Zhang neural network discrete algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the discrete algorithm of Tooth Surface for a Curve-Face Gear

引用

JOURNAL OF MECHANICAL DESIGN 2020年第5期142卷 1-15页

作者： Cai, Zhiqin Lin, Chao Chongqing Univ Coll Mech Engn State Key Lab Mech Transmiss 174 Shazhengjie Chongqing 400044 Peoples R China Xiamen Univ Sch Aerosp Engn 422 Siming South Rd Xiamen 361005 Fujian Peoples R China

The curve-face gear pair is a new type of face gear pair with a variable transmission ratio. Concerning the complexity of its tooth surface, based on the coordinate transformation principle and the spatial meshing theory, a discrete algorithm of this tooth surface was proposed. The determination rule of the limiting points on the tooth surface was analyzed by introducing the generating method and tooth surface characteristics of this gear tooth. Through the corresponding limiting angles and the distribution law of the contact line, the gear tooth surface was discretized, and the theoretical data points of the tooth surface were obtained. The variations in gear tooth surface in a meshing cycle and under different parameters were analyzed. By comparing the virtual tooth model and the corresponding rolling experiment, the correctness of the tooth surface discrete algorithm of the curve-face gear was verified.

关键词： curve-face gear discrete algorithm tooth surface limiting points gear design

来源：评论

学校读者我要写书评

暂无评论

Big data mining based coordinated control discrete algorithm of independent micro grid with PV and energy

引用

MICROPROCESSORS AND MICROSYSTEMS 2021年 82卷 103808-103808页

作者： Tian, Peng Zhang, Lin Chongqing Elect Power Co Internet Dept Chongqing 400015 Peoples R China

The independent micro-grid with photovoltaic and energy storage has the problems of unknown line resistance, large load fluctuation, large control voltage error and poor application stability. In order to solve these problems, big data mining technology is applied to the design of control algorithm, which helps to achieve the coordinated control of the independent micro-grid. Firstly, the discrete consistency controller is constructed as the implementation medium of the control algorithm, and the photovoltaic cell, energy storage unit and DC-DC converter are combined to obtain the independent micro-grid model. In this model, mining the data of the independent micro-grid, and the micro-grid operation mode is determined by the data. According to different operation modes, the goal and constraints of the coordinated control are set, and the coordinated control mode is selected. The coordinated control of the independent micro-grid with PV and energy storage is realized from three aspects: photovoltaic unit, energy storage unit and operation mode switching. Through the comparison with the traditional control algorithm, it is concluded that under the grid connected condition, the control error of the grid voltage can be effectively reduced by applying the designed control discrete algorithm, and the control error can be reduced by 2 V under the island condition.

关键词： Big data mining Independent micro-grid with photovoltaic and energy storage Grid control Coordinated control discrete algorithm

来源：评论

学校读者我要写书评

暂无评论

discrete Predefined-Time Distributed Optimization algorithm for Resource Allocation Problem in Smart Grids 36

Discrete Predefined-Time Distributed Optimization Algorithm ...

引用

36th Chinese Control and Decision Conference (CCDC)

作者： Su, Chuxiong Wang, Xiyuan Wang, Shaocong Dai, Hao Chang, Jing Xidian Univ Sch Aerosp Sci & Technol Xian Peoples R China

ISBN: (纸本)9798350387780;9798350387797

The economic dispatch problem in smart grids is studied in this paper. A discrete predefined-time distributed optimization algorithm is proposed based on predefined-time convergence, which can make reasonable decisions on power generation for each generator within a predefined time. In the optimization algorithm designed in this paper, information exchanged between generators in the communication network is only the information of auxiliary variables, which avoids the problem of privacy data leakage. Finally, a set of numerical simulations is provided to verify the feasibility of the proposed algorithm.

关键词： Predefined-time Distributed optimization discrete algorithm Economic dispatch problem Smart grid

来源：评论

学校读者我要写书评

暂无评论

discrete Robust Control algorithm for One Class of Non-Affine Nonlinear SISO Systems 2

Discrete Robust Control Algorithm for One Class of Non-Affin...

引用

2nd International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)

作者： Eremin, E. L. Shelenok, E. A. Amur State Univ Informat & Control Syst Dept Blagoveshchensk Russia Pacific Natl Univ Automat & Syst Engn Dept Khabarovsk Russia

ISBN: (纸本)9781509013227

Based on the hyperstability criterion and the continuous models method, the paper considers a robust control law for nonlinear non-affine single channel or so called "singleinput single-output" (SISO) systems. Development of the robust control algorithm for this nonlinear systems class is carried out under priori uncertainty conditions.

关键词： non-affine nonlinear system robust control reference model filter-corrector discrete algorithm hyperstability L-dissipativity

来源：评论

学校读者我要写书评

暂无评论

Two new bidirectional search algorithms

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2021年第2期80卷 377-409页

作者： Pavlik, John A. Sewell, Edward C. Jacobson, Sheldon H. Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Southern Illinois Univ Edwardsville Dept Math & Stat Edwardsville IL USA

This paper presents two new bidirectional heuristic search algorithms for solving the shortest path problem on graphs: consistent-heuristic bucket-based bidirectional search (CBBS) and front-to-front GPU bidirectional search (FFGBS). CBBS uses a consistent heuristic and groups nodes into buckets that organize nodes based on estimated path cost and known heuristic errors. FFGBS splits the work between the CPU and GPU, with the GPU solving a front-to-front heuristic and the CPU choosing nodes to expand. This paper also includes a new front-to-front version of the GAP heuristic for the pancake problem that is efficient to solve on a GPU. Computational experiments for CBBS are performed on the pancake problem. CBBS is faster and requires less node expansions with the GAP-1 heuristic, compared to bidirectional state of the algorithms like DIBBS and DVCBS. Computational experiments for FFGBS are performed on the pancake problem and DIMACS road network, showing that FFGBS is consistently the fastest algorithm on all but the smallest pancake stacks when using the GAP-2 heuristic and is also the fastest algorithm on the largest road networks.

关键词： discrete algorithm Heuristic search Bidirectional search Consistent heuristic Pancake Road

来源：评论

学校读者我要写书评

暂无评论

Digital halftoning algorithms based on optimization criteria and their experimental evaluation

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1996年第4期E79A卷 524-532页

作者： Asano, T Ranjan, D Roos, T Department of Engineering Informatics Osaka Electro-Communication University Neyagawa-shi 572 Japan Department of Computer Science New Mexico State University United States Theoretische Informatik ETH Zentrum Switzerland

Digital halftoning is a well-known technique in image processing to convert an image having several bits for brightness levels into a binary image consisting only of black and white dots. A great number of algorithms have been presented for this problem, some of which have only been evaluated just by comparison with human eyes. In this paper we formulate the digital halftoning problem as a combinatorial problem which allows an exact solution with graph-theoretic tools. For this, we consider a d-dimensional grid of n : = N-d pixels (d greater than or equal to 1). For each pixel, we define a so-called k-neighborhood, k is an element of {0,... N - 1}, which is the set of at most (2k + 1)(d) pixels that can be reached from the current pixel in a distance of less than or equal to k. Now, in order to solve the digital halftoning problem, we are going to minimize the sum of distances of all k-neighborhoods between the original picture and the halftoned one. We show that the problem can be solved in linear time in the one-dimensional case while it looks hopeless to have a polynomial-time algorithm in higher dimension including the usual two-dimensional case. We present an exact algorithm for the one-dimensional case which runs in O(n) time if k is regarded to be a constant. For two-dimensional case we present fast approximation techniques based on space filling curves. An experimental comparison of several implementations of approximate algorithms proves that our algorithms are of practical interest.

关键词： discrete algorithm combinatorial optimization digital halftoning computational complexity experimental evaluation

来源：评论

学校读者我要写书评

暂无评论

Combinatorial structure of rigid transformations in 2D digital images

引用

COMPUTER VISION AND IMAGE UNDERSTANDING 2013年第4期117卷 393-408页

作者： Ngo, Phuc Kenmochi, Yukiko Passat, Nicolas Talbot, Hugues Univ Paris Est LIGM UPEMLV ESIEE CNRS Paris France Univ Strasbourg LSIIT UMR CNRS 7005 Strasbourg France

Rigid transformations are involved in a wide range of digital image processing applications. When applied on discrete images, rigid transformations are usually performed in their associated continuous space, requiring a subsequent digitization of the result. In this article, we propose to study rigid transformations of digital images as fully discrete processes. In particular, we investigate a combinatorial structure modelling the whole space of digital rigid transformations on arbitrary subset of Z(2) of size N x N. We describe this combinatorial structure, which presents a space complexity O(N-9) and we propose an algorithm enabling to construct it in linear time with respect to its space complexity. This algorithm, which handles real (i.e., non-rational) values related to the continuous transformations associated to the discrete ones, is however defined in a fully discrete form, leading to exact computation. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Digital rigid transformations Combinatorial structure discrete algorithm

来源：评论

学校读者我要写书评

暂无评论

How important is a transfer function in discrete heuristic algorithms

引用

NEURAL COMPUTING & APPLICATIONS 2015年第3期26卷 625-640页

作者： Saremi, Shahrzad Mirjalili, Seyedali Lewis, Andrew Griffith Univ Sch Informat & Commun Technol Brisbane Qld 4111 Australia

Transfer functions are considered the simplest and cheapest operators in designing discrete heuristic algorithms. The main advantage of such operators is the maintenance of the structure and other continuous operators of a continuous algorithm. However, a transfer function may show different behaviour in various heuristic algorithms. This paper investigates the behaviour and importance of transfer functions in improving performance of heuristic algorithms. As case studies, two algorithms with different mechanisms of optimisation were chosen: Gravitational Search algorithm and Particle Swarm Optimisation. Eight transfer functions were integrated in these two algorithms and compared on a set of test functions. The results show that transfer functions may show diverse behaviours and have different impacts on the performance of algorithms, which should be considered when designing a discrete algorithm. The results also demonstrate the significant role of the transfer function in terms of improved exploration and exploitation of a heuristic algorithm.

关键词： Binary optimisation discrete optimisation Transfer function Evolutionary algorithm Heuristic algorithm Binary algorithm discrete algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：