Miracle-dz/UniFAR-FTUs huggingface dataset:
Psychometric properties of an Arabic Version of the Dark Triad Dirty Dozen Scale

ABSTRACT Objective Few studies have investigated the Dark Triad and its impact on behaviour in Saudi Arabia, mostly due to the lack of validated instruments. The aim of this study was to investigate the psychometric properties of the Dark Triad Dirty Dozen, in the context of Saudi Arabia. Method A sample of 1,329 respondents (59.8% female, mean age = 26.79, SD = 8.47) completed a survey containing the Dark Triad Dirty Dozen (DD), the Corruption Propensity Scale and the Propensity to Morally Disengage scale, as well as a demographics questionnaire. Confirmatory factor analysis, measurement invariance across gender, internal consistency reliability analysis, test–retest reliability analysis, and concurrent and convergent validity analyses were performed to validate the DD. Results The CFA supported a three-factor model with adequate factor loadings ranging between 0.29 and 0.83 and sufficient fit indices. The scale was gender invariant. The internal consistency reliability and test–retest reliability were adequate (0.70–0.86 and 0.58–0.75, respectively). Moderate-to-high Pearson correlations supported the convergent and concurrent validity of the scale. Conclusion The Dark Triad Dirty Dozen is a reliable and valid measure that can be used in Saudi Arabia. Key points What is already known about this topic: (1) In the past two decades, there has been considerable attention in the psychological literature to the Dark Triad personality traits in explaining malicious behaviours. (2) Scales to measure the Dark Triad personality traits in individuals have been developed, among them the Dark Triad Dirty Dozen scale. (3) The Dark Triad Dirty Dozen scale is widely used and has been validated in many countries, but not in Saudi Arabia. What this topic adds: (1) This study presents the results of the first validation of the Dark Triad Dirty Dozen scale in the context of Saudi Arabia. (2) Results of this study confirmed the psychometric properties of the Dark Triad Dirty Dozen scale in Saudi Arabia, joining previous research in other countries. (3) The study results indicate that this scale is a valid and reliable tool for practitioners and researchers to assess the Dark Triad personality traits in Saudis.
Multi-Performance Estimation for Deploying Bank Branches Based on a Multi-Task Attentive Tree-Enhanced Model

Selecting the optimal location for a new bank branch is challenging but worth studying due to its importance to growing a successful business. Bankers have been devoting a lot of effort to this issue. In recent years, the proliferation of multisource data in smart cities has called for more need for data-driven optimal location selection. Previous studies usually focus on mining different features and processing these data through domain expert knowledge. However, they fail to discover potential complicated factors interactions. Besides, most of these studies only use a single indicator to evaluate the candidate locations, which overlooks a lot of information, resulting in an inaccurate evaluation. In this study, we propose MATE, a Multi-task Attentive Tree-Enhanced model, to simultaneously predict multiple performance indicators of a bank branch's location. Our model takes advantage of the tree-based model, which can effectively extract cross features and provide interpretability according to inferred decision rules. In addition, we designed the financial embedding module and attentive interaction blocks, allowing MATE to obtain more complex and diverse features. Finally, extensive experiments on real-world bank datasets demonstrate the effectiveness of our method, which outperforms baseline and state-of-art methods from 17% to 41%.
Circle-actions, quantum cohomology, and the Fukaya category of Fano toric varieties

We define a class of non-compact Fano toric manifolds, called admissible toric manifolds, for which Floer theory and quantum cohomology are defined. The class includes Fano toric negative line bundles, and it allows blow-ups along fixed point sets. We prove closed-string mirror symmetry for this class of manifolds: the Jacobian ring of the superpotential is the symplectic cohomology (not the quantum cohomology). Moreover, SH(M) is obtained from QH(M) by localizing at the toric divisors. We give explicit presentations of SH(M) and QH(M), using ideas of Batyrev, McDuff and Tolman. Assuming that the superpotential is Morse (or a milder semisimplicity assumption), we prove that the wrapped Fukaya category for this class of manifolds satisfies the toric generation criterion, i.e. is split-generated by the natural Lagrangian torus fibres of the moment map with suitable holonomies. In particular, the wrapped category is compactly generated and cohomologically finite. The proof uses a deformation argument, via a generic generation theorem and an argument about continuity of eigenspaces. We also prove that for any closed Fano toric manifold, if the superpotential is Morse (or a milder semisimplicity assumption) then the Fukaya category satisfies the toric generation criterion. The key ingredients are non-vanishing results for the open-closed string map, using tools from the paper by Ritter-Smith (we also prove a conjecture from that paper that any monotone toric negative line bundle contains a non-displaceable monotone Lagrangian torus). We also need to extend the class of Hamiltonians for which the maximum principle holds for symplectic manifolds conical at infinity, thus extending the class of Hamiltonian circle actions for which invertible elements can be constructed in SH(M).
An elementary approach to simplexes in thin subsets of Euclidean space

We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of congruence classes of $k$-dimensional simplexes with vertices in $E$, is positive. This improves the best bounds previously known, decreasing the $\frac{d+k+1}{2}$ threshold obtained in Erdo\u{g}an-Hart-Iosevich (2012) to $\frac{d+k}{2}$ via a different and conceptually simpler method. We also give a simpler proof of the $d-\frac{d-1}{2d}$ threshold for $d$-dimensional simplexes obtained in Greenleaf-Iosevich (2012), Grafakos-Greenleaf-Iosevich-Palsson (2015).
Quantum mechanics of orthogonal polynomials

We present a formulation of quantum mechanics based on orthogonal polynomials. The wavefunction is expanded over a complete set of square integrable basis in configuration space where the expansion coefficients are orthogonal polynomials in the energy. Information about the corresponding physical systems (both structural and dynamical) are derived from the properties of these polynomials. We demonstrate that an advantage of this formulation is that the class of exactly solvable non-relativistic quantum mechanical problems becomes larger than in the conventional formulation (see, for example, Table 1 in the text). PACS: 03.65. Pm, 03.65. Ge, 03.65. Fd, 03.65. Ca
Autonomous Data Collection With Dynamic Goals and Communication Constraints for Marine Vehicles

In marine robotics, data-collection operations often require an autonomous underwater vehicle (AUV) to collaborate with an unmanned surface vehicle (USV). The mission for the AUV is to reach many goal locations, avoid obstacles and unsafe areas, and maintain communication with the USV. The goals, however, are not known a priori, but are dynamically discovered by the USV as it moves along a predefined path. The USV communicates the discovered goals to the AUV along with rewards for reaching each goal to incentivize the AUV to increase the sum of the rewards when obstacles, time, and communication constraints make it impossible to reach all the goals. We develop a framework comprised of an execution module and a multi-layered planner to enable the AUV to avoid collisions, maintain communication with the USV, and increase the sum of the rewards by reaching many of the discovered goals. The execution module enables the AUV to follow the planned motions, invoking the planner when new goals are discovered. To facilitate navigation, the planner constructs a 3D roadmap that captures the connectivity of the environment by sampling and connecting waypoints in the free space. The high-level planning layer is based on informed discrete search to find roadmap paths that satisfy the communication constraints and increase the sum of the goal rewards. The low-level layer uses sampling-based motion planning to expand a tree of feasible motions along these roadmap paths. The layers interact to update the planned motions as new goals are discovered. Experiments using 3D environments and an increasing number of goals demonstrate the efficiency of the approach to solve dynamic multi-goal motion-planning problems with communication constraints.Note to Practitioners—This paper is motivated by the problem of at-sea data collection using unmanned vehicles where inter-vehicle communications constraints must be maintained. This is a challenging problem that has generally required significant human monitoring and intervention due to the communication constraints and planning challenges. In this paper, we leverage recent advances in underwater communications and focus on new problems that arise in the planning space, specifically, how we generate trajectories for an AUV that satisfies communication range constraints while still performing an underlying task. We show that it is possible to plan for an AUV in real-time while considering these constraints. This paper suggests that our approach can support these complex at-sea missions. Future research will focus on field deployments and introducing more uncertainty into the underlying sensor models during planning.
Instance Switching-Based Contrastive Learning for Fine-Grained Airplane Detection

Detecting airplanes from high-resolution remote sensing images has a variety of applications. The characteristics of clear details, rich spatial, and texture information of objects in high-resolution remote sensing images make it possible to identify different types of airplanes from backgrounds. However, airplanes usually exhibit slight interclass discrepancy and unbalanced class distribution, which pose significant challenges to the fine-grained detection of airplanes. In this article, we propose the ISCL, an instance switching-based contrastive learning method for fine-grained airplane detection. Specifically, we introduce a contrastive learning-based module (CLM) to widen the interclass distance while narrowing the intraclass distance by optimizing feature space distribution with the InfoNCE+ loss, which is built on a serial head in a cascaded way. Then, we design a refined instance switching (ReIS) module to alleviate the class imbalance problem. To take full advantage of the CLM and ReIS, we further introduce an optimization strategy, which is an organic combination of the two modules to widen the distances of different airplane categories that are easily confused. In addition, we contribute a fine-grained attribute-assisted dataset, dubbed GF-RarePlanes dataset (GRD), to help the detectors better learn the subtle differences between the airplanes. Extensive experiments on two datasets (i.e., GF and FAIR1M) demonstrate that our proposed method can significantly improve the accuracy of fine-grained airplane detection under both horizontal bounding box (HBB) and oriented bounding box (OBB) scenarios. Dataset and codes will be available at https://lanxin1011. github.io/ISCL/.
INCOMPLETENESS IN THE FINITE DOMAIN

Abstract Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond NP ≠ coNP. These conjectures formally connect computational complexity with the difficulty of proving some sentences, which means that high computational complexity of a problem associated with a sentence implies that the sentence is not provable in a weak theory, or requires a long proof. Another reason for putting forward these conjectures is that some results in proof complexity seem to be special cases of such general statements and we want to formalize and fully understand these statements. Roughly speaking, we are trying to connect syntactic complexity, by which we mean the complexity of sentences and strengths of the theories in which they are provable, with the semantic concept of complexity of the computational problems represented by these sentences. We have introduced the most fundamental conjectures in our earlier works [27, 33–35]. Our aim in this article is to present them in a more systematic way, along with several new conjectures, and prove new connections between them and some other statements studied before.
Atomic polyadic algebras of infinite dimension are completely representable

Abstract . Answering a question posed by Hodkinson, we show that for inﬁniteordinals α, every atomic polyadic algebra of dimension α is completely representable.We infer that certain inﬁnitary extensions of ﬁrst order logic without equality enjoya Vaught’s theorem; atomic theories have atomic models. Our proof uses a neatembedding theorem together with a simple topological argument. 1 Polyadic algebras were introduced by Halmos [12] to provide an algebraicreﬂection of the study of ﬁrst order logic without equality. Later the algebraswere enriched by diagonal elements to permit the discussion of equality. Thatthe notion is indeed an adequate reﬂection of ﬁrst order logic was demonstratedby Halmos’ representation theorem for locally ﬁnite polyadic algebras (withand without equality). Daigneault and Monk proved a strong extension ofHalmos’ theorem, namely that, every polyadic algebra of inﬁnite dimension(without equality) is representable [11]. There are several types of representations in algebraic logic. Ordinary rep-resentations are just isomorphisms from boolean algebras with operators to amore concrete structure (having the same similarity type) whose elements aresets endowed with set-theoretic operations like intersection and complementa-tion. Complete representations, on the other hand, are representations thatpreserve arbitrary conjunctions whenever deﬁned. The notion of complete rep-resentations has turned out to be very interesting for cylindric algebras, whereit is proved in [15] that the class of completely representable algebras is notelementary.The correlation of atomicity to complete representations has caused a lotof confusion in the past. It was mistakenly thought for a long time, amongalgebraic logicians, that atomic representable relation and cylindric algebras
An integrable case of the p + ip pairing Hamiltonian interacting with its environment

We consider a generalization of the p + ip pairing Hamiltonian, with external interaction terms of a particular form. These terms allow for the exchange of particles between the system and its environment. As a result the u ( 1 ) ? > symmetry associated with conservation of particle number, present in the p + ip Hamiltonian, is broken. Nonetheless the generalized model is integrable. We establish integrability using the boundary quantum inverse scattering method, with one of the reflection matrices chosen to be non-diagonal. We also derive the corresponding Bethe ansatz equations, the roots of which parametrize the exact solution for the energy spectrum.
A Compact and Broadband Doherty Power Amplifier Without Post-Matching Network

Post-matching network (PMN) dominates broadband Doherty power amplifier (DPA) design, but at the cost of large footprint. This brief presents a PMN-free, compact and broadband DPA based on dual-mode impedance transformer (IT) which can simultaneously realize a complex-to-real conversion at two frequencies. The conversion ratio of the IT is significantly increased while its fluctuation is reduced after collaborating a short drain bias. The dual-mode ITs are used as the output matching networks in the carrier and peaking paths. An out-of-phase <inline-formula> <tex-math notation="LaTeX">$2^{\mathrm{ nd}}$ </tex-math></inline-formula> harmonic injection path is constructed based on the inherent structure of the IT without additional bridge, resulting in enhanced saturated efficiency and output power at the upper band edge. A prototype circuit operating from 2.1 to 3.1 GHz is fabricated, and measured results show a 7-8.2 dB gain and 42.2-43.3 dBm output power at saturation. The 6-dB OBO and saturated efficiency is 42.3-52% and 60.4-67.7%, respectively. The area of the whole OMNs is only <inline-formula> <tex-math notation="LaTeX">$19\mathbf {\times }$ </tex-math></inline-formula>37 mm2, indicating a significant size reduction, while the DPA’s performance is comparable with the PMN types.
Breakup of SUSY Quantum Mechanics in the Limit-Circle Region of the Reflective Kratzer Oscillator

The paper studies violation of conventional rules of SUSY quantum mechanics for the centrifugal potential V(r) within the limit-circle (LC) range. A special attention is given to transformation properties of the Titchmarsh-Weyl m-function under Darboux deformations of the reflective Kratzer oscillator: centrifugal Kepler-Coulomb (KC) potential plus a Taylor series in r. Since our analysis is based on Fulton's representation of a regular-at-infinity solution [Math. Nachr. 281, 1418 (2008)] as a superposition of two Frobenius solutions at the origin, we refer to the appropriate expressions as the Titchmarsh-Weyl-Fulton (TWF) functions. Explicit transformation relations are derived for partner TWF functions associated with SUSY pairs of centrifugal potentials. It is shown that these relations have a completely different form for Darboux transformations (DTs) keeping the potential within the LC range. As an illustration, we use regular nodeless Frobenius solutions to construct SUSY partners of the radial r- and c-Gauss-reference (GRef) potentials solvable via hypergeometric and confluent hypergeometric functions, respectively. We explicitly demonstrate existence of non-isospectral partners of both radial potentials in the LC region and obtain their discrete energy spectra using the derived closed-form expressions for the TWF functions. The general transformation relations for the TWF function have been verified taking advantage of form-invariance of the radial GRef potentials under double-step DTs with the so-called 'basic' seed solutions (SSs). Similarly we directly ratify that TWF functions for three shape-invariant reflective potentials on the half-line -- hyperbolic Poschl-Teller (h-PT), Eckart/Manning-Rosen (E/MR), and centrifugal KC potentials - do retain their form under basic DTs.
KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH

We bound the error for the normal approximation of the number of triangles in the Erdős–Rényi random graph with respect to the Kolmogorov metric. Our bounds match the best available Wasserstein bounds obtained by Barbour et al. [(1989). A central limit theorem for decomposable random variables with applications to random graphs. Journal of Combinatorial Theory, Series B 47: 125–145], resolving a long-standing open problem. The proofs are based on a new variant of the Stein–Tikhomirov method—a combination of Stein's method and characteristic functions introduced by Tikhomirov [(1976). The rate of convergence in the central limit theorem for weakly dependent variables. Vestnik Leningradskogo Universiteta 158–159, 166].
A point-line incidence identity in finite fields, and applications

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements. We prove an identity for the second moment of its incidence function and deduce a variety of existing results from the literature, not all naturally associated with lines in $\mathbb{F}_q^2$, in a unified and elementary way.
Measurable equidecompositions for group actions with an expansion property

Given an action of a group Gamma on a measure space X, we provide a criterion under which two subsets A and B of X are measurably equidecomposable, i.e. A can be partitioned into finitely many measurable pieces, which can be rearranged using the elements of Gamma to form a partition of B. In particular, we show that every bounded measurable subset of R^n, n > 2, with non-empty interior is measurably equidecomposable to a ball. Similar result holds e.g. for measurable subsets of the unit sphere S^(n-1).
Applied Geospatial Bayesian Modeling in the Big Data Era: Challenges and Solutions

Two important trends in applied statistics are an increased usage of geospatial models and an increased usage of big data. Naturally, there has been overlap as analysts utilize the techniques associated with each. With geospatial methods such as kriging, the computation required becomes intensive quickly, even with datasets that would not be considered huge in other contexts. In this work we describe a solution to the computational problem of estimating Bayesian kriging models with big data, Bootstrap Random Spatial Sampling (BRSS), and first provide an analytical argument that BRSS produces consistent estimates from the Bayesian spatial model. Second, with a medium-sized dataset on fracking in West Virginia, we show that bootstrap sample effects from a full-information Bayesian model are reduced with more bootstrap samples and more observations per sample as in standard bootstrapping. Third, we offer a realistic illustration of the method by analyzing campaign donors in California with a large geocoded dataset. With this solution, scholars will not be constrained in their ability to apply theoretically relevant geospatial Bayesian models when the size of the data produces computational intractability.
Parking Functions, Shi Arrangements, and Mixed Graphs

Abstract The Shi arrangement is the set of all hyperplanes in ℝn of the form xj − xk = 0 or 1 for 1 ≤ j < k ≤ n. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this arrangement is (n + 1)n−1. An unrelated combinatorial concept is that of a parking function, i.e., a sequence (x1, x2, …, xn) of positive integers that, when rearranged from smallest to largest, satisfies xk ≤ k. (There is an illustrative reason for the term parking function.) It turns out that the number of parking functions of length n also equals (n + 1)n−1, a result given by Konheim and Weiss in 1966. A natural problem consists of finding a bijection between the n-dimensional Shi arrangement and the parking functions of length n. Pak and Stanley (1996) and Athanasiadis and Linusson (1999) gave such (quite different) bijections. We will shed new light on the former bijection by taking a scenic route through certain mixed graphs.
On Global-in-time Chaotic Weak Solutions of the Liouville Equation for Hard Spheres

We outline a new method of construction of global-in-time weak solutions of the Liouville equation - and also of the associated BBGKY hierarchy - corresponding to the hard sphere singular Hamiltonian. Our method makes use only of geometric reflection arguments on phase space. As a consequence of our method, in the case of $N=2$ hard spheres, we show for any chaotic initial data, the unique global-in-time weak solution $F$ of the Liouville equation is realised as $F=\mathsf{R}(f\otimes f)$ in the sense of tempered distributions on $T\mathbb{R}^{6}\times (-\infty, \infty)$, where $\mathsf{R}$ is a 'reflection-type' operator on Schwartz space, and $f$ is a global-in-time classical solution of the 1-particle free transport Liouville equation on $T\mathbb{R}^{3}$.
Conformally variational Riemannian invariants

Conformally variational Riemannian invariants (CVIs), such as the scalar curvature, are homogeneous scalar invariants which arise as the gradient of a Riemannian functional. We establish a wide range of stability and rigidity results involving CVIs, generalizing many such results for the scalar curvature.