Miracle-dz/UniFAR-FTUs huggingface dataset:
Collaborative Decoding: Partial Hypothesis Re-ranking Using Translation Consensus between Decoders

This paper presents collaborative decoding (co-decoding), a new method to improve machine translation accuracy by leveraging translation consensus between multiple machine translation decoders. Different from system combination and MBR decoding, which post-process the n-best lists or word lattice of machine translation decoders, in our method multiple machine translation decoders collaborate by exchanging partial translation results. Using an iterative decoding approach, n-gram agreement statistics between translations of multiple decoders are employed to re-rank both full and partial hypothesis explored in decoding. Experimental results on data sets for NIST Chinese-to-English machine translation task show that the co-decoding method can bring significant improvements to all baseline decoders, and the outputs from co-decoding can be used to further improve the result of system combination.
Dependence on Visual Feedback During Motor Skill Learning in Alzheimer's Disease

Three experiments examined the role of visual feedback on the performance of a fine motor task, namely the rotary pursuit, in patients with Alzheimer's disease (AD) and healthy older adults. After extensive practice tracking a fully visible target, participants in Experiments 1 and 2 were tested under restricted vision (RV) conditions. In both experiments, the two groups showed a drop in performance when vision was restricted, with AD patients showing a significantly larger decline. Tracking improved significantly in normal controls, but not AD patients across the RV trials after the initial drop. When difficulty of the rotary pursuit task was manipulated in Experiment 3 without restricting vision, AD patients and normal controls showed identical patterns of performance. Consequently, it could be concluded that AD patients in the first two experiments were relying more heavily on visual information for accurate performance of the tracking task than their healthy peers.
Affixes and function words in the written language of deaf children

ABSTRACT The goal of this article is to investigate whether the acquisition of some morpho-syntactic aspects in Italian deaf adolescents is simply delayed with respect to hearing children, or whether it follows significantly different developmental patterns. Twenty-five deaf students (age range: 11–15 years) and a group of 125 hearing controls (age range: 6–16 years) performed four tests, administered in written form, relative to different grammatical aspects: plurals, articles, and clitic pronouns. Results showed three different patterns of development depending on the grammatical aspect considered. Deaf children compared to hearing controls showed normal development in the pluralization task, delayed development in the pronoun task, and a qualitatively different pattern in the article task.
Serious Leisure and Recreation Specialization

Most previous research concerning serious leisure has focused on testing the nature of activities using six distinctive qualities proposed by Robert Stebbins. Viewed from a different perspective, our study treats serious leisure as a type of personal characteristic. We tested the causal relationships between serious leisure and recreation specialization. This paper describes how serious leisure has a positive relationship with recreation specialization. Having a career in a recreational endeavor, making significant personal efforts and identifying strongly with the activity are the major predictors of recreation specialization. All of the qualities of serious leisure that were evaluated with the exception of the unique ethos were found to be positively related to past experience and centrality-to-lifestyle.
Collaborative problem-solving with distributed information: The role of inferences from interdependent information

This article studies inferences from distributed, interdependent information in group problem-solving. Three inference types (collaborative, individual, and shared) are distinguished, based on information sharing and distribution, with a special focus on collaborative inferences that generate new information no individual group member could have inferred. In an experiment, n= 27 dyads solved a specifically designed inference task. Inferences from shared information were the most likely, individual inferences from unshared information less likely, and collaborative inferences from unshared, distributed information the least likely to be drawn. An analysis of inference patterns in dyads’ discussions points towards the individual- and group-level processes involved in drawing collaborative inferences, and explains why first support measures explored in this study were not optimally designed.
A new approach to video steganography using pixel pattern matching and key segmentation

Hiding data or information by embedding in a redundant medium like text, audio or video is called as steganography. In ancient time, different techniques such invisible ink, wax tablets, Morse code, etc. were used to send secret information from one place to another. Now in the epoch of digitalization, even the medium for steganography has evolved from paper, wood, etc. to multimedia. Video Steganography is a secure method to embed information in the video frame, but the main drawback of this system is that storing a significant amount of data introduces distortion in the pixels of the frame gets altered which increases the suspicion about the secret data present in it. Traditional techniques used Advance Encryption Standard to encrypt and Least Significant Bit to embed information in the image by modifying the least significant bit of the pixel. However, this introduces distortion in the image which can be recognised by the intruder. Least Significant Bit is not preferred if a substantial quantity of data is to be embedded. In the proposed system, the data is encrypted using Advance Encryption Standard and divided using arithmetic division method. In this approach, the data will be stored in the form of divisor, quotient & remainder. The location key is also distributed, encrypted and stored in different frames. Along with this pixel, pattern matching is also used to avoid distortion of the video frame. This system will be difficult to crack since the location key is divided as well as encrypted and stored in different video frames along with this the secret message is stored in the form of a quotient, a divisor and a remainder. Even if the system is attacked the chance of the intruder to predict the pattern will be difficult as the secret data is embedded with dual protection.
Beyond the Orphanages: Art Therapy with Russian Children

This paper describes the evolution of the art therapy process at a United States' 6-week day camp for Russian children from orphanages. The practical implementation of the art therapy evolved—as did the camp design—as the children's needs emerged. Art therapy helped address anxiety-provoking issues that the children faced, such as immersion in American culture and adjusting to the adoption process, as well as serving as a tool to meet their individual mental health needs. This paper explores cross-cultural issues and the attachment disorder and PTSD symptoms that emerged, and demonstrates the importance of art as a healing agent.
EXE: A system for automatically generating inputs of death using symbolic execution

Systems code defines an error-prone execution state space built from deeply nested conditionals and function call chains, massive amounts of code, and enthusiastic use of casting and pointer operations. Such code is hard to test and difficult to inspect, yet a single error can crash a machine or form the basis of a security breach. This paper presents EXE, a system designed to automatically find bugs in such code using symbolic execution. At a high level, rather than running the code on manually-constructed concrete input, EXE instead runs it on symbolic input that is initially allowed to be “anything. ” As input (and derived) values are observed through conditional statements and other checks, symbolic constraints are incrementally added to those values. EXE then generates concrete test cases by solving these symbolic constraints for concrete values with bit-level precision. EXE has several novel features. First, it implements a complete, precise symbolic pointer theory that correctly handles both pointer arithmetic expressions and reads and writes to memory locations referenced by pointers with symbolic values. Second, it handles all of the C language with bit-level precision. Third, EXE greatly amplifies the effect of running a single code path since it uses a powerful constraint solver to reason about all possible values that the path could be run with, rather than a single set of concrete values from an individual test case. EXE has been successfully applied to applications ranging from running the Linux kernel symbolically in order to find numerous security holes in the ext2, ext3, and JFS file systems [26] to detecting invalid memory reads and writes in a DHCPD server implementation to finding buffer overflow attacks in the BSD and Linux packet filter implementations.
Type Systems For Polynomial-time Computation

This thesis introduces and studies a typed lambda calculus with higher-order primitive recursion over inductive datatypes which has the property that all definable number-theoretic functions are polynomial time computable. This is achieved by imposing type-theoretic restrictions on the way results of recursive calls can be used. The main technical result is the proof of the characteristic property of this system. It proceeds by exhibiting a category-theoretic model in which all morphisms are polynomial time computable by construction. The second more subtle goal of the thesis is to illustrate the usefulness of this semantic technique as a means for guiding the development of syntactic systems, in particular typed lambda calculi, and to study their meta-theoretic properties. Minor results are a type checking algorithm for the developed typed lambda calculus and the construction of combinatory algebras consisting of polynomial time algorithms in the style of the first Kleene algebra.
An empirical study of datapath, memory hierarchy, and network in SIMD array architectures

Although SIMD arrays have been built for 30 years, they have as a class been the subject of few empirical design studies. Using ENPASSANT, a simulation environment developed for that purpose, we analyze several aspects of SIMD array architecture with respect to a test suite of spatially mapped applications. Several surprising results are obtained. With respect to memory hierarchy, we find that adding a level of cache to current PE designs is likely to be advantageous, but that such a cache will look quite different than expected. In particular, we find that associativity has unusual significance and that performance varies inversely with block size. Router network results indicate the importance of support for local transfers, broadcast, and reduction even at the expense of arbitrary permutations. Other communication results point to the appropriate dimensionality of k-ary n-cube networks (2 or 3), and the criticality of supporting bidirectional transfers, even if the overall bandwidth remains unchanged.
TATES: Efficient Multivariate Genotype-Phenotype Analysis for Genome-Wide Association Studies

To date, the genome-wide association study (GWAS) is the primary tool to identify genetic variants that cause phenotypic variation. As GWAS analyses are generally univariate in nature, multivariate phenotypic information is usually reduced to a single composite score. This practice often results in loss of statistical power to detect causal variants. Multivariate genotype–phenotype methods do exist but attain maximal power only in special circumstances. Here, we present a new multivariate method that we refer to as TATES (Trait-based Association Test that uses Extended Simes procedure), inspired by the GATES procedure proposed by Li et al (2011). For each component of a multivariate trait, TATES combines p-values obtained in standard univariate GWAS to acquire one trait-based p-value, while correcting for correlations between components. Extensive simulations, probing a wide variety of genotype–phenotype models, show that TATES's false positive rate is correct, and that TATES's statistical power to detect causal variants explaining 0.5% of the variance can be 2.5–9 times higher than the power of univariate tests based on composite scores and 1.5–2 times higher than the power of the standard MANOVA. Unlike other multivariate methods, TATES detects both genetic variants that are common to multiple phenotypes and genetic variants that are specific to a single phenotype, i.e. TATES provides a more complete view of the genetic architecture of complex traits. As the actual causal genotype–phenotype model is usually unknown and probably phenotypically and genetically complex, TATES, available as an open source program, constitutes a powerful new multivariate strategy that allows researchers to identify novel causal variants, while the complexity of traits is no longer a limiting factor.
Solving and Certifying the Solution of a Linear System

Using floating-point arithmetic to solve a linear system yields a computed result, which is an approximation of the exact solution because of roundoff errors. In this paper, we present an approach to certify the computed solution. Here, "certify" means computing a guaranteed enclosure of the error. Our method is an iterative refinement method and thus it also improves the computed result. The method we present is inspired from the verifylss function of the IntLab library, with a first step, using floating-point arithmetic, to solve the linear system, followed by interval computations to get and refine an enclosure of the error. The specificity of our method is to relax the requirement of tightness of the error, in order to gain in performance. Indeed, only the order of magnitude of the error is needed. Experiments show a gain in accuracy and in performance, for various condition number of the matrix of the linear system.
Modelling galactic conformity with the colour–halo age relation in the Illustris simulation

Comparisons between observational surveys and galaxy formation models find that dark matter haloes’ mass can largely explain their galaxies’ stellar mass. However, it remains uncertain whether additional environmental variables, known as assembly bias, are necessary to explain other galaxy properties. We use the Illustris simulation to investigate the role of assembly bias in producing galactic conformity by considering 18 000 galaxies with M_(stellar) > 2 × 10^9 M_⊙. We find a significant signal of galactic conformity: out to distances of about 10 Mpc, the mean red fraction of galaxies around redder galaxies is higher than around bluer galaxies at fixed stellar mass. Dark matter haloes exhibit an analogous conformity signal, in which the fraction of haloes formed at earlier times (old haloes) is higher around old haloes than around younger ones at fixed halo mass. A plausible interpretation of galactic conformity is the combination of the halo conformity signal with the galaxy colour–halo age relation: at fixed stellar mass, particularly towards the low-mass end, Illustris’ galaxy colours correlate with halo age, with the reddest galaxies (often satellites) preferentially found in the oldest haloes. We explain the galactic conformity effect with a simple semi-empirical model, assigning stellar mass via halo mass (abundance matching) and galaxy colour via halo age (age matching). Regarding comparison to observations, we conclude that the adopted selection/isolation criteria, projection effects, and stacking techniques can have a significant impact on the measured amplitude of the conformity signal.
A WDM ring MAN architecture with traffic distribution and collisions avoidance for bandwidth utilization enhancement

In this paper we study a wavelength division multiplexing multi-ring metropolitan area network architecture with a separate control wavelength and a finite number of access nodes. Each access node is equipped with a fixed tuned transmitter and a fixed tuned receiver for control information exchange. Also, each access node has a tunable transmitter to exploit all data wavelengths while it uses a set of parallel tunable receivers providing suitable tuning time and range to cover all data wavelengths. Our study focuses on the critical problem that many access ring protocols introduce, of limited fiber bandwidth utilization especially at high offered loads. Thus, an efficient slotted access algorithm is applied to avoid data channel collisions and destination conflicts. Also, a multiple transmission buffer architecture is introduced at each node with an effective buffer selection for transmission scheme that combines the priority criteria of receiver collisions avoidance with data packet delay optimization. In this way, significant performance improvement is managed reducing the dropping probability and the total delay experienced, while maximizing throughput. Thus, our network strategy not only manages high scalability and maintenance, but also it achieves maximum bandwidth utilization. A discrete event simulation model is developed to evaluate performance measures.
The Healing is in the Pain

Five Māori women from one tribal community in Aotearoa/New Zealand narrated their stories of multi-generational legacies of historical trauma. Although psychological/spiritual trauma effects remain for these women, consciousness of trauma in these narratives was seen in a positive light as opportunities for healing. Three connected trauma acts were narrated. The process of narrating trauma histories in this study was ultimately construed as an exercise in self-determination through the re-empowerment of their voices and visions. The trauma and pain of their histories has not departed. However, the power of telling their stories creates access to healing through the achievement of consciousness of the impacts of history on shaping current realities, testimony about the resilience of previous generations and knowledge of the strategies previous generations employed to survive the brutalising effects of colonisation. The potential for healing through reclaiming new and more hopeful narratives was identified as a powerful tool to finally lay the pain of the past to rest. The healing value and potential of revisiting, re-examining and re-envisioning trauma histories under colonisation is being woven into the landscape of historical trauma theory-development, itself a healing endeavour. This study was part of a larger study on the relationship between healing from historical trauma, tribal self-determination and suicide prevention in one hapū/sub-tribe. This article focuses on the process of narrating historical trauma as a starting point for healing.
Optimal control of a two control input buck-boost converter

The converter system under consideration is a two-input one-output non-inverting buck-boost converter. The two control inputs introduce a degree of freedom that may be used to optimize dynamic performance and other objectives such as energy efficiency at steady state. Dynamic performance during transient is achieved using an MPC scheme, which drives the system at steady state toward its energy efficiency optimum using a precomputed target reference. The problem is complicated as state and input are combined bilinearly. Different control models and MPC problem formulations are considered to tackle the problem and performance is compared in simulations.
A method to predict the Raman gain spectra of germanosilicate fibers with arbitrary index profiles

In this letter, we present a technique for calculating the Raman gain spectra of germanosilicate fibers from their index profiles. The gain spectra depend on radial profiles of the guided optical modes and the glass composition, in particular the distribution of Si-O-Si and Ge-O-Si bridging bonds. We have obtained spectral coefficients, which represent the contributions from these bonds using Raman gain measurements made on a set of calibration fibers with well-characterized index profiles. We describe how these spectral coefficients can be used in the design of Raman gain fibers, and we demonstrate the accuracy of our technique over a broad range of fiber types.
Model Predictive Control of the Exit Part Temperature for an Austenitization Furnace

Quench hardening is the process of strengthening and hardening ferrous metals and alloys by heating the material to a specific temperature to form austenite (austenitization), followed by rapid cooling (quenching) in water, brine or oil to introduce a hardened phase called martensite. The material is then often tempered to increase toughness, as it may decrease from the quench hardening process. The austenitization process is highly energy-intensive and many of the industrial austenitization furnaces were built and equipped prior to the advent of advanced control strategies and thus use large, sub-optimal amounts of energy. The model computes the energy usage of the furnace and the part temperature profile as a function of time and position within the furnace under temperature feedback control. In this paper, the aforementioned model is used to simulate the furnace for a batch of forty parts under heuristic temperature set points suggested by the operators of the plant. A model predictive control (MPC) system is then developed and deployed to control the the part temperature at the furnace exit thereby preventing the parts from overheating. An energy efficiency gain of 5.3 % was obtained under model predictive control compared to operation under heuristic temperature set points tracked by a regulatory control layer.
Comparison of Elementary Students' History Textbooks and Trade Books

Abstract Historical novels and informational trade books for children are attractive alternatives to textbooks as materials for teaching history. In this study, text structure analyses of history textbooks and trade books provided a basis for comparing the comprehensibility of the two kinds of materials. Fifteen passages from four fifth-grade history textbooks and from three historical trade books (two narrative and one informational) were parsed into T-nnits, and predicates were identified as causal, response, alternative, sequence, description, evaluation, evidence, explanation, or adversative. Relations among ideas were shown in tree diagrams. The analyses allowed comparisons of textbooks and trade books in terms of sentence length, sentence complexity, degree and nature of subordination, macro-level use of organizing predicates, and micro-level coherence. Trade book passages contained longer, more complex sentences, achieved deeper elaboration of a smaller subset of topics, and more often used macro-l.