Miracle-dz/UniFAR-FTUs huggingface dataset:
Cech homology for shape recognition in the presence of occlusions

In Computer Vision the ability to recognize objects in the presence of occlusions is a necessary requirement for any shape representation method. In this paper we investigate how the size function of a shape changes when a portion of the shape is occluded by another shape. More precisely, considering a set X = A ∪ B and a measuring function ϕ on X, we establish a condition so that l(X,ϕ) = l(A,ϕ|A) + l(B,ϕ|B) − l(A∩B,ϕ|A∩B). The main tool we use is the Mayer-Vietoris sequence of ˇ Cech homology groups. This result allows us to prove that size functions are able to detect partial matching between shapes by showing a common subset of cornerpoints.
Nonlinear dynamics of phase separation in ultra-thin films

We present a long-wavelength approximation to the Navier-Stokes Cahn-Hilliard equations to describe phase separation in thin films. The equations we derive underscore the coupled behaviour of free-surface variations and phase separation. Since we are interested in the long-time behaviour of the phase-separating fluid, we restrict our attention to films that do not rupture. To do this, we introduce a regularising Van der Waals potential. We analyse the resulting fourth-order equations by constructing a solution as the limit of a Galerkin approximation, and obtain existence and regularity results. In our analysis, we find a nonzero lower bound for the height of the film, which precludes the possibility of rupture. The lower bound depends on the parameters of the problem, and we compare this dependence with numerical simulations. We find that while the theoretical lower bound is crucial to the construction of a smooth, unique solution to the PDEs, it is not sufficiently sharp to represent accurately the parametric dependence of the observed dips in free-surface height.
Molecular cloning and characterization of the mouse Na + sulfate cotransporter gene ( Slc 13 a 4 ) : structure and expression

Sulfate is an essential ion required for numerous functions in mammalian physiology. Due to its hydrophilic nature, cells require sulfate transporters on their plasma membranes to allow entry of sulfate into cells. In this study, we identified a new mouse Na + -sulfate cotransporter (mNaS2), characterized its tissue distribution and determined its cDNA and gene ( Slc13a4 ) structures. mNaS2 mRNA was expressed in placenta, brain, lung, eye, heart, testis, thymus and liver. The mouse NaS2 cDNA spans 3384 nucleotides and its open frame encodes a protein of 624 amino acids. Slc13a4 maps to mouse chromosome 6B1 and contains 16 exons, spanning over 40 kb in length. Its 5’-flanking region contains CAATand GC-box motifs and a number of putative transcription factor binding sites, including GATA-1, MTF-1, STAT6 and HNF4 consensus sequences. This is the first study to define the tissue distribution of mNaS2 and resolve its cDNA and gene structures, which will allow us to investigate mNaS2 gene expression in vivo and determine its role in mammalian physiology.
Log-Sobolev inequalities: Different roles of Ric and Hess

Let $P_t$ be the diffusion semigroup generated by $L:=\Delta +\nabla V$ on a complete connected Riemannian manifold with $\operatorname {Ric}\ge-(\sigma ^2\rho_o^2+c)$ for some constants $\sigma, c>0$ and $\rho_o$ the Riemannian distance to a fixed point. It is shown that $P_t$ is hypercontractive, or the log-Sobolev inequality holds for the associated Dirichlet form, provided $-\operatorname {Hess}_V\ge\delta$ holds outside of a compact set for some constant $\delta >(1+\sqrt{2})\sigma \sqrt{d-1}. $ This indicates, at least in finite dimensions, that $\operatorname {Ric}$ and $-\operatorname {Hess}_V$ play quite different roles for the log-Sobolev inequality to hold. The supercontractivity and the ultracontractivity are also studied.
Constraint-based temporal reasoning algorithms with applications to planning

A number of systems and applications model time explicitly and so require expressive temporal formalisms and efficient reasoning algorithms. In particular, an increasing number of planning systems deal with metric, quantitative time. This dissertation presents a set of new, efficient, provably correct algorithms for expressive temporal reasoning, based on the use of constraint satisfaction problems and techniques, and demonstrates how they can be used to improve the expressiveness and efficiency of planning and execution systems. First, the Disjunctive Temporal Problem (DTP) is examined. The DTP is a very powerful and expressive constraint-based, quantitative temporal reasoning formalism that subsumes a number of other previous formalisms, and is capable of representing many planning and scheduling problems. A new algorithm for solving DTPs is presented, and fully implemented in a system called Epilitis. This algorithm achieves significant performance improvement (two orders of magnitude on benchmark problem sets containing randomly generated problems) relative to previous state-of-the-art solvers. In addition, DTP solving is thoroughly examined: alternative solving techniques are investigated, classified, and theoretically analyzed. In addition to solving DTPs, the execution and dispatching of plans encoded as DTPs is addressed. A novel dispatch algorithm for such plans is presented; amongst other desirable properties, it retains all the available flexibility in the occurrence of events during execution. This is the first known dispatch algorithm for DTPs. Next, new constraint-based temporal formalisms are defined that allow, for the first time, the representation of temporal and conditional plans, dealing simultaneously with the uncertainty of the outcome of observations and with expressive temporal constraints. The formalisms are named the Conditional Simple Temporal Problem (CSTP) and the Conditional Disjunctive Temporal Problem (CDTP). Appropriate consistency checking algorithms accompany the definitions. In addition, complexity results, theoretical analysis, and tractable subclasses are identified. We also note that both CDTP and the CSTP consistency checking can be translated to DTP consistency checking, indicating a strong theoretical connection among the various formalisms. We subsequently employ the above results in temporal reasoning to address a number of previously unsolvable problems in planning in a conceptually clear, and potentially very efficient, way. Leveraging the expressivity of our new formalisms, we present planning algorithms that can deal with richly expressive plans that include temporal constraints and conditional execution contexts. In particular we solve the problems of plan merging, plan cost optimization, and in-context plan cost evaluation.
Estimating Information Processing of Human Fast Continuous Tapping from Trajectories

Fitts studied the problem of information capacity and transfer in the speed–accuracy motor paradigm using a theoretical approach developed from Shannon and Weaver’s information theory. The information processing (bit/s) estimated in Fitts’ study is calculated from the movement time required to achieve the required task index of difficulty but is essentially different from Shannon’s information entropy. Thus, we estimated the information entropy of multiple human movement trajectories and the mutual information among trajectories for the continuous aiming task in Fitts’ paradigm. Further, we estimated the information processing moment by moment. Two methods were considered: (1) encoded values encompassing the coordinates of the three dimensions and (2) coordinate values associated with each direction in the three dimensions. Information entropy indicates the magnitude of variation at each time point, and the structure of this variation varies with the index of difficulty. The ratio of entropy to mutual information was examined, and it was found that information was processed from the first half of the trajectory in difficult tasks. In addition, since these values calculated from the encoded method were higher than those from the conventional method, this method may be able to estimate these values successfully.
Stationary distributions of a model of sympatric speciation

This paper deals with a model of sympatric speciation, that is, speciation in the absence of geographical separation, originally proposed by U. Dieckmann and M. Doebeli in 1999. We modify their original model to obtain a Fleming--Viot type model and study its stationary distribution. We show that speciation may occur, that is, the stationary distribution puts most of the mass on a configuration that does not concentrate on the phenotype with maximum carrying capacity, if competition between phenotypes is intense enough. Conversely, if competition between phenotypes is not intense, then speciation will not occur and most of the population will have the phenotype with the highest carrying capacity. The length of time it takes speciation to occur also has a delicate dependence on the mutation parameter, and the exact shape of the carrying capacity function and the competition kernel.
Teoria dei Giochi - A

Disclosed is an image sensor including one or more dummy pixels that produce a reference signal which is used to compensate for errors within the devices of the main pixel cells. In one embodiment, at least one dummy pixel is used in conjunction with other circuitry to correct for nonlinearities in the transfer characteristic of a source follower transistor within each pixel. In another embodiment, an array of dummy pixels is used to correct for leakage current within the pixels during an electronic shutter mode of operation. The two techniques can be combined whereby both threshold voltage mismatch and leakage current are compensated for.
Simultaneous tuning of cascade controllers based on nonlinear optimization

Cascade control is widely used in the process industry, especially to reject disturbances. Typically, the controller parameters in the inner and outer loops of the cascade controller structure are defined in a strict sequence. In this paper, simultaneous tuning of cascade controllers is proposed to improve the performance of the system under load disturbance. For this purpose, the cost function of a nonlinear optimization problem is formulated to minimize the effect of disturbances on the system output. In addition, robustness constraints are defined for the maximum sensitivity function to independently guarantee a robust system for inner and outer loops. In this sense, the designer can explicitly and independently address the trade-off between performance and robustness for both loops. Simulation studies illustrate the performance and effectiveness of the proposed controller design method compared to well-known methods in the literature. These results indicate that the proposed method reduces the integrated absolute error (IAE) under load disturbance by up to 58 % . In addition, experimental results from a tank-level control application in the mineral process industry illustrate the practical applicability of the proposed method. In this case, the proposed method reduces the IAE under load disturbance by 37 % .
SINGULAR COTANGENT MODEL

Abstract Any singular level of a completely integrable system (c.i.s.) with non-degenerate singularities has a singular affine structure. We shall show how to construct a simple c.i. s. around the level, having the above affine structure. The cotangent bundle of the desingularized level is used to perform the construction, and the c.i. s. obtained looks like the simplest one associated to the affine structure. This method of construction is used to provide several examples of c.i. s. with different kinds of non-degenerate singularities.
Noise variance estimation in digital images using iterative fuzzy procedure

In the field of image processing, the noise estimation is an interesting issue in the filtering action. Almost all the filters, whose aim is to reduce the image degradation, need to know the noise content to optimize their performance. This paper presents a novel method, called IFP (Iterative Fuzzy Procedure), suitable to get a very good estimation of the noise variance, which represents the noise power, in the case the noise has a Gaussian distribution. The algorithm is an iterative procedure, tuned by a regression analysis, based on the fuzzy processing of some properties of the image measuring the matching between the theoretical luminance distribution and the local one. It has been tested on many images in a wide range of the noise variance. The achieved results, compared with those obtained with some other methods proposed in literature, show that the proposed approach is always accurate also in those situations in which the other ones often fail. Key-Words: Noise variance estimation, Fuzzy processing, Regression analysis.
The Use of Monoclonal Antibody-Based Proprotein Convertase Subtilisin-Kexin Type 9 (PCSK9) Inhibitors in the Treatment of Hypercholesterolemia

In this review, we evaluated several studies in the literature to analyze the benefits and deleterious effects of the use of monoclonal antibodies (MABs)-based proprotein convertase subtilisin-kexin type 9 (PCSK9) inhibitors in patients with hypercholesterolemia. Increased low-density lipoprotein cholesterol (LDL-C) levels lead to an increase in the risk of cardiovascular (CV) disease. Statins are the cornerstones of hypercholesterolemia treatment, but the patient response may often vary, and additional therapies may be needed to control the increased LDL-C levels. MABs bind to PCSK9 receptors, causing a reduction in LDL-C levels. MAB-based PCSK9 inhibitors such as alirocumab and evolocumab have been approved for use in hypercholesterolemia in combination with statins. Studies have suggested that both alirocumab and evolocumab are effective in lowering LDL-C levels, have favorable side effect profiles, and can be administered at convenient dosing intervals; however, further double-blind, randomized trials evaluating the long-term safety and efficacy of both the agents could assist with clinical decision-making.
Undecidable propositions with Diophantine form arisen from every axiom and every theorem of Peano Arithmetic

: By constructing a provability predicate with Diophantine form in Peano Arithmetic (PA) and based on the abstract form of Gödel's Second Incompleteness Theorem, it is proved that, if PA is consistent, then for every axiom and every theorem of PA, we can construct a corresponding undecidable proposition with Diophantine form. Finally, we present a method that transforms seeking a proof of a mathematical (set theoretical, number theoretical, algebraic, geometrical, topological, etc) proposition into solving a Diophantine equation.
A symplectic Gysin sequence

We use the theory of pseudo-holomorphic quilts to establish a counterpart, in symplectic Floer homology, to the Gysin sequence for the homology of a sphere-bundle. In a motivating class of examples, this "symplectic Gysin sequence" is precisely analogous to an exact sequence describing the behaviour of Seiberg-Witten monopole Floer homology for 3-manifolds under connected sum.
A Case of Coexisting Depression and Hoarding Disorder

A hoarding disorder manifests as difficulty in discarding or letting go of items irrespective of their actual worth and persistent acquisition of items. Increasing numbers of possessions clutter active living spaces to the point where their intended use is no longer possible, leading to significant functional impairment. In the Diagnostic and Statistical Manual of Mental Disorders (DSM-V), it is classified under the category obsessive-compulsive and related disorders. First considered to be a part of obsessive-compulsive disorder, compulsive hoarding was subsequently classified as an additional dimension of the obsessive-compulsive disorder spectrum. Hoarding disorder had been largely ignored clinically until recently, despite negative consequences on individuals, families, and communities. Comorbid conditions like anxiety, depression, obsessive-compulsive disorder, post-traumatic stress disorder, and panic disorder are well known to accompany hoarding disorder. This study illustrates the case of a 35-year-old married man who was referred to a psychiatrist by his primary care physician for collecting many different objects of little or no importance. These objects were lying unorganized throughout his house and cluttering most of his living space. Some of these things were discarded by his wife, which, according to him, contributed to his emotional distress. The pattern of behavior began about 10 years earlier, and it became increasingly problematic with time. Although hoarding disorder is often underreported, it is vital to diagnose this condition as it significantly affects the individual and their family and friends. Severe hoarding can pose a number of health and safety risks, including fire hazards, tripping hazards, and health code violations.
From Omics to Multi-Omics Approaches for In-Depth Analysis of the Molecular Mechanisms of Prostate Cancer

Cancer arises following alterations at different cellular levels, including genetic and epigenetic modifications, transcription and translation dysregulation, as well as metabolic variations. High-throughput omics technologies that allow one to identify and quantify processes involved in these changes are now available and have been instrumental in generating a wealth of steadily increasing data from patient tumors, liquid biopsies, and from tumor models. Extensive investigation and integration of these data have led to new biological insights into the origin and development of multiple cancer types and helped to unravel the molecular networks underlying this complex pathology. The comprehensive and quantitative analysis of a molecule class in a biological sample is named omics and large-scale omics studies addressing different prostate cancer stages have been performed in recent years. Prostate tumors represent the second leading cancer type and a prevalent cause of cancer death in men worldwide. It is a very heterogenous disease so that evaluating inter- and intra-tumor differences will be essential for a precise insight into disease development and plasticity, but also for the development of personalized therapies. There is ample evidence for the key role of the androgen receptor, a steroid hormone-activated transcription factor, in driving early and late stages of the disease, and this led to the development and approval of drugs addressing diverse targets along this pathway. Early genomic and transcriptomic studies have allowed one to determine the genes involved in prostate cancer and regulated by androgen signaling or other tumor-relevant signaling pathways. More recently, they have been supplemented by epigenomic, cistromic, proteomic and metabolomic analyses, thus, increasing our knowledge on the intricate mechanisms involved, the various levels of regulation and their interplay. The comprehensive investigation of these omics approaches and their integration into multi-omics analyses have led to a much deeper understanding of the molecular pathways involved in prostate cancer progression, and in response and resistance to therapies. This brings the hope that novel vulnerabilities will be identified, that existing therapies will be more beneficial by targeting the patient population likely to respond best, and that bespoke treatments with increased efficacy will be available soon.
Courbes de genre 3 avec S3 comme groupe d'automorphismes

this paper is devoted to the study of curves of genus 3 with group of automorphisms the symmetric group S3, principally over finite fields, in view to obtain optimal curves. For instance, we prove that, over the finite fields of char. 3, for any elliptic curve E with j-invariant not in F_3, there exists a curve of genus 3 whose jacobian is isogeneous to E^3; we have also results in char. 7, and these curves provide many examples of optimal curves in any char. Nous etudions les courbes de genre 3 dont le groupe d'automorphismes est S3, en vue d'obtenir des courbes optimales sur les corps finis. En particulier, en car. 3, si E est unecourbe elliptique dont l'invariant n'est pas dans F_3, il existe une telle courbe de genre 3 dont la jacobienne est isogene a E^3; dans le cas de la caracteristique 7, des resultats plus partiels sont obtenus. Par ailleurs, ces courbes semblent donner experimentalement de nombreux cas de courbes optimales.
Two Sources of Deep Decadal Variability in the Central Labrador Sea Open‐Ocean Convection Region

The ventilation of the central Labrador Sea is important for the uptake of ocean tracers and carbon. Using historical ocean observations, we construct a simple multiple linear regression model that successfully reconstructs the decadal variability of the upper ∼2,000 m of the central Labrador Sea water properties based on observed indices that represent two different open‐ocean ventilation mechanisms. The first mechanism is the modification of deep ocean properties through local decadal variability of the Labrador Sea deep convective mixing. The second, more novel, mechanism is the climatological convective vertical redistribution of upper central Labrador Sea temperature and salinity anomalies associated with the nonlocal large‐scale subpolar Atlantic Multidecadal Variability and the Atlantic Meridional Overturning Circulation. The ventilated decadal central Labrador Sea signal subsequently spreads into the western subpolar North Atlantic. The results have important implications for predicting decadal ventilated signals in the Labrador Sea that are associated with the large‐scale climate variability.
A new method to quantify innervation of the ulnar intrinsic hand muscles by the anterior interosseous nerve in Martin‐Gruber anastomosis and nerve transfer surgery

It is important to quantify the amount of crossover innervation from the anterior interosseous nerve (AIN) through Martin‐Gruber anastomosis (MGA) particularly in patients with high ulnar nerve injury who undergo nerve transfer surgery. The objective of this study is to describe a novel electrophysiological method for quantifying innervation from the AIN that can be done using conventional nerve conduction study setup and commonly available software for analysis.
NON-NEGATIVE MATRIX FACTORISATION FOR NETWORK REORDERING

Non-negative matrix factorisation covers a variety of algorithms that attempt to represent a given, large, data matrix as a sum of low rank matrices with a prescribed sign pattern. There are intuitave advantages to this approach, but also theoretical and computational challenges. In this exploratory paper we investigate the use of non-negative matrix factorisation algorithms as a means to reorder the nodes in a large network. This gives a set of alternatives to the more traditional approach of using the singular value decomposition. We describe and implement a range of recently proposed algorithms and evaluate their performance on synthetically constructed test data and on a real data set arising in cancer research.