Miracle-dz/UniFAR-FTUs huggingface dataset:
Compact Homogeneous Locally Conformally Kaehler Manifolds

In this paper we show as main results two structure theorems of a compact homogeneous locally conformally Kaehler (or shortly l.c.K.) manifold, a holomorphic structure theorem asserting that it has a structure of holomorphic principal fiber bundle over a flag manifold with fiber a 1-dimensional complex torus, and a metric structure theorem asserting that it is necessarily of Vaisman type. We also discuss and determine l.c. K. reductive Lie groups and compact locally homogeneous l.c. K. manifolds of reductive Lie groups.
Resolution of the Oberwolfach problem

The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general result, which allows for decompositions into more general types of factors. In particular, this also resolves the Hamilton-Waterloo problem for large $n$.
Higher order temporal finite element methods through mixed formulations

The EHP and the MCAP provide new rigorous weak variational formalism for a broad range of initial boundary value problems in mathematical physics and mechanics. Both approaches utilize the mixed formulation and lead to the development of various space-time finite element methods. In this paper, their potential when adopting temporally higher order approximations is investigated. The classical single-degree-of-freedom dynamical systems are primarily considered to validate and to investigate the performance of the numerical algorithms developed from both formulations. For the undamped system, all the algorithms are found to be symplectic and unconditionally stable with respect to the time step. On the other hand, for the damped system, the approach is shown to be robust and to be accurate with good convergence characteristics.
Geometric ergodicity of the Bouncy Particle Sampler

The Bouncy Particle Sampler (BPS) is a Monte Carlo Markov Chain algorithm to sample from a target density known up to a multiplicative constant. This method is based on a kinetic piecewise deterministic Markov process for which the target measure is invariant. This paper deals with theoretical properties of BPS. First, we establish geometric ergodicity of the associated semi-group under weaker conditions than in [10] both on the target distribution and the velocity probability distribution. This result is based on a new coupling of the process which gives a quantitative minorization condition and yields more insights on the convergence. In addition, we study on a toy model the dependency of the convergence rates on the dimension of the state space. Finally, we apply our results to the analysis of simulated annealing algorithms based on BPS.
Public Knowledge, Attitudes, and Practices Towards Antibiotic Use and Antimicrobial Resistance in the Western Region of Saudi Arabia

Introduction Antimicrobial resistance (AMR) is one of the major concerns for global health. Inappropriate use of antibiotics is speeding up the process of AMR. The aim of this study was to assess the knowledge, attitude, and practices (KAP) of the population of the western region of Saudi Arabia towards antibiotic use and AMR. Methods A cross-sectional study was conducted using an online questionnaire via social media platforms. It consisted of four parts: first, the participant's sociodemographic characteristics. Second, an assessment of the knowledge of antibiotic use and AMR. The third and fourth parts are to evaluate the attitude and practices towards antibiotic use and AMR. Results From a total of 501 participants, 379 (75.6%) were females, and 354 (70.7%) of the participants had a college degree. Regarding the overall knowledge of antibiotics and AMR, 277 (55.29%) of the respondents had poor knowledge. In addition, 443 (88.42%) of the participants also reported having an inadequate attitude. Moreover, inadequate practices related to the use of antibiotics were also reported among 305 (60.89%) of the participants. Factors associated with the level of knowledge are gender, age, educational level, and occupational status. Regarding occupation, being in a medical job was associated with a better knowledge of antibiotics and AMR than other occupations. Conclusion Our study revealed poor overall knowledge, attitudes, and practices toward antibiotics and AMR among participants. Conducting educational health campaigns for the public that aim to promote awareness and enhance good practices, emphasizing the role of health care providers in health education for the public, and enforcing strict regulations to control the non-prescription dispensing of antibiotics will help to combat this issue. However, future research on this topic is required.
CMC hypersurfaces of semi-Riemannian groups

In this paper, we study the geometry of a connected oriented cmc Riemannian hypersurface $M$ of a semi-Riemannian group $G$ of Lie algebra $\mathfrak g$ and index 0 or 1. If $G$ is Riemannian and $M$ is compact and transversal to an element of $\mathfrak g$, we show that it is a lateral class of a closed embedded Lie subgroup of $G$; we also do this if $G$ is Lorentzian, provided $M$ has sufficiently large mean curvature. If $G$ is Riemannian semisimple and $M$ is compact, we prove that $M$ has degenerate Gauss map and minimal relative nullity at least 1. We also extend the above results to the case where $M$ is complete and noncompact. For a Riemannian $G$, we show that a minimal $M$ is either transversal to an element of $\mathfrak g$, hence stable, or has degenerate Gauss map and minimal relative nullity at least 1; for $M$ cmc and transversal to an element of $\mathfrak g$, if we ask the immersion to be proper and have bounded second fundamental form, then $M$ is also a lateral class of a closed embedded Lie subgroup of $G$, provided a certain growing condition on the size of the corresponding Gauss map is satisfied. Finally, for a Lorentzian group $G$, with sectional curvatures bounded from above on Lorentzian planes, we extend a result of Y. Xin, proving that a complete $M$ is totally umbilical, provided it is transversal to a timelike element of $\mathfrak g$, has large enough mean curvature and bounded hyperbolic Gauss map.
Local authority audit in England, playing the field?

This study focuses on the field of public audit as a collibra-tive element of public sector accountability. It reports on the consequences of substantial collibrative intervention in such a field. The intervention studied is the change to local authority audit in England that culminated in the Local Audit and Accountability Act, 2014, and entailed the abolition of the Audit Commission. Drawing on strategic action field theory, and through examination of submissions to the Red-mond Review and other documentary materials, an analysis is developed of the field of public financial audit in its ongoing efforts to re-equilibriate following the intervention. The analysis explores the action taken in pursuit of the restoration of field stability, effective functioning, and legitimacy, and the effects on public accountability. The analysis supports Julia Black’s contention that different accountability regimes are not readily substitutable and exposes some of the risks and difficulties associated with attempts to modify accountability through collibrative intervention.
On the Augmented Zagreb Index

Topological indices play an important role in mathematical chemistry especially in the quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR). Recent research indicates that the augmented Zagreb index (AZI) possess the best correlating ability among several topological indices. The main purpose of the current study is to establish some mathematical properties of this index, or more precisely, to report tight bounds for the AZI of chemical bicyclic and chemical unicyclic graphs. A Nordhaus-Gaddum-type result for the AZI (of connected graph whose complement is connected) is also derived.
Theory of the interaction between electrons and the two-level system in amorphous metals. II. Second-order scaling equations

A general Hamiltonian for the interaction between conduction electrons and the two-level system is considered. Renormalization-group equations of second order are constructed with the use of the multiplicative renormalization-group technique. The mass renormalization is treated in detail to determine the effect of screening by conduction electrons on the energy splitting $E$. The crossover temperature ${T}_{K}=D{({v}^{x}{v}^{z})}^{\frac{1}{2}}{(\frac{{v}^{x}}{4{v}^{z}})}^{\frac{1}{4{v}^{z}}}$ between the weak and strong coupling regions is determined, and it is reduced by 2 orders of magnitude compared to the expression obtained in first-order scaling. The scaled values of the couplings are calculated analytically. In the crossover region the off-diagonal couplings are ${v}^{x}\ensuremath{\sim}{v}^{y}\ensuremath{\sim}\frac{1}{8}$. The crossover temperature can be found in the region of physical interest (${T}_{K}g1$ K) if the initial diagonal coupling ${v}^{z}g0.2$. In this case, the energy splitting calculated is reduced by more than 2 orders of magnitude. That reduction results in a large enhancement in the distribution of the energy splitting at the low-energy side. The position of the lower end of the scaling region is discussed where scaling in terms of temperature is hindered by the energy splitting.
Reachability problems for a wave-wave system with a memory term

We solve the reachability problem for a coupled wave-wave system with an integro-differential term. The control functions act on one side of the boundary. The estimates on the time is given in terms of the parameters of the problem and they are explicitly computed thanks to Ingham type results. Nevertheless some restrictions appear in our main results. The Hilbert Uniqueness Method is briefly recalled. Our findings can be applied to concrete examples in viscoelasticity theory.
A Decentralized Architecture for Trusted Dataset Sharing Using Smart Contracts and Distributed Storage

The data economy is based on data and information sharing and tremendously impacts society as it facilitates innovative collaborations and decision-making strategies. Nonetheless, most dataset-sharing solutions rely on a centralized authority that rules data ownership, availability, and accessibility. Recent works have explored the integration of distributed storage and blockchain to enhance decentralization, data access, and smart contracts for automating the interactions between actors and data. However, current solutions propose a smart contract design limiting the system’s scalability in terms of actors and shared datasets. Furthermore, little is known about the performance of these architectures when using distributed storage instead of centralized storage approaches. This paper proposes a scalable architecture called DeBlock for data sharing in a trusted way among unreliable actors. The architecture integrates a public blockchain that provides a transparent record of datasets and interactions, with a distributed storage for data storage in a completely decentralized way. Furthermore, the architecture provides a smart-contract design for a transparent catalog of datasets, actors, and interactions with efficient search and retrieval capabilities. To assess the system’s feasibility, robustness, and scalability, we implement a prototype using the Ethereum blockchain and leveraging two decentralized storage protocols, Swarm and IPFS. We evaluate the performance of our proposed system in different scenarios (e.g., varying the amount and size of the shared datasets). Our results demonstrate that our proposal outperforms benchmarks in gas consumption, latency, and resource requirements, especially when increasing the number of actors and shared datasets.
Did COVID-19 change the political communication of polarizing leaders? The case of Salvini's campaigning before and after the pandemic

In recent years, political polarization saw a significant rise in many political systems. This revamped a scientific debate sparked decades ago, with different schools of thought debating on dynamics, factors, and causes of polarization itself. By looking at political elites’ polarizing strategy—one of the factors on which various theories seem to converge—this article tackles the question concerning the impact of the COVID-19 pandemic in terms of political communication. More specifically, we look at the case of a highly polarizing leader in Italy—Matteo Salvini, leader of Lega—in two campaigns held in 2020 before and after the first wave of the pandemic. By analyzing his messages on Facebook and Twitter, we build on the literature on the causes of affective polarization to study Salvini's use of partisan identity and divisive issues, also considering other crucial elements, such as the attacks against others, and followers’ engagement. The results highlight some changes between the two phases, but also a strong continuity in the polarizing strategy of Salvini's political communication.
Survival of Cirrus Crystals in Clear Air

Abstract During the summer of 1966 from Bemidji, Minn. , aircraft collections of cirrus crystals were made with a continuous particle replicator. Actual samples show that cirrus crystal trails with a concentrations of 105–106 m−3 can survive a fall of 20,000 ft in clear air with a temperature/dew point spread of 15C. Computations of evaporation rates for falling crystals suggest that it is somewhat surprising that the crystals could have survived under the observed conditions; however, this may have been because input data for the calculations are inadequate.
Black-box Optimization on Multiple Simplex Constrained Blocks

Black-box optimization of objective function of parameters belonging to simplex arises in many inference and predictive models. Das (2016) introduced Greedy Co-ordinate Descent of Varying Step-sizes on Simplex (GCDVSS) which efficiently optimizes any black-box function whose parameters belong to a simplex. In this paper, that method has been modified and extended for the case where the set of parameters may belong to multiple simplex block of different sizes. The main principle of this algorithm is to make jumps of varying step-sizes within each simplexes simultaneously and searching for the best direction for movement. Since this algorithm is designed specially for multiple simplex blocks parameter space, the proportion of movements made within the parameter space during the update step of a iteration is relatively higher for the proposed algorithm. Starting from a single initial guess, unlike genetic algorithm or simulated annealing, requirement of parallelization for this algorithm grows linearly with the dimension of the parameter space which makes it more efficient for higher dimensional optimization problems. Comparative studies with some existing algorithms have been provided based on modified well-known benchmark functions. Upto 7 folds of improvement in computation time has been noted for using the proposed algorithm over Genetic algorithm, yielding significantly better solution in all the cases considered.
On the mixing time of the Diaconis–Gangolli random walk on contingency tables over $\mathbb{Z}/q\mathbb{Z}$

The Diaconis--Gangolli random walk is an algorithm that generates an almost uniform random graph with prescribed degrees. In this paper, we study the mixing time of the Diaconis--Gangolli random walk restricted on $n\times n$ contingency tables over $\mathbb{Z}/q\mathbb{Z}$. We prove that the random walk exhibits cutoff at $\frac{n^2}{4(1- \cos{\frac{2 \pi}{q}})} \log n, $ when $\log q=o\left (\frac{\sqrt{\log n}}{\log \log n}\right )$.
Analysis of Combination of Four, Five Six Crease Vertices Waterbomb

Origami combination is reliable because of great stabilization and controllable deployable. Potential and extensive applied in medical field, as a soft robot gripper. To investigate a possible stabilization structure, this design contained a combination of three four-crease vertexes, one five-crease vertex and one six-crease vertex. The design theory is based on waterbomb pattern design and obey the two design principles. The degree of freedom in this combination would be proof is zero, which demonstrates an over-constrained structure, and also the poor control performance and reliability. The reason might be the compelling in five-crease vertex and multiple Dof in the four-crease vertexes (which might be one Dof), which cause the overall outputs dihedral angles could not be controlled by overall inputs. Additionally, this design has faster equilibrium state because of smaller dihedral angle (smaller than 90 degrees) in each vertex, as an overstrained structure. The future improvement might be done by reduce the Dof in the four-crease vertex and promotion in five-crease vertex.
Curvature loss formula for optical fibers

The loss formula for optical fibers with constant radius of curvature of their axes is derived by expressing the field outside of the fiber in terms of a superposition of cylindrical outgoing waves. The expansion coefficients are determined by matching the superposition field to the field of the fiber along a cylindrical surface that is tangential to the outer perimeter of the curved fiber. This method is a direct extension of my derivation of the curvature-loss formula for slab guides.
New Concept of a Surgical Hospitalist: Early Experience of Managing the Admission, Critical Care, Trauma Surgery Team

The demand for hospitalists is increasing due to decreasing numbers of clinical residents and increased concerns regarding patient safety. However, several limitations in the surgical hospitalist role exist. The personnel of the surgical hospitalist, rapid response team (RRT), surgical critical care, and trauma surgery teams were unified under the admission, critical care, and trauma surgery (ACTs) team at this institution. The ACTs target are patients with severe disease not undergoing general postoperative course, or patients with the potential for severe conversion. Two surgical intensivists are on duty once a week and oversee the intensive care unit (ICU), the back-up treatment of critically ill patients, and the immediate treatment of trauma patients. ACTs also participate in the surgical RRT and select patients with a high probability of severe exacerbation. Between 2019-2021, the cardiopulmonary resuscitation incidence per 1,000 hospitalized patients in the surgical department decreased significantly from 0.81 to 0.55. From March to December 2021, the ACTs team were involved with 101 of 158 surgical patients admitted to the ICU: 62 with postoperative status, 29 with severe trauma, and 10 transferred to the ICU via RRT screening. Based on our experience, the role of the ACTs team can help improve patient safety.
Modified Levenberg–Marquardt Inversion for High-Resolution Resistivity Distribution Reconstruction of Multilayered Formation

In this article, a modified Levenberg–Marquardt inversion method is proposed for high-resolution reconstruction of resistivity distribution in multilayered formation. In forward modeling, the finite-element method (FEM) is used to obtain Jacobian matrix. In inversion process, several strategies are proposed to improve inversion performance. First, the logging data are interpolated to refine the layered formation model and improve the spatial resolution in resistivity inversion. Second, the scale of the Jacobian matrix is adjusted dynamically within a sliding window according to the sensitivity distribution obtained from the logging data to reduce the computational complexity. Third, the constrained optimization approach is applied to ensure the stability and accuracy of resistivity distribution inversion. Numerical simulation and in-field experiments were carried out to validate the performance of the proposed method. In the experiments, the proposed method was applied to the real logging data obtained in an oil field, and the accuracy of the inversion is verified using a forward modeling-based evaluation method. Results show that the proposed method has a better boundary discrimination ability and can provide a higher spatial resolution and more precise resistivity distribution of multilayered formations than the traditional apparent resistivity method.
Computational Complexity of Motion and Stability of Polygons

The ability to model physical objects and procedures accurately enough to predict their behavior without performing physical experimentation is a fundamental goal of robotics. This facility is prerequisite to offline modeling of assembly tasks, high level robotics languages, and automated assembly planning. This thesis defines and gives algorithms for two classes of physical modeling problems: Mobility problems and Stability problems. The Mobility problem for polygons is that of determining whether, in a configuration of non-intersecting polygons, one or more polygons can be moved (relative to some other polygon in the configuration) without causing intersection. Mobility is shown to be NP-hard. An upper bound for the mobility problem remains an open problem. Translational mobility is the problem of determining whether any polygons can be simultaneously moved by translations without causing intersection. Translational mobility is shown to be NP-complete. Infinitesimal mobility is the problem of determining whether there is a set of velocities for the polygons of the configuration such that no point of a polygon $P_{i}$ that is in contact with another polygon $P_{j}$ has a velocity directed towards the interior of $P_{j}$. Infinitesimal mobility can be viewed as an approximation to the mobility problem in that any configuration that is mobile is also infinitesimally mobile. Infinitesimal mobility is shown to be NP-complete. The Stability problem for polygons with mass is the problem of determining whether a configuration of polygons is at a static equilibrium point. The stability problem is considered for configurations of polygons with and without friction, and is shown to be NP-hard for both cases. An algorithm is given that distinguishes between configurations that are stable, unstable, and indeterminate. The ability to distinguish indeterminate configurations is important because indeterminate configurations arise when the model of an assembly is not accurate enough to determine whether the assembly is stable. Finally, a restricted class of configurations is developed, the determined configurations, for which a conservative stability problem can be solved in polynomial time. The determined configurations are a natural class in the sense that they preclude a type of contact that ``seems unpredictable''''. If undetermined points are desired or unavoidable, the restricted stability problem can be solved in time exponential in the number of undetermined points in the configuration.