Miracle-dz/UniFAR-FTUs huggingface dataset:
Detección temprana del cáncer de mama mediante la termografía en Ecuador

RESUMEN En los ultimos reportes de Quito-Ecuador ocupa el primer lugar en diagnosticos de cancer en las mujeres. Las campanas de concienciacion y las investigaciones han permitido mejorar el diagnostico y su tratamiento, pero en paises de recursos bajos y medios aun es un problema sin resolver, debido a varios factores: diagnostico en fases avanzadas y recursos insuficientes que ayuden en su pronta deteccion. Se conoce que en Ecuador por ejemplo, cerca de cuatro de cada diez mujeres diagnosticadas de cancer de mama lo son en estadios avanzados (III y IV) cuyo tratamiento es costoso y complejo. Actualmente, segun la OMS el reto para todos los paises es detectar tempranamente la enfermedad. Por tanto, se debe abordar nuevos retos, tales como la busqueda de nuevas herramientas y tecnologias costo efectivas que ofrezcan ventajas al actual metodo, que esta basado en mamografias y auto examen. El uso de nuevas tecnologias permitira identificar la enfermedad en estadios tempranos, lo que dara lugar a que la sobrevida libre de enfermedad aumente, los costos de la atencion disminuyan y el pronostico vital sea mayor. Este trabajo propone incorporar el uso de la termografia como complementaria al diagnostico precoz de bajo coste y no invasiva. Palabras clave: Procesamiento de imagenes, termografia, radiacion, metabolismo, tamizaje, deteccion precoz, segmentacion de imagenes, analisis de textura, extraccion de caracteristicas, Region de Interes-ROI. ABSTRACT Breast cancer is one of the most common cancer types among women in Quito, Ecuador. Although, awareness campaigns and researches have led to improved diagnosis and treatment, in less developed countries it still is an unresolved problem due to the diagnosis only in advanced stages and the lack of resources enabling early detection. In Ecuador, for example, about four out of ten women diagnosed with breast cancer are in advanced stages (III and IV), whose treatment is costly and complex. The World Health Organization (WHO) states that screening programs are the more efficient way to combat this disease. Therefore it is fundamental to address new researches on early detection that are cost-effective and present advantages over the current method (based on the self-examination and mammography). The identification of such disease in early stage increases the prognosis and the survival rate. This article proposes a technique to incorporate low-cost, non-invasive early diagnosis based on the use of thermal. Keywords: Image processing, thermography, radiation, metabolism, screening, image segmentation, texture analysis, texture features, Region of Interest-ROI.
Implementation of numerical modelling in anisotropic media by pseudo-spectral method

Numerical simulation or forward modelling of wave propagation is an efficient method to produce test data and examine the mechanism of wave propagation. In this paper, implementation of the numerical modelling in anisotropic media by the pseudospectral method is examined, examples of forward modelling in azimuthally anisotropic media are presented. It proves that the pseudo-spectral method is feasible and successful in modelling wave propagation in anisotropic media.
Optimal System Configuration of Web Application Servers

The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of complex enterprise applications. These applications typically run on Web Application Servers, which assume the burden of managing many tasks, such as concurrency, memory management, database access, etc., required by these applications. The performance of an Application Server depends heavily on appropriate configuration. Configuration is a difficult and error-prone task due to the large number of configuration parameters and complex interactions between them. We formulate the problem of finding an optimal configuration for a given application as a black-box optimization problem. We then propose a smart hill-climbing algorithm using ideas of importance sampling and Latin Hypercube Sampling (LHS). The algorithm is efficient in both searching and random sampling. It consists of estimating a local function and then in hill-climbing in the steepest descent direction. The algorithm also learns from past searches and restarts in a smart and selective fashion using importance sampling idea. We have carried out extensive experiments with an on-line brokerage application running in a Websphere environment. Empirical results demonstrate that our algorithm is efficient and superior than traditional heuristic methods.
Silhouette enhanced point-based rendering

With the recent advances in the 3D scanning field, the size of datasets to be displayed has increased up to billions of points. Typically, we have a dense, unstructured set of points without connectivity information. Most researchers have proposed the point-surfel association to represent the surface’s geometry and to render it using a planar approximation for each point. This paper proposes an alternative approximation, where curved surface elements (c-surfels) are employed, in order to get better adaptation to the surface to be rendered. We also use texture mapping and blending, to produce a perceptually better visualization. Improvements caused by using curved surfels instead of planar ones are especially noticeable at the object’s silhouette.
A Flexible Approach to Non-homogeneous Texture Generation

Due to the numerous applications, textures reserve significant interest in many scientific fields. Several recent works concentrate in the analysis and synthesis of textures, and they still are a very active and actual area of research in Computer Graphics. In this work, we propose a pixel-based technique, which allows the production of smooth textures and a precise patterns' visualization. Textures' patterns may move or vary along given directions or may progressively change their appearance. We implemented our algorithm incorporating much functionality in a general framework; this framework offers the possibility to generate non-homogeneous textures in a flexible and interactive way. Integrating artistic effects and performing a frames' animation is also possible, allowing the production of a variety of effects in an easy and general way.
Dependency Model using Posterior Context

We describe a new model for dependency structure analysis. This model learns the relationship between two phrasal units called bunsetsus as three categories; ‘between’, ‘dependent’, and ‘beyond’, and estimates the dependency likelihood by considering not only the relationship between two bunsetsus but also the relationship between the left bunsetsu and all of the bunsetsus to its right. We implemented this model based on the maximum entropy model. When using the Kyoto University corpus, the dependency accuracy of our model was 88%, which is about 1% higher than that of the conventional model using exactly the same features.
Java Control Flow Obfuscation

The language Java was designed to be compiled into a platform independent bytecode format. Much of the information contained in the source code remains in the bytecode, which means that decompilation is easier than with traditional native codes. As a result, software developers are taking seriously the threat of competitors using reverse-engineering to extract proprietary algorithms from compiled Java programs. We examine several technical protection techniques that could be used to hinder the reverse-engineering of software. We claim that code obfuscation is the most suitable technical protection technique that can be applied to a portable language like Java. The technique of code obfuscation involves applying obfuscating transformations to a program. These transformations make the program more di cult for a reverse-engineer to understand but do not a ect the functionality of the program. We focus on a particular category of obfuscating transformations | control ow obfuscation. Control ow obfuscations disguise the algorithms used by a program by introducing new fake control ows, creating features at the object code level which have no source code equivalent or altering the way in which statements are grouped. There are many practical aspects to be considered when applying obfuscating transformations to Java programs. The fact that Java programs are portable and are veri ed before execution makes obfuscating transformations more di cult to apply. The veri cation stage ensures that programs do not perform illegal operations, such as corrupting a user's system. Obfuscating transformations can be applied automatically to a program by a tool called an obfuscator. In this thesis, we present one possible method of implementing such an obfuscator. We rst discuss the design decisions made to address implementation problems. Then, we use the obfuscator on examples of Java code and examine how e ective the obfuscating transformations are in impeding reverse-engineering.
Algorithms for Data Intensive Applications on Intelligent and Smart Memories

Abstract : The objective of this project was to develop an algorithmic framework that enables effective and efficient mapping of data intensive applications onto Intelligent and Smart memory architectures, as well as traditional cache architectures. Intelligent memories integrate processing logic on the same chip as memory and support high bandwidth and low latency memory access to on-chip memory. Smart memory architectures provide the ability to adapt the hardware behavior by modifying the memory controllers to enhance cache and memory performance. Effective use of these novel features requires innovative mapping techniques in addition to the utilization of higher bandwidth and/or lower latency offered by these advanced architectures. This report details the research accomplished in this project. In Section 1 we present a summary of the work accomplished, highlighting some of the results and approaches investigated. Section 2 contains copies of all papers published that acknowledge this contract. Section 3 contains the final stressmark results and analysis of the methods used to optimize various data-intensive stressmarks. Section 4 contains information about the source code, including methods for building the code, and the platforms for which the code is intended. The CD included with this binder contains all of the source code used in the project, with instructions for building the code, and a soft copy of the complete report.
Contributions to optimization modeling for pension fund ALM

Pensioenfondsen vinden het moeilijk om de specifieke situatie waarin ze zich bevinden, zoals de mate van vergrijzing van de deelnemers of de hoogte van de dekkingsgraad, te vertalen naar beleggingsbeleid. Analyses tonen aan dat een simulatiemodel, dat promovendus Matthijs Streutker onderzocht, resulteert in situatie-afhankelijke beslissingen. De laatste tien jaar is pensioenfonds asset and liability management (ALM) een stuk complexer geworden door onder andere nieuwe regelgeving en de noodzaak voor een actief indexatiebeleid. De nieuwe situatie vraagt veel van modellen die gebruikt worden om pensioenfondsbeslissingen te ondersteunen. Traditioneel worden simulatiemodellen gebruikt voor pensioenfonds ALM. Beleid wordt geformuleerd in termen van beslisregels en deze worden geevalueerd in een groot aantal scenario's, die mogelijke toekomstpaden weergeven. Het toegenomen aantal en de samenhang van de beslissingen maken echter dat het lastig is om beslisregels te formuleren en evalueren die alle relevante mogelijkheden omvatten. Conceptueel gezien is de stochastische programmeringsaanpak van pensioenfonds ALM, zoals bestudeerd door Streutker, er wel toe in staat om alle (relevante) mogelijkheden te omvatten. Het streven bij stochastisch programmeren is namelijk om optimale beslissingen te bepalen bij een zeker doel, gegeven een verzameling scenario’s en beperkingen. In de praktijk blijkt het echter moeilijk om stochastische programmeringsmodellen voor pensioenfonds ALM te formuleren en op te lossen. Om de praktische waarde van stochastisch programmeren voor pensioenfonds ALM te verhogen dienen er een aantal hindernissen genomen te worden. Streutker behandelt in zijn proefschrift een aantal daarvan, zoals de implementatie van regelgeving en indexatie, de economische basis van de modellen en de beperkte oplosbaarheid. Drie van de vier onderzoeksvragen gaan over deze hindernissen, terwijl de laatste vraag ingaat op de opmerking in de eerste alinea dat pensioenfondsen het moeilijk vinden om de specifieke situatie waarin ze zich bevinden te vertalen naar beleid.
Integrating user experience into early phases of software development

Anssi Jaaskelainen INTEGRATING USER EXPERIENCE INTO EARLY PHASES OF SOFTWARE DEVELOPMENT Lappeenranta, 2011 118 p. Acta Universitatis Lappeenrantaensis 460 Diss. Lappeenranta University of Technology ISBN 978-952-265-186-0, ISBN 978-952-265-187-7 (PDF), ISSN 1456-4491 The value and benefits of user experience (UX) are widely recognized in the modern world and UX is seen as an integral part of many fields. This dissertation integrates UX and understanding end users with the early phases of software development. The concept of UX is still unclear, as witnessed by more than twenty-five definitions and ongoing argument about its different aspects and attributes. This missing consensus forms a problem in creating a link between UX and software development: How to take the UX of end users into account when it is unclear for software developers what UX stands for the end users. Furthermore, currently known methods to estimate, evaluate and analyse UX during software development are biased in favor of the phases where something concrete and tangible already exists. It would be beneficial to further elaborate on UX in the beginning phases of software development. Theoretical knowledge from the fields of UX and software development is presented and linked with surveyed and analysed UX attribute information from end users and UX professionals. Composing the surveys around the identified 21 UX attributes is described and the results are analysed in conjunction with end user demographics. Finally the utilization of the gained results is explained with a proof of concept utility, the Wizard of UX, which demonstrates how UX can be integrated into early phases of software development. The process of designing, prototyping and testing this utility is an integral part of this dissertation. The analyses show statistically significant dependencies between appreciation towards UX attributes and surveyed end user demographics. In addition, tests conducted by software developers and industrial UX designer both indicate the benefits and necessity of the prototyped Wizard of UX utility. According to the conducted tests, this utility meets the requirements set for it: It provides a way for software developers to raise their know-how of UX and a possibility to consider the UX of end users with statistical user profiles during the early phases of software development. This dissertation produces new and relevant information for the UX and software development communities by demonstrating that it is possible to integrate UX as a part of the early phases of software development.
DQMA and CRMA: new access schemes for Gbit/s LANs and MANs

Distributed-queue multiple-access (DQMA) and cyclic-reservation multiple-access (CRMA) access schemes for gigabit-per-second local and metropolitan area networks are described. These schemes are based on a slotted unidirectional bus structure, with both folded and dual-bus configurations. Like the distributed-queue dual-bus (DQDB) scheme, both the DQMA and the CRMA access schemes achieve full throughput independent of network speed and distance. They have two significant advantages over DQDB. They provide throughput fairness even at high speeds and large distances, where DQDB exhibits dramatic unfairness, and, by allowing reservation of multiple consecutive slots, they make segment labeling unnecessary and facilitate packet reassembly significantly. <<ETX>>
Video fingerprinting in compressed domain: Fingerprinting method based on motion vector:

In this thesis, a novel video fingerprinting method is proposed, in which the motion vectors extracted from the compressed stream are used to model the video fingerprint. Consequently, the generated fingerprint is then used to identify an unknown video, since a fingerprint should uniquely characterize a video. The identification process can be performed by extracting the unknown fingerprint and compare it with the original fingerprint stored inside a database. If a match is found, then the relevant information can be obtained.
A Probabilistic Study of the Average Performance of the Basis Pursuit

The ability of basis pursuit (BP) – a convex optimization procedure – to recover the sparsest possible signal representation – normally obtained by a combinatorial search – is a surprising property that has attracted considerable interest. Several recent papers established this result from a worst-case standpoint for various cases, essentially showing that if the sparsest representation is sufficiently sparse, BP will successfully recover it. However, such sparsity conditions are apparently much too restrictive. Empirical evidence suggests that for a given overcomplete dictionary, “most” sparse signals will be successfully recovered by BP, even when their sparsity is much weaker than previous analysis suggest. Recently, there has been a growing interest in the study of BP from an average-case point of view, obtaining a theoretical assessment of the performance for most signals. Two pioneering works – the first by Candes, Romberg and Tao, and the second by Donoho – set the stage for results of this flavor. In this paper we present several results paralleling Candes et. al. work and extending it. Our major contributions in this work are the treatment of general dictionaries, and the relatively simpler analysis and proofs.
Grammatical relations, thematic roles and verb semantics

Grammatical relations have always constituted a primary focus of attention in the study of language. Within the last three decades, the topicality of this trend has increasingly been determined by the quest for a universal characterization of the language faculty which has shaped the goals and directives of most current works in theoretical linguistics. Although the realization patterns and syntactic functionality of grammatical relations are subject to cross-linguistic variation, studies in comparative grammar have provided suggestive evidence that the range of variation found can often be contained within the limits fixed by a discrete set of parameters. The investigation of these parameters has broached the possibility of a universal specification of the nature of grammatical relations. This thesis proposes that such a specification should be achieved by establishing regularities in the syntax-semantics interface within a constraint-based approach to linguistic analysis that integrates a precise computational interpretation. In keeping with this objective, a unification-based categorial grammar framework is developed which incorporates the semantic insights of a Neo-Davidsonian approach to verb semantics and predicate-argument combination, where thematic roles are defined as clusters of entailments of verb meanings. This framework is extended with an integrated approach to argument selection and selection change. Properties of the resulting system are demonstrated with respect to a variety of natural language phenomena concerning grammatical function changing, unaccusativity and clitic dislocation.
Advanced Profiling of Applications for Heterogeneous Multi-Core Platforms

e increased complexity of programming on multiprocessors platforms requires more insight into program behavior, for whi programmers need increasingly sophisticated methods for profiling, instrumentation, measurement, analysis, and modeling of applications. Particularly, tools to thoroughly investigate the memory access behavior of applications have become crucial due to the widening gap between the memory bandwidth/latency compared to the processing performance. To address these allenges, we developed theQ2 profiling framework in the context of the Del Workben (DWB), whi is a semi automatic tool platform for integrated hardware/soware co-design, targeting heterogeneous computing systems containing reconfigurable components. e profiling framework consists of two parts, a static part whi extracts information related tomemory accesses during the execution of an application.We present an advanced memory access profiling toolset that provides a detailed overview of the runtime behavior of the memory access pattern of an application. is information can be used for partitioning andmapping purposes. e second part involves a statistical model that allows to make predictions early in the design phase regarding memory and hardware usage based on soware metrics. We examine in detail a real application from the image processing domain to validate and specify all the potentials of the Q2 profiling framework.
EEG (mind controlled) system with four trigger states in a multi-level haptic devices for disabled persons

This paper describes the work that has been carried out so far to establish viable, practical, low equipment and low computation cost system of a wider Electroencephalogram-Surface Electromyogram (EEG-SEMG) based control system for disabled users. The system consists of the user required to perform mental tasks for our system to achieve 4 states of switching which is picked up through the EEG sensors. The system will then use this as a trigger in order to help the disabled user operate everyday equipment (e.g. electrical appliances, operate wheel chair, or personal computer). The system is designed to be compact and low cost as it is intended that the system can be worn on the patient or carried around in the wheelchair. The setup of the equipment, the process of the experiments, the types of mental tasks that the user will be required to perform, signal processing and corresponding trigger output commands that are generated will be described.
Physically Based Rendering, Second Edition: From Theory To Implementation

Physically Based Rendering, 2nd Edition describes both the mathematical theory behind a modern photorealistic rendering system as well as its practical implementation. A method - known as 'literate programming'- combines human-readable documentation and source code into a single reference that is specifically designed to aid comprehension. The result is a stunning achievement in graphics education. Through the ideas and software in this book, you will learn to design and employ a full-featured rendering system for creating stunning imagery. New sections on subsurface scattering, Metropolis light transport, precomputed light transport, multispectral rendering, and much more.Includes a companion site complete with source code for the rendering system described in the book, with support for Windows, OS X, and Linux. Please visit, www.pbrt. org. Code and text are tightly woven together through a unique indexing feature that lists each function, variable, and method on the page that they are first described.