Miracle-dz/UniFAR-FTUs huggingface dataset:
The Role of Gender and Marital Status in the Relationship between Caregiving for Older Parents with Alzheimer’s Disease and Depressive Symptoms among Baby Boomer Adult Child Caregivers: Evidence from the Health and Retirement Study

Abstract The present study applied a multilevel approach to assess the effects of caregiving for older parents with Alzheimer’s disease (AD) on a level of depressive symptoms among adult child caregivers in the Baby Boomer generation. Along with the main effect, this study focused on the interaction effects between AD caregiving, gender and marital status. The present study’s findings revealed that AD caregiving experience is associated with worsening depressive symptoms. However, there are differences between individuals in changes in depressive symptoms. Additionally, the results of the interaction effect showed that in the case of unmarried female caregivers, the level of depressive symptoms associated with AD caregiving worsens faster than their counterparts. These results highlight the need for social policies that address the mental health needs of adult child caregivers who are vulnerable to AD caregiving experience.
Nearly Tight Spectral Sparsification of Directed Hypergraphs

Spectral hypergraph sparsification, an attempt to extend well-known spectral graph sparsification to hypergraphs, has been extensively studied over the past few years. For undirected hypergraphs, Kapralov, Krauthgamer, Tardos, and Yoshida (2022) have proved an ε -spectral sparsifier of the optimal O ∗ ( n ) size, where n is the number of vertices and O ∗ suppresses the ε − 1 and log n factors. For directed hypergraphs, however, the optimal sparsifier size has not been known. Our main contribution is the first algorithm that constructs an O ∗ ( n 2 )-size ε -spectral sparsifier for a weighted directed hypergraph. Our result is optimal up to the ε − 1 and log n factors since there is a lower bound of Ω( n 2 ) even for directed graphs. We also show the first non-trivial lower bound of Ω( n 2 /ε ) for general directed hypergraphs. The basic idea of our algorithm is borrowed from the spanner-based sparsification for ordinary graphs by Koutis and Xu (2016). Their iterative sampling approach is indeed useful for designing sparsification algorithms in various circumstances. To demonstrate this, we also present a similar iterative sampling algorithm for undirected hypergraphs that attains one of the best size bounds, enjoys parallel implementation, and can be transformed to be fault-tolerant.
Factor Structure of the LanguEdge™ Test across Language Groups. TOEFL® Monograph Series. MS-32. ETS RR-05-12.

This study assessed the factor structure of the LanguEdge™ test and the invariance of its factors across language groups. Confirmatory factor analyses of individual tasks and subsets of items in the four sections of the test, Listening, Reading, Speaking, and Writing, was carried out for Arabic-, Chinese-, and Spanish-speaking test takers. Two factors were identified, Speaking and a fusion of the other sections of the test. The number of factors, the factor loadings, and the factors' error variances were invariant in the three samples, although the correlations between the factors differed. The failure to find separate factors for each section of the LanguEdge test necessarily raises questions about the test's functioning that need to be resolved.
Using Visual Programming Games to Study Novice Programmers

Enabling programmers to write correct and efficient parallel code remains an important challenge, and the prevalence of on-chip accelerators exacerbates this challenge. Novice programmers, especially those in disciplines outside of Computer Science and Computer Engineering, need to be able to write code that exploits parallelism and heterogeneity, but the frameworks for writing parallel and heterogeneous programs expect expert knowledge and experience. More effort must be put into understanding how novice programmers solve parallel problems. Unfortunately, novice programmers are difficult to study because they are, by definition, novices. We have designed a visual programming language and game-based framework for studying how novice programmers solve parallel problems. This tool was used to conduct an initial study on 95 undergraduate students with little to no prior programming experience. 71% of all volunteer participants completed the study in 48 minutes on average. This study demonstrated that novice programmers could solve parallel problems, and this framework can be used to conduct more thorough studies of how novice programmers approach parallel code.
A-perfect lattice

In the Paper [3] authors define the concept of A-perfect Group. Inspired by [3], we give a new concept of A-perfect lattice. If g ∈ L and α ∈ A, then the element [g;α] = g−1α(g) is an auto commutator of g and α, if is taken to be an inner automorphism, then the autocommutator sublattice is the derived sublattice L′ of L. A lattice L is said to be perfect if L = L′. Here, the perception of A-perfect lattices would be introduced. A lattice L would be known as A-perfect, if L = K(L).
Fibonacci Level Adjustment for Optimizing Player's Performance and Engagement

Players’ engagement intensity in computer games is influenced by the level of difficulty the game offers. Traditional game-level plots adopt linear increases that sometimes do not match the users’ skill growth, causing boredom and hampering the users’ further skill growth. In this study, a nonlinear level adjustment scenario was proposed based on the Fibonacci sequence that provides gradual increases in the early stages of the games but more drastic changes in later phases. Here, the game’s difficulty level was automatically decided by a machine learning method. To test the proposed method, comparisons between four level adjustments in computer games: traditional plots, self-selected plots, linear adaptive plots, and the proposed nonlinear adaptive plots were run. The experiment was carried out with 40 testers. The experiment results show that the best player’s peak level in the proposed nonlinear adjustment was twice as high as that of linear adjustment. Also, the number of stages required to reach the peak under the proposed scenario was half that of linear games. This high playing performance goes hand in hand with deep playing engagement. The results demonstrate the efficiency of the proposed level adjustment algorithm.
Slow invariant manifolds for reaction-diffusion systems

by Joshua David Mengers The method of Slow Invariant Manifolds (SIMs), as developed to model the reduced kinetics of spatially homogeneous reactive systems, is extended to systems with diffusion. Using a Galerkin projection, the governing partial differential equations are cast into a finite system of ordinary differential equations to be solved on an approximate inertial manifold. The SIM construction technique of identifying equilibria and connecting heteroclinic orbits is extended by identifying steady state solutions to the governing partial differential equations and connecting analogous orbits in the Galerkin-projected space. In parametric studies varying the domain length, the time scale spectrum is shifted, and various classes of non-linear dynamics are identified. A critical length scale is identified at which a bifurcation occurs in the equilibria used to construct the one-dimensional SIM. Above this length scale additional real non-singular steady state solutions are found which lead to a diffusion-modified SIM. At these longer lengths, the spectral gap in the time scales indicates that an appropriate manifold for a reduction technique is higher than one-dimensional. This is shown for three examples in closed reactiondiffusion systems: a generic chemical reaction mechanism, an oxygen dissociation reaction mechanism, and the Zel’dovich reaction mechanism of NO production. The extension of SIMs to adiabatic reaction systems is also considered, and results are shown for the Zel’dovich mechanism. Finally, two open chemical systems Joshua David Mengers are considered: the Gray-Scott reaction mechanism, and a hydrogen-air reaction mechanism. Multiple branches of the SIM are identified, complicating the implementation of the SIM as a reduction technique. Limit cycles are studied and a projection to the SIM across a basin of attraction is shown to provide erroneous results. Low-dimensional Galerkin projections are shown to provide correct order of magnitude predictions for length scales in patterns. The examples are evaluated in the spatially homogeneous case (a one-term projection), a two-term projection capturing the coarsest effects of diffusion, and a high order projection that is fully resolved. The results cast into doubt the SIM as a robust rational reduction technique for reaction dynamics.
Potential field continuation between arbitrary surfaces — Comparing methods

ABSTRACTThe continuation of potential field data from one irregular surface to another, not always horizontal, is often a necessary component within the data processing and interpretation stream. The most common requirement is to reduce field values (or some related component or derivative) to a horizontal plane, to facilitate further quantitative processing. Methods available to continue data comprise two main approaches. The first (source-based) involves calculating a source distribution that produces a fit to the data and can be used to calculate the field at any other point above. The second (field-based) requires no source determinations and deals with only fields but may involve calculating the field on some intermediate surface. Nine different continuation methods were compared (four source based and five field based) through synthetic tests and on real data from a helicopter-borne survey in Yukon, Canada. The preferred methods of Guspi and Hansen are those that do not involve any theoretical or ge.
Experimental studies of high-confinement mode plasma response to non-axisymmetric magnetic perturbations in ASDEX Upgrade

The interaction of externally applied small non-axisymmetric magnetic perturbations (MP) with tokamak high-confinement mode (H-mode) plasmas is reviewed and illustrated by recent experiments in ASDEX Upgrade. The plasma response to the vacuum MP field is amplified by stable ideal kink modes with low toroidal mode number n driven by the H-mode edge pressure gradient (and associated bootstrap current) which is experimentally evidenced by an observable shift of the poloidal mode number m away from field alignment (m = qn, with q being the safety factor) at the response maximum. A torque scan experiment demonstrates the importance of the perpendicular electron flow for shielding of the resonant magnetic perturbation, as expected from a two-fluid MHD picture. Two significant effects of MP occur in H-mode plasmas at low pedestal collisionality, νped∗⩽0.4: (a) a reduction of the global plasma density by up to 61% and (b) a reduction of the energy loss associated with edge localised modes (ELMs) by a factor of up to 9. A comprehensive database of ELM mitigation pulses at low ν∗ in ASDEX Upgrade shows that the degree of ELM mitigation correlates with the reduction of pedestal pressure which in turn is limited and defined by the onset of ELMs, i. e. a modification of the ELM stability limit by the magnetic perturbation.
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning

The field of cryptographic protocol verification in the computational model aims at obtaining formal security proofs of protocols. To facilitate writing such proofs, which are complex and hard to automate, Bana and Comon have proposed the Computationally Complete Symbolic Attacker (CCSA) approach, which is based on a first-order logic with a probabilistic computational semantics. Later, a meta-logic was built on top of the CCSA logic, to extend it with support for unbounded protocols and effective mechanisation. This meta-logic was then implemented in the SQUIRREL prover.In this paper, we propose a careful re-design of the SQUIRREL logic, providing clean and robust foundations for its future development. We show in this way that the original meta-logic was both needlessly complex and too restrictive. Our new, higher-order logic avoids the indirect definition of the meta-logic on top of the CCSA logic, decouples the logic from the notion of protocol, and supports advanced generic reasoning and non-computable functions. We also equip it with generalised cryptographic rules to reason about corruption. This theoretical work justifies our extension of SQUIRREL with higher-order reasoning, which we illustrate on case studies.
Fano resonances in photonic crystal slabs near optical bound states in the continuum

Photonic crystal slabs are able to support optical bound states in the continuum. The latter are eigenmodes of the structure that are truly guided (no radiation leakage) despite the fact that they lie above the light cone within the continuum of radiation modes. Such peculiar states can be viewed as modes with an infinite quality factor $Q$. Therefore, the question of the behavior of Fano resonances, as optogeometrical parameters are tuned close to optical bound states in the continuum, is of importance for applications of photonic crystal slabs with ultrahigh $Q$ factors. We study theoretically the reflection and transmission of a photonic crystal slab close to an optical bound state in the continuum with a phenomenological approach involving the poles and zeros of the scattering matrix. In particular, we derive a general relation valid for asymmetric structures that gives the position of a pole in the complex plane as a function of the positions of the zeros. We provide closed-form expressions for the reflection and transmission. The proposed phenomenological approach is validated through rigorous numerical calculations.
Ad5-nCoV Vaccination Could Induce HLA-E Restricted CD8+ T Cell Responses Specific for Epitopes on Severe Acute Respiratory Syndrome Coronavirus 2 Spike Protein

We evaluated cellular immune responses induced by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) vaccines in an immunized population based on HLA-E-restricted CD8+ T cell epitope identification. HLA-E-restricted SARS-CoV-2 CD8+ T cell nonamer peptides were predicted with software. An HLA-E-transfected K562 cell binding assay was used to screen for high-affinity peptides. IFN-γ enzyme-linked immunospot assays were used to identify HLA-E-restricted epitopes. An HLA-E/epitope tetramer was employed to detect the frequencies of epitope-specific CD8+ T cells. Four CD8+ T cell epitopes on the spike protein of SARS-CoV-2 restricted by both HLA-E*0101 and E*0103 were identified. HLA-E-restricted epitope-specific IFN-γ-secreting CD8+ T cell responses could be detected in individuals vaccinated with SARS-CoV-2 vaccines. Importantly, the frequencies of epitope-specific CD8+ T cells in Ad5-nCoV vaccinated individuals were higher than in individuals vaccinated with recombinant protein or inactivated vaccines. Moreover, the frequencies of epitope-specific CD8+ T cells could be maintained for at least 120 days after only one dose of Ad5-nCoV vaccine, while the frequencies of epitope-specific CD8+ T cells decreased in individuals after two doses of Ad5-nCoV vaccine. These findings may contribute to a more comprehensive evaluation of the protective effects of vaccines for SARS-CoV-2; meanwhile, they may provide information to characterize HLA-E-restricted CD8+ T cell immunity against SARS-CoV-2 infection.
EXAMPLES OF FREE ACTIONS ON PRODUCTS OF SPHERES

We construct a non-abelian extension (cid:2) of S 1 by Z / 3 × Z / 3, and prove that (cid:2) acts freely and smoothly on S 5 × S 5 . This gives new actions on S 5 × S 5 for an inﬁnite family P of ﬁnite 3-groups. We also show that any ﬁnite odd-order subgroup of the exceptional Lie group G 2 admits a free smooth action on S 11 × S 11 . This gives new actions on S 11 × S 11 for an inﬁnite family E of ﬁnite groups. We explain the signiﬁcance of these families P , E for the general existence problem, and correct some mistakes in the literature.
Prediction of Population Aging Based on an Improved Markov Matrix

Grasping the population aging from the perspective of long-term development has certain guiding significance of formulating national economic development plan and social strategic goals in China. Based on the Markov matrix and the population process reflected by Leslie matrix, an improved Markov matrix is constructed in this paper to predict the aging tendency of China’s population. The prediction process takes full account of age-specific fertility rate, age-specific survival rate, male-to-female birth ratio and age-specific male-to-female ratio, which makes it have strong fault tolerance. It turns out that China's population will reach a peak of 1.42337 billion in 2027, and the proportion of the aging population will reach a maximum of 34.35% in 2060 and then begin to decline slightly, which can be traced to the second baby boom in Chinese history. But the proportion will remain above 25% until 2220. China's population aging is a long-term and non-cyclical process, and its deepening is mainly caused by the population structure not adapting to the population fertility pattern and life style under the background of the new era. Therefore, improving the population aging in China needs time to push forward the evolution of population structure. At the same time, China should develop a long-term sustainable aging economy to prepare for confronting the aging war and the "turning point".
Evaluation of machine learning 1 architectures on the quantification of 2 epistemic and aleatoric uncertainties in 3 complex dynamical systems 4

9 Machine learning methods for the construction of data-driven reduced order model models are used in an increasing variety of engineering domains, especially as a supplement to expensive computational fluid dynamics for design problems. An important check on the reliability of surrogate models is Uncertainty Quantification (UQ), a self assessed estimate of the model error. Accurate UQ allows for cost savings by reducing both the required size of training data sets and the required safety factors, while poor UQ prevents users from confidently relying on model predictions. We examine several machine learning techniques, including both Gaussian processes and a family UQ-augmented neural networks: Ensemble neural networks (ENN), Bayesian neural networks (BNN), Dropout neural networks (D-NN), and Gaussian neural networks (G-NN). We evaluate UQ accuracy (distinct from model accuracy) using two metrics: the distribution of normalized residuals on validation data, and the distribution of estimated uncertainties. We apply these metrics to two model data sets, representative of complex dynamical systems: an ocean engineering problem in which a ship traverses irregular wave episodes, and a dispersive wave turbulence system with extreme events, the Majda-McLaughlin-Tabak model. We present conclusions concerning model architecture and hyperparameter tuning.
On the effect of vibrational capture of rotation of an unbalanced rotor

The dynamics of an unbalanced rotor with a vibrating suspension axis and driven by an asynchronous electric motor of limited power is considered. Stationary (near stationary) modes of rotation of the rotor with a frequency equal to the vibration frequency of the axis are investigated. An explanation of the phenomenon of vibrational capture of rotation of an unbalanced rotor is given. The proposed mechanical interpretation of the effect allows deeper understanding of the classical results and conclusions. The obtained condition for the existence of a stationary mode allows us to estimate the frequency capture interval of the rotor. The case when the mode of vibration capture of rotation is not set is considered. For such a case, an expression for the vibrational moment is obtained, as well as an equation for slow motions. Attention is drawn to the possibility of occurrence in the considered modes of motion of slow (relative to the rotation frequency) rotor oscillations with sufficiently large amplitudes. It is demonstrated that the vibrational capture mode has the property of self-regulation; allows to stabilize the rotation frequency of an unbalanced rotor during load oscillations. Attention is drawn to the fact that in this mode of motion, there is certainly a transfer of energy either from the source of vibration to the rotor, or vice versa. The Sommerfeld effect in an oscillatory system with an inertial vibration exciter is represented by vibration capture of rotation of the vibration exciter by resonant oscillations of the carrier body. The theoretical results are confirmed by numerical modelling.
(Bound) Pronouns in Competition: Evidence from Romanian Comprehension

In sentences like (1) and (2), Romanian pronouns el / ea ‘him / her’ are ambiguous between a reflexive reading (e.g. bound by every boy) and a locally disjoint reading (e.g. coreferent with grandpa Radu). We investigate the interpretation of el/ea in contexts like (1) and (2) by means of two comprehension experiments with pronouns targeting both referential (Experiment 1, e.g. Andrei) and quantified (Experiment 2, e.g. every boy) antecedents. Under the hypothesis that binding dependencies are preferred to discourse established reference relations (Reinhart 1983, Reuland 2001, 2011), we might expect el to be preferentially assigned reflexive readings. On the other hand, under the hypothesis that listeners reject reflexive readings for ambiguous pronouns if less ambiguous reflexive forms are available (Levinson 1987, 2000), given the existence of unambiguously reflexive el însuşi ‘him himself’, we might expect el to be preferentially interpreted as disjoint from the local subject. Lastly, under the hypothesis that pronominal expressions compete (Safir 2004, Rooryck & vanden Wyngaerd 2011, Levinson 2000), we might find that the interpretation of pronouns like el is affected by the availability of other pronominal forms. In two interpretation experiments, we find: (i) no clear preference for bound variable readings for ambiguous pronouns; (ii) no clear preference for locally disjoint reference; and (iii) complex reflexives like el însuşi compete with simplex pronominal forms ea/el and the increased availability of complex reflexives lowers the rate of the bound variable interpretation of simplex forms in contexts in which the latter are ambiguous.
UC Merced Proceedings of the Annual Meeting of the Cognitive Science Society

Many computational models of reasoning rely on explicit relation representations to account for human cognitive capacities such as analogical reasoning. Relational luring , a phenomenon observed in recognition memory, has been interpreted as evidence that explicit relation representations also impact episodic memory; however, this assumption has not been rigorously assessed by computational modeling. We implemented an established model of recognition memory, the Generalized Context Model (GCM), as a framework for simulating human performance on an old/new recognition task that elicits relational luring. Within this basic theoretical framework, we compared representations based on explicit relations, lexical semantics (i.e., individual word meanings), and a combination of the two. We compared the same alternative representations as predictors of accuracy in solving explicit verbal analogies. In accord with previous work, we found that explicit relation representations are necessary for modeling analogical reasoning. In contrast, preliminary simulations incorporating model parameters optimized to fit human data reproduce relational luring using any of the alternative representations, including one based on non-relational lexical semantics. Further work on model comparisons is needed to examine the contributions of lexical semantics and relations on the luring effect in recognition memory.