Miracle-dz/UniFAR-FTUs huggingface dataset:
The real-time implementation of emitter identification for ESM

It is shown that no computer architecture is available providing a very high Prolog execution capability within a real-time environment. The experience gained, however, has permitted the architecture of a suitable parallel computer to be specified. The PSIDRA architecture is based on a Sequential Prolog Processor capable of 5 MLIP operation. Two Sequential Prolog processors are integrated with a Scheduler Processor to form the basic Prolog Processing Node. The PSIDRA Computer integrates these Nodes within a real-time multi-sequential operating environment. The architecture is both highly scalable and designed to meet the stringent requirements of real-time operation of programs such as CEIM and PALANTIR.
The Finite State Machine for the ATLAS Pixel Detector and Beam Background Studies with the ATLAS Beam Conditions Monitor

Der Large Hadron Collider am CERN bei Genf hat Ende 2009 mit den ersten Proton-Proton Kollisionen seinen Betrieb aufgenommen. Der ATLAS-Detektor ist einer der Universaldetektoren, und wurde entwickelt und gebaut um neue physikalische Phanomene zu studieren und das Wissen und Verstandnis der zugrundeliegenden Theorie zu verbessern. Der Pixeldetektor ist der innerste Subdetektor von ATLAS und wird mit seinen 80 Millionen Auslesekanalen eine wichtige Rolle spielen bei der Identifikation und Vermessung der interessanten physikalischen Phanomene. Komplexe Kontrollsysteme sind erforderlich, um ein System wie den Pixeldetektor sicher betreiben zu konnen. Letztendlich wird ein einziger Operator fur die Kontrolle und Uberwachung des gesamten ATLASDetektors zustandig sein. Diese Arbeit besteht aus drei Teilen. Der erste Teil gibt einen Uberblick uber das Experiment. Kapitel 1 gibt mit einer kurzen Zusammenfassung des Standardmodells der Teilchenphysik eine Motivation zum Bau groser Beschleuniger und Detektoren. In Kapitel 2 wird der Beschleuniger beschrieben, und der ATLAS-Detektor mit seinen Subsystemen wird vorgestellt. Da der Pixeldetektor und der Beam Conditions Monitor von spezieller Bedeutung fur diese Arbeit sind, werden sie in groserem Detail in Kapitel 3 und 4 beschrieben. Der Schwerpunkt dieser Arbeit liegt im zweiten Teil, der das Kontrollsystem des ATLAS Pixeldetektors behandelt. In Kapitel 5 werden die Hardware- und Software-Komponenten beschrieben. Kapitel 6 und 7 stellen den Hauptteil der zugrundeliegenden Arbeit dar. Der Betrieb der ATLAS Subdetektoren wird hauptsachlich durch die Zustandsmaschine (FSM) gewahrleistet. Kapitel 6 beginnt mit einer Einfuhrung der zugrundeliegenden Software- Komponenten. Die Anforderungen fur die Pixel-FSM werden dargelegt, und die Pixel-spezifische Implementierung diskutiert. In Kapitel 7 werden Skripte vorgestellt, die erganzend zur FSM entwickelt wurden, um sicherheitsrelevante Aspekte abzusichern, sowie die Automatisierung von Prozeduren zur Interaktion mit externen Systemen handhaben. Der letzte Teil beschaftigt sich mit Untergrundereignissen aufgrund von strahlbezogenen Belangen. Kapitel 8 beschreibt potentielle Szenarios zu Strahlverlust, sowie Untergrund wahrend des regularen Betriebs. Wahrend der fruhen Betriebs-Phase mit wenigen Protonen-Paketen und einer Strahlenergie von bis zu 3500 GeV wurden Daten vom Inneren Detektor und des Beam Condition Monitors korreliert. Eine Zusammenfassung und Bewertung dieser Arbeit im Hinblick auf den Betrieb des ATLAS Pixeldetektors wird im Abschlus dieser Arbeit gegeben.
Data Modeling Methodology and the PDXI Model

Abstract The P rocess D ata e X change I nstitute (PDXI) was formed by leading members of the process industries under the auspices of the AIChE to establish data exchange stan-dards for chemical engineering computer programs. Au -tomated data exchange can improve the quality and pro-ductivity of chemical engineering work. This paper in-troduces basic object-oriented modeling concepts and shows how they have been applied within the PDXI proj -ect. We survey the current PDXI data models and con-clude with a summary of our future plans and further technical opportunities. 1. Introduction Since the 1970’s chemical engineers have recognized the potential for productivity gains through automated information exchange. Too much engineering time is now consumed with mindlessly servicing computer pro-grams — taking prior output and performing unit con-versions, reformatting, and re-entry for the next program. This problem plagues many engineering disci-plines and not just chemical engineers. Past progress has been hampered by the sheer complexity of chemical engineering data and inadequate conceptual and imple-mentation computer science techniques. • “For an environment where most of the computer activities involve stand-alone programs, design engi-neers will spend 50-80% of their time moving and organizing data between applications. ” [1]• “A one year long (1977-1978) investigation into engi-neering information manageme nt at ICI estimated that at least 50% of engineering time was concerned with information management and that included much recopying of information. ” [3]Several recent breakthroughs provide reason for opti-mism. Computer science advances have been realized in databases and object-oriented modeling. Object-ori-ented models provide a coherent language for conceptu-alizing complex ideas and communicating these ideas to others. Object-oriented models also provide a practical basis for implementation; commercial software can automatically process object-oriented models and gener -ate database schema, programming code interfaces, and formats for transfer files.The initial goal of PDXI has been to develop a model for process engineering data. PDXI awarded its first contract to the Chemical Engineering Department of the University of Missouri at Rolla (UMR); the UMR team (the authors of this paper and others) includes external consultants and is led by Neil Book. This paper explains the data modeling methodology adopted by the UMR team and surveys our PDXI models.
Design and implementation of FPGA-based DNA sequence alignment accelerator

Basic Local Alignment Search Tool (BLAST) is a standard computer application that uses in the Bioinformatics field to search for sequence similarity in genomic databases. This project describes a FPGA-based hardware implementation which using a systolic array design architecture for Basic Local Alignment Search Tool (BLAST). Before this designs detect at most one hit in one clock cycle, this design applies a Multiple Hits Detection Module which is a pipelining systolic array to search multiple hits in one clock cycle. This computationally intensive critical segment has been designed and implemented in the FPGA that runs on Cyclone II processor in the Altera DE 2 board. The concepts of portability, scalability and cost-effectiveness of the implementation are also demonstrated from the results obtained.
Munsell Notation System and CIELab as a tool for evaluation colors in soils

1Área Académica de Químicas. Universidad Autónoma del Estado de Hidalgo. Carretera Pachuca-Tulancingo, km 4.5. Pachuca, Hidalgo, México. C. P. 42076. Tel. 01 771 7172000. Ext. 2514 y 2220. (julia_moon_star@yahoo.com.mx), (aroman@uaeh.edu.mx), (prietog@uaeh.edu.mx). 2Área Académica en Materiales y Metalurgia. Universidad Autónoma del Estado de Hidalgo. (acevedo@uaeh.edu.mx). §Autora para correspondencia: aroman@uaeh.edu. mx.
Performance Evaluation of a Single Queue under Multi-User TCP/IP Connections

We study the performance of several TCP connections through the bottleneck of a slow network accessed via a single queue with high capacity. Using mean-field approximation methology, we establish some asymptotical results about queue length distribution and windo size distribution when the number of user increases proportionally to buffer capacity. We also give an evaluatio- n of TCP fairness under these traffic conditions.
Modeling and Analysis of Electrical Network Activity in Neuronal Systems

ACKNOWLEDGEMENTS I have been very fortunate as a graduate student to have had multiple faculty members take me under their wing. Each of the Co-Chairs of my committee has generously devoted much time and effort to my training. I would like to thank Vijay Nair for 6 years worth of advice, dating back to our work together at Chrysler, an experience which was a driving force behind my decision to pursue a PhD at Michigan. Thank you, Vijay, for giving me the freedom to pursue the research topics that fascinated me, for always looking out for my best interests, and, when times were difficult, for reassuring me with the wise words of Jerzy Neyman, that " Life is complicated, but not uninteresting. " I would like to thank Daniel Forger for noticing me in his MATH 463 class and for inviting me for a cup of coffee that changed the trajectory of my research career. Thank you, Danny, for encouraging me to pursue a degree in Bioinformatics, for introducing me to the circadian and computational neuroscience fields, and for the countless hours spent advising me on my research and on the academic world in general. I would like to thank K.P. Unnikrishnan for introducing me to the problem of spike train analysis. Thank you, Unni, for sharing with me your enthusiasm for " discovering the neural code " and for graciously integrating me into your research team. And thanks for taking me sailing! I would like to thank Victoria Booth and Larry Seiford for kindly serving on my committee. Thank you, Victoria, for helpful discussions on neuronal modeling over the years. Thank you, Larry, for all of the support you provided me during your tenure as IOE Department Chair. I would also like to thank Monroe Keyserling and ii Dan Burns for making my interdepartmental degree between IOE and Bioinformatics possible. Thank you, Dan, for the guidance and thoughtful advice shared on many different occasions. I would like to thank Hugh Piggins and Mino Belle for the wonderful collaboration begun during the course of this dissertation. Mino, you are a brilliant scientist and a great friend and I look forward to being involved in many more of your exciting discoveries in the future. I would also like to thank P. Fred Eisele, and Kohinoor Dasgupta for fruitful collaborations. Kohinoor, keep up the good work! I thank my fellow students in …
Experience with Global Analysis: A Practical Method for Analyzing Factors that Influence Software Architectures.

A practical method for analyzing the factors that influence software architectures is presented. Factors include organizational context and constraints, available technologies, and product requirements. Analyzing the factors uncovers a small number of issues that drive the design of the architecture. These issues arise from the factors that have little flexibility, a high degree of changeability, and a global impact on the system. The result of the analysis is a set of global strategies that guide the architecture design. A two-phase approach for analyzing factors and developing architecture design strategies is given. Experience has been gained with this approach in three ways: (1) developing the approach during the design of an imaging system; (2) using the approach to analyze four systems in retrospect; (3) using the approach in new software development projects. Introducing global analysis into the software development process resulted in a new global analysis specification document that helped bridge the gap between requirements and architecture design and provided a place to explicitly record design rationale.
Measuring System Performance with Reprogrammable Hardware

We present accurate, low-level measurements of process preemption, interrupt handling and memory system performance of a UNIX1 workstation. To gather this data, we use PAMs (Programmable Active Memories). These are fast, general purpose, bit-level programmable coprocessors based on field-programmable gate arrays. They are mapped to part of the system address space and appear to the CPU as memory, much like memory-mapped I/O devices. PAMs are primarily aimed at computationally intensive problems, where wide, application specific data-paths can offer large speedups over software. By contrast, in this application we rely on the real-time, concurrent aspects of a PAM that is relatively modest in terms of computational resources. Starting with a simple 25 MHz counter, we describe a series of measurement devices built to answer specific questions about low-level system performance. Many of the devices are active in that they provoke the events they seek to measure. Our measurement techniques allow us to construct histograms gradated in CPU clock cycles and cover: frequency and duration of user process preemption, latency from interrupt to kernel handler, DMA throughput and latency, and the effect of other system activity on DMA.
The 60 GHz Indoor Radio Channel – Overcoming the Challenges of Human Blockage

Driven by the ever increasing capacity of storage devices and HD video streaming applications, there will be a strong demand for wireless multi-Gbps consumer applications soon. Due to its large available bandwidth and the high allowed transmit power, the unlicensed frequency range around 60 GHz is proving ideal for the realization of such systems. During the development process of 60 GHz multi-gigabit wireless systems, a detailed knowledge of the radio channel is essential. Taking into account research gaps, this dissertation makes a significant contribution to knowledge in the field of 60 GHz channel characterization. The focus is on human shadowing and its influence on the channel characteristics, which leads to a high and time-variant path loss. In order to provide realistic results, sophisticated radio channel models are required for the 60 GHz range. In particular, they should include information in the spatial domain at the receiver and the transmitter as well as take into account time-varying human shadowing. The angular information is necessary in this case to evaluate smart antenna systems. Such comprehensive models are not yet available and therefore represent the major outcome of this dissertation.
Bootstrapping a Persian Dependency Treebank

This paper presents an ongoing project whose goal is to create a freely available dependency treebank for Persian. The data is taken from the Bijankhan corpus, which is already annotated for parts of speech, and a syntactic dependency annotation based on the Stanford Typed Dependencies is added through a bootstrapping procedure involving the open- source dependency parser MaltParser. We report preliminary parsing experiments with promising results after training the parser on a manually annotated seed data set of 215 sentences.
Handbook Of Applied Cryptography Crc Press

Menezes et al., 2010, A.J. Menezes, P.C. Van Oorschot, S.A. Vanstone. Handbook of Applied Cryptography. CRC Press (2010). (SD-008). O'Flynn and Zhizhang. Series: Chapman & Hall/CRC Cryptography and Network Security Series. What are VitalSource Trust in Cyberspace · Handbook of Applied Cryptography. Cryptography Provable Security (SS 2014) Menezes, van Oorschot, Vanstone: "Handbook of Applied Cryptography", CRC Press, 1996.
Software Metrics for Predicting Maintainability

A hand-held dispenser for a flowable product, including a container having a neck portion at its top, and a cap body having a discharge opening and a base portion cooperable with the neck portion of the container to mount the cap body thereon. The base and neck portions have cooperable automatic pressure-relief valving structures which are responsive to increased gas pressure in the container, for venting a limited quantity of gas when the container is in its upright position, so as to prevent possible explosion of the container and spillage or splattering of its contents. In one form, there is a first annular sealing surface on one portion and a cooperable annular sealing surface on a companion portion which is engageable with the first surface when the cap body is fully seated on the neck portion. A projection on one of the portions is located adjacent the sealing surface thereof, and is engageable with the cooperable sealing surface on the other of the portions. The projection is capable of effecting a non-destructive deformation of at least one of the portions when the cap body is moved axially from the fully seated position on the neck portion. Under conditions of excess pressure, the seal between cap body and neck portion will automatically be momentarily broken or to permit venting and avoiding pressure build-up in the container. Following the venting, seal is automatically restored.
Mosaïquage d'images cystoscopiques: étude comparative de méthodes de recalage

Bladder cancer is widely spread in the world. Many adequate diagnosis techniques exist. Video-endoscopy remains the standard clinical procedure for visual exploration of the bladder internal surface. However, video-endoscopy presents the limit that the imaged area for each image is about 1 cm. However, lesions are typically spread over several images. The aim of this contribution is to assess the performance of two mosaicing algorithms leading to the construction of panoramic maps (one unique image) of bladder walls. The quantitative comparison study is performed, on the one hand, on images extracted from clinical examination data and, on the other hand, on data acquired from a bladder phantom under controlled 3D endoscope displacements.
NEW METHODS IN WEB INFORMATION RETRIEVAL EFFECTIVENESS

A terminal connecting device has a plurality of movable contacts which are biased toward each other by springs to an extent limited by a spacer carried by the frame. The device is easily assembly by fitting shafts through bores in the contacts and using spring holders inserted between pairs of contacts and locked by wedges to exert a biasing force urging opposed contacts together. The shafts are held by support and frame members having open recesses, as opposed to bores, therein.
Corticonics: Neural Circuits of Cerebral Cortex

Preface 1. Anatomy of the cerebral cortex 2. The probability for synaptic contact between neurons in the cortex 3. Processing of spikes by neural networks 4. Relations between membrane potential and the synaptic response curve 5. Models of neural networks 6. Transmission through chains of neurons 7. Synchronous transmission Appendix Index.
Visualizing Dynamic Hierarchies in TreeMaps

There has been a great amount of research on visualiz ing hierarchical data like directory structures, family trees etc. Several different tree visualization techniques have been presented in the literature. Among these, TreeMap [JS91] is one of the most promising and effective visualizations. However, not ev ery data set has a hierarchy in its nature. In such a case user can define imaginary hierarchies among some of the attributes and feed preprocessed data into TreeMap.
Parallel and Distributed Simulation of Ad Hoc Networks

Modeling and simulation are traditional methods used to evaluate wireless network design. This paper addresses issues associated with the application of parallel discrete event simulation to mobile ad hoc networks design and analysis. The basic characteristics and major issues pertaining to ad hoc networks modeling and simulation are introduced. The focus is on wireless transmission and mobility models. Particular attention is paid to the MobASim system, a Javabased software environment for parallel and distributed simulation of mobile ad hoc networks. We describe the design, performance and possible applications of presented simulation software. Keywords— ad hoc network, distributed simulation, mobile network, software systems.
First Experiments with a ModelWeaver

As part of AMMP (ATLAS Model Management Platform), we are currently building several model management tools to support the tasks of modeling in the large and modeling in the small. For the first one (modeling in the large), a companion paper describes our current vision of a "megamodel", i.e. a local or global registry for handling references to models and metamodels and for managing their metadata. Currently the most advanced AMMP tool for modeling in the small is the IDE and basic engine for ATL (ATLAS Transformation language). In the present paper we motivate the need for a different tool called "ModelWeaver". It has the primary objective to handle fine grained relationships between elements of different metamodels. We have undertaken the building and evaluation of a series of model weaving prototypes in the context of the AMMP, in order to progressively define the precise need and the position of this kind of tool in the standard model engineering workbench. This paper is the first recording of our preliminary work in this area of model weaving.
Towards ontology design patterns to model multiple classification criteria of domain concepts in the Semantic Web

This thesis explores a very recurrent modeling scenario in ontology design that deals with the notion of real world concepts that can be classified according to multiple criteria. Current ontology modeling guidelines do not explicitly consider this aspect in the representation of such concepts. Such void leaves ample room for ad-hoc practices that can lead to unexpected or undesired results in ontology artifacts. The aim is to identify best practices and design patterns to represent such concepts in OWL DL ontologies suitable for deployment in the Web of Data and the Semantic Web. To assist with these issues, an initial set of basic design guidelines is put forward, that mitigates the opportunity for ad-hoc modeling decisions in the development of ontologies for the problem scenario described. These guidelines relies upon an existing simplified methodology for facet analysis from the field of Library and Information Science. The outcome of this facet analysis produces a Faceted Classification Scheme (FCS) for the concept in question where in most cases a facet would correspond to a classification criterion. The Value Partition, the Class As Property Value and the Normalisation Ontology Design Patterns (ODPs) are revisited to produce an ontology representation of a FCS. A comparative analysis between a FCS and the Normalisation ODP in particular, revealed the existence of key similarities between the elements in the generic structure of both knowledge representation paradigms. These similarities allow to establish a series of mappings to transform a FCS into an OWL DL ontology that contains a valid representation of the classification criteria involved in the characterization of the domain concept. An existing FCS example in the domain of \Dishwasher Detergent" and existing ontology examples in the domain of \Pizza", \Wine" and \Fault" (in the context of a computer system) are used to illustrate the outcome of this research
Detecting Multilingual Lines of Text with Fusion Moves

This thesis proposes an optimization-based algorithm for detecting lines of text in images taken by hand-held cameras. The majority of existing methods for this problem assume alphabet-based texts (e.g. in Latin or Greek) and they use heuristics specific to such texts: proximity between letters within one line, larger distance between separate lines, etc. We are interested in a more challenging problem where images combine alphabet and logographic characters from multiple languages where typographic rules vary a lot (e.g. English, Korean, and Chinese). Significantly higher complexity of fitting multiple lines of text in different languages calls for an energy-based formulation combining a data fidelity term and a regularization prior. Our data cost combines geometric errors and likelihoods given by a classifier trained to low-level features in each language. Our regularization term encourages sparsity based on label costs. Our energy can be efficiently minimized by fusion moves. The algorithm was evaluated on a database of images from the subway of metropolitan area of Seoul and was shown to be robust.