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

deterministic System Identification Using RBF Networks

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-10页

作者： de Almeida Rego, Joilson Batista Martins, Allan de Medeiros Costa, Evandro de B. Univ Fed Rio Grande do Norte LACI DEE Postgrad Program Elect & Comp Engn PPgEEC BR-59078970 Natal RN Brazil Fed Univ Alagoas UFAL Inst Comp Sci BR-57072900 Maceio AL Brazil Univ Fed Rio Grande do Norte Dept Elect Engn BR-59078970 Natal RN Brazil

This paper presents an artificial intelligence application using a nonconventional mathematical tool: the radial basis function (RBF) networks, aiming to identify the current plant of an induction motor or other nonlinear systems. Here, the objective is to present the RBF response to different nonlinear systems and analyze the obtained results. A RBF network is trained and simulated in order to obtain the dynamical solution with basin of attraction and equilibrium point for known and unknown system and establish a relationship between these dynamical systems and the RBF response. On the basis of several examples, the results indicating the effectiveness of this approach are demonstrated.

关键词： SYSTEM identification deterministic algorithms RADIAL basis functions NONLINEAR systems DYNAMICAL systems

来源：评论

学校读者我要写书评

暂无评论

Application of deterministic, stochastic, and hybrid methods for cloud provider selection

引用

JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS 2022年第1期11卷 1-23页

作者： de Moraes, Lucas Borges Parpinelli, Rafael Stubs Fiorese, Adriano Dept Comp Sci DCC Joinville SC Brazil Grad Program Appl Comp PPGCA Joinville SC Brazil Santa Catarina State Univ UDESC Joinville SC Brazil

Cloud Computing popularization inspired the emergence of many new cloud service providers. The significant number of cloud providers available drives users to complex or even impractical choice of the most suitable one to satisfy his needs without automation. The Cloud Provider Selection (CPS) problem addresses that choice. Hence, this work presents a general approach for solving the CPS problem using as selection criteria performance indicators compliant with the Cloud Service Measurement Initiative Consortium - Service Measurement Index framework (CSMIC-SMI). To accomplish that, deterministic (CPS-Matching and CPS-DEA), stochastic (Evolutionary algorithms: CPS-GA, CPS-BDE, and CPS-DDE), and hybrid (Matching-GA, Matching-BDE, and Matching-DDE) selection optimization methods are developed and employed. The evaluation uses a synthetic database created from several real cloud provider indicator values in experiments comprising scenarios with different user needs and several cloud providers indicating that the proposed approach is appropriate for solving the cloud provider selection problem, showing promising results for a large-scale application. Particularly, comparing which approach chooses the most appropriate cloud provider the better, the hybrid one presents better results, achieving the best average hit percentage, dealing with simple and multi-cloud user requests.

关键词： Cloud provider selection problem Cloud provider ranking Evolutionary computing Natural computing Performance indicator Hybrid methods Stochastic algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

An innovative deterministic algorithm for optimal placement of micro phasor measurement units in radial electricity distribution systems

引用

COMPEL-THE INTERNATIONAL JOURNAL FOR COMPUTATION AND MATHEMATICS IN ELECTRICAL AND ELECTRONIC ENGINEERING 2022年第1期41卷 550-573页

作者： Manghutay, Aref Gholizadeh Naderi, Mehdi Salay Fathi, Seyed Hamid Amirkabir Univ Technol Dept Elect Engn Tehran Iran Amirkabir Univ Technol Iran Grid Secure Operat Res Ctr IGSORC Tehran Iran Amirkabir Univ Technol Elect Engn Dept Tehran Iran

Purpose Heuristic algorithms have been widely used in different types of optimization problems. Their unique features in terms of running time and flexibility have made them superior to deterministic algorithms. To accurately compare different heuristic algorithms in solving optimization problems, the final optimal solution needs to be known. Existing deterministic methods such as Exhaustive Search and Integer Linear Programming can provide the final global optimal solution for small-scale optimization problems. However, as the system grows the number of calculations and required memory size incredibly increases, so applying existing deterministic methods is no longer possible for medium and large-scale systems. The purpose of this paper is to introduce a novel deterministic method with short running time and small memory size requirement for optimal placement of Micro Phasor Measurement Units (mu PMUs) in radial electricity distribution systems to make the system completely observable. Design/methodology/approach First, the principle of the method is explained and the observability of the system is analyzed. Then, the algorithm's running time and memory usage when applying on some of the modified versions of the Institute of Electrical and Electronics Engineers 123-node test feeder are obtained and compared with those of its deterministic counterparts. Findings Because of the innovative method of step-by-step placement of mu PMUs, a unique method is developed. Simulation results elucidate that the proposed method has unique features of short running time and small memory size requirements. Originality/value While the mathematical background of the observability study of electricity distribution systems is very well-presented in the referenced papers, the proposed step-by-step placement method of mu PMUs, which shrinks unobservable parts of the system in each step, is not discussed yet. The presented paper is directly applicable to typical problems in the field of p

关键词： deterministic algorithms Micro phasor measurement unit (mu PMU) Optimal PMU placement (OPP) OPP search space reduction (OPPSSR) Numerical analysis Model order reduction

来源：评论

学校读者我要写书评

暂无评论

Optimization of ultra-fast interactions using laser pulse temporal shaping controlled by a deterministic algorithm

引用

APPLIED PHYSICS A-MATERIALS SCIENCE & PROCESSING 2014年第2期114卷 477-484页

作者： Galvan-Sosa, M. Portilla, J. Hernandez-Rueda, J. Siegel, J. Moreno, L. Ruiz de la Cruz, A. Solis, J. CSIC Inst Opt Laser Proc Grp LPG E-28006 Madrid Spain CSIC Inst Opt Image Sci Grp E-28006 Madrid Spain Univ Carlos III Madrid Dpto Ingn Sistemas & Automat Leganes 28911 Spain

Femtosecond laser pulse temporal shaping techniques have led to important advances in different research fields like photochemistry, laser physics, non-linear optics, biology, or materials processing. This success is partly related to the use of optimal control algorithms. Due to the high dimensionality of the solution and control spaces, evolutionary algorithms are extensively applied and, among them, genetic ones have reached the status of a standard adaptive strategy. Still, their use is normally accompanied by a reduction of the problem complexity by different modalities of parameterization of the spectral phase. Exploiting Rabitz and co-authors' ideas about the topology of quantum landscapes, in this work we analyze the optimization of two different problems under a deterministic approach, using a multiple one-dimensional search (MODS) algorithm. In the first case we explore the determination of the optimal phase mask required for generating arbitrary temporal pulse shapes and compare the performance of the MODS algorithm to the standard iterative Gerchberg-Saxton algorithm. Based on the good performance achieved, the same method has been applied for optimizing two-photon absorption starting from temporally broadened laser pulses, or from laser pulses temporally and spectrally distorted by non-linear absorption in air, obtaining similarly good results which confirm the validity of the deterministic search approach.

关键词： FEMTOSECOND lasers LASER pulses deterministic algorithms PHOTOCHEMISTRY NONLINEAR optics OPTIMAL control theory

来源：评论

学校读者我要写书评

暂无评论

A class of fast and accurate deterministic trend decomposition in the spectral domain using simple and sharp diffusive filters

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2012年第6期349卷 2065-2092页

作者： Jeng, Yih-Nen Yang, Tzung-Ming Cheng, You-Chi Natl Cheng Kung Univ Dept Aeronaut & Astronaut Tainan 70101 Taiwan Georgia Inst Technol Dept Elect & Comp Engn Atlanta GA 30332 USA

This study proposes a spectral domain algorithm to remove the deterministic non-periodic trend from a time series using a class of fast, sharp and diffusive filters. These filters are principally the iterative moving least squares methods weighted using Gaussian windows. The responses of the filters expressed in analytic forms are proven to be diffusive. If it is a polynomial of finite degree, the embedded trend can be decoupled by the filters with specific order and iteration steps. The filters' order, transition zone, error tolerance, iteration number and smoothing factor are subject to two algebraic equations to form a specific class. The operation counts of all filters are slightly larger than twice that applying a Fast Fourier Transform (FFT). It is numerically shown for a given transition zone and tolerance, there is a filter generating the shortest error penetration distance among all the filters. If either the trend or a spectral band is the main concern, there is an optimal strategy to shrink the error penetration distance. The numerical results show the filter has better performance than several existing methods. In addition, four examples successfully show direct applications of the filter's response. (C) 2012 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

关键词： deterministic algorithms DECOMPOSITION (Mathematics) ELECTRIC filters SPECTRUM analysis EQUATIONS FOURIER transforms

来源：评论

学校读者我要写书评

暂无评论

FAST NONADAPTIVE deterministic ALGORITHM FOR CONFLICT RESOLUTION IN A DYNAMIC MULTIPLE-ACCESS CHANNEL

引用

SIAM JOURNAL ON COMPUTING 2015年第3期44卷 868-888页

作者： De Marco, Gianluca Kowalski, Dariusz R. Univ Salerno Dipartimento Informat I-84084 Fisciano SA Italy Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England

A classical problem in addressing a decentralized multiple-access channel is resolving conflicts when a set of stations attempt to transmit at the same time on a shared communication channel. In a static scenario, i.e., when all stations are activated simultaneously, Komlos and Greenberg [IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306] in their seminal work showed that it is possible to resolve the conflict among k stations from an ensemble of n, with a nonadaptive deterministic algorithm in time O(k + k log(n/k)) in the worst case. In this paper we show that in a dynamic scenario, when the stations can join the channel at arbitrary rounds, there is a nonadaptive deterministic algorithm guaranteeing a successful transmission for each station in only a slightly bigger time: O(k log n log log n) in the worst case. This almost matches the Omega(k log n/log k) lower bound by Greenberg and Winograd [J. ACM, 32 (1985), pp. 589-596] that holds even in much stronger settings: for adaptive algorithms, in the static scenario, and with additional channel feedback-collision detection. In terms of channel utilization, our result implies throughput, understood as the average number of successful transmissions per time unit, Omega(1/(log n log log n)) on the dynamic deterministic channel.

关键词： multiple-access channel contention resolution deterministic algorithms distributed algorithms latency throughput

来源：评论

学校读者我要写书评

暂无评论

Reservation-Based Packet Buffers with deterministic Packet Departures

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2014年第5期25卷 1297-1305页

作者： Wang, Hao Lin, Bill Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

High-performance routers need to temporarily store a large number of packets in response to congestion. DRAM is typically needed to implement large packet buffers, but the worst-case random access latencies of DRAM devices are too slow to match the bandwidth requirements of high-performance routers. Existing DRAM-based architectures for supporting linespeed queue operations can be classified into two categories: prefetching-based and randomization-based. They are all based on interleaving memory accesses across multiple parallel DRAM banks for achieving higher memory bandwidths, but they differ in their packet placement and memory operation scheduling mechanisms. In this paper, we describe novel reservation-based packet buffer architectures with interleaved memories that take advantage of the known packet departure times to achieve simplicity and determinism. The number of interleaved DRAM banks required to implement the proposed packet buffer architectures is independent of the number of logical queues, yet the proposed architectures can achieve the performance of an SRAM implementation. Our reservation-based solutions are scalable to growing packet storage requirements in routers while matching increasing line rates.

关键词： Buffer memories packet switching random access memories deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

High-speed transmission line protection using principal component analysis, a deterministic algorithm

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2011年第7期5卷 712-719页

作者： Aguilar, R. Perez, F. Orduna, E. Univ Nacl San Juan Inst Energia Elect San Juan Argentina

A novel methodology to provide effective fault protection featuring high speed and excellent selectivity is presented. Principal component analysis made up of a set of travelling wave current signals, measured at one end of the transmission line, exhibits a well-defined pattern for faults of the same type. This work discloses that the fault current signal projected on the principal component coordinates can define the position, the insertion angle and the fault type (single-phase to ground, isolated two-phase, two-phase to ground and three-phase faults) on transmission lines. In this manner, it is possible to effectively categorise internal faults as well as distinguish when the fault is outside the line. Time windows less than a quarter of cycle of the power frequency are used to measure the current signals, thus the methodology is applicable for high-speed protection systems.

关键词： Power system protection deterministic algorithm travelling wave current signal power transmission faults principal component analysis Power transmission, distribution and supply power transmission protection deterministic algorithms power transmission lines fault protection Other topics in statistics Power transmission lines and cables transmission line protection

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED ANALYSIS AND UNIFIED PERSPECTIVE ON deterministic AND RANDOMIZED LOW-RANK MATRIX APPROXIMATION

引用

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 2023年第2期44卷 559-591页

作者： Demmel, James Grigori, Laura Rusciano, Alexander Univ Calif Berkeley Dept Math Comp Sci Berkeley CA 94720 USA Univ Paris Sorbonne Univ Inria Lab Jacques Louis LionsCNRS F-75005 Paris France Univ Calif Berkeley Dept Math Berkeley CA 94709 USA

We introduce a Generalized LU Factorization (GLU) for low-rank matrix approx-imation. We relate this to past approaches and extensively analyze its approximation properties. The established deterministic guarantees are combined with sketching ensembles satisfying Johnson-Lindenstrauss properties to present complete bounds. Particularly good performance is shown for the subsampled randomized Hadamard transform (SRHT) ensemble. Moreover, the factorization is shown to unify and generalize many past algorithms, sometimes providing strictly better approx-imations. It also helps to explain the effect of sketching on the growth factor during Gaussian elimination.

关键词： low-rank approximation spectrum preserving kernel approximation randomized algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Numerical Approximation of Water Waves Through a deterministic Algorithm

引用

JOURNAL OF MATHEMATICAL FLUID MECHANICS 2018年第4期20卷 1815-1833页

作者： Amann, Dominic Kalimeris, Konstantinos Austrian Acad Sci Radon Inst Computat & Appl Math Linz Austria Univ Cambridge Dept Appl Math & Theoret Phys Cambridge England

Recently, a constructive algorithm based on asymptotic expansions was proposed for computing water waves of large amplitude, in the absence of stagnation points, by one of the authors in Kalimeris (Real World Appl Nonlinear Anal 37:182-212, 2017). Here, we perform a numerical implementation of this algorithm, verifying the analytical results and, indeed, computing large amplitude waves. Furthermore, we introduce a modification of the existing analytical procedure, which allows the computation of waves with variable vorticity by a straightforward adaptation of the current algorithm. Profiles and other features of water waves are presented for constant and some cases of variable vorticity.

关键词： deterministic algorithms vorticity numerical approximation Water Waves waves Asymptotic expansions Constructive Algorithm Water waves

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：