Miracle-dz/UniFAR-FTUs huggingface dataset:
First Steps Toward the Automatic Registration of Deformable Scans

Three-dimensional registration is the process of aligning scans of different incomplete views of an object such that their corresponding regions agree in space and time. It is used to build digital complete models from partial acquisitions of real-world objects which typically contain noise, outliers, and acquisition holes due to occlusions and hardware limitations. For non-rigid models, such as humans, shapes of corresponding regions undergo complex deformations in addition to misalignments. Thus, finding explicit correspondences between two dissimilar shapes becomes considerably more challenging. In addition, finding the right deformations is also non-trivial as they depend on the correspondences which are only partially available between consecutive scans. This report presents an analysis of the 3-D registration problem, a general approach for the spatio-temporal registration of deformable scans that are acquired with a fast 3-D scanner, and extensive experiments on synthetic and real acquisition data. The objective is to un-deform the surfaces of all range maps and to fit them into a particular instance of time. We address this problem by finding point correspondences based on initial closest point computations between partial scans and performing deformations according to these matches. Similar to the iterative closest point (ICP) algorithm, the correspondence and deformation steps are tightly coupled and optimized within a loop. Although smooth and small scale deformations between consecutive scans are assumed, we envision allowing large deformations, such as human bodies in completely different poses, during the acquisition. This approach is the main distinction over previous work on non-rigid ICP variants, where the accumulation of registration errors has to be globally minimized. The suggested approach makes extensive use of assumptions on surface and deformation smoothness. Our experiments confirm the success of our method for small deformations where the error accumulation of the correspondences over time is limited. However, this preliminary investigation shows that without additional assumptions about the correspondence flow and object deformation, such as rigidness and near-isometry, registration of scans with large scale deformations remains an unsolved problem. Nevertheless, promising intermediate results open up a new line of sub-problems needed to be solved for the grand challenge of fully automatic reconstruction of surface, motion, and correspondence from time coherent range-scans.
A Study of "Wheat" and "Chaff" in Source Code

Natural language is robust against noise. The meaning of many sentences survives the loss of words, sometimes many of them. Some words in a sentence, however, cannot be lost without changing the meaning of the sentence. We call these words "wheat" and the rest "chaff. " The word "not" in the sentence "I do not like rain" is wheat and "do" is chaff. For human understanding of the purpose and behavior of source code, we hypothesize that the same holds. To quantify the extent to which we can separate code into "wheat" and "chaff", we study a large (100M LOC), diverse corpus of real-world projects in Java. Since methods represent natural, likely distinct units of code, we use the, approximately, 9M Java methods in the corpus to approximate a universe of "sentences. " We "thresh", or lex, functions, then "winnow" them to extract their wheat by computing the minimal distinguishing subset (MINSET). Our results confirm that programs contain much chaff. On average, MINSETS have 1.56 words (none exceeds 6) and comprise 4% of their methods. Beyond its intrinsic scientific interest, our work offers the first quantitative evidence for recent promising work on keyword-based programming and insight into how to develop powerful, alternative programming systems.
An Optimal Parallel Algorithm for Finding the Smallest Enclosing Rectangle on a Mesh-connected Computer

In this paper, we consider the problem of nding the smallest triangle circumscribing a convex polygon with n edges. We shall show that this can be done in O(p n) time by the eecient data partition schemes and the proper set mapping and comparison operations using what so called p n-decomposition technique. Since the nontrivial operation on MCC requires (p n), the time complexity is optimal within constant time factor.
GA-SVM feasibility model and optimization kernel applied to analog IC design automation

An efficient use of macromodeling techniques is pointed out as an effective approach to improve the convergence and speed of the optimization process. The methodology presented in this paper is based on a learning scheme using Support Vector Machines(SVMs) that together with and an evolutionary strategy is used to create efficient models to estimate and optimize the performance parameters of analog and mixed-signal ICs. The SVM is used to identify the feasible design space regions while at the same time the evolutionary techniques are looking for the global optimum. Finally, the proposed optimization based methodology is demonstrated for the design of a well known class of CMOSoperational amplifier topologies. The efficiency of the proposed approach is compared with standard and modified genetic algorithm kernels.
On the Complexity of Covering Vertices by Faces in a Planar Graph

The pair $(G,D)$ consisting of a planar graph $G = (V,E)$ with n vertices together with a subset of d special vertices $D \subseteq V$ is called k-planar if there is an embedding of G in the plane so that at most k faces of G are required to cover all of the vertices in D. Checking 1-planarity can be done in linear-time since it reduces to a problem of checking planarity of a related graph. We present an algorithm which given a graph G and a value k either determines that G is not k-planar or generates an appropriate embedding and associated minimum cover in $O(c^k n)$ time, where c is a constant. Hence, the algorithm runs in linear time for any fixed k. The fact that the time required by the algorithm grows exponentially in k is to be expected since we also show that for arbitrary k, the associated decision problem is strongly NP-complete, even when the planar graph has essentially a unique planar embedding, $d = \theta (n)$, and all facial cycles have bounded length. These results provide a polynomial-t.
Explicit versus implicit social cognition testing in autism spectrum disorder

Although autism spectrum disorder is defined by reciprocal social-communication impairments, several studies have found no evidence for altered social cognition test performance. This study examined explicit (i.e. prompted) and implicit (i.e. spontaneous) variants of social cognition testing in autism spectrum disorder. A sample of 19 adolescents with autism spectrum disorder and 19 carefully matched typically developing controls completed the Dewey Story Test. ‘Explicit’ (multiple-choice answering format) and ‘implicit’ (free interview) measures of social cognition were obtained. Autism spectrum disorder participants did not differ from controls regarding explicit social cognition performance. However, the autism spectrum disorder group performed more poorly than controls on implicit social cognition performance in terms of spontaneous perspective taking and social awareness. Findings suggest that social cognition alterations in autism spectrum disorder are primarily implicit in nature and that an apparent absence of social cognition difficulties on certain tests using rather explicit testing formats does not necessarily mean social cognition typicality in autism spectrum disorder.
Assessment and management of patients with ischemic heart disease

ObjectiveReview the perioperative management of patients who are scheduled for noncardiac surgery. Data SourceReview of literature (PubMed, MEDLINE). ConclusionsPatients with ischemic heart disease who undergo noncardiac surgery are at significant risk of perioperative cardiac morbidity and mortality. Recent joint guidelines from the American College of Cardiology and American Heart Association have significantly streamlined the preoperative evaluation processes. Augmented hemodynamic control with intensive perioperative pharmacologic therapy with beta-blockers and possibly alpha-2 agonist has been shown to improve perioperative cardiovascular outcomes. However, translating this information to clinical practice continues to be a challenge and requires a multi- disciplinary approach. A particular intraoperative anesthetic technique is unlikely to influence perioperative cardiac morbidity and mortality. Postoperative management with goals of decreasing hemodynamic stress is important in patients with ischemic heart disease. Diagnosis and management of perioperative myocardial infarction continues to be a challenge. However, use of cardiac specific biomarkers should improve the diagnostic process.
Comparison of phase synchrony information flow in human EEG through wavelet phase synchronization analysis

The nonlinear interdependencies between fluctuations of three simultaneously brain recordings have been intensively studied in pairs, and the synchrony flow differences have been compared. Chavez et al. used phase synchronization analysis and nonlinear correlation coefficients in the specific frequency band of 10–25 Hz in two patients and identified the instantaneous synchrony drop in the focal area several minutes before seizures. Here we focus on the possibility of tracking distinguishable pre-seizure patterns observed before seizure onset using simultaneous synchrony information in 4 specific frequency bands in three adjacent channels of multichannel iEEG recording. The present study on 21 patients and 77 seizures compares the capability of the wavelet phase synchronization in different pairs of channels in predicting seizures in the sense of correct predictions (C.P.R), false positives per hour (FP/h), and average length of prediction.
Simpson Time Since the Beginning

While there is no consensus about the history of time since the beginning, in this paper I will discuss some possibilities. We have a pretty clear picture of cosmic history from the electroweak phase transition through the time of recombination, a period which includes the QCD phase transition and big bang nucleosynthesis. This paper includes a quantitative discussion of the age of the universe, of the radiation-matter transition, and of hydrogen recombination. There is much evidence that at earlier times the universe underwent inflation, but the details of how and when inflation happened are still far from certain. There is even more uncertainty about what happened before inflation, and how inflation began. I will describe the possibility of " eternal " inflation, which proposes that our universe evolved from an infinite tree of inflationary spacetime. Most likely, however, inflation can be eternal only into the future, but still must have a beginning.
Inflammatory Molecules in Aqueous Humour and on Ocular Surface and Glaucoma Surgery Outcome

Purpose. To investigate the influence of inflammatory molecules in the aqueous humour and on the ocular surface on the outcome of glaucoma surgery. Methods. Thirty patients who needed antiglaucomatous surgery were included. The interleukin- (IL-) 8, IL-1β, IL-6, IL-10, tumour necrosis factor- (TNF-) α; and IL-12 were determined from aqueous humour preoperatively and the imprints of conjunctiva were analysed for expression of human leukocyte antigen- (HLA-)-DR after surgery by flow cytometry. The success of trabeculectomy was defined as intraocular pressure less than 21 mmHg without antiglaucoma medication. Results. Eyes with trabeculectomy failure at 3 months showed significantly higher TNF-α and IL-6 levels in the aqueous than eyes with successful surgery. Increased expression of HLA-DR on epithelial cells and antigen-presenting cells was not associated with the trabeculectomy outcome. Conclusions. Higher preoperative levels of TNF-α and IL-6 in aqueous humour may contribute to the development of inflammatory milieu and were associated with worse outcome of glaucoma surgery.
Suicidal behaviour in early psychosis : the role of insight

4 Table of contents . 5 List of figures . 14 List of tables . 16 List of abbreviations and definitions . 21 Personal Contribution . 23 Chapter 1 General introduction . 24 1.1. – Psychosis . 27 1.1. a. – History . 27 1.1. b. – Current classification of psychotic disorders . 30 1.1. c. – Dimensions vs. Categories. What are the symptoms of psychosis? 32 1.1. d. – Psychosis and schizophrenia . 32 1.1. e. – Aetiology . 33 1.1. f. – Treatment . 37 1.1. g. – Outcome . 38 1.1. h. – First episode of psychosis . 39 1.2. – Suicidal behaviour . 39 1.2. a. – Concept and terms . 39 1.2. b. – Suicide in the general population: epidemiology, methods and risk factors . 41 1.2. c. – Suicide in psychosis: epidemiology, methods and risk factors . 43 1.3. – Insight . 47 1.3. a. – History . 47 1.3. b. – Definition . 49 6 1.3. c. – Multidimensional model of insight . 50 1.3. d. – Insight and psychosis . 53 1.3. e. – Measuring insight . 54 1.3. f. – Why do patients with psychosis lack insight? 56 1.3. g. – Can insight be improved? 59 1.3. h. – Insight and clinical outcomes . 60 1.3. i. – Criticisms of insight . 61 Chapter 2 – The role of insight in suicidal behaviour in psychosis: previous research . 62 2.1. – Introduction . 62 2.2. – Systematic review of previous literature . 64 2.2. a. – Positive association studies (see Table 2.1) . 67 2.2. b. – Negative studies (see Table 2.2) . 70 2.3. – Inconsistency of the results and directions for future research . 75 2.4. – Aims of this thesis . 77 2.5. – Hypotheses . 78 Chapter 3 – Suicide completion by patients with schizophrenia in secondary mental healthcare. Data from the South London and Maudsley (SLaM) Biomedical Research Centre (BRC) Case Register . 80 3.1. – Introduction . 80 3.2. – Background . 81 3.3. – Aims and objectives . 84 3.3. a. – Descriptive aims and objectives . 84 3.3. b. – Analytical aims and objectives . 84 3.4. – Methods . 85 3.4. a – Sample information . 85 3.4. b. – Measures . 86
Internationalization of Family-Owned Businesses in The Czech Republic

Tento výzkum využiva techniky připadových studii vytvořených na zakladě osobnich rozhovorů s vlastniky sedmi rodinných firem v CR, aby urcil faktory, ktere ovlivňuji procesy jejich internacionalizace. Testuje ctyři výzkumne otazky internacionalizace, ktere byly v daných souvislostech identifikovany předchazejicim výzkumem jako sibnifikantni. Zatim co předpoklady vlastniků (jako věk, vzdělani a znalost cizich jazyků) nepřispivali k internacionalizace jejich firem, motivace vlastniků ovlivňovala jejich rozhodnuti vstoupit na zahranicni trhy anebo ne. Take jsme zjistili, že parametry firem, jako velikost (ale nikoliv produktova orientace) přispivaji k rozhodovani o vstupu na zahranicni trhy. Dale jsme testovali povědomi vlastnilů o jejich preferovaných zahranicnich trzich. Nase výsledky vedou k zavěru, že znalost zahranicnich trhů neni nezbytnou podminkou pro internacionalizaci rodinných firem. A konecně nas výzkum ukazal, žwe způsob vnimani exportnich nakladů a barier zavisi na tom jaký typ bariery je zkouman.
Privacy Preserving Decision Tree Learning Using Unrealized Data Sets

Privacy preservation is important for machine learning and data mining, but measures designed to protect private information often result in a trade-off: reduced utility of the training samples. This paper introduces a privacy preserving approach that can be applied to decision tree learning, without concomitant loss of accuracy. It describes an approach to the preservation of the privacy of collected data samples in cases where information from the sample database has been partially lost. This approach converts the original sample data sets into a group of unreal data sets, from which the original samples cannot be reconstructed without the entire group of unreal data sets. Meanwhile, an accurate decision tree can be built directly from those unreal data sets. This novel approach can be applied directly to the data storage as soon as the first sample is collected. The approach is compatible with other privacy preserving approaches, such as cryptography, for extra protection.
INVARIANTS OF THE HALF-LIBERATED ORTHOGONAL GROUP

The half-liberated orthogonal group $O_n^*$ appears as intermediate quantum group between the orthogonal group $O_n$, and its free version $O_n^+$. We discuss here its basic algebraic properties, and we classify its irreducible representations. The classification of representations is done by using a certain twisting-type relation between $O_n^*$ and $U_n$, a non abelian discrete group playing the role of weight lattice for $O_n^*$, and a number of methods inspired from the theory of Lie algebras. We use these results for showing that the discrete quantum group dual to $O_n^*$ has polynomial growth.
Style by demonstration for interactive robot motion

As robots continue to enter people's everyday spaces, we argue that it will be increasingly important to consider the robots' movement style as an integral component of their interaction design. That is, aspects of the robot's movement which are not directly related to a task at hand (e.g., pick up a ball) can have a strong impact on how people perceive that action (e.g., aggressively or hesitantly). We call these elements the movement style. We believe that perceptions of this kind of style will be highly dependent on the culture, group, or individual, and so people will need to have the ability to customize their robot. Therefore, in this work we use Style by Demonstration, a style focus on the more-traditional programming by demonstration technique, and present the Puppet Dancer system, an interface for constructing paired and interactive robotic dances. In this paper we detail the Puppet Dancer interface and interaction design, explain our new algorithms for teaching dance by demonstration, and present the results from a formal qualitative study.
Collective modes in neutrino 'beam' electron positron plasma interactions

We derive semiclassical neutrino-electron transport equations in the collisionless (Vlasov) limit from the coupled Dirac equations, incorporating the charged and neutral weak current-current as well as electromagnetic interactions. A corresponding linear response theory is derived. In particular, we calculate the response functions for a variety of beam-plasma geometries, which are of interest in a supernova scenario. We apply this to the study of plasmons and to a new class of collective pharon resonance modes, which are characterized by $\ensuremath{\omega}lq. $ We find that the growth rates of the unstable modes correspond to a strongly temperature $(\ensuremath{\propto}{T}_{\ensuremath{\nu}}^{2}{T}_{e}^{3})$ and linearly momentum dependent e-folding length of about ${10}^{10} \mathrm{km}$ under typical conditions for type II supernovas. This appears to rule out such long-wavelength collective modes as an efficient means of depositing neutrino energy into the plasma sphere.
Implementation of Data Mining in Medical Fraud Detection

With the enormous amount of data stored in files, databases, and other repositories, it is increasingly important, to develop powerful means to analyze and extract interesting knowledge from data. Fraudulent healthcare claims increase the burden on the society. The healthcare fraud detection requires compilation of potentially huge data, involving complex computation and sorting operations. Once such frauds have been detected and classified, data cleaning is applied to it which helps to remove the noise and inconsistencies in the data thereby enhancing its quality. This technique can be used to detect the sale of potentially dangerous medicine by pharmacists thereby preventing such medical fraud.
The logic of representation in political rituals

ABSTRACT Political rituals, like the sovereign acclamation described in Rousseau’s social contract, exhibit a logic of representation that seem to oscillate between presence and absence, and enact a problematic identification of the people as a multitude of individuals and as a whole. This article explores this logic of rituals by comparing problems of political representation in Rousseau and Agamben with the highest principle of Aristotle’s philosophy. It thus elucidates the problem of representation in rituals of political power.
Hardware-accelerated global illumination by image space photon mapping

We describe an extension to photon mapping that recasts the most expensive steps of the algorithm -- the initial and final photon bounces -- as image-space operations amenable to GPU acceleration. This enables global illumination for real-time applications as well as accelerating it for offline rendering. Image Space Photon Mapping (ISPM) rasterizes a light-space bounce map of emitted photons surviving initial-bounce Russian roulette sampling on a GPU. It then traces photons conventionally on the CPU. Traditional photon mapping estimates final radiance by gathering photons from a k-d tree. ISPM instead scatters indirect illumination by rasterizing an array of photon volumes. Each volume bounds a filter kernel based on the a priori probability density of each photon path. These two steps exploit the fact that initial path segments from point lights and final ones into a pinhole camera each have a common center of projection. An optional step uses joint bilateral upsampling of irradiance to reduce the fill requirements of rasterizing photon volumes. ISPM preserves the accurate and physically-based nature of photon mapping, supports arbitrary BSDFs, and captures both high- and low-frequency illumination effects such as caustics and diffuse color interreflection. An implementation on a consumer GPU and 8-core CPU renders highquality global illumination at up to 26 Hz at HD (1920x1080) resolution, for complex scenes containing moving objects and lights.
A 60MHz Bandwidth High Efficiency X-Band Envelope Tracking Power Amplifier

This paper presents a high efficiency X-band envelope-tracking power amplifier (PA) that achieves a 60MHz modulation bandwidth. The system consists of a wideband envelope modulator and a single-chip gallium- nitride (GaN) MMIC X-band PA. The envelope modulator achieves >70% efficiency while delivering >7W into an 8Ω resistive load for a 60MHz LTE-A modulated signal with a 6.6dB PAPR. The envelope tracking system attains a PAE of 35.3% (including the power dissipation of the envelope modulator) with 1.1W of average output power at 9.23GHz using a 20MHz LTE signal. The X-band PA itself was measured to achieve a drain efficiency of 81.6% with a gain of 7.6dB under these conditions.
MrCrypt: static analysis for secure cloud computations

In a common use case for cloud computing, clients upload data and computation to servers that are managed by a third-party infrastructure provider. We describe MrCrypt, a system that provides data confidentiality in this setting by executing client computations on encrypted data. MrCrypt statically analyzes a program to identify the set of operations on each input data column, in order to select an appropriate homomorphic encryption scheme for that column, and then transforms the program to operate over encrypted data. The encrypted data and transformed program are uploaded to the server and executed as usual, and the result of the computation is decrypted on the client side. We have implemented MrCrypt for Java and illustrate its practicality on three standard benchmark suites for the Hadoop MapReduce framework. We have also formalized the approach and proven several soundness and security guarantees.