Miracle-dz/UniFAR-FTUs huggingface dataset:
Conjectures in Kahler geometry

We state a general conjecture about the existence of Kahler metrics of constant scalar curvature, and discuss the background to the conjecture 1. The equations In this article we discuss some well-known problems in Kahler geometry. The general theme is to ask whether a complex manifold admits a preferred Kahler metric, distinguished by some natural differential-geometric criterion. A paradigm is the well-known fact that any Riemann surface admits a metric of constant Gauss curvature. Much of the interest of the subject comes from the interplay between, on the one hand, the differential geometry of metrics, curvature tensors etc. and, on the other hand, the complex analytic or algebraic geometry of the manifold. This is, of course, a very large field and we make no attempt at an exhaustive account, but it seems proper to emphasise at the outset that many of these questions have been instigated by seminal work of Calabi. Let (V, ω0) be a compact Kahler manifold of complex dimension n. The Kahler forms in the class [ω0] can be written in terms of a Kahler potential ωφ = ω0+i∂∂φ. In the case when 2π[ω0] is an integral class, e φ has a geometrical interpretation as the change of metric on a holomorphic line bundle L → V . The Ricci form ρ = ρφ is −i times the curvature form of K −1 V , with the metric induced by ωφ, so [ρ] = 2πc1(V ) ∈ H(V ). In the 1950’s, Calabi [C1] initiated the study of KahlerEinstein metrics, with
dmin-based precoder applied to non-binary LDPC coded MIMO system

In this paper, we present a transmission model for a multiple-input multiple-output (MIMO) channel with perfect channel state information (CSI). We intend to exploit the available CSI through the use of a precoder based on the minimum Euclidean distance (dmin) criterion. We also introduce a low density parity check coding block in order to improve the system performance. We consider a two-stream 4QAM-MIMO transmission scheme (4 bits per transmitted symbol vector) associated to a non-binary LDPC (NB-LDPC) code over GF(24). The addition of the precoder in this system is studied. Simulations are made in order to show the interest of the association of the dmin-based precoder with NB-LDPC codes, which is particularly well suited for LDPC codes with high rates.
La succession dans les PME familiales : Une réflexion sur l’état de nos connaissances et sur nos modes d’intervention

Considérées comme «les organisations les plus vieilles au monde et les plus répandues», on estime encore aujourd’hui qu’au moins 70% de toutes les entreprises sont «familiales». Présentes dans tous les secteurs d’activités, au Canada seulement elles généreraient 45% du PNB, procureraient de l’emploi à 50% de la maind’œuvre et créeraient annuellement entre 70% et 85% des nouveaux emplois. Or, qu’elles soient canadiennes, américaines ou européennes, un grand nombre de ces entreprises, souvent fondées après la seconde guerre mondiale, sont à l’heure actuelle confrontées à une problématique de taille, celle de la succession. Plusieurs entrepreneurs, maintenant à la tête de PME familiales, sont donc préoccupés à la fois par la préparation de leur retrait imminent des affaires liées aux entreprises qu’ils ont menées de mains de maîtres durant plusieurs années et par la mise en place d’une relève pouvant en assurer la continuité.
E cient Support for Irregular Applicationson Distributed-Memory Machines

Irregular computation problems underlie many important sci-entiic applications. Although these problems are computa-tionally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type of parallel program diicult to write and adversely aaects run-time performance. This paper explores three issues|partitioning, mutual exclusion , and data transfer|crucial to the eecient execution of irregular problems on distributed-memory machines. Unlike previous work, we studied the same programs running in three alternative systems on the same hardware base (a Thinking Machines CM-5): the CHAOS irregular application library, Transparent Shared Memory (TSM), and eXtensible Shared Memory (XSM). CHAOS and XSM performed equivalently for all three applications. Both systems were somewhat (13%) to signiicantly faster (991%) than TSM.
Context Map for Navigating the Physical World

Pervasive computing environments are composed of numerous smart entities (objects and human alike) which are interconnected through contextual links in order to create a Web of physical objects. The contextual links can be based on matching context attribute-values (e.g., co-location) or social connections. We call such a Web of smart physical objects as context map. Context maps can be used for context-aware search and browse of the physical world. However, changes of dynamic context values over time may render a context map inconsistent. So, it is important to update contextual links with changes in specific context values. Given the asynchronous nature of pervasive environments, it is non-trivial to detect events generated by contextual changes in real time. We propose two algorithms for instantaneous and periodic detection of events with concurrent timing relations. Our algorithms have low time complexity and they can address the needs of different types of pervasive computing applications. We have evaluated our proposed algorithms through simulations as well as test bed experiments.
Using hybrid simulation for a quadruped standing leap

Dynamic simulation requires the computationally expensive calculation of joint accelerations, while in kinematic simulation these accelerations are known based on a given trajectory. This paper describes a hybrid kinematic and dynamic simulation method that can be applied to the simulation of a quadruped standing leap to speed up the computations over that of a dynamic simulation. This is possible because much of the time, the legs of the standing leap are in the air and their trajectories are directly specified and tightly controlled. The method is more flexible than dynamic simulation alone because it allows joints to be either motion-controlled or force-controlled. It is general to all robotic systems with tree structures, and fully motion-controlled or force-controlled kinematic loops. It should work best for machines with appendages that are motion-controlled, such as those encountered in underwater and space manipulation.
Therapie der Migräneattacke und Prophylaxe der Migräne

• Bei chronischer Migräne mit oder ohne Übergebrauch von Schmerzoder Migränemitteln sind Topiramat und OnabotulinumtoxinA wirksam. Die Wirksamkeit anderer Substanzen zur Prophylaxe der chronischen Migräne ist nicht ausreichend belegt. • Valproinsäure, Topiramat und Amitriptylin wurden in der Migräneprophylaxe bei Kindern und Jugendlichen untersucht. Angesichts einer sehr hohen Placeborate konnte keine therapeutische Überlegenheit zu Placebo gezeigt werden. • Der Verschluss eines offenen Foramen ovale bei Migräne mit Aura führt nicht zur Attackenfreiheit.
A Survey of Models of Parallel

Serial computing's popularity can be attributed to the von Neumann model providing a single, general model of serial computation. This has led to portability, predictability and programmability in serial computation. However, there is no such single model in parallel computation. Rather, numerous models abound with some being more popular than others, but there is as yet no clear leader. This survey presents several such candidate models of parallel computation. Each of the surveyed models is described and criticised, and assessed as to how it satisses a series of requirements for a model of parallel computation. This report came about as a result of lecturing undertaken by the author in the area of models of parallel computation. It attempts to provide an introduction to the area and a justiication of its study, along with a survey of numerous key models.
MC1R, ASIP, and DNA repair in sporadic and familial melanoma in a Mediterranean population.

BACKGROUND Melanoma risk factors include fair pigmentation, multiple nevi, low DNA repair capacity, and CDKN2A or CDK4 mutations. Variants of the melanocortin-1 receptor (MC1R) gene have been associated with fair pigmentation and melanoma risk, and a polymorphism of the Agouti Signaling Protein (ASIP) gene has been associated with dark pigmentation. We examined MC1R and ASIP genotypes in relation to phenotypic characteristics, sporadic and familial melanoma risk, and melanoma thickness as an indicator of disease progression in a Mediterranean population. METHODS We studied 267 melanoma patients and 382 control subjects from a case-control study and a family study in northeastern Italy. Host factors were assessed by physical examination, questionnaire, spectrophotometer, and minimal erythema dose measurement. MC1R was sequenced, ASIP was genotyped, and DNA repair capacity was measured by the host-cell reactivation assay. Odds ratios (ORs) and 95% confidence intervals (CIs) were estimated by logistic regression models. Effect modification of the association between MC1R and melanoma risk by phenotypic characteristics and DNA repair capacity was also assessed. All statistical tests were two-sided. RESULTS Carrying MC1R variant alleles was associated with a two- to fourfold increase in risk of both sporadic and familial melanoma compared with carrying wild-type MC1R, particularly in individuals carrying multiple variant alleles (OR = 3.9; 95% CI = 3.3 to 4.6). This association was stronger in individuals with fewer additional risk factors (those with dark skin or few nevi). MC1R variant allele carriers were also three to four times more likely than were non-carriers to have thick melanomas. The ASIP polymorphism was not associated with pigmentation, nevi, or melanoma risk. CONCLUSIONS MC1R was associated with melanoma risk and progression in a Mediterranean population, particularly in the absence of other strong risk factors, such as freckling or many nevi.
Flight control systems of a quad tilt rotor Unmanned Aerial Vehicle for a large attitude change

Quad tilt rotor Unmanned Aerial Vehicle (UAV) solves the problem of underacuated system in general quadrotor UAV. The quad tilt rotor UAV can control position and attitude independently by tilting directions of propellers. However, the flight control system in a wide range of attitudes has not been discussed yet, e.g. a UAV flying and hovering with a 90 [°] pitch angle and can flip over when the range of the tilting motor rotates wide enough. In this paper, we present the attitude transition flight control system for pitch angles ranging 0 [°] to 90 [°] since flight condition with a 90 [°] pitch angle significantly differs from that in a conventional quadrotor UAV flight, and then adequate control system and sufficient experimental validation are necessary for stable flight in a wide range of attitude conditions.
A Similarity-based Chinese Restaurant Process for Social Event Detection

In this paper, we present our approach for the Social Event Detection task of Medieval 2013 [2]. The goal of the task was to group similar multimedia items into event clusters, based on their metadata (e.g. title, description, tags). Since the number of the event clusters in the test set was not known in advance, we formulated a non-parametric algorithm which resembles the Dirchlet process clustering. More specically, we developed a similarity-based version of the Chinese Restaurant Process (CRP) which exploits the similarities among the media items. Our approach achieved a F1 score of 0.2364.
Design and analysis of compact unequal-split Wilkinson power divider using non-uniform transmission lines

In this paper, the design of miniaturized unequal-split Wilkinson power divider (WPD), with 1:2 split ratio, using non-uniform transmission lines (NTLs) is presented. To achieve compactness, the uniform transmission lines of the conventional WPD are substituted by their equivalent NTLs. Two extra compact NTLs transformers are incorporated in each arm of the divider for output ports matching purposes. To prove the validity of the design procedure, the proposed divider is simulated using full-wave simulators, fabricated and tested. Both simulation and measurement results are in good agreement. Using NTLs, a size reduction of 22.2% is achieved, besides odd harmonics suppression.
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

We present an efficient, randomized, online, scheduling algorithm for a large class of programs with write-once synchronization variables. The algorithm combines the <i>work-stealing</i> paradigm with the <i>depth-first</i> scheduling technique, resulting in high space efficiency and good time complexity. By automatically increasing the <i>granularity</i> of the work scheduled on each processor, our algorithm achieves good locality, low contention and low scheduling overhead, improving upon a previous depth-first scheduling algorithm [6] published in SPAA '97. Moreover, it is probably efficient for the general class of multithreaded computations with write-once synchronization variables (as studied in [6]), improving upon algorithm DFDeques (published in SPAA'99 [24]), which is only for the more restricted class of <i>nested parallel</i> computations. More specifically, consider such a computation with <i>work T</i> <subscrpt>1</subscrpt>, <i>depth T</i> <subscrpt>∞</subscrpt> and &sgr; <i>synchronizations</i>, and suppose that space <i>S</i> <subscrpt>1</subscrpt> suffices to execute the computation on a single-processor computer. Then, on a <i>P</i>-processor shared-memory parallel machine, the expected space complexity of our algorithm is at most <i>S</i> <subscrpt>1</subscrpt> + <i>&Ogr;</i>(<i>PT</i>∞ log (<i>PT</i>∞)), and its expected time complexity is <i>&Ogr;</i>(<i>T</i> <subscrpt>1</subscrpt>/<i>P</i> + &sgr; log (<i>PT</i>∞)/<i>P</i> + T∞ log (<i>PT</i>∞)). Moreover, for any <i>∈</i> > 0, the space complexity of our algorithm is <i>S</i> <subscrpt>1</subscrpt> + <i>&Ogr;</i>(<i>P</i>(<i>T</i>∞ + ln(1/∈)) log(<i>P</i>(<i>T</i>∞ + ln(<i>P</i>(<i>T</i>∞(1/∈))/∈)))) with probability at least 1 — ∈. Thus, even for values of ∈ as small <i>∈</i> <sup> —T∞</sup>, the space complexity of our algorithm is at most <i>S</i> <subscrpt>1</subscrpt> + <i>&Ogr;</i>(<i>PT</i>∞ log(<i>PT</i>∞)) with probability at least 1 — <i>∈</i> <sup> —T∞</sup>. These bounds include all time and space costs for both the computation and the scheduler.
Structural and Functional Regulation of Tight Junctions by RhoA and Rac1 Small GTPases

Tight junctions (TJ) govern ion and solute diffusion through the paracellular space (gate function), and restrict mixing of membrane proteins and lipids between membrane domains (fence function) of polarized epithelial cells. We examined roles of the RhoA and Rac1 GTPases in regulating TJ structure and function in MDCK cells using the tetracycline repressible transactivator to regulate RhoAV14, RhoAN19, Rac1V12, and Rac1N17 expression. Both constitutively active and dominant negative RhoA or Rac1 perturbed TJ gate function (transepithelial electrical resistance, tracer diffusion) in a dose-dependent and reversible manner. Freeze-fracture EM and immunofluoresence microscopy revealed abnormal TJ strand morphology and protein (occludin, ZO-1) localization in RhoAV14 and Rac1V12 cells. However, TJ strand morphology and protein localization appeared normal in RhoAN19 and Rac1N17 cells. All mutant GTPases disrupted the fence function of the TJ (interdomain diffusion of a fluorescent lipid), but targeting and organization of a membrane protein in the apical membrane were unaffected. Expression levels and protein complexes of occludin and ZO-1 appeared normal in all mutant cells, although ZO-1 was more readily solubilized from RhoAV14-expressing cells with Triton X-100. These results show that RhoA and Rac1 regulate gate and fence functions of the TJ, and play a role in the spatial organization of TJ proteins at the apex of the lateral membrane.
A swiss army knife for finite rate of innovation sampling theory

Finite-Rate-of-Innovation (FRI) sampling theory prescribes a procedure for exact recovery of Dirac impulses from linear measurements in the form of orthogonal projections of streams of Dirac impulses onto the subspace of Fourier-bandlimited functions. This enables recovery of a continuous time sparse signals at sub-Nyquist rates. In many cases, the transform domain of interest may be more general than the Fourier domain. Recent work has extended FRI sampling theory to the spherical Fourier Transform, fractional Fourier Transform and the Laplace Transform. In this paper, we develop a broad FRI framework applicable to a general class of transformations that includes Fourier, Laplace, Fresnel, fractional Fourier, Bargmann and Gauss-Weierstrass transforms, among others. For this purpose, we consider the Special Affine Fourier Transform (SAFT) which parametrically generalizes a number of well known unitary transforms linked with signal processing and optics. We first derive a version of Shannon's sampling theory based on the convolution structure tailored for the SAFT domain. Having identified the subspace of SAFT-bandlimited functions, we apply FRI sampling theory to the SAFT and study recovery of sparse signals, thus providing a unified view of FRI sampling theory for a large class of disparately studied operations.
The Effect of Substituent, Degree of Acetylation and Positioning of the Cationic Charge on the Antibacterial Activity of Quaternary Chitosan Derivatives

A series of water-soluble cationic chitosan derivatives were prepared by chemoselective functionalization at the amino group of five different parent chitosans having varying degrees of acetylation and molecular weight. The quaternary moieties were introduced at different alkyl spacer lengths from the polymer backbone (C-0, C-2 and C-6) with the aid of 3,6-di-O-tert-butyldimethylsilyl protection of the chitosan backbone, thus allowing full (100%) substitution of the free amino groups. All of the derivatives were characterized using 1H-NMR, 1H-1H COSY and FT-IR spectroscopy, while molecular weight was determined by GPC. Antibacterial activity was investigated against Gram positive S. aureus and Gram negative E. coli. The relationship between structure and activity/toxicity was defined, considering the effect of the cationic group’s structure and its distance from the polymer backbone, as well as the degree of acetylation within a molecular weight range of 7–23 kDa for the final compounds. The N,N,N-trimethyl chitosan with 100% quaternization showed the highest antibacterial activity with moderate cytotoxicity, while increasing the spacer length reduced the activity. Trimethylammoniumyl quaternary ammonium moieties contributed more to activity than 1-pyridiniumyl moieties. In general, no trend in the antibacterial activity of the compounds with increasing molecular weight or degree of acetylation up to 34% was observed.
Predicting Subcellular Locations of Eukaryotic Proteins Using Bayesian and /k/-Nearest Neighbor Classifiers

Biologically, the function of a protein is highly related to its subcellular location. It is of necessity to develop a reliable method for protein subcellular location prediction, especially when a large amount of proteins are to be analyzed. Various methods have been proposed to perform the task. The results, however, are not satisfactory in terms of effectiveness and efficiency. A hybrid approach combining naive Bayesian classifier and k-nearest neighbor classifier is proposed to classify eukaryotic proteins represented as a combination of amino acid composition, dipeptide composition, and functional domain composition. Experimental results show that the total accuracy of a set of 17,655 pro- teins can reach up to 91.5%.
On the asymptotic giant branch star origin of peculiar spinel grain OC2

Microscopic presolar grains extracted from primitive meteorites have extremely anomalous isotopic compositions revealing the stellar origin of these grains. The composition of presolar spinel grain OC2 is different from that of all other presolar spinel grains. Large excesses of the heavy Mg isotopes are present and thus an origin from an intermediate-mass (IM) asymptotic giant branch (AGB) star was previously proposed for this grain. We discuss the isotopic compositions of presolar spinel grain OC2 and compare them to theoretical predictions. We show that the isotopic composition of O, Mg and Al in OC2 could be the signature of an AGB star of IM and metallicity close to solar experiencing hot bottom burning, or of an AGB star of low mass (LM) and low metallicity suffering very efficient cool bottom processing. Large measurement uncertainty in the Fe isotopic composition prevents us from discriminating which model better represents the parent star of OC2. However, the Cr isotopic composition of the grain favors an origin in an IM-AGB star of metallicity close to solar. Our IM-AGB models produce a self-consistent solution to match the composition of OC2 within the uncertainties related to reaction rates. Within this solution we predict that the 16O(p,g)17F and the 17O(p,a)14N reaction rates should be close to their lower and upper limits, respectively. By finding more grains like OC2 and by precisely measuring their Fe and Cr isotopic compositions, it may be possible in the future to derive constraints on massive AGB models from the study of presolar grains.
CD8+ T Cell-Induced Expression of Tissue Inhibitor of Metalloproteinses-1 Exacerbated Osteoarthritis

Despites the fact that T cells are involved in the pathogenesis of osteoarthritis (OA) little is known about the roles of CD8+ T cells in this disease. We investigated the effects of CD8+ T cells and the expression of tissue inhibitor of metalloproteinases 1 (TIMP-1) on joint pathology. Using anterior cruciate ligament-transection (ACLT), OA was induced in mice. The knee joints were histologically assessed for manifestations of OA. The CD8+ T cells from splenocytes and synovium were flow-cytometrically and immunochemically evaluated, respectively. Local expression of TIMP-1, matrix metalloproteinase (MMP)-13, and VEGF were examined. Cartilage degeneration was slower in CD8+ T cell knockout mice than in control mice. CD8+ T cells were activated once OA was initiated and expanded during OA progression. More CD8+ T cells from splenocytes expressed TIMP-1 in ACLT-group mice than in Sham-group mice. The number of TIMP-1-expressing CD8+ T cells in OA mice correlated with the disease severity. TIMP-1 expression in cartilage was co-localized with that of MMP-13 and VEGF. TIMP-1 protein was detected in synovium in which angiogenesis occurred. During the pathogenesis of OA, the expression of TIMP-1, VEGF and MMP-13 accompanying with CD8+ T cells activation were increased. Furthermore, inhibiting the expression of TIMP-1 in joints could retard the progression of OA.
SMT-based Counterexample Generation for Markov Chains

Counterexamples are a highly important feature of the model checking process. In contrast to, e. g. , digital circuits where counterexamples typically consist of a single path leading to a critical state of the system, in the probabilistic setting, counterexamples may consist of a large number of paths. In order to be able to handle large systems and to use the capabilities of modern SAT-solvers, bounded model checking (BMC) for discrete-time Markov chains was established. In this paper we introduce the usage of SMT-solving over the reals for the BMC procedure. SMT-solving, extending SAT with theories, leads in this context on the one hand to a convenient way to express conditions on the probability of certain paths and on the other hand to handle Markov Reward models. The former can be used to find paths with high probability first. This leads to more compact counterexamples. We report on some experiments, which show promising