A virtuális tömegek lázadása György Csepeli
Symbolon (Targu Mures),
08/2020, Volume:
18, Issue:
1(32)
Journal Article
Open access
The Revolt of Virtual Masses In my presentation, I compare the crowd turned into a shapeless, deformed mass of humans gathered in a real, material sphere with psychological processes taking place in ...virtual space, which without direct coexistence provokes the same self-loss and regression than real crowds. In the case of virtual masses, the situation is different, people who constitute the mass orientate in the world encompassed by the internet with the help of social media. In the context of social media there is no good, bad, true and false. Communication is constantly dominated by the euphoric and obsessed sensations and the participants do not realize the algorithms delivered by the Big Data, through these they become unrestrictedly influenced. Creation turns into the wrong way.
For high-volume manufacturing, yield estimation is an important design step to determine the effects of uncertainties in the fabrication process. The tolerances associated with the fabrication ...process are applied to the statistically significant system parameters, and a Monte Carlo (MC) simulation is historically done to accurately estimate the yield. This process becomes computationally very expensive when the number of statistically significant system parameters are either too difficult to intuitively determine or are too high. A nonlinear partial-least-squares-based polynomial chaos expansion (NLPLSs-based PCE) is proposed as a solution for complex antenna yield analysis. NLPLS-based PCE effectively reduces the system dimensionality using NLPLS and simultaneously extracts the statistical information on the same sample set, that is, yield, using PCE. It is also possible to perform a global sensitivity analysis using NLPLS-based PCE surrogates, providing an additional advantage. This method is illustrated using an eight-variable single-frequency patch antenna, an eight-variable dual-band patch antenna, and a 37-variable diplexer requiring 30, 10, and 30 analysis points, respectively, to obtain converged yield estimates.
The analysis of Russian trolling in Asta Zelenskauskaité's book Creating chaos online (University of Michigan Press, 2022) moves the rich literature on dis- and mis-information forward by making ...visible assumptions that underlie much of the rest of that literature - that those involved with this information believe it to be true, that it takes just one step to go from false information to social chaos, and that the goal of those producing and distributing that information are doing so in order to get "alternative" facts out there - and demonstrating that these assumptions do not necessarily hold. In this work, the author spawns a new research agenda regarding the multiple dimensions of masking and distinct steps in getting from here (social stability) to there (social chaos). The work treats what happens online as theater, and so also stimulates in this reader the critical question first raised in the 1990s - how should we understand what we see online if the screen is a window, not a stage?
On Kac's chaos and related problems Hauray, Maxime; Mischler, Stéphane
Journal of functional analysis,
05/2014, Volume:
266, Issue:
10
Journal Article
Peer reviewed
Open access
This paper is devoted to establish quantitative and qualitative estimates related to the notion of chaos as firstly formulated by M. Kac 41 in his study of mean-field limit for systems of N ...undistinguishable particles as N→∞. First, we quantitatively liken three usual measures of Kac's chaos, some involving all the N variables, others involving a finite fixed number of variables. Next, we define the notion of entropy chaos and Fisher information chaos in a similar way as defined by Carlen et al. 17. We show that Fisher information chaos is stronger than entropy chaos, which in turn is stronger than Kac's chaos. We also establish that Kac's chaos plus Fisher information bound implies entropy chaos. We then extend our analysis to the framework of probability measures with support on the Kac's spheres, revisiting 17 and giving a possible answer to 17, Open problem 11. Last, we consider the context of probability measures mixtures introduced by De Finetti, Hewitt and Savage. We define the (level 3) Fisher information for mixtures and prove that it is l.s.c. and affine, as that was done in 64 for the level 3 Boltzmann's entropy.
With the advancement in digital technologies and the demand for secure communication, there
is an increased interest in the design and implementation of reliable image encryption schemes. This paper
...presents a thorough review of chaos theory and its application in image encryption schemes. Due to ergodicity
and initial key sensitivity, chaos-based image encryption schemes have several advantages over traditional
encryption schemes. The paper discusses the major applications of chaos theory, particularly in image
encryption area. The use of different chaotic maps such as one and multi-dimensional chaos, hyper and
composite chaos in image encryption have been presented. The paper also discusses current trends and
future research directions in the field of chaotic image encryption. This work provides a foundation for future
research work along with providing basic understanding to new researchers. Several recommendations have
been suggested that can improve a chaos-based cryptosystem.
We demonstrate analytically and verify numerically that the out-of-time order correlator is given by the thermal average of Loschmidt echo signals. This provides a direct link between the ...out-of-time-order correlator-a recently suggested measure of information scrambling in quantum chaotic systems-and the Loschmidt echo, a well-appreciated familiar diagnostic that captures the dynamical aspect of chaotic behavior in the time domain, and is accessible to experimental studies.
Full text
Available for:
CMK, CTK, FMFMET, NUK, UL
When chaotic systems are used in different practical applications, such as nonlinear control and cryptography, their complex chaos dynamics are strongly required. However, many existing chaotic ...systems have simple complexity, and this brings negative effects to chaos-based applications. To address this issue, this paper introduces a sine chaotification model (SCM) as a general framework to enhance the chaos complexity of existing one-dimensional (1-D) chaotic maps. The SCM uses a sine function as a nonlinear chaotification transform and applies it to the output of a 1-D chaotic map. The resulting enhanced chaotic map of the SCM has better chaos complexity and a much larger chaotic range than the seed map. Theoretical analysis verifies the efficiency of the SCM. To show the performance of the SCM, we apply SCM to three existing chaotic maps and analyze the dynamics properties of the obtained enhanced chaotic maps. Performance evaluations prove that the three enhanced chaotic maps have more complicated dynamics behaviors than their seed chaotic maps. To show the implementation simplicity of the SCM, we implement the three enhanced chaotic maps using the field-programmable gate array. To investigate the SCM in practical application, we design pseudorandom number generators using the enhanced chaotic maps.
In this paper we generalize the notion of an unpredictable point in a semiflow, introduced by Akhmet and Fen in 2016, to the case of semiflows with arbitrary acting topological monoids. We then ...introduce the notions of strong Ruelle–Takens and strong Auslander–Yorke chaoticity in semiflows. We use unpredictable points in some statements involving these notions.
One of the major drawbacks of the conventional differential chaos shift keying (DCSK) system is the addition of channel noise to both the reference signal and the data-bearing signal, which ...deteriorates its performance. In this brief, we propose a noise reduction DCSK system as a solution to reduce the noise variance present in the received signal in order to improve performance. For each transmitted bit, instead of generating β different chaotic samples to be used as a reference sequence, β/P chaotic samples are generated and then duplicated P times in the signal. At the receiver, P identical samples are averaged, and the resultant filtered signal is correlated to its time-delayed replica to recover the transmitted bit. This averaging operation of size P reduces the noise variance and enhances the performance of the system. Theoretical bit error rate expressions for additive white Gaussian noise and multipath fading channels are analytically studied and derived. Computer simulation results are compared to relevant theoretical findings to validate the accuracy of the proposed system and to demonstrate the performance improvement compared to the conventional DCSK, the improved DCSK, and the differential-phase-shift-keying systems.
PDF
