Miracle-dz/UniFAR-FTUs huggingface dataset:
Cuasi-implicación estadística y determinación automática de clases de equivalencia en imágenes de resonancia magnética de cerebro

Resumen: La tecnica de cuasi-implicacion estadistica es muy util para determinar relaciones de causa y efecto (con un numero pequeno de excepciones). La aplicacion del analisis jerarquico de similitudes, busca constituir particiones cada vez mas finas, en el conjunto de variables, construidas de forma ascendente en arbol, mediante un criterio de similitud entre las misma. Su objetivo es descubrir y estructurar en forma de reglas, un conjunto de datos a partir de la modelizacion estadistica de la cuasi-implicacion.En este trabajo se presenta una aplicacion de esta tecnica para encontrar grupos de equivalencia existente entre un conjunto completo de imagenes (groundTruth)de resonancia magnetica de cerebro (T1-weighted). Los experimentos se han realizado con la serie de lonchas sin craneo, segmentadas y binarizadas previamente. Los resultados muestran una robusta clasificacion de las mismas agrupandolas segun un mismo indice de implicacion entre dos lonchas en forma cuasi-bicondicional. En cada grupo de similitud el metodo permite seleccionar a uno de los cortes como representante del grupo generando una lista de patrones los cuales resumen las caracteristicas encontradas proximas al patron. Para representar el grado de equivalencia se ha utilizado una probabilidad. tud. Abstract :The quasi-implication statistical technique is very useful for determining cause and effect (with a few exceptions). The application of hierarchical analysis of similarities,seeks to build increasingly fine partitions in the set of variables, built from the bottom up in the tree, using a criterion of similarity between them. Their purpose is to discover and structure, in the form of rules, a set of data from statistical modeling of quasi-implication.An application of this technique is presented in this work to find groups of equivalence between a full set of Brain MRI (T1- weighted)images (ground Truth). Experiments have been performed witha number of slices without skull previously segmented and binarized. The results show a robust classification of the same grouping them with the same rate of engagement between two quasi-biconditional shapedslices. This method allows in each similarity group select one of the images as o representative of the group, generating a list of standards which outline features proximal to the pattern. To represent the degree of equivalence a probability has been used.
SEGMENTATION OF BLOOD VESSELS AND OPTIC DISC FROM RETINAL IMAGES

The aim of this survey is to list the various disease predictions from retinal fundus images and various methods used to detect the disease. This paper gives a detailed description about the various diseases predicted in retina by comparing retinal fundus image structure. Next, a comparitive study of the various methods followed using image processing to find out the disases from retinal fundus images is provided. The survey at the end, discusses the future work for the possibilities of predicting gastreointestinal problems via retinal fundus images.
Iterative Shrinkage Operator for Direction of Arrival

In this correspondence we present the application of iterative shrinkage (IS) operator to the DOA estimation task. In particular we focus our attention to Stage wise Orthogonal Matching Pursuit (StOMP) algorithm. We compare StOMP against MUSIC, which is state of the art in DOA estimation. StOMP belongs to compressive sensing regime where as MUSIC is parametric technique based upon sub-space processing. To best of our knowledge IS operators have not been analyzed for DOA estimation. The comparison is performed using extensive numerical simulations.
Maximum and minimum sensitizable timing analysis using data dependent delays

Maximum and Minimum Sensitizable Timing Analysis Using Data Dependent Delays. (May 2007) Karandeep Singh, B.E. , Panjab University-Chandigarh Chair of Advisory Committee: Dr. Sunil P. Khatri Modern digital designs require high performance and low cost. In this scenario, timing analysis is an essential step for each phase of the integrated circuit design cycle. To minimize the design turn-around time, the ability to correctly predict the timing behavior of the chip is extremely important. This has resulted in a demand for techniques to perform an accurate timing analysis. A number of existing timing analysis approaches are available. Most of these are pessimistic in nature due because of some inherent inaccuracies in the modeling of the timing behavior of logic gates. Although some techniques use accurate gate delay models, they have only been used to calculate the longest sensitizable delay or the shortest topological path delay for the circuit. In this work, a procedure to find the shortest destabilizing delay, as well as the longest sensitizable delay of a static CMOS circuit is developed. This procedure is also able to determine the exact circuit path as well as the input vector transition for which the shortest destabilizing (or longest sensitizable) delay can be achieved. Over a number of examples, on an average, the minimum destabilizing delay results in an improvement of 24% as compared to the minimum static timing analysis approach. The maximum sensitizable timing analysis results in an improvement of 7% over sensitizable timing analysis with pin-to-output delays. Therefore, the results show that the pessismism in timing analysis can be considerably decreased by using data dependent gate delays for maximum as well as minimum sensitizable timing analysis.
P1-16 A latent class analysis of socioeconomic status and obesity in young adults from Cebu, Philippines

Introduction Socioeconomic status (SES) is a critical driver of human health, but in research practice it is rarely well-defined and inconsistently measured. Latent class analysis (LCA) is a potentially useful method of characterising SES, particularly when multiple SES indicators are available. We employed LCA to better understand how SES is related to obesity in a sample of young Filipino adults; and contrasted LCA with other approaches. Methods Data are from a cohort of young adults enrolled in the Cebu Longitudinal Health and Nutrition Survey (987 males and 819 females). Latent classes were derived using Mplus mixture modelling. Class indicators included obesity status, marital status, education level, urbanicity, household assets and income. Models were estimated under the assumption of class-conditional independence, with no further parameter constraints. Results For both sexes, a 3-class solution was the best balance of model fit (using log-likelihood, AIC, and BIC) and parsimony. Overall obesity prevalence was 9.4% in males and 7.8% in females. One class of males (n=194) had an obesity prevalence of 22%, vs 6% in the remaining two classes (p=0.007 for H0: no difference). They were more likely to be urban, educated, and unmarried than other males (p<0.05). However, a female class (n=257) with a similar socioeconomic profile instead had the lowest prevalence of obesity (5.5%). Conclusions LCA can contribute to our understanding of socioeconomic drivers of health. Interpretation of LCA is discussed in the context of Rothman and Greenland's model of causation.
Distributed linear programming with Apache Spark

For this thesis project, we have implemented Mehrotra’s predictor-corrector interior point algorithm on top of Apache Spark for solving large-scale linear programming problems. Our large-scale solver (Spark-LP) is unique because it is open-source, fault-tolerant and can be used on commodity cluster of machines. As a result, Spark-LP provides an opportunity to solve large-scale problems at the lowest possible cost. We have assessed the performance and convergent results of our solver on self-generated, sparse and dense large-scale problems over small to mediumsized clusters, composed of 16 to 64 Amazon’s Elastic Computing Cloud r3.xlarge instances. In conclusions, we have made important suggestions for breaking the current structural limitations so that our solver can be used on heterogeneous clusters containing CPUs and GPUs on JVM environment without the usual numerical limitations and overheads.
Combining Diverse Knowledge Based Features for Semantic Relatedness Measures

This chapter proposes a novel Semantic Relatedness (SR) measure that exploits diverse features extracted from a knowledge resource. Computing SR is a crucial technique for many complex Natural Language Processing (NLP) as well as Semantic Web related tasks. Typically, semantic relatedness measures only make use of limited number of features without considering diverse feature sets or understanding the different contributions of features to the accuracy of a method. This chapter proposes a random graph walk model based method that naturally combines diverse features extracted from a knowledge resource in a balanced way in the task of computing semantic relatedness. A set of experiments is carefully designed to investigate the effects of choosing different features and altering their weights on the accuracy of the system. Next, using the derived feature sets and feature weights we evaluate the proposed method against the state-of-the-art semantic relatedness measures, and show that it obtains higher accuracy on many benchmarking datasets. Additionally, the authors justify the usefulness of the proposed method in a practical NLP task, i.e. Named Entity Disambiguation. DOI: 10.4018/978-1-60960-881-1.ch005
Influencing factors on functional, psychological, and aesthetic satisfaction in dental prosthetic treatment

Objectives: The purpose of this study was to investigate the quality improvement of dental prosthetic treatment and better dental service for the patients. Methods: A self-reported questionnaire was completed by 320 users of dental prosthesis in Seoul and metropolitan area from April to June, The questionnaire consisted of 4 questions of general characteristics, 5 questions of dental prosthesis treatment, 5 questions of functional satisfaction, and 6 questions of psychological and aesthetic satisfaction by Likert 5 scale. Cronbach’s alpha was o.691 in functional satisfaction and 0.716 in psychological and aesthetic satisfaction. Except 18 incomplete answers, 302 data were analyzed. Results: The functional satisfaction mean was 3.70±0.51 and that of psychological⋅aesthetic satisfaction was 3.60±0.48. Monthly income was the most important influencing factor on full and partial prosthesis use. Conclusions: In order to improve the satisfaction level in dental prosthetic treatment, the insurance coverage for the dental prosthetic treatment is necessary. The palliative supportive measure for the prosthesis is also required.
Sasanian Pottery in Southern Iran and Eastern Arabia

Very few archaeological sites of the Sasanian period have been identified from Southern Iran and Eastern Arabia. In part this is because a securely-dated Sasanian ceramic assemblage has not yet been isolated in this region, making it impossible to recognise with confidence the ceramic wares upon which the identification of archaeological sites normally depends. The problem is exemplified by Eastern Arabia, where considerably more systematic archaeological survey has been published than from Southern Iran. ' The Eastern Province Survey (Potts et al. 1978), the al-Hasi Survey (Adams et al. 1977; Whitcomb 1978), and Larsen's survey of Bahrain (Larsen 1983) were expected to produce evidence of the Sasanian-period activity that is attested by historical sources.2 However, each of the surveys had difficulty in establishing a distinct pottery corpus with which to do this. Whitcomb flatly admitted that at al-Has? he was completely unable to isolate a corpus of Sasanian material from the survey collection (1978: 99). In Bahrain Larsen attempted to establish a set of six Late Parthian/Sasanian "type fossils" (Larsen 1983: 252-53, fig. 55), but Potts has since reviewed these, pointing out that they are, in fact, more typical of the Seleucid and Parthian periods (Potts 1990ii: 108-10). For the Eastern Province Survey Potts proposed a number of Sasanian wares, but acknowledged that it was difficult, if not impossible, to identify Sasanian pottery with confidence (Potts et al. 1978: 12). Of course it is possible that there was very little Sasanian-period occupation in the areas covered by these surveys, but only once the ceramic assemblage is properly understood can we be certain of this. Similar problems would be faced by archaeological survey in Southern Iran.
Relevance Feedback and Query Expansion

2. Scope: This module introduces the methods to improve the recall of information retrieval systems, mainly focuses on relevance feedback and query expansion. 3. Learning objectives Students are expected to be able to: a. Explain the idea of relevance feedback and the basic procedure of the implementation of relevance feedback. b. Design the scheme of query expansion and apply it in real IR systems, such as certain web search engines. c. Analyze the documents stored on LucidWorks, compute the similarity score between the documents and figure out the query log using specific CURL command. 4. 5S characteristics of the module a. Streams: In most collections, the same concept may be referred to using synonyms, so the text stream in documents and/or queries can be expanded. b. Structures: Indexed documents are stored and retrieved in various formats (e.g., XML and JSON). The input query also can be in a specific format. c. Spaces: Documents and queries are represented in a vector space as a result of indexing. The documents are located on the server running LucidWorks software. d. Scenarios: Scenarios includes user interaction, similar page function provided by some web search engines, query assist, etc. Relevance feedback and query expansion can improve the recall of information retrieval systems. e. Society: Students studying the relevance feedback and query expansion of information retrieval. Users of the system that provides these services. 5. Level of effort required This module should take at least 4 hours to complete. a. Out-of-class: students are expected to spend at least 4 hours to complete the module and exercises. Time should be spent reading the material from the textbook and Lucene chapters, as well as revisiting the resources [12a, 12b]. b. In-class: students will have the opportunity to ask and discuss exercises with their teammates.
Modulation and control of three-phase PWM multilevel converters

La present tesi doctoral estudia els inversors trifàsics multinivell del tipus denominat de díodes de fixació (diode-clamped converters). Aquests convertidors poden generar tres o més nivells de tensió a cada fase de sortida, i normalment s'apliquen a sistemes de gran potència ja que poden treballar amb tensions majors que els inversors clàssics. L'anàlisi es centra fonamentalment en la topologia de tres nivells, tot i que també es realitzen contribucions per a convertidors de més nivells. Els principals objectius són la proposta de nous algorismes de modulació vectorial PWM de processat ràpid, l'estudi i la compensació dels efectes dels desequilibris de les tensions dels condensadors del bus de continua, i l'anàlisi de llaços de control avançat. S'han desenvolupat diversos models que han permès obtenir resultats de simulació de les tècniques de modulació i control proposades. A més, gràcies a l'estada d'un any de l'autor al Center for Power Electronics Systems (CPES) a Virginia Tech, USA, la tesi també inclou resultats experimentals que consoliden les conclusions i metodologies presentades. Les principals contribucions es resumeixen a continuació. Es presenta un nou algorisme de modulació vectorial PWM que aprofita simetries del diagrama vectorial per a reduir el temps de processat. S'analitzen i es quantifiquen les oscil·lacions de tensió de baixa freqüència que apareixen en el punt central dels condensadors del convertidor de tres nivells. Aquesta informació permet dimensionar els condensadors donades les especificacions d'una determinada aplicació. L'algorisme de modulació també s'aplica a convertidors de més nivells. Pel cas concret del convertidor de quatre nivells, es comprova l'existència de corrents continus en els punts mitjos dels condensadors que fan que els sistema sigui inestable. Es determinen gràficament les zones d'inestabilitat. Es presenta un nou i eficient algorisme de modulació vectorial feedforward en el convertidor de tres nivells que és capaç de generar tensions trifàsiques de sortida equilibrades, malgrat l'existència de desequilibris en les tensions dels condensadors.S'estudien els efectes negatius de càrregues lineals desequilibrades i càrregues no lineals en el control de les tensions dels condensadors. Es justifica que l'existència d'un quart harmònic en els corrents de càrrega pot inestabilitzar el sistema. És determina la màxima amplitud tolerable d'aquest harmònic. S'estudia la millora en l'equilibrat de les tensions d'una connexió de dos convertidors de tres nivells al mateix bus de continua (back-to-back connection). Un exemple d'aplicació pràctica és la conversió AC/DC/AC per a l'accionament de motors d'alterna treballant amb factor de potència unitari.Finalment s'aplica un controlador òptim al convertidor de tres nivells treballant com a rectificador elevador (boost). El llaç de control LQR (Linear Quadratic Regulator) es simplifica donat que la tasca d'equilibrat de les tensions dels condensadors es dur a terme en el mateix modulador.
Detection of Defective Regions in 3D Reconstruction to Support Image Acquisition

To successfully reconstruct a three-dimensional (3D) model from images, it is necessary to make the user aware of whether sufficient data has been obtained. We propose a novel approach to detect defective regions in 3D reconstruction during image acquisition. Our method uses line-based segmentation to segment the acquired images into structural and non-structural regions. Then, using the 3D structures derived from these images, defects detected in the structural region are used to suppress spurious artifacts. Visualization of a defective region in a newly acquired image allows the user to comprehend the reconstruction state and adjust image acquisition. The proposed method was experimentally demonstrated to work successfully in a range of outdoor environments.
Evolutionary Algorithms for Single and Multicriteria Design Optimization

Introduction to Design Optimization. - Genetic and Evolutionary Algorithms as a Design Optimization Tool. - Advanced Evolutionary Algorithm Techniques. - Evolutionary Algorithms for Single Criterion Optimization. - Evolutionary Algorithms for Multicriteria Optimization. - Some Other Evolutionary Algorithms Based Methods. - Design Optimization Examples and Their Solution by Evolutionary Algorithms. - Appendix: Evolutionary Optimization System. - Appendix: C Codes for Two Design Optimization.
The Dream Factory: Alessi Since 1921

１９２０年代から１９３０年代 カルロ・アレッシィ １９５０年代から１９６０年代 １９７０年代 エットーレ・ソットサス リチャード・サパー アキレ・カスティリオーニ アレッサンドロ・メンディーニ ティー＆コーヒー・ピアッツァ アルド・ロッシ〔ほか〕
The hearing brain in males and females

Tien procent van de Westerse bevolking leidt aan een gehoorstoornis. Om de stoornissen beter te begrijpen, behandelen of genezen, moeten we achterhalen hoe het auditieve systeem functioneert bij gezonde mensen. Geluiden die we opvangen in ons oor worden in het perifere gehoororgaan omgezet in een elektrisch signaal dat verder verwerkt wordt in het centrale auditieve systeem. Zie: Samenvatting
Techniques of Patient-Oriented Research

Due to a perceived lack of training programmes for clinicians engaged in patient research, this concise step-by-step instructional manual aims to fill a void and offers the basic information needed by clinical investigators in all medical specialties. Written by experienced researchers, it provides a guide to the framework for the fundamental issues that new investigators must address; such as how to design and conduct a research study, how to prepare a grant application, how to prepare a protocol, how to protect the rights of human subjects, how to handle conflicts of interest, how to analyze the results of a study, and how to write a scientific paper based on the results obtained.
Hybrid STM/HTM for nested transactions in Java

Chapman, Keith G. Ph.D., Purdue University, December 2016. Hybrid STM/HTM for Nested Transactions in Java. Major Professor: Antony L. Hosking. Transactional memory (TM) has long been advocated as a promising pathway to more automated concurrency control for scaling concurrent programs running on parallel hardware. Software TM (STM) has the benefit of being able to run general transactional programs, but at the significant cost of overheads imposed to log memory accesses, mediate access conflicts, and maintain other transaction metadata. Recently, hardware manufacturers have begun to offer commodity hardware TM (HTM) support in their processors wherein the transaction metadata is maintained “for free” in hardware. However, HTM approaches are only best-effort: they cannot successfully run all transactional programs, whether because of hardware capacity issues (causing large transactions to fail), or compatibility restrictions on the processor instructions permitted within hardware transactions (causing transactions that execute those instructions to fail). In such cases, programs must include failure-handling code to attempt the computation by some other software means, since retrying the transaction would be futile. This dissertation describes the design and prototype implementation of a dialect of Java, XJ, that supports closed, open nested and boosted transactions. The design of XJ, allows natural expression of layered abstractions for concurrent data structures, while promoting improved concurrency for operations on those abstractions. We also describe how software and hardware schemes can combine seamlessly into a hybrid system in support of transactional programs, allowing use of low-cost HTM when it works, but reverting to STM when it doesn’t. We describe heuristics used to make this choice dynamically and automatically, but allowing the transition back to HTM opportunistically. Both schemes are compatible to allow different threads to run concurrently with either mechanism, while preserving
Computational tool for comparison of kinematic mechanisms and commonly used kinematic models

Accurate, reliable, and reproducible methods to measure the movements of human joints have been elusive. Currently, three-dimensional recording methods are used to track the motion of one segment relative to another as the joint moves. Six parameters describe the moving segment`s location and orientation relative to the reference segment: three translations (x, y, and z) and three rotations (yaw, pitch and roll) in the reference frame. The raw data can be difficult to interpret. For this reason, several methods have been developed to measure the motion of human joints and to describe the resulting data. For example, instant helical axes or screw deviation axes (Kinzell et al., 1972), the Joint Coordinate System of Grood and Suntay (1983), and the Euler angle method have been used to describe the movements of bones relative to each other. None of these methods takes into account the physical kinematic mechanism producing the joint motion. More recently, Lupichuk (1995) has developed an algorithm to find, for an arbitrary revolute, the axis` position and orientation in three- dimensional space. Each of these methods has advantages and disadvantages in analyzing joint kinematics. The authors have developed software to provide a means of comparing these methods for arbitrary, single degree of freedom, kinematic mechanisms. Our objective is to demonstrate the software and to show how it can be used to compare the results from the different kinematic models as they are applied to specific kinematic mechanisms.