Miracle-dz/UniFAR-FTUs huggingface dataset:
Construction of a Chinese-English Verb Lexicon for Embedded Machine Translation in Cross-Language Information Retrieval

Abstract : This paper addresses the problem of automatic acquisition of lexical knowledge for rapid construction of MT engines for use in multilingual applications. We describe new techniques for large-scale construction of a Chinese-English verb lexicon and we evaluate the coverage and effectiveness of the resulting lexicon for a structured MT approach that is embedded in a cross-language information retrieval system. Leveraging off an existing Chinese conceptual database called HowNet and a large, semantically rich English verb database, we use thematic-role information to create links between Chinese concepts and English classes. We apply the metrics of recall and precision to evaluate the coverage and effectiveness of the linguistic resources. The results of this work indicate that: (1) we are able to obtain reliable Chinese-English entries both with and without pre-existing semantic links between the two languages; (2) if we have pre-existing semantic links, we are able to produce a more robust lexical resource by merging these with our semantically rich English database; (3) In our comparisons with manual lexicon creation, our automatic techniques were shown to achieve 62% precision, compared to a much lower precision of 10% for arbitrary assignment of semantic links.
Path Partitions, Cycle Covers and Integer Decomposition (Lecture Note)

Ap olyhedronP has the integer decomposition property ,i f every integer vector in kP is the sum of k integer vectors in P.W e ex- plain that the projections of polyhedra defined by totally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of particular stable sets in graphs. Therebye we prove a generalization of Greene and Kleit- man's well-known theorem on posets to arbitrary digraphs which implies recent and classical purely graph theoretical results on cycle covers, is closely related to conjectures of Berge and Linial on path partitions, and implies these for some particular values of the parameters.
Argumentation on social networks: the tweet - features and functioning

This paper aims to discuss the design of tweet and functioning argumentative this textual genre digital, particularized by written production of up to one hundred and forty characters and which circulates only in environment Twitter. In reason of not separating the discursive and textual realization of their specific context of production, it examines the worldwide network digital, the Internet, in its meaning of producing virtual environments in which circulating varied textual genres emerging digital credits. The studies on the functioning of the argumentation in digital environments, virtual given its short time of existence, constitute universe to be explored; in this sense, this paper aims to contribute to the knowledge of a specific design of argumentative orientation that if from linguistic elements and discursive mode, used for particular cohesive, go characterizing the genus tweet, to give it coherence.The corpus consists in tweets formulated by adolescents, the age group between 15-17 years, residents in the city of Sao Paulo, in which shall be examined the Argumentacao nas redes sociais: o tweet – caracterizacao e funcionamento Revista ContraPonto, Belo Horizonte, v. 3, n. 3, 2013. 91 argumentative strategies driven by their producers during the interaction. The researches of Levy (1996, 1999, 2003) and Crystal (2013) govern this work as the conceptions of the development of the Internet and digital interaction. We also seek the sociocognitiveinteractionist perspective of Linguistic Textual for grounding of the discussion about the materialization of linguistic textual genres digital, from Marcuschi (2002, 2010), Koch and Elias (2009). We chose what seemed to us theoretically, as regards the argument, in the work of Chaim Perelman and Olbrechts -Tyteca (2005 [1958]); Aquino (1997) and Amossy (2007).
On Approximation Properties of Pimsner Algebras and Crossed Products By Hilbert Bimodules

Let X be a Hilbert bimodule over a C*-algebra A and $O_X= A \rtimes_X \Z$. Using a finite section method we construct a sequence of completely positive contractions factoring through matrix algebras over A which act on $s_{\xi} s_{\eta}^*$ as Schur multipliers converging to the identity. This shows immediately that for a finitely generated X the algebra $O_X$ inherits any standard approximation property such as nuclearity, exactness, CBAP or OAP from A. We generalise this to certain general Pimsner algebras by proving semi-splitness of the Toeplitz extension under certain conditions and discuss some examples.
Naive-like Conversion Overcomes the Limited Differentiation Capacity of Induced Pluripotent Stem Cells*

Background: The quality of induced pluripotent stem (iPS) cells might be inherently worse than embryonic stem cells. Results: Although the differentiation capacity of iPS cells is limited, it can be enhanced. Conclusion: Improving their level of pluripotency alleviated the limited capacity of iPS cells. Significance: This report offers an effective strategy for the development of iPS cell-based research. Although induced pluripotent stem (iPS) cells are indistinguishable from ES cells in their expression of pluripotent markers, their differentiation into targeted cells is often limited. Here, we examined whether the limited capacity of iPS cells to differentiate into neural lineage cells could be mitigated by improving their base-line level of pluripotency, i.e. by converting them into the so-called “naive” state. In this study, we used rabbit iPS and ES cells because of the easy availability of both cell types and their typical primed state characters. Repeated passages of the iPS cells permitted their differentiation into early neural cell types (neural stem cells, neurons, and glial astrocytes) with efficiencies similar to ES cells. However, unlike ES cells, their ability to differentiate later into neural cells (oligodendrocytes) was severely compromised. In contrast, after these iPS cells had been converted to a naive-like state, they readily differentiated into mature oligodendrocytes developing characteristic ramified branches, which could not be attained even with ES cells. These results suggest that the naive-like conversion of iPS cells might endow them with a higher differentiation capacity.
Light Source Estimation with Analytical Path-tracing

We present a novel algorithm for light source estimation in scenes reconstructed with a RGB-D camera based on an analytically-derived formulation of path-tracing. Our algorithm traces the reconstructed scene with a custom path-tracer and computes the analytical derivatives of the light transport equation from principles in optics. These derivatives are then used to perform gradient descent, minimizing the photometric error between one or more captured reference images and renders of our current lighting estimation using an environment map parameterization for light sources. We show that our approach of modeling all light sources as points at infinity approximates lights located near the scene with surprising accuracy. Due to the analytical formulation of derivatives, optimization to the solution is considerably accelerated. We verify our algorithm using both real and synthetic data.
1 Separation of Voiced and Unvoiced using Zero crossing rate and Energy of the Speech Signal

In speech analysis, the voiced-unvoiced decision is usually performed in extracting the information from the speech signals. In this paper, we performed two methods to separate the voicedunvoiced parts of speech from a speech signal. These are zero crossing rate (ZCR) and energy. In here, we evaluated the results by dividing the speech sample into some segments and used the zero crossing rate and energy calculations to separate the voiced and unvoiced parts of speech. The results suggest that zero crossing rates are low for voiced part and high for unvoiced part where as the energy is high for voiced part and low for unvoiced part. Therefore, these methods are proved more effective in separation of voiced and unvoiced speech.
High-Precision Hysteresis Sensing of the Quartz Crystal Inductance-to-Frequency Converter

A new method for the automated measurement of the hysteresis of the temperature-compensated inductance-to-frequency converter with a single quartz crystal is proposed. The new idea behind this method is a converter with two programmable analog switches enabling the automated measurement of the converter hysteresis, as well as the temperature compensation of the quartz crystal and any other circuit element. Also used is the programmable timing control device that allows the selection of different oscillating frequencies. In the proposed programmable method two different inductances connected in series to the quartz crystal are switched in a short time sequence, compensating the crystal’s natural temperature characteristics (in the temperature range between 0 and 50 °C). The procedure allows for the measurement of the converter hysteresis at various values of capacitance connected in parallel with the quartz crystal for the converter sensitivity setting at selected inductance. It, furthermore, enables the measurement of hysteresis at various values of inductance at selected parallel capacitance (sensitivity) connected to the quartz crystal. The article shows that the proposed hysteresis measurement of the converter, which converts the inductance in the range between 95 and 100 μH to a frequency in the range between 1 and 200 kHz, has only 7 × 10−13 frequency instability (during the temperature change between 0 and 50 °C) with a maximum 1 × 10−11 hysteresis frequency difference.
UMA-based wireless and mobile video delivery architecture

In this paper we propose a conceptual model for describing the network conditions under which the multimedia data is being transmitted, as well as the modality of the device which receives the data. We present an architecture for adaptation of multimedia data to such wireless network conditions and device capabilities, under constraints imposed by user preferences and multimedia content, to ensure effective, meaningful, and acceptable delivery of video data to mobile users. The adaptability is achieved through careful application of a combination of off-line and on-line reductions to the video streams. In doing so, we make use of the concept of descriptor schemes for describing the content of video data, and its lendability to different kinds of reductions [1]. The architecture consists of an MPEG-7 server in the fixed network, and an MPEG-7 player on the mobile host. In addition, an encoder/decoder layer is used to perform physical frame bit reductions on transcoded video frames. The server also maintains index structures and a programmable two-dimensional matrix of reductions. An offline packager module is included with the server, which packages all the MPEG-7 data with the video when the video is first registered with the database.
Distribution fitting-based pixel labeling for histology image segmentation

This paper presents a new pixel labeling algorithm for complex histology image segmentation. For each image pixel, a Gaussian mixture model is applied to estimate its neighborhood intensity distributions. With this local distribution fitting, a set of pixels having a full set of source classes (e.g. nuclei, stroma, connective tissue, and background) in their neighborhoods are identified as the seeds for pixel labeling. A seed pixel is labeled by measuring its intensity distance to each of its neighborhood distributions, and the one with the shortest distance is selected to label the seed. For non-seed pixels, we propose two different labeling schemes: global voting and local clustering. In global voting each seed classifies a non-seed pixel into one of the seed's local distributions, i.e., it casts one vote; the final label for the non-seed pixel is the class which gets the most votes, across all the seeds. In local clustering, each non-seed pixel is labeled by one of its own neighborhood distributions. Because the local distributions in a non-seed pixel neighborhood do not necessarily correspond to distinct source classes (i.e., two or more local distributions may be produced by the same source class), we first identify the "true" source class of each local distribution by using the source classes of the seed pixels and a minimum distance criterion to determine the closest source class. The pixel can then be labeled as belonging to this class. With both labeling schemes, experiments on a set of uterine cervix histology images show encouraging performance of our algorithm when compared with traditional multithresholding and K-means clustering, as well as state-of-the-art mean shift clustering, multiphase active contours, and Markov random field-based algorithms.
Technique for Dissection and Measurement of Refractive Index of Osteones

I t is known that a continuous process takes place in bone whereby mature osteones (Haversian systems) are broken down and new osteones are formed. Historadiographic study has shown that the mineral salts content of osteones increases gradually toward a maximum (1, 2, 8). In order to obtain information on the chemical and physical properties of the growing osteone, we have developed a dissection technique for isolating single osteone units.
Comparison of Equivalence between Two Commercially Available S499-Phosphorylated FMRP Antibodies in Mice

Fragile X syndrome (FXS) develops from excessive trinucleotide CGG repeats in the 5’-untranslated region at Xq27.3 of the Fmr-1 gene, which functionally silences its expression and prevents transcription of its protein. This disorder is the most prominent form of heritable intellectual deficiency, affecting roughly 1 in 5,000 males and 1 in 10,000 females globally. Antibody specificity and selectivity are essential for investigating changes in intracellular protein signaling and phosphorylation status of the Fragile X Mental Retardation Protein (FMRP). Currently, both PhosphoSolutions® and abcam® produce commercially available S499-phosphorylated FMRP specific antibodies. The antibody from PhosphoSolutions® has been validated in previous studies; however, the antibody from abcam® antibody has yet to receive similar validation. This study aims to determine whether these two antibodies are true equivalents through western blot analysis of both NS-Pten knockout (KO) and Fmr-1 KO mice strains. We prepared hippocampal synaptosomal preparations and probed the samples using total FMRP, abcam® phosphorylated FMRP, and PhosphoSolutions® phosphorylated FMRP antibodies. We found that there was a significant increase in phosphorylated FMRP levels using the abcam® and PhosphoSolutions® antibodies in the NS-Pten KO mice compared to wildtype mice. However, there was much more variability using the abcam® antibody. Furthermore, there was a band present in the Fmr-1 KO for the phosphorylated FMRP site using the abcam® antibody for western blotting but not for the PhosphoSolutions® antibody. Our findings strongly suggest that the antibody from abcam® is neither specific nor selective for its advertised targeted substrate, S499-phosphorylated FMRP.
Adaptation in a channel access game with private monitoring

Under the opportunistic spectrum access paradigm, the shared pool of spectrum bands that the multiple autonomous cognitive radios (CRs) need to compete for is not necessarily homogeneous. The non-homogeneity in channels may lead to payoff distribution conflict among autonomous CRs, as each CR would prefer the outcome in which it selects the more desirable channels. To address this challenge, we have designed an adaptive strategy that (without explicit coordination) enables the CRs to autonomously reach an outcome that maximizes the total CR network throughput and minimizes the payoff distribution conflict among the CRs. We utilize the framework of repeated games with private monitoring to: 1) study the dynamic channel selection problem; 2) analyze the stability of the proposed strategy; and 3) investigate the impact of deviations by a selfish CR on the performance of the proposed strategy. In our model, multiple autonomous CRs are not able to observe the channel selections of other competing CRs. Rather, they get a signal from which the selections must be inferred.
CHARACTERIZATION OF A FULLY-INTEGRATED PERMANENT-MAGNET TURBINE GENERATOR

This paper presents the design, fabrication, and testing of a fully-integrated permanent-magnet turbine generator based on silicon MEMS fabrication technology. This is the first silicon turbine generator supported by gas thrust and journal bearings experimentally shown to generate milliwatt-level power. In this device, a free-standing, 12 mm diameter magnetic rotor is spun above microfabricated copper windings having connectors threaded through the device. To date, the generator has delivered 19 mW to matched resistive loads of 0.33  at a rotational speed of 40 krpm.
Aflatoxin Contamination of Commercial Maize Products during an Outbreak of Acute Aflatoxicosis in Eastern and Central Kenya

In April 2004, one of the largest aflatoxicosis outbreaks occurred in rural Kenya, resulting in 317 cases and 125 deaths. Aflatoxin-contaminated homegrown maize was the source of the outbreak, but the extent of regional contamination and status of maize in commercial markets (market maize) were unknown. We conducted a cross-sectional survey to assess the extent of market maize contamination and evaluate the relationship between market maize aflatoxin and the aflatoxicosis outbreak. We surveyed 65 markets and 243 maize vendors and collected 350 maize products in the most affected districts. Fifty-five percent of maize products had aflatoxin levels greater than the Kenyan regulatory limit of 20 ppb, 35% had levels > 100 ppb, and 7% had levels > 1,000 ppb. Makueni, the district with the most aflatoxicosis case-patients, had significantly higher market maize aflatoxin than did Thika, the study district with fewest case-patients (geometric mean aflatoxin = 52.91 ppb vs. 7.52 ppb, p = 0.0004). Maize obtained from local farms in the affected area was significantly more likely to have aflatoxin levels > 20 ppb compared with maize bought from other regions of Kenya or other countries (odds ratio = 2.71; 95% confidence interval, 1.12–6.59). Contaminated homegrown maize bought from local farms in the affected area entered the distribution system, resulting in widespread aflatoxin contamination of market maize. Contaminated market maize, purchased by farmers after their homegrown supplies are exhausted, may represent a source of continued exposure to aflatoxin. Efforts to successfully interrupt exposure to aflatoxin during an outbreak must consider the potential role of the market system in sustaining exposure.
Robust efficient distributed RSA-key generation

The invention provides for robust efficient distributed generation of RSA keys. An efficient protocol is one which is independent of the primality test “circuit size”, while a robust protocol allows correct completion even in the presence of a minority of arbitrarily misbehaving malicious parties. The disclosed protocol is secure against any minority of malicious parties (which is optimal). The disclosed method is useful in establishing sensitive distributed cryptographic function sharing services (certification authorities, signature schemes with distributed trust, and key escrow authorities), as well as other applications besides RSA (namely: composite ElGamal, identification schemes, simultaneous bit exchange, etc.). The disclosed method can be combined with proactive function sharing techniques to establish the first efficient, optimal-resilience, robust and proactively-secure RSA-based distributed trust services where the key is never entrusted to a single entity (i.e., distributed trust totally “from scratch”). The disclosed method involves new efficient “robustness assurance techniques” which guarantee “correct computations” by mutually distrusting parties with malicious minority.
Size-selective loosening of the blood-brain barrier in claudin-5–deficient mice

Tight junctions are well-developed between adjacent endothelial cells of blood vessels in the central nervous system, and play a central role in establishing the blood-brain barrier (BBB). Claudin-5 is a major cell adhesion molecule of tight junctions in brain endothelial cells. To examine its possible involvement in the BBB, claudin-5–deficient mice were generated. In the brains of these mice, the development and morphology of blood vessels were not altered, showing no bleeding or edema. However, tracer experiments and magnetic resonance imaging revealed that in these mice, the BBB against small molecules (<800 D), but not larger molecules, was selectively affected. This unexpected finding (i.e., the size-selective loosening of the BBB) not only provides new insight into the basic molecular physiology of BBB but also opens a new way to deliver potential drugs across the BBB into the central nervous system.
Development of the scoring mechanism for the concept map based intelligent knowledge assessment system

Concept maps as a pedagogical tool have become rather popular for teaching, learning and knowledge assessment. However, known computer-based concept map assessment systems use rather primitive scoring models. The paper describes a novel scoring mechanism which takes into account such factors as the degree of task difficulty, the number of mistakes, and frequency of students' usage of help and is implemented in the concept map based intelligent knowledge assessment system.
Tight Performance Bounds for Approximate Modified Policy Iteration with Non-Stationary Policies

We consider approximate dynamic programming for the infinite-horizon stationary $\gamma$-discounted optimal control problem formalized by Markov Decision Processes. While in the exact case it is known that there always exists an optimal policy that is stationary, we show that when using value function approximation, looking for a non-stationary policy may lead to a better performance guarantee. We define a non-stationary variant of MPI that unifies a broad family of approximate DP algorithms of the literature. For this algorithm we provide an error propagation analysis in the form of a performance bound of the resulting policies that can improve the usual performance bound by a factor $O\left(1-\gamma\right)$, which is significant when the discount factor $\gamma$ is close to 1. Doing so, our approach unifies recent results for Value and Policy Iteration. Furthermore, we show, by constructing a specific deterministic MDP, that our performance guarantee is tight.