• The Korean Journal of Applied Statistics
• /
• v.33 no.5
• /
• pp.569-578
• /
• 2020

By estimating conditional quantile functions of the response, quantile regression (QR) can provide comprehensive information of the relationship between the response and the predictors. In addition, kernel quantile regression (KQR) estimates a nonlinear conditional quantile function in reproducing kernel Hilbert spaces generated by a positive definite kernel function. However, it is infeasible to use the KQR in analysing a massive data due to the limitations of computer primary memory. We propose a divide and conquer based KQR (DC-KQR) method to overcome such a limitation. The proposed DC-KQR divides the entire data into a few subsets, then applies the KQR onto each subsets and derives a final estimator by aggregating all results from subsets. Simulation studies are presented to demonstrate the satisfactory performance of the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.109-111
• /
• 2004

본 논문에서는 LCD 디바이스의 프레임버퍼 모니터링에 기반한 소프트웨어 단계의 저전력 LCD 관리 기법을 제시한다. 제안하는 기법은 Refresh-rate를 조절하여 기존 하드웨어에서 추가설비 없이 사용 가능하며, 커널 레벨로 동작하여 어플리케이션의 수정이 필요 없으며, 프레임 버퍼 모니터링을 통해 디스플레이의 퀼리티 보장이 가능한 특징을 가진다. 본 시스템은 Linux 운영체제 하에서 실제 구현되고, 실험을 통해 제안하는 기법이 사용자의 디스플레이 퀼리티 요구를 만족시키면서 저전력 관리를 수행할 수 있음을 밝힌다.

• Journal of the Korean Society of Radiology
• /
• v.83 no.3
• /
• pp.669-679
• /
• 2022

Purpose To evaluate the feasibility of pediatric low-dose facial CT reconstructed with filtered back projection (FBP) using adequate kernels. Materials and Methods We retrospectively reviewed the clinical and imaging data of children aged < 10 years who underwent facial CT at our emergency department. The patients were divided into two groups: low-dose CT (LDCT; Group A, n = 73) with a fixed 80-kVp tube potential and automatic tube current modulation (ATCM) and standard-dose CT (SDCT; Group B, n = 40) with a fixed 120-kVp tube potential and ATCM. All images were reconstructed with FBP using bone and soft tissue kernels in Group A and only bone kernel in Group B. The groups were compared in terms of image noise, signal-to-noise ratio (SNR), and contrast-to-noise ratio (CNR). Two radiologists subjectively scored the overall image quality of bony and soft tissue structures. The CT dose index volume and dose-length product were recorded. Results Image noise was higher in Group A than in Group B in bone kernel images (p < 0.001). Group A using a soft tissue kernel showed the highest SNR and CNR for all soft tissue structures (all p < 0.001). In the qualitative analysis of bony structures, Group A scores were found to be similar to or higher than Group B scores on comparing bone kernel images. In the qualitative analysis of soft tissue structures, there was no significant difference between Group A using a soft tissue kernel and Group B using a bone kernel with a soft tissue window setting (p > 0.05). Group A showed a 76.9% reduction in radiation dose compared to Group B (3.2 ± 0.2 mGy vs. 13.9 ± 1.5 mGy; p < 0.001). Conclusion The addition of a soft tissue kernel image to conventional CT reconstructed with FBP enables the use of pediatric low-dose facial CT protocol while maintaining image quality.

• Journal of Information Management
• /
• v.18 no.4
• /
• pp.98-117
• /
• 1985

At the present time, the role and importance of information retrieval has greatly increased for two main reasons: the coverage of the searchable collections is now extensive and collection size may exceed several million documents; further more, the search results can now be obtained more or less instantaneously using online procedures and computer terminal devices that provide interaction and communication between system and users. The large collection size make it plausible to the users that relevant information will in fact be retrieved as a result of a search operation, and the probability of obtaining the search output without delay creates a substantial user demand for the retrieval services.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.873-880
• /
• 2015

Since hardware-based kernel-integrity monitoring systems run in the environments that are isolated from the monitored OS, attackers in the monitored OS cannot undermine the security of monitoring systems. However, because the monitoring is performed by using physical addresses, the hardware-based monitoring systems are vulnerable to Address Translation Redirection Attack (ATRA) that manipulates virtual-to-physical memory translations. To ameliorate this problem, we propose a scheduler-based ATRA detection method. The method detects ATRA during the process scheduling by leveraging the fact that kernel scheduler engages every context switch of processes. We implemented a prototype on Android emulator and TizenTV, and verified that it successfully detected ATRA without incurring any significant performance loss.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.439-448
• /
• 2006

Previous recognition/clustering algorithms such as Kohonen SOM(Self-Organizing Map), MLP(Multi-Layer Percecptron) and SVM(Support Vector Machine) might not adapt to unexpected input pattern. And it's recognition rate depends highly on the complexity of own training patterns. We could make up for and improve the weak points with lowering complexity of original problem without losing original characteristics. There are so many ways to lower complexity of the problem, and we chose a kernel concepts as an approach to do it. In this paper, using a kernel concepts, original data are mapped to hyper-dimension space which is near infinite dimension. Therefore, transferred data into the hyper-dimension are distributed spasely rather than originally distributed so as to guarantee the rate to be risen. Estimating ratio of recognition is based on a new similarity-probing and learning method that are proposed in this paper. Using CEDAR DB which data is written in cursive letters, 0 to 9, we compare a recognition/clustering performance of kSOM that is proposed in this paper with previous SOM.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.139-146
• /
• 2007

Most of embedded systems have been developed practically based on the PC platform equipped with Intel x86 CPU since it is able to reduce the total time for product development and improve the reliability of product by making use of a variety of solutions developed for a long time in the PC environment. Also, embedded systems based on PC-platform mainly use a high-capacity hard disk as data storage device for applications intending to store multimedia data. Recently, while the capacity of hard disk is increasing rapidly, the start-up ready time of hard disk is growing longer more than 30 seconds. The lengthened start-up ready time may delay the booting time of embedded system seriously, weighting users down with inconvenience. This paper proposes the refined system architecture and the dynamic IDE device probing method for fast booting of linux kernel in the embedded system based on PC platform with high-capacity hard disks, and the performance of proposed methods is evaluated and presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.295-303
• /
• 2005

Recently, according to the rapid increase of Web users, various kinds of Web applications have been being developed. Hence, Web QoS(Quality of Service) becomes a critical issue in the Web services, such as e-commerce, Web hosting, etc. Nevertheless, most Web servers currently process various requests from Web users on a FIFO basis, which can not provide differentiated QoS. This paper presents a load balancing method to provide differentiated Web QoS in clustering web server. The first is the kernel-level approach, which is adding a real-time scheduling process to the operating system kernel to maintain the priority of user requests determined by the scheduling process of Web server. The second is the load-balancing approach, which uses IP-level masquerading and tunneling technology to improve reliability and response speed upon user requests. The third is the dynamic load-balancing approach, which uses the parameters related to the MIB-II of SNMP and the parameters related to load of the system such as memory and CPU.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.235-244
• /
• 2007

Caching and prefetching policies have been used in most of computer systems to compensate speed differences between primary memory and secondary storage devices. In this paper, we design and implement a Flash Cache Core Module(FCCM) on the YAFFS which operates on a file system layer for NAND flash memory. The FCCM is independent of the underlying kernel in order to support its stability and compatibility. Also, we implement the Dirty-Last memory replacement technique considering the characteristics of flash memory, and the waiting queue for pages to be prefetched according to page hit. The FCCM reduced the number of I/Os and the amount of prefetched pages by maximum 55%(20% on average) and maximum 55%(24% on average), respectively, comparing with caching and prefetching policies of Linux.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.215-218
• /
• 2002

본 논문에서는 타원형 클러스터링을 위한 거리측정 함수로써 변형된 가무시안 커널 함수를 사용하며, 주어진 클러스터링 문제를 각 타원형 클러스터의 체적을 최소화하는 문제로 해석하고 이를 선형행렬 부등식 기법 중 하나인 고유값 문제로 변환하여 최적화하는 새로운 알고리즘을 제안한다.