• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.1
• /
• pp.29-36
• /
• 2017

In this paper, we implement a spatial big data analysis prototype based on Spark which is an in-memory system and compares the performance by the spatial split algorithm on this basis. In cluster computing environments, big data is divided into blocks of a certain size order to balance the computing load of big data. Existing research showed that in the case of the Hadoop based spatial big data system, the split method by spatial is more effective than the general sequential split method. Hadoop based spatial data system stores raw data as it is in spatial-divided blocks. However, in the proposed Spark-based spatial analysis system, there is a difference that spatial data is converted into a memory data structure and stored in a spatial block for search efficiency. Therefore, in this paper, we propose an in-memory spatial big data prototype and a spatial split block storage method. Also, we compare the performance of existing spatial split algorithms in the proposed prototype. We presented an appropriate spatial split strategy with the Spark based big data system. In the experiment, we compared the query execution time of the spatial split algorithm, and confirmed that the BSP algorithm shows the best performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.327-334
• /
• 2016

In this paper, we propose a hardware architecture of transform and quantization for high-perfornamce HEVC(High Efficiency VIdeo Coding) encoder. HEVC transform decides the transform mode by comparing RDCost to search for the best mode of them. But, RDCost is computed using the bit-rate and distortion which is computed by transform, quantization, de-quantization, and inverse transform. Due to the many calculations and encoding time, it is hard to process high resolution and high definition image in real-time. This paper proposes the method of transform mode decision by comparing sum of coefficient after transform only. We use BD-PSNR and BD-Bitrate which is performance indicator. Based on the experimental result, We confirmed that the decision of transform mode can process images with no significant change in the image quality. We reduced hardware area by assigning different values at the same output according to the transform mode and overlapping coefficient multiplied as much as possible. Also, we raise performance by implementing sequential pipeline operation. In view of the larger process that we used compared with the process of reference paper, Our design has reduced by half the hardware area and has increased performance 2.3 times.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• Journal of Korean Library and Information Science Society
• /
• v.52 no.3
• /
• pp.21-48
• /
• 2021

Today, with countless health information being accessible through online and offline, the public has been able to explore health-related information in various ways. The current study focuses on the information-seeking behavior of the mothers who actively explore information related to the health of their healthy infants (aged between 0 and 3 years). The researcher had conducted in-depth interviews of 24 American, Korean, and Korean immigrant mothers living in the United States, and then analyzed the sequential order of the information sources that they have used to search for the health-related information about their children. The current research highlights that the mothers' information-seeking pathways and searched topics tended to differ in accordance with their child(ren)'s health conditions (e.g., ill vs. healthy). For instance, regarding the information sources used, more diverse health information sources (e.g., public libraries, government health agencies, daycare teachers) were used when their child(ren) was not ill. In addition, when a child was ill, mothers were likely to focus on information about specific diseases or symptoms first, whereas when the child was healthy, they used to explore information on various health topics such as growth and development, nutrition and diets, parenting, and so on. Based on the results, implications for the information professionals are discussed when designing and providing health-related information services to mothers of healthy infants and toddlers.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.2
• /
• pp.29-43
• /
• 2019

The calibration of microscopic traffic simulation models has received much attention in the simulation field. Although no standard has been established for it, a genetic algorithm (GA) has been widely employed in recent literature because of its high efficiency to find solutions in such optimization problems. However, the performance still falls short in simulation analyses to support fast decision making. This paper proposes a new calibration procedure using a dual GA and central composite design (CCD) in order to improve the efficiency. The calibration exercise goes through three major sequential steps: (1) experimental design using CCD for a quadratic response surface model (RSM) estimation, (2) 1st GA procedure using the RSM with CCD to find a near-optimal initial population for a next step, and (3) 2nd GA procedure to find a final solution. The proposed method was applied in calibrating the Gipps car-following model with respect to maximizing the likelihood of a spacing distribution between a lead and following vehicle. In order to evaluate the performance of the proposed method, a conventional calibration approach using a single GA was compared under both simulated and real vehicle trajectory data. It was found that the proposed approach enhances the optimization speed by starting to search from an initial population that is closer to the optimum than that of the other approach. This result implies the proposed approach has benefits for a large-scale traffic network simulation analysis. This method can be extended to other optimization tasks using GA in transportation studies.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.21 no.4
• /
• pp.283-309
• /
• 2021

Achieving profound anesthesia in mandibular molars with irreversible pulpitis is a tedious task. This review aimed at evaluating the success of buccal/lingual infiltrations administered with a primary inferior alveolar nerve block (IANB) injection or as a supplemental injection after the failure of the primary injection in symptomatic and asymptomatic patients with irreversible pulpitis in human mandibular molars. The review question was "What will be the success of primary and supplemental infiltration injection in the endodontic treatment of patients with irreversible pulpitis in human mandibular molars?" We searched electronic databases, including Pubmed, Scopus, and Ebsco host and we did a comprehensive manual search. The review protocol was framed according to the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) checklist. We included clinical studies that evaluated and compared the anesthetic outcomes of primary IANB with primary and/or supplementary infiltration injections. Standard evaluation of the included studies was performed and suitable data and inferences were assessed. Twenty-six studies were included, of which 13 were selected for the meta-analysis. In the forest plot representation of the studies evaluating infiltrations, the combined risk ratio (RR) was 1.88 (95% CI: 1.49, 2.37), in favor of the secondary infiltrations with a statistical heterogeneity of 77%. The forest plot analysis for studies comparing primary IANB + infiltration versus primary IANB alone showed a low heterogeneity (0%). The included studies had similar RRs and the combined RR was 1.84 (95% CI: 1.44, 2.34). These findings suggest that supplemental infiltrations given along with a primary IANB provide a better success rate. L'Abbe plots were generated to measure the statistical heterogeneity among the studies. Trial sequential analysis suggested that the number of patients included in the analysis was adequate. Based on the qualitative and quantitative analyses, we concluded that the infiltration technique, either as a primary injection or as a supplementary injection, given after the failure of primary IANB, increases the overall anesthetic efficacy.

• Journal of Intelligence and Information Systems
• /
• v.28 no.1
• /
• pp.1-28
• /
• 2022

In recent years, many Internet giants have begun providing their own content services, which attract online users by offering personalized services based on artificial intelligence technologies. This study investigates the role of two firms' content services within the firms' online service network. We examine the role of Naver Webtoon, which can be characterized as a professional-generated content, within Naver's service portfolio, and that of Google YouTube, which can be characterized as a user-generated content, within Google's service portfolio. Using survey data on viewers' use of the two services, we analyze a valued directed service network, where a node denotes an online service and a relationship between two nodes denotes a sequential use of two services. We found that both Webtoon and YouTube show higher out-degree centrality than in-degree centrality, which implies these content services are more likely to be starting services rather than arriving services within the firms' interactive network. The gap between the out-degree and in-degree centrality of YouTube is much smaller than that of Webtoon. The high centrality of YouTube, a user-generated content service, within the Google service network shows that YouTube's initial role of providing specific-content videos (e.g., entertainment) has expanded into a general search service for users.

• Investigative Magnetic Resonance Imaging
• /
• v.3 no.2
• /
• pp.154-158
• /
• 1999

Purpose : The purpose of this study was to find the optimum TE value for enhancing $T_2^{*}$ weighting effect and minimizing the SNR degradation and to compare the BOLD effects according to the changes of TE in 1.5T and 3.0T MRI systems. Materials and Methods : Healthy normal volunteers (eight males and two females with 24-38 years old) participated in this study. Each volunteer was asked to perform a simple finger-tapping task (sequential opposition of thumb to each of the other four fingers) with right hand with a mean frequency of about 2Hz. The stimulus was initially off for 3 images and was then alternatively switched on and off for 2 cycles of 6 images. Images were acquired on the 1.5T and 3.0T MRI with the FLASH (fast low angle shot) pulse sequence (TR : 100ms, FA : $20^{\circ}$, FOV : 230mm) that was used with 26, 36, 46, 56, 66, 76ms of TE times in 1.5T and 16, 26, 36, 46, 56, 66ms of TE in 3.0T MRI system. After the completion of scan, MR images were transferred into a PC and processed with a home-made analysis program based on the correlation coefficient method with the threshold value of 0.45. To search for the optimum TE value in fMRI, the difference between the activation and the rest by the susceptibility change for each TE was used in 1.5T and 3.0T respectively. In addition, the functional $T_2^{*}$ map was calculated to quantify susceptibility change. Results : The calculated optimum TE for fMRI was $61.89{\pm}2.68$ at 1.5T and $47.64{\pm}13.34$ at 3.0T. The maximum percentage of signal intensity change due to the susceptibility effect inactivation region was 3.36% at TE 66ms in 1.5T 10.05% at TE 46ms in 3.0T, respectively. The signal intensity change of 3.0T was about 3 times bigger than of 1.5T. The calculated optimum TE value was consistent with TE values which were obtained from the maximum signal change for each TE. Conclusion : In this study, the 3.0T MRI was clearly more sensitive, about three times bigger than the 1.5T in detecting the susceptibility due to the deoxyhemoglobin level change in the functional MR imaging. So the 3.0T fMRI I ore useful than 1.5T.