Miracle-dz/UniFAR-FTUs huggingface dataset:
Nanometer-scale order in amorphous Ge2Sb2Te5 analyzed by fluctuation electron microscopy

The phase change material Ge2Sb2Te5 is widely investigated for use in nonvolatile memories. It has been reported that the crystallization speed depends on the thermal history, indicating that structural differences exist between amorphous states. The authors apply fluctuation electron microscopy to quantify differences in the nanometer-scale structural order between several amorphous states of Ge2Sb2Te5. All as-deposited films are found to contain ordered regions. Thermal annealing below the crystallization threshold increases the nanoscale order, and such samples crystallize slightly more rapidly. The authors hypothesize that the nanoscale ordered regions act as the nuclei for crystallization, with the largest regions being the most significant.
Effect of environmental factors in reducing the prevalence of schistosomiasis in schoolchildren: An analysis of three extensive national prevalence surveys in Brazil (1950–2018)

Background : Over seven decades, Brazil has made admirable progress in controlling schistosomiasis, and a frequent question about the explanation for this reduction refers to the effect of improving environmental factors in the country. This article seeks to identify factors related to the change in the epidemiological situation of schistosomiasis mansoni infection by analyzing three national prevalence surveys conducted since 1950. Methodology/principal findings : This is an ecological study analyzing an unbalanced panel of data based on national surveys and considering the municipality as the unit of analysis. The sample consisted of 1,721 Brazilian municipalities, in which a total of 1,182,339 schoolchildren aged 7-14 was examined during the three periods corresponding to each survey (1947-1952, 1975-1979, and 2011-2015). Zero-inflated Poisson regression models, with mixed and random effects, were adjusted to assess the association between candidate factors and disease prevalence using a significance level of 5%. There was a significant decrease in disease prevalence between the first and last periods analyzed (RR 0.214, CI 0.184 - 0.249), with a protective association with access to sanitation (RR 0.996, CI 0.994 - 0.998), urbanization (RR 0.991, CI 0.989 - 0.993), and living in own households (RR 0.986, CI 0.983 - 0.989); and an inverse association with the water supply (RR 1.010, CI 1.008 - 1.011). Conclusion : The findings of this study indicate a decrease in the prevalence of schistosomiasis over seven decades in schoolchildren from the analyzed Brazilian municipalities, mediated by environmental factors and social conditions. The increased access to piped water in the municipalities apparently triggers other ways of contact with watercourses, generating new transmission routes and suggesting the need for a systemic approach concerning contact with water.
Genetic Variants Associated with Longitudinal Cognitive Performance in Older Breast Cancer Patients and Controls

Background: There have been no published genome-wide studies of the genetics of cancer- and treatment-related cognitive decline (CRCD); the purpose of this study is to identify genetic variants associated with CRCD in older female breast cancer survivors. Methods: Analyses included white non-Hispanic breast cancer women with non-metastatic breast cancer aged 60+ (N=325) and age-, racial/ethnic group, and education-matched controls (N=340) with pre-systemic treatment and one-year follow-up cognitive outcomes. CRCD was assessed using longitudinal domain scores on neurocognitive tests of Attention, Processing speed, and Executive function (APE), and Learning and Memory (LM). Linear regression models of one-year cognition included an interaction term for SNP or gene SNP enrichment*cancer case/control status, controlling for demographic variables and baseline cognition. Results: Cancer patients carrying minor alleles for two SNPs, rs76859653 (chromosome 1) in the hemicentin 1 (HMCN1) gene (p=1.624x10-8), and rs78786199 (chromosome 2, p=1.925x10-8) in an intergenic region had lower one-year APE scores than non-carriers and controls. Gene-level analyses showed the POC5 centriolar protein gene was enriched for SNPs associated with differences in longitudinal LM performance between patients and controls. Conclusion: The SNPs associated with cognition in survivors, but not controls, were members of the cyclic nucleotide phosphodiesterase family, which play important roles in cell signaling, cancer risk, and neurodegeneration. These findings provide preliminary evidence that novel genetic loci may drive susceptibility to CRCD.
The SweDen risk score- predicting death 1-year after myocardial infarction

Objectives Our aim was to derive, based on the SWEDEHEART registry, and validate, using the Western Denmark Heart registry, a patient-oriented risk score, the SweDen score, which could calculate the risk of 1-year mortality following a myocardial infarction (MI). Methods The factors included in the SweDen score were age, sex, smoking, diabetes, heart failure, and statin use. These were chosen a priori by the SWEDEHEART steering group based on the premise that the factors were information known by the patients themselves. The score was evaluated using various statistical methods such as time-dependent receiver operating characteristics curves of the linear predictor, area under the curve metrics, Kaplan-Meier survivor curves, and the calibration slope. Results The area under the curve values were 0.81 in the derivation data and 0.76 in the validation data. The Kaplan-Meier curves showed similar patient profiles across datasets. The calibration slope was 1.03 (95% CI 0.99- 1.08) in the validation data using the linear predictor from the derivation data. Conclusions The SweDen risk score is a novel tool created for patient use. The risk score calculator will be available online and presents mortality risk on a colour scale to simplify interpretation and to avoid exact life span expectancies. It provides a validated patient-oriented risk score predicting the risk of death at 1 year after suffering a MI, which visualizes the benefit of statin use and smoking cessation in a simple way.
SYMMETRY, DEGENERACY AND OPTICAL CONFINEMENT OF MODES IN COUPLED RESONATORS

Fast and highly accurate method based on the Muller contour integral equations and a trigonometric-trigonometric Galerkin discretization technique is presented for spectral design and fine-tuning of clusters of whispering-gallery (WG) mode microdisk resonators and photonic crystal (PC) defect cavities. It is shown that degeneracy and near-degeneracy of natural modes as well as modes optical confinement in coupled resonator clusters are significantly influenced by the symmetry of the structure. Photonic molecules with greatly enhanced quality factors are designed by exploiting the symmetry of the molecular geometry and tuning the inter-cavity coupling distances. Potential applications of the spectrally engineered coupledresonator structures to the low-threshold microdisk lasers, optical biosensors, and random powder lasers are discussed.
Mathematics for Mechanical Engineers

Tables Linear Algebra and Matrices Vector Algebra and Calculus Difference Equations Differential Equations Integral Equations Approximation Methods Integral Transforms Calculus of Variations Approximation Optimization Methods Engineering Statistics Numerical Methods Experimental Uncertainty Analysis Chaos Fuzzy Sets and Fuzzy Logic Appendix A-Properties of Gases and Vapors. Appendix B-Properties of Liquids Appendix C-Properties of Solids Appendix D-SI Units
Lattice structure for orientations of graphs

Earlier researchers have studied the set of orientations of a connected finite graph $G$, and have shown that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of local moves of a simple type. Here I show that the set of orientations of $G$ having the same flow-differences around all closed loops can be given the structure of a distributive lattice. The construction generalizes partial orderings that arise in the study of alternating sign matrices. It also gives rise to lattices for the set of degree-constrained factors of a bipartite planar graph; as special cases, one obtains lattices that arise in the study of plane partitions and domino tilings. Lastly, the theory gives a lattice structure to the set of spanning trees of a planar graph.
Improved Model Accuracy Based on a Simple Frame of Temporal-Correlation Representation Method in Sleep Staging

We proposes a new kind of contrast learning method based on Temporal-Correlation characters of electroencephalogram (EEG) used in sleep staging. This method, called simple framework of temporal-correlation representation(simTCR), was studied and tested on Open EEG dataset, sleep-EDF and clinical EEG dataset from polysomnography (PSG). Deep learning used in clinical diagnosis is often faced with problems of deficiency of well labeled labels. And physiological signal, like EEG signal, often shows temporal correlation character, which means the signal maintains one state in a period of time before it transforms into a new state. Therefore, there exist high probability that the nearby frames of EEG signal belong to same categories and shows similar characters. This character can be considered as self-supervised features and a loss function was raised here to pretrain the model. Our result shows that, (1) simTCR can improve the sleep staging accuracy based on EEG signal to 1%-17% in both clinical dataset and Open dataset, sleep-EDF; (2) The improved effect is more obvious when the training data in fine-tuning process is more less; (3) the hyper-parameter batch size plays limited roles in the accuracy improvement; (4) simTCR costs about three magnitudes of more time than the traditional supervised deep learning method.
Stochastic Systems: Theory and Applications

Dynamical Systems and Their Characteristics Random Variables, Processes and Functions Moments, Characteristic Functions, Functionals and Canonical Expansions Stochastic Integrals, Spectral and Integral Canonical Representations General Theory of Stochastic Systems and Its Applications Methods of Linear Stochastic Systems Theory and Their Applications Methods of Nonlinear Stochastic Systems Theory and Their Applications.
Auto-models with mixed states and analysis of motion textures

In image motion analysis as well as for several application fields like daily pluviometry data modeling, observations contain two components of different nature. A first part is made with discrete values accounting for some symbolic information and a second part records a continuous (real-valued) measurement. We call such type of observations ``mixed-state observations". In this work we introduce a generalization of Besag's auto-models to deal with mixed-state observations at each site of a lattice. A careful construction as well as important properties of the model will be given. The performance of the model is then evaluated on the modeling of motion textures from video sequences.
Flexible Parametric Illness-Death Models

It is usual in time-to-event data to have more than one event of interest, for example, time to death from different causes. Competing risks models can be applied in these situations where events are considered mutually exclusive absorbing states. That is, we have some initial state—for example, alive with a diagnosis of cancer—and we are interested in several different endpoints, all of which are final. However, the progression of disease will usually consist of one or more intermediary events that may alter the progression to an endpoint. These events are neither initial states nor absorbing states. Here we consider one of the simplest multistate models, the illness-death model. stpm2illd is a postestimation command used after fitting a flexible parametric survival model with stpm2 to estimate the probability of being in each of four states as a function of time. There is also the option to generate confidence intervals and transition hazard functions. The new command is illustrated through a simple example.
Rotating Strings in Massive Type IIA Supergravity

Massive type IIA supergravity admits a warped AdS_6 x S^4 vacuum solution, which is expected to be dual to an N=2, D=5 super-conformal Yang-Mills theory. We study solutions for strings rotating or spinning in this background. The warp factor plays no essential role when the string spins in the AdS_6, implying a commonality in the leading Regge trajectories between the D=4 and D=5 super-conformal field theories. The warp factor does, however, become important when the string rotates in the S^4, in particular for long strings, which have the the relation E- 3J/2=c_1 + c_2/J^5+. , where the angular momentum J is large. This relation is qualitatively different from that for long strings in the AdS_5 x S^5 background. We also study Penrose limits of the AdS_6 x S^4 solution, one of which gives rise to a free massive string theory with time-dependent masses.
Complementation of adjectives : A corpus-based study of adjectival complementation by that- and to-clauses

This corpus-based study investigates adjectives that allow complementation by both that- and to-clauses. The study is concerned with arriving at a structural and functional description of the distribution of adjectives that allow complementation by both to-infinitive clauses and that-clauses, based on the various syntactic and semantic manifestations of these two clause types and the adjectives that are complemented by them. The study reveals that there is a strong correlation between the semantics of different adjectives, the grammatical patterns they allow and their differing valency possibilities. Furthermore, the study shows that to-clauses are primarily used when the subject of the complement clause does not need to be explicitly marked. Conversely, that-clauses are primarily used when the subject of the complement clause is required. Other factors influencing the choice between that- and to-clauses include the ability to mark modality and tense on the finite verb in that-clauses as well as differing register distribution. The ability to mark modality on the finite verb in that-clauses functions as a strong factor favouring the use of that-clauses. The differing register distribution reveals that post-predicative to-clauses typically are represented by complex matrix subjects in the academic register whereas the matrix subjects post-predicative to-clauses in fiction and the spoken register typically are represented by anaphoric personal pronouns. Furthermore, the register distribution of adjectives complemented by that- and to-clauses has been linked to differing functions of these clauses in different registers. The study shows that extraposed to-clauses are frequently complementing epistemic matrix adjectives in the academic register. In the spoken register, on the other hand, post-predicative that-clauses with that omission are typically complementing evaluative predicates.
Signals and Systems: Continuous and Discrete

1. Signal and System Modeling Concepts. 2. System Modeling and Analysis in the Time Domain. 3. The Fourier Series. 4. The Fourier Transform and Its Applications. 5. The Laplace Transformation. 6. Applications of the Laplace Transform. 7. State-Variable Techniques. 8. Discrete-Time Signals and Systems. 9. Analysis and Design of Digital Filters. 10. The Discrete Fourier Transform and Fast Fourier Transform Algorithms. Appendix A: Comments and Hints on Using MATLAB. Appendix B: Functions of a Complex Variable--Summary of Important Definitions and Theorems. Appendix C: Matrix Algebra. Appendix D: Analog Filters. Appendix E: Mathematical Tables. Appendix F: Answers to Selected Problems. Appendix G: Index of MATLAB Functions Used. Index.
Annihilator ideals and primitive elements in complex bordism

We determine the prime ideals in the complex bordism ring r,(MU) which can be the annihilator ideals of elements in the complex bordism of finite complexes. Such a prime ideal must be finitely generated and invariant under all stable MU-cohomology operations. We go on to determine the invariant prime ideals in r,(MU).
Decentralized Learning with Separable Data: Generalization and Fast Algorithms

Decentralized learning oﬀers privacy and communication eﬃciency when data are naturally distributed among agents communicating over an underlying graph. Motivated by overparameterized learning settings, in which models are trained to zero training loss, we study algorithmic and generalization properties of decentralized learning with gradient descent on separable data. Speciﬁcally, for decentralized gradient descent (DGD) and a variety of loss functions that asymptote to zero at inﬁnity (including exponential and logistic losses), we derive novel ﬁnite-time generalization bounds. This complements a long line of recent work that studies the generalization performance and the implicit bias of gradient descent over separable data, but has thus far been limited to centralized learning scenarios. Notably, our generalization bounds approximately match in order their centralized counterparts. Critical behind this, and of independent interest, is establishing novel bounds on the training loss and the rate-of-consensus of DGD for a class of self-bounded losses. Finally, on the algorithmic front, we design improved gradient-based routines for decentralized learning with separable data and empirically demonstrate orders-of-magnitude of speed-up in terms of both training and generalization performance.
Knowledge Graph Completion with Pre-trained Multimodal Transformer and Twins Negative Sampling

Knowledge graphs (KGs) that modeling the world knowledge as structural triples are inevitably incomplete. Such problems still exist for multimodal knowledge graphs (MMKGs). Thus, knowledge graph completion (KGC) is of great importance to predict the missing triples in the existing KGs. As for the existing KGC methods, embedding-based methods rely on manual design to leverage multimodal information while finetune-based approaches are not superior to embedding-based methods in link prediction. To address these problems, we propose a V isual B ERT-enhanced K nowledge G raph C ompletion model (VBKGC for short). VBKGC could capture deeply fused multimodal information for entities and integrate them into the KGC model. Besides, we achieve the co-design of the KGC model and negative sampling by designing a new negative sampling strategy called twins negative sampling. Twins negative sampling is suitable for multimodal scenarios and could align different embeddings for entities. We conduct extensive experiments to show the outstanding performance of VBKGC on the link prediction task and make further exploration of VBKGC.
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure

This paper considers a natural fault-tolerant shortest paths problem: for some constant integer f, given a directed weighted graph with no negative cycles and two fixed vertices s and t, compute (either explicitly or implicitly) for every tuple of f edges, the distance from s to t if these edges fail. We call this problem f-Fault Replacement Paths (f FRP). We first present an $\tilde{O}(n^{3}$) time algorithm for 2FRP in n-vertex directed graphs with arbitrary edge weights and no negative cycles. As 2FRP is a generalization of the well-studied Replacement Paths problem (RP) that asks for the distances between s and t for any single edge failure, 2FRP is at least as hard as RP. Since RP in graphs with arbitrary weights is equivalent in a fine-grained sense to All-Pairs Shortest Paths (APSP) [Vassilevska Williams and Williams FOCS’10, J. ACM’18], 2FRP is at least as hard as APSP, and thus a substantially subcubic time algorithm in the number of vertices for 2FRP would be a breakthrough. Therefore, our algorithm in $\tilde{O}(n^{3})$ time is conditionally nearly optimal. Our algorithm immediately implies an $\tilde{O}(n^{f+1})$ time algorithm for the more general f FRP problem, giving the first improvement over the straightforward $O(n^{f+2})$ time algorithm.Then we focus on the restriction of 2FRP to graphs with small integer weights bounded by M in absolute values. We show that similar to $\mathrm{R}\mathrm{P}, 2\mathrm{F}\mathrm{R}\mathrm{P}$ has a substantially subcubic time algorithm for small enough M. Using the current best algorithms for rectangular matrix multiplication, we obtain a randomized algorithm that runs in $\tilde{O}(M^{2/3}n^{2.9153})$ time. This immediately implies an improvement over our $\tilde{O}(n^{f+1})$ time arbitrary weight algorithm for all $f\gt1$. We also present a data structure variant of the algorithm that can trade off pre-processing and query time. In addition to the algebraic algorithms, we also give an $n^{8/3-o(1)}$ conditional lower bound for combinatorial 2FRP algorithms in directed unweighted graphs, and more generally, combinatorial lower bounds for the data structure version of $fF\mathrm{R}\mathrm{P}$.
Concurrent size

The size of a data structure (i.e., the number of elements in it) is a widely used property of a data set. However, for concurrent programs, obtaining a correct size efficiently is non-trivial. In fact, the literature does not offer a mechanism to obtain a correct (linearizable) size of a concurrent data set without resorting to inefficient solutions, such as taking a full snapshot of the data structure to count the elements, or acquiring one global lock in all update and size operations. This paper presents a methodology for adding a concurrent linearizable size operation to sets and dictionaries with a relatively low performance overhead. Theoretically, the proposed size operation is wait-free with asymptotic complexity linear in the number of threads (independently of data-structure size). Practically, we evaluated the performance overhead by adding size to various concurrent data structures in Java−a skip list, a hash table and a tree. The proposed linearizable size operation executes faster by orders of magnitude compared to the existing option of taking a snapshot, while incurring a throughput loss of 1%−20% on the original data structure’s operations.
The impact of surface dynamo magnetic fields on the solar iron abundance

Most chemical abundance determinations ignore that the solar photosphere is significantly magnetized by the ubiquitous presence of a small-scale magnetic field. A recent investigation has suggested that there should be a significant impact on the derived iron abundance, owing to the magnetically induced changes on the photospheric temperature and density structure (indirect effect). The three-dimensional (3D) photospheric models used in that investigation have non-zero net magnetic flux values and stem from magnetoconvection simulations without small-scale dynamo action. Here we address the same problem by instead using 3D models of the quiet solar photosphere that result from a state-of-the-art magneto-convection simulation with small-scale dynamo action, where the net magnetic flux is zero. One of these 3D models has negligible magnetization, while the other is characterized by a mean field strength of 160 Gauss in the low photosphere. With such 3D models we carried out spectral synthesis for a large set of Fe i lines to derive abundance corrections, taking the above-mentioned indirect effect and the Zeeman broadening of the intensity profiles (direct effect) into account. We conclude that if the magnetism of the quiet solar photosphere is mainly produced by a small-scale dynamo, then its impact on the determination of the solar iron abundance is negligible.