We propose to model breast tissue in mammograms covering both density and tissue patterns. The breast tissue density modelling is based on the global density distribution of the breast region. We segment the whole breast region into a number of uniform density sub-regions and construct an overall density model of the breast using the relative proportions of these sub-regions. The breast tissue ...

This paper proves some topological properties of bitonic sorters, which have found applications in constructing, along with banyan networks, internally nonblocking switching fabrics in future broadband networks. The states of all the sorting elements of an N œ N bitonic sorter are studied for four different input sequences ai i N ; @ =1, bi i N ; @ =1, ci i N ; @ =1, and di i N ; @ =1, where ai...

We investigate a particular inductive inference problem where we are given as input a finite set of ordered triples of the form (wi, bi, ti) such that wi is a bit string, bi is a single bit, and ti is a positive integer written in unary. A machine M is said to match such a triple if M outputs bi on input wi in at most ti steps. We proceed to investigate the fixed parameter problems where we fix...

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition re°ecting the decreasing marginal contribution of non-clan members to growing coalitions. This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation scheme, where the value of each coalition is divided over its members in such a way that the clan...

Given a vector of finitely many piles of finitely many tokens. In EndWythoff, two players alternate in taking a positive number of tokens from either end-pile, or taking the same positive number of tokens from both ends. The player first unable to move loses and the opponent wins. We characterize the P -positions (ai, K, bi) of the game for any vector K of middle piles, where ai, bi denote the ...

In this paper, we consider the so-called balanced bi-clustering problem for n entities in a suitable space where the number of entities in each cluster is bounded. A special case of the balanced bi-clustering, where the number of entities in each cluster is fixed, is discussed. We present several algorithms, including deterministic and heuristic to attack these problems. In particular, a novel ...

This paper aims at exploring how ICTs can improve decision-making processes and subsequently service performances in public sector services. The authors focus on a specific class of Information Systems: Decision Support Systems (DSS) and Business Intelligence (BI). The research presented will lay the ground for investigating how the impact of these technologies on public services can be evaluat...

We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio δ and λ-precision. We prove that it can be partitioned into three sets BS , BI , BE such that the intersection of BI and BE is empty, and for some constant α, the volume of BI and BE is less than α portion of volume of B, and the volu...

s at ICCAM 2008 CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices Kuniyoshi Abe Gifu Shotoku University 1-38, Nakauzura, Gifu, 500-8288 Japan [email protected] Joint work with: S. Fujino By Krylov subspace methods, we are solving a large sparse linear system Ax = b, where A stand for an n-by-n matrix, and x and b are n-vectors, respectively. The Bi-C...

Proof Fix a satisfying assignment a. Define the distance of r to a, denoted dist(r, a), as the number of coordinates where ri 6= ai (this is called Hamming distance). Let r = r, r, r, · · · be the assignments generated by the algorithm, and let di = dist(r , a). Note that as we only change one bit of the assignment, di+1 = di + ∆i where ∆i ∈ {−1, 1}. We claim that Pr[∆i = −1] ≥ 1/2. Once this i...