نتایج جستجو برای: lk

تعداد نتایج: 1787  

2016
Bahareh Afshari Stefan Hetzl Graham Emil Leigh

We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Π2/Σ2. The representation takes the form of a typed non-deterministic tree grammar G of order 2 which generates a finite language, L(G ), of first-order terms that appear in the Herbrand expansions obtained through cut-elimination. In particular, for every Gentzen-style reduction π π ′ bet...

2015
Igor Puzanov Alexandra Hess

success of small molecule tyrosine kinase (TKI) inhibitors in cancer treatment and recent studies both in vitro and in vivo sparked interest in targeting the insulin-like growth factor receptor 1 (IGF1R). The development of several antibodies as well as small molecule inhibitors aimed at this receptor continues to be the subject of numerous preclinical studies and clinical trials. IGF1R, a tyro...

Journal: :Bulletin of the Korean Mathematical Society 2016

Journal: :Biblische Zeitschrift 2023

Abstract The present article proposes what can be labeled an ecclesiological interpretation of the highly debated parable unjust steward. Jesus (probably Historical Jesus) adhorts his followers to practice solidarity – also in financial matters towards each other, something that obviously works pretty well among criminals (who keep together since one knows about skeletons closet other and vice ...

2006
Kevin L. Trimpe Bruce S. Zwilling

We have developed two monoclonal antibodies, designated 152 £12 D7 and 153 (7 A6, which have reactivity with cell surface antigens expressed on the B16 mouse melanoma. These monoclonal antibodies are produced by hybridomas resulting from the fusion of splenocytes taken from C57BL/6 mice bearing the B16-F10 tumor. The monoclonal antibodies are of the ¡mmunoglobulinM class and have been shown t...

Journal: :Australasian J. Combinatorics 2009
Jianfeng Wang K. L. Teo Qiongxiang Huang Chengfu Ye Ruying Liu

For k ≥ 3, let G = T (l1, l2, . . . , lk) be the tree with exactly one vertex v of degree k, and G−v = Pl1∪Pl2∪· · ·∪Plk , where Pn is the path of order n. ∗ Supported by the National Science Foundation of China (No. 10761008). † Corresponding author. Second address: Department of Mathematics and Information Science, Qinghai Normal University, Xining, Qinghai 810008, P. R. China. 104 J. WANG, K...

2015
Weichen Liu Thomas Weise Yuezhong Wu Raymond Chiong

Local search such as Ejection Chain Methods (ECMs) based on the stem-and-cycle (S&C) reference structure, Lin-Kernighan (LK) heuristics, as well as the recently proposed Multi-Neighborhood Search (MNS), are among the most competitive algorithms for the Traveling Salesman Problem (TSP). In this paper, we carry out a large-scale experiment with all 110 symmetric instances from the TSPLib to inves...

Journal: :The Journal of experimental biology 1996
Wang Rubenfeld Hayes Beyenbach

There are two major transport pathways across epithelia: a transcellular pathway through cells and a paracellular pathway between cells. Previous electrophysiological studies in mosquito Malpighian tubules suggested that the neuropeptide leucokinin-VIII (LK-VIII) increases the chloride permeability of the paracellular pathway. To test the effect of LK-VIII on the paracellular pathway further, w...

2004
Hiroyuki Nagashima Koichi Yamazaki

Let S be a set of weighted axis-parallel rectangles such that for each axis no projection of one rectangle properly contains that of another. Two rectangles are in con"ict if two projections of the rectangles on an axis intersect. The problem we consider in this paper is to 3nd a maximum weighted subset S′ ⊆ S of rectangles such that any two rectangles in S′ are not in con4ict. In this paper, w...

Journal: :Ann. Pure Appl. Logic 1999
Alessandra Carbone

In [ 131 Parikh proved the first mathematical result about concrete consistency of contradictory theories. In [6] it is shown that the bounds of concrete consistency given by Parikh are optimal. This was proved by noting that very large numbers can be actually constructed through very short proofs, A more refined analysis of these short proofs reveals the presence of cyclic paths in their logic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید