• Title/Summary/Keyword: Kernel Level

Search Result 292, Processing Time 0.028 seconds

Anti-Theft Boot Loader System on Low Level Kernel (커널 하위 계층에서의 도난 방지 부트로더 시스템)

  • Kim, Byeoung-Wook;Yu, Joo-hyun;Jung, Dong-Hwan;Lee, Hyun-Ar
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.28-30
    • /
    • 2016
  • 정보화 시대에서 노트북을 도난당하는 것은 금전적인 손해 뿐만 아니라 작업 내용, 기밀 정보와 같은 금전적으로 환산할 수 없는 중요 정보들을 잃어버리는 점에서 그 피해와 손실이 크다. 본 논문에서는 노트북 도난에 의한 피해와 손실을 최소화 할 수 있는 도난 방지 부트로더 시스템을 제시한다. 시스템은 사용자 노트북의 부트로더 레벨에서 사용자 인증과 전방 사진 및 위치 정보를 수집하고 전송하여, 노트북 내 정보가 유출되는 것을 방지하는 동시에 범인 검거 및 노트북 회수를 위한 정보를 사용자에게 제공한다.

Blind Signal Processing for Impulsive Noise Channels

  • Kim, Nam-Yong;Byun, Hyung-Gi;You, Young-Hwan;Kwon, Ki-Hyeon
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.27-33
    • /
    • 2012
  • In this paper, a new blind signal processing scheme for equalization in fading and impulsive-noise channel environments is introduced based on probability density functionmatching method and a set of Dirac-delta functions. Gaussian kernel of the proposed blind algorithm has the effect of cutting out the outliers on the difference between the desired level values and impulse-infected outputs. And also the proposed algorithm has relatively less sensitivity to channel eigenvalue ratio and has reduced computational complexity compared to the recently introduced correntropy algorithm. According to these characteristics, simulation results show that the proposed blind algorithm produces superior performance in multi-path communication channels corrupted with impulsive noise.

A Novel Cross Channel Self-Attention based Approach for Facial Attribute Editing

  • Xu, Meng;Jin, Rize;Lu, Liangfu;Chung, Tae-Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2115-2127
    • /
    • 2021
  • Although significant progress has been made in synthesizing visually realistic face images by Generative Adversarial Networks (GANs), there still lacks effective approaches to provide fine-grained control over the generation process for semantic facial attribute editing. In this work, we propose a novel cross channel self-attention based generative adversarial network (CCA-GAN), which weights the importance of multiple channels of features and archives pixel-level feature alignment and conversion, to reduce the impact on irrelevant attributes while editing the target attributes. Evaluation results show that CCA-GAN outperforms state-of-the-art models on the CelebA dataset, reducing Fréchet Inception Distance (FID) and Kernel Inception Distance (KID) by 15~28% and 25~100%, respectively. Furthermore, visualization of generated samples confirms the effect of disentanglement of the proposed model.

Improving Function-level Update Performance For Linux Kernel (리눅스 커널을 위한 함수 단위 업데이트 성능 개선 기법)

  • Lim, Byoung-Hong;Kim, In-Hyuk;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.920-923
    • /
    • 2009
  • 기존의 동적 커널 업데이트 시스템에서 주로 사용되는 함수 단위의 재구성 기법으로는 트랩과 점프가 있다. 이러한 기법들을 사용하면 커널 서비스의 중단 없이 함수 단위로 커널을 업데이트할 수 있는 이점이 있다. 하지만 커널 업데이트 후, 프로세서가 분기 명령어를 처리하는 과정에 두 가지 문제점이 존재한다. 업데이트 함수에 업데이트가 필요한 함수 내의 분기 명령어 오퍼랜드 값을 그대로 복사하면 의미 없는 메모리 주소로 분기하게 된다. 또한 분기 명령어로 short jump를 사용하면, 현재 위치에서 8 비트 범위를 벗어난 주소공간에 존재하는 분기 함수에는 접근을 할 수 없는 문제를 안고 있다. 본 논문에서는 이러한 문제점들을 해결하기 위해 short jump 대신 long jump를 사용하는 방식을 제안하였다. 이를 위해 업데이트가 필요한 함수의 분기 명령어가 갖고 있는 오퍼랜드 값을 추출하여, 업데이트 함수의 분기 명령어가 정상적으로 동작할 수 있도록 오퍼랜드 값을 수정해주는 동적 커널 업데이트 시스템을 설계하고 구현하였다.

SSD Simulator in Kernel-level Design and Implementation (커널 레벨에서의 SSD 시뮬레이터 디자인 및 구현)

  • Jang, Bo-Gil;Kim, Hyunbin;Lim, Seung-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.28-29
    • /
    • 2011
  • SSD(Solid State Drive)는 다중-채널/ 다중-웨이 방식의 NAND 플래시 메모리를 이용하는 저장장치로서 기존 HDD(Hard Disk Drive)를 대체할 차세대 보조기억장치로 주목받고 있다. 하지만 SSD 와 같은 동작을 하는 커널레벨의 시뮬레이터가 존재하지 않아, 사용자 영역에서부터 실제 NAND 플래시 칩까지의 동작 원리를 파악하기 어렵다. 이러한 문제를 해결하기 위해 본 논문에서는 SSD 시뮬레이터의 설계 및 구현내용을 기술한다. 구현한 SSD 시뮬레이터는 다중-채널/ 다중-웨이 방식의 SSD 전체적인 동작 원리를 리눅스 커널 수준에서 파악할 수 있다. 또한 FTL 개발을 위한 환경을 제공할 뿐만 아니라, 사용자가 다양한 SSD 구조를 설계하여 성능을 예측할 수 있도록 한다.

Restricting Factors and Countermeasures of Development in Business Services Industry of Shandong Province

  • Zhai, Wen Xiu;Lin, Dong Hua
    • The Journal of Economics, Marketing and Management
    • /
    • v.1 no.1
    • /
    • pp.1-14
    • /
    • 2013
  • Firstly, this article expounds that business service industry plays an important role in adjusting industrial structure, transforming mode of economic growth, improving people's living standards, enhancing Enterprise's Kernel Competitiveness and promoting the development of service industry. Then it analyzes the development of business services in Shandong from two perspectives. The first perspective, by using methodology for statistical analysis, it will review the development scale, professional level, the number of opening units, quantity of employment, and operating revenue of business services in Shandong. On this basis, the article will summarize its development characteristics, experience and existing shortcomings. The second perspective, by using comparison analysis methodology, to compare the development of Shandong with Jiangsu, Guangdong, Zhejiang and Shanghai's and found the subjective and objective factors that restrict the development of business service industry in Shandong. In the light of restricting factors, countermeasures have been developed based on the experience at home and abroad. These countermeasures will contribute to promoting the optimization and upgrading of industrial structure, improving industrial competitiveness and speeding up the economic development rapidly and stably.

Optimization of Multiclass Support Vector Machine using Genetic Algorithm: Application to the Prediction of Corporate Credit Rating (유전자 알고리즘을 이용한 다분류 SVM의 최적화: 기업신용등급 예측에의 응용)

  • Ahn, Hyunchul
    • Information Systems Review
    • /
    • v.16 no.3
    • /
    • pp.161-177
    • /
    • 2014
  • Corporate credit rating assessment consists of complicated processes in which various factors describing a company are taken into consideration. Such assessment is known to be very expensive since domain experts should be employed to assess the ratings. As a result, the data-driven corporate credit rating prediction using statistical and artificial intelligence (AI) techniques has received considerable attention from researchers and practitioners. In particular, statistical methods such as multiple discriminant analysis (MDA) and multinomial logistic regression analysis (MLOGIT), and AI methods including case-based reasoning (CBR), artificial neural network (ANN), and multiclass support vector machine (MSVM) have been applied to corporate credit rating.2) Among them, MSVM has recently become popular because of its robustness and high prediction accuracy. In this study, we propose a novel optimized MSVM model, and appy it to corporate credit rating prediction in order to enhance the accuracy. Our model, named 'GAMSVM (Genetic Algorithm-optimized Multiclass Support Vector Machine),' is designed to simultaneously optimize the kernel parameters and the feature subset selection. Prior studies like Lorena and de Carvalho (2008), and Chatterjee (2013) show that proper kernel parameters may improve the performance of MSVMs. Also, the results from the studies such as Shieh and Yang (2008) and Chatterjee (2013) imply that appropriate feature selection may lead to higher prediction accuracy. Based on these prior studies, we propose to apply GAMSVM to corporate credit rating prediction. As a tool for optimizing the kernel parameters and the feature subset selection, we suggest genetic algorithm (GA). GA is known as an efficient and effective search method that attempts to simulate the biological evolution phenomenon. By applying genetic operations such as selection, crossover, and mutation, it is designed to gradually improve the search results. Especially, mutation operator prevents GA from falling into the local optima, thus we can find the globally optimal or near-optimal solution using it. GA has popularly been applied to search optimal parameters or feature subset selections of AI techniques including MSVM. With these reasons, we also adopt GA as an optimization tool. To empirically validate the usefulness of GAMSVM, we applied it to a real-world case of credit rating in Korea. Our application is in bond rating, which is the most frequently studied area of credit rating for specific debt issues or other financial obligations. The experimental dataset was collected from a large credit rating company in South Korea. It contained 39 financial ratios of 1,295 companies in the manufacturing industry, and their credit ratings. Using various statistical methods including the one-way ANOVA and the stepwise MDA, we selected 14 financial ratios as the candidate independent variables. The dependent variable, i.e. credit rating, was labeled as four classes: 1(A1); 2(A2); 3(A3); 4(B and C). 80 percent of total data for each class was used for training, and remaining 20 percent was used for validation. And, to overcome small sample size, we applied five-fold cross validation to our dataset. In order to examine the competitiveness of the proposed model, we also experimented several comparative models including MDA, MLOGIT, CBR, ANN and MSVM. In case of MSVM, we adopted One-Against-One (OAO) and DAGSVM (Directed Acyclic Graph SVM) approaches because they are known to be the most accurate approaches among various MSVM approaches. GAMSVM was implemented using LIBSVM-an open-source software, and Evolver 5.5-a commercial software enables GA. Other comparative models were experimented using various statistical and AI packages such as SPSS for Windows, Neuroshell, and Microsoft Excel VBA (Visual Basic for Applications). Experimental results showed that the proposed model-GAMSVM-outperformed all the competitive models. In addition, the model was found to use less independent variables, but to show higher accuracy. In our experiments, five variables such as X7 (total debt), X9 (sales per employee), X13 (years after founded), X15 (accumulated earning to total asset), and X39 (the index related to the cash flows from operating activity) were found to be the most important factors in predicting the corporate credit ratings. However, the values of the finally selected kernel parameters were found to be almost same among the data subsets. To examine whether the predictive performance of GAMSVM was significantly greater than those of other models, we used the McNemar test. As a result, we found that GAMSVM was better than MDA, MLOGIT, CBR, and ANN at the 1% significance level, and better than OAO and DAGSVM at the 5% significance level.

Habitat Selection and Management of the Leopard Cat(Prionailurus bengalensis) in a Rural Area of Korea (농촌지역 삵(Prionailurus bengalensis)의 서식지 선택과 관리방안)

  • Choi, Tae-Young;Kwon, Hyuk-Soo;Woo, Dong-Gul;Park, Chong-Hwa
    • Korean Journal of Environment and Ecology
    • /
    • v.26 no.3
    • /
    • pp.322-332
    • /
    • 2012
  • The objectives of this paper were to investigate home range, habitat selection, and threat factors of leopard cats (Prionailurus bengalensis) living in rural area of Korea. The results based on radio tracking of three leopard cats (two males and one female) can be summarized as follows. First, the average home range of leopard cats were $2.64{\pm}1.99km^2$ (Kernel 95) and $3.69{\pm}1.34km^2$ (MCP 100), and the average size of core areas was $0.64{\pm}0.47km^2$ (Kernel 50). The home range of a male leopard cat that radio-tracked in winter was the largest ($5.19km^2$, MCP 100). Second, the Johnson's habitat selection model based on the Jacobs index showed that leopard cats preferred meadows and paddy fields avoiding forest covers at the second level, whereas they preferred meadows adjacent to streams and avoided paddy fields at the third level. Finally, roadkill could be prime threat factor for the cat population. Therefore, habitats dominated by paddy fields, stream corridors with paved roads, and human settlements with insufficient forest patches could threaten the long-term viability of leopard cat populations. Thus the habitat managements for the leopard cat conservation should focus on the prevention of road-kill and the installation of wildlife passages in rural highways adjacent to stream corridors.

A Kernel-level RTP for Efficient Support of Multimedia Service on Embedded Systems (내장형 시스템의 원활한 멀티미디어 서비스 지원을 위한 커널 수준의 RTP)

  • Sun Dong Guk;Kim Tae Woong;Kim Sung Jo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.460-471
    • /
    • 2004
  • Since the RTP is suitable for real-time data transmission in multimedia services like VoD, AoD, and VoIP, it has been adopted as a real-time transport protocol by RTSP, H.323, and SIP. Even though the RTP protocol stack for embedded systems has been in great need for efficient support of multimedia services, such a stack has not been developed yet. In this paper, we explain embeddedRTP which supports the RTP protocol stack at the kernel level so that it is suitable for embedded systems. Since embeddedRTP is designed to reside in the UBP module, existing applications which rely ell TCP/IP services can proceed the same as before, while applications which rely on the RTP protocol stack can request HTP services through embeddedRTp API. EmbeddedRTP stores transmitted RTP packets into per session packet buffer, using the packet's port number and multimedia session information. Communications between applications and embeddedRTP is performed through system calls and signal mechanisms. Additionally, embeddedRTP API makes it possible to develop applications more conveniently. Our performance test shows that packet-processing speed of embeddedRTP is about 7.5 times faster than that oi VCL RTP for multimedia streaming services on PDA in spite that its object code size is reduced about by 58% with respect to UCL RTP's.

Design and Implementation of a Benchmarking System Based on ArangoDB (ArangoDB기반 벤치마킹 시스템 설계 및 구현)

  • Choi, Do-Jin;Baek, Yeon-Hee;Lee, So-Min;Kim, Yun-A;Kim, Nam-Young;Choi, Jae-Young;Lee, Hyeon-Byeong;Lim, Jong-Tae;Bok, Kyoung-Soo;Song, Seok-Il;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.9
    • /
    • pp.198-208
    • /
    • 2021
  • ArangoDB is a NoSQL database system that has been popularly utilized in many applications for storing large amounts of data. In order to apply a new NoSQL database system such as ArangoDB, to real work environments we need a benchmarking system that can evaluate its performance. In this paper, we design and implement a ArangoDB based benchmarking system that measures a kernel level performance well as an application level performance. We partially modify YCSB to measure the performance of a NoSQL database system in the cluster environment. We also define three real-world workload types by analyzing the existing materials. We prove the feasibility of the proposed system through the benchmarking of three workload types. We derive available workloads in ArangoDB and show that performance at the kernel layer as well as the application layer can be visualized through benchmarking of three workload types. It is expected that applicability and risk reviews will be possible through benchmarking of this system in environments that need to transfer data from the existing database engine to ArangoDB.