The 2-LCPS problem, first introduced by Chowdhury et al. [Fundam. Inform., 129(4):329–340, 2014], asks one to compute (the length of) a longest palindromic common subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for 4 strings. Then, we present a new algorithm which solves the 2-LCPS problem ...

• Lexical cohesion on YouTube is multimodal, cross-modal and intertextual. Cohesive ties exist between the video comments as well comments. A discussion may appear fragmented but still show dense cohesion. Qualitative corpus methods reveal how fragmentation a feature surface only. This paper investigates use functions of lexical within across modes levels interaction channel, arguing that contr...

BACKGROUND Docosahexaenoic acid (DHA) and arachidonic acid (AA) are long-chain polyunsaturated fatty acids (LCPs) that play pivotal roles in growth and neurodevelopment. OBJECTIVE We aimed to quantify the synthesis of LCPs in preterm infants fed infant formula containing LCPs. DESIGN Twenty-two preterm infants were randomly assigned to either the no-LCP group (fed formula without LCPs; n = ...

In this paper, we describe ihow word sense am= biguity can be resolw'.d with the aid of lexical eo-hesion. By checking ]exical coheshm between the current word and lexical chains in the order of the salience, in tandem with getmration of lexica] chains~ we realize incretnental word sense disam biguation based on contextual infl)rmation that lexical chains,reveah Next;, we <le~<:ribe how set men...

This study examines the phonetic properties of lexical stress in English produced by Persian speakers learning English as a foreign language. The four most reliable phonetic correlates of English lexical stress, namely fundamental frequency, duration, intensity, and vowel quality were measured across Persian speakers’ production of the stressed and unstressed syllables of five English disyllabi...

Specially structured linear complementarity problems (LCPs) and their solution by the miss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, ro...