Miracle-dz/UniFAR-FTUs huggingface dataset:
MITSUBISHI ELECTRIC RESEARCH LABORATORIES CAMBRIDGE RESEARCH CENTER Deterministic Part-Of-Speech Tagging with Finite State Transducers

Stochastic approaches to natural language processing have often been preferred to rule-based approaches because of their robustness and their automatic training capabilities. This was the case for part-of-speech tagging until Brill showed how state-of-the-art part-of-speech tagging can be achieved with a rule-based tagger by inferring rules from a training corpus. However, current implementations of the rule-based tagger run more slowly than previous approaches. In this paper, we present a nite-state tagger inspired by the rule-based tagger which operates in optimal time in the sense that the time to assign tags to a sentence corresponds to the time required to follow a single path in a deterministic nite-state machine. This result is achieved by encoding the application of the rules found in the tagger as a non-deterministic nite-state transducer and then turning it into a deterministic transducer. The resulting deterministic transducer yields a part-of-speech tagger whose speed is dominated by the access time of mass storage devices. We then generalize the techniques to the class of transformation-based systems. Published in Computational Linguistics, June 1995 21(2), 227-253. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonpro t educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories of Cambridge, Massachusetts; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories. All rights reserved. Copyright c Mitsubishi Electric Research Laboratories, 1995 201 Broadway, Cambridge, Massachusetts 02139 Revisions history. 1. Version 1.0, May 2nd 1994. 2. Version 1.1, June 16th 1994. 3. Version 1.2, June 22nd 1994. 4. Version 1.3, July 27th 1994. 5. Version 1.4, July 1994. 6. Version 2.0, December 9th 1994. 7. This version is Revision 3.0 of Date: 95/03 .
Simplicial models of social aggregation I

This paper presents the foundational ideas for a new way of modeling social aggregation. Traditional approaches have been using network theory, and the theory of random networks. Under that paradigm, every social agent is represented by a node, and every social interaction is represented by a segment connecting two nodes. Early work in family interactions, as well as more recent work in the study of terrorist organizations, shows that network modeling may be insufficient to describe the complexity of human social structures. Specifically, network theory does not seem to have enough flexibility to represent higher order aggregations, where several agents interact as a group, rather than as a collection of pairs. The model we present here uses a well established mathematical theory, the theory of simplicial complexes, to address this complex issue prevalent in interpersonal and intergroup communication. The theory enables us to provide a richer graphical representation of social interactions, and to determine quantitative mechanisms to describe the robustness of a social structure. We also propose a methodology to create random simplicial complexes, with the purpose of providing a new method to simulate computationally the creation and disgregation of social structures. Finally, we propose several measures which could be taken and observed in order to describe and study an actual social aggregation occurring in interpersonal and intergroup contexts.
Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best Translation Lexicons

This paper shows how to induce an N-best translation lexicon from a bilingual text corpus using statistical properties of the corpus together with four external knowledge sources. The knowledge sources are cast as filters, so that any subset of them can be cascaded in a uniform framework. A new objective evaluation measure is used to compare the quality of lexicons induced with different filter cascades. The best filter cascades improve lexicon quality by up to 137% over the plain vanilla statistical method, and approach human performance. Drastically reducing the size of the training corpus has a much smaller impact on lexicon quality when these knowledge sources are used. This makes it practical to train on small hand-built corpora for language pairs where large bilingual corpora are unavailable. Moreover, three of the four filters prove useful even when used with large training corpora.
Fast Monte-Carlo low rank approximations for matrices

In many applications, it is of interest to approximate data, given by mtimesn matrix A, by a matrix B of at most rank k, which is much smaller than m and n. The best approximation is given by singular value decomposition, which is too time consuming for very large m and n. We present here a Monte Carlo algorithm for iteratively computing a k-rank approximation to the data consisting of mtimesn matrix A. Each iteration involves the reading of O(k) of columns or rows of A. The complexity of our algorithm is O(kmn). Our algorithm, distinguished from other known algorithms, guarantees that each iteration is a better k-rank approximation than the previous iteration. We believe that this algorithm will have many applications in data mining, data storage and data analysis
On the Complexity of Processing Massive, Unordered, Distributed Data

An existing approach for dealing with massive data sets is to stream over the input in few passes and perform computations with sublinear resources. This method does not work for truly massive data where even making a single pass over the data with a processor is prohibitive. Successful log processing systems in practice such as Google's MapReduce and Apache's Hadoop use multiple machines. They efficiently perform a certain class of highly distributable computations defined by local computations that can be applied in any order to the input. Motivated by the success of these systems, we introduce a simple algorithmic model for massive, unordered, distributed (mud) computation. We initiate the study of understanding its computational complexity. Our main result is a positive one: any unordered function that can be computed by a streaming algorithm can also be computed with a mud algorithm, with comparable space and communication complexity. We extend this result to some useful classes of approximate and randomized streaming algorithms. We also give negative results, using communication complexity arguments to prove that extensions to private randomness, promise problems and indeterminate functions are impossible. We believe that the line of research we introduce in this paper has the potential for tremendous impact. The distributed systems that motivate our work successfully process data at an unprecedented scale, distributed over hundreds or even thousands of machines, and perform hundreds of such analyses each day. The mud model (and its generalizations) inspire a set of complexity-theoretic questions that lie at their heart.
Public-Key Encryption Resilient against Linear Related-Key Attacks Revisited

Wee (PKC'12) proposed a generic public-key encryption scheme in the setting of related-key attacks. Bellare, Paterson and Thomson (Asiacrypt'12) provided a framework enabling related-key attack (RKA) secure cryptographic primitives for a class of non-linear related-key derivation functions. However, in both of their constructions, the instantiations to achieve the full (not weak) RKA security are given under the scenario regarding the private key composed of single element. In other words, each element of the private key shares the same modification. However, this is impractical in real world. In this paper, we concentrate on the security of public-key encryption schemes under linear related-key attacks in the setting of multielement private keys (that is, the private key is composed of more than one element), where an adversary is allowed to tamper any part of this private key stored in a hardware device, and subsequently observes the outcome of a public key encryption system under this targeted modified private key. We define the security model for RKA secure public-key encryption schemes as chosen-cipher text and related-key attack (CC-RKA) security, which means that a public-key encryption scheme remains secure even when an adversary is allowed to issue the decryption oracle on linear shifts of any component of the private key. After that, we present a detailed public key encryption schemes with the private key formed of several elements, of which the CC-RKA security is under the decisional BDH assumption in the standard model.
Self-stabilizing population of mobile agents

We investigate a problem of maintaining a target population of mobile agents in a distributed system. The purpose of the agents is to perform certain activities, so the goal is to avoid overpopulation (leading to waste of resources) as well as underpopulation (resulting in a poor service). We assume that there must be no centralized control over the number of agents, since it might result in system's vulnerability. We analyze a simple protocol in which each node keeps at most one copy of an agent and if there is a single agent in a node, a new agent is born with a certain probability p. At each time step the agents migrate independently at random to chosen locations. We show that during a protocol execution the number of agents stabilizes around a level depending on p. We derive analytically simple formulas that determine probability p based on the target fraction of nodes holding an agent. The previous proposals of this type were based on experimental data only.
Fe(III) bioreduction kinetics in anaerobic batch and continuous stirred tank reactors with acidophilic bacteria relevant for bioleaching of limonitic laterites

In the framework of the H2020 project CROCODILE, the recovery of Co from oxidized ores by reductive bioleaching has been studied. The objective was to reduce Fe(III) to Fe(II) to enhance the dissolution of Co from New-Caledonian limonitic laterites, mainly composed of goethite and Mn oxides. This study focused on the Fe(III) bioreduction which is a relevant reaction of this process. In the first step, biomass growth was sustained by aerobic bio-oxidation of elemental sulfur. In the second step, the biomass anaerobically reduced Fe(III) to Fe(II). The last step, which is not in the scope of this study, was the reduction of limonites and the dissolution of metals. This study aimed at assessing the Fe(III) bioreduction rate at 35°C with a microbial consortium composed predominantly of Sulfobacillus (Sb.) species as the iron reducers and Acidithiobacillus (At.) caldus. It evaluated the influence of the biomass concentration on the Fe(III) bioreduction rate and yield, both in batch and continuous mode. The influence of the composition of the growth medium on the bioreduction rate was assessed in continuous mode. A mean Fe(III) bioreduction rate of 1.7 mg·L−1·h−1 was measured in batch mode, i.e., 13 times faster than the abiotic control (0.13 mg·L−1·h−1). An increase in biomass concentrations in the liquid phase from 4 × 108 cells·mL−1 to 3 × 109 cells·mL−1 resulted in an increase of the mean Fe(III) bioreduction rate from 1.7 to 10 mg·L−1·h−1. A test in continuous stirred tank reactors at 35°C resulted in further optimization of the Fe(III) bioreduction rate which reached 20 mg·L−1·h−1. A large excess of nutrients enables to obtain higher kinetics. The determination of this kinetics is essential for the design of a reductive bioleaching process.
Parity Forwarding for Multiple-Relay Networks

This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it. Hence, each relay may have several choices as to which messages to decode, and for a given network many different parity forwarding protocols may exist. A tree structure is devised to characterize a class of parity forwarding protocols for an arbitrary multirelay network. Based on this tree structure, closed-form expressions for the achievable rates of these DF schemes are derived. It is shown that parity forwarding is capacity achieving for new forms of degraded relay networks.
Characterizing practices and the sanitary status of farms of Creole and Creole-like pigs in Martinique

L’étude a eu pour objectif de caractériser la gestion de 27 élevages de porcs dans le cadre d’un programme de conservation du porc Créole de la Martinique. Des échantillons sanguins ont été prélevés sur 67 porcs pour des analyses sérologiques. Une analyse multivariée a distingué six groupes d’élevage : le groupe 1 (n = 9) correspondait aux élevages familiaux comptant moins de trois verrats et présentant un âge de réforme des reproducteurs plus élevé que les autres élevages (6,2 vs 5,0 ans, p < 0,01) ; le groupe 2 (n = 5) était constitué de petits élevages avec deux saillies par truie par an et avec plus de deux espèces de bétail élevées ; le groupe 3 (n = 5) était composé d’élevages de plus de quatre verrats et de plus de quatre truies, avec une conduite en bande et une alimentation basée principalement sur du concentré industriel ; le groupe 4 (n = 4) correspondait à des élevages familiaux avec des porcs élevés en plein air et alimentés principalement avec des ressources locales (50 à 100 % de la ration) ; le groupe 5 (n = 3) était constitué d’agriculteurs en système polyculture-polyélevage avec plus de trois verrats et plus de dix truies ; et le groupe 6 se distinguait par un nombre important de femelles (n = 25) sans conduite en bande. L’analyse des données sérologiques a montré que la situation sanitaire de ces élevages porcins en Martinique était excellente, sans maladie contagieuse identifiée, en bâtiment comme en plein air ou semi-plein air. La typologie obtenue et les résultats sur le statut sanitaire des fermes sont des signes encourageants pour poursuivre le projet de conservation des porcs Créoles par des échanges de reproducteurs sains entre les éleveurs et par le développement d’un marché de niche autour des valeurs patrimoniales.
Position-Patch Based Face Hallucination Using Convex Optimization

We provide a position-patch based face hallucination method using convex optimization. Recently, a novel position-patch based face hallucination method has been proposed to save computational time and achieve high-quality hallucinated results. This method has employed least square estimation to obtain the optimal weights for face hallucination. However, the least square estimation approach can provide biased solutions when the number of the training position-patches is much larger than the dimension of the patch. To overcome this problem, this letter proposes a new position-patch based face hallucination method which is based on convex optimization. Experimental results demonstrate that our method is very effective in producing high-quality hallucinated face images.
Local Coherence Analysis in a Multi-Level Approach to Automatic Text Analysis

We characterize a text-technological approach to text analysis as combination of a multi-level representation framework and XML-based document processing techniques. The main advantages of such an approach are the chance to flexibly combine modules for constructing different applications, and the overall robustness resulting from the operational principle of higher-level modules combining the — possibly partial — results of lower-level ones. We illustrate the approach with the specific task of local coherence analysis, i.e. the computation of coherence relations between text spans.
Uncommon mutation, but common amplifications, of the PIK3CA gene in thyroid tumors.

CONTEXT As in many other human cancers, overactivation of the phosphotidylinositol 3-kinase (PI3K)/Akt signaling pathway occurs frequently in thyroid cancer, but the mechanism is not completely clear. OBJECTIVE Because activating mutations and genomic amplification of the PIK3CA gene, which encodes the p110a catalytic subunit of PI3K, are common in many cancers, we sought to investigate this phenomenon in thyroid tumors. DESIGN To search for PIK3CA mutations, we isolated genomic DNA from primary thyroid tumors of various types and performed direct sequencing of the exons of PIK3CA gene that carry the most common mutations in other cancers. We used real-time quantitative PCR to investigate genomic amplification of the PIK3CA gene. RESULTS We found no PIK3CA gene mutations in 37 benign thyroid adenomas, 52 papillary thyroid cancers, 25 follicular thyroid cancers, 13 anaplastic thyroid cancers, 13 medullary thyroid cancers, and seven thyroid tumor cell lines. We found a C3075T single-nucleotide polymorphism in exon 20 of this gene in two cases. With a copy number of 4 or more defined as amplification, we found PIK3CA gene amplification in four of 34 (12%) benign thyroid adenomas, three of 59 (5%) papillary thyroid cancer, five of 21 (24%) follicular thyroid cancer, none of 14 (0%) medullary thyroid cancer, and five of seven (71%) thyroid tumor cell lines. The PIK3CA gene amplification and consequent Akt activation were confirmed by fluorescence in situ hybridization and Western blotting studies using cell lines, respectively. CONCLUSION These data suggest that mutation of the PIK3CA gene is not common, but its amplification is relatively common and may be a novel mechanism in activating the PI3K/Akt pathway in some thyroid tumors.
The Effect of Age on Rule-Based Category Learning

ABSTRACT An explicit, rule-based, category-learning task with abstract visual stimuli was administered to 50 healthy older adults and 48 younger adults. Accuracy and reaction time (RT) were examined for the effects of age, perceptual abilities, rule memory, rule complexity, stimulus novelty, and response competition. Older adults performed at equivalent levels to younger adults when applying a simple rule, but showed performance decrements when applying a more complex rule. The age effect interacted with both stimulus novelty and response competition, and was not eliminated after controlling for basic perceptual abilities and rule memory. The authors suggest that older adults show category learning deficits in conditions that require enhanced cognitive control. These results are discussed in reference to the growing body of literature regarding age-related change in executive abilities and frontal lobe function.
Human Olfactory Ensheathing Cell Transplantation Improves Motor Function in a Mouse Model of Type 3 Spinocerebellar Ataxia

Spinocerebellar ataxia (SCA) is a progressive neurodegenerative disease that affects the cerebellum and spinal cord. Among the 40 types of SCA, SCA type 3 (SCA3), also referred to as Machado–Joseph disease, is the most common. In the present study, we investigated the therapeutic effects of intracranial transplantation of human olfactory ensheathing cells (hOECs) in the ATXN3-84Q mouse model of SCA3. Motor function begins to decline in ATXN3-84Q transgenic mice at approximately 13 weeks of age. ATXN3-84Q mice that received intracranial hOEC transplantation into the dorsal raphe nucleus of the brain exhibited significant improvements in motor function, as measured by the rotarod performance test and footprint pattern analysis. In addition, intracranial hOEC transplantation alleviated cerebellar inflammation, prohibited Purkinje cells from dying, and enhanced the neuroplasticity of cerebellar Purkinje cells. The protein levels of tryptophan hydroxylase 2, the rate-limiting enzyme for serotonin synthesis in the cerebellum, and ryanodine receptor (RYR) increased in mice that received intracranial hOEC transplantation. Because both serotonin and RYR can enhance Purkinje cell maturation, these effects may account for the therapeutic benefits mediated by intracranial hOEC transplantation in SCA3 mice. These results indicate that intracranial hOEC transplantation has potential value as a novel strategy for treating SCA3.
The strength of replacement in weak arithmetic

The replacement (or collection or choice,) axiom scheme BB(/spl Gamma/) asserts bounded quantifier exchange as follows: /spl forall/I < |a| /spl exist/x < ao(i, x) /spl rarr/ /spl exist/w /spl forall/i < |a| o (i, [w]/sub i/) where o is in the class /spl Gamma/ of formulas. The theory S/sub 2//sup 1/ proves the scheme BB(/spl Sigma//sub 1//sup b/), and thus in S/sub 2//sup 1/ every /spl Sigma//sub 1//sup b/ formula is equivalent to a strict /spl Sigma//sub 1//sup b/ formula (in which all non-sharply-bounded quantifiers are in front). Here we prove (sometimes subject to an assumption) that certain theories weaker than S/sub 2//sup 1/ do not prove either BB(/spl Sigma//sub 1//sup b/) or BB(/spl Sigma//sub 0//sup b/). We show (unconditionally) that V/sup 0/ does not prove BB(/spl Sigma//sub 1//sup B/), where V/sup 0/ (essentially I/spl Sigma//sub 0//sup 1,b/) is the two-sorted theory associated with the complexity class AC/sup 0/. We show that PV does not prove BB(/spl Sigma//sub 0//sup b/), assuming that integer factoring is not possible in probabilistic polynomial time. Johannsen and Pollet introduced the theory C/sub 2//sup 0/ associated with the complexity class TC/sup 0/, and later introduced an apparently weaker theory /spl Delta//sub 1//sup b/ - CR for the same class. We use our methods to show that /spl Delta//sub 1//sup b/ - CR is indeed weaker than C/sub 2//sup 0/, assuming that RSA is secure against probabilistic polynomial time attack. Our main tool is the KPT witnessing theorem.
The nature and role of cortical feedback in perception, imagery, and synesthesia

Abstract In his Discussion Paper, Seth makes the case for counterfactual richness of predictive processing models in explaining perceptual presence and its absence in synesthetic concurrent percepts. Here, we question the relevance of counterfactual richness for these and related phenomena, and we argue that alternative theories of perception that incorporate top-down/bottom-up facilitatory interactions are at no relative disadvantage in addressing them.
Metacognitive Therapy for Depression in Adults: A Waiting List Randomized Controlled Trial with Six Months Follow-Up

This randomized controlled trial examines the efficacy of metacognitive therapy (MCT) for depression. Thirty-nine patients with depression were randomly assigned to immediate MCT (10 sessions) or a 10-week wait list period (WL). The WL-group received 10 sessions of MCT after the waiting period. Two participants dropped out from WL and none dropped out of immediate MCT treatment. Participants receiving MCT improved significantly more than the WL group. Large controlled effect sizes were observed for both depressive (d = 2.51) and anxious symptoms (d = 1.92). Approximately 70–80% could be classified as recovered at post-treatment and 6 months follow-up following immediate MCT, whilst 5% of the WL patients recovered during the waiting period. The results suggest that MCT is a promising treatment for depression. Future controlled studies should compare MCT with other active treatments.