In this article the theoretical generalization for representation of arithmetic operations with fuzzy numbers is considered. Fuzzy numbers are generalized by medoi:10.2139/ssrn.1474683Bocharnikov, ViktorSveshnikov, SergeyRePEcSsrn Electronic Journal
翻译成中文：算法是指解决数学问题的一组规则，如果操作适当，每一次都可以得到正确的结果。更加通俗的解释是：It is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning.and arithmetic.算法是一步一步的计算过程，可以用作计算，...
The algorithm proved here solves the problem of orthogonal distance regression for the maximum norm with hyperplanes and hyperspheres. For each finite set of points in a Euclidean space of any dimension, the algorithm determines 鈥 through finitely many arithmetic operations 鈥 all the hyperplanes...
For people, "hunger" (input) - algorithm group 1 (arithmetic unit) - "go to the food visible to the naked eye" (output) (I said that any of the three parts of the algorithm configuration can be a state for a period of time). Compared with the single thread situation of "picking u...
However, there is a need for further exploration in other domains. Other popular multi-objective (MO) Algorithms include MO ant lion optimizer (MOALO)43, MO equilibrium optimizer (MOEO)44, MO slime mould algorithm (MOSMA)45, MO arithmetic optimization algorithm (MOAOA)46, non-dominated ...
Furthermore, to support the suggested research, a hybrid version of the arithmetic optimization method is constructed and used to optimize the extreme gradient boosting hyperparameters for COVID-19 chest X-ray pictures. To solve the problem of early convergence, this study introduces a novel ...
Short-time Fourier transform (STFT) can similarly be connected for quick harmonic compensation. The advantage of FFT is reduced computational error due to finite bit length arithmetic operations and fast algorithm and its drawback is non-applicability for non-stationary signals and poor time or ...
This can help to reveal the complexity of expressions, in particular the arithmetic operations occuring in expressions. Unlike CFGs and PDGs but (partly) alike ASTs, we abstract from concrete names occuring in programs. Nodes in the graph will thus not be labeled with statements or variables ...
We treat arithmetic operations on the entries of U at unit cost, and we do not account for the bit complexity associated with specifying or manipulating them. We first show (in the section “Methods”) that the nested meet-in-the-middle (MITM) technique developed in ref. 23 can be ...
based on magic cube transformation, in addition to designing a new modular arithmetic operation. First, a natural number chaotic sequence was created with the secret key. For a higher security, all secret keys were generated by different chaotic maps, thus increasing the decryption security. Then,...