• Journal of Pharmaceutical Investigation
• /
• v.30 no.3
• /
• pp.191-199
• /
• 2000

Genomics is providing targets faster than we can validate them and combinatorial chemistry is providing new chemical entities faster than we can screen them. Historically, the drug discovery cascade has been established as a sequential process initiated with a potency screening against a selected biological target. In this sequential process, pharmacokinetics was often regarded as a low-throughput activity. Typically, limited pharmacokinetics studies would be conducted prior to acceptance of a compound for safety evaluation and, as a result, compounds often failed to reach a clinical testing due to unfavorable pharmacokinetic characteristics. A new paradigm in drug discovery has emerged in which the entire sample collection is rapidly screened using robotized high-throughput assays at the outset of the program. Higher-throughput pharmacokinetics (HTPK) is being achieved through introduction of new techniques, including automation for sample preparation and new experimental approaches. A number of in vitro and in vivo methods are being developed for the HTPK. In vitro studies, in which many cell lines are used to screen absorption and metabolism, are generally faster than in vivo screening, and, in this sense, in vitro screening is often considered as a real HTPK. Despite the elegance of the in vitro models, however, in vivo screenings are always essential for the final confirmation. Among these in vivo methods, cassette dosing technique, is believed the methods that is applicable in the screening of pharmacokinetics of many compounds at a time. The widespread use of liquid chromatography (LC) interfaced to mass spectrometry (MS) or tandem mass spectrometry (MS/MS) allowed the feasibility of the cassette dosing technique. Another approach to increase the throughput of in vivo screening of pharmacokinetics is to reduce the number of sample analysis. Two common approaches are used for this purpose. First, samples from identical study designs but that contain different drug candidate can be pooled to produce single set of samples, thus, reducing sample to be analyzed. Second, for a single test compound, serial plasma samples can be pooled to produce a single composite sample for analysis. In this review, we validated the issue whether the second method can be applied to practical screening of in vivo pharmacokinetics using data from seven of our previous bioequivalence studies. For a given drug, equally spaced serial plasma samples were pooled to achieve a 'Pooled Concentration' for the drug. An area under the plasma drug concentration-time curve (AUC) was then calculated theoretically using the pooled concentration and the predicted AUC value was statistically compared with the traditionally calculated AUC value. The comparison revealed that the sample pooling method generated reasonably accurate AUC values when compared with those obtained by the traditional approach. It is especially noteworthy that the accuracy was obtained by the analysis of only one sample instead of analyses of a number of samples that necessitates a significant man-power and time. Thus, we propose the sample pooling method as an alternative to in vivo pharmacokinetic approach in the selection potential lead(s) from combinatorial libraries.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.14 no.4
• /
• pp.277-282
• /
• 2012

When wind speed exceeds a certain threshold, daily minimum temperature does not drop as predicted by the geospatial model in a cold pooling catchment. A linear regression equation was derived to explain the warming effect of wind speed on daily minimum temperature by analyzing observations at a low lying location within an enclosed catchment. The equation, Y=2X+0.4 ($R^2$=0.76) where Y stands for the warming ($^{\circ}C$) and X for the mean horizontal wind speed (m/s) at 2m height, was combined to an existing model to predict daily minimum temperature across an enclosed catchment on cold pooling days. The adjusted model was applied to 3 locations submerged in a cold air pool to predict daily minimum temperature on 25 cold pooling days with the input of simulated wind speed at each location. Results showed that bias (mean error) was reduced from -1.33 to -0.37 and estimation error (RMSE) from 1.72 to 1.20, respectively, in comparison with those from the unadjusted model.

• Journal of Preventive Medicine and Public Health
• /
• v.55 no.5
• /
• pp.464-474
• /
• 2022

Objectives: We introduced the cohort studies included in the Korean Cohort Consortium (KCC), focusing on large-scale cohort studies established in Korea with a prolonged follow-up period. Moreover, we also provided projections of the follow-up and estimates of the sample size that would be necessary for big-data analyses based on pooling established cohort studies, including population-based genomic studies. Methods: We mainly focused on the characteristics of individual cohort studies from the KCC. We developed "PROFAN", a Shiny application for projecting the follow-up period to achieve a certain number of cases when pooling established cohort studies. As examples, we projected the follow-up periods for 5000 cases of gastric cancer, 2500 cases of prostate and breast cancer, and 500 cases of non-Hodgkin lymphoma. The sample sizes for sequencing-based analyses based on a 1:1 case-control study were also calculated. Results: The KCC consisted of 8 individual cohort studies, of which 3 were community-based and 5 were health screening-based cohorts. The population-based cohort studies were mainly organized by Korean government agencies and research institutes. The projected follow-up period was at least 10 years to achieve 5000 cases based on a cohort of 0.5 million participants. The mean of the minimum to maximum sample sizes for performing sequencing analyses was 5917-72 102. Conclusions: We propose an approach to establish a large-scale consortium based on the standardization and harmonization of existing cohort studies to obtain adequate statistical power with a sufficient sample size to analyze high-risk groups or rare cancer subtypes.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.1
• /
• pp.41-49
• /
• 2023

A convolutional neural network (CNN) is a representative algorithm for implementing artificial neural networks. CNNs have improved on the issues of rapid increase in calculation amount and low object classification rates, which are associated with a conventional multi-layered fully-connected neural network (FNN). However, because of the rapid development of IT devices, the maximum resolution of images captured by current smartphone and tablet cameras has reached 108 million pixels (MP). Specifically, a traditional CNN algorithm requires a significant cost and time to learn and process simple, high-resolution images. Therefore, this study proposes an improved CNN algorithm for implementing an object classification learning model for simple, high-resolution images. The proposed method alters the adjacency matrix value of the pooling layer's max pooling operation for the CNN algorithm to reduce the high-resolution image learning model's creation time. This study implemented a learning model capable of processing 4, 8, and 12 MP high-resolution images for each altered matrix value. The performance evaluation result showed that the creation time of the learning model implemented with the proposed algorithm decreased by 36.26% for 12 MP images. Compared to the conventional model, the proposed learning model's object recognition accuracy and loss rate were less than 1%, which is within the acceptable error range. Practical verification is necessary through future studies by implementing a learning model with more varied image types and a larger amount of image data than those used in this study.

• Proceedings of the Optical Society of Korea Conference
• /
• 2000.08a
• /
• pp.196-197
• /
• 2000

에너지풀링충돌은 여기된 원자들끼리 서로 충돌하여 하나의 원자는 바닥상태의 에너지 준위의 상태가 되고. 다른 하나의 원자는 더 높은 에너지 준위의 상태로 여기되는 현상이다. 이러한 에너지풀링충돌은 알카리원자에 대해서 많이 연구되어지고 있다.$^{(1)}$ (중략)

• The Journal of the Convergence on Culture Technology
• /
• v.3 no.4
• /
• pp.171-175
• /
• 2017

Recently, Training of the convolutional neural network (CNN) entails many iterative computations. Therefore, a method of accelerating the training speed through parallel processing using the hardware specifications of GPGPU is actively researched. In this paper, the operations of the feature extraction unit and the classification unit are divided into blocks and threads of GPGPU and processed in parallel. Convolution and Pooling operations of the feature extraction unit are processed in parallel at once without sequentially processing. As a result, proposed method improved the training time about 314%.

• Journal of Navigation and Port Research
• /
• v.35 no.3
• /
• pp.235-241
• /
• 2011

The shuttle that currently connects Busan New Port to the logistics companies in the Hinterland has the following companies: first, resources are consumed redundantly as each logistics company has independent transport vehicles. Second, the companies are not taking advantage of geographical merits of clustered complexes because different vehicles are used each time due to irregular schedules. In this respect, this study had the following purposes to realize these solutions: first, heuristic approach was made for operation scheduling and real-time operating rules to configure the best possible dynamic plan. Second, the reduction of consumption of resources with the shuttle and the efficiency were examined through a simulation of pooling and dual cycling applied to logistics companies' shipping plans.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.2
• /
• pp.175-180
• /
• 2018

In this paper, a feature extraction and object recognition algorithm using only morphological operations is proposed. The morphological operations used in feature extraction are erosion and dilation, opening and closing combining erosion and dilation, and morphological edge and skeleton detection operation. In the process of recognizing an object based on features, a pooling operation is applied to reduce the dimension. Among various structuring elements, $3{\times}3$ rhombus, $3{\times}3$ square, and $5{\times}5$ circle are arbitrarily selected in morphological operation process. It has confirmed that the proposed algorithm can be applied in object recognition fields through experiments using Internet images.

• Smart Media Journal
• /
• v.10 no.4
• /
• pp.80-90
• /
• 2021

Using optical music recognition technology based on deep learning, we propose to apply the results derived to VR games. To detect the music objects in the music sheet, the deep learning model used YOLO v5, and Hough transform was employed to detect undetected objects, modifying the size of the staff. It analyzes and uses BPM, maximum number of combos, and musical notes in VR games using output result files, and prevents the backlog of notes through Object Pooling technology for resource management. In this paper, VR games can be produced with music elements derived from optical music recognition technology to expand the utilization of optical music recognition along with providing VR contents.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.1034-1046
• /
• 2022

The learning-based multiview stereo (MVS) methods for three-dimensional (3D) reconstruction generally use 3D volumes for depth inference. The quality of the reconstructed depth maps and the corresponding point clouds is directly influenced by the spatial resolution of the 3D volume. Consequently, these methods produce point clouds with sparse local regions because of the lack of the memory required to encode a high volume of information. Here, we apply the atrous spatial pyramid pooling (ASPP) module in MVS methods to obtain dense feature maps with multiscale, long-range, contextual information using high receptive fields. For a given 3D volume with the same spatial resolution as that in the MVS methods, the dense feature maps from the ASPP module encoded with superior information can produce dense point clouds without a high memory footprint. Furthermore, we propose a 3D loss for training the MVS networks, which improves the predicted depth values by 24.44%. The ASPP module provides state-of-the-art qualitative results by constructing relatively dense point clouds, which improves the DTU MVS dataset benchmarks by 2.25% compared with those achieved in the previous MVS methods.