• Title/Summary/Keyword: Kernel-modified

Search Result 92, Processing Time 0.024 seconds

SVC with Modified Hinge Loss Function

  • Lee, Sang-Bock
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.905-912
    • /
    • 2006
  • Support vector classification(SVC) provides more complete description of the linear and nonlinear relationships between input vectors and classifiers. In this paper we propose to solve the optimization problem of SVC with a modified hinge loss function, which enables to use an iterative reweighted least squares(IRWLS) procedure. We also introduce the approximate cross validation function to select the hyperparameters which affect the performance of SVC. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.

  • PDF

Hyper-ellipsoidal clustering algorithm using Linear Matrix Inequality (선형 행렬 부등식을 이용한 타원형 클러스터링 알고리즘)

  • 이한성;박주영;박대희
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.215-218
    • /
    • 2002
  • 본 논문에서는 타원형 클러스터링을 위한 거리측정 함수로써 변형된 가무시안 커널 함수를 사용하며, 주어진 클러스터링 문제를 각 타원형 클러스터의 체적을 최소화하는 문제로 해석하고 이를 선형행렬 부등식 기법 중 하나인 고유값 문제로 변환하여 최적화하는 새로운 알고리즘을 제안한다.

  • PDF

Modified Cubic Convolution Scaler for Multiformat Conversion in a Transcoder (다양한 포맷변환을 지원하는 Transcoder의 개선된 Cubic Convolution Scaler)

  • Yoo, Young-Joe;Seo, Ju-Heon;Han, Jong-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.867-880
    • /
    • 2007
  • We derive a modified version of cubic convolution interpolation for the enlargement or reduction of digital images by arbitrary scaling factors. The proposed scaling scheme is used to resize various format pictures in the transcoding system, which transforms the bitstream compressed at a bit rate, such as the HD bitstream, into another bit rate stream. In many applications such as the transcoder, the resolution conversion is very important for changing the image size while the scaled image maintains high quality. We focus on the modification of the scaler kernel according to the relation between formats of the original and the resized image. In the modification, various formats defined in MPEG standards are considered. We show experimental results that demonstrate the effectiveness of the proposed interpolation method.

Genetic Variabilities in Two Modified Opaque-2 Synthetics of Corn(Zea mays L.) (변갱 오페이크-2 옥수수 합성품종의 유전변이)

  • Yun Gyu, Kang;Keun Yong, Park;Bong Ho, Choe
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.30 no.3
    • /
    • pp.326-333
    • /
    • 1985
  • The genetic information was required to improve several plant characteristics of the two modified opaque-2 synthetics, which were synthesized in 1980 at the Chungnam National University. Genetic analysis to obtain the information was carried out by the method of Hallauer and Wright. The information obtained from the analysis indicates that plant characteristics such as plant height, ear height, kernel weight and yield of the two synthetics can be improved by proper breeding procedures, since these characteristics were showing high estimates of genetic and additive variance. The study also shows that some characteristics such as ear length or kernel row number may be not improved effectively and with ease.

  • PDF

A Safety Verification of the Modified BLP Model using PVS (PVS를 이용한 수정된 BLP 모델의 안전성 검증)

  • Koo Ha-Sung;Park Tae-Kue;Song Ho-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1435-1442
    • /
    • 2006
  • The ideal method of safety evaluation is to verify results of execution against all possible operations within operating system, but it is impossible. However, the formal method can theoretically prove the safety on actual logic of operating system. Therefore we explain the contents of the art of the safety verification of security kernel, and make a comparative study of various standardized formal verification tools. And then we assigned PVS(Prototype Verification system) of SRI(Stanford Research Institute) to verify the safety of a modified BLP(Bell & LaPadula) model, the core access control model of multi-lavel based security kernel. Finally, we describe formal specification of the revised BLP model using the PVS, and evaluate the safety of the model by inspecting the specification of the PVS.

Probabilistic Prediction of Estimated Ultimate Recovery in Shale Reservoir using Kernel Density Function (셰일 저류층에서의 핵밀도 함수를 이용한 확률론적 궁극가채량 예측)

  • Shin, Hyo-Jin;Hwang, Ji-Yu;Lim, Jong-Se
    • Journal of the Korean Institute of Gas
    • /
    • v.21 no.3
    • /
    • pp.61-69
    • /
    • 2017
  • The commercial development of unconventional gas is pursued in North America because it is more feasible owing to the technology required to improve productivity. Shale reservoir have low permeability and gas production can be carried out through cracks generated by hydraulic fracturing. The decline rate during the initial production period is high, but very low latter on, there are significant variations from the initial production behavior. Therefore, in the prediction of the production rate using deterministic decline curve analysis(DCA), it is not possible to consider the uncertainty in the production behavior. In this study, production rate of the Eagle Ford shale is predicted by Arps Hyperbolic and Modified SEPD. To minimize the uncertainty in predicting the Estimated Ultimate Recovery(EUR), Monte Carlo simulation is used to multi-wells analysis. Also, kernel density function is applied to determine probability distribution of decline curve factors without any assumption.

Ontology Alignment based on Parse Tree Kernel usig Structural and Semantic Information (구조 및 의미 정보를 활용한 파스 트리 커널 기반의 온톨로지 정렬 방법)

  • Son, Jeong-Woo;Park, Seong-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.4
    • /
    • pp.329-334
    • /
    • 2009
  • The ontology alignment has two kinds of major problems. First, the features used for ontology alignment are usually defined by experts, but it is highly possible for some critical features to be excluded from the feature set. Second, the semantic and the structural similarities are usually computed independently, and then they are combined in an ad-hoc way where the weights are determined heuristically. This paper proposes the modified parse tree kernel (MPTK) for ontology alignment. In order to compute the similarity between entities in the ontologies, a tree is adopted as a representation of an ontology. After transforming an ontology into a set of trees, their similarity is computed using MPTK without explicit enumeration of features. In computing the similarity between trees, the approximate string matching is adopted to naturally reflect not only the structural information but also the semantic information. According to a series of experiments with a standard data set, the kernel method outperforms other structural similarities such as GMO. In addition, the proposed method shows the state-of-the-art performance in the ontology alignment.

An Efficient Network System Call Interface supporting minimum memory copy (메모리 복사를 최소화화는 효율적인 네트워크 시스템 호출 인터패이스)

  • 송창용;김은기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4B
    • /
    • pp.397-402
    • /
    • 2004
  • In this paper, we have designed and simulated a new file transmission method. This method restricts memory copy and context switching happened in traditional file transmission. This method shows an improved performance than traditional method in network environment. When the UNIX/LINUX system that uses the existing file transfer technique transmits a packet to the remote system, a memory copy between the user and kernel space occurs over twice at least. Memory copy between the user and kernel space increase a file transmission time and the number of context switching. As a result, the existing file transfer technique has a problem of deteriorating the performance of file transmission. We propose a new algorithm for solving these problems. It doesn't perform memory copy between the user and kernel space. Hence, the number of memory copy and context switching is limited to the minimum. We have modified the network related source code of LINUX kernel 2.6.0 to analyzing the performance of proposed algorithm and implement new network system calls.

Spherical UO2 Kernel and TRISO Coated Particle Fabrication by GSP Method and CVD Technique (겔침전과 화학증착법에 의한 구형 UO2 입자와 TRISO 피복입자 제조)

  • Jeong, Kyung-Chai;Kim, Yeon-Ku;Oh, Seung-Chul;Cho, Moon-Sung
    • Journal of the Korean Ceramic Society
    • /
    • v.47 no.6
    • /
    • pp.590-597
    • /
    • 2010
  • HTGR using a TRISO coated particles as nuclear raw fuel material can be used to produce clean hydrogen gas and process heat for a next-generation energy source. For these purposes, a TRISO coated particle was prepared with 3 pyro-carbon (buffer, IPyC, and OPyC) layers and 1 silicone carbide (SiC) layer using a CVD technique on a spherical $UO_2$ kernel surface as a fissile material. In this study, a spherical $UO_2$ particle was prepared using a modified sol-gel method with a vibrating nozzle system, and TRISO coating fabrication was carried out using a fluidized bed reactor with coating gases, such as acetylene, propylene, and methyltrichlorosilane (MTS). As the results of this study, a spherical $UO_2$ kernel with a sphericity of 1+0.06 was obtained, and the main process parameters in the $UO_2$ kernel preparation were the well-formed nature of the spherical ADU liquid droplets and the suitable temperature control in the thermal treatment of intermediate compounds in the ADU, $UO_3$, and $UO_2$ conversions. Also, the important parameters for the TRISO coating procedure were the coating temperature and feed rate of the feeding gas in the PyC layer coating, the coating temperature, and the volume fraction of the reactant and inert gases in the SiC deposition.