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

USING RESERVES OF COMPUTING OPTIMIZATION TO SOLVE COMPLEX PROBLEMS

CYBERNETICS AND SYSTEMS ANALYSIS 2019年第1期55卷 40-54页

作者： Zadiraka, V. K. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine

The paper considers stages of the development of studies in computing optimization in Ukraine (in particular, at the V.M. Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine) related to elements of error theory, computational algorithms that are optimal in accuracy and time, high-tech computer technologies for solving problems in computational and applied mathematics with given values of quality characteristics.

关键词： computational algorithm approximate solution approximate solution error algorithm optimization reserves of computing optimization computer technologies

来源：评论

学校读者我要写书评

暂无评论

The principal component analysis for detecting leaks in water pipe networks utilizing flow and leak record data

引用

DESALINATION AND WATER TREATMENT 2019年第0期143卷 69-77页

作者： Park, Suwan Ha, Jaehong Kim, Kimin Pusan Natl Univ Dept Civil & Environm Engn Busan 609735 South Korea Seoyong Engn Yongin 16950 South Korea

In this paper, the potential of the principal component analysis (PCA) technique for the application of detecting leaks in water pipe networks was evaluated. For this purpose, the PCA was conducted to evaluate the relevance of the calculated statistical outliers of a PCA model utilizing the recorded inflows of district metered areas (DMAs) and the records of leak repair completion of a case study water pipe network. The PCA technique was enhanced by applying the computational algorithm developed in this study which was designed to use flow data in a time window from the original 24-h flow data so that the effective outlier detection rate was maximized. Sensitivity analyses of the parameters of the PCA model and the developed algorithm on the results of the study were conducted. Consideration on how to apply the parameters in the practical applications was also presented. The developed algorithm may be applied in determining whether further leak detection field work for DMAs needs to be performed.

关键词： Principal component analysis (PCA) DMA Water pipe network Leak detection computational algorithm Flow data

来源：评论

学校读者我要写书评

暂无评论

Solids surface characterization using computational algorithms: A case study for talc fillers

引用

APPLIED CLAY SCIENCE 2017年 141卷 212-218页

作者： Yao, Zhitong Wu, Daidai Heng, Jerry Y. Y. Wu, Weihong Zhao, Hongting Liu, Jie Tang, Junhong Hangzhou Dianzi Univ Coll Mat Sci & Environm Engn Hangzhou 310018 Zhejiang Peoples R China Chinese Acad Sci GuangZhou Inst Energy Convers Guangzhou 510640 Guangdong Peoples R China Imperial Coll London Dept Chem Engn South Kensington Campus London SW7 2AZ England

The solid surface characterization using contact angle measurement is complicated and time-consuming. In this work, two computational algorithms in MATLAB and C were developed and validated by the surface properties determination of talc filler (TCF) and colored talc filler (CTCF). The results indicated that, the surface free energy parameters calculated using the two algorithms for both samples were consistent. As compared to the MATLAB function, the assembly statements of C function were longer, although the unknowns can be directly obtained using this toolbox. The gamma(D)(S) values determined by the Owens-Wendt-Kaelble (OWK), van Oss-Chaudhury-Good (vOCG) and Wu methods were consistent and contributed a major part of the gamma(T)(s)Compared to gamma(D)(S), the gamma(SP)(s) component contributed less toys implying a lower polarity for both samples. The lower y(S)(D) and gamma(SP)(S) for CTCF added up to a lower gamma(T)(S) value, which could reduce filler particle-particle interactions. The mechanical properties study of acrylonitrile-butadiene-styrene (ABS) matrix filled with the two fillers showed that the incorporation of them played mainly a reinforcing role, and a better performance for CTCF was observed. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Talc Filler Surface property Polymer computational algorithm

来源：评论

学校读者我要写书评

暂无评论

Invariant multicones for families of matrices

引用

ANNALI DI MATEMATICA PURA ED APPLICATA 2019年第2期198卷 571-614页

作者： Brundu, M. Zennaro, M. Univ Trieste Dipartimento Matemat & Geosci I-34100 Trieste Italy

In this paper, we investigate sufficient conditions on the structure of the eigenspaces of a given finite family of matrices to assure the existence of an embedded pair of invariant multicones, which are the smallest and the biggest in a suitable and natural sense. Multicones, very similar structures to those known in the literature as 1-multicones, are quite natural generalizations of the classical cones. The conditions we find also suggest us a practical computational procedure for the actual construction of such invariant embedded pair.

关键词： Cone Multicone Duality Matrix Family of matrices Invariant set Leading eigenvalue Leading eigenvector computational algorithm

来源：评论

学校读者我要写书评

暂无评论

On convergence, asymptotic behaviour and computational algorithm of generalized exponential integral functions arising in a radiative transfer

引用

JOURNAL OF QUANTITATIVE SPECTROSCOPY & RADIATIVE TRANSFER 2012年第14期113卷 1818-1825页

作者： Bairamov, Elgiz Ozalp, Nuri Ankara Univ Fac Sci Dept Math TR-06100 Ankara Turkey

In this paper, we investigate uniform convergence of the generalized exponential integral functions (GEI) arising in the study of radiative transfer in a two-dimensional planar-medium and anisotropic scattering in a multidimensional medium. Using the uniform convergence, we study the properties and asymptotic behaviour of the GEI functions. We also give an efficient algorithm for the computations of the values of the GEI functions. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Generalized exponential integrals Uniform convergence Multidimensional radiative transfer Anisotropic scattering computational algorithm

来源：评论

学校读者我要写书评

暂无评论

Examining Naturogenic Processes and Anthropogenic Influences on Tree Growth and Development via Stem Analysis: Data Processing and computational Analytics

引用

FORESTS 2019年第12期10卷 1058页

作者： Newton, Peter F. Nat Resources Canada Canadian Forest Serv Canadian Wood Fibre Ctr Sault Ste Marie ON P6A 2E5 Canada

The objective of this study was to develop a stem analysis data processing and computational algorithm and associated software suite that was (1) applicable to temperate and boreal forest tree species, (2) mathematically consistent with excurrent tree stem geometric and allometric principles, (3) compatible with data structures obtained using proprietary and non-proprietary imaging systems, and (4) executable on Windows (R)-based operating systems. computationally, the suite denoted SAP (Stem Analysis Program), deployed sectional-specific formulae that were in accord with the following geometric assumptions: (1) stump section was treated as a solid of revolution resembling a cylinder;(2) sections between the stump and the tip were treated as a solid of revolution resembling a frustum of a cone for sections with continuous annual increments, otherwise treated as a cone;and (3) tip section was treated as a solid of revolution resembling a cone. The algorithm also corrected for the slant-based sectional length measurements using Pythagorean Theorem and eliminated the requirement to predict age-specific apex height development through the use of a linear interpolation procedure. Based on input data structures consisting of annual ring-width xylem sequences measured from cross-sectional disk samples acquired at multiple positions along the tree's main stem, the suite produces a broad array of output, inclusive of radial and longitudinal ring-width sequences, apical growth increments, annual and cumulative sectional and cumulative volume production patterns, and historically reconstructed stem taper profiles. In total, the SAP creates six output data files for each tree analyzed: (1) input data reference summary (e.g., geometric mean ring-widths and resultant radii for each cross-section);(2) radial growth patterns for the cross-section sampled at breast-height (e.g., absolute and relative diameter and basal area growth estimates);(3) sectional (vertical) profiles of volu

关键词： computational algorithm slant height and linear interpolation growth layer and specific volume increment profiles Windendro(TM) Fortran Visual Basic (R) Windows (R) operating system

来源：评论

学校读者我要写书评

暂无评论

Intuitionistic Fuzzy Set-Based computational Method for Financial Time Series Forecasting

引用

FUZZY INFORMATION AND ENGINEERING 2018年第3期10卷 307-323页

作者： Bisht, Kamlesh Kumar, Sanjay GB Pant Univ Agr & Technol Dept Math Stat & Comp Sci Pantnagar Uttar Pradesh India

Intuitionistic fuzzy sets (IFSs) have been proved to be more ideal than fuzzy sets to handle non-probabilistic uncertainty and non-determinism in the system. The present study proposes an IFS-based computational method to address the issue of non-determinism in financial time series forecasting. The proposed IFS-based forecasting method uses a simple computational algorithm to forecast without using complex computations using intuitionistic fuzzy logical relations. In order to see suitability of the proposed method in financial forecasting, it is implemented on three experimental data of the SBI share price, TAIEX and Dow Jones Industrial Average (DJIA). Root mean square error and statistical test are used in the study to confirm the out performance of the proposed IFS-based computational method of forecasting. Experimental results show that the proposed method outperforms various existing methods for forecasting SBI, TAIEX and DJIA.

关键词： Intuitionistic fuzzy set fuzzy time series computational algorithm non-determinism financial forecasting

来源：评论

学校读者我要写书评

暂无评论

Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type

引用

STOCHASTIC MODELS 2018年第2期34卷 207-238页

作者： Kimura, Masatoshi Takine, Tetsuya Osaka Univ Grad Sch Engn Dept Informat & Commun Technol Suita Osaka 5650871 Japan

This paper considers the computation of the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, given that the level is not greater than a predefined threshold. This problem has been studied recently and a computational algorithm is proposed under the assumption that matrices representing downward jumps are nonsingular. We first show that this assumption can be eliminated in a general setting of Markov chains of level-dependent G/G/1-type. Next we develop a computational algorithm for the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, by modifying the above-mentioned algorithm slightly. In principle, our algorithm is applicable to any Markov chain of level-dependent M/G/1-type, if the Markov chain is irreducible and positive-recurrent. Furthermore, as an input to the algorithm, we can set an error bound for the computed conditional distribution, which is a notable feature of our algorithm. Some numerical examples are also provided.

关键词： computational algorithm conditional stationary distribution error bound level dependence Markov chains of M/G1-type

来源：评论

学校读者我要写书评

暂无评论

Realizable algorithm for approximating Hilbert-Schmidt operators via Gabor multipliers

引用

JOURNAL OF computational AND APPLIED MATHEMATICS 2018年 337卷 119-124页

作者： Onchis, Darian M. Zappala, Simone Univ Vienna Fac Math Vienna Austria West Univ Timisoara Fac Math & Comp Sci Timisoara Romania

In this work, we consider new computational aspects to improve the approximation of Hilbert-Schmidt operators via generalized Gabor multipliers. One aspect is to consider the approximation of the symbol of an Hilbert-Schmidt operator as L-2 projection in the spline-type space associated to a Gabor multiplier. This gives the possibility to employ a selection procedure of the analysis and synthesis function, interpreted as time-frequency lag;hence, with the related algorithm it is possible to handle both underspread and overspread operators. In the numerical section, we exploit the case of approximating overspread operators having compact and smooth spreading function and discontinuous time-varying systems. For the latter, the approximation of discontinuities in the symbol is not directly achievable in the generalized Gabor multipliers setting. For this reason, another aspect is to further process the symbol through a Hough transform, to detect discontinuities and to smooth them using a new class of approximants. This procedure creates a bridge between features detection techniques and harmonic analysis methods, and in specific cases it almost doubles the accuracy of approximation. (C) 2018 The Authors. Published by Elsevier B.V.

关键词： Spline-type spaces computational algorithm Gabor multipliers Hough transform Hilbert-Schmidt operators approximation

来源：评论

学校读者我要写书评

暂无评论

Rigorous effective bounds on the Hausdorff dimension of continued fraction Cantor sets: A hundred decimal digits for the dimension of &ITE&IT₂

引用

ADVANCES IN MATHEMATICS 2018年 325卷 87-115页

作者： Jenkinson, O. Pollicott, M. Queen Mary Univ London Sch Math Sci London EL 4NS England Univ Warwick Math Inst Coventry CV4 7AL W Midlands England

We prove that the algorithm of [19] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on the dimension. The effectiveness of these rigorous estimates is illustrated for Cantor sets consisting of continued fraction expansions with restricted digits. For example the Hausdorff dimension of the set E-2 (of those reals whose continued fraction expansion only contains digits 1 and 2) can be rigorously approximated, with an accuracy of over 100 decimal places, using points of period up to 25. The method for establishing rigorous dimension bounds involves the holomorphic extension of mappings associated to the allowed continued fraction digits, an appropriate disc which is contracted by these mappings, and an associated transfer operator acting on the Hilbert Hardy space of analytic functions on this disc. We introduce methods for rigorously bounding the approximation numbers for the transfer operators, showing that this leads to effective estimates on the Taylor coefficients of the associated determinant, and hence to explicit bounds on the Hausdorff dimension. (C) 2017 The Authors. Published by Elsevier Inc.

关键词： Hausdorff dimension Continued fraction Nonlinear Cantor set computational algorithm Transfer operator Determinant

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：