Miracle-dz/UniFAR-FTUs huggingface dataset:
Pharmacists’ Knowledge, Attitudes and Practices Towards Herbal Remedies In West Bank, Palestine

Abstract Background : There is an increasing trend towards consumption of complementary and alternative herbal products in many parts of the world. Objectives: The purpose of this study was to investigate the knowledge and attitudes among pharmacists in West Bank, Palestine towards the use of herbs. Methods : Self-administered questionnaire was designed as the study instrument and distributed among 350 qualified pharmacists working in government and private pharmacies in West Bank, Palestine. Results : The response rate was 82.9% (290/350). The mean age of the pharmacists was 32.9 (SD=6.5) years. The majority of the pharmacist 238 (82.1%) worked in the community pharmacies and their experience in practice ranged from 1 to 26 years. Product package instructions and product representative were the most consulted by the pharmacists (128; 44.2% and 73; 25.2% respectively). General health tonic preparations were the most widely dispensed drugs (142; 48.9%), followed by cough preparations (55; 19.0%) and slimming agents (64; 22.1%). The Majority of pharmacists (195; 67.2%) believed herbal remedies were effective; however, about fifty percent of the pharmacists had concern about their safety. The knowledge of respondents about the indications of herbal medicine was good, but their awareness of interactions, contraindications and adverse effects was inadequate. The majority of Pharmacists (255; 87.9%) believed that herbal product should undergo increased regulation and (215; 74.9%) believed that information available about herbal and natural product isn't adequate. Conclusion: Many pharmacists in Palestine believed that herbal remedies were an effective alternative therapeutic option. Continuing education programs, for practicing pharmacists, in herbal medicine should be encouraged . This would enable pharmacists to provide competent, effective and holistic patient care.
Psychiatric Sequelae of Abortion: The Many Faces of Post-Abortion Grief

Induced abortion is the surgical or medical intervention in a pregnancy for the purpose of causing the death ofthe embryo or fetus (If the procedure results in a live birth, the outcome is a preterm delivery, not an abortion.). Every abortion, then, is an iatrogenic death. Every post-abortion woman has undergone a real death experience the death of her child. Grief is a natural consequence of death. Current obstetrical and psychiatric literature abounds with articles about grief following perinatal death death due to spontaneous abortion, premature birth, stillbirth, and Sudden Infant Death Syndrome. However, it is only in recent years that the medical profession has begun to understand that perinatal loss can be followed by a grief reaction similar to the loss of an older child or an adult as illustrated by the following statement in Clinics ofOBIGYNin 1986. "I can state most assuredly that couples with recurrent, unexplained or explained early pregnancy losses grieve as intensely as those with later losses or losses of live-born children. Their grief is not visible, however, since society, family, friends, press, or clergy do not support or are not trained to support them. The grief is very real and if unattended can eventually be felt by them to be aberrant, unnatural, or even unhealthy. "! Hospital obstetrical units have developed teams of physicians, nurses, and social workers to help parents deal with perinatal death and the issues of grief, anger, and guilt which it raises. The September 1990 issue of the British Journal of Obstetrics and Gynecology states: "Ways of helping parents cope with their losses have been recommended and have reduced the frequency of prolonged emotional disturbance and of abnormal grief reactions . Ways of facilitating the . grieving process have been identified. These include seeing and holding the dead baby, giving it a name and taking photographs; all help make the situation a reality and to create memories. It is difficult to grieve when no memory of the individual exists. "2 In addition to the 20 to 30 percent of pregnancies thought to end in spontaneous abortion in this country, there is now one elective abortion for
Query-Efficient Correlation Clustering

Correlation clustering is arguably the most natural formulation of clustering. Given n objects and a pairwise similarity measure, the goal is to cluster the objects so that, to the best possible extent, similar objects are put in the same cluster and dissimilar objects are put in different clusters. A main drawback of correlation clustering is that it requires as input the Θ(n2) pairwise similarities. This is often infeasible to compute or even just to store. In this paper we study query-efficient algorithms for correlation clustering. Specifically, we devise a correlation clustering algorithm that, given a budget of Q queries, attains a solution whose expected number of disagreements is at most , where is the optimal cost for the instance. Its running time is O(Q), and can be easily made non-adaptive (meaning it can specify all its queries at the outset and make them in parallel) with the same guarantees. Up to constant factors, our algorithm yields a provably optimal trade-off between the number of queries Q and the worst-case error attained, even for adaptive algorithms. Finally, we perform an experimental study of our proposed method on both synthetic and real data, showing the scalability and the accuracy of our algorithm.
Sexual Assault and Heavy Episodic Drinking Among Women of Asian/Pacific Islander Ancestry and Women of European Ancestry

Sexual assault prevalence rates differ by ethnicity, and there is little research on sexual assault among women of Asian/Pacific Islander ancestry, compared to women of European ancestry. In the current online study, we examined heavy episodic drinking, rates of assault, and assault severity among native and nonnative English-speaking college students of Asian/Pacific Islander ancestry. Native English-speaking students of Asian/Pacific Islander ancestry reported similar sexual assault severity before and since college, compared to their nonnative English-speaking counterparts. Students of European ancestry reported more severe before-college sexual assault histories than native English-speaking students of Asian/Pacific Islander ancestry. No group differences were found in college sexual assault severity. Students of European ancestry reported more frequent heavy episodic drinking than native English-speaking students of Asian/Pacific Islander ancestry, which in turn was associated with more severe assaults since college. For all students, more frequent heavy episodic drinking was associated with more severe assaults in college. Because all students are at risk of being assaulted, culturally sensitive programming should be developed for students of Asian/Pacific Islander ancestry.
Fluctuations for the partition function of Ising models on Erdös–Rényi random graphs

We analyze Ising/Curie-Weiss models on the Erd\H{o}s-R\'enyi graph with $N$ vertices and edge probability $p=p(N)$ that were introduced by Bovier and Gayrard [J.\ Statist. \ Phys., 72(3-4):643--664, 1993] and investigated in two previous articles by the authors. We prove Central Limit Theorems for the partition function of the model and -- at other decay regimes of $p(N)$ -- for the logarithmic partition function. We find critical regimes for $p(N)$ at which the behavior of the fluctuations of the partition function changes.
Automatically Searching for U-Net Image Translator Architecture

Image translators have been successfully applied to many important low level image processing tasks. However, classical network architecture of image translator like U-Net, is borrowed from other vision tasks like biomedical image segmentation. This straightforward adaptation may not be optimal and could cause redundancy in the network structure. In this paper, we propose an automatic architecture searching method for image translator. By utilizing evolutionary algorithm, we investigate a more efficient network architecture which costs less computation resources and achieves better performance than the original one. Extensive qualitative and quantitative experiments are conducted to demonstrate the effectiveness of the proposed method. Moreover, we transplant the searched network architecture to other datasets which are not involved in the architecture searching procedure. Efficiency of the searched architecture on these datasets further demonstrates the generalization of the method.
Provable Meta-Learning of Linear Representations

Meta-learning, or learning-to-learn, seeks to design algorithms that can utilize previous experience to rapidly learn new skills or adapt to new environments. Representation learning---a key tool for performing meta-learning---learns a data representation that can transfer knowledge across multiple tasks, which is essential in regimes where data is scarce. Despite a recent surge of interest in the practice of meta-learning, the theoretical underpinnings of meta-learning algorithms are lacking, especially in the context of learning transferable representations. In this paper, we focus on the problem of multi-task linear regression---in which multiple linear regression models share a common, low-dimensional linear representation. Here, we provide provably fast, sample-efficient algorithms to address the dual challenges of (1) learning a common set of features from multiple, related tasks, and (2) transferring this knowledge to new, unseen tasks. Both are central to the general problem of meta-learning. Finally, we complement these results by providing information-theoretic lower bounds on the sample complexity of learning these linear features.
Using Distributional Thesaurus Embedding for Co-hyponymy Detection

Discriminating lexical relations among distributionally similar words has always been a challenge for natural language processing (NLP) community. In this paper, we investigate whether the network embedding of distributional thesaurus can be effectively utilized to detect co-hyponymy relations. By extensive experiments over three benchmark datasets, we show that the vector representation obtained by applying node2vec on distributional thesaurus outperforms the state-of-the-art models for binary classification of co-hyponymy vs. hypernymy, as well as co-hyponymy vs. meronymy, by huge margins.
Full 5D characterisation of the Sagittarius stream with Gaia DR2 RR Lyrae

Context. The Sagittarius (Sgr) stream is one of the best tools that we currently have to estimate the mass and shape of our Galaxy. However, assigning membership and obtaining the phase-space distribution of the stars that form the tails of the stream is quite challenging. Aims. Our goal is to produce a catalogue of the RR Lyrae stars of Sgr and obtain an empiric measurement of the trends along the stream in sky position, distance, and tangential velocity. Methods. We generated two initial samples from the Gaia DR2 RR Lyrae catalogue: one selecting only the stars within ±20° of the orbital plane of Sagittarius (Strip), and the other resulting from application of the Pole Count Map (nGC3) algorithm. We then used the model-independent, deterministic method developed in this work to remove most of the contamination by detecting and isolating the stream in distance and proper motions. Results. The output is two empiric catalogues: the Strip sample (higher-completeness, lower-purity) which contains 11 677 stars, and the nGC3 sample (higher-purity, lower-completeness) with 6608 stars. We characterise the changes along the stream in all the available dimensions, namely the five astrometric dimensions plus the metallicity, covering more than 2π rad in the sky, and obtain new estimates for the apocentres and the mean [Fe/H] of the RR Lyrae population. Also, we show the first map of the two components of the tangential velocity thanks to the combination of distances and proper motions. Finally, we detect the bifurcation in the leading arm and report no significant difference between the two branches in terms of metallicity, kinematics, or distance. Conclusions. We provide the largest sample of RR Lyrae candidates of Sgr, which can be used as input for a spectroscopic follow-up or as a reference for the new generation of models of the stream through the interpolators in distance and velocity that we constructed.
Lipschitz standardization for robust multivariate learning

Current trends in machine learning rely on out-of-the-box gradient-based approaches. With the aim of mitigating numerical errors and to improve the convergence of the learning process, a common empirical practice is to standardize or normalize the data. However, there is a lack of theoretical analysis regarding why and when these methods result in an improvement of the learning process. In this work, we first study these methods in the context of black-box variational inference, specifically analyzing the effect that scaling the data has on the smoothness of the optimization landscape. Our analysis shows that no general rule applies in order to decide which of the existing data scaling methods, or even if they, will improve the learning process. Second, we highlight the issues that arise when dealing with multivariate data, due to the discrepancy in smoothness of the likelihood functions for different variables, and the inability to scale discrete data. Finally, we propose a novel Lipschitz standardization, and its extension for discrete data, which overcomes the aforementioned limitations. Specifically, as backed by our experiments, Lipschitz standardization i) favors a fairer learning across different variables in the data; and ii) results in faster and more accurate learning.
Mobility and Blockage-Aware Communications in Millimeter-Wave Vehicular Networks

Mobility may degrade the performance of next-generation vehicular networks operating at the millimeter-wave spectrum: frequent mis-alignment and blockages require repeated beam-training and handover, with enormous overhead. Nevertheless, mobility induces temporal correlations in the communication beams and in blockage events. In this paper, an adaptive design is proposed, that learns and exploits these temporal correlations to reduce the beam-training overhead and make handover decisions. At each time-slot, the serving base station (BS) decides to perform either beam-training, data communication, or handover, under uncertainty in the system state. The decision problem is cast as a partially observable Markov decision process, with the goal to maximize the throughput delivered to the user, under an average power constraint. To address the high-dimensional optimization, an approximate constrained point-based value iteration (C-PBVI) method is developed, which simultaneously optimizes the primal and dual functions to meet the power constraint. Numerical results demonstrate a good match between the analysis and a simulation based on 2D mobility and 3D analog beamforming via uniform planar arrays at both BSs and UE, and reveal that C-PBVI performs near-optimally, and outperforms a baseline scheme with periodic beam-training by 38% in spectral efficiency. Motivated by the structure of C-PBVI, two heuristics are proposed, that trade complexity with sub-optimality, and achieve only 4% and 15% loss in spectral efficiency. Finally, the effect of mobility and multiple users on blockage dynamics is evaluated numerically, demonstrating superior performance over the baseline scheme.
The effect of the environment-dependent IMF on the formation and metallicities of stars over the cosmic history

Recent observational and theoretical studies indicate that the stellar initial mass function (IMF) varies systematically with the environment (star formation rate – SFR, metallicity). Although the exact dependence of the IMF on those properties is likely to change with improving observational constraints, the reported trend in the shape of the IMF appears robust. We present the first study aiming to evaluate the effect of the IMF variations on the measured cosmic SFR density (SFRD) as a function of metallicity and redshift,fSFR(Z,z). We also study the expected number and metallicity of white dwarf, neutron star, and black hole progenitors under different IMF assumptions. Applying the empirically driven IMF variations described by the integrated galactic IMF (IGIMF) theory, we revisefSFR(Z,z) obtained in our previous study that assumed a universal IMF. We find a lower SFRD at high redshifts and a higher fraction of metal-poor stars being formed than previously determined. In the local Universe, our calculation applying the IGIMF theory suggests more white dwarf and neutron star progenitors in comparison with the universal IMF scenario, while the number of black hole progenitors remains unaffected.
Big Quantum cohomology of orbifold spheres

We construct a Kodaira-Spencer map from the big quantum cohomology of a sphere with three orbifold points to the Jacobian ring of the mirror Landau-Ginzburg potential function. This is constructed via the Lagrangian Floer theory of the Seidel Lagrangian and we show that Kodaira-Spencer map is a ring isomorphism.
A General Framework for Ensemble Distribution Distillation

Ensembles of neural networks have shown to give better predictive performance and more reliable uncertainty estimates than individual networks. Additionally, ensembles allow the uncertainty to be decomposed into aleatoric (data) and epistemic (model) components, giving a more complete picture of the predictive uncertainty. Ensemble distillation is the process of compressing an ensemble into a single model, often resulting in a leaner model that still outperforms the individual ensemble members. Unfortunately, standard distillation erases the natural uncertainty decomposition of the ensemble. We present a general framework for distilling both regression and classification ensembles in a way that preserves the decomposition. We demonstrate the desired behaviour of our framework and show that its predictive performance is on par with standard distillation.
Intrinsic Construction of Lyapunov Functions on Riemannian Manifold

For systems evolving on a Riemannian manifold, we propose converse Lyapunov theorems for asymptotic and exponential stability. The novelty of the proposed approach is that is does not rely on local Euclidean coordinate, and is thus valid on a wider domain than the immediate vicinity of the considered equilibrium. We also show how the constructions can be useful for robustness analysis.
The distinct stellar-to-halo mass relations of satellite and central galaxies: insights from the IllustrisTNG simulations

We study the stellar-to-halo mass relation (SHMR) for central and satellite galaxies with total dynamical masses above $10^{10.5}\, \rm {M}_\odot$ using the suite of cosmological magnetohydrodynamical simulations IllustrisTNG. In particular, we quantify environmental effects on satellite populations from TNG50, TNG100, and TNG300 located within the virial radius of group- and cluster-like hosts with total masses of $10^{12\! -\! 15.2}\, \rm {M}_\odot$. At fixed stellar mass, the satellite SHMR exhibits a distinct shift towards lower dynamical mass compared to the SHMR of centrals. Conversely, at fixed dynamical mass, satellite galaxies appear to have larger stellar-to-total mass fractions than centrals by up to a factor of a few. The systematic deviation from the central SHMR is larger for satellites in more massive hosts, at smaller cluster-centric distances, with earlier infall times, and that inhabits higher local density environments; moreover, it is in place already at early times (z ≲ 2). Systematic environmental effects might contribute to the perceived galaxy-to-galaxy variation in the measured SHMR when galaxies cannot be separated into satellites and centrals. The SHMR of satellites exhibits a larger scatter than centrals (by up to ∼0.8 dex), over the whole range of dynamical mass. The shift of the satellite SHMR results mostly from tidal stripping of their dark matter, which affects satellites in an outside-in fashion: The departure of the satellite SHMR from the centrals’ relation diminishes for measurements of dynamical mass in progressively smaller apertures. Finally, we provide a family of fitting functions for the SHMR predicted by IllustrisTNG.
Smooth bang-bang shortcuts to adiabaticity for atomic transport in a moving harmonic trap

Bang-bang control is often used to implement a minimal-time shortcut to adiabaticity for efficient transport of atoms in a moving harmonic trap. However, drastic changes of the on-off controller, leading to high transport-mode excitation and energy consumption, become infeasible under realistic experimental conditions. To circumvent these problems, we propose smooth bang-bang protocols with near-minimal time, by setting the physical constraints on the relative displacement, speed, and acceleration between the mass center of the atom and the trap center. We adopt Pontryagin's maximum principle to obtain the analytical solutions of smooth bang-bang protocol for near-time-minimal control. More importantly, it is found that the energy excitation and sloshing amplitude are significantly reduced at the expense of operation time. We also present a multiple shooting method for the self-consistent numerical analysis. Finally, this method is applied to other tasks, e.g., energy minimization, where obtaining smooth analytical form is complicated.
Intensive use of computing resources for dominations in grids and other combinatorial problems

Nous cherchons a prouver de nouveaux resultats en theorie des graphes et combinatoire grâce a la vitesse de calcul des ordinateurs, couplee a des algorithmes astucieux. Nous traitons quatre problemes. Le theoreme des quatre couleurs affirme que toute carte d’un monde ou les pays sont connexes peut etre coloriee avec 4 couleurs sans que deux pays voisins aient la meme couleur. Il a ete le premier resultat prouve en utilisant l'ordinateur, en 1989. Nous souhaitions automatiser encore plus cette preuve. Nous expliquons la preuve et fournissons un programme qui permet de la reetablir, ainsi que d'etablir d'autres resultats avec la meme methode. Nous donnons des pistes potentielles pour automatiser la recherche de regles de dechargement.Nous etudions egalement les problemes de domination dans les grilles. Le plus simple est celui de la domination. Il s'agit de mettre des pierres sur certaines cases d'une grille pour que chaque case ait une pierre, ou ait une voisine qui contienne une pierre. Ce probleme a ete resolu en 2011 en utilisant l’ordinateur pour prouver une formule donnant le nombre minimum de pierres selon la taille de la grille. Nous adaptons avec succes cette methode pour la premiere fois pour des variantes de la domination. Nous resolvons partiellement deux autres problemes et fournissons des bornes inferieures pour ces problemes pour les grilles de taille arbitraire.Nous nous sommes aussi penches sur le denombrement d’ensembles dominants. Combien y a-t-il d’ensembles dominant une grille donnee ? Nous etudions ce probleme de denombrement pour la domination et trois variantes. Nous prouvons l'existence de taux de croissance asymptotiques pour chacun de ces problemes. Pour chaque, nous donnons en plus un encadrement de son taux de croissance asymptotique.Nous etudions enfin les polyominos, et leurs facons de paver des rectangles. Il s'agit d'objets generalisant les formes de Tetris : un ensemble de carres connexe (« en un seul morceau »). Nous avons attaque un probleme pose en 1989 : existe-t-il un polyomino d'ordre impair ? Il s'agit de trouver un polyomino qui peut paver un rectangle avec un nombre impair de copies, mais ne peut paver de rectangle plus petit. Nous n'avons pas resolu ce probleme, mais avons cree un programme pour enumerer les polyominos et essayer de trouver leur ordre, en eliminant ceux ne pouvant pas paver de rectangle. Nous etablissons aussi une classification, selon leur ordre, des polyominos de taille au plus 18.