Web of Science

Web of Science

Publisher：BMC Pulmonary Medicine  

Background: Interstitial lung abnormalities (ILAs) on CT may affect the clinical outcomes in patients with chronic obstructive pulmonary disease (COPD), but their quantification remains unestablished. This study examined whether artificial intelligence (AI)-based segmentation could be applied to identify ILAs using two COPD cohorts. Methods: ILAs were diagnosed visually based on the Fleischner Society definition. Using an AI-based method, ground-glass opacities, reticulations, and honeycombing were segmented, and their volumes were summed to obtain the percentage ratio of interstitial lung disease-associated volume to total lung volume (ILDvol%). The optimal ILDvol% threshold for ILA detection was determined in cross-sectional data of the discovery and validation cohorts. The 5-year longitudinal changes in ILDvol% were calculated in discovery cohort patients who underwent baseline and follow-up CT scans. Results: ILAs were found in 32 (14%) and 15 (10%) patients with COPD in the discovery (n = 234) and validation (n = 153) cohorts, respectively. ILDvol% was higher in patients with ILAs than in those without ILA in both cohorts. The optimal ILDvol% threshold in the discovery cohort was 1.203%, and good sensitivity and specificity (93.3% and 76.3%) were confirmed in the validation cohort. 124 patients took follow-up CT scan during 5 ± 1 years. 8 out of 124 patients (7%) developed ILAs. In a multivariable model, an increase in ILDvol% was associated with ILA development after adjusting for age, sex, BMI, and smoking exposure. Conclusion: AI-based CT quantification of ILDvol% may be a reproducible method for identifying and monitoring ILAs in patients with COPD.

DOI： 10.1186/s12890-024-03002-z

Web of Science

Scopus

PubMed

Language：Others   Publishing type：Research paper (scientific journal)  

肺のCT画像から，気道の幾何的な特徴を位相データ解析の手法を用いて抽出し，それが臨床データと相関することを示した．

DOI： 10.1109/tmi.2024.3376683

Language：Others  

Sharing extensive healthcare information is essential for the advancement of medicine and the formulation of effective public health policies. However, it often contains sensitive or personal information, or trade secrets. Certain safety measures are needed to strike a balance between the sharing of data and the protection of such information. A firewallFirewall is one of the major safety measures designed to prevent the delivery of protected information by severing harmful connections or limiting the formation of new connections between relevant parties in an information exchange network. Although very simple models suggest firewallFirewall vulnerabilities, such models often oversimplify real-world scenarios, neglecting factors like internal connections among nodes and the influence of other information held by nodes. Therefore, we propose several improved models and use them to explore some of the reasons why firewalls fail. Our study finds that firewallsFirewall are less effective as the number of network nodes increases, and that both high- and low-degree nodes pose non-negligible risks. The study also raises awareness about the role of internal monitors in preventing leaks. The effectiveness of information leakage control could be increased with the monitor's proximity to the information source. This necessitates a greater focus on internal monitoring, perhaps using information and communication technology.

DOI： 10.1007/978-981-99-6540-3_10

Language：Others   Publishing type：Research paper (scientific journal)  

This paper presents an algorithmic approach for the conceptual design of architectural surfaces represented by triangulated meshes. Specifically, we propose a method to optimise a surface according to user-specified geometric properties including the distribution of the Gaussian curvature and preferable boundary location. Designing a surface manually with specific Gaussian curvatures can be a time-consuming task, and the proposed method automates this task. Also, in the proposed approach, the resulting mesh could be encouraged to form a regular tessellation or kept close to those of the initial one. Our method relies on the idea in computational conformal geometry called circle packing and the discrete Ricch energy, which have been used for surface modelling. We develop a least-squares-based optimisation scheme by introducing a variant of the Ricci energy to accommodate flexibility in specifying design constraints such as boundary locations and convexity of the spanned surface, which are essential to architectural applications. We provide an open-source implementation of our method in Python. 11 Our codes are publicly available at https://github.com/shizuo-kaji/ricci_flow.

DOI： 10.1080/13467581.2023.2229407

Language：English   Publisher：エルゼビア・ジャパン(株)  

日本人被験者のCTにおける総肺容積(TLV)推定に対する、Multi-Ethnic Study of Atherosclerosis(MESA)式の使用可能性を調査し、必要に応じて同式の最適化を行って肺過膨張を伴う慢性閉塞性肺疾患(COPD)患者の特性を評価した。40歳以上の非喫煙無症状肺癌スクリーニングCTを実施した群783名(男性303名、女性480名、平均57.0±9.8歳)を被験者としてMESA式の検証と最適化を行い、COPD群199例(男性186例、女性13例、平均72.7±8.2歳)でその適用性を調査した。測定したTLV値は、「アジア人(中国人)」の予測TLV値よりも一貫して高かった。元のMESA式に基づく予測値で説明される分散(R2)は0.60であった。元のMESA式は、年齢、性別、身長、BMIは調整せずにスケーリング係数を調整して二乗平均平方根誤差(RMSE)を最小化するように最適化し、その結果、RMSEは714mLから637mLに変化した。COPDコホートでは、肺過膨張が60例(30%)で観察され、中心小葉性気腫および吸気/呼気CTでのエアートラッピングと関連していた。MESA式を修正して、日本人中高年者のCTにおける基準肺容積を計算した。

Language：English   Publisher：The Japan Society for Industrial and Applied Mathematics  

<p>Numerical simulation of the one-dimensional advection equations is known to be difficult with discontinuous initial states. The initial shape undergoes distortion due to high-frequency fluctuations, exemplifying a prevalent challenge in discretizing dynamics: the violation of conservation laws. In addressing this issue, our study introduces a topological regularization method for numerical simulations, leveraging persistent homology. The effectiveness of our approach is demonstrated through numerical simulations of the one-dimensional advection equation with a rectangular initial state. The results highlight the potential of our method to improve the accuracy and fidelity of simulations, especially in scenarios where maintaining topological conservation is critical.</p>

DOI： 10.14495/jsiaml.16.53

CiNii Research

Language：English   Publishing type：Research paper (scientific journal)  

BACKGROUND: Effective use of lung volume data measured on computed tomography (CT) requires reference values for specific populations. This study examined whether an equation previously generated for multiple ethnic groups in the United States, including Asians predominantly composed of Chinese people, in the Multi-Ethnic Study of Atherosclerosis (MESA) could be used for Japanese people and, if necessary, to optimize this equation. Moreover, the equation was used to characterize patients with chronic obstructive pulmonary disease (COPD) and lung hyperexpansion. METHODS: This study included a lung cancer screening CT cohort of asymptomatic never smokers aged ≥40 years from two institutions (n = 364 and 419) to validate and optimize the MESA equation and a COPD cohort (n = 199) to test its applicability. RESULTS: In all asymptomatic never smokers, the variance explained by the predicted values (R2) based on the original MESA equation was 0.60. The original equation was optimized to minimize the root mean squared error (RMSE) by adjusting the scaling factor but not the age, sex, height, or body mass index terms of the equation. The RMSE changed from 714 ml in the original equation to 637 ml in the optimized equation. In the COPD cohort, lung hyperexpansion, defined based on the 95th percentile of the ratio of measured lung volume to predicted lung volume in never smokers (122 %), was observed in 60 (30 %) patients and was associated with centrilobular emphysema and air trapping on inspiratory/expiratory CT. CONCLUSIONS: The MESA equation was optimized for Japanese middle-aged and elderly adults.

DOI： 10.1016/j.resinv.2023.12.004

Web of Science

Web of Science

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s13160-023-00580-z

Language：English   Publishing type：Research paper (scientific journal)  

BACKGROUND: Physiological and prognostic associations of centrilobular emphysema (CLE) and paraseptal emphysema (PSE) in smokers with and without chronic obstructive pulmonary disease (COPD) have been increasingly recognized, but the associations with extrapulmonary abnormalities, such as muscle wasting, osteoporosis, and cardiovascular diseases, remain unestablished. OBJECTIVES: The aim of the study was to investigate whether CLE was associated with extrapulmonary abnormalities independent of concomitant PSE in smokers without airflow limitation. METHODS: This retrospective study consecutively enrolled current smokers without airflow limitation who underwent lung cancer screening with computed tomography and spirometry. CLE and PSE were visually identified based on the Fleischner Society classification system. Cross-sectional areas of pectoralis muscles (PM) and adjacent subcutaneous adipose tissue (SAT), bone mineral density (BMD), and coronary artery calcification (CAC) were evaluated. RESULTS: Of 310 current smokers without airflow limitation, 83 (26.8%) had CLE. The PSE prevalence was higher (67.5% vs. 23.3%), and PM area, SAT area, and BMD were lower in smokers with CLE than in those without (PM area (mean), 34.5 versus 38.6 cm2; SAT area (mean), 29.3 versus 36.8 cm2; BMD (mean), 158.3 versus 178.4 Hounsfield unit), while CAC presence did not differ. In multivariable models, CLE was associated with lower PM area but not with SAT area or BMD, after adjusting for PSE presence, demographics, and forced expiratory volume in 1 s. CONCLUSIONS: The observed association between CLE and lower PM area suggests that susceptibility to skeletal muscle loss could be high in smokers with CLE even without COPD.

DOI： 10.1159/000529031

Language：English   Publishing type：Research paper (scientific journal)  

Abstract

Cellular senescence caused by oncogenic stimuli is associated with the development of various age-related pathologies through the senescence-associated secretory phenotype (SASP). SASP is mediated by the activation of cytoplasmic nucleic acid sensors. However, the molecular mechanism underlying the accumulation of nucleotide ligands in senescent cells is unclear. In this study, we revealed that the expression of RNaseH2A, which removes ribonucleoside monophosphates (rNMPs) from the genome, is regulated by E2F transcription factors, and it decreases during cellular senescence. Residual rNMPs cause genomic DNA fragmentation and aberrant activation of cytoplasmic nucleic acid sensors, thereby provoking subsequent SASP factor gene expression in senescent cells. In addition, RNaseH2A expression was significantly decreased in aged mouse tissues and cells from individuals with Werner syndrome. Furthermore, RNaseH2A degradation using the auxin-inducible degron system induced the accumulation of nucleotide ligands and induction of certain tumourigenic SASP-like factors, promoting the metastatic properties of colorectal cancer cells. Our results indicate that RNaseH2A downregulation provokes SASP through nucleotide ligand accumulation, which likely contributes to the pathological features of senescent, progeroid, and cancer cells.

DOI： 10.1038/s42003-022-04369-7

Language：English   Publishing type：Research paper (scientific journal)  

Dysanapsis, a mismatch between airway tree caliber and lung size, contributes to a large variation in lung function on spirometry in healthy subjects. However, it remains unclear whether other morphological features of the airway tree could be associated with the variation in lung function independent of dysanapsis. This study used lung cancer screening chest computed tomography (CT) and spirometry data from asymptomatic never smokers. Dysanapsis and the complexity of airway tree geometry were quantified on CT by measuring airway to lung ratio (ALR) and airway fractal dimension (AFD). Moreover, total airway count (TAC), ratio of airway luminal surface area to volume (SA/V), longitudinal tapering and irregularity of the radius of the internal lumen from the central to peripheral airways (Tapering index and Irregularity index) were quantified. In 431 asymptomatic never smokers without a history of lung diseases, lower ALR was associated with lower forced expiratory volume in 1 sec (FEV1) and FEV1/forced vital capacity (FEV1/FVC). The associations of ALR with AFD and TAC (r = 0.41 and 0.13) were weaker than the association between TAC and AFD (r = 0.64). In multivariable models adjusted for age, sex, height, and mean lung density, lower AFD and TAC were associated with lower FEV1 and FEV1/FVC independent of ALR, whereas SA/V and Tapering index were not. These results suggest that the smaller airway tree relative to a given lung size and the lower complexity of airway tree shape, including lower branch count, are independently associated with lower lung function in healthy subjects.

DOI： 10.1152/japplphysiol.00385.2022

Language：English   Publishing type：Research paper (other academic)  

Alexandrov Puzzle

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1145/3528233.3530703

Language：English   Publishing type：Research paper (scientific journal)  

BACKGROUND: There is considerable heterogeneity among patients with emphysematous chronic obstructive pulmonary disease (COPD). We hypothesised that in addition to emphysema severity, ventilation distribution in emphysematous regions would be associated with clinical-physiological impairments in these patients. OBJECTIVE: To evaluate whether the discordance between respiratory volume change distributions (from expiration to inspiration) in emphysematous and non-emphysematous regions affects COPD outcomes using two cohorts. METHODS: Emphysema was quantified using a low attenuation volume percentage on inspiratory CT (iLAV&#37;). Local respiratory volume changes were calculated using non-rigidly registered expiratory/inspiratory CT. The Ventilation Discordance Index (VDI) represented the log-transformed Wasserstein distance quantifying discordance between respiratory volume change distributions in emphysematous and non-emphysematous regions. RESULTS: Patients with COPD in the first cohort (n=221) were classified into minimal emphysema (iLAV&#37; <10&#37;; n=113) and established emphysema with high VDI and low VDI groups (n=46 and 62, respectively). Forced expiratory volume in 1 s (FEV1) was lower in the low VDI group than in the other groups, with no difference between the high VDI and minimal emphysema groups. Higher iLAV&#37;, more severe airway disease and hyperventilated emphysematous regions in the upper-middle lobes were independently associated with lower VDI. The second cohort analyses (n=93) confirmed these findings and showed greater annual FEV1 decline and higher mortality in the low VDI group than in the high VDI group independent of iLAV&#37; and airway disease on CT. CONCLUSION: Lower VDI is associated with severe airflow limitation and higher mortality independent of emphysema severity and airway morphological changes in patients with emphysematous COPD.

DOI： 10.1136/thoraxjnl-2021-218288

Language：English  

Given two correlated systems, detecting causality between them from observed data is an important but challenging task. Combining two mathematical techniques, delay coordinate embedding and persistent homology, we propose a novel causal inference method for data comprising a pair of scalar time series that are observed from two possibly coupled deterministic dynamical systems. The idea is to encode the topology of the dynamics in the form of the persistent homology of the reconstructed attractors and compare the involved systems by a metric defined on the persistent homology.

DOI： 10.14495/jsiaml.14.69

Language：English   Publishing type：Research paper (scientific journal)  

Purpose In recent years, deep learning-based image processing has emerged as a valuable tool for medical imaging owing to its high performance. However, the quality of deep learning-based methods heavily relies on the amount of training data; the high cost of acquiring a large data set is a limitation to their utilization in medical fields. Herein, based on deep learning, we developed a computed tomography (CT) modality conversion method requiring only a few unsupervised images. Methods The proposed method is based on cycle-consistency generative adversarial network (CycleGAN) with several extensions tailored for CT images, which aims at preserving the structure in the processed images and reducing the amount of training data. This method was applied to realize the conversion of megavoltage computed tomography (MVCT) to kilovoltage computed tomography (kVCT) images. Training was conducted using several data sets acquired from patients with head and neck cancer. The size of the data sets ranged from 16 slices (two patients) to 2745 slices (137 patients) for MVCT and 2824 slices (98 patients) for kVCT. Results The required size of the training data was found to be as small as a few hundred slices. By statistical and visual evaluations, the quality improvement and structure preservation of the MVCT images converted by the proposed model were investigated. As a clinical benefit, it was observed by medical doctors that the converted images enhanced the precision of contouring. Conclusions We developed an MVCT to kVCT conversion model based on deep learning, which can be trained using only a few hundred unpaired images. The stability of the model against changes in data size was demonstrated. This study promotes the reliable use of deep learning in clinical medicine by partially answering commonly asked questions, such as "Is our data sufficient?" and "How much data should we acquire?"

DOI： 10.1002/mp.15626

Language：English   Publishing type：Research paper (scientific journal)  

The newly coined term supoza (giving up mathematics) describes a critical social issue that needs to be addressed in South Korea's educational policy. Although the term has not received precise definition, it refers to students who have given up on learning mathematics. A precise definition would require detailing the current supoza situation and identifying its characteristics. This study therefore conducted a statistical investigation of commonalities among students who have given up on learning mathematics; the study results revealed that these students can be characterized by their affective domain for mathematics learning. We found that a statistical model could determine the likelihood that a particular student would report having given up mathematics based on responses to questions related to the affective domain of mathematics learning. This aspect suggests the possibility of understanding supoza with the exclusive use of affective factors and emphasizes the significance of the affective domain of mathematics learning. Additionally, this study provides a working example to show how exploratory analysis using big data can be used in relation to mathematical education.

DOI： 10.1007/s12564-021-09709-6

Language：Others   Publishing type：Research paper (scientific journal)  

The analysis of the movement of people in a shopping area with the aim of improving marketing is an important research topic. Many conventional methods are dependent on the density of people in the area, which is easily estimated by counting the people entering or exiting the area. However, a high density does not always mean an increase in activity, as certain people are simply passing the area at a given time. The primary goal of this study was to introduce a set of indicators for measuring the bustle of the area, which we call 'Nigiwai,' from pedestrian movement by using an analogy from classical kinematics. Such indicators can be used to measure the impact of promotional events and to optimize the design of the area. Our novel indicators were evaluated with simulated pedestrian scenarios and were demonstrated to distinguish shopping scenarios from those in which people move around without shopping successfully, even when the latter scenarios had much higher densities. The indicators were computed solely from the pedestrian trajectory, which can easily be obtained from ordinary sensors using deep learning-based techniques. As a demonstration with real data, we applied our method to a video of a street and provided a visualization of the indicators.

DOI： 10.1109/access.2021.3056698

Language：English   Publishing type：Research paper (scientific journal)  

Chest computed tomography (CT) is used to screen for lung cancer and evaluate pulmonary and extra-pulmonary abnormalities such as emphysema and coronary artery calcification, particularly in smokers. In real-world practice, lung abnormalities are visually assessed using high-contrast thin-slice images which are generated from raw scan data using sharp reconstruction kernels with the sacrifice of increased image noise. In contrast, accurate CT quantification requires low-contrast thin-slice images with low noise, which are generated using soft reconstruction kernels. However, only sharp-kernel thin-slice images are archived in many medical facilities due to limited data storage space. This study aimed to establish deep neural network (DNN) models to convert sharp-kernel images to soft-kernel-like images with a final goal to reuse historical chest CT images for robust quantitative measurements, particularly in completed previous longitudinal studies. By using pairs of sharp-kernel (input) and soft-kernel (ground-truth) images from 30 patients with chronic obstructive pulmonary disease (COPD), DNN models were trained. Then, the accuracy of kernel conversion based on the established DNN models was evaluated using CT from independent 30 smokers with and without COPD. Consequently, differences in CT values between new images converted from sharp-kernel images using the established DNN models and ground-truth soft-kernel images were comparable with the inter-scans variability derived from repeated phantom scans (6 times), showing that the conversion error was the same level as the measurement error of the CT device. Moreover, the Dice coefficients to quantify the similarity between low attenuation voxels on given images and the ground-truth soft-kernel images were significantly higher on the DNN-converted images than the Gaussian-filtered, median-filtered, and sharp-kernel images (p < 0.001). There were good agreements in quantitative measurements of emphysema, intramuscular adipose tissue, and coronary artery calcification between the converted and the ground-truth soft-kernel images. These findings demonstrate the validity of the new DNN model for kernel conversion and the clinical applicability of soft-kernel-like images converted from archived sharp-kernel images in previous clinical studies. The presented method to evaluate the validity of the established DNN model using repeated scans of phantom could be applied to various deep learning-based image conversions for robust quantitative evaluation.

DOI： 10.3389/frai.2021.769557

Language：English   Publishing type：Research paper (other academic)  

Lattice problems are a class of optimization problems that are notably hard. There are no classical or quantum algorithms known to solve these problems efficiently. Their hardness has made lattices a major cryptographic primitive for post-quantum cryptography. Several different approaches have been used for lattice problems with different computational profiles; some suffer from super-exponential time, and others require exponential space. This motivated us 10 develop a novel lattice problem solver, CMAP-LAP, based on the clever coordination of different algorithms that run massively in parallel. With our flexible framework, heterogeneous modules run asynchronously in parallel on a large-scale distributed system while exchanging information, which drastically boosts the overall performance. We also implement full checkpoint-and-restart functionality, which is vital to high-dimensional lattice problems. CMAP-LAP facilitates the implementation of large-scale parallel strategies for lattice problems since all the functions are designed to he customizable and abstract. Through numerical experiments with up to 103,680 cores, we evaluated the performance and stability of our system and demonstrated its high capability for future massive-scale experiments.

DOI： 10.1109/HiPC53243.2021.00018

Language：English   Publishing type：Research paper (other academic)  

A distribution on the permutations over a fixed finite set is called a ranking distribution. Modelling ranking distributions is one of the major topics in preference learning as such distributions appear as the ranking data produced by many judges. In this paper, we propose a geometric model for ranking distributions. Our idea is to use hyper-surface arrangements in a metric space as the representation space, where each component cut out by hyper-surfaces corresponds to a total ordering, and its volume is proportional to the probability. In this setting, the union of components corresponds to a partial ordering and its probability is also estimated by the volume. Similarly, the probability of a partial ordering conditioned by another partial ordering is estimated by the ratio of volumes. We provide a simple iterative algorithm to fit our model to a given dataset. We show our model can represent the distribution of a real-world dataset faithfully and can be used for prediction and visualisation purposes.

DOI： 10.1145/3447548.3467253

Language：English   Publishing type：Research paper (scientific journal)  

Three-dimensional imaging is essential to evaluate local abnormalities and understand structure-function relationships in an organ. However, quantifiable and interpretable methods to localize abnormalities remain unestablished. Visual assessments are prone to bias, machine learning methods depend on training images, and the underlying decision principle is usually difficult to interpret. Here, we developed a homological approach to mathematically define emphysema and fibrosis in the lungs on computed tomography (CT). Using persistent homology, the density of homological features, including connected components, tunnels, and voids, was extracted from the volumetric CT scans of lung diseases. A pair of CT values at which each homological feature appeared (birth) and disappeared (death) was computed by sweeping the threshold levels from higher to lower CT values. Consequently, fibrosis and emphysema were defined as voxels with dense voids having a longer lifetime (birth-death difference) and voxels with dense connected components having a lower birth, respectively. In an independent dataset including subjects with idiopathic pulmonary fibrosis (IPF), chronic obstructive pulmonary disease (COPD), and combined pulmonary fibrosis and emphysema (CPFE), the proposed definition enabled accurate segmentation with comparable quality to deep learning in terms of Dice coefficients. Persistent homology-defined fibrosis was closely associated with physiological abnormalities such as impaired diffusion capacity and long-term mortality in subjects with IPF and CPFE, and persistent homology-defined emphysema was associated with impaired diffusion capacity in subjects with COPD. The present persistent homology-based evaluation of structural abnormalities could help explore the clinical and physiological impacts of structural changes and morphological mechanisms of disease progression.

DOI： 10.1152/japplphysiol.00150.2021

Language：Others   Publishing type：Research paper (other academic)  

Lattice-based cryptography has received attention as a next-generation encryption technique, because it is believed to be secure against attacks by classical and quantum computers. Its essential security depends on the hardness of solving the shortest vector problem (SVP). In the cryptography, to determine security levels, it is becoming significantly more important to estimate the hardness of the SVP by high-performance computing. In this study, we develop the world's first distributed and asynchronous parallel SVP solver, the MAssively Parallel solver for SVP (MAP-SVP). It can parallelize algorithms for solving the SVP by applying the Ubiquity Generator framework, which is a generic framework for branch-and-bound algorithms. The MAP-SVP is suitable for massive-scale parallelization, owing to its small memory footprint, low communication overhead, and rapid checkpoint and restart mechanisms. We demonstrate its performance and scalability of the MAP-SVP by using up to 100,032 cores to solve instances of the Darmstadt SVP Challenge.

DOI： 10.1109/sc41405.2020.00064

Language：English   Publishing type：Research paper (scientific journal)  

To date, many gait generation strategies have been designed for robots with leg configurations that model those of natural creatures. However, their leg configurations are limited to the &#36;2 imes N&#36; type, such as hexapod or myriapod; hence, simultaneously, the potential ability of legged robots is implicitly limited. We consider single-legged modular robots that can be arranged to form a cluster with arbitrary 2-D leg configurations. By choosing configurations appropriately, these robots have the potential to perform several types of tasks, as is the case for reconfigurable modular robots. However, to use appropriate configurations for a given task, a unified gait generation system for various configurations of a cluster is required. In this article, we propose an autonomous distributed control system for each single-legged modular robot to collectively achieve static walking of the cluster with various leg configurations on planar ground. Moreover, our system is an autonomous distributed system with scalability and fault tolerance, in which each module determines the moving pattern of its foot through local communication without global information, such as the entire leg configuration of the cluster. We verified that several types of clusters achieved static walking using our system not only in dynamic simulations, but also in real robot experiments.

DOI： 10.1109/TRO.2020.2992983

Language：English   Publishing type：Research paper (scientific journal)  

In this study, we developed the world's first artificial intelligence (AI) system that assesses the dysplasia of blood cells on bone marrow smears and presents the result of AI prediction for one of the most representative dysplasia-decreased granules (DG). We photographed field images from the bone marrow smears from patients with myelodysplastic syndrome (MDS) or non-MDS diseases and cropped each cell using an originally developed cell detector. Two morphologists labelled each cell. The degree of dysplasia was evaluated on a four-point scale: 0-3 (e.g., neutrophil with severely decreased granules were labelled DG3). We then constructed the classifier from the dataset of labelled images. The detector and classifier were based on a deep neural network pre-trained with natural images. We obtained 1797 labelled images, and the morphologists determined 134 DGs (DG1: 46, DG2: 77, DG3: 11). Subsequently, we performed a five-fold cross-validation to evaluate the performance of the classifier. For DG1-3 labelled by morphologists, the sensitivity, specificity, positive predictive value (PPV), negative predictive value (NPV), and accuracy were 91.0&#37;, 97.7&#37;, 76.3&#37;, 99.3&#37;, and 97.2&#37;, respectively. When DG1 was excluded in the process, the sensitivity, specificity, PPV, NPV, and accuracy were 85.2&#37;, 98.9&#37;, 80.6&#37;, and 99.2&#37; and 98.2&#37;, respectively.

DOI： 10.1038/s41598-020-71752-x

Language：English   Publishing type：Research paper (scientific journal)  

PURPOSE: Cone-beam computed tomography (CBCT) offers advantages over conventional fan-beam CT in that it requires a shorter time and less exposure to obtain images. However, CBCT images suffer from low soft-tissue contrast, noise, and artifacts compared to conventional fan-beam CT images. Therefore, it is essential to improve the image quality of CBCT. METHODS: In this paper, we propose a synthetic approach to translate CBCT images with deep neural networks. Our method requires only unpaired and unaligned CBCT images and planning fan-beam CT (PlanCT) images for training. The CBCT images and PlanCT images may be obtained from other patients as long as they are acquired with the same scanner settings. Once trained, three-dimensionally reconstructed CBCT images can be directly translated into high-quality PlanCT-like images. RESULTS: We demonstrate the effectiveness of our method with images obtained from 20 prostate patients, and provide a statistical and visual comparison. The image quality of the translated images shows substantial improvement in voxel values, spatial uniformity, and artifact suppression compared to those of the original CBCT. The anatomical structures of the original CBCT images were also well preserved in the translated images. CONCLUSIONS: Our method produces visually PlanCT-like images from CBCT images while preserving anatomical structures.

DOI： 10.1002/mp.13963

Language：English   Publishing type：Research paper (scientific journal)  

In this article we introduce flag Bott manifolds of general Lie type as the total spaces of iterated flag bundles. They generalize the notion of flag Bott manifolds and generalized Bott manifolds, and admit nice torus actions. We calculate the torus equivariant cohomology rings of flag Bott manifolds of general Lie type.

DOI： 10.4310/HHA.2020.v22.n1.a21

Language：English   Publishing type：Research paper (scientific journal)  

Linkage Mechanisms Governed by Integrable Deformations of Discrete Space Curves
A linkage mechanism consists of rigid bodies assembled by joints which can be used to translate and transfer motion from one form in one place to another. In this paper, we are particularly interested in a family of spacial linkage mechanisms which consist of n-copies of a rigid body joined together by hinges to form a ring. Each hinge joint has its own axis of revolution and rigid bodies joined to it can be freely rotated around the axis. The family includes the famous threefold symmetric Bricard6R linkage also known as the Kaleidocycle, which exhibits a characteristic "turning over" motion. We can model such a linkage as a discrete closed curve in ℝ3 with a constant torsion up to sign. Then, its motion is described as the deformation of the curve preserving torsion and arc length. We describe certain motions of this object that are governed by the semi-discrete mKdV equations, where infinitesimally the motion of each vertex is confined in the osculating plane.

Language：English   Publishing type：Research paper (other academic)  

Seeing is believing. Our novel virtual reality system, Polyvision, applies this old saying to the fourth dimension. Various shadows of an object in a four-dimensional (4D) space are simultaneously projected onto multiple three-dimensional (3D) screens created in a virtual environment to reveal its intricate shape. The understanding of high-dimensional shapes and data can essentially be enhanced when good visualization is complemented by interactive functionality. However, a method to implement an interface for handling complex 4D transformations in a user-friendly manner must be developed. Using our Polyvision system, the user can manipulate each shadow as if it were a 3D object in their hand. The user’s action on each projection is reflected to the original 4D object, and in turn its projections, in real time. While controlling the object’s orientation minutely on one shadow, the user can grasp its global structure from multiple changing projections. Our system has a wide variety of applications in visualization, education, mathematical research, and entertainment, as we demonstrate with a variety of 4D objects that appear in mathematics and data sciences.

DOI： 10.1145/3355049.3360518

Language：English   Publishing type：Research paper (scientific journal)  

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand, Wang tiles are used as a tool to generate textures and patterns in computer graphics. In these applications, a set of tiles is normally chosen so that it tiles the plane or its sub-regions easily in many different ways. With computer graphics applications in mind, we introduce a class of such tileset, which we call sequentially permissive tilesets, and consider tiling problems with constrained boundary. We apply our methodology to a special set of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2016 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.

DOI： 10.1007/s13160-019-00369-z

Language：English   Publishing type：Research paper (scientific journal)  

Since the advent of deep convolutional neural networks (DNNs), computer vision has seen an extremely rapid progress that has led to huge advances in medical imaging. Every year, many new methods are reported at conferences such as the International Conference on Medical Image Computing and Computer-Assisted Intervention and Machine Learning for Medical Image Reconstruction, or published online at the preprint server arXiv. There is a plethora of surveys on applications of neural networks in medical imaging (see [1] for a relatively recent comprehensive survey). This article does not aim to cover all aspects of the field, but focuses on a particular topic, image-to-image translation. Although the topic may not sound familiar, it turns out that many seemingly irrelevant applications can be understood as instances of image-to-image translation. Such applications include (1) noise reduction, (2) super-resolution, (3) image synthesis, and (4) reconstruction. The same underlying principles and algorithms work for various tasks. Our aim is to introduce some of the key ideas on this topic from a uniform viewpoint. We introduce core ideas and jargon that are specific to image processing by use of DNNs. Having an intuitive grasp of the core ideas of applications of neural networks in medical imaging and a knowledge of technical terms would be of great help to the reader for understanding the existing and future applications. Most of the recent applications which build on image-to-image translation are based on one of two fundamental architectures, called pix2pix and CycleGAN, depending on whether the available training data are paired or unpaired (see Sect. 1.3). We provide codes ([2, 3]) which implement these two architectures with various enhancements. Our codes are available online with use of the very permissive MIT license. We provide a hands-on tutorial for training a model for denoising based on our codes (see Sect. 6). We hope that this article, together with the codes, will provide both an overview and the details of the key algorithms and that it will serve as a basis for the development of new applications.

DOI： 10.1007/s12194-019-00520-y

Language：Others   Publishing type：Research paper (scientific journal)  

© 2019, The JJIAM Publishing Committee and Springer Japan KK, part of Springer Nature. The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand, Wang tiles are used as a tool to generate textures and patterns in computer graphics. In these applications, a set of tiles is normally chosen so that it tiles the plane or its sub-regions easily in many different ways. With computer graphics applications in mind, we introduce a class of such tileset, which we call sequentially permissive tilesets, and consider tiling problems with constrained boundary. We apply our methodology to a special set of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2016 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.

DOI： 10.1007/s13160-019-00369-z

Language：English   Publishing type：Research paper (scientific journal)  

Since the advent of deep convolutional neural networks (DNNs), computer vision has seen an extremely rapid progress that has led to huge advances in medical imaging. Every year, many new methods are reported at conferences such as the International Conference on Medical Image Computing and Computer-Assisted Intervention and Machine Learning for Medical Image Reconstruction, or published online at the preprint server arXiv. There is a plethora of surveys on applications of neural networks in medical imaging (see [1] for a relatively recent comprehensive survey). This article does not aim to cover all aspects of the field, but focuses on a particular topic, image-to-image translation. Although the topic may not sound familiar, it turns out that many seemingly irrelevant applications can be understood as instances of image-to-image translation. Such applications include (1) noise reduction, (2) super-resolution, (3) image synthesis, and (4) reconstruction. The same underlying principles and algorithms work for various tasks. Our aim is to introduce some of the key ideas on this topic from a uniform viewpoint. We introduce core ideas and jargon that are specific to image processing by use of DNNs. Having an intuitive grasp of the core ideas of applications of neural networks in medical imaging and a knowledge of technical terms would be of great help to the reader for understanding the existing and future applications. Most of the recent applications which build on image-to-image translation are based on one of two fundamental architectures, called pix2pix and CycleGAN, depending on whether the available training data are paired or unpaired (see Sect. 1.3). We provide codes ([2, 3]) which implement these two architectures with various enhancements. Our codes are available online with use of the very permissive MIT license. We provide a hands-on tutorial for training a model for denoising based on our codes (see Sect. 6). We hope that this article, together with the codes, will provide both an overview and the details of the key algorithms and that it will serve as a basis for the development of new applications.

DOI： 10.1007/s12194-019-00520-y

Language：Others   Publishing type：Research paper (scientific journal)  

© Edinburgh Mathematical Society 2019. Given a root system, the Weyl chambers in the co-weight lattice give rise to a real toric variety, called the real toric variety associated with the Weyl chambers. We compute the integral cohomology groups of real toric varieties associated with the Weyl chambers of type Cn and Dn, completing the computation for all classical types.

DOI： 10.1017/S001309151800086X

Language：English   Publishing type：Research paper (scientific journal)  

One of the common ways to design secure multi-party computation is twofold: To realize secure fundamental operations and to decompose a target function to be securely computed into them. In the setting of fully homomorphic encryption, as well as some kinds of secret sharing, the fundamental operations are additions and multiplications in the base field such as the field F₂ with two elements. Then the second decomposition part, which we study in this paper, is (in theory) equivalent to expressing the target function as a polynomial. It is known that any function over the finite prime field F_p has a unique polynomial expression of degree at most p-1 with respect to each input variable; however, there has been little study done concerning such minimal-degree polynomial expressions for practical functions. This paper aims at triggering intensive studies on this subject, by focusing on polynomial expressions of some auction-related functions such as the maximum/minimum and the index of the maximum/minimum value among input values.

DOI： 10.1515/jmc-2018-0016

Language：English   Publishing type：Research paper (scientific journal)  

One of the common ways to design secure multi-party computation is twofold: to realize secure fundamental operations and to decompose a target function to be securely computed into them. In the setting of fully homomorphic encryption, as well as some kinds of secret sharing, the fundamental operations are additions and multiplications in the base field such as the field F-2 with two elements. Then the second decomposition part, which we study in this paper, is (in theory) equivalent to expressing the target function as a polynomial. It is known that any function over the finite prime field F-p has a unique polynomial expression of degree at most p - 1 with respect to each input variable; however, there has been little study done concerning such minimal-degree polynomial expressions for practical functions. This paper aims at triggering intensive studies on this subject, by focusing on polynomial expressions of some auction-related functions such as the maximum/minimum and the index of the maximum/minimum value among input values.

DOI： 10.1515/jmc-2018-0016

Language：English   Publishing type：Research paper (scientific journal)  

If G is a compact connected Lie group and T is a maximal torus, we give a wedge decomposition of ΣG/T by identifying families of idempotents in cohomology. This is used to give new information on the self-maps of G/T.

DOI： 10.1007/s10114-019-8051-z

Language：English   Publishing type：Research paper (scientific journal)  

If G is a compact connected Lie group and T is a maximal torus, we give a wedge decomposition of sigma G/T by identifying families of idempotents in cohomology. This is used to give new information on the self-maps of G/T.

DOI： 10.1007/s10114-019-8051-z

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-981-13-2850-3

Language：English   Publishing type：Research paper (scientific journal)  

The zero locus of a generic section of a vector bundle over a manifold defines a submanifold. A classical problem in geometry asks to realise a specified submanifold in this way. We study two cases: a point in a generalised flag manifold and the diagonal in the direct product of two copies of a generalised flag manifold. These cases are particularly interesting since they are related to ordinary and equivariant Schubert polynomials, respectively.

DOI： 10.2140/agt.2019.19.2061

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.jtbi.2017.12.013

Language：English   Publishing type：Research paper (scientific journal)  

Many discrete models of biological networks rely exclusively on Boolean variables and many tools and theorems are available for analysis of strictly Boolean models. However, multilevel variables are often required to account for threshold effects, in which knowledge of the Boolean case does not generalise straightforwardly. This motivated the development of conversion methods for multilevel to Boolean models. In particular, Van Ham's method has been shown to yield a one-to-one, neighbour and regulation preserving dynamics, making it the de facto standard approach to the problem. However, Van Ham's method has several drawbacks: most notably, it introduces vast regions of "non-admissible" states that have no counterpart in the multilevel, original model. This raises special difficulties for the analysis of interaction between variables and circuit functionality, which is believed to be central to the understanding of dynamic properties of logical models. Here, we propose a new multilevel to Boolean conversion method, with software implementation. Contrary to Van Ham's, our method doesn't yield a one-to-one transposition of multilevel trajectories; however, it maps each and every Boolean state to a specific multilevel state, thus getting rid of the non-admissible regions and, at the expense of (apparently) more complicated, "parallel" trajectories. One of the prominent features of our method is that it preserves dynamics and interaction of variables in a certain manner. As a demonstration of the usability of our method, we apply it to construct a new Boolean counter-example to the well-known conjecture that a local negative circuit is necessary to generate sustained oscillations. This result illustrates the general relevance of our method for the study of multilevel logical models.

DOI： 10.1016/j.jtbi.2017.12.013

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s40062-016-0163-x

Language：English   Publishing type：Research paper (scientific journal)  

The mod 2 Steenrod algebra A(2) can be defined as the quotient of the mod 2 Leibniz-Hopf algebra F-2 by the Adem relations. Dually, the mod 2 dual Steenrod algebra A(2)(*)can be thought of as a sub-Hopf algebra of the mod 2 dual Leibniz-Hopf algebra F-2(*). We study A(2)(*)and F(2)(*)from this viewpoint and give generalisations of some classical results in the literature.

DOI： 10.1007/s40062-016-0163-x

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s40590-016-0090-1

Language：English   Publishing type：Research paper (scientific journal)  

Homotopy decomposition of a suspended real toric space
© 2016, Sociedad Matemática Mexicana. We give p-local homotopy decompositions of the suspensions of real toric spaces for odd primes p. Our decomposition is compatible with the one given by Bahri, Bendersky, Cohen, and Gitler for the suspension of the corresponding real moment-angle complex, or more generally, the polyhedral product. As an application, we obtain a stable rigidity property for real toric spaces.

DOI： 10.1007/s40590-016-0090-1

Language：English   Publishing type：Research paper (scientific journal)  

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.topol.2016.10.008

Language：English   Publishing type：Research paper (scientific journal)  

We determine an upper bound for the number of homotopy associative multiplications on certain H-spaces. This is applied to SU(3) and Sp(2) at odd primes, and to give examples of p-local H-spaces with more than one multiplication but a unique homotopy associative multiplication. (C) 2016 Elsevier B.V. All rights reserved.

DOI： 10.1016/j.topol.2016.10.008

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1137/16M1056936

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-981-10-1076-7_2

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.2140/agt.2015.15.1771

Language：English   Publishing type：Research paper (scientific journal)  

Mod p decompositions of the loop spaces of compact symmetric spaces
© 2015, Mathematical Sciences Publishers. All Rights Reserved. We give p–local homotopy decompositions of the loop spaces of compact, simply connected symmetric spaces for quasi-regular primes. The factors are spheres, sphere bundles over spheres and their loop spaces. As an application, upper bounds for the homotopy exponents are determined.

DOI： 10.2140/agt.2015.15.1771

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-4-431-55483-7_6

Language：English   Publishing type：Research paper (international conference proceedings)  

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1142/S0129054115500100

Language：English   Publishing type：Research paper (scientific journal)  

In this paper, we specify a class of mathematical problems, which we refer to as "Function Density Problems" (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1.), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introduced by Dubrov and Ishai (STOC 2006). Our argument aims at proposing new theoretical frameworks for these topics (especially for the former) based on FDPs, rather than providing some concrete and practical results on the topics. We also give some examples of mathematical discussions on FDFs, which would be of independent interest from mathematical viewpoints. Finally, we discuss possible directions of future research on other cryptographic applications of FDPs and on mathematical studies on FDPs themselves.

DOI： 10.1142/S0129054115500100

Language：English   Publishing type：Research paper (scientific journal)  

We consider the class of manifolds with compact Lie group actions which restrict to GKM-actions on the maximal torus. First, we see their GKM-graphs admit symmetry of the Weyl groups. And then, we study its combinatorial abstraction; starting with abstract GKM-graphs with symmetry, we derive certain properties which reflect topology in a purely combinatorial way.

Language：English   Publishing type：Research paper (scientific journal)  

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-4-431-55007-5_17

Language：English   Publishing type：Research paper (other academic)  

Language：English   Publishing type：Research paper (scientific journal)  

We consider an equivariant extension for Hiller's Schubert calculus on the coinvariant ring of a finite Coxeter group.

DOI： 10.1134/S0081543811080177

Language：English   Publishing type：Research paper (scientific journal)  

We consider an equivariant extension for Hiller's Schubert calculus on the coinvariant ring of a finite Coxeter group.

DOI： 10.1134/S0081543811080177

Language：English   Publishing type：Research paper (other academic)  

The aim of this paper is to emphasize the significance of a certain mathematical problem in research on information security. We point out that the mathematical problem, which we refer to as "Function Density Problem," has connections to the following two major cryptographic topics; security analysis of hash functions in the real world (like SHA-1), and construction of pseudorandom generators with some enhanced security property. We also provide a first example to show how a study of Function Density Problem can contribute to the progress of the above-mentioned two topics. Other potential applications of Function Density Problem to information security are also discussed.

DOI： 10.1007/978-3-642-25141-2_10

Language：English   Publishing type：Research paper (international conference proceedings)  

Repository Public URL： http://hdl.handle.net/2324/4485650

Language：English   Publishing type：Research paper (scientific journal)  

We consider the problem how far from being homotopy commutative is a loop space having the homotopy type of the p-completion of a product of finite numbers of spheres. We determine the homotopy nilpotency of those loop spaces as an answer to this problem.

DOI： 10.1007/s00209-008-0459-6

Language：English   Publishing type：Research paper (scientific journal)  

Homotopy nilpotency in p-regular loop spaces
We consider the problem how far from being homotopy commutative is a loop space having the homotopy type of the p-completion of a product of finite numbers of spheres. We determine the homotopy nilpotency of those loop spaces as an answer to this problem.

DOI： 10.1007/s00209-008-0459-6

Language：English   Publishing type：Research paper (scientific journal)  

We calculate certain Samelson products of Sp (2). Using the result, we classify the homotopy types of the gauge groups of principal Sp (2) bundles over S⁸ and we also derive the homotopy commutativity of Sp (2) localized at 3.

DOI： 10.1016/j.topol.2008.02.008

Language：English   Publishing type：Research paper (scientific journal)  

Samelson products in Sp(2)
We calculate certain Samelson products of Sp(2). Using the result, we classify the homotopy types of the gauge groups of principal Sp(2) bundles over S-8 and we also derive the homotopy commutativity of Sp(2) localized at 3. (C) 2008 Elsevier B.V. All rights reserved.

DOI： 10.1016/j.topol.2008.02.008

Language：English   Publishing type：Research paper (scientific journal)  

We determine the mod 2 cohomology algebra over the Steenrod algebra A ₂ of the classifying space of loop groups LG where G = Spin(7), Spin(8), Spin(9), F₄ and DI(4). Then we show they are isomorphic as algebras over A₂ to the mod 2 cohomology of the 2-compact groups of type G.

DOI： 10.1215/kjm/1250281055

Language：English   Publishing type：Research paper (scientific journal)  

The purpose of this paper is to calculate the cohomology of the function space Map(M, BG) for degree less than or equal to 3, where G is a simply connected compact Lie group and M is a closed orientable 3-manifold. The calculation enables us to obtain a simple proof and an improvement of the result [4, Theorem 1.2].

DOI： 10.2977/prims/1166642116

Language：English   Publishing type：Research paper (scientific journal)  

The purpose of this paper is to calculate the cohomology of the function space Map(M, BG) for degree less than or equal to 3, where G is a simply connected compact Lie group and M is a closed orientable 3-manifold. The calculation enables us to obtain a simple proof and an improvement of the result [4, Theorem 1.2].

DOI： 10.2977/prims/1166642116

Language：English   Publishing type：Research paper (scientific journal)  

In [BG], it is proved that the Whitehead length of a space Z is less than or equal to the nilpotency of ΩZ. As for rational spaces, those two invariants are equal. We show this for a 1-connected rational space Z by giving a way to calculate those invariants from a minimal model for Z. This also gives a way to calculate the nilpotency of an homotopy associative rational H-space.

DOI： 10.2969/jmsj/1150287307

Language：English   Publishing type：Research paper (scientific journal)  

In [BG], it is proved that the Whitehead length of a space Z is less than or equal to the nilpotency of Omega Z. As for rational spaces, those two invariants are equal. We show this for a 1-connected rational space Z by giving a way to calculate those invariants from a minimal model for Z. This also gives a way to calculate the nilpotency of an homotopy associative rational H-space.

DOI： 10.2969/jmsj/1150287307

Event date： 2021.4

Language：Japanese  

Venue：オンライン   Country：Japan  

Event date： 2021.4

Language：Japanese  

Venue：オンライン   Country：Japan  

Event date： 2021.4

Language：English  

Venue：online   Country：Japan  

Event date： 2020.9 - 2021.4

Language：Japanese  

Venue：オンライン   Country：Japan  

Event date： 2020.1

Language：English  

Venue：Kagoshima University   Country：Japan  

Event date： 2020.1

Language：Japanese  

Country：Spain  

Event date： 2020.1

Language：Japanese  

Country：Spain  

Event date： 2020.1

Language：English  

Venue：Massey University   Country：New Zealand  

Event date： 2020.1

Language：English  

Venue：Tokyo Institute of Technology   Country：Japan  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：English  

Language：Others  

Development of an in silico Liquid Crystal Data Library for Predicting and Controlling Phase Transition Behaviors

Language：Others  

Chemical-Data-Driven Validation of Physical Theories of Liquid Crystals

Language：Japanese  

Language：Others  

Language：Others  

Concordant distributions of respiratory volume change in emphysema and non-emphysema regions affects pulmonary function in COPD

Language：Others  

Deep learning-based CT quantification of paraseptal emphysema in patients with chronic obstructive pulmonary disease

Language：Others  

Generation of point defects using twist walls in nematic liquid crystals

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Others  

Language：Others  

Language：Japanese   Publishing type：Book review, literature introduction, etc.  

DOI： https://doi.org/10.6009/jjrt.2020_JSRT_76.11.1207

Language：Japanese   Publishing type：Internal/External technical report, pre-print, etc.  

Language：Japanese  

Language：Japanese  

Language：Japanese   Publishing type：Book review, literature introduction, etc.  

Language：Others  

Language：Japanese   Publishing type：Internal/External technical report, pre-print, etc.  

Language：Japanese   Publishing type：Internal/External technical report, pre-print, etc.  

Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

Language：Others  

Language：English  

Polynomial Expressions of p-ary Auction Functions

Language：English  

Polynomial Expressions of Carries in p-ary Arithmetics

Language：Others  

Language：Japanese   Publishing type：Internal/External technical report, pre-print, etc.  

Language：Japanese   Publishing type：Internal/External technical report, pre-print, etc.  

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Number of participants：209

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Type：Competition, symposium, etc. 

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Other

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：Infants,　Schoolchildren,　Junior students,　High school students

Type：Seminar, workshop