Cytomegalovirus disease accompanied by severe hypoproteinemia in a patient with adult T-cell leukemia-lymphoma

A 62-year-old Japanese man complained of fever, general fatigue, anorexia and watery diarrhea during remission of adult T-cell leukemia-lymphoma. Laboratory examinations showed severe hypoproteinemia (2.9 g/dl). However, neither intestinal lesions associated with ATL nor findings suggesting protein losing gastroenteropathy were observed. Cytomegalovirus (CMV) antigen detection assay using peripheral blood leukocytes revealed that he had an active CMV infection with hemophagocytic syndrome. Treatment with ganciclovir and methylprednisolone led to an improvement of hypoproteinemia. CMV disease and associated hemophagocytic syndrome should be considered as a cause of hypoproteinemia in an immunocompromised host.     

Heat transfer to laminar flow with temperature — dependent heat generation

Two problems were solved theoretically on the heat transfer to circular tube flow with internal heat source. The one problem is to maintain the mixed-mean temperature of fluid at the inlet temperature. The other is a conjugated problem with a uniformly specified temperature at the outside surface of the wall, accounting for the wall conduction. From the numerical example for the former, it is shown that the mixed-mean temperature can be controlled within 15% error under the estimated condition. From the numerical results for the latter, it is concluded that the influence of wall conduction is more serious than the case without heat generation.     

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Given a digraph (or an undirected graph) G=(V,E) with a set V of vertices v with nonnegative real costs w(v), and a set E of edges and a positive integer k, we deal with the problem of finding a minimum cost subset SV such that, for each vertex vV−S, there are k vertex-disjoint paths from S to v. In this paper, we show that the problem can be solved by a greedy algorithm in time in a digraph (or in time in an undirected graph), where n=|V| and m=|E|. Based on this, given a digraph and two integers k and ℓ, we also give a polynomial time algorithm for finding a minimum cost subset SV such that for each vertex vV−S, there are k vertex-disjoint paths from S to v as well as ℓ vertex-disjoint paths from v to S.     

Quad-trees, oct-trees, and k-trees: a generalized approach to recursive decomposition of euclidean space

K-trees are developed as a K-dimensional analog of quad-trees and oct-trees. K-trees can be used for modeling K-dimensional data. A fast algorithm is given for finding the boundary size of a K-dimensional object represented by a K-tree. For K considered as con-stant; the algorithm provides a method for computing the perimeter of a quad-tree encoded image or the surface area of an oct-tree encoded object in worst case time proportional to the number of nodes in the tree. This improves upon the expected-case linear-time method of Samet [10] for the perimeter problem. Our method has been implemented in Pascal, and a computational example is given.     

Magnetization Reversal by Electrical Spin Injection in Ferromagnetic (Ga,Mn)As-Based Magnetic Tunnel Junctions

We report current-induced magnetization reversal in a ferromagnetic semiconductor-based magnetic tunnel junction (Ga,Mn)As/AlAs/(Ga,Mn)As prepared by molecular beam epitaxy on a p-GaAs(001) substrate. A change in magneto-resistance that is asymmetric with respect to the current direction is found with the excitation current of 10⁶ A/cm². Contributions of both unpolarized and spin-polarized components are examined, and we conclude that the partial magnetization reversal occurs in the (Ga,Mn)As layer having smaller magnetization with the spin-polarized tunneling current of 10⁵ A/cm².     

Avoiding Routing Loops on the Internet

Suppose that some particular link in the Internet is currently congested. A natural solution is to try to make packets bypass that link. This can be done by increasing the cost of that link intentionally, say from a ₁ to a ₂, since the Internet uses shortest-path routing. Unfortunately, however, this often causes temporary loops for packet traveling, called routing loops. In this paper we show that routing loops can be avoided by increasing the cost of the link not directly from a ₁ to a ₂ but through an intermediate value, a ₃, i.e., from a ₁ to a ₃ and then to a ₂. We may need several intermediate values. We show that in this case the greedy strategy, namely, raising the cost as much as possible in each step, is optimal.     

A parallel algorithm for graph matching and its MasParimplementation

Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation time for graph matching by employing both branch-and-bound pruning of the search tree and massively-parallel search of the as-yet-unpruned portions of the space. Most research on parallel search has assumed that a multiple-instruction-stream/multiple-data-stream (MIMD) parallel computer is available. Since massively parallel stream (SIMD) computers are much less expensive than MIMD systems with equal numbers of processors, the question arises as to whether SIMD systems can efficiently handle state-space search problems. We demonstrate that the answer is yes, and in particular, that graph matching has a natural and efficient implementation on SIMD machines