3,349 research outputs found

    GPU acceleration of predictive partitioned vector quantization for ultraspectral sounder data compression

    Get PDF
    [[abstract]]For the large-volume ultraspectral sounder data, compression is desirable to save storage space and transmission time. To retrieve the geophysical paramters without losing precision the ultraspectral sounder data compression has to be lossless. Recently there is a boom on the use of graphic processor units (GPU) for speedup of scientific computations. By identifying the time dominant portions of the code that can be executed in parallel, significant speedup can be achieved by using GPU. Predictive partitioned vector quantization (PPVQ) has been proven to be an effective lossless compression scheme for ultraspectral sounder data. It consists of linear prediction, bit depth partitioning, vector quantization, and entropy coding. Two most time consuming stages of linear prediction and vector quantization are chosen for GPU-based implementation. By exploiting the data parallel characteristics of these two stages, a spatial division design shows a speedup of 72x in our four-GPU-based implementation of the PPVQ compression scheme.[[notice]]補正完畢[[journaltype]]國外[[incitationindex]]SCI[[booktype]]紙本[[countrycodes]]US

    台湾と日本の肝細胞癌患者における解剖学的・非解剖学的肝切除術の手術成績のpropensity解析による比較検討

    Get PDF
    博士(医学) 乙第3095号(主論文の要旨、要約、審査結果の要旨、本文),著者名:Shih-Wei HUANG, Pei-Yi CHU, Shunichi ARIIZUMI, Charles Chung-Wei LIN, Hon Phin WONG, Dev-Aur CHOU, Ming-Tsung LEE, Hsing-Ju WU, Masakazu YAMAMOTO,タイトル:Anatomical Versus Non-anatomical Resection for Hepatocellular Carcinoma, a Propensity-matched Analysis Between Taiwanese and Japanese Patients,掲載誌:In vivo(0258-851X),巻・頁・年:34巻5号 p.2607~2612(2020),著作権関連情報:©2020、International Institute of Anticancer Research(Dr.George J. Delinasios)、All rights reserved.,DOI:10.21873/invivo.12078博士(医学)東京女子医科大

    Constrained K-means and Genetic Algorithm-based Approaches for Optimal Placement of Wireless Structural Health Monitoring Sensors

    Get PDF
    Optimal placement of wireless structural health monitoring (SHM) sensors has to consider modal identification accuracy and power efficiency. In this study, two-tier wireless sensor network (WSN)-based SHM systems with clusters of sensors are investigated to overcome this difficulty. Each cluster contains a number of sensor nodes and a cluster head (CH). The lower tier is composed of sensors communicating with their associated CHs, and the upper tier is composed of the network of CHs. The first step is the optimal placement of sensors in the lower tier via the effective independence method by considering the modal identification accuracy. The second step is the optimal placement of CHs in the upper tier by considering power efficiency. The sensors in the lower tier are partitioned into clusters before determining the optimal locations of CHs in the upper tier. Two approaches, a constrained K-means clustering approach and a genetic algorithm (GA)-based clustering approach, are proposed in this study to cluster sensors in the lower tier by considering two constraints: (1) the maximum data transmission distance of each sensor; (2) the maximum number of sensors in each cluster. Given that each CH can only manage a limited number of sensors, these constraints should be considered in practice to avoid overload of CHs. The CHs in the upper tier are located at the centers of the clusters determined after clustering sensors in the lower tier. The two proposed approaches aim to construct a balanced size of clusters by minimizing the number of clusters (or CHs) and the total sum of the squared distance between each sensor and its associated CH under the two constraints. Accordingly, the energy consumption in each cluster is decreased and balanced, and the network lifetime is extended. A numerical example is studied to demonstrate the feasibility of using the two proposed clustering approaches for sensor clustering in WSN-based SHM systems. In this example, the performances of the two proposed clustering approaches and the K-means clustering method are also compared. The two proposed clustering approaches outperform the K-means clustering method in terms of constructing balanced size of clusters for a small number of clusters. Doi: 10.28991/CEJ-2022-08-12-01 Full Text: PD

    A Simulation Study on von Karman Vortex Shedding with Navier-Stokes and Shallow-Water Models

    Get PDF
    This study aims to investigate the advantages of employing numerical models based on Shallow-water equations for simulating von Karman vortex shedding. Furthermore, a comparative analysis with Navier-Stokes equations will be conducted to assess their effectiveness. In addition to Reynolds number (Re), Froude number (Fr), relevant to water depth, plays an important role in the Shallow-Water modeling of the von Karman vortex. In this study, simulations of 2D von Karman vortex shedding are performed using the Navier-Stokes model and Shallow-Water model, employing the least-squares finite-element method for space discretization and θ-method for time integration. The computed vortices characteristics, including the recirculation zone behind the cylinder, vortices size, and frequency, are presented. In the Navier-Stokes modeling, the computed results indicate that the size of vortices in space decreases and the Strouhal number increases as Re increases. In the Shallow-Water modeling for the same Re condition, the size of vortices increases and the Strouhal number decreases as Fr increases
    corecore