Miracle-dz/UniFAR-FTUs huggingface dataset:
Two precursors of machine translation : Artsrouni and Trojanskij

1. Introduction When machine translation (MT) began to become popular in the late 1950s and early 1960s, people started looking for historical antecedents. Some traced its origins back to the 17th century, with the ideas of Descartes, Leibniz and other philosophers and scholars about universal, philosophical and 'logical' languages. However, while 'logical' languages can be seen as prerequisites for digital computer programs and while 'universal' languages can be regarded as forerunners of auxiliary languages such as Esperanto, of universal classification systems such as those of libraries and biological taxonomies, and even of interlinguas in machine translation itself, these ideas should not be considered in any way as embryonic automatic translation systems. Although one of the most worked out proposals for a 'universal' interlingua, the work of a German chemist Johann Joachim Becher in 1661, was publicised in a 1962 reprint as a program for machine translation (Becher 1962), it was in fact no more than a Latin vocabulary with a numerical notation. In principle, after similar glossaries for other languages had been provided (which Becher did not do), it could be used for the 'mechanical' conversion of lexical items in one language into 'equivalent' lexical items in another language. Of course, Becher did not and could not, given the state of technology at the time, even suggest how a mechanism could be constructed to do such conversion. Of all the philiosphical languages, the most detailed was the 'real character' of John Wilkins, published shortly afterwards in 1668. It was the most detailed attempt to construct a rational 'universal' notation for common concepts (Wilkins 1668), and it was in effect a proposal for an interlingua or a universal classification of concepts. But it was not a proposal for a method of automatic translation. It was not until the 20th century that the first practical suggestions for mechanical dictionaries could be made. There were apparently some rather vague proposals by an Estonian in 1924 for a typewriter-dictionary (Mel'čuk and Ravič 1967: 26), but the proposals which can legitimately be regarded as forerunners of machine translation are the patents applied for simultaneously in 1933, in France and Russia. In both cases the patents were for electromechanical devices capable of being used as translation dictionaries. The patent in France submitted by Georges Artsrouni was for a general-purpose machine which could also function, with some additional equipment, as a mechanical multilingual dictionary. The patent in …
Involvement of Src tyrosine kinase and protein kinase C in the expression of macrophage migration inhibitory factor induced by H2O2 in HL-1 mouse cardiac muscle cells

Macrophage migration inhibitory factor (MIF), a pleiotropic cytokine, plays an important role in the pathogenesis of atrial fibrillation; however, the upstream regulation of MIF in atrial myocytes remains unclear. In the present study, we investigated whether and how MIF is regulated in response to the renin-angiotensin system and oxidative stress in atrium myocytes (HL-1 cells). MIF protein and mRNA levels in HL-1 cells were assayed using immunofluorescence, real-time PCR, and Western blot. The result indicated that MIF was expressed in the cytoplasm of HL-1 cells. Hydrogen peroxide (H2O2), but not angiotensin II, stimulated MIF expression in HL-1 cells. H2O2-induced MIF protein and gene levels increased in a dose-dependent manner and were completely abolished in the presence of catalase. H2O2-induced MIF production was completely inhibited by tyrosine kinase inhibitors genistein and PP1, as well as by protein kinase C (PKC) inhibitor GF109203X, suggesting that redox-sensitive MIF production is mediated through tyrosine kinase and PKC-dependent mechanisms in HL-1 cells. These results suggest that MIF is upregulated by HL-1 cells in response to redox stress, probably by the activation of Src and PKC.
Weak Ties in Networked Communities

Communities with high levels of social capital are likely to have a higher quality of life than communities with low social capital. This is due to the greater ability of such communities to organize and mobilize effectively for collective action because they have high levels of social trust, dense social networks, and well-established norms of mutuality (the major features of social capital). Communities with “bridging” social capital (weak ties across groups) as well as “bonding” social capital (strong ties within groups) are the most effective in organizing for collective action. People who belong to multiple groups act as bridging ties. When people with bridging ties use communication media, such as the Internet, they enhance their capability to educate community members and to organize, as needed, for collective action. This article summarizes evidence from stratified household survey data in Blacksburg, VA, showing that people with weak (bridging) ties across groups have higher levels of community involvement, civic interest, and collective efficacy than people without bridging ties among groups. Moreover, heavy Internet users with bridging ties have higher social engagement, use the Internet for social purposes, and have been attending more local meetings and events since going online than heavy Internet users with no bridging ties. These findings may suggest that the Internet—in the hands of bridging individuals–is a tool for enhancing social relations and information exchange, and for increasing face-to-face interaction, all of which help to build both bonding and bridging social capital in communities.
Trace-driven memory simulation: a survey

As the gap between processor and memory speeds continues to widen, methods for evaluating memory system designs before they are implemented in hardware are becoming increasingly important. One such method, trace-driven memory simulation, has been the subject of intense interest among researchers and has, as a result, enjoyed rapid development and substantial improvements during the past decade. This article surveys and analyzes these developments by establishing criteria for evaluating trace-driven methods, and then applies these criteria to describe, categorize, and compare over 50 trace-driven simulation tools. We discuss the strengths and weaknesses of different approaches and show that no single method is best when all criteria, including accuracy, speed, memory, flexibility, portability, expense, and ease of use are considered. In a concluding section, we examine fundamental limitations to trace-driven simulation, and survey some recent developments in memory simulation that may overcome these bottlenecks.
Remote attestation for low-end embedded devices: The prover's perspective

Security of embedded devices is a timely and important issue, due to the proliferation of these devices into numerous and diverse settings, as well as their growing popularity as attack targets, especially, via remote malware infestations. One important defense mechanism is remote attestation, whereby a trusted, and possibly remote, party (verifier) checks the internal state of an untrusted, and potentially compromised, device (prover). Despite much prior work, remote attestation remains a vibrant research topic. However, most attestation schemes naturally focus on the scenario where the verifier is trusted and the prover is not. The opposite setting - where the prover is benign, and the verifier is malicious - has been side-stepped. To this end, this paper considers the issue of prover security, including: verifier impersonation, denial-of-service (DoS) and replay attacks, all of which result in unauthorized invocation of attestation functionality on the prover. We argue that protection of the prover from these attacks must be treated as an important component of any remote attestation method. We formulate a new roaming adversary model for this scenario and present the trade-offs involved in countering this threat. We also identify new features and methods needed to protect the prover with minimal additional requirements.
New Implementation Scheme for the Restoration of Voiced Speech Signals

Recently iterative procedure for the restoration of speech signals when prosodic elements: stress and accent, of comparatively long duration are missing was developed. Alternatively, it could be cast in a signal generation framework. Basing on that view the paper presents the efficient implementation scheme for the restoration of voiced speech signals. It enjoys parallel order of multirate processing utilizing interpolation and decimation filters parameterized by specific to problem coefficients. Presented simulation results confirm the feasibility of developed implementation.
Language-Based Isolation of Untrusted JavaScript

Web sites that incorporate untrusted content may use browser- or language-based methods to keep such content from maliciously altering pages, stealing sensitive information, or causing other harm. We study language-based methods for filtering and rewriting JavaScript code, using Yahoo! ADSafe and Facebook FBJS as motivating examples. We explain the core problems by describing previously unknown vulnerabilities and subtleties, and develop a foundation for improved solutions based on an operational semantics of the full ECMA-262 language. We also discuss how to apply our analysis to address the JavaScript isolation problems we discovered.
A mutual assessment of the uncertainties of digital elevation models using the triple collocation technique

ABSTRACT This study investigates the uncertainties of digital elevation models (DEMs) using the triple collocation (TC) method. DEMs from satellite missions are important for many geoscience disciplines and for economic benefits and are freely available. Validating DEMs is necessary to select an appropriate model for a given region and application. Provided certain assumptions about the error structure of any three data sets – measuring the same phenomenon – can be made, the TC approach can be used to provide an unbiased and scaled estimate of the error variances of the data sets, without requiring a reference data. We compared the TC approach to the traditional approach of using a reference data set using the Shuttle Radar Topography Mission version 4.1 (SRTM v4.1) DEM, ASTER (the Advanced Spaceborne Thermal Emission and Reflection Radiometer) GDEM (Global DEM) version 2, the 1 arc-minute global relief model (ETOPO1), a DEM compiled by the Survey and Mapping Division of Ghana (SMD DEM), and 545 ground control stations (GCSs). The error estimates for the DEMs via TC were considerably smaller than those obtained from the reference-based approach. As an example, the best performing DEM (SRTM v4.1) recorded a root-mean-square error (RMSE) of 15.601 m using the GCSs as reference, while its TC-derived accuracy was 6.517 m. We note that based on the results of the TC, the estimated error of the GCSs is approximately 14 m. Using a data set with an error of 14 m to validate other data sets is certainly bound to result in unfavorable results. Thus, we have demonstrated in this work that the TC approach is able to provide an unbiased error of DEMs. The approach is important even for regions where GCSs are highly accurate, but more so for regions with low-quality GCSs.
Indemics: an interactive data intensive framework for high performance epidemic simulation

To respond to the serious threat of pandemics (e.g. 2009 H1N1 influenza) to human society, we developed Indemics (<u>In</u>teractive Epi<u>demic</u> <u>S</u>imulation), an interactive, data intensive, high performance modeling environment for realtime pandemic planning, situation assessment, and course of action analysis. Indemics was built upon a model of interactive data intensive scientific computation, supporting online interactions between users and simulations and enabling epidemic simulations over detailed social contact networks and realistic representations of complex public policies and intervention strategies. Instead of simply making a highly optimized parallel application run even faster, Indemics introduced several innovative ideas such as online interactive computation and HPC-DBMS integration that significantly improved the functionality, flexibility, modularity, and usability of HPC software. Our performance evaluation suggests that additional computational overhead incurred by Indemics compared to non-interactive simulations is easily offset by its new capabilities. Preliminary results show that Indemics significantly broadens the range of course of action scenarios that can be simulated and enables domain experts to analyze problems that were previously not possible to study.
DNS performance and the effectiveness of caching

This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced Institute of Science and Technology (KAIST). The first part of the analysis details how clients at these institutions interact with the wide-area DNS system, focusing on performance and prevalence of failures. The second part evaluates the effectiveness of DNS caching.In the most recent MIT trace, 23% of lookups receive no answer; these lookups account for more than half of all traced DNS packets since they are retransmitted multiple times. About 13% of all lookups result in an answer that indicates a failure. Many of these failures appear to be caused by missing inverse (IP-to-name) mappings or NS records that point to non-existent or inappropriate hosts. 27% of the queries sent to the root name servers result in such failures.The paper presents trace-driven simulations that explore the effect of varying TTLs and varying degrees of cache sharing on DNS cache hit rates. The results show that reducing the TTLs of address (A) records to as low as a few hundred seconds has little adverse effect on hit rates, and that little benefit is obtained from sharing a forwarding DNS cache among more than 10 or 20 clients. These results suggest that the performance of DNS is not as dependent on aggressive caching as is commonly believed, and that the widespread use of dynamic, low-TTL A-record bindings should not degrade DNS performance.
A predictive approach for enhancing resource utilization in PaaS clouds

Data centers have been criticized for being heavy consumers of energy, accounting for a significant share of the world's total energy use. This is compounded by the fact that a large portion of the computational resources in data centers remains idle most of the time, while nevertheless consuming a great amount of energy even in an idle state. One of the causes of resource idleness is the static resource allocation strategy of the widespread quota management systems in private clouds, which commonly do not keep track of the utilization rate of allocated resources, which are often idle. Better resource management strategies are therefore called for to improve the utilization rate of available capabilities and thereby minimize operational costs. We propose here a method for resource provisioning based on utilization-rate forecasting for clouds with data-processing PaaS environments. A clustering algorithm is used for estimating and dynamically scheduling the workload of batch applications. Based on current and historical records of resource utilization, the algorithm enables taking efficient scheduling decisions. Due to the non-proportionality of computing power consumption, we show that compared to static quota management systems for private clouds, average increases of 10+ in CPU and RAM utilization and 20+ in the number of processed jobs may be obtained without a significant reduction in the quality of service.
Inputs to combination-sensitive neurons in the medial geniculate body of the mustached bat: the missing fundamental

This study examined projections to combination-sensitive neurons in the medial geniculate body of the mustached bat. These specialized neurons respond to the combination of two temporally and spectrally distinct components of the bat's sonar pulse and echo, encoding target information. Combination-sensitive neurons respond to the bat's sonar fundamental, between 24–31 kHz, in conjunction with a higher harmonic signal. They are thought to be formed in the medial geniculate body (MGB) by convergent input from inferior colliculus representations of 24–31 kHz and higher frequencies. This study used anterograde and retrograde tract-tracing methods in conjunction with physiological recording to test this MGB convergence hypothesis. In anterograde tracing experiments, multiple deposits of two different tracers were placed in the central nucleus of the inferior colliculus (ICC), one tracer in the 24–31 kHz region and another in an ICC representation responding to a higher sonar harmonic. We found only limited overlap in the MGB labeling patterns of the two tracers, and little in many areas where combination-sensitive neurons are common. In retrograde tracing experiments, a single deposit of tracer was placed at a combination- sensitive recording site in the MGB. With the deposit mostly limited to combination-sensitive MGB areas, labeling in 24–31 kHz representations of the ICC was absent or minor. These results suggest that many combination-sensitive neurons in the MGB do not receive 24–31 kHz ICC input. The strongest inputs to combination-sensitive MGB regions originate in high-frequency representations of the ICC and combination- sensitive regions of auditory cortex. Additional projections arrive from the thalamic reticular nucleus, external nucleus of the inferior colliculus, and pericollicular tegmentum. Each projection may contribute to the 24–31 kHz sensitivity of combination-sensitive neurons in the medial geniculate body.
Modeling click-through based word-pairs for web search

Statistical translation models and latent semantic analysis (LSA) are two effective approaches to exploiting click-through data for Web search ranking. While the former learns semantic relationships between query terms and document terms directly, the latter maps a document and the queries for which it has been clicked to vectors in a lower dimensional semantic space. This paper presents two document ranking models that combine the strengths of both the approaches by explicitly modeling word-pairs. The first model, called PairModel, is a monolingual ranking model based on word-pairs derived from click-through data. It maps queries and documents into a concept space spanned by these word-pairs. The second model, called Bilingual Paired Topic Model (BPTM), uses bilingual word translations and can jointly model query-document collections written in multiple languages. This model uses topics to capture term dependencies and maps queries and documents in multiple languages into a lower dimensional semantic sub-space spanned by the topics. These models are evaluated on the Web search task using real world data sets in three different languages. Results show that they consistently outperform various state-of-the-art baseline models, and the best result is obtained by interpolating PairModel and BPTM.
Intentional Network Interference for Denial of Wireless Eavesdropping

Wireless secrecy is becoming crucial in many commercial and governmental sectors. In this paper, the secrecy capacity of a wireless channel is analyzed in the presence of intentional network interference for denial of eavesdropping capability (DEC). We propose two different DEC strategies employing the closest interferer and the multiple interferers. We show the impact of the network interference on average and outage of secrecy capacity for the two DEC strategies with and without eavesdropper's countermeasures to create a region of interference neutralization. This work provides essentials for understanding how to increase wireless secrecy using intentional network interference.
Invited commentary: insulin resistance syndrome? Syndrome X? Multiple metabolic syndrome? A syndrome at all? Factor analysis reveals patterns in the fabric of correlated metabolic risk factors.

Factor analysis has emerged as a useful method for understanding patterns underlying the co-occurrence of metabolic risk factors for both type 2 diabetes and atherosclerosis--often referred to as "insulin resistance syndrome. " In factor analysis of data on 322 healthy elderly people from the Cardiovascular Health Study, Sakkinen et al. (Am J Epidemiol 2000;152:897-907) confirmed findings from a dozen prior studies that as many as four distinct physiologic domains comprise the syndrome, with a unifying role for markers of insulin resistance. With the addition of markers of hemostasis and inflammation, they also found that impaired fibrinolysis and endothelial dysfunction are central features of the syndrome, while inflammation is only weakly linked to insulin resistance through associations with obesity.
Enhanced synthesis of choline and glycine betaine in transgenic tobacco plants that overexpress phosphoethanolamine N-methyltransferase

Choline (Cho) is the precursor of the osmoprotectant glycine betaine and is itself an essential nutrient for humans. Metabolic engineering of Cho biosynthesis in plants could therefore enhance both their resistance to osmotic stresses (drought and salinity) and their nutritional value. The key enzyme of the plant Cho-synthesis pathway is phosphoethanolamine N-methyltransferase, which catalyzes all three of the methylations required to convert phosphoethanolamine to phosphocholine. We show here that overexpressing this enzyme in transgenic tobacco increased the levels of phosphocholine by 5-fold and free Cho by 50-fold without affecting phosphatidylcholine content or growth. Moreover, the expanded Cho pool led to a 30-fold increase in synthesis of glycine betaine via an engineered glycine betaine pathway. Supplying the transgenics with the Cho precursor ethanolamine (EA) further enhanced Cho levels even though the supplied EA was extensively catabolized. These latter results establish that there is further scope for improving Cho synthesis by engineering an increased endogenous supply of EA and suggest that this could be achieved by enhancing EA synthesis and/or by suppressing its degradation.
High Genetic Diversity of Microbial Cellulase and Hemicellulase Genes in the Hindgut of Holotrichia parallela Larvae

In this study, we used a culture-independent method based on library construction and sequencing to analyze the genetic diversity of the cellulase and hemicellulase genes of the bacterial community resident in the hindgut of Holotrichia parallela larvae. The results indicate that there is a large, diverse set of bacterial genes encoding lignocellulose hydrolysis enzymes in the hindgut of H. parallela. The total of 101 distinct gene fragments (similarity <95%) of glycosyl hydrolase families including GH2 (24 genes), GH8 (27 genes), GH10 (19 genes), GH11 (14 genes) and GH36 (17 genes) families was retrieved, and certain sequences of GH2 (10.61%), GH8 (3.33%), and GH11 (18.42%) families had <60% identities with known sequences in GenBank, indicating their novelty. Based on phylogenetic analysis, sequences from hemicellulase families were related to enzymes from Bacteroidetes and Firmicutes. Fragments from cellulase family were most associated with the phylum of Proteobacteria. Furthermore, a full-length endo-xylanase gene was obtained, and the enzyme exhibited activity over a broad range of pH levels. Our results indicate that there are large number of cellulolytic and xylanolytic bacteria in the hindgut of H. parallela larvae, and these symbiotic bacteria play an important role in the degradation of roots and other organic matter for the host insect.