We discuss the annular electron confinement on the liquid helium surface induced by a submerged tubular electrode. For a shallow liquid layer the resulting potential has a minimum off the symmetry axis of the electrod...
详细信息
We discuss the annular electron confinement on the liquid helium surface induced by a submerged tubular electrode. For a shallow liquid layer the resulting potential has a minimum off the symmetry axis of the electrode. The ground-state angular momentum transitions that are driven by the external magnetic field can be resolved when the confinement radii in the first and second Rydberg subbands of the vertical quantization are different, e.g., for submersion depth of the tube comparable to its radius. Then, discontinuities in the main microwave absorption line appear with the period that corresponds to the subsequent magnetic flux quanta passing across the area within the ground-state confinement radius.
In a recent work [R. Shojaei et al., Phys. Rev. E 100, 022303 (2019)] the authors calculate numerically the critical temperature Tc of the balanced-imbalanced phase transition in a fully connected graph. According to ...
详细信息
In a recent work [R. Shojaei et al., Phys. Rev. E 100, 022303 (2019)] the authors calculate numerically the critical temperature Tc of the balanced-imbalanced phase transition in a fully connected graph. According to their findings, Tc decreases with the number of nodes N. Here we calculate the same critical temperature using the heat-bath algorithm. We show that Tc increases with N as Nγ, with γ close to 0.5 or 1.0. This value depends on the initial fraction of positive bonds.
The MUTLIAGENT PATH FINDING (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but witho...
详细信息
We study a simple deterministic map that leads a fully connected network to the Heider balance. The map is realized by an algorithm that updates all links synchronously in a way depending on the state of the entire ne...
详细信息
We study a simple deterministic map that leads a fully connected network to the Heider balance. The map is realized by an algorithm that updates all links synchronously in a way depending on the state of the entire network. We observe that the probability of reaching a balanced state increases with the system size N. Jammed states become less frequent for larger N. The algorithm generates also limit cycles, mostly of length 2, but also of length 3, 4, 6, 12, or 14. We give a simple argument to estimate the mean size of basins of attraction of balanced states, and we discuss the symmetries of the system including the automorphism group as well as gauge invariance of triad configurations. We argue that both symmetries play an essential role in the occurrence of cycles observed in the synchronous dynamics realized by the algorithm.
SummaryIn the paper we discuss the frequency error occurring when synchronizing two semiconductor lasers under the conditions when the optical power of the reference laser is relatively weak (usually below minus thirt...
详细信息
ISBN:
(数字)9781665497183
ISBN:
(纸本)9781665497190
SummaryIn the paper we discuss the frequency error occurring when synchronizing two semiconductor lasers under the conditions when the optical power of the reference laser is relatively weak (usually below minus thirty some dBm). This synchronization approach is intended to be used in ultra-accurate long-distance fiber optic time transfer links, which require accurate and stable frequency offset between the lasers used to convey the timing information between the terminals of the transfer system. We identified that the problem is caused by the noise (and resulting insufficient signal to noise ratio) at the input of a high-frequency prescaler forming a part of the signal processing chain. To understand undergoing processes we developed a Simulink/Matlab simulation model, supported by a theoretical approach that can help designing the laser frequency synchronization circuits for the fiber optic time transfer systems.
The paper presents the system based on the layered hierarchical graphs for game plot description implemented in Godot Engine using the JSON format. The aim of the presented research is to create a tool that both suppo...
详细信息
This paper explores the applicability of generative AI (genAI), specifically Large Language Models (LLMs), for the automatic generation and configuration of metaheuristic algorithms to address a real-world engineering...
详细信息
Over the last decade, convolutional neural networks have been a core element in the recent remarkable advances in machine learning, computer vision, and robotics. Vision transformers have recently demonstrated great s...
详细信息
ISBN:
(纸本)9781665476881
Over the last decade, convolutional neural networks have been a core element in the recent remarkable advances in machine learning, computer vision, and robotics. Vision transformers have recently demonstrated great success in various computer vision tasks, motivating a tremendously increased interest in their deployment into many real-world vision applications. However, until now, the number of successful applications of transformers in robotics is somewhat limited. This work presents an approach to visual place recognition using a vision transformer (ViT). ViT trained from scratch, and two pretrained ViTs in base and large versions have been finetuned on a target dataset. The features extracted by transformers have then been used in place recognition using a k-NN. Finally, contrastive learning has been performed to embed the features and improve recognition performance. The algorithm has been evaluated in a dataset for indoor place recognition comprising images with 6-DOF viewpoint variations. Experimental results demonstrate that considerable gain in recognition accuracy can be obtained by finetuned transformers in comparison to results achieved by CNNs.
We investigate two salient chaotic features, namely Lyapunov exponent and butterfly velocity, for an asymptotically Lifshitz black hole background with arbitrary dynamical critical exponent. These features are compute...
We investigate two salient chaotic features, namely Lyapunov exponent and butterfly velocity, for an asymptotically Lifshitz black hole background with arbitrary dynamical critical exponent. These features are computed using three methods: entanglement wedge method, out-of-time-ordered correlator computation, and pole skipping. We present a comparative study where all of these methods yield exactly similar results for the butterfly velocity and Lyapunov exponent. This establishes an equivalence between all three methods for probing chaos in the chosen gravity background. Furthermore, we evaluate the chaos at the classical level by computing the eikonal phase and Lyapunov exponent from the bulk gravity. In the classical approach, we comment on potential limitations while choosing the turning point of the null geodesic in our gravity background. All chaotic properties emerge as nontrivial functions of the anisotropy index. By examining the classical eikonal phase, we uncover different scattering scenarios in the near-horizon and near-boundary regimes. Finally, we remark on a possible classical/quantum correspondence from the analysis of classical eikonal phase shift and Lyapunov exponent.
暂无评论