Chaotic oscillations and noise transformations in a simple dissipative system with delayed feedback

We analyze the statistical behavior of signals in nonlinear circuits with delayed feedback in the presence of external Markovian noise. For the special class of circuits with intense phase mixing we develop an approach for the computation of the probability distributions and multitime correlation functions based on the random phase approximation. Both Gaussian and Kubo-Andersen models of external noise statistics are analyzed and the existence of the stationary (asymptotic) random process in the long-time limit is shown. We demonstrate that a nonlinear system with chaotic behavior becomes a noise amplifier with specific statistical transformation properties.     

FPGA-Implemented Fractal Decoder with Forward Error Correction in Short-Reach Optical Interconnects

Forward error correction (FEC) codes combined with high-order modulator formats, i.e., coded modulation (CM), are essential in optical communication networks to achieve highly efficient and reliable communication. The task of providing additional error control in the design of CM systems with high-performance requirements remains urgent. As an additional control of CM systems, we propose to use indivisible error detection codes based on a positional number system. In this work, we evaluated the indivisible code using the average probability method (APM) for the binary symmetric channel (BSC), which has the simplicity, versatility and reliability of the estimate, which is close to reality. The APM allows for evaluation and compares indivisible codes according to parameters of correct transmission, and detectable and undetectable errors. Indivisible codes allow for the end-to-end (E2E) control of the transmission and processing of information in digital systems and design devices with a regular structure and high speed. This study researched a fractal decoder device for additional error control, implemented in field-programmable gate array (FPGA) software with FEC for short-reach optical interconnects with multilevel pulse amplitude (PAM-M) modulated with Gray code mapping. Indivisible codes with natural redundancy require far fewer hardware costs to develop and implement encoding and decoding devices with a sufficiently high error detection efficiency. We achieved a reduction in hardware costs for a fractal decoder by using the fractal property of the indivisible code from 10% to 30% for different n while receiving the reciprocal of the golden ratio.     

EEG Fractal Analysis Reflects Brain Impairment after Stroke

Stroke is the commonest cause of disability. Novel treatments require an improved understanding of the underlying mechanisms of recovery. Fractal approaches have demonstrated that a single metric can describe the complexity of seemingly random fluctuations of physiological signals. We hypothesize that fractal algorithms applied to electroencephalographic (EEG) signals may track brain impairment after stroke. Sixteen stroke survivors were studied in the hyperacute (<48 h) and in the acute phase (∼1 week after stroke), and 35 stroke survivors during the early subacute phase (from 8 days to 32 days and after ∼2 months after stroke): We compared resting-state EEG fractal changes using fractal measures (i.e., Higuchi Index, Tortuosity) with 11 healthy controls. Both Higuchi index and Tortuosity values were significantly lower after a stroke throughout the acute and early subacute stage compared to healthy subjects, reflecting a brain activity which is significantly less complex. These indices may be promising metrics to track behavioral changes in the very early stage after stroke. Our findings might contribute to the neurorehabilitation quest in identifying reliable biomarkers for a better tailoring of rehabilitation pathways.     

An Improved Calculation Formula of the Extended Entropic Chaos Degree and Its Application to Two-Dimensional Chaotic Maps

The Lyapunov exponent is primarily used to quantify the chaos of a dynamical system. However, it is difficult to compute the Lyapunov exponent of dynamical systems from a time series. The entropic chaos degree is a criterion for quantifying chaos in dynamical systems through information dynamics, which is directly computable for any time series. However, it requires higher values than the Lyapunov exponent for any chaotic map. Therefore, the improved entropic chaos degree for a one-dimensional chaotic map under typical chaotic conditions was introduced to reduce the difference between the Lyapunov exponent and the entropic chaos degree. Moreover, the improved entropic chaos degree was extended for a multidimensional chaotic map. Recently, the author has shown that the extended entropic chaos degree takes the same value as the total sum of the Lyapunov exponents under typical chaotic conditions. However, the author has assumed a value of infinity for some numbers, especially the number of mapping points. Nevertheless, in actual numerical computations, these numbers are treated as finite. This study proposes an improved calculation formula of the extended entropic chaos degree to obtain appropriate numerical computation results for two-dimensional chaotic maps.     

Morphology Development in Multi‐Component Polymer Blends: I Composition Effect on Phase Morphology in PP/PET Polymer Blends

The relationship of the phase morphology of polypropylene/polyethylene‐terephthalate (PP/PET) blends and their corresponding compatibilized blends with composition was investigated using digital image analysis. A diameter, d _g , was defined and calculated to discuss the phase morphology of this polymer blend system. A figure‐estimation method was introduced to determine the width of the distribution of d _g . Based on the method, it is proven that the distribution of d _g obeys a log‐normal distribution and consequently, the distribution width, σ was calculated. Further, a fractal dimension, D _f , was introduced to describe the distribution of main sizes of the particles of the dispersed phase. The results showed that, while d _g increased with the concentration of the dispersed phase, σ and D _f show different dependence relations on composition;σ increases monotonously but D _f shows a maximum at a PET content of 30%, indicating that, even though the whole size distribution is much broader, the distribution of the main body of size becomes more uniform when the content of PET is less than 30%.     

带调速器的多台机组的暂态关联稳定性

对于带调速器的多台电机组,本文引入关联矩阵E=(e_(ij))_(n×n),应用李雅普诺夫函数分解法,研究了此电力大系统的暂态关联稳定性,得到了系统的分解系数与稳定区域的估计公式。     

一类非线性时序模型非遍历性的一个充分条件

本文研究了一类由紧算子与加性i.i.d.干扰确定的非线性时间序列的非遍历性,揭示了这类非线性时间序列的非遍历性与其相应确定性部分的Lyapunov函数之间的联系。     

Hopfield型模型的收敛性

本文考虑Ｈｏｐｆｉｅｌｄ型模型的收敛性问题和吸引子的吸引域的刻画。证明了Ｎ＜＋∞与Ｎ＝＋∞时Ｈｏｐｆｉｅｌｄ模型在几乎处处的意义下收敛于吸引集。当Ｎ＜＋∞时，模型将在有限时间内稳定于某一吸引子上．对于Ｎ＜＋∞与Ｎ＝＋ ∞的情形，分别得到了吸引域的一个集的刻画。     

定速风力发电机模型参考自适应控制

在对定速风力发电机建模的基础上,设计了模型参考自适应控制器,并进行了跟随性能和抗干扰性能仿真,仿真结果表明自适应控制器的自适应能力很好.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.