Miracle-dz/UniFAR-FTUs huggingface dataset:
Interstellar Benzene Formation Mechanisms via Acetylene Cyclotrimerization Catalyzed by Fe+ Attached to Water Ice Clusters: Quantum Chemistry Calculation Study

Benzene is the simplest building block of polycyclic aromatic hydrocarbons and has previously been found in the interstellar medium. Several barrierless reaction mechanisms for interstellar benzene formation that may operate under low-temperature and low-pressure conditions in the gas phase have been proposed. In this work, we studied different mechanisms for interstellar benzene formation based on acetylene cyclotrimerization catalyzed by Fe+ bound to solid water clusters through quantum chemistry calculations. We found that benzene is formed via a single-step process with one transition state from the three acetylene molecules on the Fe+(H2O)n (n = 1, 8, 10, 12 and 18) cluster surface. Moreover, the obtained mechanisms differed from those of single-atom catalysis, in which benzene is sequentially formed via multiple steps.
A nilpotent Whitehead theorem for $\mathsf{TQ}$-homology of structured ring spectra

The aim of this short paper is to prove a TQ-Whitehead theorem for nilpotent structured ring spectra. We work in the framework of symmetric spectra and algebras over operads in modules over a commutative ring spectrum. Our main result can be thought of as a TQ-homology analog for structured ring spectra of Dror's generalized Whitehead theorem for topological spaces; here TQ-homology is short for topological Quillen homology. We also prove retract theorems for the TQ-completion and homotopy completion of nilpotent structured ring spectra.
Recurrent Shoulder Instability after Arthroscopic Bankart Repair in an Elite Baseball Pitcher—A Case Report

A 16-year-old right-handed male pitcher had a first-time right anterior shoulder dislocation during a baseball game. X-ray and MRI revealed no apparent glenoid bone loss or Hill-Sachs lesion, but an anterior labroligamentous periosteal sleeve avulsion (ALPSA) lesion with mild posterolateral decompression of the humerus head. His instability severity index score (ISIS score) was 5 with an on-track lesion. He had an arthroscopic Bankart repair using two all-suture anchors and returned to pitching 6 months after the index surgery. However, he had an unstable sensation after 50 pitches during a game one year postoperatively. This time, he presented with a significant Hill–Sachs lesion and a recurrent APLSA lesion. His ISIS score was 6 with an on-tract lesion. During the arthroscopic examination, the previous suture was stable, while anterior capsuloligament tissues were dislodged from sutures, and a Hill–Sachs lesion was observed. This time, a revision arthroscopic Bankart repair and Remplissage procedure were done on him with four double-loaded soft tissue anchors. Pitchers often develop more external rotation in their throwing arm because of a repetitive stretch of the anterior shoulder capsule and ligaments during pitching. The decrease in external rotation after surgery may limit the pitching speed of the pitcher, making a return to play (RTP) more difficult. There is still a paucity of best evidence to revise a failed arthroscopic Bankart repair in the dominant arm of a pitcher. Arthroscopic Bankart repair and Remplissage procedure have gained increasing popularity because they can provide a stable shoulder without harvesting the coracoid. The Latarjet procedure provides a high RTP rate; however, we did not perform it in the revision surgery and decided to revise the Bankart lesion again on its own with a Remplissage procedure, even with his ISIS score being 6 before the revision surgery. A salvage Latarjet procedure is left as a bailout procedure.
Connectedness of the set of central Lyapunov exponents

In this brief note we prove that there is a residual subset $\mathcal{R}$ of $\textrm{Diff}^1(M)$ such that for any $f\in\mathcal{R}$ and any partially hyperbolic homoclinic class $H(p,f)$ with one dimensional center direction, the set of central Lyapunov exponents associated to the ergodic with full support is an interval. Also, some remarks on the general case presented.
Recent Developments and Limitations in Recommender Systems: A Review

Recommender systems are an indispensable and inseparable part of everyday online content offerings like music, movies, sports, and e-commerce. They help users by personalizing products, services, and content, cutting the time and effort required to browse through large amounts of online information. Despite the evolution of recommender systems, the extent to which they can be explored and extended is yet to be discovered. This paper conducts an extensive review of recent developments in recommender systems and presents a comprehensive analysis, highlighting their approaches and limitations. Based on the findings of the analysis, recommendations are provided on possible research avenues that look promising to investigate further. The primary objective of this study is to provide an entry point for researchers who intend to address the current limitations of recommender systems and develop new strategies. Based on the recent breakthroughs in recommender systems detailed in this study, it is possible to find various prospective research avenues, not limited to novel recommender systems but also new evaluation mechanisms and security measures.
Integrin Conformational Dynamics and Mechanotransduction

The function of the integrin family of receptors as central mediators of cell-extracellular matrix (ECM) and cell–cell adhesion requires a remarkable convergence of interactions and influences. Integrins must be anchored to the cytoskeleton and bound to extracellular ligands in order to provide firm adhesion, with force transmission across this linkage conferring tissue integrity. Integrin affinity to ligands is highly regulated by cell signaling pathways, altering affinity constants by 1000-fold or more, via a series of long-range conformational transitions. In this review, we first summarize basic, well-known features of integrin conformational states and then focus on new information concerning the impact of mechanical forces on these states and interstate transitions. We also discuss how these effects may impact mechansensitive cell functions and identify unanswered questions for future studies.
k-Dismantlability in Graphs

Given a finite undirected graph $X$, a vertex is $0$-dismantlable if its open neighborhood is a cone and $X$ is $0$-dismantlable if it is reducible to a single vertex by successive deletions of $0$-dismantlable vertices. By an iterative process, a vertex is $(k+1)$-dismantlable if its open neighborhood is $k$-dismantlable and a graph is $k$-dismantlable if it is reducible to a single vertex by successive deletions of $k$-dismantlable vertices. Within the class of graphs whose clique complex is collapsible, the family of $k$-dismantlable graphs form a strict hierarchy in the sub-class of graphs whose clique complex is non-evasive. We introduce special graphs to study higher $k$-dismantlabilities. We point out how $k$-dismantlability is related to the derivability of graphs defined by Mazurkievicz and we get a new characterization of the class of closed graphs that he defined. By generalizing the notion of vertex transitivity, we replace $k$-dismantlability in its link with the evasiveness conjecture.
Trace operator on von Koch’s snowflake

We study properties of the boundary trace operator on the Sobolev space W 11 (Ω) . Using density result by Koskela, Zhang [8] we define a surjective operator Tr : W 11 (Ω K ) → X (Ω K ) , where Ω K is a von Koch snowflake and X (Ω K ) is a trace space with the quotient norm. Main result of this paper is the existence of a right inverse to Tr , i
Towards the Full Extensibility of Multipath TCP with eMPTCP

MPTCP provides the basic multipath support for network applications to deliver high throughput and robust communication. However, the original MPTCP is designed with limited extensibility. Various research works have tried to extend MPTCP to attain better performance or richer functionalities. These existing approaches either modify the kernel implementation of MPTCP, which involve considerable engineering efforts and may accidentally introduce security issues, or control MPTCP via user-space tools, which suffer from restricted functionality support. To address this issue, we propose eMPTCP, an easy-to-use framework to fully extend MPTCP without security risks. Internally, eMPTCP has a modular and pluggable model which allows operators to specify a comprehensive MPTCP extension as a chain of sub-policies. eMPTCP further enforces the policies through packet header manipulations. To ensure safety, eMPTCP is implemented using eBPF. Despite the stringent constraints of eBPF, we show that it is possible to implement an elaborated framework for a fully extensible MPTCP. Through verifying MPTCP in a number of real-world cases and extensive experiments, we show that eMPTCP is able to support a wide range of MPTCP extensions, while the overhead of eMPTCP operations in the kernel is in the scale of nanosecond, and the extra processing time accounts for only about 0.63% of flows' transmission time.
Kontsevich’s Swiss cheese conjecture

We prove a conjecture of Kontsevich which states that if $A$ is an $E_{d-1}$ algebra then the Hochschild cohomology object of $A$ is the universal $E_d$ algebra acting on $A$. The notion of an $E_d$ algebra acting on an $E_{d-1}$ algebra was defined by Kontsevich using the swiss cheese operad of Voronov. The degree 0 and 1 pieces of the swiss cheese operad can be used to build a cofibrant model for $A$ as an $E_{d-1}-A$ module. The theorem amounts to the fact that the swiss cheese operad is generated up to homotopy by its degree 0 and 1 pieces.
Bioinspired Flapping Foil With Trailing Edge Flap For Remotely Operated Vehicles (ROVs)

Highly efficient propulsive mechanisms of aquatic swimming creatures could serve as inspiration for developing new propulsion methods where it exceeds the performance of present-day thrusters and propellers for ASVs, AUVs, and ROVs. The advantages of eco-friendly propulsion combined with a lesser wake could be advantageous for marine vehicles' stability and maneuvering. As a result, we need to improve our knowledge of fish or dolphin swimming hydrodynamics and their fluid-structure interaction to develop benchmark designs for new propulsion methods. Flapping foil thrusters for propulsion has sparked much interest in recent years. AUVs, ASVs, and ROVs vehicles could greatly benefit from this technology. In dolphin swimming kinematics, the flapping foil thruster is an essential component. This research aims to understand better the hydrodynamics and fluid-structure interaction of flapping foils subjected to heaving and pitching motions. In the present study, the bio-inspired flapping foil thrusters fitted with trailing edge flaps are studied experimentally using flow visualization techniques such as 2D particle image velocimetry (PIV). The time average vorticity contours and instantaneous velocity contours are presented in this study. The flapping foils with trailing edge flaps are immersed in a free stream of uniform flow speed varying from 5 to 10 cm/s. The operating Reynold number (Re) range is 500 to 4300. The Strouhal number range is 0.2 to 0.3. This study also investigated the effect of flapping foil without trailing edge flaps using 2D numerical simulations. By simulating the wake structure and its evolution, the present study aims to understand the vortex shedding mechanisms of flapping foil with or without trailing edge flaps, determining thrust and propulsive efficiency. The vortex shedding mechanisms for both the foils are presented and discussed in detail.
HILBERT TRANSFORMS ALONG LIPSCHITZ DIRECTION FIELDS: A LACUNARY MODEL

We prove bounds for the truncated directional Hilbert transform in $L^{p}(\mathbb{R}^{2})$ for any $1<p<\infty$ under a combination of a Lipschitz assumption and a lacunarity assumption. It is known that a lacunarity assumption alone is not sufficient to yield boundedness for $p=2$ , and it is a major question in the field whether a Lipschitz assumption alone suffices, at least for some $p$ .
Combined Rolling Resistance and Road Grade Estimation Based on EV Powertrain Data

Energy consumption prediction is increasingly important for eco-driving, energy management, and charging scheduling of electric vehicles. Detailed knowledge of the rolling resistance and road grade, combined here in a road-resistance profile, improves the accuracy of these predictions. This paper presents a recursive method to identify the position-dependent road-resistance coefficient using GPS position, powertrain power, and vehicle speed. The calculations make explicit assumptions regarding the spatial continuity of both road gradient and rolling resistance by defining road segments. A recursive least-squares method with Gaussian basis functions allows the estimates to be updated whenever a route segment is traversed anew. The method is tested on data gathered by a 12 m battery electric bus. The resulting road-resistance profile shows a strong resemblance to the road slope and captures changes in rolling resistance well, including a dependency on ambient temperature, which is in accordance with literature on tire rolling resistance. Including the resistance profile in a vehicle model reduces the error of the predicted powertrain power by 1.7 percent point compared to a conventional method, without the limitation of requiring a high-resolution digital elevation model.
On definably proper maps

In this paper we work in o-minimal structures with definable Skolem functions and show that a continuous definable map between Hausdorff locally definably compact definable spaces is definably proper if and only if it is proper morphism in the category of definable spaces. We give several other characterizations of definably proper including one involving the existence of limits of definable types. We also prove the basic properties of definably proper maps and the invariance of definably proper in elementary extensions and o-minimal expansions.
Prandtl-Meyer Reflection Configurations, Transonic Shocks, and Free Boundary Problems

We are concerned with the Prandtl-Meyer reflection configurations of unsteady global solutions for supersonic flow impinging upon a symmetric solid wedge. Prandtl (1936) first employed the shock polar analysis to show that there are two possible steady configurations: the steady weak/strong shock solutions, when a steady supersonic flow impinges upon the wedge whose angle is less than the detachment angle, and then conjectured that the steady weak shock solution is physically admissible. The fundamental issue of whether one or both of the steady wea/strong shocks are physically admissible has been vigorously debated over the past eight decades. On the other hand, the Prandtl-Meyer reflection configurations are core configurations in the structure of global entropy solutions of the 2-D Riemann problem, while the Riemann solutions themselves are local building blocks and determine local structures, global attractors, and large-time asymptotic states of general entropy solutions. In this sense, we have to understand the reflection configurations in order to understand fully the global entropy solutions of 2-D hyperbolic systems of conservation laws, including the admissibility issue for the entropy solutions. In this monograph, we address this longstanding open issue and present our analysis to establish the stability theorem for the steady weak shock solutions as the long-time asymptotics of the Prandtl-Meyer reflection configurations for unsteady potential flow for all the physical parameters up to the detachment angle. To achieve these, we first reformulate the problem as a free boundary problem involving transonic shocks and then obtain appropriate monotonicity properties and uniform a priori estimates for admissible solutions, which allow us to employ the Leray-Schauder degree argument to complete the theory for all the physical parameters up to the detachment angle.
Computation Offloading Based on Improved Sparrow Search Algorithm in Edge Computing Scenario

With the network changes brought by 5G, Mobile Edge Computing (MEC) has been deeply concerned as a prospective computing pattern. In MEC network, offloading the tasks to edge servers can address the problems of 5G mobile users' delay sensitivity and insufficient energy. To further decrease the delay and energy consumption, the offloaded task data can be reduced by compressing part of the task data before computing offloading. This paper investigates the problem of collectively optimizing computation offloading, data compression, and resource distribution aiming at minimizing the total system cost with limited MEC computational capacity. To solve the problem, an improved sparrow search algorithm (ISSA) is developed, which integrates circle chaotic mapping strategy, dynamic step factor strategy and Levy flight strategy, and lots of experiments verified the excellent performance of ISSA-based offloading scheme. Experimental results show the developed offloading scheme outperforms the sparrow search algorithm (SSA) based offloading scheme and particle swarm optimization (PSO) based offloading scheme in reducing the total system cost.
A spectral strong approximation theorem for measure-preserving actions

Let $\unicode[STIX]{x1D6E4}$ be a finitely generated group acting by probability measure-preserving maps on the standard Borel space $(X,\unicode[STIX]{x1D707})$. We show that if $H\leq \unicode[STIX]{x1D6E4}$ is a subgroup with relative spectral radius greater than the global spectral radius of the action, then $H$ acts with finitely many ergodic components and spectral gap on $(X,\unicode[STIX]{x1D707})$. This answers a question of Shalom who proved this for normal subgroups.
Bures distance as a measure of entanglement for symmetric two-mode Gaussian states

We evaluate a Gaussian entanglement measure for a symmetric two-mode Gaussian state of the quantum electromagnetic field in terms of its Bures distance to the set of all separable Gaussian states. The required minimization procedure was considerably simplified by using the remarkable properties of the Uhlmann fidelity as well as the standard form II of the covariance matrix of a symmetric state. Our result for the Gaussian degree of entanglement measured by the Bures distance depends only on the smallest symplectic eigenvalue of the covariance matrix of the partially transposed density operator. It is thus consistent to the exact expression of the entanglement of formation for symmetric two-mode Gaussian states. This non-trivial agreement is specific to the Bures metric.
Gaussian optimizers and other topics in quantum information

The main topic of this thesis is the proof of two fundamental entropic inequalities for quantum Gaussian channels. Quantum Gaussian channels model the propagation of electromagnetic waves through optical fibers and free space in the quantum regime, and provide the mathematical model to determine the maximum rates achievable by quantum communication devices for communication and quantum key distribution. The first inequality proven in this thesis is the quantum Entropy Power Inequality, which provides a lower bound to the output entropy of the beam-splitter or of the squeezing in terms of the entropies of the two inputs. The second inequality states that Gaussian states minimize the output entropy of the one-mode quantum Gaussian attenuator among all the input states with a given entropy, and was a longstanding conjecture in quantum communication theory. The generalization of this inequality to the multimode attenuator would determine its triple trade-off region and its capacity region for broadcast communication to two receivers. The thesis contains further results in Gaussian quantum information, quantum statistical mechanics and relativistic quantum information. The most important of these results concerns the Eigenstate Thermalization Hypothesis (ETH). The ETH is an assumption in quantum statistical mechanics stating that the eigenstates of the Hamiltonian of a system+bath compound look as thermal states if we can access only the system. We prove that the ETH must hold if the system thermalizes for any initial product state of the system+bath compound with a well-defined temperature.
Numerical methods for checking the regularity of subdivision schemes

In this paper, motivated by applications in computer graphics and animation, we study the numerical methods for checking $C^k-$regularity of vector multivariate subdivision schemes with dilation 2I. These numerical methods arise from the joint spectral radius and restricted spectral radius approaches, which were shown in Charina (Charina, 2011) to characterize $W^k_p-$regularity of subdivision in terms of the same quantity. Namely, the $(k,p)-$joint spectral radius and the $(k,p)-$restricted spectral radius are equal. We show that the corresponding numerical methods in the univariate scalar and vector cases even yield the same upper estimate for the $(k,\infty)-$joint spectral radius for a certain choice of a matrix norm. The difference between the two approaches becomes apparent in the multivariate case and we confirm that they indeed offer different numerical schemes for estimating the regularity of subdivision. We illustrate our results with several examples.
On the number of points skipped by a transient (1,2) random walk on the line

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the criteria for the finiteness of the number of cutpoingts of the nearest neighbor random walk on the line by Csaki, Folders, Revesz [J Theor Probab (2010) 23: 624-638].
A General Framework for Accelerator Management Based on ISA Extension

Thanks to the promised improvements in performance and energy efficiency, hardware accelerators are taking momentum in many computing contexts, both in terms of variety and relative weight in the silicon area of many chips. Commonly, the way an application interacts with these hardware modules has many accelerator-specific traits and requires ad-hoc drivers that usually rely on potentially expensive system calls to manage accelerator resources and access orchestration. As a consequence, driver-based interfacing is far from uniform and can expose high latency, limiting the set of tasks suitable for acceleration. In this paper, we propose a uniform and low-latency interface based on Instruction Set Architecture (ISA) extension. All the previous studies that proposed extensions, were deeply tailored to address a single accelerator. One of the biggest disadvantages of those methods is their inability to scale. Adding more of these accelerators to one System-on-Chip (SoC) would result in ISA bloat, increasing power consumption and complexifying the decoding phase proportionally. Our proposed framework consists of a six-instruction ISA extension and the corresponding architectural support that implements the interface abstraction and the reservation logic at the hardware level. Our proposal allows controlling a broad class of integrated accelerators directly from the CPU. The proposed framework is ISA-independent, which means that it is applicable to all the existing ISAs. We implement it on the gem5 simulator by extending the RISC-V ISA. We evaluate it by simulating three compute-intensive accelerators and comparing our interfacing with a conventional driver-based one. The benchmarks highlight the performance benefits brought by our framework, with up to 10.38x speed up, as well as the ability to seamlessly support different accelerators with the same interface. The speed up advantage of our technique diminishes as the granularity of the workloads increases and the overhead for driver-based accelerators becomes less important. We also show that the impact of its hardware components on chip area and power consumption is limited.