Miracle-dz/UniFAR-FTUs huggingface dataset:
Diffusion by optimal transport in the Heisenberg group-Perspectives in Optimal transportation

The Heisenberg group Hn is apparently one of the meeting point of various mathematical and scientifical domains. This can be partially explained by the fact that the first Heisenberg group appears as the less elaborated Lie group after the Euclidean spaces. It includes only a few non-commutativity and its Lie algebra presents a unique non-trivial relation (that can be interpreted in quantic physic as the uncertainty principle). That is a reason why it is occuring so much in different domains. The subRiemannian distance, called for Hn Carnot-Carathéodory distance dc provides an exotic structure that still allows elementary computations. It makes of Hn one of the spaces aimed by some theory on metric spaces (see e.g. [12] for geometric measure theory, [19] for conformal geometry, [6] for embedding problems). This paper is devoted to a metric approach of the hypoelliptic diffusion in the Heisenberg group. We will consider in the main theorems (Theorem 0.1 and Theorem 0.2) some curves of P2(Hn)– a space of probability measures called Wasserstein space –that are defined as the gradient flow of the Boltzmann entropy with respect to the Wasserstein metric structure on P(Hn). We prove that these curves correspond to the solutions of the hypoelliptic heat equation provided by ∆H, the subRiemmannian “sum of square” operator, the so-called Kohn operator. The hypoellipticity of this operator is the consequence of a famous theorem by Hörmander [14] about “sum of square” operators. Roughly speaking we give a metric way to characterize the classical diffusion of the Heisenberg group by using a gradient flow in the Wasserstein space P2(Hn). We say now a little more about the origin of this approach. The breakthrough on this topic are the seminal papers of Otto ([15, 24] the first one with Jordan and Kinderlehrer) where the Wasserstein space P2(R) is considered for the first time formally as an infinite dimensional Riemannian manifold. This approach is sometimes called “Otto calculus” as in [28]. Otto and his coauthors realized that the solutions of the heat equation are densities of measures describing a special curve on P2(R) and justify it at the formal level. The Boltzmann entropy (with
Twenty Years of Schizophrenia Research in the Northern Finland Birth Cohort 1966: A Systematic Review

Birth cohort designs are useful in studying adult disease trajectories and outcomes, such as schizophrenia. We review the schizophrenia research performed in the Northern Finland Birth Cohort 1966 (NFBC 1966), which includes 10,934 individuals living in Finland at 16 years of age who have been monitored since each mother's mid-pregnancy. By the age of 44, 150 (1.4%) had developed schizophrenia. There are 77 original papers on schizophrenia published from the NFBC 1966. The early studies have found various risk factors for schizophrenia, especially related to pregnancy and perinatal phase. Psychiatric and somatic outcomes were heterogeneous, but relatively poor. Mortality in schizophrenia is high, especially due to suicides. Several early predictors of outcomes have also been found. Individuals with schizophrenia have alterations in brain morphometry and neurocognition, and our latest studies have found that the use of high lifetime doses of antipsychotics associated with these changes. The schizophrenia research in the NFBC 1966 has been especially active for 20 years, the prospective study design and long follow-up enabling several clinically and epidemiologically important findings. When compared to other birth cohorts, the research in the NFBC 1966 has offered also unique findings on course and outcome of schizophrenia.
Nonreservation Fair Bandwidth Allocation Based on Dynamic Replacement in Optical Burst Ring Networks

This paper proposes a real-time allocation scheme for photonic networks that use wavelength division multiplexing (WDM) and optical time division multiplexing (OTDM) technologies in the backbone and ring regional networks, respectively. A frame that is used for transferring data and control information in a ring regional network takes only one round to complete data allocation processing, instead of two rounds as required by the prior reservation scheme, so that data can be transmitted immediately. The objective is to provide max-min fair share in terms of throughput with just one round. If no free space is left on the frame, the proposed scheme allows a group (some) of the newly requested data to replace some of the already allocated data to provide max-min fair share, in terms of throughput. Data replacement and defragmentation are processed in the optical domain. Simulations show that the proposed scheme maintains max-min fair share even in unbalanced traffic scenarios. The complexity of defragmentation depends on the number of delay lines needed to regenerate the original data groups. The maximum number of delay lines is determined.
Nonpreemptive Ensemble Motion Planning on a Tree

Abstract Consider the problem of finding a minimum-cost tour to transport a set of objects between the vertices of an edge-weighted tree by a vehicle that travels along the edges of the tree. The vehicle can carry only one object at a time, and it starts and finishes at the same vertex of the tree. It is shown that if each object must be carried directly from its initial vertex to its destination then finding such a minimum-cost tour is NP-hard. Several fast approximation algorithms are presented for this problem. The fastest runs in O(k + n) time and generates a tour of cost at most 3 2 times the cost of a minimum-cost tour, where n is the number of vertices in the tree, k is the number of objects to be moved. Another runs in O(k + n log β(n, q)) time and generates a tour of cost at most 5 4 times the cost of a minimum-cost tour, where q ≤ min{k, n} is the number of nontrivial connected components in a related directed graph, and β(n, q) = min{i | login ≤ n/q}. In addition, a family of polynomial-time approximation algorithms is given, whose ratio of the cost of tour generated to the cost of a minimum-cost tour decreases to at most 1.21363 as the running time increases.
Behavioral Finance in Corporate Governance - Independent Directors, Non-Executive Chairs, and the Importance of the Devil&Apos;S Advocate

The Common Law, parliamentary democracy, and academia all institutionalize dissent to check undue obedience to authority; and corporate governance reformers advocate the same in boardrooms. Many corporate governance disasters could often be averted if directors asked hard questions, demanded clear answers, and blew whistles. Work by Milgram suggests humans have an innate predisposition to obey authority. This excessive subservience of agent to principal, here dubbed a "type II agency problem", explains directors' eerie submission. Rational explanations are reviewed, but behavioral explanations appear more complete. Experimental work shows this predisposition disrupted by dissenting peers, conflicting authorities, and distant authorities. Thus, independent directors, chairs, and committees excluding CEOs might induce greater rationality and more considered ethics in corporate governance. Empirical evidence of this is scant - perhaps reflecting problems identifying genuinely independent directors.
Vision-Based Interception of a Moving Target by a Mobile Robot

We present a robot navigation technique, termed circular navigation guidance (CNG), which solves the challenging problem of intercepting a moving target from a specific angle, using only data from a video camera. The guidance law is not split into path-planning and path-following stages, but is continuously updated based on immediately available information, making it practical even against a manoeuvring target, or where only incomplete information is available to the robot. This is achieved by converting a finite-time navigation problem into one of maintaining a certain geometric condition at all times. Theoretical and experimental results are presented, which support CNG as a practically useful tool for robot navigation.
A Study of a Virtual Network Embedding Algorithm

Currently, energy cost has become an important burden of infrastructure providers in network virtual environment. Therefore, consolidating nodes and links to save energy is an effective method when virtual networks are embedded on substrate network. The traditional embedding method usually considers cost minimization or revenue maximization as its goal. This paper studies the problem of energy consumption, cost and revenue simultaneously and a virtual network embedding model saving energy is proposed. Then, a heuristic algorithm base on group search optimizer is developed. The simulation experiments show that the proposal can effectively reduce energy consumption when a large quantity of virtual networks arrives.
Scheduling chains of operations on a batching machine with disjoint sets of operation compatibility

We consider a scheduling problem that arises from an industrial application in chemical experimentations, where a single machine can process a fixed number of compatible jobs simultaneously. The precedence graph is restricted to be a disjoint union of chains, and the compatibility constraints are given by a partition of the tasks. Nevertheless, with these restrictions we prove the NP-completeness of the problem when the machine has a capacity of two, implying the difficulties for greater capacities. We also present a short proof for an infinite capacity. Our results also show the NP-completeness of the D-Supersequence problem, even when there are only two kinds of strings. We show polynomiality results when the number of chains in the precedence graph is fixed or when each chain has only two jobs.
A SQP type method for constrained multiobjective optimization

We propose an SQP type method for constrained nonlinear multiobjective optimization. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving singleobjective constrained optimization problems. Under appropriate di erentiability assumptions we discuss convergence to local optimal Pareto points. We provide numerical results for a set of unconstrained and constrained multiobjective optimization problems in the form of performance and data pro les, where several performance metrics are used. The numerical results con rm the superiority of the proposed algorithm against a state-of-the-art multiobjective solver, either in the quality of the approximated Pareto front or in the computational e ort necessary to compute the approximation. AMS subject classi cations: 90C29 Multi-objective and goal programming, 90C55 Methods of successive quadratic programming type, 90C30 Nonlinear programming
Verified and Optimized Inlined Reference Monitors

Ever since Morris worm was released into the wild from MIT by Robert Morris in 1988, computer security has gained increasing attention from both end users and programmers. However, most programmers are still not capable of writing secure code, partially because security incurs extra burden and distracts programmers from application logic. Computer security is still considered to be the job of a few security experts. Unsafe language is one of the banes of software attacks. Current system softwares are mostly written in unsafe languages such as C and C++ for a variety of reasons. Software attacks sabotage program executions by inducing abnormal control flow transfers to injected shellcode, existing libraries, and code snippets already in application programs, or manipulating data pointers to steal or corrupt sensitive information. By embedding security checks into subject programs during compilation, Inlined Reference Monitors (IRMs) can prevent many attacks effectively. Many software attacks can be foiled effectually because they violate the security properties IRMs check at runtime. However, traditional implementations of IRMs either incur heavy runtime overhead, or lack retargetability and reusability. In addition, their trustworthiness is questionable without verification. In this thesis, we propose solutions to these problems. To improve efficiency, we apply aggressive optimizations to eliminate unnecessary embedded security checks. Retargetability is achieved through modeling security checks in machine-independent representations. The trustworthiness is ensured by verification. We have built a framework on top of the industrial-strength compiler LLVM for IRMs. Experimental results show that the trustworthiness, efficiency, and practicality are all improved significantly over previous work. In the end, we summarize the work and discuss future research.
Etude des processus d'encodage et de reconnaissance épisodiques verbaux et non verbaux dans le vieillissement cognitif normal : investigations électrophysiologiques

Avec l’avancee en âge, l’efficience de l’ensemble des fonctions cognitives, en particulier la memoire episodique, tend a diminuer. L’etude des effets Dm et old/new et des resultats de la methode sLORETA a permis de caracteriser sur un plan neurofonctionnel deux types de vieillissement non pathologique chez les seniors. D’une part, le vieillissement cognitif stable se traduit par des processus d’encodage identiques a ceux observes chez des sujets jeunes alors que les processus de recuperation necessitent un recrutement bilateral des lobes temporaux medians, cette activation etant unilaterale chez les sujets jeunes. Ces resultats vont dans le sens du modele HAROLD qui suggere une reduction de l’asymetrie hemispherique avec l’âge. D’autre part, le vieillissement cognitif altere proviendrait d’une alteration des reseaux cerebraux des la phase d’encodage. La baisse d'activite au niveau du cortex prefrontal gauche, siege des fonctions executives, suggererait une difficulte de mise en œuvre de strategies d'encodage efficaces et aurait un impact direct sur l'activite observee au niveau du lobe temporal median de facon bilaterale ce qui pourrait donc expliquer une difficulte de stockage de l'information.
Molecular Detection of Integron Genes and Pattern of Antibiotic Resistance in Pseudomonas Aeruginosa Strains Isolated from Intensive Care Unit, Shahid Beheshti Hospital, North of Iran

Pseudomonas aeruginosa is one of the most important pathogens that causes nosocomial infections and shows high level of antibiotic resistance. Integrons are one of the transposable elements in bacteria and their role in antibiotic resistance has been well demonstrated. The aim of this study was a molecular characterization of the integron genes and the determination of the resistance or sensitivity pattern to ceftizoxime, cephizoxim. cephotaxim, amikacin, ofloxacin, imipenem, cefepime, ticarcillin, gentamicin, ciprofloxacin, cefazolin and ceftriaxone antibiotics in P. aeruginosa strains isolated from Intensive Care Units (ICU), Shahid Beheshti Hospital, North of Iran. This cross-sectional study was performed from 2011 to 2012. Totally, fifty four P. aeruginosa strains were isolated from ICU at Shahid-Beheshti hospital, Babol, North of Iran. The bacteria were diagnosed based on mobility, pigment production, growth in 420 C, oxidase and catalase tests. PCR analysis was carried out to detect integron genes using hep 35 and hep 36 primers. Also, disk diffusion method was performed to evaluate antibiotic susceptibility of the bacteria using ceftizoxime, ceftazidime, cephotaxime, amikacin, ofloxacin, imipenem, cefepime, ticarcillin, gentamicin, ciprofloxacin, cefazolin and ceftriaxone antibacterial reagents. This study revealed that 20 (37%) P. aeruginosa isolates had integron genes. The antibiotic susceptibility test showed that 53 (98.1%) of the isolates were multidrug-resistant. 12 out of 54 isolated bacteria were resistant to all antibiotics tested. All bacteria were resistant to cefepime and the highest resistance rate was seen to ceftizoxime 92.6% followed by cefazolin 92.3%. The lowest resistance rate was observed to ciprofloxacin 38.9%, ofloxacin 44.4%, amikacin 46.3% and ticarcillin 48.1%. According to this study, P. aeruginosa isolates showed high level of antibiotic resistance and the presence of integrons in these strains can explain the influence of these genes in resistance creation. There was a significant association between resistance to cefotaxime, amikacin, ofloxacin, imipenem, ticarcillin, gentamicin and the presence of integrons.
A pattern-based domain partition approach to parallel optical proximity correction in VLSI designs

A novel parallel optical proximity correction (OPC) technique is proposed for process distortion compensation of layout mask in design and fabrication of very large scale integration (VLSI) circuits. Based on a genetic algorithm (GA), rule- and model-based correction methods, and domain decomposition algorithms, a parallel OPC system is successfully developed for the layout mask correction of VLSI circuits on a Linux-based PC cluster with the message passing interface (MPI) libraries. Tested on several layout patterns, the implemented pattern-based partition scheme shows good accuracy for the OPC-corrected layout mask of VLSI designs. Computational and parallel benchmarks, such as speedup and efficiency, are achieved and exhibit excellent performance of the developed system. Our approach provides an alternative in developing advanced computer aided design (CAD) tools and benefits design and fabrication of system-on-chip (SoC).
A Generative Model of Natural Texture Surrogates

Natural images can be viewed as patchworks of different textures, where the local image statistics is roughly stationary within a small neighborhood but otherwise varies from region to region. In order to model this variability, we first applied the parametric texture algorithm of Portilla and Simoncelli to image patches of 64X64 pixels in a large database of natural images such that each image patch is then described by 655 texture parameters which specify certain statistics, such as variances and covariances of wavelet coefficients or coefficient magnitudes within that patch. To model the statistics of these texture parameters, we then developed suitable nonlinear transformations of the parameters that allowed us to fit their joint statistics with a multivariate Gaussian distribution. We find that the first 200 principal components contain more than 99% of the variance and are sufficient to generate textures that are perceptually extremely close to those generated with all 655 components. We demonstrate the usefulness of the model in several ways: (1) We sample ensembles of texture patches that can be directly compared to samples of patches from the natural image database and can to a high degree reproduce their perceptual appearance. (2) We further developed an image compression algorithm which generates surprisingly accurate images at bit rates as low as 0.14 bits/pixel. Finally, (3) We demonstrate how our approach can be used for an efficient and objective evaluation of samples generated with probabilistic models of natural images.
Roma children in the transformational recession Widening ethnic schooling gap and Roma poverty in post-communist Hungary

The Roma or " Gypsies " are Europe's largest and poorest ethnic minority. Nearly 80 per cent of them live in the former communist countries of Central and Eastern Europe. The Roma – Non-Roma educational gap, always substantial but slowly closing in the communist years, widened again after the collapse of the communist system in Hungary. Using Hungarian Roma data from the mid-1990's and a comparable national sample, we estimate multinomial probability models for dropping out after primary school (8 th grade), continuing in vocational training school, or continuing in a secondary school with a maturity examination (necessary for college entrance). Our results indicate that long-term poverty of the Roma is strongly associated with their high drop-out rate after 8 th grade. Roma poverty has increased considerably with the massive layoffs of unskilled workers since the mid-1980's. We find that the younger a child is when his/her father is laid off the more likely he/she is to discontinue schooling after 8 th grade. We conclude that the collapse of Roma employment has been in part responsible for the widening ethnic gap in education. Equal opportunities for the next Roma generation are therefore jeopardized unless policy helps overcoming the adverse effects of long-term poverty on schooling outcomes.
The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks

The availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main goal is to explore the effects of network sparsity on the performance of greedy geographic forwarding and to determine in different scenarios the percentage of source-destination pairs that can successfully establish communication based on greedy geographic forwarding only. To that end, Monte Carlo simulations have been performed to collect statistics in estimating the performance of UAANETs in sparse situations. Simulation results show that greedy geographic forwarding can be used for less critical applications of UAANETs. However, for applications with guaranteed delivery requirements, other alternatives should be combined with greedy geographic forwarding.
Sociobiological (Genetic) versus Economic (Functionalist) Models of Social Evolution

With the support of a grant from the Harry Frank Guggenheim Foundation, research is currently underway on a major effort to rethink the basic theoretical issue that inspired the emergence of sociobiology. That issue, in a nutshell, concerns the explanation for the origins and evolution of social life (human societies being only one example among many others).
Isolation and Characterization of Phenolic Antioxidants from Plantago Herb

Seven phenolic compounds, including a new phenylethanoid glycoside, were isolated from the ethyl acetate fraction of an aqueous ethanol extract of Plantago Herb (whole part of Plantago asiatica L.), which showed significant antioxidative activity. The new compound was characterized as 2-(3,4-dihydroxyphenyl)ethyl 3-O-β-D-allopyranosyl-6-O-caffeoyl-β-D-glucopyranoside on the basis of spectral and chemical evidence, and its antioxidant activity was comparable to that of tea catechins.
Decision Rule Extraction from Binary Data Using Winning Combinations

This paper presents a new approach for making inferences about binary data. The objective is to determine rules that lead to a certain result. The method consists of four phases: in the first phase, the data is processed into a binary format of a Truth Table; in the second phase, rules are defined by utilizing an algorithm that minimizes Boolean functions (by Quine and McCluskey); in the third phase, the rules are checked and filtered; and in the fourth phase, simple rules that involve one to two features are presented.