Booreana mice carrying the c-Myb308G point mutation were analyzed to determine changes in early hematopoiesis in the bone marrow and among mature cells in the periphery. This point mutation led to increased numbers of early hematopoietic stem and progenitor cells (HSPCs), with a subsequent reduction in the development of B cells, erythroid cells, and neutrophils, and increased numbers of myeloi...

Abstract Background: Identity disturbance is one of the DSM-IV criteria for borderline personality disorder, but there has been little attention to its nature. Four subsets of identity disturbance (role absorption, painful incoherence, inconsistency and lack of commitment) have been assessed. This study aimed to assess the role of these subsets in patients with borderline person...

Theorem 1.1. Let G, X, p0, and r be as above. Suppose T is translation invariant, maps L log L to L, and is bounded on L0 . Then T is bounded on L, 1 < p < p0 with an operator norm of O((p − 1) ). This theorem is false without the assumption of translation invariance, since L is not an interpolation space between L log L and L0 . For a concrete counterexample, take E and F be subsets of X of me...

In this paper, we consider a general covering problem in which k subsets are to be selected such that their union covers as large a weight of objects from a universal set of elements as possible. Each subset selected must satisfy some structural constraints. We analyze the quality of a k-stage covering algorithm that relies, at each stage, on greedily selecting a subset that gives maximum impro...

A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given. 1 Problem formulation We study a class of knapsack problems which generalizes problems from [1-2]. The main mathematical model we shall use is formulated as follows. ...

It is known that MC-CDMA systems suffer from multiaccess interference (MAI) when the channel is frequency-selective fading. In this paper, we propose a Hadamard-Walsh code based MC-CDMA system that achieves zero MAI over frequency-selective fading channel. In particular, we will use appropriately chosen subsets of Hadamard-Walsh code as codewords. For a multipath channel of length L, we partiti...

Given a linear equation L, a set A of integers is L-free if A does not contain any ‘nontrivial’ solutions to L. This notion incorporates many central topics in combinatorial number theory such as sum-free and progression-free sets. In this paper we initiate the study of (parameterised) complexity questions involving L-free sets of integers. The main questions we consider involve deciding whethe...

We show that the number of subsets of {1, 2, ..., n} with no solution to x1+x2+ ...+xk = y1+y2+ ..+yl for k ≥ 4l−1 is at most c2 where θ = k−l k .