• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.960-963
• /
• 2014

최근 매쉬업에 대한 관심도가 매우 높아짐에 따라 수많은 Web API들이 생성되고 있다. 이런 Web API들을 매쉬업 속으로 결합할 때 여러 가지 이슈들이 존재한다. 특히, 수많은 API들이 매쉬업 개발자에 의해 수동으로 조합될 때 이는 더욱 심각해진다. 본 논문에서는 Web API 발견 및 조합을 위한 하나의 새로운 기법을 제안한다. 제안된 발견 기법은 질의를 만족시키지 못하는 API들을 재빨리 필터링 시키는 전략을 수립한다. API 조합 기법은 발견 기법을 확장/발전시켜 Web API 입출력 사이의 시맨틱 유사도를 기반으로 하고, 원하는 목표를 만족하는 출력을 산출할 수 있는 사이클 없는 방향성 그래프(DAG)를 생성한다. 또한, Web API 발견 및 조합을 효율적으로 생성하기 위해 본 논문에서는 Web API 발견 및 조합 시스템을 구현한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.611-612
• /
• 2019

각 X, Y, Z축들의 이동거리, 가속도, 방향등을 측정하여 수치로 표현해주는 9축 자이로스코프를 이용하여 단순히 자세를 분석만 하는 기존의 프로그램과는 달리 타이거 우즈 같은 세계적인 선수들의 자세와 비교를 하여 사용자에게 만족을 줄 수 있는 시스템을 개발한다. 이 어플리케이션의 핵심 기술은 그 무엇보다도 두 벡터 그래프의 유사도를 비교해주는 알고리즘을 얼마나 효율적으로 설계를 할 것인지와 이 기법을 유니티3D를 통해 구현해 내는 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.346-349
• /
• 2019

본 연구를 통해 당구를 처음 접하는 사람들이 혼자서도 올바른 스트로크 자세를 연습할 수 있도록 하기 위한 시스템을 설계하였다. 6 축 자이로 센서를 활용하여 가속도, 각속도 센서 값을 안드로이드와 BLE 통신으로 수집하고 그 값으로 스트로크의 속도와 각도, 방향을 계산하여 유사율을 나타낸다. 또한 터치센서에 스트로크 시에 타격감을 주기 위하여 모바일의 진동을 울려주며, 센서에 터치 된 값을 이용하여 사용자가 실제 타격한 당구공의 타점을 모바일에서 실시간으로 보여준다. 동시에 앞서 계산된 유사율을 그래프와 수치상으로 확인할 수 있다. 모범 자세와 비교한 피드백을 통하여 올바른 스트로크 자세를 익힐 수 있도록 도와준다.

• Food Engineering Progress
• /
• v.14 no.1
• /
• pp.35-40
• /
• 2010

Electronic nose (E-nose) was assessed for grading pungency of powdered red pepper. Complex pretreatments are not required for flavor analysis unlike HPLC or Scoville tests. Mild and pungent taste of powdered red pepper were mixed at various concentrations of 0, 25, 50, 75, and 100%. Those were analyzed using mass spectrometer-based E-nose. Discriminant function analysis (DFA) was conducted on E-nose data. The $R^{2}$ and F-value of dicriminant function first score (DF1) were 0.9946 and 355.65, respectively, when the samples were separated by a relative degree of pungent taste. DF1 value decreased with increasing the amount of powdered red pepper with a pungent taste. It is similar to the increase in the concentration of capsaicin. Increasing the amount of red pepper powder, dicriminant function second score (DF2) values were moved from the negative position into the positive position. The $R^{2}$ and F-value of DF1 were 0.9890, 165.17 and DF2 were 0.9219, 21.64. Also, the results by MS based E-nose agreed to that by HPLC. There is the potential to grade pungent taste of powdered red pepper using the E-nose.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.708-714
• /
• 2000

In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.86-95
• /
• 2009

Efficient DAG scheduling is critical for achieving high performance in heterogeneous computing environments. Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph(DAG) onto a set of heterogeneous machines is known to be an NP-complete problem. In this paper we propose a new list scheduling algorithm, called the Heterogeneous Rank-Path Scheduling(HRPS) algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing system. The primary goal of HRPS is to minimize the schedule length of applications. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithm such as CPOP, HCPT and FLB in term of the schedule length. The comparison studies show that HRPS significantly outperform CPOP, HCPT and FLB in schedule length.

• Journal of the Korean Society for Railway
• /
• v.17 no.1
• /
• pp.7-13
• /
• 2014

Stiffness variations and wave propagation/reflection in railway catenaries are the primary sources of contact loss between a pantograph and a railway contact wire. This paper analyzes which design parameter is more important for 200km/h conventional rail and 300km/h high-speed rail, in order to effectively reduce the contact loss. For the high-speed rail, the wave propagation and reflection in the overhead contact lines are more influential than the stiffness variation over a span. When the high-speed rail needs to speed-up, it is necessary to develop higher strength contact wires in order to increase the wave propagation speed. In addition, the dropper clamp mass should be reduced in order to alleviate the wave reflection. However, it is noted that the increase in the tension to a messenger wire could deteriorate the current collection quality, which contrasts with expectations. For the 200km/h conventional rail, the stiffness variation over a span is more influential than the wave propagation and reflection. Therefore, shortening span length, increasing the tension in the contact wire and optimizing the location of the droppers are recommended for a smoother stiffness variation over the span.

• The Korean Journal of Applied Statistics
• /
• v.30 no.3
• /
• pp.403-415
• /
• 2017

In this paper, we investigate cosponsorship networks found in the 17th National Assembly of Republic of Korea. New legislation should be sponsored by at least 10 legislators including one main sponsor. Cosponsorship networks can be constructed, using directional links from cosponsors of legislation to its main sponsor; subsequently, these networks indicate the social relationships among the legislators. We apply Exponential Random Graph Model (ERGM) for valued networks to capture structural properties and the covariate effects of networks. We find the effect of the same party has the greatest influence on the composition of the network. Mutuality also plays an important role in the cosponsorship network; in addition, the effect of the number of elections won by a legislator has a small but significant influence.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.135-145
• /
• 2010

Efficient Directed Acyclic Graph(DAG) scheduling is critical for achieving high performance in Distributed Heterogeneous computing System(DHCS). In this paper, we present a new high-performance scheduling algorithm, called the LCFT(Levelized Critical First Task) algorithm, for DHCS. The LCFT algorithm is a list-based scheduling that uses a new attribute to efficiently select tasks for scheduling in DHCS. The complexity of LCFT is $O(\upsilon+e)(p+log\;\upsilon)$. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithms such as PETS, HPS, HCPT and GCA in terms of the schedule length and SpeedUp. The comparison studies show that LCFT significantly outperforms PETS, HPS, HCPT and GCA in schedule length, SpeedUp.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.608-616
• /
• 2001

This paper proposes a face recognition technique that effectively combines fixed graph matching (FGM) and Fisherface algorithm. EGM as one of dynamic link architecture uses not only face-shape but also the gray information of image, and Fisherface algorithm as a class specific method is robust about variations such as lighting direction and facial expression. In the proposed face recognition adopting the above two methods, linear projection per node of an image graph reduces dimensionality of labeled graph vector and provides a feature space to be used effectively for the classification. In comparison with a conventional EGM, the proposed approach could obtain satisfactory results in the perspectives of recognition speeds. Especially, we could get higher average recognition rate of 90.1% than the conventional methods by hold-out method for the experiments with the Yale Face Databases and Olivetti Research Laboratory (ORL) Databases.