Differential diagnosis of chronic lymphocytic leukemia/small lymphocytic lymphoma and other indolent lymphomas, including mantle cell lymphoma

Chronic lymphocytic leukemia/small lymphocytic lymphoma (CLL/SLL) accounts for approximately 1% of all lymphomas in our department. In this article, we describe the differential diagnosis of CLL/SLL from other indolent lymphomas, with special reference to follicular lymphoma, marginal zone B-cell lymphoma, lymphoplasmacytic lymphoma, and mantle cell lymphoma, although the latter is considered to be aggressive. CLL/SLL often exhibits proliferation centers, similar to follicular lymphoma. Immunohistological examination can easily distinguish these two lymphomas. The most important characteristic of CLL/SLL is CD5 and CD23 positivity. Mantle cell lymphoma is also CD5-positive and there are some CD23-positive cases. Such cases should be carefully distinguished from CLL/SLL. Some marginal zone lymphomas are also positive for CD5 and such cases are often disseminated. Lymphoplasmacytic lymphoma should also be a differential diagnosis for CLL/SLL. It frequently demonstrates MYD88 L265P, which is a key differential finding. By immunohistological examination, the expression of lymphoid enhancer-binding factor 1 is specific for CLL/SLL and can be a good marker in the differential diagnosis

The limit theorem with respect to the matrices on non-backtracking paths of a graph

We give a limit theorem with respect to the matrices related to non-backtracking paths of a regular graph. The limit obtained closely resembles the $k$th moments of the arcsine law. Furthermore, we obtain the asymptotics of the averages of the $p^m$th Fourier coefficients of the cusp forms related to the Ramanujan graphs defined by A. Lubotzky, R. Phillips and P. Sarnak

Virtualized Network Graph Design and Embedding Model to Minimize Provisioning Cost

The provisioning cost of a virtualized network (VN) depends on several factors, including the numbers of virtual routers (VRs) and virtual links (VLs), mapping of them on a substrate infrastructure, and routing of data traffic. An existing model, known as the virtual network embedding (VNE) model, determines the embedding of given VN graphs into the substrate infrastructure. When the resource allocation model of the VNE problem is adopted to a single-entity scenario, where a single entity fulfills the roles of both a service provider and an infrastructure provider, an issue of increased costs of VNs and access paths arise. This paper proposes a model for virtualized network graph design and embedding (VNDE) for the single-entity scenario. The VNDE model determines the number of VRs and a VN graph for each request in conjunction with embedding. The VNDE model also determines access paths that connect customer premises and VRs. We formulate the VNDE model as an integer linear programming (ILP) problem. We develop heuristic algorithms for the cases where the ILP problem cannot be solved in practical time. We evaluate the performance of the VNDE model on several networks, including an actual Japanese academic backbone network. Numerical results show that the proposed model designs suitable VN graphs and embeds them according to the volume of traffic demands and access path cost. Compared with the benchmark model, which is based on a classic VNE approach, the proposed model reduces the provisioning cost at most 28.7% in our examined scenarios

Virtual Network Function Placement for Service Chaining by Relaxing Visit Order and Non-Loop Constraints

Network Function Virtualization (NFV) is a paradigm that virtualizes traditional network functions and instantiates Virtual Network Functions (VNFs) as software instances separate from hardware appliances. Service Chaining (SC), seen as one of the major NFV use cases, provides customized services to users by concatenating VNFs. A VNF placement model for SC that relaxes the visit order constraints of requested VNFs has been considered. Relaxing the VNF visit order constraints reduces the number of VNFs which need to be placed in the network. However, since the model does not permit any loop within an SC path, the efficiency of utilization of computation resources deteriorates in some topologies. This paper proposes a VNF placement model for SC which minimizes the cost for placing VNFs and utilizing link capacity while allowing both relaxation of VNF visit order constraints and configuration of SC paths including loops. The proposed model determines routes of requested SC paths, which can have loops, by introducing a logical layered network generated from an original physical network. This model is formulated as an Integer Linear Programming (ILP) problem. A heuristic algorithm is introduced for the case that the ILP problem is not tractable. Simulation results show that the proposed model provides SC paths with smaller cost compared to the conventional model

Data-Importance-Aware Bandwidth-Allocation Scheme for Point-Cloud Transmission in Multiple LIDAR Sensors

This paper addresses bandwidth allocation to multiple light detection and ranging (LIDAR) sensors for smart monitoring, which a limited communication capacity is available to transmit a large volume of point-cloud data from the sensors to an edge server in real time. To deal with the limited capacity of the communication channel, we propose a bandwidth-allocation scheme that assigns multiple point-cloud compression formats to each LIDAR sensor in accordance with the spatial importance of the point-cloud data transmitted by the sensor. Spatial importance is determined by estimating how objects, such as cars, trucks, bikes, and pedestrians, are likely to exist since regions where objects are more likely to exist are more useful for smart monitoring. A numerical study using a real point-cloud dataset obtained at an intersection indicates that the proposed scheme is superior to the benchmarks in terms of the distributions of data volumes among LIDAR sensors and quality of point-cloud data received by the edge server

Virtual network function placement and routing for multicast service chaining using merged paths

This paper proposes a virtual network function placement and routing model for multicast service chaining based on merging multiple service paths (MSC-M). The multicast service chaining (MSC) is used for providing a network-virtualization based multicast service. The MSC sets up a multicast path, which connects a source node and multiple destination nodes. Virtual network functions (VNFs) are placed on the path so that users on the destination nodes receive their desired services. The conventional MSC model configures multicast paths for services, each of which has the same source data and the same set of VNFs in a predefined order. In the MSC-M model, if paths of different services carry the same data on the same link, these paths are allowed to be merged into one path at that link, which improves the utilization of network resources. The MSC-M model determines the placement of VNFs and the route of paths so that the total cost associated with VNF placement and link usage is minimized. The MSC-M model is formulated as an integer linear programming (ILP) Problem. We prove that the decision version of VNF placement and routing problem based on the MSC-M model is NP-complete. A heuristic algorithm is introduced for the case that the ILP problem is intractable. Numerical results show that the MSC-M model reduces the total cost required to accommodate service chaining requests compared to the conventional MSC model. We discuss directions for extending the MSC-M model to an optical domain

Genetic Factors of Low-responsiveness to Hepatitis B Virus Vaccine Confirms the Importance of Human Leukocyte Antigen Class II Types in a Japanese Young Adult Population

We investigated the genetic mechanisms underlying the association between human leukocyte antigen (HLA) types and the immune response to hepatitis B virus (HBV) vaccination in 84 healthy Japanese adults, and found that the HLA-DRB1＊04 and HLA-DQB1＊03 frequencies were higher in the low responders (<10 mIU/ml; n=9, 10.7%) compared to the responders (≥10 mIU/ml, n=75, 89.3%). The combination of DRB1＊04 and DQB1＊03 was associated with a low response to vaccination. The DRB1＊04 and DQB1＊03 haplotypes’ frequencies were significantly higher in the low responders compared to responders. Novel candidate HLA types may be important in Japanese individuals

Kinetic Analysis and Prediction of Thermal Decomposition Behavior of Tertiary Pyridine Resin in the Nitrate Form

AbstractThe thermal decomposition behavior of the tertiary pyridine resin, which was used during the nuclide-separation process in the Advanced Optimization by Recycling Instructive Elements (Advanced ORIENT) cycle, was investigated in its nitrate form (TPR-NO3), in order to determine ways of preventing its runaway reaction. A thermal analysis of TPR-NO3 and an analysis of the gases produced during decomposition were employed for the purpose. In addition, the kinetics parameters were evaluated via a kinetic analysis of the empirical thermal data. Finally, the validity of the reaction model was assessed by comparing the thermal behavior predicted by the estimated reaction model with that determined by the results of a gram-scale heating test performed in our previous study. We found that, when TPR-NO3 was heated, first, nitric acid was removed. Subsequently, TPR-NO3 was oxidized by the removed nitric acid. Under the assumption that it took place an autocatalytic oxidation and nth order thermal decomposition in parallel, the thermogravimetric analysis data could be fitted very well using a nonlinear regression model. The thermal behavior of TPR-NO3 could be predicted by the reaction model determined in this study under conditions where the cooling effect owing to evaporation was ignored. In addition, the maximum temperature and time to maximum rate of a runaway reaction predicted using the determined reaction model gave the result on the side of prudence