Miracle-dz/UniFAR-FTUs huggingface dataset:
A Fault Identification Method of Mechanical Element Action Unit Based on CWT-2DCNN

Aiming at the problems of low recognition rate and human intervention in the traditional fault diagnosis of mechanical equipment, a fault identifcation method based on continuous wavelet transform (CWT) and two-dimensional convolutional neural network (2DCNN) is proposed. By collecting the vibration signals of four kinds of fault states and normal states of the worm rotation unit of the CNC machine tool, the data are preprocessed and identifed. Firstly, the vibration signals of each fault state of the element action unit are CWTtransformed into the corresponding two-dimensional time-frequency diagram; then, the 2DCNN fault identifcation model is established, and the time-frequency diagrams of various faults are input to the network as characteristic diagrams for training and testing. Trough the adjustment of network parameters, the network performance is gradually optimized; fnally, the hybrid domain attention module CBAM is added to further improve the network structure, and the recognition efect is compared with the initial 2DCNN. Te results show that the CWT-2DCNN meta-action unit fault recognition model with an attention module can recognize the diferent states of meta-action units more efectively, and the fault recognition efect is better. By using this method, the diferent fault types of mechanical element action units can be accurately identifed, which has a certain application in the feld of mechanical fault identifcation and diagnosis.
Towards Cooperating in Repeated Interactions Without Repeating Structure

Towards Cooperating in Repeated Interactions Without Repeating Structure Huy Pham Department of Computer Science, BYU Master of Science A big challenge in artificial intelligence (AI) is creating autonomous agents that can interact well with other agents over extended periods of time. Most previously developed algorithms have been designed in the context of Repeated Games, environments in which the agents interact in the same scenario repeatedly. However, in most real-world interactions, relationships between people and autonomous agents consist of sequences of distinct encounters with different incentives and payoff structures. Therefore, in this thesis, we consider Interaction Games, which model interactions in which the scenario changes from encounter to encounter, often in ways that are unanticipated by the players. For example, in Interaction Games, the magnitude of payoffs as well as the structure of these payoffs can differ across encounters. Unfortunately, while there have been many algorithms developed for Repeated Games, there are no known algorithms for playing Interaction Games. Thus, we have developed two different algorithms, augmented Fictitious Play (aFP) and augmented S# (Aug-S#), for playing these games. These algorithms are designed to generalize Fictitious Play and S# algorithms, which were previously created for Repeated Games, to the more general kinds of scenarios modeled by Interaction Games. This thesis primarily focuses on the evaluation of these algorithms. We first analyze the behavioral and performance properties of these algorithms when associating with other autonomous algorithms. We then report on the results of a user study in which these algorithms were paired with people in two different Interaction Games. Our results show that while the generalized algorithms demonstrate many of the same properties in Interaction Games as they do in Repeated Games, the complexity of Interaction Games appear to alter the kinds of behaviors that are successful, particularly in environments in which communication between players is not possible.
Effective Removal of Phosphate from Waste Water Based on Silica Nanoparticles

This study explored the potential application of silica nanoparticles (SiNPs) prepared from rice husk ash (RHA) to reuse phosphate from aqueous solution. The physicochemical analysis illustrated that the SiNPs, which were extracted from waste biomass, have a nonuniform shape with a size range of a few nanometer to hundreds of nanometers, a surface area of 15.56 m2·g−1, and an adsorption pore width of 4.06 nm. Those results carried out the possibility to utilize the SiNPs for removal of phosphate. Findings from the batch sorption experiments showed that the phosphate adsorption was controlled by experimental parameters, i.e., pH, adsorbent dosage, concentration of adsorbate, and adsorption time. The experimental results showed that the maximum phosphate adsorption capacity of SiNPs was achieved at around 9.08 mg·g−1 at adsorption conditions, i.e., pH 7, SiNPs dosage of 0.3 g, and adsorption time of 90 min. The phosphate removal based on SiNPs will offer several benefit such as an effective and low cost method, reliable to reuse as an effective slow release phosphate fertilizer.
The Kids Are Alright II: Social Engagement in Young Adulthood as a Function of K-12 Schooling Type, Personality Traits, and Parental Education Level

To examine the issue of socialization, a survey study of 112 18-25 year olds who were homeschooled (n=52), publicly schooled (n=51), or privately schooled (n=9) during K-12 was conducted. Information about extracurricular activities during K-12 and young adulthood was collected, the Big Five Inventory was completed, and information about leadership, political participation, and parents’ levels of education was collected. ANOVAs revealed no difference in extracurricular participation during K-12 due to schooling type, but there were higher levels of volunteer activity and political participation among formerly homeschooled young adults, with large effect sizes. Former homeschoolers were higher in openness, conscientiousness, and agreeableness, and lower in neuroticism. There were no effects of parent’s level of education, and no effect of personality traits on levels of participation in extracurriculars. These findings suggest that formerly homeschooled young adults have been adequately socialized so that they can fit in within their social milieu, and that their personalities may have been positively affected by their family’s homeschool strategy. age period, which includes leadership and political participation, were also analyzed in between subjects ANOVAs, with schooling and sex as independent variables. All non-significant results are at the p >. 05 level.
Dexterous Robotic Cutting Based on Fracture Mechanics and Force Control

—Skills of cutting natural foods are important for robots looking to play a bigger role in kitchen assistance. The basic objective of cutting is to achieve material fracture via smooth movements of a kitchen knife, which in the process performs work to overcome material toughness, acts against blade-material friction, and generates shape deformation. This paper investigates how a robotic arm drives the knife to cut through an object in a sequence of three moves: pressing, touching, and slicing. To cope with evolving contacts with the material and cutting board, position, force, and impedance controls act either separately or jointly, assisted by force sensing and/or based on fracture mechanics, so the knife follows a prescribed trajectory to split the object. Force data acquired during the phase of pressing are used for estimating the object-speciﬁc values of physical parameters related to cutting. These estimated values are promptly used for control purpose to execute the phase of slicing. Experiments over several types of fruits and vegetables have exhibited natural cutting movements resembling those performed by a human hand. Note to Practitioners —Automation of kitchen skills is an important step in the development of home robots, which are expected to relieve us from daily chores and help us care for the elderly and people with disabilities. The motivation of this research is to enable a robotic arm to cut natural foods with knife movements that bear the smoothness and efﬁciency of those executed by a human hand. Existing methods on robotic cutting have focused on force control to ensure material separation but not on execution of natural knife movements. This paper dissects a cutting action into three phases, as inspired from the human hand execution, and realizes them via different control policies. These policies are based on sensing and modeling the forces experienced by the knife through its interactions with the material and the cutting board. Preliminary experimental results have demonstrated cutting of various food items with speed and smoothness. In future research, we will address cutting of deformable objects and explore issues including energy efﬁciency, cutting by the knife held in a robotic hand, and food stabilization and manipulation by a second arm/hand.
THE SPATIAL STRUCTURE OF YOUNG STELLAR CLUSTERS. II. TOTAL YOUNG STELLAR POPULATIONS

We investigate the intrinsic stellar populations (estimated total numbers of OB and pre-main-sequence stars down to 0.1 M ⊙ ? > ) that are present in 17 massive star-forming regions (MSFRs) surveyed by the MYStIX project. The study is based on the catalog of >31,000 MYStIX Probable Complex Members with both disk-bearing and disk-free populations, compensating for extinction, nebulosity, and crowding effects. Correction for observational sensitivities is made using the X-ray luminosity function and the near-infrared initial mass function—a correction that is often not made by infrared surveys of young stars. The resulting maps of the projected structure of the young stellar populations, in units of intrinsic stellar surface density, allow direct comparison between different regions. Several regions have multiple dense clumps, similar in size and density to the Orion Nebula Cluster. The highest projected density of ∼34,000 stars pc−2 is found in the core of the RCW 38 cluster. Histograms of surface density show different ranges of values in different regions, supporting the conclusion of Bressert et al. that no universal surface-density threshold can distinguish between clustered and distributed star formation. However, a large component of the young stellar population of MSFRs resides in dense environments of 200–10,000 stars pc−2 (including within the nearby Orion molecular clouds), and we find that there is no evidence for the B10 conclusion that such dense regions form an extreme “tail” of the distribution. Tables of intrinsic populations for these regions are used in our companion study of young cluster properties and evolution.
Global Currency Hedging with Ambiguity

This paper addresses the problem of optimal currency allocation for a risk-and-ambiguity-averse international investor. A robust mean–variance model with smooth ambiguity preferences is used to derive the optimal currency exposure in closed form. In the theoretical part of the paper, we characterize the sample-efficient currency hedging demand as the solution to a generalized ridge regression. Through the lens of these results, we show that the investor’s dislike for model uncertainty induces stronger currency hedging demand. The empirical analysis demonstrates how ambiguity leads to a larger estimation bias and simultaneously narrows the confidence interval of the sample efficient optimal currency exposure. The out-of-sample backtest illustrates that accounting for ambiguity enhances the stability of optimal currency allocation over time and significantly reduces portfolio volatility net of transaction costs.
Saliency Prediction on Omnidirectional Image With Generative Adversarial Imitation Learning

When watching omnidirectional images (ODIs), subjects can access different viewports by moving their heads. Therefore, it is necessary to predict subjects’ head fixations on ODIs. Inspired by generative adversarial imitation learning (GAIL), this paper proposes a novel approach to predict saliency of head fixations on ODIs, named SalGAIL. First, we establish a dataset for attention on ODIs (AOI). In contrast to traditional datasets, our AOI dataset is large-scale, which contains the head fixations of 30 subjects viewing 600 ODIs. Next, we mine our AOI dataset and discover three findings: (1) the consistency of head fixations are consistent among subjects, and it grows alongside the increased subject number; (2) the head fixations exist with a front center bias (FCB); and (3) the magnitude of head movement is similar across the subjects. According to these findings, our SalGAIL approach applies deep reinforcement learning (DRL) to predict the head fixations of one subject, in which GAIL learns the reward of DRL, rather than the traditional human-designed reward. Then, multi-stream DRL is developed to yield the head fixations of different subjects, and the saliency map of an ODI is generated via convoluting predicted head fixations. Finally, experiments validate the effectiveness of our approach in predicting saliency maps of ODIs, significantly better than 11 state-of-the-art approaches. Our AOI dataset and code of SalGAIL are available online at https://github.com/yanglixiaoshen/SalGAIL.
Compliance Based Penetration Testing as a Service Compliance Based Penetration Testing as a Service

The current penetration testing method practiced in the information systems domain is insufficient to protect information systems. Penetration testing is part of the final acceptance criteria before the system is released into a production environment. Once the system is in production, the environment and configuration are bound to change for various reasons, especially in cloud environments. This change can create vulnerabilities, and hackers take advantage of them. In cloud service models like PaaS, security is a shared responsibility of tenant and provider, and it is challenging to perform penetration testing. This paper introduces a new method called Compliance Based Penetration Testing (CBPT). The CBPT method explicitly targets PaaS environments to identify critical issues in cloud-based environments. As the cloud is the way moving forward, this approach will be beneficial and save effort and cost for all cloud consumers.
A Semiglobal, Practical, Strict Pseudogradient Property for Iterative Methods

We consider a class of iterative numerical methods and introduce the notion of semiglobally, practically, strictly pseudogradient (SPSP) search directions. We demonstrate the relevance of the SPSP property in modelling a variety of optimization algorithms, including those subject to absolute and relative errors. We show that the attractors of iterative methods with SPSP search directions exhibit semiglobal, practical, asymptotic stability. Moreover, the SPSP property is robust in the sense that perturbations of SPSP search directions also have the SPSP property.
Image Co-Addition with Temporally Varying Kernels

Large, multifrequency imaging surveys, such as the Large Synaptic Survey Telescope (LSST), need to do near-real-time analysis of very large data sets. This raises a host of statistical and computational problems for which standard methods do not work. In this article, we study a proposed method for combining stacks of images into a single summary image, sometimes referred to as a template. We evaluate this method by comparing it with using pixelwise medians or means by various criteria. Note that the goal is not to propose these comparison methods for use in their own right, but to ensure that additional complexity also provides substantially improved performance.
Inverse curvature flows in hyperbolic space

We consider inverse curvature flows in $\Hh$ with star-shaped initial hypersurfaces and prove that the flows exist for all time, and that the leaves converge to infinity, become strongly convex exponentially fast and also more and more totally umbilic. After an appropriate rescaling the leaves converge in $C^\infty$ to a sphere.
Direct measurement of plasmon propagation lengths on lithographically defined metallic waveguides on GaAs

We present optical investigations of rectangular surface plasmon polariton (SPP) waveguides (WGs) lithographically defined on GaAs substrates. The plasmon propagation length is directly determined using a confocal microscope, with independent polarization control in both excitation and detection channels. Surface plasmon polaritons are launched along the waveguide using a lithographically defined defect at one end. At the remote end of the waveguide, they scatter into the far-field, where they are imaged using a CCD camera. By monitoring the length dependence of the intensity of scattered light from the waveguide end, we directly extract the propagation length, obtaining values ranging from LSPP = 10 to 40 μm depending on the waveguide width (ωWG = 2–5 μm) and excitation wavelength (760–920 nm). Results are in good accord with theoretical expectations demonstrating the high quality of the lithographically defined structures. The results obtained are of strong relevance for the development of future semico.
Asymptotic local uniformity of the quantization error for Ahlfors-David probability measures

Let $\mu$ be an Ahlfors-David probability measure on $\mathbb{R}^q$, namely, there exist some constants $s_0>0$ and $\epsilon_0,C_1,C_2>0$ such that \[ C_1\epsilon^{s_0}\leq\mu(B(x,\epsilon))\leq C_2\epsilon^{s_0},\;\epsilon\in(0,\epsilon_0),\;x\in{\rm supp}(\mu). \] For $n\geq 1$, let $\alpha_n$ be an $n$-optimal set for $\mu$ of order $r$ and $(P_a(\alpha_n))_{a\in\alpha_n}$ an arbitrary Voronoi partition with respect to $\alpha_n$. The $n$th quantization error $e_{n,r}(\mu)$ for $\mu$ of order $r$ is given by $e^r_{n,r}(\mu):=\int d(x,\alpha_n)^rd\mu(x)$. Write \[ I_a(\alpha,\mu):=\int_{P_a(\alpha_n)}d(x,\alpha_n)^rd\mu(x),\;a\in\alpha_n. \] We prove that, $\underline{J}(\alpha_n,\mu):=\min_{a\in\alpha_n}I_a(\alpha,\mu)$, $\overline{J}(\alpha_n,\mu):=\max_{a\in\alpha_n}I_a(\alpha,\mu)$ and the error difference $e^r_{n,r}(\mu)-e^r_{n+1,r}(\mu)$ are of the same order as $\frac{1}{n}e^r_{n,r}(\mu)$. This, together with Graf and Luschgy's work, yields that all the above three quantities are of the same order as $n^{-(1+\frac{r}{s_0})}$.
Subjective Assessment of Text Complexity: A Dataset for German Language

This paper presents TextComplexityDE, a dataset consisting of 1000 sentences in German language taken from 23 Wikipedia articles in 3 different article-genres to be used for developing text-complexity predictor models and automatic text simplification in German language. The dataset includes subjective assessment of different text-complexity aspects provided by German learners in level A and B. In addition, it contains manual simplification of 250 of those sentences provided by native speakers and subjective assessment of the simplified sentences by participants from the target group. The subjective ratings were collected using both laboratory studies and crowdsourcing approach.
ZmDREB2.9 Gene in Maize (Zea mays L.): Genome-Wide Identification, Characterization, Expression, and Stress Response

Dehydration-responsive element-binding (DREB) transcription factors of the A2 subfamily play key roles in plant stress responses. In this study, we identified and characterized a new A2-type DREB gene, ZmDREB2.9, in the Zea mays cv. B73 genome and compared its expression profile with those of the known A2-type maize genes ZmDREB2.1–2.8. ZmDREB2.9 was mapped to chromosome 8, contained 18 predicted hormone- and stress-responsive cis-elements in the promoter, and had two splice isoforms: short ZmDREB2.9-S preferentially expressed in the leaves, embryos, and endosperm and long ZmDREB2.9-L expressed mostly in the male flowers, stamens, and ovaries. Phylogenetically, ZmDREB2.9 was closer to A. thaliana DREB2A than the other ZmDREB2 factors. ZmDREB2.9-S, ZmDREB2.2, and ZmDREB2.1/2A were upregulated in response to cold, drought, and abscisic acid and may play redundant roles in maize stress resistance. ZmDREB2.3, ZmDREB2.4, and ZmDREB2.6 were not expressed in seedlings and could be pseudogenes. ZmDREB2.7 and ZmDREB2.8 showed similar transcript accumulation in response to cold and abscisic acid and could be functionally redundant. Our results provide new data on Z. mays DREB2 factors, which can be used for further functional studies as well as in breeding programs to improve maize stress tolerance.
Bipartite entanglement-annihilating maps: Necessary and sufficient conditions

We fully characterize bipartite entanglement-annihilating (EA) channels that destroy entanglement of any state shared by subsystems and, thus, should be avoided in any entanglement-enabled experiment. Our approach relies on extending the problem to EA positive maps, the cone of which remains invariant under concatenation with partially positive maps. Due to this invariancy, positive EA maps adopt a well characterization and their intersection with completely positive trace-preserving maps results in the set of EA channels. In addition to a general description, we also provide sufficient operational criteria revealing EA channels. They have a clear physical meaning since the processes involved contain stages of classical information transfer for subsystems. We demonstrate the applicability of derived criteria for local and global depolarizing noises, and specify corresponding noise levels beyond which any initial state becomes disentangled after passing the channel. The robustness of some entangled states is discussed.
ScholarWorks @ Georgia State University ScholarWorks @ Georgia State University Free Trade Agreements and World Obesity Free Trade Agreements and World Obesity

We study the causal link between trade openness via free trade agreements and obesity rates. We apply a difference-in-differences approach and exploit the year a country entered a free trade agreement with the United States during the period 1990 to 2016. We find statistically and economically significant results and show that our findings are robust to placebo tests, the use of synthetic control methods, and mechanically maximizing the sample. Additionally, we show that when using event studies the equal trends assumption holds. percentage points higher than in men. Also, these descriptive data indicate that the annual consumption of reaches up to 23.9 kilograms per capita.
Ribbon 2–knots, 1 + 1 = 2 and Duflo’s theorem
for arbitrary Lie algebras

We explain a direct topological proof for the multiplicativity of Duflo isomorphism for arbitrary finite dimensional Lie algebras, and derive the explicit formula for the Duflo map. The proof follows a series of implications, starting with "the calculation 1+1=2 on a 4D abacus", using the study of homomorphic expansions (aka universal finite type invariants) for ribbon 2-knots, and the relationship between the corresponding associated graded space of arrow diagrams and universal enveloping algebras. This complements the results of the first author, Le and Thurston, where similar arguments using a "3D abacus" and the Kontsevich Integral were used to derive Duflo's theorem for metrized Lie algebras; and results of the first two authors on finite type invariants of w-knotted objects, which also imply a relation of 2-knots with Duflo's theorem in full generality, though via a lengthier path.