Miracle-dz/UniFAR-FTUs huggingface dataset:
Evaluation of an integrated holdup measurement system using the GGH formalism with the M{sup 3}CA

Nuclear facilities need portable, automated tools based on gamma-ray spectroscopy to perform plantwide assays of special nuclear materials (SNM) deposited as holdup in processing equipment. These assays satisfy such nuclear material control functions as obtaining or verifying SNM inventory quantities, assuring safe operating conditions, and quantifying SNM for decontamination and decommissioning. A new, integrated holdup measurement system designed to meet these requirements has been evaluated quantitatively for holdup assays. The hardware for the integrated holdup measurement system consists of a compact gamma-ray detector with collimation and shielding, a self-contained portable gamma-ray spectroscopy instrument, and a palm-size programmable control and data-storage unit. The application software, called HMSII (Holdup Measurement System II) masks the sophistication of the hardware and data analysis with a simple user interface. The heart of the integrated holdup measurement system is the generalized-geometry holdup (GGH) calibration and analysis formalism. The GGH formalism is based on the simplifying assumptions that each of hundreds of holdup deposit geometries in the facility can be interpreted as one of three simple geometric models (point, line, or area) to reduce the calibration and analysis effort to manageable proportions. Results obtained over a 4-yr period will be presented. Because of the reproducibility of setup and data treatment under HMSII automation, it is straightforward to repeat the assays of static equipment over extended periods of time with multiple users. This new integrated measurement system improves the precision and reliability of holdup measurements.
Mathematical techniques for analyzing concurrent and probabilistic systems

On streams and coinduction: Preface Acknowledgments Streams and coinduction Stream calculus Analytical differential equations Coinductive counting Component connectors Key differential equations Bibliography Modelling and verification of probabilistic systems: Preface Introduction Discrete-time Markov chains Markov decision processes Continuous-time Markov chains Probabilistic timed automata Implementation Measure theory and probability Iterative solution methods Bibliography.
HelpMate: A robotic courier for hospital use

HelpMate has been designed to perform fetch and carry tasks while exhibiting humanlike behavior as it navigates down crowded hallways in the hospital. The tasks typically performed by the robot are carrying late meal trays, sterile supplies, medications, medical records, reports, samples, specimens, and mail. HelpMate is able to traverse the main arteries of hospitals, crossing between the buildings using interconnected corridors and elevators. Odometry-based navigation is enhanced by sonar, infrared, and vision sensors which aid in obstacle detection and avoidance maneuvers. A map of the hospital is made available to HelpMate, from which it is able to generate a path from any location in the hospital to any destination. An extremely simple human interface has been specially designed for this application. The onboard screen, emergency stops, warning lights, turn signals, and pause buttons provide easy and quick interaction with the system. <<ETX>>
On a Proof of the Convergence Speed of a Second-order Recurrence Formula in the Arimoto-Blahut Algorithm

In [8] (Nakagawa,et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order O (1 /N ) was analyzed by focusing on the second-order nonlinear recurrence formula consisting of the ﬁrst- and second-order terms of the Taylor expansion of the deﬁning function of the Arimoto-Blahut algorithm. However, in [8], an inﬁnite number of inequalities were assumed as a “conjecture,” and proofs were given based on the conjecture. In this paper, we report a proof of the convergence of the order O (1 /N ) for a class of channel matrices without assuming the conjecture. The correctness of the proof will be conﬁrmed by several numerical examples.
Freeway Travel Time Prediction with State-Space Neural Networks: Modeling State-Space Dynamics with Recurrent Neural Networks

An approach to freeway travel time prediction based on recurrent neural networks is presented. Travel time prediction requires a modeling approach that is capable of dealing with complex nonlinear spatio-temporal relationships among flows, speeds, and densities. Based on the literature, feedforward neural networks are a class of mathematical models well suited for solving this problem. A drawback of the feed-forward approach is that the size and composition of the input time series are inherently design choices and thus fixed for all input. This may lead to unnecessarily large models. Moreover, for different traffic conditions, different sizes and compositions of input time series may be required, a requirement not satisfied by any feedforward data-driven method. The recurrent neural network topology presented is capable of dealing with the spatiotemporal relationships implicitly. The topology of this neural net is derived from a state-space formulation of the travel time prediction problem, which is in line with traffic flow theory. The performance of several versions of this state-space neural network was tested on synthetic data from a densely used highway stretch in the Netherlands. The neural network models were capable of accurately predicting travel times experienced, producing about zero mean normally distributed residuals, rarely outside 10% of the real expected travel times. Moreover, analyses of the internal states and weight configurations revealed that the neural networks could develop an internal model linked to the underlying traffic processes.
How active are students in online discussion forums

The role of discussion forums is an essential part of online courses in tertiary education. Activities in discussion forums help learners to share and gain knowledge from each other. In fully online courses, discussion forums are often the only medium of interaction. However, merely setting up discussion forums does not ensure that learners interact with each other actively and investigation into the type of participation is required to ensure quality participation. This paper provides a general overview of how fully online students participate in discussion forums and the correlation between their activity online and achievement in terms of grades. The main benefit of this research is that it provides a benchmark for the trend of participation expected of the fully online introductory information technology and programming students. Investigating the participation and the factors behind online behaviour can provide guidelines for continual development of online learning systems. The results of the data analysis reveal that a high number of students are not accessing or posting in the discussion board. Results also show that there is a correlation between activity of students' in online forums and the grades they achieve. Discussion about the findings of data analysis and the lessons learned from this research are presented in this paper.
Reinforcement learning under space and time constraints

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva. nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.
Applying Keystroke Dynamics for Personal Authentication

With the establishment of the information society, security had become the greatest concern for Institutions transacting business over the Internet. Home banking and on-line brokerage applications currently, use basic software-only security functions for the internet such as server authentications and Secure Sockets layer. Higher levels of protections are being achieved with Smart card based authentication schemes and transaction protocols. Password based security identifies users based on what they know – the password or PIN, which can be guessed, hacked, found or stolen. Smart Cards, tokens and badges identify users based on what they have which can also be lost, loaned or stolen. The objective of the thesis was to design and implement a biometric authentication scheme by means of keystroke dynamics to secure web applications. The scheme illustrates the effect of the template size and the number of biometric features used to improve performance of FAR, FRR and EER. The enrollment process is devoid of spurious outliers that may introduce significant variations to template data. Due to the dependence of the system on the user’s psychological characteristics, the adaptation module introduces dynamism into the template features per changes in the legitimate user’s login template variants. At the quest of attaining a zero bias in statistical variants, an off-line simulator tool was designed to regenerate impostor and genuine data set obtained from live users and set as input to the system. The report includes an architectural description of the system, conceptual models and analysis of field data of over 200 samples.
Functional Fibonacci to a Fast FPGA

Through a series of mechanical transformation, I show how a three-line recursive Haskell function (Fibonacci) can be translated into a hardware description language—VHDL—for efficient execution on an FPGA. The goal of this report is to lay the groundwork for a compiler that will perform these transformations automatically, hence the development is deliberately pedantic. 1 Transforming fib into simple tail recursion We begin by importing some types and a test generation library:1 import Data.Int ( Int8 , Int32 ) import Test . QuickCheck Below is our starting point: a naive, recursive algorithm to compute Fibonacci numbers coded in Haskell. This is a terribly inefficient way to compute these numbers (an O(2n) algorithm instead of O(n)), but we will use it to illustrate our implementation strategy for recursive functions. We restrict the domains of the argument and result to simplify the hardware and illustrate how to mix different types of integers. fib :: Int8 → Int32 fib 1 = 1 fib 2 = 1 fib n = fib (n−1) + fib (n−2) We will build exactly one instance of a circuit for computing the fib function, so the two recursive calls may not be performed in parallel. Instead, we will schedule one before the other, followed by the addition of their results. To express this sequencing, we transform the code to continuation-passing style [1]. To each function, this adds a continuation argument k: a function to which the result will be passed as an argument. The result of each function call is passed to a continuation that represents the rest of the computation in which the function call appeared. fibc 1 k = k 1 fibc 2 k = k 1 fibc n k = fibc (n−1) ( λ n1 → fibc (n−2) ( λ n2 → k (n1 + n2))) fib ’ n = fibc n ( λ x → x) ∗Much of this work arose from discussions with Jared Pochtar, Satnam Singh, and Simon Peyton Jones. 1This report is written a in a “Literate Programming” style. All the Haskell and VHDL code fragments have been extracted directly from this document into source files and run through their respective compilers for verification.
Overview of the Fujitsu VPP500 supercomputer

The authors present an overview of the Fujitsu VPP500 vector parallel processor. The VPP500 is a high-performance, highly parallel distributed memory system. A crossbar network interconnects 4 to 222 processing elements, which gives a maximum system performance of up to 355 GFLOPS and an aggregate memory capacity of at most 55 Gbyte. The UNIX SVR4-based operating system, modified for the VPP500's distributed memory environment, supports the FORTRAN77 compiler to present the programmer with a high-performance, shared memory paradigm. <<ETX>>
Genetic programming : First European Workshop, EuroGP'98, Paris, France, April 14-15, 1998 : proceedings

A review of theoretical and experimental results on schemata in genetic programming. - Where does the good stuff go, and why? how contextual semantics influences program structure in simple genetic programming. - Fitness causes bloat: Mutation. - Concepts of inductive genetic programming. - Immediate transfer of global improvements to all individuals in a population compared to automatically defined functions for the EVEN-5,6-PARITY problems. - Non-destructive depth-dependent crossover for genetic programming. - Grammatical evolution: Evolving programs for an arbitrary language. - Genetic programming bloat with dynamic fitness. - Speech sound discrimination with genetic programming. - Efficient evolution of asymmetric recurrent neural networks using a PDGP-inspired two-dimensional representation. - A cellular-programming approach to pattern classification. - Evolving coupled map lattices for computation. - Genetic programming for automatic design of self-adaptive robots. - Genetic modelling of customer retention. - An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. - Building a genetic programming framework: The added-value of design patterns. - Evolutionary computation and the tinkerer's evolving toolbox. - A dynamic lattice to envolve hierarchically shared subroutines.
Intrusion Detection & Prevention of Denial of Service Attacks in AODV Based MANET With Authentication Based Scheme

Mobile Ad hoc network typically identifies a process of network elements in which combine to make a network requiring no fixed infrastructure. Security will be the most generally cited concern about wireless Ad hoc network. Wireless networks pose exclusive security difficulties. The New Security Structure for mobile Ad hoc Network protects the data from several securities threats and as well leads to really low computational complexness. The detection of attacks where such destructive node exists will make it possible for us to stop that attack for more transmission. This supplies a proper strategy to detect this malicious attack such as Black Hole & Gray Hole. The actual propose Methodology First safeguard the network from repudiation my partner i. e. prevents often sender or may be receiver by denying involving sending or receiving a data supply using Zero Knowledge Protocol (ZKP) as the Authentication Structure for making certain the authenticity of the sender node. The system also used to detect Cloning attack. Next, if a further attack happens the scheme is utilized to providing a remedy for detection & reduction of destructive attacks using Extended Data routing Information (EDRI) table in addition to the routing table of AODV. Additionally, it maintains a history of earlier malicious node with regard to gray actions. The EDRI method is presented but is not implemented in NS-2 to provide a useful performance component such asPacket Deliver Rate by the number of nodes, Latency, Average End to End Delay, Packet Delivery Ratio. Keywords— MANET; Secure Routing; Black Hole Attack; Gray Hole Attack; Clone Attack; AODV; Zero Knowledge Protocol; Extended Data Routing Information(EDRI)Table.
The Document Representation Problem: An Analysis of LSI and Iterative Residual Rescaling

Important text analysis problems in information retrieval and natural language processing, such as document clustering and automatic text summarization, require accurate measurement of inter-document similarity. The goal of this work is to find methods for automatically creating document representations in which inter-document similarity measurements correspond to human judgment. We present a new model for the task of creating document representations. From this model, we derive a new analysis of Latent Semantic Indexing (LSI), which is one of the successful approaches that has been studied extensively. In particular, we show a precise relationship between LSI''s performance and the uniformity of the underlying distribution of documents over topics. As a consequence, we propose a novel alternative method called Iterative Residual Rescaling (IRR), that, crucially, compensates for distributional non-uniformity. Experiments over a variety of practically-encountered settings and with several evaluation metrics validate our theoretical prediction and confirm the effectiveness of IRR in comparison to LSI. We also propose several extensions including a new document sampling method to scale IRR up to large document collections. Comparison with random sampling provides further empirical evidence that performance can be improved by counteracting non-uniformity. Finally, we present a system for multi-document summarization based on IRR, which demonstrates that IRR can be immediately useful in applications. We show that IRR works as a framework to find a tightly connected (and therefore interpretable) set of coherent texts, and effectively present them to the user.
Periodic pattern search on time-related data sets

For many applications such as accounting, banking, business transaction processing systems, geographical information systems, medical record book keeping, etc., the changes made on their databases over time are a valuable source of information which can direct the future operation of the enterprise. In this thesis, we will focus on relational databases with historical data or, in other words, time-related data, and try to extract from them some useful knowledge about their periodic behavior. The discovered knowledge could provide user some future guidance, to which end techniques in knowledge discovery and data warehousing become important. Knowledge discovery and data warehousing have been increasingly important in handling and analyzing large databases efficiently and effectively. We can take advantage of existing on-line analytical processing techniques widely used in knowledge discovery and data warehousing, and apply them on time-related data to solve periodic pattern search problems. The problems discussed in this presentation include two types. One is to find periodic patterns of a time series with a given period, while the other is to find a pattern with arbitrary length of period. The algorithms will be presented, along with their experimental results.
Practical API Design: Confessions of a Java Framework Architect

You might think more than enough design books exist in the programming world already. In fact, there are so many that it makes sense to ask why you would read yet another. Is there really a need for yet another design book? In fact, there is a greater need than ever before, and Practical API Design: Confessions of a Java Framework Architect fills that need! Teaches you how to write an API that will stand the test of Time Written by the designer of the NetBeans API at Sun Based on best practices, scalability, and API design patterns What youll learn What an API is and what the theories are behind good API design When and why to build an API API design patterns applicable to all programming languages, especially modern, objectoriented languages How to optimize and test APIs Who is this book for? This book is recommended to every API architect who prefers a bit more engineering design over a purely artistic one.
A Light-Weight Secure Key Setup and Signaling Architecture for Wireless Mesh Networks

Abstract Wireless mesh network (WMN) is advocated as the major supporting technology for next generation wireless Internet. To support anywhere-anytime communications for highly mobile users, WMN needs to have mobility management architecture that supports frequent handover. Hierarchical Mobile IPv6 (HMIPv6) is one such architecture that reduces handover signaling, but has inefficient address space utilization, poor key setup procedure, and IPSec-based security. This paper proposes a secure and light-weight architecture for IPv6-based WMN called secure WMN (SWMN) that is built upon HMIPv6. SWMN allocates address space optimally among the clients and uses a secure procedure for user registration and key setup. It has light-weight and secure mobility management mechanism. A simple analysis is also presented to compare SWMN with HMIPv6.
Industrial Computerized Tomography Images Segmentation Based on Cellular Neural Networks

In this paper, we aimed at segmenting industrial computerized tomography images grounded in edge information. Most researchers focused on the edges of binary images using cellular neural network. We have expanded the scope to gray level images. Thus two groups of cellular neural network were designed to obtain closed edges. One was used to convert the gray level images to binary ones, the other to extract edges. In addition, we combined with contrastenhancement. Subsequently, tracing the obtained edges accomplished segmentation. Simulation experiments on a series of engine images demonstrate our methods can not only batch process threshold segmentation without choice threshold, but also extract the fine edges . A comparison to state-of-the-art methods show ours are easy to follow with good results.
Marketing Database Analytics: Transforming Data for Competitive Advantage

1. The Informational Advantage 2. The Marketing Database Analytics Process Part I: Need Identification 3. Organizational Objectives and Informational Needs 4. Skills and Tools Part II: Knowledge Creation 5. Analytic Planning 6. Data Basics 7. Analytic File Creation 8. Exploratory Data Analyses 9. Segmentation 10. Behavioral Predictions 11. Action-attributable Incrementality 12. Database Scoring 13. From Findings to Knowledge Part III: Dissemination 14. Organizational Knowledge Sharing 15. In Closing
A Three-Step Procedure for Language Generation

Abstract : This paper outlines a three-step plan for generation English text from any sematic representation by applying a set of syntactic transformations to a collection of kernel sentences. The paper focuses on describing a program which realizes the third step of this plan. Step One separates the given representation into groups and generates from each group a set of kernel sentences. Step Two must decide, based upon both syntactic and thematic consideration, the set of transformations that shoulld be performed upon each set of kernels. The output of the first two steps provides the 'TASK' for Step Three. Each element of the TASK corresponds to the generation of one English sentence, and in turn may be defined as a triple consisting of: a list of kernel phrase markers; a list of transformations to be performed upon the list of kernals; a 'syntactic separator' to separate or connect generated sentences. Step Three takes as input the results of Step One and Step Two. The program which implements Step Three 'reads' the TASK, executes the transformations indicated there, combines the altered kernels of each set into a sentence, performs a pronominalization process, and finally produces the appropriate English word string. This approach subdivides a hard problem into three more manageable and relatively independent pieces.
NEXT cancellers using FDLMS filters with improved convergence rate

A low-complexity technique for improving the convergence rate in a near-end crosstalk (NEXT) cancellation system is proposed. The cancellation system, minimizes the computational load by first detecting the lines causing the major NEXT and then assigning FDLMS adaptive filters to cancel the NEXT. By initially making the step-size of each adaptive filter proportional to the magnitude of the NEXT it is supposed to cancel, the convergence rate is significantly improved at almost no extra computational cost, especially during the initial stage of adaptation. A high convergence rate during the initial stages is more critical as it reduces the latency time in xDSL systems, thereby resulting in a higher data throughput.