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.     

Motion optimization using state-dispersion-based phase space partitions

This paper addresses a phase space partitioning problem in motion planning systems. A class of kinematic and dynamic motion planning systems, including rapid semioptimal motion-planning (RASMO), uses partitions for phase spaces in cumulative optimization criteria. In these systems, a partition results in a uniquely planned motion with a quality that is determined by a selected optimization criterion. In this paper, state-dispersion-based phase space partitioning (SDPP) that generates adaptive partitions is proposed. These partitions allow the motion planning systems to plan better motions. Uniform partitions and adaptively fixed partitions of SDPP are compared under several conditions using RASMO and a double inverted pendulum model while setting the optimality criterion of RASMO to time. The results reveal that RASMO with SDPP plans smaller time motions than those obtained with RASMO using uniform partitions.     

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.     

Gain‐Scheduled Control via Switching of LTI Controllers and State Reset

This paper proposes a synthesis method of gain‐scheduled control systems that switch linear time‐invariant controllers according to hysteresis of the scheduling parameter. Stability and L₂‐gain analysis and synthesis methods for switched systems are applied to the switched gain‐scheduled control synthesis using reset of the controller state, where also the reset law is computed via linear matrix inequalities (LMIs). In addition to optimization of an upper bound of L₂‐gain, we reduce jumps of control input via an auxiliary optimization. Numerical examples are presented to illustrate the switched gain‐scheduled controller.     

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.     

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