Miracle-dz/UniFAR-FTUs huggingface dataset:
Infusion Technology for Bonded CFRP Repairs

Moderne Verbundwerkstoffe, wie z.B. Kohlenstofffaserverstarkte Kunststoffe, sind heutzutage fester Bestandteil von Flugzeugstrukturen. Aufgrund der hohen gewichtsspezifischen mechanischen Eigenschaften nehmen sie in der kunftigen zivilen Flugzeuggeneration fast 50 Prozent des Strukturgewichtes ein. Ein nach wie vor unterschatztes Problem derartiger Strukturen ist die Reparatur im Falle eines Schadens. Da haufig ein Austausch unwirtschaftlich ist, muss die Struktur repariert und die notwendigen Bauteilsicherheiten wiederhergestellt werden. Hierfur sind derzeit zahlreiche Reparaturverfahren in Abhangigkeit von Schadensgrose, - art und –lokalisation verfugbar. Fur sicherheitsrelevante Primarstrukturen haben sich vor allem zwei Verfahren etabliert: das sogenannte Bolted Repair und das Bonded Patch Repair. Der Vortrag bietet einen Uberblick uber die beiden gangigen Reparaturverfahren und das Vorgehen im Schadensfall fur Luftfahrtstrukturen aus Faserverbundkunststoffen. Es werden Vor- und Nachteile beider Verfahren benannt und grundsatzliche weiterfuhrende Forschungsansatze abgeleitet. Die Analyse des Standes der Technik zeigt, dass die Vorbereitung der Reparaturstelle essenziell fur die Reparaturqualitat ist. Es wird ein Konzept zur automatisierten Bearbeitung einer Reparaturstelle fur eine geklebte Patchreparatur vorgestellt. Daruber hinaus wird ein Prozess erlautert, welcher bisherige Patchreparaturen stark vereinfacht und somit die Reparaturzeit reduzieren kann. Das neuarige Konzept basiert auf einer Kombination von Infusionstechnologie und Filmklebstoffen und bietet deutliche Vorteile fur gekrummte Strukturen. Es werden Ergebnisse eines Couponproben-programms gezeigt, um das neue Verfahren mechanisch bewerten zu konnen. Die Ergebnisse weisen nach, dass bei einer gleichbleibenden mechanischen Tragfahigkeit gegenuber dem Stand der Technik eine deutliche Prozessvereinfachung erreicht werden konnte. Die Ergebnisse deuten darauf hin, dass eine Kombination beider Konzepte vollig neue Design- und Gestaltungsmoglichkeiten fur Patchreparaturen von Luftfahrtstrukturen aus Faserverbundkunststoffen eroffnet.
A comparison of feature functions for Tetris strategies

Finding optimal strategies for the game of Tetris is an interesting NP-complete problem that has attracted several AI researchers. Their approaches display subtle variations in the implementation details, with unclear relationships between these details and Tetris performance. This, combined with the absence of confidence intervals in most published results, makes the evaluation and comparison of Tetris strategies and optimization methods very difficult. To look furhter into this unclear relationship, we would re-create every environnment described in several publications. An evolutionary algorithm was executed within each environment to create an AI and their performance compared against each other. The scores differed \textit{substantially}. This suggests that some aspects of the Tetris environment greatly affects the potentially obtainable performance of an AI. We come to the unfortunate conclusion that nearly no results of existing publications can be used to compare optimization methods against each other in terms of suitability for Tetris due to this reason.
jVIz.Rna - A tool for visual comparison and analysis of RNA secondary structures

RNA is a single stranded biomolecule which can fold back on itself, forming hydrogen bonds. Many projects exist which attempt to predict the 2 dimensional structure that will form from a given nucleotide sequence. Visualization of these predictions helps researchers to better understand the behaviour and results of their prediction algorithms. jViz.Rna is a tool designed to assist in the analysis of structure predictions with three unique features: analysis of multiple structures using seven different visualization methods, dual graphs of RNA structures which highlight the topology of the RNA, and finally, the ability to overlay a predicted structure on top of the native structure of a given RNA in all visualizations apart from dual graphs which use a different comparison method. jViz.Rna is available through http://jviz.cs. sfu.ca. It has been successfully employed on Linux, Mac OS 10.4, and Windows with Java 1.5 or greater.
Emergence of Cooperation in Heterogeneous structured populations

Real-world networks of contacts have been shown to be heterogeneous concerning their patterns of interactions. This feature contrasts with the traditional homogeneous ansatz made when studying the evolution of cooperation employing well-known social-dilemmas in the framework of evolutionary game theory, in which cooperation may be undermined by Fear and Greed. Here we show that an entirely new picture emerges whenever the pattern of interaction in populations exhibits scale-free behaviour, such that long-term collectivebeneficial behaviour easily resists short-term, self-regarding, individual behaviour. We show that Fear is more detrimental to cooperation than Greed, which ceases to be a threat in strongly heterogeneous populations. Furthermore, we show how the introduction of age correlations between individuals helps promoting cooperative behaviour. The picture emerging from our study shows that in a world in where cooperation is determined by a balance between greed and fear, cooperation constitutes a viable trait to the extent that the threat posed by fear is minor.
Mining relations in the GENIA corpus

Discovering the interactions between genes and proteins is seen as one of the core tasks in molecular biology. The quantity of research results in this area is growing at such a rate that it is very dicult for individual researchers to keep track of them. As such results appear mainly in the form of scientific articles, it is necessary to process them in an ecient manner in order to be able to extract the relevant results. Many databases exist that aim at consolidating the newly gained knowledge in a format that is easily accessible and searchable, however the creators of such databases normally make use of human readers who manually ‘curate’ the relevant papers. This is an expensive and time consuming process, besides, there might be a significant time lag between the publication of a result and its introduction into such databases. In this paper we propose a method for discovery of interactions between genes and proteins from the scientific literature, based on a complete syntactic analysis of the corpus. We report on preliminary results.
DiskReduce: RAID for Data-Intensive Scalable Computing (CMU-PDL-09-112)

Data-intensive file systems, developed for Internet services and popular in cloud computing, provide high reliability and availability by replicating data, typically three copies of everything. Alternatively high performance computing, which has comparable scale, and smaller scale enterprise storage systems get similar tolerance for multiple failures from lower overhead erasure encoding, or RAID, organizations. DiskReduce is a modification of the Hadoop distributed file system (HDFS) enabling asynchronous compression of initially triplicated data down to RAID-class redundancy overheads. In addition to increasing a cluster’s storage capacity as seen by its users by up to a factor of three, DiskReduce can delay encoding long enough to deliver the performance benefits of multiple data copies.
Software Implementation of an On-demand Multipath Routing Protocol for Multimedia Streaming in Mobile Ad hoc Networks

In ad hoc networks, link breaks between nodes happen frequently because of movement of nodes and unstable radio features. To cope with frequent topology changes, various routing protocols were proposed and submitted as RFCs. AODV (Ad hoc On-demand Distance Vector)[1] has clear advantages in its moderate overheads and its route convergence performance. However, AODV forms a single path and must rebuild a route from source to destination when a link break happens. The latency to reconstruct routes is a serious problem for live multimedia applications such as video streaming. In order to minimize delay for reconstructing routes, some researchers focus on multipath routing protocols and evaluates through simulations [2][3]. Multipath routing protocols show better performance than single path ones in simulation evaluations. However, there were few actual implementations to validate the usage of multipath routing protocols in real world. In this paper, we extend a single path AODV for multipath and implement it on laptop PCs. Extensions of RREQ/RREP packets and a routing table bring not only loop freedom but also more efficient multipath routing performance.
Structure and randomness in complex networks applied to the target set selection problem : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Manawatu, New Zealand

Advances in technology have enabled the empirical study of large, so-called ‘complex’ networks with tens of thousands to millions of vertices, such as social networks and large communications networks. It has been discovered that these networks share a non-random topology characterised mainly by highly skewed, heavy-tailed degree distributions and small average distances between vertices. The work of this thesis is to attempt to leverage the well-known topological properties of complex networks to efficiently solve difficult NP-complete problems, with the aim of obtaining better or faster solutions than would be possible for general graphs. Two related NP-complete problems are selected for study: the minimum target set problem, and the maximum activation set problem. Both problems relate to finding a ‘target set’ of vertices which is capable of initiating a spreading process (such as the spread of a rumour) that reaches a large proportion of the network. This thesis introduces several novel heuristics for these two problems inspired by the topology of complex networks. It is discovered that in many (but not all) cases it is possible to make relatively small alterations to the network that enable the computation of a considerably smaller target set than would be possible on general graphs. The evaluation of the various heuristics is entirely experimental, which required the development of procedures to generate ‘random’ networks that can be used as experimental controls. This thesis includes a survey of several popular techniques for generating random networks and finds all but one (random rewiring) to be unsuitable as controls. The validity of random rewiring relies on a somewhat obscure theorem. Although a proof of the theorem (essentially an existence proof) is already known, this thesis offers a constructive algorithmic proof. The new proof advances on the old by providing an upper bound on the maximum number of rewiring operations required to transform between networks of the same degree-sequence, whereas an upper bound could not be determined under the old proof.
Handling imperfections for multimodal image annotation

This thesis deals with multimodal image annotation in the context of social media. We seek to take advantage of textual (tags) and visual information in order to enhance the image annotation performances. However, these tags are often noisy, overly personalized and only a few of them are related to the semantic visual content of the image. In addition, when combining prediction scores from different classifiers learned on different modalities, multimodal image annotation faces their imperfections (uncertainty, imprecision and incompleteness). Consequently, we consider that multimodal image annotation is subject to imperfections at two levels: the representation and the decision. Inspired from the information fusion theory, we focus in this thesis on defining, identifying and handling imperfection aspects in order to improve image annotation.
Applicability of the Rasch Model with Varying Item Discriminations

Among the varieties of logistic models, those at tributed to Birnbaum (involving the parameters of item discrimination, item difficulty, and person ability) and Rasch (involving only item difficulty and person ability) have received attention. The present research simulated the responses of 75 subjects responding to 30 items under the Birn baum model and then attempted a fit to the data using the Rasch model. When item discriminations varied from a variance of . 05 to . 25 within distribu tions of different form (uniform, normal, and posi tively skewed), the poorest overall fit appeared within the uniform distribution. For each distribu tion there was only a slight increase in the lack of fit as the variances increased.
Meltdowns, Cover-Ups and Mutants: Pop Culture's Perversion of Nuclear Energy 1

Meltdowns as harbingers of the apocalypse. Nuclear waste causing immediate and horrific mutations. Evil CEOs covering up radioactivity leaks to make a profit. Nuclear energy is often portrayed negatively in movies and television, creating an inaccurate view of the risks associated with nuclear energy. This article will describe the portrayal of nuclear energy in movies and television, compares the perceived and actual risks of nuclear energy, and analyzes how realistic these fears are.
Design Study of a Computer System Employing Memory Compression

Memory compression is a promising technique for computer systems to increase cache and memory capacity, leading to a decrease of the number of required lower-level accesses without adding significant cost or energy consumption to a system. This thesis answers some of the questions arising when implementing a Human algorithm as compression algorithm on main memory content, such as compression factor compared to other compression algorithms and feasibility for compression in a system. This thesis contains a compression analysis of two scale-out benchmarks from CloudSuite. The two benchmarks, Data analytics and Graph analytics, were set up running on virtual machines. While the benchmarks were running, the virtual machines had their memory extracted at multiple occasions. By using the virtual-to-physical address translation for the benchmarks' processes, in combination with the extracted memory sample, it was possible to create images of the memory used by the benchmarks' processes. These images were analysed with several different compression algorithms including Huffman, B I, and FPC. The Huffman algorithm uses a value frequency table (VFT) which contains values and their frequency. The VFT is used to create the encoding for the Human tree where values with high frequency are given a short code word. A larger VFT will give a better compression factor but reduce speed, increase area and energy consumption. This thesis shows that the size of the VFT can be kept small and that the gains in compression factor of having a large VFT significantly decreased with VFT sizes over 1024 entries. The results in the compression analysis show that the memory compression factor for the two CloudSuite benchmarks is around 2.7X for a VFT with 1024 entries. In a traditional computer system blocks and pages are fixed in size. A computer system using memory compression must allow for blocks and pages to vary in size, however, it would be infeasible to allow for all different block and page sizes. The thesis shows the impact on the Huffman compression factor when only particular compression factors or compressed sizes are allowed. Four additional block addressing bits result in a compression loss of between 4%-7%. A similar analysis for pages show that adding four or six additional addressing bits result in compression losses of between 6%-9% and 1%-2%, respectively. Following the compression analysis, a few compression schemes were implemented and evaluated in hardware. One of these schemes, the Huffman coding scheme, was also implemented as part of a proof-of-concept. The proof-of-concept was implemented on a ZedBoard, an evaluation board that incorporates both a dual ARM core as well as programmable logic. The ordinary datapath between the cores and the memory was rerouted to pass through the programmable logic of the ZedBoard. In this programmable logic, the Huffman compressing and decompressing logic was implemented.
Introduction to Poisson Geometry

This minicourse aims to cover basic material in Poisson Geometry. There are no special prerequisites to follow this minicourse except for basic differential geometry. The minicourse will consist of 6 sessions: 4 lectures and 2 problem sessions. Schedule of Sessions Monday, July 28: 10:00-11:00: Lecture 1 (Eva Miranda) 14:00-15:00: Lecture 2 (Eva Miranda) Tuesday, July 29: 14:00-15:00: Problem Session 1 (Eva Miranda and Geoffrey Scott) Wednesday, July 30: 9:00-10:00: Lecture 3 (Eva Miranda) Thursday, July 31: 10:00-11:00: Lecture 4 (Eva Miranda) 16:00-16:45: Problem Session II (Eva Miranda and Geoffrey Scott) Syllabus: (1) Lecture 1: Motivation, definition and examples. (2) Lecture 2: Local Poisson Geometry: Splitting theorem and normal forms. (3) Lecture 3: Going global: Poisson cohomology, modular geometry and group actions. (4) Lecture 4: An application: Integrable Systems on Poisson manifolds. References [1] M. Adler, P. van Moerbeke and P. Vanhaecke, Algebraic Integrability, Painlevé Geometry and Lie Algebras, Ergebnisse der Mathematik 47 (2004) Springer-Verlag. [2] M. Audin, Torus actions on symplectic manifolds, Second revised edition. Progress in Mathematics, 93. Birkhäuser Verlag, Basel, 2004. viii+325 pp. [3] A. Cannas da Silva and A. Weinstein, Geometric Models for Noncommutative Algebras, Berkeley Mathematics Lecture Notes series, American Mathematical Society, 1999 [4] J.P, Dufour and N. T. Zung, Poisson Structures and Their Normal Forms , (2005), Birkhauser, Boston, MA. [5] J.J. Duistermaat, On global action-angle coordinates. Comm. Pure Appl. Math. 33 (1980), no. 6, 687–706. [6] V. Guillemin and S. Sternberg, Symplectic techniques in physics. Second edition. Cambridge University Press, Cambridge, 1990. xii+468. [7] Y. Kosmann-Schwarzbach, La géométrie de Poisson, création du XXe siècle. Siméon-Denis Poisson, 129–172, Hist. Math. Sci. Phys., Ed. Éc. Polytech. , Palaiseau, 2013. [8] C. Laurent-Gengoux, A. Pichereau and P. Vanhaecke, Poisson structures, Grundlehren der mathematischen Wissenschaften, 347, 2012. [9] C. Laurent-Gengoux, E. Miranda and P. Vanhaecke , Action-angle coordinates for integrable systems on Poisson manifolds, Int. Math. Res. Not. IMRN 2011, no. 8, 1839–1869. [10] S.D. Poisson, Sur la variation des constantes arbitraires dans les questions de mécanique, lu a l’Institut le 16 Octobre 1809, Journal de l’École polytechnique, 15ecahier, 8 (1809), p. 266–344. [11] A. Weinstein, The local structure of Poisson manifolds. , J. Differential Geom. 18 (1983), no. 3, 523–557. Departament de Matemàtica Aplicada I, Universitat Politècnica de Catalunya, Barcelona E-mail address: eva.miranda@upc.edu Department of Mathematics, University of Toronto E-mail address: geoffrey.s. scott@gmail.com Date: From July 28 to July 31 2014. 1
Accordion: An EDSL for hardware instruction set extensions

When a programmer writes code to manipulate a computer, they have a mental model of the machine, involving a small set of registers with processors executing assembly instructions atomically. The reality of a modern multiprocessor machine is significantly more complex. The exposed registers are a small amount of the internal processor state and execution of a single assembly instruction is not necessarily atomic with respect to other processors. This internal concurrency presents new challenges in producing correct hardware implementations. Applying formal verification techniques early in the design phase has the potential to increase confidence in correctness of hardware and to reduce the risk of expensive adjustments to the system architecture in later phases. Model checking [4], described in Section 2, is a technique well suited to verifying the shared state accesses present in multiprocessor hardware. However, there are many available model checkers with complementary abilities and it is unclear a priori that any one consistently yields superior results. Ideally it would be possible to swap model checkers or run several in parallel, but model checkers, such as SPIN [9], CMurphi [5], PReach [3] and SAL [2], do not have a common input language. Significant effort can be required to translate specifications from one language to another. To ease the process of supporting multiple model checkers, we have developed a domain specific language called Accordion for describing an extension to the Intel R © Architecture instruction set, Intel R © Software Guard Extensions (SGX) [10], which we introduce in Section 3. We construct Accordion as an embedded DSL in Haskell, as described in Section 4. The accompanying compiler is capable of produc-
Face Detection in Real Time Based on HOG

Naturally before recognizing a face, it must be located in the image. In some cooperative systems, face detection is obviated by constraining the user. Most systems use a combination of skin-tone and face texture to determine the location of a face and use an image pyramid to allow faces of varying sizes to be detected. Increasingly, systems are being developed to detect faces that are not full frontal. This paper proposes a design to detect faces in real time using hog descriptor. Taking HOG of the image and calculate the weights which contributes for the facial features. Positive weights with facial features like eyes, nose, and mouth are marked completely to visualize a face. This algorithm continuously detects the face from +90 0 to -90 0 rotations even for occluded faces with high
PREDICTION OF INFECTIOUS DISEASES:AN EXCEPTION REPORTING SYSTEM

In this paper prediction methods are discussed in the context of developing an exception reporting system for laboratory reports. The detection of outbreaks and longer term trends is briefly addressed, before a consideration of data types and availability to be used in evaluating the prediction methods. Four general prediction methods are outlined and the selection of data to which they are applied is examined. Both real and simulated data are used to evaluate the prediction methods and a strategy for an exception reporting system is proposed.
Van ratatouille tot Michelin diner: ingrediënten voor de behandeling van boulimia nervosa in negen gangen

1en Jacomien van der Linden 2 samenvatting De behandeling van patienten met boulimia nervosa kan een therapeut nogal wat hoofdbrekens bezorgen. Somatische risico’s, een patienttype dat graag de regie wil, een lastig te beinvloeden lichaams- en zelfbeeld, en comorbiditeit, zijn zomaar wat voorbeelden waardoor therapeuten soms moedeloos kunnen worden. Met dit artikel willen we hen stimuleren vooral cognitieve gedragstherapie, de voorkeursbehandeling, te (blijven) doen. Inclusief de – veelal als lastig ervaren – gedragsexperimenten. In deze klinisch getinte bijdrage zetten wij negen onderdelen op een rij waaraan aandacht besteed moet worden in de evidence-based behandeling van boulimia nervosa.