The size of BaTiO3 particles was controlled by adjusting the molar ratio of the starting materials (BaCl2 + TiO2) to mineralizer (NaOH + KOH) during a composite-hydroxide-mediated approach using a novel hydrothermal r...The size of BaTiO3 particles was controlled by adjusting the molar ratio of the starting materials (BaCl2 + TiO2) to mineralizer (NaOH + KOH) during a composite-hydroxide-mediated approach using a novel hydrothermal reaction apparatus with a rolling system. The mean particle diameter decreased from 500 to 50 nm with a decrease in the (BaCl2 + TiO2)/(NaOH + KOH) molar ratio from 0.44 to 0.04. The powders were sintered by normal one-step sintering at 1200°C for 5 h and two-step sintering in which temperature was raised to 1200°C at first and then decreased to 1100°C and kept at 1100°C for 5 h. The BaTiO3 particles prepared with the (BaCl2 + TiO2)/(NaOH + KOH) molar ratio of 0.32 and 0.22 showed excellent sinterability and could be sintered to almost full theoretical density by both method. The sintered bodies obtained by both methods showed similarly excellent dielectric and piezoelectric properties.展开更多
Although hepatocellular carcinoma (HCC) is a common tumor, direct invasion of the gastrointestinal tract by HCC is uncommon. Recently, we encountered two cases of HCC with direct invasion to the colon. The first patie...Although hepatocellular carcinoma (HCC) is a common tumor, direct invasion of the gastrointestinal tract by HCC is uncommon. Recently, we encountered two cases of HCC with direct invasion to the colon. The first patient was a 79-year-old man who underwent transarterial chemo-embolization (TACE) for HCC 1.5 years prior to admission to our hospital. Computed tomography (CT) showed a 7.5-cm liver tumor directly invading the transverse colon. Partial resection of the liver and transverse colon was performed. The patient survived 6 mo after surgery, but died of recurrent HCC. The second patient was a 69-year-old man who underwent TACE and ablation for HCC 2 years and 7 months prior to being admitted to our hospital for melena and abdominal distension. CT revealed a 6-cm liver tumor with direct invasion to the colon. The patient underwent partial resection of the liver and right hemicolectomy. The patient recovered from the surgery. But, unfortunately, he died of liver failure due to liver cirrhosis one month later. Although the prognosis of HCC that has invaded the colon is generally poor due to the advanced stage of the disease, surgical resection may be a favorable treatment option in patients with a good general condition.展开更多
Given a simple graph G with n vertices and m edges, the spanning tree problem is to find a spanning tree for a given graph G. This problem has many applications, such as electric power systems, computer network design...Given a simple graph G with n vertices and m edges, the spanning tree problem is to find a spanning tree for a given graph G. This problem has many applications, such as electric power systems, computer network design and circuit analysis. For a simple graph, the spanning tree problem can be solved in O(log n) time with O(m+n) processors on the CRCW PRAM. In general, it is known that more efficient parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs O(log n) time with O(n/log n) processors on the EREW PRAM for constructing on proper circle trapezoid graphs.展开更多
Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical pow...Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. In this paper, we present an?time parallel algorithm with processors for constructing a spanning forest on proper circle graph G on EREW PRAM.展开更多
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit desi...The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.展开更多
文摘The size of BaTiO3 particles was controlled by adjusting the molar ratio of the starting materials (BaCl2 + TiO2) to mineralizer (NaOH + KOH) during a composite-hydroxide-mediated approach using a novel hydrothermal reaction apparatus with a rolling system. The mean particle diameter decreased from 500 to 50 nm with a decrease in the (BaCl2 + TiO2)/(NaOH + KOH) molar ratio from 0.44 to 0.04. The powders were sintered by normal one-step sintering at 1200°C for 5 h and two-step sintering in which temperature was raised to 1200°C at first and then decreased to 1100°C and kept at 1100°C for 5 h. The BaTiO3 particles prepared with the (BaCl2 + TiO2)/(NaOH + KOH) molar ratio of 0.32 and 0.22 showed excellent sinterability and could be sintered to almost full theoretical density by both method. The sintered bodies obtained by both methods showed similarly excellent dielectric and piezoelectric properties.
文摘Although hepatocellular carcinoma (HCC) is a common tumor, direct invasion of the gastrointestinal tract by HCC is uncommon. Recently, we encountered two cases of HCC with direct invasion to the colon. The first patient was a 79-year-old man who underwent transarterial chemo-embolization (TACE) for HCC 1.5 years prior to admission to our hospital. Computed tomography (CT) showed a 7.5-cm liver tumor directly invading the transverse colon. Partial resection of the liver and transverse colon was performed. The patient survived 6 mo after surgery, but died of recurrent HCC. The second patient was a 69-year-old man who underwent TACE and ablation for HCC 2 years and 7 months prior to being admitted to our hospital for melena and abdominal distension. CT revealed a 6-cm liver tumor with direct invasion to the colon. The patient underwent partial resection of the liver and right hemicolectomy. The patient recovered from the surgery. But, unfortunately, he died of liver failure due to liver cirrhosis one month later. Although the prognosis of HCC that has invaded the colon is generally poor due to the advanced stage of the disease, surgical resection may be a favorable treatment option in patients with a good general condition.
文摘Given a simple graph G with n vertices and m edges, the spanning tree problem is to find a spanning tree for a given graph G. This problem has many applications, such as electric power systems, computer network design and circuit analysis. For a simple graph, the spanning tree problem can be solved in O(log n) time with O(m+n) processors on the CRCW PRAM. In general, it is known that more efficient parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs O(log n) time with O(n/log n) processors on the EREW PRAM for constructing on proper circle trapezoid graphs.
文摘Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. In this paper, we present an?time parallel algorithm with processors for constructing a spanning forest on proper circle graph G on EREW PRAM.
文摘The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.
