Miracle-dz/UniFAR-FTUs huggingface dataset:
Constructions-and-frames analysis of translations: The interplay of syntax and semantics in translations between English and German

Translation can generally be seen as a task in which the meaning of the original should be preserved as far as possible. This paper formulates the preservation of meaning in terms of the primacy of the frame hypothesis: ideally, the frame of the original is matched by the frame of the translation. I investigate one factor overriding this principle in translations between English and German through the examination of two grammatical constructions, one in English, one in German, which are not commonly available in the other language. Picking a construction comparable in function in the target language leads to frame shifts. In addition to highlighting the interplay between construction and frame choice, the paper explores how frame-to-frame relations can be used to describe the semantic relatedness of original and translation in cases of frame divergences. Theoretical and methodological questions and implications of the cross-lingual application of frame relations are discussed at the end.
Quality of service negotiation in TINA

A solution based on terminal capability negotiation is proposed for the previously undefined QoS negotiation mechanism in the TINA architecture. Capability negotiation provides a means to select suitable media codecs as well as session protocols and network termination points for each terminal involved in a particular communication session. A hierarchy of QoS contexts is proposed to provide grouping of related QoS parameters. Terminal based QoS parameter mapping between the contexts isolates technology specific details to be recognized only where the technology itself is supported. The main result of this work is that by integrating the QoS mapping with the multimedia protocol profile negotiation and actual set-up of the communication, there is no need for generalized transport level QoS descriptions within the network architecture. The focus of this work is on the Network Resource Architecture, but Service Architecture issues are also briefly discussed in the context of an example scenario.
Identification of boundary heat flux using the global function specification

In the paper the inverse problem consisting in the identification of boundary heat flux is presented. On the basis of the knowledge of heating curves at the selected points from the domain the time dependent value of boundary heat flux is identified. In order to solve the problem the global function specification method has been used, on the stage of numerical computations the boundary element method has been applied. In the case of disturbed input data the regularization procedures have been introduced. The theoretical considerations are supplemented by the examples of computations. 1. Direct and inverse problem The following boundary initial problem (1D thermal diffusion) is considered ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 2
A simulation environment for path and image generation in an aerial single-camera vision system

This work describes the essential tools and architecture of a simulation environment, which could help enhance general aviation training as well as safety issues, especially while dealing with flights over unfamiliar environments. It also describes how the authors could effectively generate any desired flight path and its associated surrounding images through implementing a virtual single camera with simultaneous localization and mapping (monocular simultaneous localization and mapping) techniques. The overall package enjoys an aerial three-dimensional (3D)/graphical engine integrated with a full six-degrees-of-freedom aircraft dynamics, which serves as its trajectory generator, together with a real-time waypoint navigation system (WNS). The graphical engine accumulates real-time images generated through a virtual camera installed on the aerial vehicle. The authors effectively exploit C++, high-level Shader language, as well as JSBSim to develop and integrate components of the package. They also bring JSBSim in their in-house graphical core to develop the necessary autopilot commands while using WNS for managing the generation of the desired flight routes and their associated states of the vehicle. Different case studies indicate that the developed environment could enhance safety through effective pre-flight briefing for either flight testing with a new aircraft or flying a known aircraft over unfamiliar terrains. The system is quite suitable for flying at low- to medium-speed aircraft, whereas further enhancement seems necessary for high-speed ones.
A wearable intelligent system for monitoring health condition and rehabilitation of running athletes

A wearable intelligent platform for the monitoring of the health condition and rehabilitation of athletes is presented. The system provides doctors and trainers with real-time monitoring, alerting and medical decision support. It aims to help them optimize treatment and training procedures during rehabilitation, to prevent injury relapses and to ensure a prompt return to peak athletic condition. The system's design requirements are laid out along with its functional description. It is composed of three main subsystems: the athlete subsystem, the rehabilitation station and the portal. The athlete subsystem includes all the monitoring sensors worn by the athlete during training, along with a signal collector and a processing-transceiver unit for preliminary evaluation and for exchanging information with the rehabilitation station. The rehabilitation station is the main control, access and communication point of the system carrying most of the processing. The measurements derived from the received signals are fed into an intelligent module, which provides with the monitoring, alerting and decision support mechanisms. A virtual reality interface is used by the athlete to communicate with the system. The portal is a long-term data storage facility collecting selected data for research purposes.
Cache Coherence Protocols in Shared-Memory Multiprocessors

This paper is a review of the recent research about the design of cache coherence protocols in shared-memory multiprocessors. Two important aspects of shared memory systems are memory consistency and cache coherence. Two major available protocols for cache coherence problems are snoopy coherence and directory based coherence. The snoopy cache protocol is simple and easy to implement, but relies on a low-latency, shared interconnection among the processors and the memory modules. The directory-based multiprocessors communicate with a common directory whenever the processor's action may cause an inconsistency between its cache and the other caches or memory. No broadcast is necessary in this case and therefore the network medium may be of almost any kind. However, the overhead of directory maintenance and look-up time plus the high-latency of communication networks make the directory scheme unattractive. To prevent the directory from becoming the bottleneck, directory entries can be distributed along with the memory, so that different directory accesses can go to different locations.
Fast and smooth controls for a trolley crane

ABSTRACT The time optimal motion problem for the overhead crane is split into two sub-problems: the selection of a geometric path for the load which fulfills the rendezvous and the generation of the time optimal trajectory along the chosen path. Our method uses the differential flatness of the system: it is sufficient to know the Cartesian coordinates of the load and their derivatives, to compute each variable of the system, including state and controls. This property greatly simplifies the motion planning problem and allows us to set bounds on any set of variables of the system. A numerical example shows that this new approach is very efficient to generate open loop controls as smooth as needed.
Modelling Physics with Microsoft Excel

The purpose of this work is to show some of the ways in which Microsoft Excel may be used to solve numerical problems in the field of physics. But why use Excel in the first place? Certainly Excel is never going to out-perform the wonderful symbolic algebra tools that we have today—Mathematica. Mathcad, Maple, MATLAB, etc. However, from a pedagogical stance Excel has the advantage of not being a 'black box' approach to problem solving. The user must do a lot more work than just call up a function. The intermediate steps in a calculation are displayed on the worksheet—of course this is not true with the Solver add-in which is a wonderful 'black box'. Another advantage is the somewhat less steep learning curve. A high school student can quickly learn how to get Excel to do useful calculations.
PHD: A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.
gWidgetsWWW: Creating Interactive Web Pages within R

The gWidgetsWWW package provides a framework for easily developing interactive web pages from within R. It uses the API developed in the gWidgets programming interface to specify the layout of the controls and the relationships between them. The web pages may be served locally under R's built-in web server for help pages or from an rApache-enabled web server.
Fine grain parallel processors and real-time applications: MIMD controller/SIMD array

Important issues related to the applications of massively parallel architectures for real-time cognition are discussed. One of these is real-time control of the array processor. Systems accommodating massive data parallelism are faced with the critical issue of how to incorporate adaptive programming decisions without losing machine efficiency. This involves reexamination of functions to be performed by the software versus those performed by the hardware. The discussion is based on a multiple-instruction multiple-data (MIMD) controller that has been constructed for a single-instruction multiple-data (SIMD) array. The efficiency of an SIMD architecture as a computational model is discussed with reference to several important functions in vision applications that have been benchmarked on the system. Applications that involve real-time control are described. <<ETX>>
CarTALK 2000: safe and comfortable driving based upon inter-vehicle-communication

CarTALK 2000 is a European Project focussing on new driver assistance systems which are based upon inter-vehicle communication. The main objectives are the development of cooperative driver assistance systems on the one hand and the development of a self-organising ad-hoc radio network as a communication basis with the aim of preparing a future standard. As for the assistance system, the main issues are: a) assessment of today's and future applications for co-operative driver assistance systems, b) development of software structures and algorithms, i.e. new fusion techniques, c) testing and demonstrating assistance functions in probe vehicles in real or reconstructed traffic scenarios. To achieve a suitable communication system, algorithms for radio ad-hoc networks with extremely high dynamic network topologies are developed and prototypes tested in the vehicles. Apart from technological goals, CarTALK 2000 actively addresses market introduction strategies including cost/benefit analyses and legal aspects, and aims at the standardisation to bring these systems to the European market. CarTALK 2000 started in August 2001 as a three-years project which is funded within the IST Cluster of the 5th Framework Program of the European Commission.
The Dynamics of Adapting Neurons

How do neurons dynamically encode and treat information? Each neuron communicates with its distinctive language made of long silences intermitted by occasional spikes. The spikes are prompted by the pooled effect of a population of pre-synaptic neurons. To understand the operation made by single neurons is to create a quantitative description of their dynamics. The results presented in this thesis describe the necessary elements for a quantitative description of single neurons. Almost all chapters can be unified under the theme of adaptation. Neuronal adaptation plays an important role in the transduction of a given stimulation into a spike train. The work described here shows how adaptation is brought by every spike in a stereotypical fashion. The spike-triggered adaptation is then measured in three main types of cortical neurons. I analyze in detail how the different adaptation profiles can reproduce the diversity of firing patterns observed in real neurons. I also summarize the most recent results concerning the spike-time prediction in real neurons, resulting in a well-founded single-neuron model. This model is then analyzed to understand how populations can encode time-dependent signals and how time-dependent signals can be decoded from the activity of populations. Finally, two lines of investigation in progress are described, the first expands the study of spike-triggered adaptation on longer time scales and the second extends the quantitative neuron models to models with active dendrites.
An Evaluation of Japanese CALL Systems on the WWW: Comparing a Freely Input Approach with Multiple Selection.

This paper describes the comparison of two Web-based systems with different methods of input and different methods of feedback. The Japanese writing CALL system, which was developed by the authors (called the T system), enables learners to key-in Japanese sentences freely, detects learners' errors and displays appropriate feedback messages to guide learners to correct their errors by themselves. Another system (called the M system) enables learners to input their answer from a multiple selection, and displays only the correct answer as feedback, regardless of the learner's response. Twenty-two Japanese language learners were involved in a comparison experiment to examine the usefulness of the T system. The results show that the T system is preferred to the M system in the input method and the feedback method. The results indicate that the ‘freely input’ method and the ‘feedback corresponding to the learner's typed sentence’ is better than the ‘multiple selection’ method and ‘feedback that only displays th.
Authentication model based on Multi-Agent System

In any communication process the most important stage is represented by the authentication. If this stage ends successfully, the authenticated part can perform all operations for which it was given permission. So, along with the authentication, this process also informs the authenticated part what are its rights and its restrictions on the system. We propose an authentication model based on multi-agent system (MAS) structure. There is a master agent (MA) which receives the authentication request from the user, and multiple slave agents(SA) that, after solving a fixed number of tasks, they will send back the result to MA, which will decide if the authentication ends successfully. The structure of such a system and all the agent's tasks are presented in details. We apply the agent concept to facilitate the authentication process in order to work with multi-clients more dynamically and efficiently.
The treatment of quantity approximation in reference grammars and business English textbooks

The expression of quantity is one of the key elements in business discourse. Quantity can be expressed in a precise or imprecise/vague manner. This paper reports on some of the results of a large-scale corpus-driven investigation of quantity approximation in a variety of business genres in English, French and Dutch. The focus of this paper is on the linguistic devices used to express quantity approximation identified using a number of search methods in three corpora representing three different business English genres: the 1-million-word Business English News corpus (BENews, business news reporting genre), the 1-million-word business subcorpus of the Louvain Corpus of Research Articles1 (LOCRA_Business, a corpus of academic publications on a number of business topics), and a 500,000-word corpus of spoken business meetings (BNC_meetings, the ‘business meetings’ component of the British National Corpus). The methods used include using part-of-speech tagged versions of the corpora (tagged with the Tree Tagger, Schmid 1994) to automatically retrieve numbers from the corpora and identify the approximators that occur around them, (2) using semantically tagged versions of the corpora (UCREL Semantic Analysis System (USAS)) (see Rayson, 2003) and analysing the different tags potentially signalling quantity approximation (e.g. A13.4 for ‘degree: approximators’), (3) using WordSmith Tools’ keyword analysis (Scott 2008) to identify potential quantity approximation devices that are specific to the business genres under study, comparing the business corpora with each other but also with a 1-million-word ‘fiction’ reference corpus (the ‘Fiction Baby BNC’ corpus). These inductive search methods made it possible not only to uncover a wide variety of approximating devices but also to shed light on genre-specific approximators and on some approximators’ preferred collocational patterns. The main aim of the paper is to compare the results of the corpus-driven analysis with the treatment of quantity approximators in a number of corpus-informed general reference grammars of English (e.g. Collins Cobuild English Grammar or the Cambridge Grammar of English) and business English textbooks and reference books that target intermediate to advanced learners of English (e.g. Intelligent Business, The Business, ProFile, Grammar for Business). The analysis is both quantitative and qualitative as it examines, on the one hand, the amount of information and the various types of approximators included, and, on the other, the type of information displayed (e.g. style labels, collocational patterns) and where and the way in which it is presented and discussed (e.g. in a special section/unit devoted to quantity approximation). The paper also offers an evaluation of the relevance and usefulness of the approximators and related information featured in the publications under scrutiny in the light of the results of the corpus-driven analysis.
Multilayer backpropagation network for flexible circuit recognition

This paper presents an industrial application of the multilayer backpropagation neural network with a modified learning rule, in recognizing transparent flexible membrane printed circuits independent of the position, orientation and scale. We give a new learning algorithm which reduces the complexity of the multilayer backpropagation network by pruning insignificant weights and chooses the best size to suit the underlying complexity of the recognition problem. This new learning algorithm is also compared with other network redundancy reduction techniques and tested on 3-bit parity problem. In this particular application, moment invariant features were chosen to train the multilayer backpropagation network. As the circuits have regular shape with a limited number of corners, a fast corner based moment invariance estimation algorithm is employed. This algorithm is almost hundred times faster than standard occupancy array based algorithm for shapes with a small number of corners. <<ETX>>
Data Mining Decision Trees in Economy

Data Mining represents the extraction previously unknown, and potentially useful information from data. Using Data Mining Decision Trees techniques our investigation tries to illustrate how to extract meaningful socio-economical knowledge from large data sets. Our tests find 5 attributes selection measures that perform more accurate then the best performance of the 17 algorithms presented in literature.
Best Practices For Choosing Non-Intrusive But Effective CAPTCHAs

Completely Automated Public Turing Test to Tell Computers and Humans Apart (CAPTCHA) is has become a part of computer security standard in order to distinguish humans from computers. This paper mainly discusses usability and robustness issues in CAPTCHA design and implementation. A brief introduction about CAPTCHA and some attempts to defeat CAPTCHA, including how to deal with it are also described in this paper .
Pulse Shaping Algorithm for PAPR Reduction in ZCT Precoded OFDM System

In Orthogonal Frequency Division Multiplexing (OFDM) PAPR (Peak to Power Ratio) is one of the major drawbacks. In this paper we propose a study of PAPR and PAPR reduction technique using ZCT. The Zadoff-Chu Matrix transform (ZCT) is one type of technique used to reduce the PAPR analyzed. In ZCT (Zadoff-Chu Matrix transform) we obtain the ZCT sequences from the ZCT kernel row wise filling which gives rise to the constant Envelope OFDM (CE-OFDM) system with the zero dB and ZCT sequences form column wise gives rise to the nearly 7.8 dB with the clip rate and the number of sub carriers used in the OFDM is with QPSK or QAM modulation. In CE-OFDM it is required to use the pulse shaping which helps to meet the required transmission spectrum and to keep the out of band radiation low and the PAPRs are no longer zero dB. So in the present paper we analyze the various PAPR reduction techniques with the Root Raised Cosine (RRC) pulse shaping method. The final simulation results show the ZCT Row wise precoder based OFDM (ZCT-R-OFDM) system has less PAPR than the ZCT Column wise precoder based OFDM (ZCT-C-OFDM), conventional OFDM.