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

6th International Symposium on Computational Intelligence and Design (ISCID)

作者： Huang Hai-feng Sun Yi Beijing Univ Technol Sch Econ & Management Beijing Peoples R China

ISBN: (纸本)9780769550794

This paper studies weight adjustment in multiple attributes group decision making model. Firstly, the attribute weights respectively calculated by methods of AHP and entropy are optimized based on objective programming model. Secondly, the initial weights of decision-makers are updated by the grey correlation degree between the individual decision results and the group decision results. Furtherly, the group decision results are updated. Then the weight- adjusting is continued on the basis of the new group decision results. Based on 2-Norm Minkowski measure, the steady weights of decision-makers and final results of the group are gotten with the process of adjustment. Finally, a numerical example to evaluate wind power equipment supplier shows the feasibility and practicability of the proposed algorithm.

关键词： adaptive algorithm Grey correlation Objective programming Weight-adjusting Multiple attributes group decision making

来源：评论

学校读者我要写书评

暂无评论

A Variable Step Size MSEI-DDLMS Double Mode Blind Equalization algorithm 21

A Variable Step Size MSEI-DDLMS Double Mode Blind Equalizati...

引用

Proceedings of the 2021 4th International Conference on Artificial Intelligence and Pattern Recognition

作者： Shuai Wang Qian Wang Xihai Xie Xi'an University of Posts&Telecommunications China Norinco Group Test and Measuring Academy China

ISBN: (纸本)9781450384087

The quality of communication is seriously affected by ICI in communication. Blind equalization can solve this problem well. In this paper, the fixed step length modified super-exponential iterative blind equalization (MSEI) algorithm is introduced. The convergence speed and steady-state error of the fixed step length MSEI-DDLMS double mode blind equalization algorithm is restricted, which leads to the poor convergence effect of the algorithm and some probability of failure to converge. To solve this problem, a variable step-size MSEI-DDLMS algorithm is proposed. In the initial stage of the algorithm, the step size of the MSEI algorithm is adjusted automatically according to the change of the error to ensure rapid convergence in the early stage. After stabilization, it is switched to DDLMS algorithm with smaller residual mean square error, and the step size of DDLMS algorithm is further adjusted to reduce the steady-state error. The algorithm analysis and simulation results show that the improved algorithm has faster convergence speed and higher convergence efficiency.

关键词： adaptive algorithm Blind equalization Decision directed Super-exponential The rate of convergence Variable step-size

来源：评论

学校读者我要写书评

暂无评论

adaptive algorithm Designed for Enterprise's Agile-Transformation

Adaptive Algorithm Designed for Enterprise's Agile-Transform...

引用

3rd International Conference on Machinery, Materials Science and Engineering Applications (MMSE 2013)

作者： Su, J. L. Quanzhou Normal Univ TSL Sch Business & Informat Technol Quanzhou Peoples R China

ISBN: (纸本)9783037857595

The enterprise informatization management and its technologies can input the vigor into Enterprise's transformation, and help to increase its ability for the good return, can promote the level of technology and management of traditional manufacturing enterprise from a labor intensive industry, and can move it toward the accurate management. The Agile-Transformation strategy platform is designed as Integrated Infrastructure for Agile Enterprise (IIAE) by our research team. In this paper, we discuss some of the details of adaptive algorithm designed for Enterprise's Agile-Transformation including IIAE and relationship of its Main Functions, Fuzzy Neural Network and It's IIAE Application, Cooperative Games for Interval Inventory Decision Support in IIAE. All technical details touched upon obtained satisfying performance in practically.

关键词： Agile-Transformation adaptive algorithm IIAE

来源：评论

学校读者我要写书评

暂无评论

adaptive algorithm Based on FFT for Frequency Estimation

Adaptive Algorithm Based on FFT for Frequency Estimation

引用

2nd International Conference on Measurement, Information and Control (ICMIC)

作者： Lv, Jun Sun, Weitao Li, Tong Acad Armored Force Engn Dept Informat Engn Beijing Peoples R China

ISBN: (纸本)9781479913909

The performance of DFT (Discrete Fourier Transform) algorithm about frequency estimation is obviously declined, because the DFT spectrums have the problem of energy leakage and picket fence effect. Aiming at this problem, an adaptive algorithm based on FFT for frequency estimation is presented. In this paper we analysis the performance of Rife algorithm and point out that the perfor mance is poor when the true frequency is much close to quantized frequency of DFT. The performance of segmented-FFT (Fast Fourier Transform) phase difference method is also analyzed, and we point out that the performance is poor when the phase difference of the maximum spectral line is big. This adaptive algorithm is a combination of these two algorithms. The adaptive algorithm not only retains the advantages of the two algorithms, but also effectively makes up for the shortcomings of the two algorithms. The simulation results show that the anti-noise performance and stability of algorithm have significantly improved.

关键词： FFT algorithm Rife algorithm Phase difference algorithm for frequency Frequency estimation adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

On a parallel spark workflow for frequent itemset mining based on array prefix-tree

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2022年第14期34卷 e6313-e6313页

作者： Niu, Xinzheng Wu, Peng Wu, Chase Q. Hou, Aiqin Qian, Mideng Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Sichuan Peoples R China New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA Northwest Univ Sch Informat Sci & Technol Xian Peoples R China

Extracting frequent itemsets from datasets is an important problem in data mining, for which several mining methods including FP-Growth have been proposed. FP-Growth is a classical frequent itemset mining method, which generates pattern databases without candidates. Many improvements have been made in the literature due to the high time complexity and memory usage of FP-Growth. However, most of them still suffer from performance issues on large datasets. In this paper, we design an auxiliary structure, Array Prefix-Tree (AP-Tree), and propose a new algorithm, Array Prefix-Tree Growth (APT-Growth), which is further parallelized as a Spark workflow, referred to as PAPT-Growth. Based on a density threshold, we incorporate an adaptive algorithm selection process into PAPT-Growth to ensure its running time performance. We conduct extensive experiments on different thresholds and multiple datasets, and experimental results show the performance superiority of PAPT-Growth in comparison with several state-of-the-art methods such as PFP, YAFIM, and DFPS. The analysis on density reveals a changing point, which justifies the necessity and validity of adaptive algorithm selection.

关键词： adaptive algorithm array prefix‐ tree frequent itemsets mining parallel algorithm Spark workflow

来源：评论

学校读者我要写书评

暂无评论

Dynamic branching in qualitative constraint-based reasoning via counting local models

引用

INFORMATION AND COMPUTATION 2021年 281卷 104787-104787页

作者： Sioutis, Michael Wolter, Diedrich Bamberg Univ Fac Informat Syst & Appl Comp Sci Bamberg Germany

We introduce and evaluate dynamic branching strategies for solving Qualitative Constraint Networks (QCNs), which are networks for representing and reasoning about spatial and temporal information in a natural manner, e.g., a constraint can be "Task A is scheduled after or during Task C". Specifically, we propose heuristics that dynamically associate a weight with a relation in the branching decisions that occur during backtracking search, based on the count of local models that the relation is involved with in a given QCN. Experimental results with a random and a structured dataset of QCNs of Interval Algebra show that it is possible to achieve up to 5 times better performance for structured instances, whilst maintaining non-negligible gains of around 20% for random ones. Finally, we show that these results may be notably improved via a selection protocol algorithm that synthesizes the involved heuristics into an overall better performing meta-heuristic in the phase transition. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Qualitative constraints Spatial and temporal reasoning Counting local models Dynamic branching adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

ENRICHED GALERKIN-CHARACTERISTICS FINITE ELEMENT METHOD FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2021年第2期43卷 A1336-A1361页

作者： El-Amrani, Mofdi Ouardghi, Abdelouahed Seaid, Mohammed Univ Rey Juan Carlos Dept Matemat Applicada Ciencia & Ingn Mat & Tecno Mostoles Madrid 28933 Spain Univ Mohammed VI Polytech Int Water Res Inst Benguerir Morocco Abdelmalek Essaadi Univ Fac Sci & Tech Math & Applicat Lab Tangier Morocco Univ Durham Dept Engn South Rd Durham DH1 3LE England

We propose a class of adaptive enriched Galerkin-characteristics finite element methods for efficient numerical solution of the incompressible Navier-Stokes equations in primitive variables. The proposed approach combines the modified method of characteristics to deal with convection terms, the finite element discretization to manage irregular geometries, a direct conjugate gradient algorithm to solve the Stokes problem, and an adaptive L-2-projection using quadrature rules to improve the efficiency and accuracy of the method. In the present study, the gradient of the velocity field is used as an error indicator for adaptation of enrichments by increasing the number of quadrature points where it is needed without refining the mesh. Unlike other adaptive finite element methods for incompressible Navier-Stokes equations, linear systems in the proposed enriched Galerkin-characteristics finite element method preserve the same structure and size at each refinement in the adaptation procedure. We examine the performance of the proposed method for a coupled Burgers problem with known analytical solution and for the benchmark problem of flow past a circular cylinder. We also solve a transport problem in the Mediterranean Sea to demonstrate the ability of the method to resolve complex flow features in irregular geometries. Comparisons to the conventional Galerkin-characteristics finite element method are also carried out in the current work. The computed results support our expectations for an accurate and highly efficient enriched Galerkin-characteristics finite element method for incompressible Navier-Stokes equations.

关键词： incompressible Navier-Stokes equations enriched finite elements Galerkin-characteristics method L-2-projection adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

An adaptive boundary element method for the transmission problem with hyperbolic metamaterials

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2021年 444卷 110573-110573页

作者： Lin, Junshan Auburn Univ Dept Math & Stat Auburn AL 36849 USA

In this work we present an adaptive boundary-integral equation method for computing the electromagnetic response of wave interactions in hyperbolic metamaterials. The indefiniteness of the permittivity tensor gives rise to preferential wave radiation within the propagating cone for the hyperbolic media, and this induces sharp transition for the solution of the integral equation across the cone boundary when waves start to decay or grow exponentially. In order to avoid a global refined mesh over the whole boundary, we employ a two-level a posteriori error estimator and an adaptive mesh refinement procedure to resolve the singularity locally for the solution of the integral equation. Such an adaptive procedure allows for the reduction of the number of the degrees of freedom significantly for the integral equation solver while achieving desired accuracy for the solution. In addition, to resolve the fast transition of the fundamental solution and its derivatives accurately across the propagation cone boundary, adaptive numerical quadrature rules are applied to evaluate the integrals for the stiffness matrices. Finally, to formulate the integral equations over the boundary we also derive the limits of layer potentials and their derivatives in the hyperbolic media when the target points approach the boundary. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Hyperbolic metamaterials Boundary element method adaptive algorithm A posteriori error estimator

来源：评论

学校读者我要写书评

暂无评论

Two Efficient and Reliable a posteriori Error Estimates for the Local Discontinuous Galerkin Method Applied to Linear Elliptic Problems on Cartesian Grids

引用

JOURNAL OF SCIENTIFIC COMPUTING 2021年第3期87卷 76-76页

作者： Baccouch, Mahboub Univ Nebraska Dept Math Omaha NE 68182 USA

In this paper, we derive two a posteriori error estimates for the local discontinuous Galerkin (LDG) method applied to linear second-order elliptic problems on Cartesian grids. We first prove that the gradient of the LDG solution is superconvergent with order p + 1 towards the gradient of Gauss-Radau projection of the exact solution, when tensor product polynomials of degree at most p are used. Then, we prove that the gradient of the actual error can be split into two parts. The components of the significant part can be given in terms of ( p+ 1)-degree Radau polynomials. We use these results to construct a reliable and efficient residual-type a posteriori error estimates. We further develop a postprocessing gradient recovery scheme for the LDGsolution. This recovered gradient superconverges to the gradient of the true solution. The order of convergence is proved to be p+1. We use our gradient recovery result to develop a robust recovery-type a posteriori error estimator for the gradient approximation which is based on an enhanced recovery technique. We prove that the proposed residual-type and recovery-type a posteriori error estimates converge to the true errors in the L-2-norm under mesh refinement. The order of convergence is proved to be p + 1. Moreover, the proposed estimators are proved to be asymptotically exact. Finally, we present a local adaptive mesh refinement procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for P-p polynomials with p >= 1. We provide several numerical examples illustrating the effectiveness of our procedures.

关键词： Elliptic boundary-value problems Local discontinuous Galerkin method A posteriori error estimator Superconvergence adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

A 17.7-pJ/Cycle ECG Processor for Arrhythmia Detection with High Immunity to Power Line Interference and Baseline Drift 16

A 17.7-pJ/Cycle ECG Processor for Arrhythmia Detection with ...

引用

IEEE Asian Solid-State Circuits Conference (A-SSCC)

作者： Yin, Yue Abubakar, Syed Muhammad Tan, Songyao Jiang, Hanjun Wang, Zhihua Seng-Pan, U. Jia, Wen Tsinghua Univ Tsinghua Beijing Innovat Ctr Future Chips Inst Microelect Beijing Peoples R China Tsinghua Univ Shenzhen Res Inst Guangdong Engr Res Ctr ICs Wireless Healthcare Shenzhen Peoples R China Univ Macau IME ECE FST State Key Lab Analog & Mixed Signal VLSI Macau Peoples R China

ISBN: (纸本)9781728184364

A full-customized electrocardiograph (ECG) processor for arrhythmia detection is proposed in this paper, which is composed of detection engine, circulated buffer, register bank and instruction/data interfaces. The processor, which is fed by 0.9-V parallel digitized ECG signals, generates stamp pulses of detected QRS-complexes and arrhythmia location by searching for local extremes of signal derivative with self-adaptive thresholds. The precision (Pre) and sensitivity (Sen) of the proposed algorithm are 99.1 % and 96.9 % respectively. The extra false positive (FP) rate of proposed ASIC-implemented ECG processor is extremely low even with power-line interference (PLI) of 0.0663 V-p and/or rail-to-rail baseline drift (R2R BLD). The processor stands out for its relatively low power consumption of 17.7 pJ/cycle with superior robustness to interferences compared to other designs in literature.

关键词： ECG processor arrhythmia detection interference adaptive algorithm ASIC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：