Miracle-dz/UniFAR-FTUs huggingface dataset:
The Failure Phenomenon: A Critique

Throughout every day life there are many events encountered where their causes, mechanisms of development and consequences are very diverse. In undertaking a safety or risk assessment it is the concept of the events´ description that is often of importance. In pure technical applications these events are related to the occurrence of failure, be it of equipment, a device, a system or an item. The theory speaks about failure itself, its mechanisms and circumstances of occurrence, but at the same time appropriate terminology is needed to describe these conditions. For observing, dealing and handling failures a probabilistic or deterministic (logic) approach can be followed. This paper considers the complex, sometimes problematic, area of the term “failure” and its related characteristics. The contribution aims to detail the total complexity of this fundamental term. A two fold objective approach is taken. The primary objective is to address each of these complexity issues providing an understanding of the key concepts and classifications. These are related to the functions of an object and their description, classification of failures, the main characteristics of failure, the possible causes of failure, mechanisms of failure and consequences of failure. Each of these issues can be subdivided and engineering examples are used to illustrate and differentiate between such subdivisions, for example to distinguish for failure occurrence the meaning of design failures, manufacturing failures and ageing failure etc. The secondary objective is related to information sources. To gain information about a failure it may need to be found or transferred from a variety of sources, these sources have been identified and discussed. In conclusion the paper serves to form a complete picture to aid the understanding and implications of failures.
EXPLORATION ON SCALABILITY OF DATABASE BULK INSERTION WITH MULTITHREADING

The advancement of database engine and multi-core processors technologies have enable database insertion to be implemented concurrently via multithreading programming. The objective of this work is to evaluate the performance of using multithreading technique to perform database insertion of large data set with known size to enhance the performance of data access layer (DAL) particularly on the bulk-insertion operation. The performance evaluation includes techniques such as using single database connection, multithreads the insertion process with respective database connections, single threaded bulk insertion and multithreaded bulk insertion. MySQL 5.2 and SQL Server 2008 were used and the experimental results show that the performance of databases do not scale linearly with the number of threads. This work justifies our intention in developing a smart data access layer that autonomously decides the number of threads to spawn in order to improve the performance of the DAL.
CIS-positive: Combining Convolutional Neural Networks and SVMs for Sentiment Analysis in Twitter

This paper describes our automatic sentiment analysis system ‐ CIS-positive ‐ for SemEval 2015 Task 10 “Sentiment Analysis in Twitter”, subtask B “Message Polarity Classification”. In this system, we propose to normalize the Twitter data in a way that maximizes the coverage of sentiment lexicons and minimizes distracting elements. Furthermore, we integrate the output of Convolutional Neural Networks into Support Vector Machines for the polarity classification. Our system achieves a macro F1 score of the positive and negative class of 59.57 on the SemEval 2015 test data.
Combining JPEG2000 Compressed Formats and OGC Standards for Fast and Easy Dissemination of Large Satellite Data

This article explores ways for disseminating huge dataset imagery compressed in JPEG2000 using OGC standards. Some web service protocols are analyzed and tested (Web Map Service, Web Feature Service, Web Coverage Service, etc) but special attention is given to the new Web Map Tile Service (WMTS) standard that has been recently approved by the OGC Technical Committee. A WMTS server exposes a structure of resolution levels that are cut in small and uniform tiles in a very similar way that JPEG2000 internally does. We discuss how JPEG2000 and WMTS can be combined together and the advantages and disadvantages versus a more common approach based on prerendered classical JPEG or PNG tiles or versus JPIP approaches. Among the different architectures, it is worth mentioning a WMTS server that uses one or some JPEG2000 images internally and serves images to a thin client (a web browser) in a more classical format like JPEG, PNG etc. In this case, WMTS tile matrix set structure can be used to describe the internal structure of the tiled JPEG2000 images to the client, guaranteeing an optimum performance and taking profit of the Internet caching mechanisms.
Special applications of the voting model for bridging faults

It is shown that the most accurate bridging fault model, the voting model, could be generalized. In particular, details on how to handle the Byzantine general's problem, IC fabrication process variations, complex gates, and transistor size variations are presented. An example using BDDs to represent the voting model and to compare it to other fault models is presented. The relationship between bridging faults and delay faults is discussed, demonstrating that delay tests make poor bridging fault tests. It is concluded that the voting model is a logic-level model which accurately models real faults in real circuits.
An experimental study of load balancing on Amoeba

The paper presents the results of an experimental study of load balancing using job initiation and process migration, carried out on Amoeba (A.S. Tanenbaum et al., 1990). The results indicate the need for a load balancing facility in a distributed system to improve system performance, e.g., the average response time of processes. A number of load balancing algorithms, including the bidding and neighbouring algorithms, have been studied in this work. A comparison between these algorithms under various conditions is presented, which indicates that in a system with 10-20 computers, a centralized algorithm outperforms a distributed one and job initiation plays an important role in a load balancing scheme. We also point out some requirements for an operating system in order to support an efficient load balancing facility, on the basis of our experience. We conclude with a summary of our experiences and suggestions for further work. <<ETX>>
Retrieval of multi-scale roughness parameters and soil moisture by numerical inversion

The aim of this present work is to find an inverse model to retrieve roughness geometric and dielectric parameters of natural rough surfaces from radar backscattering data. The bi-dimensional surfaces are described by means of the fractional Brownian motion random process, using the bi-dimensional wavelet transform. Multi-scale roughness is characterized by two parameters, the first one proportional to the standard deviation and the other one related to the fractal dimension. Soil moisture is related to the complex dielectric constant. To simulate radar backscattering we used the small perturbation model in which the radar backscattering coefficient can be expressed as the product of two factors, the first dependent on polarisation but independent of surface roughness and vice versa the second dependent on roughness but independent of polarisation. Thus, this model simplifies the procedure of inversion and the co-polarised ratio between hh and vv polarisation is independent of roughness and a minimisation over only two parameters is performed to retrieve the complex dielectric constant independently of the employed geometric surface description. Once the dielectric constant is known, the retrieval of multi-scale surface roughness parameters is performed in a successive step by using multi-frequency and multi-incident angle data.
Defmacro for C: Lightweight, Ad Hoc Code Generation

We describe the design and implementation of CGen, a C code generator with support for Common Lisp-style macro expansion. Our code generator supports the simple and ecient management of variants, ad hoc code generation to capture reoccurring patterns, composable abstractions as well as the implementation of embedded domain specic languages by using the Common Lisp macro system. We demonstrate the applicability of our approach by numerous examples from small scale convenience macros over embedded languages to real-world applications in high-performance computing.
Multiple-level partitioning: an application to the very large-scale hardware simulator

With modern technology, a very-large-scale system may contain several million gates. To achieve an optimal multiple-level partitioning of such a system onto a fixed hierarchy hardware accelerator presents a formidable challenge to even the fastest computing engines currently available. The application of a divide-and-conquer heuristic coupled with a novel ratio-cut algorithm that solves the above problem under a variety, of constraints is described. The goal of this approach is to minimize the communication cost in the hierarchy. Experiments with designs containing up to two million gates are described, and it is demonstrated that the proposed approach decreased communication costs by a factor of two or more when compared with other approaches. This approach enables the hardware simulator to perform approximately three billion gate evaluations per second. or approximately 200 million event evaluations in an event-driven simulator, using a 6% activity rate. >
Polymorphic Attacks and Network Topology: Application of concepts from Natural Systems.

The growing complexity of interactions between computers and networks makes the subject of network security a very interesting one. As our dependence on the services provided by computing networks grows, so does our investment in such technology. In this situation, there is a greater risk of occurrence of targeted malicious attacks on computers and networks, which could result in system failure. At the user level, the goal of network security is to prevent any malicious attack by a virus or a worm. However, at the network level, total prevention of such malicious attacks is an impossible and impractical objective to achieve. A more attainable objective would be to prevent the rampant proliferation of a malicious attack that could cripple the entire network. Traditional Intrusion Detection Systems (IDSs) focus on the detection of attacks at the individual nodes, after a malicious code has entered individual machines in a network. However, repeated failures of conventional IDSs have led researchers to develop methods that integrate detection systems in networks and use their collective intelligence to defend against malicious attacks. Such approaches utilize the synergistic power generated by the network, as nodes share prior and current knowledge of detected attacks and related information with other nodes.
FDMSWAP: Formal Development Methodology for Secure Web Applications

Computer security is beyond the external protections of software systems. Main concern lies inside the software systems due to weak and non-verified design. A significant portion of the software security problems lies within the software itself. Internal software security is more critical as compared to external protections. Many techniques and methodologies have been developed to address the issues of internal security of software systems. Threat modeling is one of such techniques. Threat modeling is a methodology performed at the early stages of software development. In threat modeling all possible threats to software systems can be identified. Also mitigation measures are generated as part of this process. Threat modeling methodologies such as Secure Development Lifecycle (SDL) and Threat Analysis Methodology (TAM) practicing in industry and academia rely on informal and semi-formal techniques. These techniques lead to inconsistencies in the design of systems due to ambiguities of these techniques. Formal methods are based on mathematics and used for specification, analysis and design of software systems. By using formal methods software systems can be analyzed and verified at the design level. As a result of this, more accurate, reliable and inconsistencies free software systems can be produced. In this paper, a new methodology based on formal methods has been introduced for developing secure web applications. The central idea of this methodology: Formal Development Methodology for Secure Web Applications (FDMSWAP) is threat modeling process to extract security requirements at the early stages of software development and to integrate these security properties into the design of software. Then the resulting design is analyzed, verified and validated by using formal methods Event-B and RODIN.
Refining syntactic sugar: tools for supporting macro development

Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs into a small core language; unlike Lisp systems, Scheme macro expanders preserve lexical scoping, and advanced Scheme macro systems handle other important properties such as source location. Using such macros, Scheme programmers now routinely develop the ultimate abstraction: embedded domain-specific programming languages. Unfortunately, a typical Scheme programming environment provides little support for macro development. The tools for understanding macro expansion are poor, which makes it difficult for experienced programmers to debug their macros and for novices to study the behavior of macros. At the same time, the language for specifying macros is limited in expressive power, and it fails to validate syntactic correctness of macro uses. This dissertation presents tools for macro development that specifically address these two needs. The first is a stepping debugger specialized to the pragmatics of hygienic macros. The second is a system for writing macros and specifying syntax that automatically validates macro uses and reports syntax errors.
Cascade Selective Window for Fast and Accurate Object Detection

Several works help make sliding window object detection fast, nevertheless, computational demands remain prohibitive for numerous applications. This paper proposes a fast object detection method based on three strategies: cascade classifier, selective window search and fast feature extraction. Experimental results show that the proposed method outperforms the compared methods and achieves both high detection precision and low computation cost. Our approach runs at 17ms per frame on 640× 480 images while attaining state-of-the-art accuracy.
An Examination of Algebra for All through Historic Context and Statewide Assessment Data

Since 2003, California has enacted a policy through its education accountability system that encourages schools and districts to place all 8th grade students into algebra courses and therefore, be tested in algebra in the statewide assessment program. Ten years later, there are a great many more 8th graders taking algebra now. However, there are also many students repeating algebra, instead of going on taking higher level mathematics tests. This article aims to provide the historic context of this policy, previous and recent studies on 8th grade algebra, and our study based on the California Standardized Testing and Reporting (STAR) data. We analyzed 8th grade algebra test-taking and the following years’ higher level mathematics test-taking to examine the college preparation course taking pipeline. Our longitudinal study compared two groups of students’ performance on 9th grade algebra between those who previously scored below proficient on algebra at 8th grade and those who scored proficient or above on general mathematics at
Synthesisable VHDL model of a Java Virtual Machine for HAL

The aim of this final year project was to implement a Java Virtual Machine on an FPGA. The FPGA is located on a hardware learning board used by second year Computer Science and third year Engineering students as part of their coursework. The introduction of a JVM to this hardware will enable students to program the FPGA with Java in place of lower level languages such as Assembly or VHDL, VHDL being the language currently in use. This project is part of a continuing effort to upgrade the learning boards from the Motorola MC68008 microprocessor technology which has been part of the course for many years. It built upon the final year project of Ross Brennan. His project involved implementing a RISC microprocessor in place of the CISC architecture which was there and resulted in a prototype project board being designed and assembled. It was one of these boards which was used here. The JVM implemented on the upgraded board originated as part of a PhD thesis at the Technical University of Vienna, Austria. It is an optimized JVM designed specifically for Altera software and the Cyclone board. As part of the project the original VHDL code was altered to run on Xilinx software and the Virtex-II board which the students will be working with∗†. ∗All typesetting for this report was done with LaTeX tools †All diagrams, except Figure 4.1, in this project were produced using Photoshop 7.0
An objects-first approach to teaching introductory software development

Software development (SD) refers to design and development of software applications. Most educational institutions teach introductory modules in SD using a procedural paradigm and an imperative language. Modules are often delivered in the first semester of the first year of a degree or diploma programme. Whereas, the procedural approach to SD may be considered suitable for teaching programming-in-the-small, it is not entirely appropriate for teaching the principles of programming: there are numerous inherent issues on the approach. This paper discusses the traditional method to teaching SD and suggests an objects-first approach where students adopt a top-down method of learning to develop software. Our model is imperative in nature but introduces functions and modules as basic building blocks for producing software. Thus, students' first programs are written as sequences, selections and iterations of given functions and it is in the later stages of the course, when they write their own modules after they learn the basic constructs of the language. Our method places an emphasis on SD as an engineering activity. This paper also discusses the issues concerning the choice of first programming languages and outlines a complete scheme for teaching a first course in SD.
A 30-ns 64-Mb DRAM with built-in self-test and self-repair function

A 64 Mw*1 b/16 Mw*4 b DRAM with 30-ns access time which uses a double-metal layer and 0.4- mu m CMOS technology is reported. The external power supply is 3 V, while memory cell arrays operate at 2.2 V. Key circuits for the 64-Mb DRAM are (1) a latched-sense, shared-sense circuit with open bit-line read-out and folded bit-line rewrite operations (LOF) to reduce inter-bit-line coupling noise, (2) alternatively activated and separately end-located word drivers and X decoders to reduce word-line selection delay, and (3) built-in self test and repair circuits using spare memory cells to reduce test costs and increase chip reliability. >
A New Kind of Real‐Time PPP Method for GPS Single‐Frequency Receiver Using CORS Network

Rapid and precise positioning using cheaper single-frequency receivers in wide areas has become one of the research hot spots in present satellite geodesy field. The author proposes a new real-time modeling method based on regional CORS network. A new precise point positioning service for single-frequency receiver is also designed and realized. Through serial analysis of practical examples from the CORS networks of Shanxi Province, Hubei Province and Wuhan in China, this paper testifies the feasibility of providing real-time positioning service for single-frequency users based on the above methods developed. Results verify that, for reference network with station separation of less than 71 km, user's SD L1 ambiguity can be fixed within several seconds. Once the ambiguity is fixed, single-frequency user could gain rapid and cm-level positioning service in absolute positioning mode. Our work provides a new way of rapid and precise point positioning using single-frequency receivers.
An improved Multiple Description Scalable Coding for Video Transmission over Unreliable Networks

Developing real time multimedia applications for best e ﬀ ort networks such as the Internet requires prohibitions against jitter delay and frame loss. This problem is further complicated in wireless networks as the rate of frame corruption or loss is higher in wireless networks while they generally have lower data rates compared to wired networks. On the other hand, variations of the bandwidth and the receiving device characteristics require data rate adaptation capability of the coding method. Multiple description Scalable Coding (MDS) methods are used to solve the jitter delay and frame loss problems by making the transmitted data more error resilient, however, this results in reduced data rate because of the added overhead. MDS methods do not address the bandwidth variation and receiver characteristics di ﬀ erences. In this paper a new method based on integrating MDS and the scalable coding extension of H.264 standard is proposed. Our method can handle both jitter delay and frame loss, and data rate adaptation problems. Our method utilizes motion compensating scheme and, therefore, is compatible with the current video coding standards such as MPEG-4 and H.264. Based on the simulated network conditions, our method shows promising results and we have achieved up to 38.3607dB for average Y-PSNR.
EFFICIENT 2D SOFTWARE RENDERING

The market of computer graphics is dominated by GPU based technologies. However today's fast central processing units (CPU) based on modern architectural design offer new opportunities in the field of classical software rendering. Because the technological development of the GPU architecture almost reached the limits in the field of the programming model, the CPU-based solutions will become more popular in the near future. This paper reviews the problems and opportunities of two-dimensional rendering from a practical point of view. An efficient, software based rasterization method is presented for textures having a transparent color component. The applicability of the solution is proved through measurement results compared to other methods and the GPU based implementation.
The Many Different Ways of Saying Mobile: The Natural History of Mhealth at EMBC

Technologies for providing mobile healthcare, or mHealth, form a major part of the IEEE Engineering in Medicine and Biology Conference (EMBC) today. This paper investigates the history of mHealth at EMBC, assessing the current state of the field and its direction. The results show a very healthy, and also very diverse, subject that is intrinsically at the interface of many different underlying technologies.
AUTOMATIC CAMERA ORIENTATION AND STRUCTURE RECOVERY WITH SAMANTHA

SAMANTHA is a software capable of computing camera orientation and structure recovery from a sparse block of casual images without human intervention. It can process both calibrated images or uncalibrated, in which case an autocalibration routine is run. Pictures are organized into a hierarchical tree which has single images as leaves and partial reconstructions as internal nodes. The method proceeds bottom up until it reaches the root node, corresponding to the ﬁnal result. This framework is one order of magnitude faster than sequential approaches, inherently parallel, less sensitive to the error accumulation causing drift. We have veriﬁed the quality of our reconstructions both qualitatively producing compelling point clouds and quantitatively, comparing them with laser scans serving as ground truth.