Miracle-dz/UniFAR-FTUs huggingface dataset:
Multiagent Systems: An Ontological Meta-model

There exist many multiagent systems. However, a lack of standards for agent architecture results in serious compatibility and interoperability problems among heterogeneous agents. In this research, we develop an ontological meta-model for the design of multiagent architecture. The meta-model is termed RITA, which identifies four basic constructs in designing multiagent systems: role, infrastructure, taskflow, and agent. We intend to develop the RITA meta-model into a framework. Our final objective is to develop a design tool that designers can use to stamp out agents and integrate their schemas to suit their application needs.
Microsoft Research at DUC2006: Task-Focused Summarization with Sentence Simplification and Lexical Expansion

Our DUC2006 system comprised three main components: a task-focused extractive summarization system, sentence simplification, and lexical expansion of topic words. This paper details each of these components, together with experiments designed to quantify their individual contributions. We include an analysis of our results according to two independent human evaluation methods, the NIST evaluation and the Pyramid evaluation. Our system ranked first in terms of both overall mean score and averaged per-cluster mean ranking out of 22 systems in the Pyramid evaluation, and ranked third out of 35 systems in NIST content responsiveness.
Cognitive Situation Awareness for Information Superiority

Abstract : We present a summary of the drawbacks and deficiencies that we noticed in the currently available Command Support Systems (CSS) and the methodology we propose to improve them: Situation Awareness support through Cognitive Fusion of Information stemmed out of document analysis. Our approach is divided into two parts: a methodology for situation representation out of document analysis and a methodology for situation analysis and reasoning to support decision-making. The situation representation part is based on the use of conceptual graphs and fusion of nodes in graph structures, whereas the situation analysis part follows Complex Event Processing methodology.
Evolution du Drag-and-Drop : Du Modèle d'Interaction Classique aux Surfaces Multi-Supports

La visualisation d'information sur des dispositifs d'affichage et d'interaction augmentes au travers de surfaces multi-supports remet en cause l'une des techniques d'interaction les plus emblematiques de la manipulation directe : le drag-and-drop. Ces dernieres annees de nouvelles techniques d'interaction sont apparues mais il reste encore beaucoup a faire pour que l'integration de ces nouveautes se concretise. L'objectif de cet article est de presenter les recentes innovations dans ce domaine et de montrer comment l'integration de ces innovations peut s'envisager dans les mecanismes actuels. Nous presentons aussi une etude transversale des techniques de drag-and-drop actuelles, mettant en evidence les ecueils attendus.
Cutting Through the Tangled Web: An Information-Theoretic Perspective on Information Warfare

Information Warfare, which is the competitive use of information in survival contests, has been a pervasive feature of conflicts since the beginnings of recorded history. The advent of digital technologies for the collection, storage, analysis and distribution of information has created not only growth in the use of Information Warfare, but also created numerous new opportunities for its use. The study of Information Warfare has progressed considerably since the term was first formally used by Rona thirty six years ago. Robust foundation theory rooted in Shannon's information theory and mathematical game theory, emerged over a decade ago, with the formalisms identified now as the Borden-Kopp model. This paper surveys extant and past research in the information-theoretic foundations of Information Warfare. Specifically, both qualitative and quantitative definitions of information are surveyed, and closely compared. The most commonly used definitions of Information Warfare are then explored and analysed from an information-theoretic perspective. Research covering the four canonical strategies, which are based on Shannon's definition of information, and the Turing machine model, is explored in detail, with a specific focus on boundary conditions between the four respective canonical strategies, and differences between the Borden and Kopp models. Mappings between qualitative and information theoretic models of Information Warfare are explored. The paper also surveys numerous applications for information-theoretic representations of Information Warfare. The advent of information-theoretic models for Information Warfare establishes this as an area of study within the information sciences, in addition to its interest for the social sciences, military science and information systems.
Vision: Images, Signals and Neural Networks - Models of Neural Processing in Visual Perception

At the fascinating frontiers of neurobiology, mathematics and psychophysics, this book addresses the problem of human and computer vision on the basis of cognitive modeling. After recalling the physics of light and its transformation through media and optics, Hrault presents the principles of the primate's visual system in terms of anatomy and functionality. Then, the neuronal circuitry of the retina is analyzed in terms of spatio-temporal filtering. This basic model is extended to the concept of neuromorphic circuits for motion processing and to the processing of color in the retina. For more in-depth studies, the adaptive non-linear properties of the photoreceptors and of ganglion cells are addressed, exhibiting all the power of the retinal pre-processing of images as a system of information cleaning suitable for further cortical processing. As a target of retinal information, the primary visual area is presented as a bank of filters able to extract valuable descriptors of images, suitable for categorization and recognition and also for local information extraction such as saliency and perspective. All along the book, many comparisons between the models and human perception are discussed as well as detailed applications to computer vision.
A Framework for Anomaly Detection withApplications to Sequences

Anomaly detection is an important issue in data mining and analysis, with applications in almost every area of science, technology and business that involves data collection.The development of general, automated anomaly detection methods could therefore have a large impact on data analysis across many domains. Due to the highly subjective nature of anomaly detection, there are no generally applicable methods, and for each new application a large number of possible methods must be evaluated. In spite of this, little work has been done to automate the process of anomaly detection research for new applications. In this report, a novel approach to anomaly detection research is presented, in which the task of finding appropriate anomaly detection methods for some specific application is formulated as an optimisation problem over a set of possible problem formulations. In order to facilitate the application of this optimisation problem to applications, a high-level framework for classifying and reasoning about anomaly detection problems is introduced. An application of this optimisation problem to anomaly detection in sequences is presented; algorithms for solving general anomaly detection problems in sequences are given, along with tractable formulations of the optimisation problem for the two major anomaly detection tasks in sequences. Finally, a software implementation of the optimisation problem and framework is presented, along with a preliminary investigation into how it can be used to facilitate anomaly detection research.
Hardware Support for a Configurable Architecture for Real-Time Embedded Systems on a Programmable Chip

HARDWARE SUPPORT FOR A CONFIGURABLE ARCHITECTURE FOR REAL-TIME EMBEDDED SYSTEMS ON A PROGRAMMABLE CHIP Spencer William Isaacson Department of Electrical and Computer Engineering Master of Science Current FPGA technology has advanced to the point that useful embedded SoPCs can now be designed. The Real Time Processor (RTP) project at Brigham Young University leverages the advances in FPGA technology with a system architecture that is customizable to specific applications. A simple real-time processor has been designed to provide support for a hardware-assisted real-time operating system providing fast context switches. As part of the hardware RTOS, the following have been implemented in hardware: scheduler, register banks, mutex, semaphore, queue, interrupts, event, and others. A novel circuit called the Task-Resource Matrix has been created to allow fast inter/intra processor communication and synchronization.
Locality in Vowel Harmony

Vowel harmony results from a set of restrictions that determine the possible and impossible sequences of vowels within a word. The study of syntax begins with the observation that the words of a sentence cannot go in just any order, and the study of phonology begins with the same observation for the consonants and vowels of a word. In this book, Andrew Nevins investigates long-distance relations between vowels in vowel harmony systems across a range of languages, with the aim of demonstrating that the locality conditions that regulate these relations can be attributed to the same principle that regulates long-distance syntactic dependencies. He argues that vowel harmony represents a manifestation of the Agree algorithm for feature-valuation (formulated by Chomsky in 2000), as part of an overarching effort to show that phonology can be described in terms of the principles of the Minimalist program. Nevins demonstrates that the principle of target-driven search, the phenomenon of defective intervention, and the principles regulating the size of the domain over which dependencies are computed apply to both phonological and syntactic phenomena. Locality in Vowel Harmony offers phonologists new evidence that viewing vowel harmony through the lens of relativized minimality has the potential to unify different levels of linguistic representation and different domains of empirical inquiry in a unified framework. Moreover, Nevins's specific implementation of the locality of dependencies represents a major advance in understanding constraints on possible harmonic languages.An online tool on the MIT Press Web site demonstrates the algorithm for calculating vowel harmony with the derivations exemplified in the book.
Effective software testing : 50 specific ways to improve your testing

Judging by the title, you might expect to discover between the covers a lot of tips and techniques to really help you and your team get better at testing. Unfortunately, if you have more than a little experience as a tester, you will find little here that is new to you. Conversely, if you are relatively new to testing, many techniques in Dustin’s list of fifty might be new to you, but for the most part, you won’t get enough detail to really learn them. For me, reading this book was about as helpful as reading the menu at my favorite take-out restaurant: I’ve seen all the choices before, and Dustin did not have much new to say about them.
bloodlines – Mammalian Motherhood, Biotechnologies and other Entanglements

This paper outlines my current sculptural research project bloodlines focusing on the ways in which dairy cows are entangled with multiple biotechnologies and the wider environment. bloodlines brings extant works such as fleshlumps, boobscape and slink, together with new works, to represent the dairy industry, the environmental impacts of animal agriculture and the biotech innovations of in-vitro meat and biofabricated leather. These works are linked together by a web of interconnected fluids: excreta, milk and blood. In this new work, I hope to make the links between the dairy industry and these extended concerns both visceral and visible.
Integer programming : theory and practice

New Heuristics and Adaptive Memory Procedures for Boolean Optimization Problems, Lars M. Hvattum, Arne Lokketangen, and Fred Glover Convergent Lagrangian Methods for Separable Nonlinear Integer Programming: Objective Level-Cut and Domain-Cut Methods, Duan Li, Xiaoling Sun, and Jun Wang The Generalized Assignment Problem, Robert M. Nauss Decomposition in Integer Linear Programming, Ted K. Ralphs and Matthew V. Galati Airline Scheduling Models and Solution Algorithms for the Temporary Closure of Airports, Shangyao Yan and Chung-Gee Lin Determining an Optimal Fleet Mix and Schedules: Part I - Single Source and Destination, Hanif D. Sherali and Salem M. Al-Yakoob Determining an Optimal Fleet Mix and Schedules: Part II - Multiple Sources and Destinations, and the Option of Leasing Transshipment Depots, Hanif D. Sherali and Salem M. Al-Yakoob An Integer Programming Model for the Optimization of Data Cycle Maps, David Panton, Maria John, and Andrew Mason Application of Column-Generation Techniques to Retail Assortment Planning, Govind P. Daruka and Udatta S. Palekar Noncommercial Software for Mixed-Integer Linear Programming, Jeff T. Linderoth and Ted K. Ralphs
Implementation and Optimization of the Advanced Encryption Standard Algorithm on all 8-Bit Field Programmable Gate Array Hardware Platform

Abstract : The contribution of this research is three-fold. The first is a method of converting the area occupied by a circuit implemented on a Field Programmable Gate Array (FPGA) to an equivalent as a measure of total gate count. This allows direct comparison between two FPGA implementations independent of the manufacturer or chip family. The second contribution improves the performance of the Advanced Encryption Standard (AES) on an 8-bit computing platform. This research develops an AES design that occupies less than three quarters of the area reported by the smallest design in current literature as well as significantly increases area efficiency. The third contribution of this research is an examination of how various designs for the critical AES SubBytes and MixColumns transformations interact and affect the overall performance of AES. The transformations responsible for the largest variance in performance are identified and the effect is measured in terms of throughput, area efficiency, and area occupied.
A Visual Survey of Tree Visualization

The number of available visualization techniques grows with each year’s Visweek, EuroVis, and PacificVis conferences. This is promising, as it shows that 20 years after the field of Information Visualization started to take shape, there is still room for plenty of new developments and improvements. Yet with each newly developed visualization technique, it becomes more and more challenging for users and visualization researchers alike to maintain an overview of the vast numbers of available visualizations. As a result, we see many re-inventions of already existing visualizations that simply were not known to the re-inventors. Hence, the more mature the field of visualization grows and the more techniques are developed, the more the need arises to survey and keep track of them. This need to catalogue and consolidate the “visualization zoo” [2] is underlined by a recent surge of survey articles, such as [4, 1, 3] just for the subdomain of graph visualization alone. This poster adds on to this list, by specifically targeting tree visualizations in all their facets – not only from scholarly publications, but also interesting variants from blog entries, flickr galleries, and newspaper articles throughout the internet. The result and main contribution of this poster is the poster itself, which features 105 tree visualization techniques and classifies them in a number of different ways, e.g., by dimensionality or edge representation. Additionally, the poster serves as a handy tool to quickly look-up the original source of a technique on the internet, as the PDF of the poster includes a hyperlink for each technique that leads directly to the respective paper or website it stems from. The poster can be freely downloaded in high resolution for printing or in lower resolution to be used as a visual on-screen bibliography from http://treevis.shows. it
Computational Modeling Methods for Neuroscientists

This book offers an introduction to current methods in computational modeling in neuroscience. The book describes realistic modeling methods at levels of complexity ranging from molecular interactions to large neural networks. A "how to" book rather than an analytical account, it focuses on the presentation of methodological approaches, including the selection of the appropriate method and its potential pitfalls. It is intended for experimental neuroscientists and graduate students who have little formal training in mathematical methods, but it will also be useful for scientists with theoretical backgrounds who want to start using data-driven modeling methods. The mathematics needed are kept to an introductory level; the first chapter explains the mathematical methods the reader needs to master to understand the rest of the book. The chapters are written by scientists who have successfully integrated data-driven modeling with experimental work, so all of the material is accessible to experimentalists. The chapters offer comprehensive coverage with little overlap and extensive cross-references, moving from basic building blocks to more complex applications. Contributors: Pablo Achard, Haroon Anwar, Upinder S. Bhalla, Michiel Berends, Nicolas Brunel, Ronald L. Calabrese, Brenda Claiborne, Hugo Cornelis, Erik De Schutter, Alain Destexhe, Bard Ermentrout, Kristen Harris, Sean Hill, John R. Huguenard, William R. Holmes, Gwen Jacobs, Gwendal LeMasson, Henry Markram, Reinoud Maex, Astrid A. Prinz, Imad Riachi, John Rinzel, Arnd Roth, Felix Schrmann, Werner Van Geit, Mark C. W. van Rossum, Stefan Wils Computational Neuroscience series
Is the low-cost EyeTribe eye tracker any good for research?

Eye-tracking technology is becoming increasingly cheaper, both on the hardware and on the software front. Currently, the EyeTribe tracker is the most inexpensive commercial eye tracker in the world, at a price of $99. The low costs make it a potentially interesting resource for research, but no objective testing of its quality has been performed yet. Here the EyeTribe tracker is compared with an EyeLink 1000, a high-quality video eye tracker. Results indicate that the spatial precision and accuracy are good enough for fixation checking, point-of-regard analyses, and pupilometry. However, the low sampling rate renders the device unsuitable for testing high-accuracy saccade metrics. Additionally, opensource toolboxes for Matlab and Python, and a plug-in for OpenSesame are presented, which can be used to interface with the EyeTribe tracker.
Shared Environments to Support Face-to-Face Collaboration

The security device of the invention comprises a movable organ in the interior of a cage mounted for rotation with respect to the body of a projectile, the movable organ being temporarily blocked from such rotation around the axis of gyration by at least one pin ejectable under the action of centrifugal force. Said pin is itself retained by an elastic spiral band enrolled upon the cage and which, as a result of a difference introduced into the speeds of respective rotation of the cage and of the body around the axis of gyration upon the exit of the projectile from the muzzle of the weapon, unwinds to liberate the pin. As a result, the movable organ after a trajectory of many tens of meters after the projectile has left the muzzle of the barrel of the weapon completes the pyrotechnic train which fires the projectile.
Enhanced Probabilistic Broadcasting Scheme for Routing in MANETs. An investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks.

Broadcasting is a basic data propagation technique, which has a number of applications such as route discovery and address resolution. While data broadcasting has many gains, it introduces some problems known as broadcast storm problems, which causing a lot of contention, collision and redundant retransmission. Our objective is to reduce the number of rebroadcast. A good probabilistic broadcast protocol can achieve high save rebroadcast. We propose a probabilistic approach that calculates the rebroadcast probability according to the number of neighbour’s nodes when nodes move according to different mobility models and compare it with simple flooding, adjusted probabilistic flooding and dynamic probabilistic flooding schemes. Simulation results show our improved approach performs better than simple flooding, adjusted probabilistic flooding and dynamic probabilistic flooding.
Evolutionary System Approach for Advanced Planning in Multi - Plant Chain

This invention relates to poultry picking machines and more particularly to a poultry picking machine for removing the feathers from fowl with multiple finger action using a first plurality of picking fingers rotatable about axes of rotation extending generally transversely of the path of travel of the fowl through the machine and with a second plurality of picking fingers rotating about axes extending generally parallel to the path of travel of the fowl through the machine so that the first plurality of picking fingers is located on one side of the path of travel while the second plurality of picking fingers is located on the opposite side of the path of travel.
Short-Length Raptor Codes for Free-Space Optical Communications

Free-space optical (FSO) links are competitive wireless links offering high data rate, security and low system complexity. Compared to radio-frequency (RF) links, FSO links offer high rates at gigabit-per-second (Gbps) level and relatively low cost. However, atmospheric scintillation and misalignment between optical transmitter and receiver impair data rates of FSO links. Scintillation and misalignment are slow fading processes with a fading interval of 10's ms. Conventional fixed-length channel coding which interleave data blocks are unrealistic to overcome this slow fading due to block length of 10's of megabits. Also, because of the Gbps data rate, data rate adaptation to channel conditions are expensive. In this work, short-length (16 1024) Raptor codes are designed to overcome the slow fading of FSO channels. These Raptor codes are applied at the packet-level with high data rate and low decoding complexity. The Raptor encoder and decoder can be easily implemented in any software or hardware form. The practicality of these Raptor codes is demonstrated by a Raptor encoder and decoder which are implemented in field-programmable gate array (FPGA) and shown to support a 1.22 Gbps encoding and 714 Mbps decoding rate with a 97 mW low power consumption and 26360 gate circuit scale. High-speed transmission at Gbps level is easily satisfied by the same design implemented in an application-specific integrated circuit (ASIC).
Analyzing Quantitative Data: From Description to Explanation

Introduction About the Book Social Research and Data Analysis Demystifying Basic Concepts Data Analysis in Context Working with Two Data Sets Descriptive Analysis - Univariate Looking for Characteristics Descriptive Analysis - Bivariate Looking for Patterns Explanatory Analysis Looking for Influences Inferential Analysis From Sample to Population Data Reduction Preparing to Answer Research Questions Real Data Analysis Answering Research Questions
A Macro Perspective on Technology Transfer

Figures and Tables Preface Acknowledgments Introduction: Definitions and Concepts Major Players in Technology Transfer Barriers and Solutions Ethical Dimensions A Model of Technology Transfer Assimilation Application of the Model: India Conclusion Appendix A: Technology Transfer to Developing Countries Appendix B: Potential Costs of Technology Transfer Appendix C: The Reciprocal Distribution Paradigm References Index