Miracle-dz/UniFAR-FTUs huggingface dataset:
Constrained Grammatical Error Correction using Statistical Machine Translation

This paper describes our use of phrasebased statistical machine translation (PBSMT) for the automatic correction of errors in learner text in our submission to the CoNLL 2013 Shared Task on Grammatical Error Correction. Since the limited training data provided for the task was insufficient for training an effective SMT system, we also explored alternative ways of generating pairs of incorrect and correct sentences automatically from other existing learner corpora. Our approach does not yield particularly high performance but reveals many problems that require careful attention when building SMT systems for error correction.
Influence of Hemodialysis on Lipid Peroxidation, Enzymatic and Non-Enzymatic Antioxidant Capacity in Chronic Renal Failure Patients

Background: Free radical induced damages are thought to be involved in chronic kidney disease (CKD), especially in patients who are on hemodialysis (HD) for prolonged periods. Hemodialysis can influence multiple biochemical factors, several of which are useful, although the rest can be harmful and increase the severity of disease. Objectives: The purpose of this study was to evaluate the effect of the HD membrane polysulfone on oxidative stress markers, by measuring the level of lipid peroxidation and total antioxidant activity (TAC), in the blood of HD patients. Patients and Methods: This study was carried out on 31 HD patients and 31 healthy persons, matched for age and sex, as control group. Blood samples were drawn before and after HD from arteriovenous fistulas, and once from the controls. Superoxide dismutase (SOD), catalase (CAT) and thiobarbituric acid-reactive substance (TBARS) in blood hemolyzate, Glutathione peroxidase (GpX) of whole blood and TAC of plasma were measured, respectively. Then, we investigated the association between TAC of plasma, measured by ferric reducing antioxidant power (FRAP), and lipid peroxidation level with its related parameters, in HD patients. Results: The SOD, GpX and CAT were decreased after HD (P < 0.05). Also, FRAP was shown to decrease after HD (P < 0.05). However, erythrocyte TBARS levels (μmol/gr of Hb) were increased after HD, in comparison with controls, and before HD (P < 0.05). There was a significant negative correlation between TBARS and antioxidant indices, such as SOD (r = -0.67, P = 0.001), GpX (r = -0.76, P = 0.001), CAT (r = -0.63, P = 0.001) and FRAP (r = -0.84, P = 0.001). The FRAP was significantly and directly correlated with uric acid (r = +0.62, P = 0.001), SOD (r = +0.72, P = 0.001), GpX (r = +0.87, P = 0.001) and CAT (r = +0.84, P = 0.001). Conclusions: The results of our study proposed that there is a loss or inactivation of antioxidant factors, coupled with increased lipid peroxidation during the procedure of HD, possibly through the dialyzer membrane, with probable consequences on the severity of illness.
Parton distribution function uncertainties

We present parton distribution functions which include a quantitative estimate of its uncertainties. The parton distribution functions are optimized with respect to deep inelastic proton data, expressing the uncertainties as a density measure over the functional space of parton distribution functions. This leads to a convenient method of propagating the parton distribution function uncertainties to new observables, now expressing the uncertainty as a density in the prediction of the observable. New measurements can easily be included in the optimized sets as added weight functions to the density measure. Using the optimized method nowhere in the analysis compromises have to be made with regard to the treatment of the uncertainties.
Cooperation in the supply chain and lean production adoption

Purpose – The purpose of this paper is to empirically examine the impact of the level of cooperation in the supply chain on lean production (LP) adoption. The effect of the level of cooperation with both suppliers and customers with regards to the intensity of LP adoption is examined, as is the joint effect of cooperation and information integration with customers.Design/methodology/approach – Analysis is carried out on a sample of 84 manufacturing plants that are first tier suppliers to original equipment manufacturers in the Spanish automotive industry. Data were gathered from plant CEOs via a combination of regular mail, e‐mail and internet‐based survey methods. Data are analyzed using exploratory factor analysis and hierarchical regression.Findings – The results show that while greater levels of cooperation with suppliers do not impact on the intensity of LP adoption, greater levels of cooperation with customers do have a significant effect. Also, the greater the cooperation with customers and the mor.
A Comparative Study of Proactive and Reactive Geographical Routing Protocols for MANET

In the world of mobile wireless communication, it has become more and more important to establish networks that are not only capable of delivering information across vast distances but can also perform this task efficiently. Many routing protocols for mobile ad hoc networks (MANETs) rely on additional information such as geographical locations obtained via GPS to improve the overall performance of the route discovery process. This paper is an extension of our previous study of location-aided MANET routing protocols. In this paper we continue our research endeavors by comparing the performance of several AODV-based reactive, location-aided MANET routing protocols and Geographical Routing Protocol (GRP), an OPNET implementation of a proactive, geographical location-based routing protocol for MANET. Keywords—location-aided routing; geographical routing; LAR;
Wireless Sensor Networks for Voice Capture in Ubiquitous Home Environments

In this paper we introduce a voice capture application using a wireless sensor network; our main contribution is the integration of a novel capture technique specifically designed for hierarchical wireless sensor networks. Furthermore, we show the challenges involved in the implementation of our experimental prototype which is oriented towards a secure ubiquitous home environment but could be extended to other similar scenarios. We performed a series of experiments on our prototype implementation, the results of those experiments showed that our approach consumes less energy than the traditional capture and send approach. Additionally, our technique provides basic security services such as authentication and confidentiality for control messages without incurring in additional energy consumption.
Transport Layer Protocols for the Land Mobile Satellite Broadcast Channel

An important advantage of satellite transmission is their inherent capability to broadcast data to large audiences. The standard application is thereby to send data streams (i.e. TV) to wide audiences using fixed satellite receivers. An extension to this approach is broadcast to mobile receivers, especially cars. This has been realised in the U.S. by XM-Radio and Sirius. All these system have in common that they broadcast streams to receiver, which are immediately played. In contrast to this traditional broadcast models, other approaches are researched in Europe (e.g. in the ESA project Ku-Mobil and the EU project Maestro), which go away from the traditional thinking of services as streams. Instead, this new approach culminates in the idea of transferring distinguished files. For these systems, unidirectional file based transport protocols are needed, which fit into the very specifics of the land-mobile satellite environment. While broadcasting streams can make use of the well defined MPEG-protocols, file transfer via an unreliable medium is less well specified. In the following an Internet Protocol (IP) based transport scheme is analysed, where the main focus is on protocols from the IETF Reliable Multicast Group. There, the combination of the Layered Coding Transport (LCT) protocol with the Asynchronous Layered Coding (ALC) and the File Delivery over Unidirectional Transport (FLUTE) protocol seems a most promising candidate for this kind of application. The basic mechanism of these protocols and their behaviour in the land mobile environment is shown and analysed.
A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedule's makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the same problem. The computational results show that the proposed tabu search procedure generally outperforms the existing heuristic for small- and large-sized problems.
REGULAR HONEYCOMBS IN HYPERBOLIC SPACE

made a study of honeycombs whose cells are equal regular polytopes in spaces of positive, zero, and negative curvature. The spherical and Euclidean honeycombs had already been described by Schlaf li (1855), but the only earlier mention of the hyperbolic honeycombs was when Stringham (1880, pp. 7, 12, and errata) discarded them as "imaginary figures", or, for the two-dimensional case, when Klein (1879) used them in his work on automorphic functions. Interest in them was revived by Sommerville (1923), who investigated their metrical properties. The honeycombs considered by the above authors have finite cells and finite vertex figures. It seems desirable to make a slight extension so as to allow infinite cells, and infinitely many cells at a vertex, because of applications to indefinite quadratic forms (Coxeter and Whitrow 1950, pp. 424, 428) and to the close packing of spheres (Fejes Tóth 1953, p. 159). However, we shall restrict consideration to cases where the fundamental region of the symmetry group has a finite content, like that of a space group in crystallography. This extension increases the number of three-dimensional honeycombs from four to fifteen, the number of four-dimensional honeycombs from five to seven, and the number of five-dimensional honeycombs from zero to five. A further extension allows the cell or vertex figure to be a star-poly tope, so that the honeycomb covers the space several times. Some progress in this direction was made in two earlier papers: one (Coxeter 1933), not insisting on finite fundamental regions, was somewhat lacking in rigour; the other (Coxeter 1946) was restricted to two dimensions. The present treatment is analogous to § 14.8 of Regular Polytopes (Coxeter 1948, p. 283). We shall find that there are four regular star-honeycombs in hyperbolic 4-space, as well as two infinite families of them in the hyperbolic plane. 2. Two-dimensional honeycombs. In the Euclidean plane, the angle of a regular ^>-gon, {p}, is (1 — 2\p)n. In the hyperbolic plane it is smaller, gradually decreasing to zero when the side increases from 0 to oo. Hence, if p and q are positive integers satsifying
A Recursive Construction of High-Dimensional Grassmann Space-Time Codes for Non-Coherent MIMO Systems

This paper presents a method for construction of high-dimensional Grassmann space-time codes for non-coherent block fading MIMO channels, aiming at codes with large block lengths compared to the number of transmit antennas. The construction method is recursive, starting from a low-dimensional coherent or non-coherent code. The performance analysis of the constructed codes supports the theoretical prediction of performance improvement when increasing the code block length. Additionally, the code structure could potentially offer a possibility for complexity reduction of the decoding procedure.
Novel knee joint mechanism of transfemoral prosthesis for stair ascent

The stability of a transfemoral prosthesis when walking on flat ground has been established by recent advances in knee joint mechanisms and their control methods. It is, however, difficult for users of a transfemoral prosthesis to ascend stairs. This difficulty is mainly due to insufficient generation of extension moment around the knee joint of the prosthesis to lift the body to the next step on the staircase and prevent any unexpected flexion of the knee joint in the stance phase. Only a prosthesis with an actuator has facilitated stair ascent using a step-over-step gait (1 foot is placed per step). However, its use has issues associated with the durability, cost, maintenance, and usage environment. Therefore, the purpose of this research is to develop a novel knee joint mechanism for a prosthesis that generates an extension moment around the knee joint in the stance phase during stair ascent, without the use of any actuators. The proposed mechanism is based on the knowledge that the ground reaction force increases during the stance phase when the knee flexion occurs. Stair ascent experiments with the prosthesis showed that the proposed prosthesis can realize stair ascent without any undesirable knee flexion. In addition, the prosthesis is able to generate a positive knee joint moment power in the stance phase even without any power source.
FiberScout: An Interactive Tool for Exploring and Analyzing Fiber Reinforced Polymers

Advanced composites such as fiber reinforced polymers are promising candidate materials for future components as they allow integrating the continuously rising demands of industry regarding cost-effectiveness, function-orientation, integration and weight. The most important structures of fiber reinforced polymers are the individual fibers, as their characteristics (stiffness, strength, ductility, durability, etc.) to a large extent determine the properties of the final component. The main contribution of this paper is the introduction of a new system for interactive exploration and visual analysis of fiber properties in X-ray computed tomography data of fiber reinforced polymers. The presented tool uses parallel coordinates to define and configure initial fiber classes. Using a scatter plot matrix linked to the parallel coordinates the initial classification may be refined. This allows to analyze hidden relationships between individual fiber properties. 2D and 3D views depict the resulting fiber classifications. By using polar plots an intuitive rendering of the fiber orientation distribution is provided. In addition, two modules of higher abstraction are proposed: The Blob visualization creates a hull around fibers with similar characteristics. The fiber metadata visualization allows to calculate overlays for 2D and 3D views containing regional information of particular material characteristics. The proposed system has been evaluated by two groups of domain experts. Applying the presented concepts the user feedback shows that the domain experts are now able to efficiently perform tasks as classification of fibers, visualization of fiber lengths and orientations, and visualization of fiber regions. The insights gained can be forwarded to the design office as well as to material development and simulation, in order to speed up the development of novel composite components.
Image Based Visual Servoing Using Takagi-Sugeno Fuzzy Neural Network Controller

In this paper, a Takagi-Sugeno fuzzy neural network controller (TS-FNNC) based image based visual servoing (IBVS) method is proposed. Firstly, the eigenspace based image compression method is explored which is chosen as the global feature transformation method. After that, the inner structure, performance and training method of T-S neural network controller are discussed respectively. Besides, the whole architecture of the TS-FNNC is investigated. No artificial mark is needed in the visual servoing process. No priori knowledge of the robot kinetics and dynamics or camera calibration is needed. The method is implemented and validated on a Motoman UP6 based eye-in-hand platform and the experimental results are also reported in the end.
Bimodal Content Defined Chunking for Backup Streams

Data deduplication has become a popular technology for reducing the amount of storage space necessary for backup and archival data. Content defined chunking (CDC) techniques are well established methods of separating a data stream into variable-size chunks such that duplicate content has a good chance of being discovered irrespective of its position in the data stream. Requirements for CDC include fast and scalable operation, as well as achieving good duplicate elimination. While the latter can be achieved by using chunks of small average size, this also increases the amount of metadata necessary to store the relatively more numerous chunks, and impacts negatively the system's performance. We propose a new approach that achieves comparable duplicate elimination while using chunks of larger average size. It involves using two chunk size targets, and mechanisms that dynamically switch between the two based on querying data already stored; we use small chunks in limited regions of transition from duplicate to nonduplicate data, and elsewhere we use large chunks. The algorithms rely on the block store's ability to quickly deliver a high-quality reply to existence queries for already-stored blocks. A chunking decision is made with limited lookahead and number of queries. We present results of running these algorithms on actual backup data, as well as four sets of source code archives. Our algorithms typically achieve similar duplicate elimination to standard algorithms while using chunks 2-4 times as large. Such approaches may be particularly interesting to distributed storage systems that use redundancy techniques (such as error-correcting codes) requiring multiple chunk fragments, for which metadata overheads per stored chunk are high. We find that algorithm variants with more flexibility in location and size of chunks yield better duplicate elimination, at a cost of a higher number of existence queries.
Integration of a tactile display in teleoperation of a soft robotic finger using model based tactile feedback

Tactile feedback is a key modality in object exploration and manipulation. However it has not been satisfactorily addressed in master-slave teleoperation. One of the reasons is that current tactile displays do not satisfy the stringent performance and design requirements for integration in master haptic devices. This paper presents the integration of a compact, high performance tactile display in a teleoperation setup. In this scenario the tactile display provides tactile feedback while remote objects are being contacted through a soft robotic finger. The display is mounted on a force feedback master device, which controls a manipulator equipped with a force sensor and a soft finger. Force feedback and tactile feedback are combined in a hybrid approach. Force feedback on the master reflects the measured remote interaction forces while tactile feedback is model based. This hybrid feedback method can provide force and tactile information in cases of highly structured teleoperation scenes where tactile sensing is absent or rudimentary while accurate environment models exist. An experiment is presented where users teleoperated the robot finger in a 3D contour following task with and without tactile feedback. Subjects' performances indicate an improvement in teleoperation when both tactile and force feedback are present.
Recognition and Parapharasing of Periphrastic and Overlapping Verb Phrases

This paper proposes a dictionary-based method of recognizing and paraphrasing Japanese periphrastic and overlapping verb phrases. Periphrastic VP is a phrase in which the verb or the noun functions as an adverb, voice or aspect. Overlapping VP is a phrase in which there is an overlapping meaning between the verb and the noun. The result of our experiment showed that the method can deal with those two phrases effectively.
Aes Algorithm Using 512 Bit Key Implemented For Secure Communication

-The main aim of this paper is to provide stronger security for communication over the Internet by enhancing the strength of the AES algorithm. Rijndael’s algorithm was selected as the Advanced Encryption Standard. The AES algorithm was believed to provide much more security without any limitations. But, recently some breaking methods on the AES have been found by cryptanalysts. In AES algorithm, the number of rounds involved in the encryption and decryption depends on the length of the key and the number of block columns. So, the number of rounds is increased to improve the strength of the AES. The strength of the AES algorithm is enhanced by increasing the key length to 512 bit and thereby the number of rounds is increased in order to provide a stronger encryption method for secure communication. Code optimization is done in order to improve the speed of encryption and decryption using the 512 bit AES.
Higher classification of New World parrots (Psittaciformes; Arinae), with diagnoses of tribes.

We offer here a diagnosed higher-level classification of New World parrots to reflect relationships inferred from a consensus of recent DNA-based phylogenies and morphological and behavioral studies. General understanding of the position of New World parrots among the Psittaciformes through the later 20 th century stems from Smith’s (1975) exhaustive review of structural morphology and behavior, which supplanted previous hypotheses ( e.g. Verheyen 1956; Boetticher 1959; Brereton 1963; Wolters 1975). In his study, which covered over 54 genera, including 20 of the roughly 31 from the New World (Collar 1997; Dickinson 2003), Smith (1975) concluded that the New World parrots were monophyletic. Moreover, he considered the New World parrots sufficiently divergent from other parrots to be accorded subfamily rank because they share several unique morphological and behavioral characters, including imperforate neonatal ear canals, double-sided “dyck texture” (Dyck 1971) pigmentation of remiges, lack of cutaneous pigmentation, and one-legged copulatory stance.
Decentralized Task Allocation for Dynamic Environments

This thesis presents an overview of the design process for creating greedy decentralized task allocation algorithms and outlines the main decisions that progressed the algorithm through three different forms. The first form was called the Sequential Greedy Algorithm (SGA). This algorithm, although fast, relied on a large number of iterations to converge, which slowed convergence in decentralized environments. The second form was called the Consensus Based Bundle Algorithm (CBBA). CBBA required significantly fewer iterations than SGA but it is noted that both still rely on global synchronization mechanisms. These synchronization mechanisms end up being difficult to enforce in decentralized environments. The main result of this thesis is the creation of the Asynchronous Consensus Based Bundle Algorithm (ACBBA). ACBBA broke the global synchronous assumptions of CBBA and SGA to allow each agent more autonomy and thus provided more robustness to the task allocation solutions in these decentralized environments. Thesis Supervisor: Jonathan P. How Title: Richard C. Maclaurin Professor of Aeronautics and Astronautics