We study the computational properties of solving a constrained L1-L2 minimization via a difference of convex algorithm (DCA), which was proposed in our previous work [13, 19] to recover sparse signals from a under-determined linear system. We prove that the DCA converges to a stationary point of the nonconvex L1-L2 model. We clarify the relationship of DCA to a convex method, Bregman iteration ...

Programmed cell death protein 1 (PD-1) and its ligands PD-L1 and PD-L2 play critical roles in maintaining an immunosuppressive tumor microenvironment. The purpose of the present study was to assess expression of PD-1, PD-L1, and PD-L2 in mouse prostate tumors. A total of 33 mouse prostate tumors derived from Pten-null mice were examined using immunohistochemical staining for PD-1, PD-L1, and PD...

In the fly Drosophila melanogaster, photoreceptor input to motion vision is split into two parallel pathways as represented by first-order interneurons L1 and L2 (Rister et al., 2007; Joesch et al., 2010). However, how these pathways are functionally specialized remains controversial. One study (Eichner et al., 2011) proposed that the L1-pathway evaluates only sequences of brightness increments...

مگس مینوز سبزی و صیفی Liriomyza sativae Blanchard ، از مهم­ترین آفات ‌های گلخانه ای فضای باز، محسوب می شود. با توجه به توصیه کاربرد حشره­ کش تیوسیکلام جهت مدیریت آفت مزبور، در پژوهش حاضر، اثرات کشندگی زیرکشندگی(5/131:LC30، 1/87:LC20، 15/49:LC10 میلی گرم ماده موثره بر لیتر) حشره ­کش (اویسکت®SP50%) روی فراسنجه ­های زیستی این شرایط آزمایشگاهی مورد ارزیابی قرار گرفت. روش استفاده انجام آزمایش­ها غوط...

We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs 〈L1,L2〉 of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to L1 and L2, respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary a...

One of the key issues in bilingual lexical representation is whether L1 processing is facilitated by L2 words. In this study, we conducted two experiments using the masked priming paradigm to examine how L2-L1 translation priming effects emerge when unbalanced, low proficiency, Korean-English bilinguals performed a lexical decision task. In Experiment 1, we used a 150 ms SOA (50 ms prime durati...

This study compares the realization of English narrow focus by L1 speakers of English and Taiwan Mandarin. Results show that L1 Taiwan Mandarin speakers produce a much smaller increase in average F0 and amplitude for on-focus words and a much smaller decrease in average F0 and amplitude on post-focus words than L1 English speakers do. Moreover, post-focus compression of F0 range and duration, v...

Some new Zn(II) and Cu(II) complexes [Cu(L1)(OAc)2]∙H2O, [Cu(L1)(NO3)H2O]∙NO3∙3.5H2O, [Zn(L1)(NO3)2]∙4.5H2O, [Zn(L1)(OAc)2(H2O)2]∙3H2O, [Cu2(L2)(OAc)4]∙2H2O∙2DMF, [Cu(L2)2]∙2NO3∙1.5DMF∙H2O, [Zn(L2)2(NO3)2]∙DMF and [Zn2(L2)(OAc)4(H2O)4]∙5H2O; L1 = 2-[2-(2-methoxyphenyl)hydrazono]cyclohexane-1,3-dione and L2 = 2-[2-(3-nitrophenyl)hydrazono]cyclohexane-1,3-dione were synthesized and characterized ...

This paper studies the state complexity of (L1L2) , L1 L2, L ∗ 1L2, (L1 ∪L2)L3, (L1∩L2)L3, L1L2∩L3, and L1L2∪L3 for regular languages L1, L2, and L3. We first show that the upper bound proposed by [Liu, Martin-Vide, Salomaa, Yu, 2008] for the state complexity of (L1L2) R coincides with the lower bound and is thus the state complexity of this combined operation by providing some witness DFAs. Al...

The masked translation priming paradigm has been widely used in the last 25 years to investigate word processing in bilinguals. Motivated by studies reporting mixed findings, in particular for second language (L2) to first language (L1) translation priming, we conducted, for the first time in the literature, a meta-analysis of 64 masked priming lexical decision experiments across 24 studies to ...