background: the impact of positive intramammary lymph node (im ln) on the prognosis of patients with breast cancer has been debated for years; likewise, the standard management of patients with positive im ln remains unclear, especially when it is identified by preoperative imaging or by sentinel lymph node biopsy. the present study aims at reviewing the level of concurrent involvement of im ln...

SAT4J [1] is an open-source library of conflict-driven clause learning SAT solvers in the spirit of GRASP, zChaff and MiniSAT in Java. Its extension to pseudoboolean optimization is done by replacing the resolution performed between clauses by cutting planes, in the spirit of PBChaff [5] or Galena [4]. Compared to the version submitted to the PB05 evaluation, the solver is representing each kin...

Definition 1.1. A curved L∞ algebra over A consists of a locally free finitely generated graded A]-module V, together with a cohomological degree 1 and square zero derivation d : Ŝym(V∨[−1])→ Ŝym(V∨[−1]) where V∨ is the A]-linear dual and the completed symmetric algebra is also over A]. There are two additional requirements on the derivation d: (1) The derivation d makes Ŝym(V∨[−1]) into a dga ...

background: in lupus nephritis (ln), deposition of pathogenic autoantibodies in the glomeruli is mediated via cross-reactivity with alpha-actinin. association of serum alpha-actinin antibody (aαa) with ln has been shown in a few studies but the results are controversial. methods: eighty patients into entered the study. the diagnosis of sle was confirmed according to the american college of rheu...

We solve an open problem that was posed in [GKM10]: Given an alphabet list L = L1, . . . , Ln, where |Li| = 3 and 0 ≤ i ≤ n, can we always find a square-free string, W = W1W2 . . .Wn, where Wi ∈ Li? We show that this is indeed the case. We do so using an “offending suffix” characterization of forced repetitions, and a counting, non-constructive, technique. We discuss future directions related t...

We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate the language. Especially, we consider the behaviour of this measure with respect to operations. For given numbers c1, c2, . . . , cn and an nary operation τ on languages we discuss the range of Var(τ(L1, L2, . . . , Ln))...

The classical knot concordance group, C1, was defined in 1961 by Fox [F]. He proved that it is nontrivial by finding elements of order two; details were presented in [FM]. Since then one of the most vexing questions concerning the concordance group has been whether it contains elements of finite order other than 2–torsion. Interest in this question was heightened by Levine’s proof [L1, L2] that...

The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn...

Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time. This result implies, in particular, that the problem of generating all minimal infrequent elements for a database with semi-lattice attributes, a...

Thue [14] showed that there exist arbitrarily long square-free strings over an alphabet of three symbols (not true for two symbols). An open problem was posed in [7], which is a generalization of Thue’s original result: given an alphabet list L = L1, . . . , Ln, where |Li| = 3, is it always possible to find a square-free string, w = w1w2 . . .wn, where wi ∈ Li? In this paper we show that square...