Miracle-dz/UniFAR-FTUs huggingface dataset:
Transformed Subspace Clustering

Subspace clustering assumes that the data is separable into separate subspaces. Such a simple assumption, does not always hold. We assume that, even if the raw data is not separable into subspaces, one can learn a representation (transform coefficients) such that the learnt representation is separable into subspaces. To achieve the intended goal, we embed subspace clustering techniques (locally linear manifold clustering, sparse subspace clustering and low rank representation) into transform learning. The entire formulation is jointly learnt; giving rise to a new class of methods called transformed subspace clustering (TSC). In order to account for non-linearity, kernelized extensions of TSC are also proposed. To test the performance of the proposed techniques, benchmarking is performed on image clustering and document clustering datasets. Comparison with state-of-the-art clustering techniques shows that our formulation improves upon them.
Accelerated Sampling on Discrete Spaces with Non-Reversible Markov Processes

We consider the task of MCMC sampling from a distribution defined on a discrete space. Building on recent insights provided in [Zan19], we devise a class of efficient continuous-time, non-reversible algorithms which make active use of the structure of the underlying space. Particular emphasis is placed on how symmetries and other group-theoretic notions can be used to improve exploration of the space. We test our algorithms on a range of examples from statistics, computational physics, machine learning, and cryptography, which show improvement on alternative algorithms. We provide practical recommendations on how to design and implement these algorithms, and close with remarks on the outlook for both discrete sampling and continuous-time Monte Carlo more broadly.
Counterexamples to the local-global principle for non-singular plane curves and a cubic analogue of Ankeny-Artin-Chowla-Mordell conjecture

In this article, we introduce a systematic and uniform construction of non-singular plane curves of odd degrees $n \geq 5$ which violate the local-global principle. Our construction works unconditionally for $n$ divisible by $p^2$ for some odd prime number $p$. Moreover, our construction also works for $n$ divisible by some $p \geq 5$ which satisfies a conjecture on $p$-adic properties of the fundamental units of $\mathbb{Q}(p^{1/3})$ and $\mathbb{Q}((2p)^{1/3})$. This conjecture is a natural cubic analogue of the classical Ankeny-Artin-Chowla-Mordell conjecture for $\mathbb{Q}(p^{1/2})$ and easily verified numerically.
OpenBioLink: A resource and benchmarking framework for large-scale biomedical link prediction

Summary: Recently, novel machine-learning algorithms have shown potential for predicting undiscovered links in biomedical knowledge networks. However, dedicated benchmarks for measuring algorithmic progress have not yet emerged. With OpenBioLink, we introduce a large-scale, high-quality and highly challenging biomedical link prediction benchmark to transparently and reproducibly evaluate such algorithms. Furthermore, we present preliminary baseline evaluation results. Availability and Implementation: Source code, data and supplementary ﬁles are openly available at
The Influence of Stellar Contamination on the Interpretation of Near-infrared Transmission Spectra of Sub-Neptune Worlds around M-dwarfs

The impact of unocculted stellar surface heterogeneities in the form of cool spots and hot faculae on the spectrum of a transiting planet has been a daunting problem for the characterization of exoplanet atmospheres. The wavelength-dependent nature of stellar surface heterogeneities imprinting their signatures on planetary transmission spectra are of concern particularly for systems of sub-Neptunes orbiting M-dwarfs. Here we present a systematic exploration of the impact of this spot-contamination on simulated near-infrared transmission spectra of sub-Neptune planets. From our analysis, we find that improper correction for stellar surface heterogeneities on transmission spectra can lead to significant bias when inferring planetary atmospheric properties. However, this bias is negligible for lower fractions of heterogeneities (<1%). Additionally, we find that acquiring a priori knowledge of stellar heterogeneities does not improve precision in constraining planetary parameters if the heterogeneities are appropriately marginalized within a retrieval; however, these are conditional on our confidence of stellar atmospheric models being accurate representations of the true photosphere. In sum, to acquire unbiased constraints when characterizing planetary atmospheres with the James Webb Space Telescope, we recommend performing joint retrievals of both the disk-integrated spectrum of the star and the stellar-contamination-corrected transmission spectrum.
Efficient approximation of high-dimensional functions with deep neural networks

In this paper, we develop a framework for showing that neural networks can overcome the curse of dimensionality in different high-dimensional approximation problems. Our approach is based on the notion of a catalog network, which is a generalization of a standard neural network in which the nonlinear activation functions can vary from layer to layer as long as they are chosen from a predefined catalog of functions. As such, catalog networks constitute a rich family of continuous functions. We show that under appropriate conditions on the catalog, catalog networks can efficiently be approximated with ReLU-type networks and provide precise estimates on the number of parameters needed for a given approximation accuracy. As special cases of the general results, we obtain different classes of functions that can be approximated with ReLU networks without the curse of dimensionality.
Winning the Lottery with Continuous Sparsification

The Lottery Ticket Hypothesis conjectures that, for a typically-sized neural network, it is possible to find small sub-networks that, when trained from scratch, match the performance of the dense counterpart given a comparable training budget. The proposed algorithm to search for winning tickets, Iterative Magnitude Pruning, consistently finds sparse sub-networks which train faster and better than the overparameterized models they were extracted from, creating potential applications to problems such as transfer learning. In this paper, we propose Continuous Sparsification, a new algorithm to search for winning tickets which continuously removes parameters from a network during training, and learns the sub-network's structure with gradient-based methods instead of relying on pruning strategies. We show empirically that our method is capable of finding tickets that are sparser than the ones found by Iterative Magnitude Pruning, while achieving higher performance when trained from scratch. Moreover, our method can be efficiently parallelized, decreasing the ticket search cost measured in wall-clock time significantly given enough parallel computing resources.
Infinite families of 2-designs from a class of non-binary Kasami cyclic codes

<p style='text-indent:20px;'>Combinatorial <inline-formula><tex-math id="M1">\begin{document}$ t $\end{document}</tex-math></inline-formula>-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and <inline-formula><tex-math id="M2">\begin{document}$ t $\end{document}</tex-math></inline-formula>-designs has been attracted a lot of attention for both directions. It is well known that a linear code over any finite field can be derived from the incidence matrix of a <inline-formula><tex-math id="M3">\begin{document}$ t $\end{document}</tex-math></inline-formula>-design, meanwhile, that the supports of all codewords with a fixed weight in a code also may hold a <inline-formula><tex-math id="M4">\begin{document}$ t $\end{document}</tex-math></inline-formula>-design. In this paper, by determining the weight distribution of a class of linear codes derived from non-binary Kasami cyclic codes, we obtain infinite families of <inline-formula><tex-math id="M5">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>-designs from the supports of all codewords with a fixed weight in these codes, and calculate their parameters explicitly. </p>
Adaptive Manifold Clustering

We extend the theoretical study of a recently proposed nonparametric clustering algorithm called Adaptive Weights Clustering (AWC). In particular, we are interested in the case of high-dimensional data lying in the vicinity of a lower-dimensional non-linear submanifold with positive reach. After a slight adjustment and under rather general assumptions for the cluster structure, the algorithm turns out to be nearly optimal in detecting local inhomogeneities, while aggregating homogeneous data with a high probability. We also adress the problem of parameter tuning.
Car Pose in Context: Accurate Pose Estimation with Ground Plane Constraints

Scene context is a powerful constraint on the geometry of objects within the scene in cases, such as surveillance, where the camera geometry is unknown and image quality may be poor. In this paper, we describe a method for estimating the pose of cars in a scene jointly with the ground plane that supports them. We formulate this as a joint optimization that accounts for varying car shape using a statistical atlas, and which simultaneously computes geometry and internal camera parameters. We demonstrate that this method produces significant improvements for car pose estimation, and we show that the resulting 3D geometry, when computed over a video sequence, makes it possible to improve on state of the art classification of car behavior. We also show that introducing the planar constraint allows us to estimate camera focal length in a reliable manner.
Galaxy interactions in IllustrisTNG-100, I: The power and limitations of visual identification

We present a sample of 446 galaxy pairs constructed using the cosmological simulation IllustrisTNG-100 at z = 0, with M$_{\rm FoF,dm} = 10^{11}\! -\! 10^{13.5}$ M⊙. We produce ideal mock SDSS g-band images of all pairs to test the reliability of visual classification schema employed to produce samples of interacting galaxies. We visually classify each image as interacting or not based on the presence of a close neighbour, the presence of stellar debris fields, disturbed discs, and/or tidal features. By inspecting the trajectories of the pairs, we determine that these indicators correctly identify interacting galaxies ∼45 per cent of the time. We subsequently split the sample into the visually identified interacting pairs (VIP; 38 pairs) and those which are interacting but are not visually identified (nonVIP; 47 pairs). We find that VIP have undergone a close passage nearly twice as recently as the non-VIP, and typically have higher stellar masses. Further, the VIP sit in dark matter haloes that are approximately 2.5 times as massive, in environments nearly 2 times as dense, and are almost a factor of 10 more affected by the tidal forces of their surroundings than the nonVIP. These factors conspire to increase the observability of tidal features and disturbed morphologies, making the VIP more likely to be identified. Thus, merger rate calculations which rely on stellar morphologies are likely to be significantly biased toward massive galaxy pairs which have recently undergone a close passage.
Spectrum prediction and interference detection for satellite communications

Spectrum monitoring and interference detection are crucial for the satellite service performance and the revenue of SatCom operators. Interference is one of the major causes of service degradation and deficient operational efficiency. Moreover, the satellite spectrum is becoming more crowded, as more satellites are being launched for different applications. This increases the risk of interference, which causes anomalies in the received signal, and mandates the adoption of techniques that can enable the automatic and real-time detection of such anomalies as a first step towards interference mitigation and suppression. In this paper, we present a Machine Learning (ML)-based approach able to guarantee a real-time and automatic detection of both short-term and long-term interference in the spectrum of the received signal at the base station. The proposed approach can localize the interference both in time and in frequency and is universally applicable across a discrete set of different signal spectra. We present experimental results obtained by applying our method to real spectrum data from the Swedish Space Corporation. We also compare our ML-based approach to a model-based approach applied to the same spectrum data and used as a realistic baseline. Experimental results show that our method is a more reliable interference detector.
Amending the halo model to satisfy cosmological conservation laws

One of the most powerful tools in the arsenal of theoretical cosmologists is the halo model of large scale structure, which provides a phenomenological description of nonlinear structure in our universe. However, it is well known that there is no simple way to impose conservation laws in the halo model. This can severely impair the predictions on large scales for observables such as weak lensing or the kinematic Sunyaev-Zel'dovich effect, which should satisfy mass and momentum conservations, respectively. For example, the standard halo model overpredicts weak lensing power spectrum by $> 8\%$ on scales $>20$ degrees. To address this problem, we present an $Amended ~ Halo ~ Model$, explicitly separating the linear perturbations from $compensated$ halo profiles. This is guaranteed to respect conservation laws, as well as linear theory predictions on large scales. We then provide a simple fitting function for the compensated halo profiles, and discuss the modified predictions for 1-halo and 2-halo terms, as well as other cosmological observations such weak lensing power spectrum. Furthermore, we argue that the amended halo model provides a more accurate framework to capture physical effects that happen in the process of cosmological structure formation.
Presencia de angiogénesis en placas vulnerables ateroscleróticas en corazones humanos aparentemente sanos

Introduccion La angiogenesis o neovascularizacion involucra la formacion de nuevos conductos en las adyacencias de vasos preexistentes. Esta proliferacion vascular es frecuente en varias circunstancias clinicas, como es el caso de la aterosclerosis. Los microvasos de las placas ateroscleroticas coronarias pueden estar vinculados a la inestabilidad de la lesion. Objetivo Correlacionar la presencia de angiogenesis en placas ateroscleroticas con los criterios de vulnerabilidad de la clasificacion de la American Heart Association (AHA). Material y metodos En 121 corazones de donantes no diabeticos aparentemente sanos y mayores de 40 anos destinados para homoinjertos se examinaron las arterias coronarias y todas las areas de estrechamiento luminal se sometieron a estudios histologicos, inmunohistoquimicos y morfometricos. Para el analisis de la angiogenesis se empleo un puntaje semicuantitativo (escala 0-3). Se realizo un analisis de regresion logistica univariado y multivariado para identificar factores de riesgo relacionados con la angiogenesis. Resultados Se hallaron 143 lesiones de riesgo alto (AHA tipos IV, V y VI) en las arterias descendente anterior (46,3%), circunfleja (28,9%) y coronaria derecha (43%). La angiogenesis se asocio en forma estadisticamente significativa con el grado de oclusion vascular, la infiltracion de celulas inflamatorias, la presencia de centro lipidico, la fibrosis, la periarteritis y, solo en la descendente anterior, con el antecedente de hipertension arterial (p < 0,006). Se detecto angiogenesis en 1 placa tipo II, en 5 tipo III, en 21 tipo IV, en 22 tipo V y en 7 placas tipo VI (AHA). Conclusiones La angiogenesis de placas vulnerables se asocio con el grado de oclusion vascular, la infiltracion de celulas inflamatorias, la fibrosis, la presencia de nucleo lipidico y, solo en la descendente anterior, con el antecedente de hipertension arterial. No se encontro asociacion con la hemorragia intraplaca o la calcificacion, lo cual sugiere que la angiogenesis puede anticipar la rotura de las placas.
Typ-1-Interferonopathien

Zusammenfassung Die Aufklärung der genetischen Ursachen des Aicardi-Goutières-Syndroms und des familiären Chilblain-Lupus hat zur Identifizierung neuer pathophysiologischer Mechanismen beigetragen, die primär über das angeborene Immunsystem vermittelt werden und zu Autoinflammation und Autoimmunität führen. Diese als Typ-1-Interferonopathien bezeichneten seltenen Erkrankungen sind durch eine Dysregulation der Typ-1-Interferon (IFN)-Achse gekennzeichnet, die in einer inadäquaten Typ-1-IFN-Aktivierung resultiert. Die bisher gewonnenen Einblicke in die molekulare Pathogenese der Typ-1-Interferonopathien haben auch hohe Relevanz für unser Verständnis multifaktoriell bedingter Autoimmunkrankheiten wie dem systemischen Lupus erythematodes und können als Ausgangspunkt für die Entwicklung neuer kausal orientierter Therapieansätze dienen.
The reversibility of atherosclerosis.

transfusion. Such a point of view would be hard to sustain if a matter of extra days in hospital is balanced against the fact that transfusion is not the answer to iron-deficiency anaemia and that risks are involved in the administration of blood. It would not be difficult, in any case, to obviate a long stay in hospital if the presence of iron deficiency were appreciated at the first office or clinic visit when iron could be prescribed and the blood picture restored to normal prior to admission; indeed, it follows that bed occupancy would be lessened because the few days required for pre-operative transfusions would be eliminated. It remains only to sound a note of caution. In a patient with menorrhagia and hypochromic anamia, response to iron may alleviate menstrual loss pari passu with improvement of the anaemia. Even in the absence of any palpable abnormality of the pelvic organs, the assumption must not then be made that no lesion exists; curettage should still be carried out and smears made for cytological study. Nor should the physician fail to satisfy himself that there is no other source of blood loss, from the gastro-intestinal tract in particular, which might initiate the entire cycle of events.
Pre-Osteoarthritis

Objective An attempt to define pre-osteoarthritis (OA) versus early OA and definitive osteoarthritis. Methods A group of specialists in the field of cartilage science and treatment was formed to consider the nature of OA onset and its possible diagnosis. Results Late-stage OA, necessitating total joint replacement, is the end stage of a biological process, with many previous earlier stages. Early-stage OA has been defined and involves structural changes identified by arthroscopy or radiography. The group argued that before the “early-stage OA” there must exist a stage where cellular processes, due to the presence of risk factors, have kicked into action but have not yet resulted in structural changes. The group suggested that this stage could be called “pre-osteoarthritis” (pre-OA). Conclusions The group suggests that defining points of initiation for OA in the knee could be defined, for example, by traumatic episodes or surgical meniscectomy. Such events may set in motion metabolic processes that could be diagnosed by modern MRI protocols or arthroscopy including probing techniques before structural changes of early OA have developed. Preventive measures should preferably be applied at this pre-OA stage in order to stop the projected OA “epidemic. ”
A novel approach for solving a variant of Transportation Problem

In this article we consider a certain sub class of Integer Equal Flow problem, which are known NP hard [8]. Currently there exist no direct solutions for the same. It is a common problem in various inventory management systems. Here we discuss a local minima solution which uses projection of the convex spaces to resolve the equal flows and turn the problem into a known linear integer programming or constraint satisfaction problem which have reasonable known solutions and can be effectively solved using simplex or other standard optimization strategies. Keywords— Integer Equal Flow, Transportation, Constraint Satisfaction
Primary neuroblastoma of the central nervous system with spontaneous extracranial metastases: Case report

✓ A case of spontaneous extracranial metastases from a cerebral neuroblastoma in the absence of prior surgery is reported. The tumor was discovered incidently through biopsy of an enlarged retro-auricular lymph node in an apparently well 7-year-old boy who had not previously received surgery or radiotherapy. The patient died 15 months later. Autopsy excluded neuroblastoma of the adrenal glands or the sympathetic chains.
The ABO and Rhesus blood groups in Perthes' disease

Determinations were carried out of the ABO blood groups and Rhesus phenotypes of a series of 142 children with Perthes' disease. Where possible their parents and sibs were also grouped. Sera from the mothers of affected children were examined for the presence of Rhesus antibodies. No apparent association was demonstrated between Perthes' disease and any ABO phenotype. The disease is also apparently independent of ABO incompatibility between mother and child. There is the suggestion in these families of an increased incidence of the Rhesus cc phenotype among the affected children. The level of significance is estimated at 0·02, even after taking into account the numerous significance tests possible on the data. Parental and sibship studies show that any association between Perthes' disease and the Rhesus Cc phenotypes, if one does exist, is unlikely to be the product of genetical stratification within the population. Maternal Rhesus antibody, acting through the agency of haemolytic disease of the newborn, plays no detectable part in the aetiology of a subsequently developing Perthes' disease in the child.
Full-Mouth-Disinfection

Die Prävalenz der chronisch entzündlichen Erkrankungen des Parodontiums ist in Deutschland seit 1997 gestiegen, was in den niedergelassenen Praxen zu einem erhöhten Behandlungsaufkommen führen wird (Abb.1). Für die nicht chirurgische, ursachengerichtete Therapie der chronischen Parodontitis existieren neben der seit Jahrzehnten etablierten Behandlung mittels quadrantenweiser Wurzeloberflächenbearbeitung (Scaling und Rootplaning) seit einigen Jahren alternative Behandlungskonzepte, die sogenannte FullMouth-Disinfection und das Full-Mouth-Scaling. Im Rahmen der zahnmedizinischen Versorgung sollten die zur Verfügung stehenden Ressourcen für die Parodontitistherapie sinnvoll eingesetzt werden, um sowohl eine Unterals auch eine Überversorgung zu vermeiden. Als Entscheidungshilfe bei der Frage, welche der genannten Parodontitistherapien am besten geeignet ist, soll vor diesem Hintergrund die zurzeit bestehende Evidenz skizziert werden. Grundlagen der Parodontitistherapie