Miracle-dz/UniFAR-FTUs huggingface dataset:
Supplemental Application of Configural Frequency Analysis to Free Sorting Data

Application supplémentaire de l'analyse de fréquence configurale pour le tri libre des données : L'intention de cet article est de démarrer une discussion à propos de cet outil simple et supplémentaire pour analyser des tris libres de données. Des caractéristiques communes des tris de données et de leur pertinence pour les analyses de fréquence configurale sont discutées, en relations avec l'analyse des données descriptive et confirmatoire. La taille d'échantillon pour le tri de cartes est re-examinée pour l'analyse descriptive. L'échantillon nécessaire dépend d'une certaine mesure du domaine spécifié. Le nombre moyen de différentes configurations rencontrées dépend du nombre de tris recueillies, le nombre d'éléments inclus dans le domaine et les caractéristiques du domaine. Un test simple et exact de signification est proposé pour tester les hypothèses de fréquences configurales de tri libre et flou de données. This paper analyses the application of Configural Frequency Analysis (CFA) to free sorting data. It is intended to start a discussion about this simple supplementary analysis tool for free sorting data. Common features of sorting data and their relevance for CFA are discussed, in its approach to using both descriptive and confirmatory data analysis. Sample size requirements of card sorting are also revisited for descriptive analysis. The sample required to some extent depends on the specified domain. The average number of different configurations encountered depends on the number of sortings collected, the number of items included in the domain and the qualities of the domain. A simple exact significance test is proposed for hypothesis testing of configural frequencies in free fuzzy sorting data.
Data Mining for Tweet Sentiment Classification

The goal of this work is to classify short Twitter messages with respect to their sentiment using data mining techniques. Twitter messages, or tweets, are limited to 140 characters. This limitation makes it more difficult for people to express their sentiment and as a consequence, the classification of the sentiment will be more difficult as well. The sentiment can refer to two different types: emotions and opinions. This research is solely focused on the sentiment of opinions. These opinions can be divided into three classes: positive, neutral and negative. The tweets are then classified with an algorithm to one of those three classes. Known supervised learning algorithms as support vector machines and naive Bayes are used to create a prediction model. Before the prediction model can be created, the data has to be pre-processed from text to a fixed-length feature vector. The features consist of sentiment-words and frequently occurring words that are predictive for the sentiment. The learned model is then applied to a test set to validate the model.
The dative alternation in L2 German?: Conceptualization transfer from L1 Dutch

In Dutch, a ditransitive verb can take two alternating patterns ( "the dative alternation" ): the Double Object Construction (DOC) (’Jan geeft het meisje een boek’) and the prepositional construction (POC) (’Jan geeft een boek aan het meisje’). The choice of one of both constructions is associated with multiple discourse- pragmatic factors. In German, however, the POC is ungrammatical with a verb such as geben, ’to give’: ’Jan gibt ein Buch *[an das Madchen]’. This article reports on two sentence rating experiments (acceptability judgments) to test whether Dutch learners of German transfer their preferences about the dative alternation to the ditransitive construction in German. If no transfer were involved, (proficient) learners of L2 German are expected to consistently rate the DOC as the only possible choice in German. We found, however, a positive correlation between the sentence ratings of Dutch native speakers and learners of German. Our results further indicated that the DOC construction was consistently rated higher in German than in Dutch. Taken together, these findings suggest that although the German learners seem to be aware that the DOC is the default order in German, their choice is nonetheless associated with their L1-intuitions about the dative alternation. We discuss these results in the context of Slobin’s Thinking-for-Speaking Hypothesis and Jarvis’ Conceptual Transfer Hypothesis (more specifically, Conceptualization Transfer). We argue more specifically that the conceptualization of the dative alternation in the L1 Dutch is the blueprint, i.e. the thinking-for-speaking, for the structures in L2.
Data Access and Management Services on Grid

An increasing number of applications manage data at very large scale, of both size and distribution. In this paper, we discuss data management and access services for such applications, in the context of a grid. The complexity of data management on a grid arises from the scale, dynamism, autonomy, and distribution of data sources. The main argument of this paper is that these complexities should be made transparent to grid applications, through a layer of virtualization services. We start by discussing the various dimensions of transparent data access, and illustrate the benefits they provide in the context of a specific application. We then present a layer of grid data virtualization services that provide such transparency and enable ease of information access on a grid. These services support federated access to distributed data, dynamic discovery of data sources based on content, dynamic migration of data for workload balancing, and collaboration. We describe both our long-term vision for these services and a concrete proposal for what is achievable in the near term. We also discuss some support that grid data sources can provide to enable efficient virtualization. Our goal for this paper is to validate our virtualization services in the grid community. We hope that this work, along with other activities in the GGF-DAIS work group, will result in rapid standardization of grid data services.
An efficient multichannel wireless sensor networks MAC protocol based on IEEE 802.11 distributed co-ordinated function.

This research aimed to create new knowledge and pioneer a path in the area relating to future trends in the WSN, by resolving some of the issues at the MAC layer in Wireless Sensor Networks. This work introduced a Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks. This work commenced by surveying different protocols: contention-based MAC protocols, transport layer protocols, cross-layered design and multichannel multi-radio assignments. A number of existing protocols were analysed, each attempting to resolve one or more problems faced by the current layers. The 802.15. 4 performed very poorly at high data rate and at long range. Therefore 802.15. 4 is not suitable for sensor multimedia or surveillance system with streaming data for future multichannel multi-radio systems. A survey on 802.11 DCF - which was designed mainly for wireless networks –supports and confirm that it has a power saving mechanism which is used to synchronise nodes. However it uses a random back-off mechanism that cannot provide deterministic upper bounds on channel access delay and as such cannot support real-time traffic. The weaknesses identified by surveying this protocol form the backbone of this thesis The overall aim for this thesis was to introduce multichannel with single radio as a new paradigm for IEEE 802.11 Distributed Coordinated Function (DCF) in wireless sensor networks (WSNs) that is used in a wide range of applications, from military application, environmental monitoring, medical care, smart buildings and other industry and to extend WSNs with multimedia capability which sense for instance sounds or motion, video sensor which capture video events of interest. Traditionally WSNs do not need high data rate and throughput, since events are normally captured periodically. With the paradigm shift in technology, multimedia streaming has become more demanding than data sensing applications as such the need for high data rate protocol for WSN which is an emerging technology in this area. The IEEE 802.11 can support data rates up to 54Mbps and 802.11 DCF was designed specifically for use in wireless networks. This thesis focused on designing an algorithm that applied multichannel to IEEE 802.11 DCF back-off algorithm to reduce the waiting time of a node and increase throughput when attempting to access the medium. Data collection in WSN tends to suffer from heavy congestion especially nodes nearer to the sink node. Therefore, this thesis proposes a contention based MAC protocol to address this problem from the inspiration of the 802.11 DCF backoff algorithm resulting from a comparison of IEEE 802.11 and IEEE 802.15. 4 for Future Green Multichannel Multi-radio Wireless Sensor Networks.
Peer-to-peer networks for scalable grid landscapes in social agent simulations.

Recently, peer-to-peer networks have been proposed as the underlying architecture of large scale distributed social agent simulations. A number of problems arise when grid landscapes are used to represent the landscape in these simulations, primarily because, in a peer-to-peer network, the landscape has to be handled collectively by the nodes of the network. Two basic agent actions are identified as central to these problems: look and move. A solution to these problems is provided in which the network maintains a move-buffer and a look-index. Both solutions are configurable by the user of the simulation and provide a trade-off between the scalability of the system, the consistency of the information stored in the system, and the efficiency of the system.
Using q-grams in a DBMS for Approximate String Processing.

String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the prevalence of typographical errors in data, and multiple conventions for recording attributes such as name and address. Commercial databases do not support approximate string queries directly, and it is a challenge to implement this functionality efficiently with user-defined functions (UDFs). In this paper, we develop a technique for building approximate string processing capabilities on top of commercial databases by exploiting facilities already available in them. At the core, our technique relies on generating short substrings of length q, called q-grams, and processing them using standard methods available in the DBMS. The proposed technique enables various approximate string processing methods in a DBMS, for example approximate (sub)string selections and joins, and can even be used with a variety of possible edit distance functions. The approximate string match predicate, with a suitable edit distance threshold, can be mapped into a vanilla relational expression and optimized by conventional relational optimizers.
Determining the validity of the task management environment to predict pilot concurrent task management performance

approved: Kenneth H. Funk, II Concurrent Task Management (CTM) is the process by which human operators of complex systems (such as pilots, drivers, surgeons, and operators) allocate their attention among multiple concurrent tasks (Funk, 1991). A more thorough understanding of the human operator's knowledge, skills, and abilities associated with CTM might help us to prevent disasters such as those in aviation, in the operating room, and nuclear power plants. But to develop that understanding, we must develop valid tools to measure the human operator's CTM performance. In this research, a validation study of a software game developed in previous research, the Task Management Environment (TME), was performed. Since the TME exhibits some face validity, it was hypothesized that it may have the potential to be useful for predicting human CTM performance in an airplane cockpit. However, it raises an important question as to whether or not it is a good enough tool to accurately measure CTM performance. Since the Frasca 141 flight simulator has been recognized and certified by the Federal Aviation Administration (FAA) as a valid human performance assessment tool for pilots, it was used to determine if the TME has external validity through a comparison of CTM performance, as measured by the TME, with CTM performance observed in the Frasca 141. Nineteen pilot participants from the Flight Technology Program at Central Washington University were tested for CTM performance on a Frasca 141 flight simulator and the TME. Performances were compared using correlation analyses to determine their relationship. The findings indicated that CTM performance in the TME Redacted for privacy does not correlate significantly with CTM performance in the Frasca 141 flight simulator. In conclusion, the TME does not have external validity and it cannot be used as a research tool to generalize pilot CTM performance to the "real-world" without modification. However, the limitations of this study may have caused sources of unwanted variability in the results. Future research using the TME might shed new light on validation.
High speed logic simulation machine

A very high speed logic simulation machine which can simulate a large scale computer, including CPU, main memory, cache memory and microprogram memory is described. By making use of this machine, it becomes possible to debug the total system before the actual machine is made available. The machine employs parallel and pipeline processing and event-driven IC level logic simulation. With 32 special processors, it can handle up to 6 million ic simulations per second (1.2 billion gate simulations per second), as well as a maximum logic scale of 15000 random logic ics and 2000 memory ics (up to 2 mega bytes). It is 10000 times faster than the current software simulator. 5 references.
EBO : de plus en plus de techniques d’exploration et de traitements endoscopiques

hpg.2010. 0537 Auteur(s) : Emmanuel Coron emmanuel.coron@chu-nantes.fr Institut des maladies de l’appareil digestif de Nantes, CHU Hotel-Dieu, Service d’hepato-gastroenterologie, 44093 Nantes Cedex, France L’incidence de l’adenocarcinome œsophagien a ete multipliee par six au cours des 30 dernieres annees Pohl H, Welch G. The role of overdiagnosis and reclassification in the marked increase of esophageal adenocarcinoma incidence. J Natl Cancer Inst 2005 ; 97 : 142-6 Dans [. ]
The MIMOLA Language Version 4.1

Introduction This report describes the computer hardware description language MIMOLA 4.1 (machine independent microprogramming language). MIMOLA 4.1 is the common input language for a variety of CAD tools for the design of VLSI systems. These CAD tools have been designed at the department of computer science of the University of Dortmund, and these tools essential design activities such as interactive synthesis, microcode generation, test generation and simulation. They aim at supporting the fast design of computer VLSI systems. MIMOLA 4.1 has been designed to support the requirements of the tools just mentioned. As a result of this, it was possible to concentrate on the design of innovative tools rather than on capturing the semantics of every language element of a language which is too general for the problem at hand. Descriptions for the tools developed for MIMOLA 4.1 can be found, for example, in [BBM94] and [LS93]. For all those tools, a clear separation between structural and behavioural descriptions is essential. Therefore, MIMOLA 4.1 supports this distinction. Hardware structures are modelled as a netlist of hardware components. The latter is described by a PASCAL-like program. Modelling hardware structures as netlists makes it feasible to check the completeness of wire lists. Support of hierarchical design styles is another important attribute of the language. Each hardware structure is assumed to consist of hardware elements, which can be described by their structure or by their behaviour. Thus, structural descriptions can be nested to any required degree. Furthermore, MIMOLA 4.1 allows the description of: • Digital computer hardware, modelled as a structure composed of register-transfer (RT–) modules (e.g. adders, buses, memories). Gate-level modules are included as special cases of RT-modules. • Behaviour of digital hardware modules. • Information required for linking behavioural and structural domains. • Programs at a PASCAL-like level. • Programs at the level of register transfers. • Initial simulation stimuli. Therefore, MIMOLA 4.1 is a high-level programming language (HLL), a register transfer language (RTL) and a computer hardware description language (CHDL). Furthermore, it can be used for high–level or intermediate–level microprogramming. In MIMOLA, the only build-in data type is the bit vector. A large set of arithmetic operators is defined in terms of such bit vectors. Constants are always interpreted as constant bit vectors, not as numbers. This absence of references to integer or natural numbers results in some nice features of MIMOLA 4.1: • The size of integers on the …
Semantic Authoring for Multilingual Text Generation

Acknowledgment First I would like to thank my advisor, Dr. Michael Elhadad, for the guidance and for the positive and professional attitude. I would also like to thank Yael Netzer for her contribution and willingness to help anytime. Thanks to all the volunteers who took part in the experiment for a humble return of few cookies each. I would also like to thank the NLP group of CS BGU, especially to Oren for the fertile feedbacks. I'm grateful to my fellow Master's students and all the great people of the Computer Science department at BGU, which made these years fun and interesting. Thanks to Barak Naveh for the helpful knowledge and his willingness to share it. Thanks to all my family, for their continuing support, my parents Tody and Ronit, my brother Asi, and my sisters Shahar and Lior. And special thanks to Anat my wife for her love, support understanding , for her contribution to my work and for listening carefully to my long speeches, even when she had much more interesting things to do. Finally thanks to Amit and Elad my children for thousands of smiles, and for introducing me to wonderful new emotions.
Applications of fuzzy algorithms for control of a simple dynamic plant

The paper describes a scheme in which a fuzzy algorithm is used to control plant, in this case, a laboratory-built steam engine. The algorithm is implemented as an interpreter of a set of rules expressed as fuzzy conditional statements. This implementation on a digital computer is used online, to control the plant. The merit of such a controller is discussed in the light of the results obtained.
The Gamification of Learning and Instruction: Game-based Methods and Strategies for Training and Education

Learning professionals are finding success applying game-based sensibilities to the development of instruction. This is the first book to show how to design online instruction that leverages the best elements of online games to increase learning, retention, and application. It explains how to match different game strategies to types of learning content for the right learning outcome and discusses how gamification techniques can be used in a variety of settings to improve learning, retention and application of knowledge. Supported by peer-reviewed studies and examples from corporations who have adopted game-based learning successfully, the book illustrates how combining instructional design thinking with game concepts can create engaged and interactive learning experiences across a variety of media, from online to face-to-face.
What Drives Continued Sharing Knowledge in the Electronic Network of Practice: the case of Wikipedia

The School of Information Systems, Technology and Management, Australian School of Business is researching a behavioral study on electronic community. The main purpose of the study is to examine the factors influencing individual‟s motivation to continue sharing knowledge in Wikipedia.  An intriguing question: Do individuals‟ motivations affected by underlying environmental factors adequately explain their continuance intention to share knowledge in Wikipedia?
CONCEPTUAL FRAMEWORK OF HUMAN SPATIAL BEHAVIOR SIMULATION BASED ON HLA

GIS, essentially discussing how people interact with their environment, is now becoming a natural spatial process and the human interaction with the environment in space and time. Abstraction of real world and simulation of human behavior are just two questions of how spatial reality and human experience are linked. To address the problems, the paper introduces and explores the potential of using High Level Architecture (HLA) technology based modeling and simulation as a tool for expressing the complex interactions between human and environment. For undertaking such complex human action analysis, the paper prescribes the development of representation requirements within simulation, which are necessary to ensure the model and simulation represents exactly what the human wants it to represent. A conceptual model is then presented as the linkage between simulation requirements and simulation implementation. Object model abstracts common human spatial characteristics in the real world, their typical spatial relations and spatial interactions. Interface specification provides a specification for the functional interfaces between human and environment and services of communication and coordination. Behavior rules describe the behavior of the overall distributed simulation and their members. The above three parts are focused to discuss and design in the paper. Taking the example of disaster simulation system, the proposed specification method is finally applied to demonstrate its effectiveness and usefulness. Using HLA in studying human spatial behavior can be expected to yield progress in two aspects: in the understanding of human behavior and human interaction, and further, in the guidance on how to derive rules in decision making for human.
3D tracking of facial features for augmented reality applications

We present an algorithm for feature-based real-time 3D tracking of facial features and its application for visualization of virtual facial modifications. A non-linear Kalman-based estimator is used for 3D head pose calculation and accurate facial features localization. The 3D face model used is adapted to the particular users face by utilizing active shape model for facial landmarks detection, followed by z-depth progressive refining. Virtual facial modifications are performed by user-driven 3D-aware 2D warping of the image sequence. The evaluation of our system shows that the tracker is robust to moderate head movements, occlusion and facial animation, which results in quite realistically-looking virtual facial modifications.
Modeling Abstraction and Simulation Techniques

Abstract : This final report contains the joint work of both University of Massachusetts and Boston University who were each funded under separate contracts. The objective of this effort has been to develop and study three novel complementary directions that may be summarized as follows: 1. Extract information from the inherently slow simulation process of complex systems by exploiting new concurrent simulation techniques. 2. Exploit the hierarchical structure in multi-resolution models by decomposing them in ways which preserve statistical fidelity. 3. Explore the use of neural networks as complex simulation metamodels. The scope of the project has been to develop specific methodologies and algorithms based on the proposed new techniques that were developed and tested. In many cases, the benchmark problems studied are the same or extensions of the ones developed during our previous projects "Enabling Technologies for Real-Time Simulation" and "Real-Time Simulation Technologies for Complex Systems. "