Miracle-dz/UniFAR-FTUs huggingface dataset:
On products of Gaussian random variables

Sums of independent random variables form the basis of many fundamental theorems in probability theory and statistics, and therefore, are well understood. The related problem of characterizing products of independent random variables seems to be much more challenging. In this work, we investigate such products of normal random variables, products of their absolute values, and products of their squares. We compute power-log series expansions of their cumulative distribution function (CDF) based on the theory of Fox H-functions. Numerically we show that for small arguments the CDFs are well approximated by the lowest orders of this expansion. For the two non-negative random variables, we also compute the moment generating functions in terms of Meijer G-functions, and consequently, obtain a Chernoff bound for sums of such random variables.
Blockchain-Based Software Effort Estimation: An Empirical Study

Context: The success or failure of any software development project significantly depends on the accuracy of its effort estimates. Software development effort estimation is the foundation for project bidding, budgeting, planning, and cost control. Problem: The literature shows that a lot of work has been done on software effort estimation. But still, there is a need for improvement in effort estimation by introducing new methodologies. The structured group-based and analogy-based effort estimations are the widely used estimation methods. Nevertheless, there are several shortcomings of using these methods such as lack of experts, lack of historical data, and biasness in expert opinion, which negatively affect the estimation results. Motivation: With the advancement of technologies, such limitations could be overcome. Such as leveraging the applicability of blockchain in several domains such as improvement in the software development process and network security. Method: In this article, we have proposed a Blockchain-Based Software Effort Estimation (BBSEE) methodology to improve the software effort estimation. We employ the proposed method using Web and blockchain technologies. Moreover, we also proposed evaluation criteria to assess the efficacy of the proposed method in terms of Mean Magnitude of Relative Error (MMRE), Mean Absolute Error (MAE) and percentage of successful predictions falling (PRED (25)). Result: We performed several case studies and analyses of expert opinions of 52 organizations to present the efficacy of the proposed method. Conclusion: We observe that the BBSEE method outperforms expert judgment and analogy-based effort estimation methodologies in terms of software effort estimation.
Experiment-Based Determination of the Optimized Current Level to Achieve Multiple Constant Current Charging for Lithium-Ion Batteries

This study experimentally tested a multistage constant-current (CC) charging method for lithium-ion batteries controlled by the state-of-charge (SoC) discretization. The Taguchi method was used in the experiments to take three different charge performance objectives, including the charge time, charge efficiency, and average cell surface temperature rise into consideration at the same time to determine the most preferable one. Under the triple-objective optimization, with an equal discretized SoC strategy, the three-stage CC (3SCC) protocol was found to yield much shorter charge time than the four- and five-stage CC protocols, while no significant differences were found in the charge efficiency and average cell surface temperature rise when the three CC protocols with different stages were employed. Thus, an additional performance objective, the energy loss, was used in a further investigation on the 3SCC protocol. In this investigation, a quad-objective problem was formed to determine whether the 3SCC protocol with unequally discretized SoC intervals in each stage would produce better outcomes than the protocol with equally discretized SoC intervals or vice versa. The results indicate that the 3SCC with the unequal SoC discretization strategy reduces the energy loss by 1.82%, decreases the charge time by 4.27%, increases the charge efficiency by 0.32%, and lowers the average cell surface temperature rise by 12.5%, compared to the results yielded with the equal SoC discretization in each stage.
Number of irreducible mod l rank 2 sheaves on curves over finite fields

Let X be a smooth projective curve of genus g over a finite field F_q of characteristic p. Consider primes l different from p. We formulate some questions related to a well known counting formula of Drinfeld. Drinfeld counts rank 2, irreducible l-adic sheaves on the base change X_n of X to F_{q^n} as n varies. We would like to count rank 2, irreducible mod l sheaves on X_n as n varies. Drinfeld's l-adic count gives an upper bound for the mod l count. We conjecture that Drinfeld's count is the correct asymptotic for the count of rank 2, irreducible mod l sheaves on X_n as n varies with (n,\ell)=1.
Proximal Planar Shape Signatures. Homology Nerves and Descriptive Proximity

This article introduces planar shape signatures derived from homology nerves, which are intersecting 1-cycles in a collection of homology groups endowed with a proximal relator (set of nearness relations) that includes a descriptive proximity. A 1-cycle is a closed, connected path with a zero boundary in a simplicial complex covering a finite, bounded planar shape. The signature of a shape sh A (denoted by sig(sh A)) is a feature vector that describes sh A. A signature sig(sh A) is derived from the geometry, homology nerves, Betti number, and descriptive CW topology on the shape sh A. Several main results are given, namely, (a) every finite, bounded planar shape has a signature derived from the homology group on the shape, (b) a homology group equipped with a proximal relator defines a descriptive Leader uniform topology and (c) a description of a homology nerve and union of the descriptions of the 1-cycles in the nerve have same homotopy type.
Algebraic Cycles and Residues of Degree 8 L-functions of GSp(4) × GL(2)

We prove a cohomological formula for noncritical residues of degree 8 automorphic $L$-functions of $\mathrm{GSp}(4) \times \mathrm{GL}(2)$ in the spirit of Beilinson conjecture. We rely on the cohomological interpretation of an automorphic period integral and on the study of Novodvorsky’s integral representation of the $L$-functions.
A Coupling Approach for Linear Elasticity Problems with Spatially Noncoincident Interfaces

We present a new formulation based on the classical Dirichlet-Neumann formulation for interface coupling problems in linearized elasticity. By using Taylor series expansions, we derive a new set of interface conditions that allow our formulation to pass the linear consistency test. In addition, we propose an iterative method to determine the solution of our formulation. We demonstrate in our numerical results that we may achieve the desired piecewise linear finite element error bounds for both nonoverlapping domain decomposition problems as well as for interface coupling problems where the Lam\'e parameters of the structures differ.
It Is Better for Younger Workers: The Gain Cycle between Job Crafting and Work Engagement

Job Crafting has been proposed as a new perspective, consisting in a bottom-up strategy to achieve person–job fit by emphasizing employees’ active participation and spontaneous change in job design, which is specifically adequate for older workers. Despite this fact, the cyclical influence between Work Engagement and Job Crafting over time has been less researched. We postulated that a gain cycle could be observed in the relationships between Job Crafting and its outcomes. Hence, we tested a longitudinal moderated mediation model in which Work Engagement increases over time through an increment in Job Crafting behaviors (Hypothesis 1), while this process is moderated by workers’ age (Hypothesis 2). The present study follows a three-wave design where participants (N = 126) responded to online surveys at three measurement waves, three months apart. At Time 1 and Time 3, we assessed Work Engagement, Job Crafting behavior, and demographic variables, while at Time 2 we only assessed Job Crafting. Our findings partially differ from what was expected. The findings supported that the relationship between Work Engagement at Time 1 and changes in Job Crafting behavior across time was negative and non-significant, failing to provide support for Hypothesis 1. Related to Hypothesis 2, our results are mixed. Although the interaction between changes in Job Crafting and workers’ age did not demonstrate a statistical influence on Work Engagement at Time 3, our findings suggested that the direct influence was complemented by a negative indirect effect through the longitudinal increase of Job Crafting, which mainly affects aged workers. Practical and theoretical implications are discussed.
Linearized fields for causal variational principles: existence theory and causal structure

The existence theory for solutions of the linearized field equations for causal variational principles is developed. We begin by studying the Cauchy problem locally in lens-shaped regions, defined as subsets of space-time which admit foliations by surface layers satisfying hyperbolicity conditions. We prove existence of weak solutions and show uniqueness up to vectors in the orthogonal complement of the jets used for testing. The connection between weak and strong solutions is analyzed. Global solutions are constructed by exhausting space-time by lens-shaped regions. We construct advanced and retarded Green's operators and study their properties.
Geometric algebra and M-theory compactifications

We show how supersymmetry conditions for flux compactifications of supergravity and string theory can be described in terms of a flat subalgebra of the Kahler-Atiyah algebra of the compactification space, a description which has wide-ranging applications. As a motivating example, we consider the most general M-theory compactifications on eight-manifolds down to AdS3 spaces which preserve N=2 supersymmetry in 3 dimensions. We also give a brief sketch of the lift of such equations to the cone over the compactification space and of the geometric algebra approach to `constrained generalized Killing pinors', which forms the technical and conceptual core of our investigation.
Evaluation of Online Machine Learning Algorithms for Electricity Theft Detection in Smart Grids

—Electricity theft-induced power loss is a pressing issue in both traditional and smart grid environments. In smart grids, smart meters can be used to track power consumption behaviour and detect any suspicious activity. However, smart meter readings can be compromised by deploying intrusion tactics or launching cyber attacks. In this regard, machine learning models can be used to assess the daily consumption patterns of customers and detect potential electricity theft incidents. Whilst existing research efforts have extensively focused on batch learning algorithms, this paper investigates the use of online machine learning algorithms for electricity theft detection in smart grid environments, based on a recently proposed dataset. Several algorithms including Naive Bayes, K-nearest Neighbours, K-nearest Neighbours with self-adjusting memory, Hoeffding Tree, Extremely Fast Decision Tree, Adaptive Random Forest and Leveraging Bagging are considered. These algorithms are evaluated using an online machine learning platform considering both binary and multi-class theft detection scenarios. Evaluation metrics include prediction accuracy, precision, recall, F-1 score and kappa statistic. Evaluation results demonstrate the ability of the Leveraging Bagging algorithm with an Adaptive Random Forest base classifier to surpass all other algorithms in terms of all the considered metrics, for both binary and multi-class theft detection. Hence, it can be considered as a viable option for electricity theft detection in smart grid environments.
On the growth of Mordell–Weil ranks in $p$-adic Lie extensions

Let $p$ be an odd prime and $F_{\infty}$ a $p$-adic Lie extension of a number field $F$. Let $A$ be an abelian variety over $F$ which has ordinary reduction at every primes above $p$. Under various assumptions, we establish asymptotic upper bounds for the growth of Mordell-Weil rank of the abelian variety of $A$ in the said $p$-adic Lie extension. Our upper bound can be expressed in terms of invariants coming from the cyclotomic level. Motivated by this formula, we make a conjecture on an asymptotic upper bound of the growth of Mordell-Weil ranks over a $p$-adic Lie extension which is in terms of the Mordell-Weil rank of the abelian variety over the cyclotomic $\mathbb{Z}_p$-extension. Finally, it is then natural to ask whether there is such a conjectural upper bound when the abelian variety has non-ordinary reduction. For this, we can at least modestly formulate an analogue conjectural upper bound for the growth of Mordell-Weil ranks of an elliptic curve with good supersingular reduction at the prime $p$ over a $\mathbb{Z}_p^2$-extension of an imaginary quadratic field.
Distributions and integration in superspace

Distributions in superspace constitute a very useful tool for establishing an integration theory. In particular, distributions have been used to obtain a suitable extension of the Cauchy formula to superspace and to define integration over the superball and the supersphere through the Heaviside and Dirac distributions, respectively. In this paper, we extend the distributional approach to integration over more general domains and surfaces in superspace. The notions of domain and surface in superspace are defined by smooth bosonic phase functions $g$. This allows to define domain integrals and oriented (as well as non-oriented) surface integrals in terms of the Heaviside and Dirac distributions of the superfunction $g$. It will be shown that the presented definition for the integrals does not depend on the choice of the phase function $g$ defining the corresponding domain or surface. In addition, some examples of integration over a super-paraboloid and a super-hyperboloid will be presented. Finally, a new distributional Cauchy-Pompeiu formula will be obtained, which generalizes and unifies the previously known approaches.
Characterizing the Absolute Continuity of the Convolution of Orbital Measures in a Classical Lie Algebra

Abstract Let $\mathfrak{g}$ be a compact simple Lie algebra of dimension $d$ . It is a classical result that the convolution of any $d$ non-trivial, $G$ -invariant, orbital measures is absolutely continuous with respect to Lebesgue measure on $\mathfrak{g}$ , and the sum of any $d$ non-trivial orbits has non-empty interior. The number $d$ was later reduced to the rank of the Lie algebra (or rank +1 in the case of type ${{A}_{n}}$ ). More recently, the minimal integer $k\,=\,k\left( X \right)$ such that the $k$ -fold convolution of the orbital measure supported on the orbit generated by $X$ is an absolutely continuous measure was calculated for each $X\,\in \,\mathfrak{g}$ . In this paper $\mathfrak{g}$ is any of the classical, compact, simple Lie algebras. We characterize the tuples $\left( {{X}_{1}},\,.\,.\,.\,,\,{{X}_{L}} \right)$ , with ${{X}_{i}}\,\in \,\mathfrak{g}$ , which have the property that the convolution of the $L$ -orbital measures supported on the orbits generated by the ${{X}_{i}}$ is absolutely continuous, and, equivalently, the sum of their orbits has non-empty interior. The characterization depends on the Lie type of $\mathfrak{g}$ and the structure of the annihilating roots of the ${{X}_{i}}$ . Such a characterization was previously known only for type ${{A}_{n}}$ .
" The Use Of Stem Cells In The Surgical Treatment Of Cleft Palate "

Mesenchymal stem cells, pluripotent and differentiable cells found naturally within bone marrow, adipose tissue, the blood of the umbilical cord, and dental pulp have the capability to transform the field of oral surgery. With the capability to differentiate into different types of tissue, stem cells are currently being studied as an alternative to autologous bone grafting for treatment of cleft palate in young children. The long-standing treatment of autologous bone-grafting, while very effective, has many risks associated with it such as graft rejection, post-operative morbidity, and long recovery time. The harvesting and transplantation of stem cells using bio-compatible scaffolding that will differentiate and form new bone tissue is the future of valvuloplasty protocol in the field of oral surgery. This paper will investigate the way in which this treatment will be performed, the advantages and risks of stem cell therapy, the future applications, as well as the issue of global accessibility to innovative treatment such as this.
Threonine Phosphorylation of an Electrochemical Peptide-Based Sensor to Achieve Improved Uranyl Ion Binding Affinity

We have successfully designed a uranyl ion (U(VI)-specific peptide and used it in the fabrication of an electrochemical sensor. The 12-amino acid peptide sequence, (n) DKDGDGYIpTAAE (c), originates from calmodulin, a Ca(II)-binding protein, and contains a phosphothreonine that enhances the sequence’s affinity for U(VI) over Ca(II). The sensing mechanism of this U(VI) sensor is similar to other electrochemical peptide-based sensors, which relies on the change in the flexibility of the peptide probe upon interacting with the target. The sensor was systematically characterized using alternating current voltammetry (ACV) and cyclic voltammetry. Its limit of detection was 50 nM, which is lower than the United States Environmental Protection Agency maximum contaminant level for uranium. The signal saturation time was ~40 min. In addition, it showed minimal cross-reactivity when tested against nine different metal ions, including Ca(II), Mg(II), Pb(II), Hg(II), Cu(II), Fe(II), Zn(II), Cd(II), and Cr(VI). Its reusability and ability to function in diluted aquifer and drinking water samples were further confirmed and validated. The response of the sensor fabricated with the same peptide sequence but with a nonphosphorylated threonine was also analyzed, substantiating the positive effects of threonine phosphorylation on U(VI) binding. This study places emphasis on strategic utilization of non-standard amino acids in the design of metal ion-chelating peptides, which will further diversify the types of peptide recognition elements available for metal ion sensing applications.
Evaluating Serum RBP4 as an Auxiliary Biomarker for CKDu Diagnosis

Background: A chronic interstitial disease, chronic kidney disease of uncertain etiology (CKDu), has emerged as a notable contributor to the CKD burden in rural Sri Lanka. Most therapeutic and diagnostic approaches to CKD focus on glomerular diseases, and thus are not fully applicable to CKDu. Serum proteins, specifically those with the profile of markers representing different facets of a disease, are beneficial for a comprehensive evaluation of diseases, and hence in CKD. Our aim was to identify the role of serum-retinol-binding protein 4 (RBP4), a marker of the proximal tubule, in the diagnosis of CKDu. Methods: Definite CKDu cases were recruited from the renal clinic in Girandurukotte and Wilgamuwa (endemic regions). Healthy controls were recruited from Mandaramnuwara (nonendemic area). The levels of RBP4 and creatinine in serum were measured. An immunoassay (ELISA) was performed on the serum samples. The stages of CKD/ CKDu were classified according to eGFR. Results: Serum RBP4 was significantly increased in CKDu patients compared to CKD patients and healthy controls. The results show that the ratio of normalized serum RBP4 to serum creatine (S.cr) acts as a better competitive marker for CKDu (AUC 0.762, sensitivity 0.733) than CKD (AUC 0.584, sensitivity 0.733) when compared against healthy controls. Furthermore, the RBP4:S.cr ratio showed higher discriminating power (AUC 0.743) between CKDu and CKD, suggesting that the RBP4: S.cr ratio has potential as a serum marker to differentiate CKDu from CKDu. Conclusion: The RBP4: S.cr ratio was identified as a plausible indicator for differentiating CKDu from CKD with >70% sensitivity and specificity. Therefore, it could be used in the evaluation of the tubular interstitial involvement of CKD.
3-D Tactile-Based Object Recognition for Robot Hands Using Force-Sensitive and Bend Sensor Arrays

Tactile sensing is a particularly important and challenging task for a modern robot to safely manipulate objects, interact with humans in a shared space, and provide various services. This article presents a 3-D tactile glove for robots with the combination of a piezoresistive-based force sensor array (412 sensors) covering the full hand and a resistive bend sensor array (five sensors) on the back of five fingers. Deep learning-based convolutional neural network (CNN) and multilayer perceptron network (MLP) based methods using the designed tactile glove are proposed for object recognition. In the experiment for recognizing 15 objects with a dexterous robot hand, an average classification accuracy of 93.67% has been achieved. Comparison experiments with three other typical classifiers (the Quadratic support vector machine, weighted KNN, and Bagged Trees) and our MLP and CNN methods show an average recognition accuracy of 91.67% with the 3-D tactile glove, revealing an accuracy improvement of 4.17% over only using the force sensor array. We further apply our 3-D tactile glove and the multimodal CNN to identify three other objects and demonstrate their generalization ability of tactile object recognition with an average success accuracy of 78.33%. The proposed 3-D tactile glove can be further used in human–robot interactions, the design of prosthetics and humanoid robots, and for improving the intelligence level in brain–computer collaborative systems.
Analysis of biological integrate-and-fire oscillators

We consider discontinuous dynamics of integrate-and-fire models, which consist of pulse-coupled biological oscillators. A thoroughly constructed map is in the basis of the analysis. Synchronization of non-identical oscillators is investigated. Significant advances for the solution of second Peskin's conjecture have been made. Examples with numerical simulations are given to validate the theoretical results. Perspectives are discussed.
Adjusted 0-1 Knapsack Problem in Cargo Flow by Using Artificial Bee Colony Algorithm

This study describes the problem with the knapsack that occurred in the cargo flow. The problem of the knapsack is the problem of optimisation used to illustrate the problem and the solution in which each set of items has its own specific value and weight. With its total value as much as possible, the number of items that may become less or at least equal to or equal to the limit. Therefore, the aim of this study is to determine the minimum total cost of 30 shipments based on volume by using Artificial Bee Colony (ABC) algorithm in order to achieving the highest profit. ABC algorithm was derived from the bee colony which consists of four phases of initialisation, employed bees, onlooker bees and scout bees. Based on the result obtained, the total cost of the shipment is 402.377 tons per km which starting from the Shipment 25 with 2 560 000 tons per year for 0.111 tons per km and ends with Shipment 21 with 2 250 000 tons per year for 0.129 tons per km.
Noncommutative sedeons and their application in field theory

We present sixteen-component values ”sedeons”, generating associative noncommutative space-time algebra. The generalized second-order and first-order equations of relativistic quantum mechanics based on sedeonic wave function and sedeonic space-time operators are proposed. We also discuss the description of fields with massive quantum on the basis of secondorder and first-order equations for sedeonic potentials.