Miracle-dz/UniFAR-FTUs huggingface dataset:
A method for discrimination of neutron and gamma pile-up events in scintillation detectors with a simultaneous identification of malfunctioning ones

AbstractDevelopments in Analog-to-Digital Converters (ADC) in the last ve years have enableddiscrimination between pulses of various particles (e.g. neutrons and photons) in the digitaldomain in real time. The big advantage of digitizers compared to the traditional acquisition sys-tems is that the Digital Pulse Processing algorithms are implemented in a Field ProgrammableGate Array (FPGA) and can be reprogrammed at any time providing the capability to extractall the quantities of interest. One weakness of current discrimination algorithms is a lack ofcapability to process pile-up events; usually they are just rejected by the system. However,when working with high-count rates [1], a rejection of pile-up events can lead to that morethan 60 % of the data is lost. In the present research we propose a method for pile-up eventsdiscrimination that provide also a new possibility of the simultaneous identi cation of mal-functioning detectors if a few detectors are utilized in the system. The timely detection ofincorrectly working detection units is of main importance for number of traditional and novelmultichannel (detectors) installations. To accomplish these goals we propose to use correlationcoecients and wavelets. In [2] it was shown that the use of the correlations of the incomingsignal to the gamma average template in general lead to the improvement of the probability ofdetection of low energy pulses. In our present investigations we have showed that the use ofcorrelation coecients together with true pulse shapes, but separately for neutrons and gam-mas, provided a feasible method for the discrimination between neutron and gamma pile-upevents in scintillation detectors with a simultaneous identi cation of malfunctioning detectors.In this paper the results of experimental evaluation of the testing of the proposed approach aredescribed for identi cation of malfunctioning detectors and partly for discrimination betweenneutrons and gammas. Although, an optimized treatment of discrimination between neutronsand gammas signals with inclusion of overlaps by this technique will be discussed in furtherpublications.1. IntroductionThe problem of unsuspected malfunctioning of the scintillation detectors/cameras and/orother multichannel radiation detection systems is relevant for a number of various elds, med-ical, nuclear etc. Generally, to detect any abnormal behavior of the detection systems theuniformity test of the system is performed by using various radiation sources. The uniformitytest normally reveals most of malfunctions of detection array, however, some cases are stillremain dicult to identify. One of these cases is related to the situation when although, a1
Using Qualitative Methods in Organizational Research

Offering a broad description of qualitative research, this book facilitates the integration of qualitative and quantitative methods in organizational research. It examines the methods and tactics for both generating and testing management theories, including guidelines for deciding whether to use qualitative methods and overviews of four specific research designs. It describes how qualitative data is collected and analyzed and when and how to quantitatively analyze qualitative data. The author articulates the critical roles for reliability and validity and in the final chapter offers conclusions and recommendations for writing articles that report qualitative studies.
Suivi de la maturité des raisins par analyse sensorielle descriptive quantifiée des baies. Relation avec les profils sensoriels des vins et les attentes des consommateurs

L'ICV a mis au point une methode d'analyse sensorielle descriptive quantifiee (ASDQ) des raisins selon les regles de la metrologie sensorielle et en particulier la norme ISO 11035. Elle repose sur l'analyse separee de la pulpe, de la pellicule et des pepins grâce a vingt descripteurs quantifies sur une echelle structuree entre 1 et 4. Ce travail a pour objectif d'etudier l'interet de cette methode pour suivre la maturite des raisins et determiner une date de recolte adaptee aux objectifs de style de vins. Il a ete realise en 2000 sur 4 cepages (Merlot, Syrah, Grenache Noir et Chardonnay) avec 3 parcelles par cepage. A partir de 10 jours apres la veraison, les parcelles ont ete suivies deux fois par semaine avec les controles de maturite de routine. Une fois par semaine, le groupe expert ICV a etabli une ASDQ des raisins. A partir d'un degre potentiel de 12% vol., des vinifications sur des lots homogenes de 50 kg de raisins ont ete realisees 3 fois a 7 jours d'intervalle pour des vinifications sur des lots homogenes de 50 kg. Apres analyses de routine, le groupe expert ICV a realise l'ASDQ des vins. Les profils ASD des raisins et des vins evoluent avec la maturite, avec des correlations entre les profils ASDQ des raisins et ceux des vins correspondants. Certains descripteurs du raisin comme les niveaux aromatiques de la pulpe et de la pellicule semblent particulierement interessants pour caracteriser l'etat de maturite. Toutefois, le profil sensoriel complet reste indispensable comme indicateur pertinent de maturite et donc comme outil de decision de la date de recolte. Cette premiere etude permet de valider l'ASDQ des raisins comme outil de suivi de la maturite. Il est possible par analogie de faire un rapprochement entre les caracteres sensoriels des raisins et ceux des vins et d anticiper des la vigne certains elements des profils des vins (notamment le caractere secheresse ou rondeur des tanins des vins rouges). (Bulletin O.I.V., 2001, vol. 74, n° 849-850, pp. 719-728).
A Programming Model for a Forwarding Element

The architectural complexity and diversity of current network devices make them complex to manage and difficult to program. In this work, we specify a programming model for network devices that function as forwarding elements. We first identify the key packet processing functions and analyze current network devices. Next, we derive a model that consists of processing blocks to represent simple packet processing functions running on a forwarding element. We further use a processing block topology to represent how the individual packet processing functions are interconnected on the datapath. We also demonstrate how to program a forwarding element and show an example IPv4 forwarding service implementation. Finally, we evaluate programmability and the performance of the FE model.
Partial-order databases

Order is a fundamental property of information that is not explicitly captured in model database models. The partial order model introduces the idea of partially ordered sets as the basic construct for modelling data. This model exhibits two novel properties. First, it is capable of describing structure without reference to data types. Second, it inherently separates the structure of data from the objects being structured. These two properties mean that the model naturally facilitates the use of multiple structures for data. We investigate a collection of algebraic operators for manipulating ordered sets. An implementation of these operators is presented, based on the use of realizers as a data structure. An algorithm is provided for generating realizers for arbitrary finite partial orders. The partial order model is useful for data domains that involve containment or dependency relationships. Text databases and software repositories are two examples of such domains. We show how the partial order model can be used to structure text and software data, and how it provides new insights in both areas. In particular, partial orders can be the foundation of better systems for handling both tables and makefiles. Partial orders are prominent not only for data stored in databases, but for database system internals as well. Partial orders play key roles in dependency theory, object-oriented modelling, and the management of redundant data. Thus partial orders are a concept of broad importance both in understanding and implementing the fundamentals of almost any database system.
Missing Data: A Gentle Introduction

Part 1. A Gentle Introduction to Missing Data. The Concept of Missing Data. The Prevalence of Missing Data. Why Data Might Be Missing. The Impact of Missing Data. What's Missing in the Missing Data Literature? A Cost-Benefit Approach to Missing Data. Missing Data - Not Just for Statisticians Anymore. Part 2. Consequences of Missing Data. Three General Consequences of Missing Data. Consequences of Missing Data on Construct Validity. Consequences of Missing Data on Internal Validity. Consequences on Causal Generalization. Summary. Part 3. Classifying Missing Data. "The Silence That Betokens". The Current Classification System: Mechanisms of Missing Data. Expanding the Classification System. Summary. Part 4. Preventing Missing Data by Design. Overall Study Design. Characteristics of the Target Population and the Sample. Data Collection and Measurement. Treatment Implementation. Data Entry Process. Summary. Part 5. Diagnostic Procedures. Traditional Diagnostics. Dummy Coding Missing Data. Numerical Diagnostic Procedures. Graphical Diagnostic Procedures. Summary. Part 6. The Selection of Data Analytic Procedures. Preliminary Steps. Decision Making. Summary. Part 7. Data Deletion Methods for Handling Missing Data. Data Sets. Complete Case Method. Available Case Method. Available Item Method. Individual Growth Curve Analysis. Multisample Analyses. Summary. Part 8. Data Augmentation Procedures. Model-Based Procedures. Markov Chain Monte Carlo. Adjustment Methods. Summary. Part 9. Single Imputation Procedures. Constant Replacement Methods. Random Value Imputation. Nonrandom Value Imputation: Single Condition. Nonrandom Value Imputation: Multiple Conditions. Summary. Part 10. Multiple Imputation. The MI Process. Summary. Part 11. Reporting Missing Data and Results. APA Task Force Recommendations. Missing Data and Study Stages. TFSI Recommendations and Missing Data. Reporting Format. Summary. Part 12. Epilogue.
An interactive program verifier

Program verification refers to the idea that the intent or effect of a program can be stated in a precise way that is not a simple "rewording" of the program itself, and that one can prove (in the mathematical sense) that a program actually conforms to a given statement of intent. This thesis describes a software system which can verify (prove) some non-trivial programs automatically. The system described here is organized in a novel manner compared to most other theorem-proving systems. IL has a great deal of specific knowledge about integers and arrays of integers, yet it is not "special-purpose", since this knowledge is represented in procedures which are separate from the underlying structure of the system. It also incorporates some knowledge, gained by the author from both experiment and introspection, about how programs are often constructed, and uses this knowledge to guide the proof process. It uses its knowledge, plus contextual information from the program being verified, to simplify the theorems dramatically as they are being constructed, rather than relying on a super-powerful proof procedure. The system also provides for interactive editing of programs and assertions, and for detailed human control of the proof process when the system cannot produce a proof (or counterexample) on its own.
Choosing Colors for Work-Centered Support Systems for Command and Control Using a Visual Search Task

Abstract : The use of information technology to support work and aid in decision making has brought about new ways of displaying information on computer screens. The more information required, the more complex those displays have become. Goals of this research project were to 1) develop and test basic methodology for recommending complex display color coding and 2) to use results from that methodology to recommend specific changes to the Work-Centered Support System for Global Weather Management (WCSS-GWM) application. The on-going research shows how a simple laboratory search technique may be used to recommend chromaticities and other characteristics for use in current and future systems.
Phenomenon of tolerance to damage in artificial neural networks

Neural networks are computer tools with many advantages. They are powerful because of possibility of complex nonlinear systems modeling and they are user-friendly because of learning abilities. But neural networks have additional advantages. One of them is increased tolerance to damages. Technological systems are mainly not resistive for damages. Microprocessor if is even a little damaged – just doesn’t work. In contrary to this biological systems, especially brain are almost insensitive for damages – many cell can be dead or can have many malfunctions – but the brain as a whole can functioning properly. The research presented in the paper is dedicated for discovery, if neural networks, as a models of natural neural system elements, can show tolerance to damages. This assumption was experimentally proven and results of simulations showing such resistance, are presented in the paper.
Genium Data Store : Distributed Data store

In recent years the need for distributed data storage has led the way to design new systems in a large-scale environment. The growth of unbounded stream of data, the necessity to store and analyze it in real time, reliably, scalable and fast are the reasons for appearance of such systems in financial sector, stock exchange Nasdaq OMX especially. Furthermore, internally designed totally ordered reliable message bus is used in Nasdaq OMX for almost all internal subsystems. Theoretical and practical extensive studies on reliable totally ordered multicast were made in academia and it was proven to serve as a fundamental block in construction of distributed fault-tolerant applications. In this work, we are leveraging NOMX low-latency reliable totally ordered message bus with a capacity of at least 2 million messages per second to build high performance distributed data store. The data operations consistency can be easily achieved by using the messaging bus as it forwards all messages in reliable total order fashion. Moreover, relying on the reliable totally ordered messaging, active in-memory replication support for fault tolerance and load balancing is integrated. Consequently, the prototype was developed using production environment requirements to demonstrate its feasibility. Experimental results show a great scalability and performance serving around 400,000 insert operations per second over 6 data nodes that can be served with 100 microseconds latency. Latency for single record read operations are bound to sub-half millisecond, while data ranges are retrieved with sub-100 Mbps capacity from one node. Moreover, performance improvements under a greater number of data store nodes are shown for both writes and reads. It is concluded that uniform totally ordered sequenced input data can be used in real time for large-scale distributed data storage to maintain strong consistency, fault-tolerance and high performance.
WIRELESS APPLICATION PROTOCOL PERFORMANCE

Our work addresses the various performance testing aspects of the WAP architecture. For a systematic approach at first the architectural elements have to be identified. Then appropriate testing methods have to be found for testing each element and for the test of the entire architecture. In this paper we shall outline a theoretical basis for testing the influence on the performance of the wireless network and the IP backbone through the service quality parameters. First the service quality parameters are introduced from the provider and the user viewpoint, then the effect of the network (wireless and IP backbone) through bearers and transport protocol overheads on these parameters is analyzed. Conclusions are drawn regarding the results of the analysis and further steps are outlined for the refinement of our study. The results have not been confirmed by measurements yet, we are working on appropriate test scenarios to validate the outcomes and to refine our model. The final purpose of the work is to specify a performance parameter monitoring system for in-use WAP architectures that would tune the WAP parameters ‘on the fly’ in order to optimise the service quality parameters from the user viewpoint.
3D-Druck von Kunststoff-Medizinprodukten

RTejournal - Forum fur Rapid Technologie, Vol. 2012, Iss. 1 - Das Additive Manufacturing gewinnt im Bereich der Medizintechnik zur Herstellung von Prototypen bis hin zu Endprodukten zunehmend an Bedeutung. Ein groses Hemmnis stellen allerdings die relativ hohen Fertigungskosten dar. Hier bietet der verstarkte Einsatz der 3D-Drucktechnologie (3D Printing) ein erhebliches Potential zur Reduktion der Kosten. Aus dieser Motivation heraus wurde ein 3D-Druckverfahren zur Herstellung biokompatibler, sterilisierbarer Kunststoffmodelle entwickelt. Beim 3D-Druck-Verfahren handelt es sich um einen pulverbasierten Prozess zur schichtweisen Herstellung von Modellen direkt aus Computerdaten. Dabei werden dunne Schichten eines Pulvers auf eine Grundplatte aufgebracht, die dann durch gezielte Binderzugabe entsprechend des aktuellen Bauteilquerschnitts verfestigt werden. Ausgangsmaterial fur diesen Prozess ist ein Granulatgemisch auf Basis von PMMA (Polymethylmethacrylat). Als Binderflussigkeit wird ein Losungsmittel eingesetzt. Die 3D gedruckten Modelle werden nach einer entsprechenden Trocknungszeit im Pulverbett entpackt und warmgelagert, um das Abdampfen des Losungsmittels zu beschleunigen. Der Nachweis der Biokompatibilitat der hergestellten Modelle erfolgte durch einen Test nach DIN EN ISO 10993-5. In Kooperation mit Anwendern wurden verschiedene Anwendungsbeispiele wie Bohrschablonen, Otoplastiken, Gebissmodelle und Modelle fur die praoperative Planung realisiert und charakterisiert.
Implementation of Steady-State Suppression Using a Digital Signal Processor for Real-Time Processing--Evaluation of the Processing in an Actual Hall (国際ワークショップ Frontiers in Speech and Hearing Research)

In an actual hall, reverberation degrades speech intelligibility, which is the result of overlap-masking occurred when segments of an acoustic signal are affected by reverberation components of previous segments. Arai et al. (2001, 2002) have been proposed a pre-processing technique which suppresses steady-state portion of speech in order to prevent the result of overlap-masking. However, the originally proposed technique is not suitable for real-time processing. Therefore, Arai et al. (2003) suggested alternative technique based on the First Fourier Transform (FFT) with cepstral analysis in order to implement real-time processing. In this study, we successfully implemented the real-time processing of steady-state suppression based on the FFT with a digital signal processor (DSP) (Goto et al., 2005). Also, the effectiveness of the real-time processing implemented with a DSP was evaluated for younger as well as elderly people in an actual reverberant environment.
The Classification of Hash Functions

When we ask what makes a hash function`good', we usually get an answer which includes collision freedom as the main (if not sole) desidera-tum. However, we show here that given any collision-free function, we can derive others which are also collision-free, but cryptographically useless. This explains why researchers have not managed to nd many interesting consequences of this property. We also prove Okamoto's conjecture that correlation freedom is strictly stronger than collision freedom. We go on to show that there are actually rather many properties which hash functions may need. Hash functions for use with RSA must be multiplication free, in the sense that one cannot nd X, Y and Z such that h(X)h(Y) = h(Z); and more complex requirements hold for other signature schemes. Universal principles can be proposed from which all the freedom properties follow, but like most theoretical principles, they do not seem to give much value to a designer; at the practical level, the main import of our work is that one should be explicit about the properties which we require of a cryptographic algorithm. It also has some consequences for algorithm design.
A Traffic Engineering Approach to Differentiated Multicast Services over MPLS Networks

Currently, a viable solution to provide multicast provision over a multiprotocol label switch with traffic engineering (MPLS-TE) domain is unavailable because of the missing link able to couple multicast traffic distribution with an MPLS-TE enabled network. This is due to the limited or less research investigation that was done in this area. Most of the investigation methods tackle the problem individually such as deploying internet protocol (IP) multicast in a plain network or MPLS domain but without considering a combination of both technologies that is aware of differentiated services requirements. This thesis presents an alternative solution for the multicast differentiated services provision problem over a MPLS-TE enabled network. The approach is exposed and analyzed through a practical solution that was developed within a network simulation environment. The research presented in this thesis orchestrates the already available technologies offered by the multicast protocols suite and differentiated services (DiffServ) aware MPLS-TE that allows applying separately the constraint-based routing and admission control to different classes of services. The novelty and solution of this thesis relies on using MPLS constraint-based routing concepts (e.g.traffic trunks) in order to solve TE issues revealed during multicast traffic distribution.
The German Proficiency Exam at Brigham Young University: A Validation Study

THE GERMAN PROFICIENCY EXAM AT BRIGHAM YOUNG UNIVERSITY: A VALIDATION STUDY Tina G. Starr Center for Language Studies Master of Arts In order to continuously improve the teaching and learning in a language program, it is a crucial part of program evaluation to assure that its assessment instruments have a beneficial influence on the teaching and learning procedures. For that reason, evidence was gathered to investigate the validity of test scores of the German Proficiency Exam (GPE) used by the German Section of the Germanic and Slavic Languages Department at Brigham Young University. The GPE consists of seven exam components: listening comprehension, reading, writing, speaking, grammar, vocabulary, and strong verbs. The GPE component scores of 179 students were used to conduct the analysis for this study. In order to estimate the reliability of the test scores, Cronbach’s Alpha was calculated for the listening comprehension exam, the reading exam, the grammar exam, the strong verbs exam, and the vocabulary exam. In addition, the analysis included overall descriptive statistics, item facility and item discrimination, distractor analysis, ANOVA, and a post-hoc Tukey’s pairwise comparison. The results of the Cronbach’s alpha indicated relatively high reliability of scores of all the exam components except the listening component. The item and distractor analysis of the strong verbs and vocabulary exam revealed that the scoring procedures need to be revised so that the scores reflect a student’s true knowledge. The descriptive statistics of the exams showed a limited usage of the scoring range and suggest defining the scoring procedures and training the scorers. Further, it was suggested to define a general language construct and the specific construct of each language skill on the basis of which proficiency levels can be developed. Using the results of the data analysis various suggestions were given to improve the validity of scores of the GPE.