A Structured Prediction Approach for Statistical Machine Translation

We propose a new formally syntax-based method for statistical machine translation. Transductions between parsing trees are transformed into a problem of sequence tagging, which is then tackled by a search- based structured prediction method. This allows us to automatically acquire transla- tion knowledge from a parallel corpus without the need of complex linguistic parsing. This method can achieve compa- rable results with phrase-based method (like Pharaoh), however, only about ten percent number of translation table is used. Experiments show that the structured pre- diction approach for SMT is promising for its strong ability at combining words.

In vitro selected peptides bind with thymidylate synthase mRNA and inhibit its translation

Thymidylate synthase (TS), an essential enzyme for catalyzing the biosynthesis of thymidylate, is a critical therapeutic target in cancer therapy. Recent studies have shown that TS functions as an RNA-binding protein by interacting with two different sequences on its own mRNA, thus, repressing translational efficiency. In this study, peptides binding TS RNA with high affinity were isolated using mRNA display from a large peptide library (>10(13) different sequences). The randomized library was subjected up to twelve rounds of in vitro selection and amplification. Comparing the amino acid composition of the selected peptides (12th round, R12) with those from the initial random library (round zero, R0), the basic and aromatic residues in the selected peptides were enriched significantly, suggesting that these peptide regions might be important in the peptide-TS mRNA interaction. Categorizing the amino acids at each random position based on their physicochemical properties and comparing the distributions with those of the initial random pool, an obvious basic charge characteristic was found at positions 1, 12, 17 and 18, suggesting that basic side chains participate in RNA binding. Secondary structure prediction showed that the selected peptides of R12 pool represented a helical propensity compared with R0 pool, and the regions were rich in basic residues. The electrophoretic gel mobility shift and in vitro translation assays showed that the peptides selected using mRNA display could bind TS RNA specifically and inhibit the translation of TS mRNA. Our results suggested that the identified peptides could be used as new TS inhibitors and developed to a novel class of anticancer agents.

Global Translation Preferred Active Contour

具有全局平移优先属性的主动轮廓更适于目标跟踪。演化轮廓具有的全局平移优先性可以理解为沿轮廓的速度场具有相等的倾向。根据此思想,通过定义在曲线扰动集合上的新内积空间导出了一种简单,具有平移优先的梯度流。新的内积空间由于是通过向H0主动轮廓对应的內积空间引入曲线扰动的方差获得,所以此主动轮廓称为方差主动轮廓。方差主动轮廓是将H0主动轮廓与其对应的平均梯度流通过加权求和获得,而H1主动轮廓则是通过H0主动轮廓与特定类型的核函数进行卷积得到。因此方差主动轮廓实现时更简单和快速。最后给出了H0,H1和方差主动轮廓在频域与时域的分析。

Vision, Instruction, and Action

This thesis describes Sonja, a system which uses instructions in the course of visually-guided activity. The thesis explores an integration of research in vision, activity, and natural language pragmatics. Sonja's visual system demonstrates the use of several intermediate visual processes, particularly visual search and routines, previously proposed on psychophysical grounds. The computations Sonja performs are compatible with the constraints imposed by neuroscientifically plausible hardware. Although Sonja can operate autonomously, it can also make flexible use of instructions provided by a human advisor. The system grounds its understanding of these instructions in perception and action.

ART: An ontology based tool for the translation of papers into Semantic Web format

To be presented at SIG/ISMB07 ontology workshop: http://bio-ontologies.org.uk/index.php To be published in BMC Bioinformatics. Sponsorship: JISC

Machine Translation and the Internet

Jones, E. H. G., Thomas, Ned, and King, Alan, 'Machine Translation and the Internet', Mercator Media Forums (2001) 5(1) pp.84-98 RAE2008

Staging Swissness : Inter-and Intracultural Theatre Translation

Wilkinson, Jane, 'Staging Swissness: Inter- and Intracultural Theatre Translation', Language and Intercultural Communication (2005) 5(1) pp.72-85 RAE2008

Pleasure and instruction in the Prologue of Longus’ “Daphnis and Chloe”

The present study attempts to demonstrate that the ancient Greek novel Daphnis and Chloe systematically explores the problem expressed by Horace in the phrase docere et delectare, and that this purpose is announced in the Prologue. The functions of prologues as such are briefly reviewed. After a consideration of the prologues of the remaining ancient Greek novels, the Prologue of Longus’s Daphnis and Chloe is analyzed line by line. Longus uses the Prologue, then, to establish a series of dialectical tensions that operate throughout the novel, allowing it to delight and instruct at the same time.

Base pairing interaction between 5′- and 3′-UTRs controls icaR mRNA translation in Staphylococcus aureus

UPNa. Instituto de Agrobiotecnología. Laboratorio de Biofilms Microbianos.

The sacred edict; with a translation of the colloquial rendering, notes and vocabulary, by F. W. Baller. Prepared for the use of junior members of the China Inland Mission.

http://www.archive.org/details/thesacrededict01kanguoft

The life of Father de Smet, S.J. (1801-1873) by E. Laveille, S.J., authorized translation by Marian Lindsay, introduction by Charles Coppens ...

http://www.archive.org/details/lifeoffatherdesm00laverich

Lightweight Formal Verification in Classroom Instruction of Reasoning about Functional Code

In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous. Students can focus on a specific collection of constructs that are represented consistently. Examples and counterexamples can be evaluated. Assignments can be assembled and checked with the help of an automated formal reasoning system. However, usability and accessibility do not have a high priority and are not addressed sufficiently well in the design of many existing machine-readable representations and corresponding formal reasoning systems. In earlier work [Lap09], we attempt to address this broad problem by proposing several specific design criteria organized around the notion of a natural context: the sphere of awareness a working human user maintains of the relevant constructs, arguments, experiences, and background materials necessary to accomplish the task at hand. We report on our attempt to evaluate our proposed design criteria by deploying within the classroom a lightweight formal verification system designed according to these criteria. The lightweight formal verification system was used within the instruction of a common application of formal reasoning: proving by induction formal propositions about functional code. We present all of the formal reasoning examples and assignments considered during this deployment, most of which are drawn directly from an introductory text on functional programming. We demonstrate how the design of the system improves the effectiveness and understandability of the examples, and how it aids in the instruction of basic formal reasoning techniques. We make brief remarks about the practical and administrative implications of the system’s design from the perspectives of the student, the instructor, and the grader.

Orientational Harmonic Model for Rotation, Translation, and Scale Invariant Pattern Representation in Biological Vision

An extension to the orientational harmonic model is presented as a rotation, translation, and scale invariant representation of geometrical form in biological vision.

Orientational Harmonic Model for Rotation, Translation, and Scale Invariant Pattern Representation in Biological Vision

The proposed model, called the combinatorial and competitive spatio-temporal memory or CCSTM, provides an elegant solution to the general problem of having to store and recall spatio-temporal patterns in which states or sequences of states can recur in various contexts. For example, fig. 1 shows two state sequences that have a common subsequence, C and D. The CCSTM assumes that any state has a distributed representation as a collection of features. Each feature has an associated competitive module (CM) containing K cells. On any given occurrence of a particular feature, A, exactly one of the cells in CMA will be chosen to represent it. It is the particular set of cells active on the previous time step that determines which cells are chosen to represent instances of their associated features on the current time step. If we assume that typically S features are active in any state then any state has K^S different neural representations. This huge space of possible neural representations of any state is what underlies the model's ability to store and recall numerous context-sensitive state sequences. The purpose of this paper is simply to describe this mechanism.