Search

Digital technologies have long been explored as a complement to standard procedure in mental health research and practice, ranging from the management of electronic health records to app-based interventions. The recent emergence of large language models (LLMs), both proprietary and open-source ones, represents a major new opportunity on that front. Yet there is still a divide between the community developing LLMs and the one which may benefit from them, thus hindering the beneficial translation of the technology into clinical use. This divide largely stems from the lack of a common language and understanding regarding the technology's inner workings, capabilities, and risks. Our narrative review attempts to bridge this gap by providing intuitive explanations behind the basic concepts related to contemporary LLMs.

Flux compactifications that give three- or four-dimensional Anti de Sitter vacua with a parametrically small negative cosmological constant are claimed to be ubiquitous in String Theory. However, the 1+1 and 2+1 dimensional CFT duals to such vacua should have very large central charges and rather unusual properties. We construct brane configurations that source these would-be AdS flux compactifications, and identify certain UV AdS geometries that these branes source. The central charge of the CFT duals to these UV AdS geometries place lower bounds on the absolute values of the cosmological constants of the AdS vacua. These bounds are incompatible with the scale separation needed to construct realistic cosmological models., Comment: 4 pages, 1 figure

Results of extensive combined experimental and theoretical investigations on static and dynamic properties of Ir/Co/Pt multilayer with low uniaxial anisotropy and asymmetric Ir/Co and Co/Pt interfaces responsible for large interfacial Dzyaloshinskii-Moriya interaction (IDMI) are presented. Within longitudinal magneto-optical Kerr effect-based microscopy and magnetic force microscopy studies a complex magnetic configuration was detected: large in-plane magnetized domains of several dozen micrometers size were modulated by a weak stripe domain pattern with periods of about 100 nm. Using Brillouin Light Scattering spectrometry, the hysteresis of the Stokes and anti-Stokes peaks frequencies was observed as a function of the magnetic field. This hysteretic behavior associated with IDMI-induced asymmetry of spin waves dispersion is correlated with switching of the large macro-domains. Using micromagnetic simulations we determine field-dependent magnetization distributions and dispersion relations, proposing an explanation of the observed behavior. The investigated nanostructure can be used as non-volatile spin waves velocity switcher., Comment: Accepted for publication in Physical Rewiev B, https://journals.aps.org/prb/accepted/ce071O5bHbf17c5401c04140b8bb51c940576e842

Numerical simulation of strong-field quantum electrodynamics (SFQED) processes is an essential step towards current and future high-intensity laser experiments. The complexity of SFQED phenomena and their stochastic nature make them extremely computationally challenging, requiring the use of supercomputers for realistic simulations. Recently, we have presented a novel approach to numerical simulation of SFQED processes based on an accurate approximation of precomputed rates, which minimizes the number of rate calculations per QED event. The current paper is focused on the high-performance implementation of this method, including vectorization of resource-intensive kernels and improvement of parallel computing efficiency. Using two codes, PICADOR and hi-$\chi$ (the latter being free and publicly available), we demonstrate significant reduction in computation time due to these improvements. We hope that the proposed approach can be applied in other codes for the numerical simulation of SFQED processes.

The dawn of Foundation Models has on the one hand revolutionised a wide range of research problems, and, on the other hand, democratised the access and use of AI-based tools by the general public. We even observe an incursion of these models into disciplines related to human psychology, such as the Affective Computing domain, suggesting their affective, emerging capabilities. In this work, we aim to raise awareness of the power of Foundation Models in the field of Affective Computing by synthetically generating and analysing multimodal affective data, focusing on vision, linguistics, and speech (acoustics). We also discuss some fundamental problems, such as ethical issues and regulatory aspects, related to the use of Foundation Models in this research area.

With increasingly larger and more complex telecommunication networks, there is a need for improved monitoring and reliability. Requirements increase further when working with mission-critical systems requiring stable operations to meet precise design and client requirements while maintaining high availability. This paper proposes a novel methodology for developing a machine learning model that can assist in maintaining availability (through anomaly detection) for client-server communications in mission-critical systems. To that end, we validate our methodology for training models based on data classified according to client performance. The proposed methodology evaluates the use of machine learning to perform anomaly detection of a single virtualized server loaded with simulated network traffic (using SIPp) with media calls. The collected data for the models are classified based on the round trip time performance experienced on the client side to determine if the trained models can detect anomalous client side performance only using key performance indicators available on the server. We compared the performance of seven different machine learning models by testing different trained and untrained test stressor scenarios. In the comparison, five models achieved an F1-score above 0.99 for the trained test scenarios. Random Forest was the only model able to attain an F1-score above 0.9 for all untrained test scenarios with the lowest being 0.980. The results suggest that it is possible to generate accurate anomaly detection to evaluate degraded client-side performance.

This work presents an analysis of the behavior of an electromagnetic field near the common edge of two resistive half-planes with different surface impedances. Contrary to the case of a single resistive half-plane, in the case of the impedance junction, both electric and magnetic fields' transverse components simultaneously contain a logarithmic singularity. It is shown that a surface current density has a finite jump that is proportional to the difference between the inverse impedances., Comment: 4 pages, 1 figure

High-strength composite hydrogels cellulose-polyacrylamide were synthesized by free-radical polymerization of acrylamide conducted inside the previously formed physical network of regenerated plant cellulose. Partial hydrolysis of the amide groups of these hydrogels yielded their ionic forms with a degree of hydrolysis of 0.1 and 0.25. The cylindrical hydrogel samples of three compositions were implanted in the preformed osteochondral defects of the rabbit's femoral knee joints. No signs of migration or disintegration of the tested implants were revealed in the course of in vivo tests as long as 90 and 120 days after the implantation. The mechanical behavior of both the virgin hydrogels-implants and the implants extracted from the joints after in vivo experiments was studied in detail. The morphology and chemical composition of the extracted implants were studied by SEM combined with the EDX method. The results obtained were shown that the mechanical characteristics of hydrogel implants remained practically unchanged after in vivo tests. The extracted implants, as well as the initial hydrogels, endured cyclic compression loading at the amplitude up to 50 %. Compression stresses up to 3-10 MPa were recorded in these tests, which is close to the data obtained by several authors for natural articular cartilages in the same conditions of loading. The principal differences in the chemical composition and morphology of the implant area adjacent to the subchondral bone for non-ionic and ionic types of implants have been revealed. If for non-ionic types of implants in this area intensive mineralization with formation of calcium phosphates inside the polymeric hydrogel network is observed, the border area of ionic implants practically does not undergo mineralization., Comment: 39 pages, 19 figures, 8 tables

Regular and context-free languages form a central pillar of formal language theory. This is because a variety of formalisms are known that define these classes of languages. For example, we have that finite automata, monoids, algebraic recognizability, regular expressions, regular grammars, monadic-second order logic, etc., can be used to represent regular word languages. However, the situation is less clear for formal languages over graphs, and open problems persist. This is because generalizing notions from words to graphs has been more successful for some of the cited formalisms than for the other ones. Bruno Courcelle has introduced hyper-edge replacement (\hr) algebras for generalizing the notion of context-free languages from words to graphs. At the same time, \hr-algebras support the generalization of algebraic recognizability from words to graphs, a notion that has been proven to be equivalent to definability in (counting) monadic-second order logic (\cmso) over graphs of bounded tree-width. In this paper, we deal with generalizing regular word grammars to graphs. We propose regular grammars for (unordered and unranked) trees, series-parallel graphs, and graphs of tree-width $\le 2$, where the qualifier regular is justified because these grammars define exactly the recognizable resp. \cmso-definable subsets of the respective graph classes.

Abusive content in online social networks is a well-known problem that can cause serious psychological harm and incite hatred. The ability to upload audio data increases the importance of developing methods to detect abusive content in speech recordings. However, simply transferring the mechanisms from written abuse detection would ignore relevant information such as emotion and tone. In addition, many current algorithms require training in the specific language for which they are being used. This paper proposes to use acoustic and prosodic features to classify abusive content. We used the ADIMA data set, which contains recordings from ten Indic languages, and trained different models in multilingual and cross-lingual settings. Our results show that it is possible to classify abusive and non-abusive content using only acoustic and prosodic features. The most important and influential features are discussed.

The control system in surgical robots must ensure patient safety and real time control. As such, all the uncertainties which could appear should be considered into an extended model of the plant. After such an uncertain plant is formed, an adequate controller which ensures a minimum set of performances for each situation should be computed. As such, the continuous-time robust control paradigm is suitable for such scenarios. However, the problem is generally solved only for linear and time invariant plants. The main focus of the current paper is to include m-link serial surgical robots into Robust Control Framework by considering all nonlinearities as uncertainties. Moreover, the paper studies an incipient problem of numerical implementation of such control structures.

Foundation models (FMs) are increasingly spearheading recent advances on a variety of tasks that fall under the purview of computer audition -- the use of machines to understand sounds. They feature several advantages over traditional pipelines: among others, the ability to consolidate multiple tasks in a single model, the option to leverage knowledge from other modalities, and the readily-available interaction with human users. Naturally, these promises have created substantial excitement in the audio community, and have led to a wave of early attempts to build new, general-purpose foundation models for audio. In the present contribution, we give an overview of computational audio analysis as it transitions from traditional pipelines towards auditory foundation models. Our work highlights the key operating principles that underpin those models, and showcases how they can accommodate multiple tasks that the audio community previously tackled separately.

The Dirac-Born-Infled action that describes the dynamics of D branes also allows one to compute the supersymmetries they preserve using the Kappa-symmetry projector. The ''Lagrangian'' expression of this projector depends on the velocity and electric fields of the branes, but not on the corresponding conserved charges. One can also construct the projector in a ''Hamiltonian'' approach, by multiplying the conserved string, brane and momentum charges with the corresponding gamma matrix involutions, adding them to the mass of the brane multiplied by the unit matrix, and normalizing the resulting expression. We show that these two procedures are equivalent., Comment: 14 pages

Satellite Communications (SatCom) are a backbone of worldwide development. In contrast with the past, when the GEO satellites were the only means for such connectivity, nowadays the multi-orbital connectivity is emerging, especially with the use of satellite constellations. Simultaneously, SatCom enabled the so-called In-Flight Connectivity, while with the advent of 5G-NTN, the development of this market is being accelerated. However, there are still various missing points before such a technology becomes mainstream, especially in the case of Rotary Wing Aircraft (RWA). Indeed, due to their particular characteristics, such as the low altitude flights and the blade interference, there are still open challenges. In this work, an End-to-End (E2E) analysis for the performance of SatCom under 5G-NTN for manned and unmanned RWA is performed. Various scenarios are examined, and related requirements are shown. The effects of blades and other characteristics of the RWA are established, and simulations for these cases are developed. Results along with related discussion are presented, while future directions for development are suggested. This work is part of the ESA ACROSS-AIR project., Comment: Accepted for publication at the 29th IEEE CAMAD Workshop, 21-23 Oct, 2024, Athens, Greece

We show that the near-brane back-reaction of M2 branes ending on M5 branes has a rich "spike structure" that is determined by partitioning the numbers of M2 branes that are terminating on groups of M5 branes. The near-brane limit of the metric describing these branes has an AdS$_3$ factor, implying the existence of a dual CFT. Each partition of the M2 and M5 charges among spikes gives rise to a different "mohawk" revealing a new layer of brane fractionation. We conjecture that all these mohawks are dual to ground states of near-brane-intersection CFT's. We show that the supergravity solutions describing these mohawks are part of the large families of AdS$_3$ $\times S^3 \times S^3$ solutions described in [arXiv:1312.5477]. We identify precisely which of these families are relevant to brane intersections and show that the AdS$_3$ invariance emerges from the self-similarity of the spikes., Comment: 25 pages, 6 figures

We consider coupled gravitational and electromagnetic perturbations of a family of five-dimensional Einstein-Maxwell solutions that describes both magnetized black strings and horizonless topological stars. We find that the odd perturbations of this background lead to a master equation with five Fuchsian singularities and compute its quasinormal mode spectrum using three independent methods: Leaver, WKB and numerical integration. Our analysis confirms that odd perturbations always decay in time, while spherically symmetric even perturbations may exhibit for certain ranges of the magnetic fluxes instabilities of Gregory-Laflamme type for black strings and of Gross-Perry-Yaffe type for topological stars. This constitutes evidence that topological stars and black strings are classically stable in a finite domain of their parameter space.

In this work we propose the design principles of an integrated distributed system for the augment of the transportation for people with disabilities inside the road network of a city area utilizing the IT technologies. We propose the basis of our system upon the utilization of a distributed sensor network that will be incorporated by a real-time integrated feedback system. The main components of the proposed architecture include the Inaccessible City Point System, the Live Data Analysis and Response System, and the Obstruction Detection and Prevention System. The incorporation of these subsystems will provide real-time feedback assisting the transportation of individuals with mobility problems informing them on real-time about blocked ramps across the path defined to their destination, being also responsible for the information of the authorities about incidents regarding the collision of accessibility in place where the sensors detect an inaccessible point. The proposed design allows the addition of further extensions regarding the assistance of individuals with mobility problems providing a basis for its further implementation and improvement. In this work we provide the fundamental parts regarding the interconnection of the proposed architecture's components as also its potential deployment regarding the proposed architecture and its application in the area of a city., Comment: 7 pages, 6 figures

The paper presents the kinematic modelling for the coupled motion of a 6-DOF surgical parallel robot PARA-SILSROB which guides a mobile platform carrying the surgical instruments, and the actuators of the sub-modules which hold these tools. To increase the surgical procedure safety, a closed form solution for the kinematic model is derived and then, the forward and inverse kinematic models for the mobile orientation platform are obtained. The kinematic models are used in numerical simulations for the reorientation of the endoscopic camera, which imposes an automated compensatory motion from the active instruments' mod-ules.

Motivated by applications to deep learning which often fail standard Lipschitz smoothness requirements, we examine the problem of sampling from distributions that are not log-concave and are only weakly dissipative, with log-gradients allowed to grow superlinearly at infinity. In terms of structure, we only assume that the target distribution satisfies either a log-Sobolev or a Poincar\'e inequality and a local Lipschitz smoothness assumption with modulus growing possibly polynomially at infinity. This set of assumptions greatly exceeds the operational limits of the "vanilla" unadjusted Langevin algorithm (ULA), making sampling from such distributions a highly involved affair. To account for this, we introduce a taming scheme which is tailored to the growth and decay properties of the target distribution, and we provide explicit non-asymptotic guarantees for the proposed sampler in terms of the Kullback-Leibler (KL) divergence, total variation, and Wasserstein distance to the target distribution., Comment: 32 pages, 2 figures

The emergence and rapid development of the open RISC-V instruction set architecture opens up new horizons on the way to efficient devices, ranging from existing low-power IoT boards to future high-performance servers. The effective use of RISC-V CPUs requires software optimization for the target platform. In this paper, we focus on the RISC-V-specific optimization of the CatBoost library, one of the widely used implementations of gradient boosting for decision trees. The CatBoost library is deeply optimized for commodity CPUs and GPUs. However, vectorization is required to effectively utilize the resources of RISC-V CPUs with the RVV 0.7.1 vector extension, which cannot be done automatically with a C++ compiler yet. The paper reports on our experience in benchmarking CatBoost on the Lichee Pi 4a, RISC-V-based board, and shows how manual vectorization of computationally intensive loops with intrinsics can speed up the use of decision trees several times, depending on the specific workload. The developed codes are publicly available on GitHub.

Translating notions and results from category theory to the theory of computability models of Longley and Normann, we introduce the Grothendieck computability model and the first-projection-simulation. We prove some basic properties of the Grothendieck computability model, and we show that the category of computability models is a type-category, in the sense of Pitts. We introduce the notion of a fibration and opfibration-simulation, and we show that the first-projection-simulation is a split opfibration-simulation., Comment: 12 pages

One way to describe the entropy of black holes comes from partitioning momentum charge across fractionated intersecting brane systems. Here we construct $\frac{1}{8}$-BPS solutions by adding momentum to a maze of M2-brane strips stretched between M5 branes. Before the addition of momentum, the $\frac{1}{4}$-BPS supergravity solution describing the maze is governed by a master function obeying a complicated Monge-Amp\`ere equation. Given such a solution, we show that one can add momentum waves without modifying the $\frac{1}{4}$-BPS M2-M5 background. Remarkably, these excitations are fully determined by a layered set of $\textit{linear}$ equations. The fields responsible for carrying the momentum are parameterized by arbitrary functions of a null direction, and have exactly the same structure as in brane world-volume constructions. The fact that the momentum and flux excitations of the M2-M5-P system are governed by a linear structure brings us one step closer to using supergravity solutions to capture the entropy of supersymmetric black-holes., Comment: 24 pages, 1 figure

The dynamic behavior of agents in games, which captures how their strategies evolve over time based on past interactions, can lead to a spectrum of undesirable behaviors, ranging from non-convergence to Nash equilibria to the emergence of limit cycles and chaos. To mitigate the effects of selfish behavior, central planners can use dynamic payments to guide strategic multi-agent systems toward stability and socially optimal outcomes. However, the effectiveness of such interventions critically relies on accurately predicting agents' responses to incentives and dynamically adjusting payments so that the system is guided towards the desired outcomes. These challenges are further amplified in real-time applications where the dynamics are unknown and only scarce data is available. To tackle this challenge, in this work we introduce the SIAR-MPC method, combining the recently introduced Side Information Assisted Regression (SIAR) method for system identification with Model Predictive Control (MPC). SIAR utilizes side-information constraints inherent to game theoretic applications to model agent responses to payments from scarce data, while MPC uses this model to facilitate dynamic payment adjustments. Our experiments demonstrate the efficiency of SIAR-MPC in guiding the system towards socially optimal equilibria, stabilizing chaotic behaviors, and avoiding specified regions of the state space. Comparative analyses in data-scarce settings show SIAR-MPC's superior performance over pairing MPC with Physics Informed Neural Networks (PINNs), a powerful system identification method that finds models satisfying specific constraints.

Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width. While for words and trees the syntactic restrictions that guarantee that the associated languages of words resp. trees are regular - and hence, MSO-definable - are known, the situation is far more complicated for graphs. Here, Courcelle proposed the notion of regular graph grammars, a syntactic restriction of HR grammars that guarantees the definability of the associated languages of graphs in Counting Monadic Second Order Logic (CMSO). However, these grammars are not complete in the sense that not every CMSO-definable set of graphs of bounded tree-width can be generated by a regular graph grammar. In this paper, we introduce a new syntactic restriction of HR grammars, called tree-verifiable graph grammars, and a new notion of bounded tree-width, called embeddable bounded tree-width, where the later restricts the trees of a tree-decomposition to be a subgraph of the analyzed graph. The main property of tree-verifiable graph grammars is that their associated languages are CMSO-definable and that the have bounded embeddable tree-width. We show further that they strictly generalize the regular graph grammars of Courcelle. Finally, we establish a completeness result, showing that every language of graphs that is CMSO-definable and of bounded embeddable tree-width can be generated by a tree-verifiable graph grammar.

A class of graph languages is definable in Monadic Second-Order logic (MSO) if and only if it consists of sets of models of MSO formul{\ae}. If, moreover, there is a computable bound on the tree-widths of the graphs in each such set, the satisfiability and entailment problems are decidable, by Courcelle's Theorem. This motivates the comparison of other graph logics to MSO. In this paper, we consider the MSO definability of a Separation Logic of Relations (SLR) that describes simple hyper-graphs, in which each sequence of vertices is attached to at most one edge with a given label. Our logic SLR uses inductive predicates whose recursive definitions consist of existentially quantified separated conjunctions of relation and predicate atoms. The main contribution of this paper is an expressive fragment of SLR that describes bounded tree-width sets of graphs which can, moreover, be effectively translated into MSO.

The informational synthesis of neural structures, processes, parameters and characteristics that allow a unified description and modeling as neural machines of natural and artificial neural systems is presented. The general informational parameters as the global quantitative measure of the neural systems computing potential as absolute and relative neural power were proposed. Neural information organizing and processing follows the way in which nature manages neural information by developing functions, functionalities and circuits related to different internal or peripheral components and also to the whole system through a non-deterministic memorization, fragmentation and aggregation of afferent and efferent information, deep neural information processing representing multiple alternations of fragmentation and aggregation stages. The relevant neural characteristics were integrated into a neural machine type model that incorporates unitary also peripheral or interface components as the central ones. The proposed approach allows overcoming the technical constraints in artificial computational implementations of neural information processes and also provides a more relevant description of natural ones.

We prove explicit uniform two-sided bounds for the phase functions of Bessel functions and of their derivatives. As a consequence, we obtain new enclosures for the zeros of Bessel functions and their derivatives in terms of inverse values of some elementary functions. These bounds are valid, with a few exceptions, for all zeros and all Bessel functions with non-negative indices. We provide numerical evidence showing that our bounds either improve or closely match the best previously known ones., Comment: 38 pages (including Appendices), 13 figures, 3 tables, v3: minor corrections and edits, some references added. To appear in SIAM J. Math. Anal. The accompanying Mathematica script and its printout are available for download at https://michaellevitin.net/bessels.html

We introduce cs-topologies, or topologies of complemented subsets, as a new approach to constructive topology that preserves the duality between open and closed subsets of classical topology. Complemented subsets were used successfully by Bishop in his constructive formulation of the Daniell approach to measure and integration. Here we use complemented subsets in topology, in order to describe simulataneously an open set, the first-component of an open complemented subset, and its complement as a closed set, the second component of an open complemented subset. We analyse the canonical cs-topology induced by a metric, and we introduce the notion of a modulus of openness for a cs-open subset of a metric space. Pointwise and uniform continuity of functions between metric spaces are formulated with respect to the way these functions inverse open complemented subsets together with their moduli of openness. The addition of moduli of openness in the concept of an open subset, given a base for the cs-topology, makes possible to define the notion of uniform continuity of functions between csb-spaces, that is cs-spaces with a given base. In this way, the notions of pointwise and uniform continuity of functions between metric spaces are directly generalised to the notions of pointwise and uniform continuity between csb-topological spaces. Constructions and facts from the classical theory of topologies of open subsets are translated to our constructive theory of topologies of open complemented subsets., Comment: 45 pages

A wide array of modern machine learning applications - from adversarial models to multi-agent reinforcement learning - can be formulated as non-cooperative games whose Nash equilibria represent the system's desired operational states. Despite having a highly non-convex loss landscape, many cases of interest possess a latent convex structure that could potentially be leveraged to yield convergence to equilibrium. Driven by this observation, our paper proposes a flexible first-order method that successfully exploits such "hidden structures" and achieves convergence under minimal assumptions for the transformation connecting the players' control variables to the game's latent, convex-structured layer. The proposed method - which we call preconditioned hidden gradient descent (PHGD) - hinges on a judiciously chosen gradient preconditioning scheme related to natural gradient methods. Importantly, we make no separability assumptions for the game's hidden structure, and we provide explicit convergence rate guarantees for both deterministic and stochastic environments., Comment: 32 pages, 18 figures