Miracle-dz/UniFAR-FTUs huggingface dataset:
Collaborative Work Using Give and Take Passing Protocols

To effectively design computer simulations of shared environments, an understanding is needed of the basic informational requirements and underlying movement patterns generated by two people collaborating in these environments. Results from this study indicate that when passing objects in a natural environment, the fundamental movement patterns seen during simple grasping tasks are altered to accommodate the collaborative nature and social constraints of the task. When giving objects, although subjects reach further they reach more quickly than when the objects are taken. This result may indicate a social consideration taken by the passer to move quickly and efficiently over a long distance to transfer the object to the receiver. Thus, the receiver does not have to travel as far or as fast to receive the given object. However, when objects are taken, passers move more slowly and lift the objects higher. This result may indicate that the passer times their movement so that they are not waiting at the end of their movement for the receiver to reach the target. Thus, although the result of the task is the same (the receiver obtains the object), the underlying movement patterns differ with the goal and social constraints of the movement. These results may be used to develop predictive algorithms when designing virtual and augmented environments. Future experiments will concentrate on the nature of visual and haptic information required for both the passer and receiver to effectively perform a passing task in an augmented environment.
Teletraffic characteristics in cellular systems and traffic flow in road systems

This paper describes an approximate theoretical method to analyze communication traffic characteristics of a cellular mobile communication system on the two-dimensional plane assuming that calls are generated by subscribers on vehicles moving along a road network. Our problems are to analyze the teletraffic characteristics of the cellular system by using the parameters indicating the vehicles' flow characteristics on the road network.
Compiler-Aided Run-Time Performance Speed-Up in Super-Scalar Processor

In our world, where most systems become embedded systems, the approach of designing embedded systems is still frequently similar to the appr oach of designing organic systems (or not embedded systems). An organic system, like a personal computer or a work station, must be able to run any task submitted to it at any time (with cert ain constrains depending on the machine). Consequently, it must have a sophisticated general pur pose Operating System (OS) to schedule, dispatch, maintain and monitor the tasks and assist th em in special cases (particularly communication and synchronization between them and with exte rnal devices). These OSs require an overhead on the memory, on the cache and on the run time. Moreover, generally they are task oriented rather than machine oriented; therefore the process or's throughput is penalized. On the other hand, an embedded system, like an Anti-lock Braking System (ABS), executes always the same software application. Frequently it is a small or medium size system, or made up of several such systems. Many small or medium size embedded systems, with limited number of tasks, can be scheduled by our proposed hardware ar chitecture, based on the Motorola 500MHz MPC7410 processor, enhancing its throughput and avoiding the software OS overhead, complexity, maintenance and price. Encouraged by our exper imental results, we shall develop a compiler to assist our method. In the meantime we will prese nt here our proposal and the experimental results.
Robotski sistem za pobiranje majhnih industrijskih polizdelkov s pomočjo računalniškega vida

Cilj diplomske naloge je izdelava ucinkovitega, robustnega ter hkrati cenovno ugodnega sistema za pobiranje ter obdelavo kovinskih izdelkov na razlicnih obdelovalnih postajah. Glavna prednost pred namenskimi obdelovalnimi avtomati je vsestranskost, saj naj bi bil tak sistem zmožen zaznati in obdelati mnogo razlicnih oblik izdelkov. Sistem sestavljajo kamera, robot ter racunalnik, na katerem se izvaja program, ki smo ga razvili. Izdelki so postavljeni na ravni povrsini. Kamera zajame sliko te povrsine, ki se nato prenese na racunalnik, kjer se slika v namenskem programu obdela s pomocjo algoritmov racunalniskega vida. V programu se izvaja tudi preslikava tock iz koordinatnega sistema kamere v koordinatni sistem robota. Program nato s pomocjo teh koordinat upravlja robota. Robot pobere izdelek ter ga nese na eno izmed obdelovalnih postaj, kjer se izvede obdelava - vrtanje lukenj, vtiskanje ali vrezovanje navojev, brusenje povrsin ipd. Po koncanem ciklu je izdelek odložen v zaboj in proces se ponovi z naslednjim izdelkom.
Optimized Research for Mobile Communication Strategy Based on Parallel Computing

In order to improve the speed of simulation, one of the feasible approaches in mobile communications is parallel computing. In this paper, the operating environment will be achieved with MPICH2. Parallel computing is suitable for large scale computing tasks. An important factor which limits the speed-up ratio improve is that parallel computing cannot be achieved in communication process.Selecting the finite difference method, taking a two-dimensional steady-state heat distribution problem act as an example. By choosing domain decomposition method divide the entire data area into multiple sub-domains. Ultimately, the parallel program is designed in MPI’s Peer-to-Peer Model. By modifying the communication mode and the communication process, the speedup is substantial increased, closing to ideal values.
Understanding Solaris TM Filesystems and Paging

This trio of papers was prepared for publication in September of 1996 when the author was a member of the Desknet group in Sun Microsystems Laboratories. He is presently in the Solaris Products group. Tuning Solaris UFS Bandwidth The purpose of this paper is to provide general tuning guidelines for getting the best bandwidth possible from large files using Solaris UFS. Information on filesystem parameters, system variables, device and striping configurations, application changes, and I/O test programs is provided. Understanding the Solaris VM Paging System The goal of this paper is to give a basic introduction to the Solaris virtual memory paging algorithms. The information presented here provides a basis for system tuning experiments and understanding paging-related performance problems; however, this sketch is meant only as a starting point. Trends in Single-Host Filesystems Technology This paper discusses alternatives in single-host filesystems. Its purpose is to show how technology trends have changed design tradeoffs and made obsolete many assumptions in older filesystems. Examples of current filesystems are compared to show relative strengths and weaknesses, as well as inherent architec-tural limitations.
Bayesian strategy assessment in multi‐attribute decision making

Behavioral Decision Research on multi-attribute decision making is plagued with the problem of drawing inferences from behavioral data on cognitive strategies. This bridging problem has been tackled by a range of methodical approaches, namely Structural Modeling (SM), Process Tracing (PT), and comparative model fitting. Whereas SM and PT have been criticized for a number of reasons, the comparative fitting approach has some theoretical advantages as long as the formal relation between theories and data is specified. A Bayesian method is developed that is able to assess, whether an empirical data vector was most likely generated by a ‘Take The Best’ heuristic (Gigerenzer et al., 1991), by an equal weight rule, or a compensatory strategy. Equations are derived for the two- and three-alternative cases, respectively, and a simulation study supports its validity. The classification also showed convergent validity with Process Tracing measures in an experiment. Potential extensions of the general approach to other applications in behavioral decision research are discussed. Copyright © 2003 John Wiley & Sons, Ltd.
Bandwidth tree - a data structure for routing in networks with advanced reservations

With the fast development of the Internet, more and more distributed applications will require guaranteed quality of service and maintain minimum network resource during their running sessions. Reservation in advance provides a solution for the need of reserving the network resource for future use like we make reservations in advance in our daily business. Routing has a critical effect on the network reservation process. In this paper, we propose a hierarchical data structure, the bandwidth tree, which records the intervals of available link bandwidth instead of unit time slot. The storage space and searching time complexity under this data structure are independent of the size of the time slots. This overcomes the difficulty in previously proposed research in which larger time slot size loses routing accuracy while smaller time slot size significantly increases routing complexity. The new data structure significantly improves the running time complexity for routing procedures under a variety of QoS requirements.
The mass storage testing laboratory at GSFC

Industry-wide benchmarks exist for measuring the performance of processors (SPECmarks), and of database systems (Transaction Processing Council). Despite storage having become the dominant item in computing and IT (Information Technology) budgets, no such common benchmark is available in the mass storage field. Vendors and consultants provide services and tools for capacity planning and sizing, but these do not account for the complete set of metrics needed in today's archives. The availability of automated tape libraries, high-capacity RAID systems, and high- bandwidth interconnectivity between processor and peripherals has led to demands for services which traditional file systems cannot provide. File Storage and Management Systems (FSMS), which began to be marketed in the late 80's, have helped to some extent with large tape libraries, but their use has introduced additional parameters affecting performance. The aim of the Mass Storage Test Laboratory (MSTL) at Goddard Space Flight Center is to develop a test suite that includes not only a comprehensive check list to document a mass storage environment but also benchmark code. Benchmark code is being tested which will provide measurements for both baseline systems, i.e. applications interacting with peripherals through the operating system services, and for combinations involving an FSMS. The benchmarks are written in C, and are easily portable. They are initially being aimed at the UNIX Open Systems world. Measurements are being made using a Sun Ultra 170 Sparc with 256MB memory running Solaris 2.5. 1 with the following configuration: 4mm tape stacker on SCSI 2 Fast/Wide; 4GB disk device on SCSI 2 Fast/Wide; and Sony Petaserve on Fast/Wide differential SCSI 2.
JavaVis: una librería para visión artificial en Java

En este articulo se describe JavaVis, una libreria de vision artificial escrita en Java y desarrollada en el Departamento de Ciencia de la Computacion e Inteligencia Artificial de la Universidad de Alicante. Esta libreria presenta una serie de ventajas: portabilidad, facil ampliacion, interfaz grafico y formato de imagen especial que permite almacenar secuencias de imagenes y datos de tipo geometrico. La libreria se utiliza en las practicas de Vision Artificial que se vienen impartiendo en las asignaturas de I.A. de la Universidad de Alicante.
Documentation of a computer program to simulate transient leakage from confining units using the modular finite-difference, ground-water flow model

This report presents a new method of simulating transient leakage from confining units using the U.S. Geological Survey Modular Finite-Difference Ground-Water Flow Model. Transient leakage into or out of a compressible fine-grained confining unit results from ground-water storage changes within the unit. The importance of fine-grained units in analyses of transient ground-water flow is not always recognized. The new method of simulating transient leakage in the Modular Finite-Difference Ground-Water Flow Model is referred to as the Transient-Leakage Package, version 1, or the TLK1 Package. The TLK1 Package solves integrodifferential equations that describe the flow components across the upper and lower boundaries of confining units. The exact equations are approximated to allow efficient solution for the flow components. The flow components are incorporated into the finite-difference equations for model cells that are adjacent to confining units. Vertical hydraulic conductivity, thickness, and specific storage are specified in input arrays for each confining unit. Confining-unit properties can differ from cell to cell and a confining unit need not be present at all locations; however, a confining unit must be bounded above and below by model layers in which head is calculated or specified. The TLK1 Package was used for an example problem to simulate drawdown around a pumped well in a system with two aquifers separated by a confining unit. The pumping was limited to one of the two aquifers. The exact drawdown values determined from an analytical solution were compared with the simulated drawdown. The solution using the TLK1 Package closely matched the exact solution for drawdown values in excess of 1 centimeter in the pumped and unpumped aquifers. The problem also was simulated without the TLK1 Package by using a separate model layer to represent the confining unit. That simulation was further refined by using two model layers to represent the confining unit. The simulation made using the TLK1 Package was faster and more accurate than either of the simulations using model layers to represent the confining unit.
Proceedings of the 2011 Summer Computer Simulation Conference

Welcome to the 2013 Summer Computer Simulation Conference (SCSC 2013). This 45th edition of the premier international conference of the Society for Modeling and Simulation International (SCS) is staged here in the city of Toronto, which is heralded as one of the most International, multi-cultural cities in the whole world. We are pleased to note that the papers which are being presented at SCSC 2013 have been submitted by authors coming from a significant number of countries throughout the world . China, Germany, Iran, Israel, Italy, Japan, Mexico, Netherlands, Russia, South Korea, Spain, Sweden, United Arab Emirates, United Kingdom, as well as United States and Canada. This is indicative of the continued interest in and development of Modeling and Simulation (M&S) as a field of research and application all over the world.
Una implementación paralela de las Transformadas DCT y DST en GPU

Resumen. Se presenta la implementación paralela de las Transformadas Coseno Discreta y Seno Discreta en GPU, utilizadas en procesamiento de señales. Se analiza la performance, y el grado de aceleración obtenido en relación a la solución secuencial. A modo de referencia, se compara con la paralelización en un cluster de multicores. Como herramientas de programación se utilizaron CUDA en GPU y MPI para la versión en cluster de multicore. Los resultados experimentales muestran una buena respuesta de las soluciones en GPU en relación a las restantes alternativas.
A Comparative Study Of Data Clustering Techniques

As we know that clustering is a process for discovering groups and identifying interesting patterns. Data mining refers to extract knowledge from large database. We can say that data mining is a knowledge mining process. Size and need of dataset are increasing day by day. That’s why we need data mining techniques for managing huge dataset. It is a process of knowledge discovery in database (KDD). Data mining techniques are useful in many more fields today such as biology , libraries, GIS, satellite images, marketing, medical diagnostics and many more field . in this paper this study tells us about the comparison between data mining techniques on the basis of size, model, application areas and others features. This study tells us when and which data mining techniques are used.
A Performance Measure for Distributed Wireless Ad Hoc Networks

An inspecting apparatus for precisely detecting foreign substances or scars present on a translucent planar article such as a photomask at a high speed with a laser beam entering from face of the article, comprises first photoelectric means for receiving the scattered light generated in a space on a face of the photomask, second photoelectric means for receiving the scattered light generated in a space on the other face of the photomask, comparator means for comparing the photoelectrically converted signals from the first and second photoelectric means to identify one of predetermined plural magnitude relationships to which the magnitudes of the signals belong, and inspecting means for generating, in response to the detection output signal of the comparator means, a detection signal allowing to identify the approximate difference in the shape of the foreign substance, for example either a tall foreign substance or a short one.
Representation and extraction of trends from process data

This thesis introduces a new unified paradigm to address the problems of trend representation and extraction from process data. A language for trend representation is established, and then used to support the formulation of a methodology for trend extraction from process data. The representational language is called triangular episodic representation, because it is based on the formal definition of "temporal episodes" which can be modelled geometrically as triangles to describe the occurring local temporal patterns in data. The trend extraction methodology is called qualitative scaling, because it is based on successive scaling of local temporal patterns of data (described by the episodic triangles) under a well defined qualitative context. The representation is capable of capturing all the relevant information in the data (quantitative, semi-quantitative, qualitative) and express the information in a form suitable for higher level information process in process operations such as pattern recognition and qualitative reasoning for processes monitoring, fault diagnosis, supervisory control and various knowledge-based expert system applications. The scaling methodology is capable for generating a hierarchical multiscale structure of trend descriptions over different time scales from any process data record, without distorting or dislocating the distinguishing (e.g. step and spike) and surviving patterns of the data. The qualitative scaling algorithm was implemented on a personal computer and tested extensively against real process data from the pharmaceutical, chemical, and petroleum industries. The results demonstrate some unique characteristics for signal interpretation not apparent in existing technologies. Finally, a preliminary theory of discontinuity is developed which can provide a theoretical basis on which the qualitative scaling paradigm can be implemented based on any representation desired for describing trends (e.g. functional representation). (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
NRC Publications Archive Archives des publications du CNRC

Visual data mining using nonlinear virtual reality spaces (VR) is applied to symbolic knowledge in the form of production rules obtained by rough sets methods in a classiﬁcation problem with partially deﬁned and imprecise classes. In the context of a geophysical prospecting problem aiming at ﬁnding underground caves, a virtual reality nonlinear space for production rules is constructed. The distribution of the rough sets derived rules is characterized by a fuzzy model in both the original 5D space and in the 3D VR space. The membership function of the target class (the presence of a cave) is transferred from the rules to the data objects covered by the corresponding rules and mapped back to the original physical space. The fuzzy model built in the VR space predicted sites where new caves could be expected and one of them was conﬁrmed.
Understanding the Effectiveness of Online Peer Assessment: A Path Model

Peer assessment has been implemented in schools as both a learning tool and an assessment tool. Earlier studies have explored the effectiveness of peer assessment from different perspectives, such as domain knowledge and skills, peer assessment skills, and attitude changes. However, there is no holistic model describing the effects of cognitive and affective feedback, grading, and prior knowledge, and earlier studies often discuss learning outcomes without ascribing them to particular causes. Moreover, few studies have differentiated between the effects of peer assessment on both assessors and assessees. This study used a path model to investigate how two online peer-assessment activities—rubric-based assessment and peer feedback—affected the learning performance of assessors and assessees. One hundred and eighty-one high school students engaged in peer assessment via an online system—iLAP. Several path models were tested and we found that the original model did not fit when the variable of cognitive feedback from peers was included. The best fit model was the one in which direct paths from cognitive feedback from peers and student exam scores in a prior Humanities course were removed.
Text Entry Systems: Mobility, Accessibility, Universality

Text entry has never been so important as it is today. This is in large part due to the phenomenal, relatively recent success of mobile computing, text messaging on mobile phones, and the proliferation of small devices like the Blackberry and Palm Pilot. Compared with the recent past, when text entry was primarily through the standard "qwerty" keyboard, people today use a diverse array of devices with the number and variety of such devices ever increasing. The variety is not just in the devices, but also in the technologies used: Entry modalities have become more varied and include speech recognition and synthesis, handwriting recognition, and even eye-tracking using image processing on web-cams. Statistical language modeling has advanced greatly in the past ten years and so therein is potential to facilitate and improve text entry--increasingly, the way people communicate. This book consists of four parts, and covers these areas: Guidelines for Designing Better Entry Systems (including research methodologies, measurement, and language modelling); Devices and Modalities; Languages of the world and entry systems in those languages; and variety in users and their difficulties with text entry--and the possible design and guideline solutions for those individual user groups. This book covers different aspects of text entry systems and offers prospective researchers and developers * global guidelines for conducting research on text entry, in terms of design strategy, evaluation methodology, and requirements; * history and current state of the art of entry systems, including coverage of recent research topics; * specific guidelines for designing entry systems for a specific target, depending on devices, modalities, language, and different physical conditions of users