• Korean Journal of Veterinary Research
• /
• v.53 no.2
• /
• pp.73-76
• /
• 2013

The aim of this study was to produce a simple and inexpensive technique for estimating the obturator foramen area (OFA) from young calves based on the hypothesis that OFA can be extrapolated from simple linear measurements. Three linear measurements - dorsoventral height, craneocaudal width and total perimeter of obturator foramen - were obtained from 55 bovine hemicoxae. Different algorithms for determining OFA were then produced with a regression analysis (curve fitting) and statistical analysis software. The most simple equation was OFA ($mm^2$) = [3,150.538 + ($36.111^*CW$)] - [147,856.033/DH] (where CW = craneocaudal width and DH = dorsoventral height, both in mm), representing a good nonlinear model with a standard deviation of error for the estimate of 232.44 and a coefficient of multiple determination of 0.846. This formula may be helpful as a repeatable and easily performed estimation of the obturator foramen area in young bovines. The area of the obturator foramen magnum can thus be estimated using this regression formula.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.111-118
• /
• 2013

This paper presents implementation of Air protocol analyzer and physical layer design algorithm. The analyzer is a measurement system providing real-time analysis of wireless signals between User Equipment (UE) and Node-B. The implemented system proposed in this paper consists of Digital Signal Processors (DSPs) and Field Programmable Gate Arrays (FPGAs). The waveform of Wideband Code Division Multiple Access (WCDMA) has been selected for verification of the proposed system. We designed the analyzer using equalizer algorithm and rake-receiver algorithm. Among various algorithms of designing the equalizer, we have chosen Linear Minimum Mean Square Error (LMMSE) equalizer that uses the inverse of channel matrix. Since the LMMSE equalizer uses the inverse channel matrix, it suffers from a large amount of computational load, while it outperforms most conventional equalizers. In this paper, we introduce an efficient procedure of reducing the computational load required by LMMSE equalizer-based receiver.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.130-130
• /
• 1999

In this paper, we propose a novel design method for improving performance of existing FCM-type clustering algorithms. First, we define the performance measure which focuses on bothcompactness and separation of clusters. Next, we optimize this measure using evolution program.Especially the proposed method has following merits: ① using evolution program, it solves suchproblems as initialization, number of clusters, and convergence to local optimum ② it reduces searchspace and improves convergence speed of algorithm since it represents chromosome with possiblepotential centers which are selected possible candidates of centers by density measure ③ it improvesperformance of clustering algorithm with the performance index which embedded both compactnessand separation Properties ④ it is robust to noise data since it minimizes its effect on center search.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Journal of Power Electronics
• /
• v.2 no.1
• /
• pp.25-31
• /
• 2002

Servo drives with microcomputer control provide the possibility of using modern and sophisticated control algorithms. As an additional feature it is possible to implement parallel and/or redundant software and hardware structures to realise safe motion or similar security functions. Unfortunately microcomputer control also has some impact on the behaviour of servo drives. Control algorithm, cycle time, sensors and interface have to be perfectly synchronised. Special control schemes are necessary on the line side (power supply) to meet the actual requirements concerning EMC. This contribution presents experiences and results obtained from a modern digital drive system pointing out the influences of low and high accuracy position sensors and the interdependencies mentioned above.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.353-360
• /
• 2004

In this paper we describe Task-Based Problem Solving Adapters (TPSAs) for modeling a humam solution (through activity-centered analysis) to a software solution (in form of computer-based artifact). TPSAs are derived from the problem solving pattern or consistent problem solving structures/strategies employed by practitioners while designing solutions to complex problems. The adapters developed by us lead toward human-centeredness in their design and underpinning that help us to address the pragmatic task constraints through a range of technologies like neural networks, fuzzy logic, and genetic algorithms. We also outline an example of applying the TPSAs to develop a working system for assisting sales engineers of an electrical manufacturing firm in preparing indent and monitoring the status of orders in the company.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.143-146
• /
• 2018

서명기반 악성코드 탐지는 악성 파일의 고유 해싱 값을 사용하거나 패턴화된 공격 규칙을 이용하므로, 변형된 악성코드 탐지에 취약한 단점이 있다. 기계 학습을 적용한 악성코드 탐지는 이러한 취약점을 극복할 수 있는 방안으로 인식되고 있다. 본 논문은 정적 분석으로 n-gram과 API 특징점을 추출해 특징 벡터로 구성하여 XGBoost, k-최근접 이웃 알고리즘, 지지 벡터 기기, 신경망 알고리즘, 심층 학습 알고리즘의 일반화 성능을 비교한다. 실험 결과로 XGBoost가 일반화 성능이 99%로 가장 우수했으며 k-최근접 이웃 알고리즘이 학습 시간이 가장 적게 소요됐다. 일반화 성능과 시간 복잡도 측면에서 XGBoost가 비교 대상 알고리즘에 비해 우수한 성능을 보였다.

• IE interfaces
• /
• v.8 no.2
• /
• pp.171-183
• /
• 1995

A special purpose automated storage and retrieval system is developed in which information media such as compact disc or video tapes can be stored. Hardware system includes rack, stacker crane with robot arm, conveyor, and bar code reader. Software system includes database for address management, user interface for quick scanning of information media by displaying moving image, and algorithms for selecting the closest open location. Such system is widely applicable to CD library or broadcasting station in the forthcoming information age. In this paper we present detailed procedure and tools that are used in designing and implementing such a special AS/R system.

• Journal of KIISE:Software and Applications
• /
• v.26 no.2
• /
• pp.297-305
• /
• 1999

본 논문에서는 컴퓨터를 사용한 이진 위상 홀로그램의 설계시 요구되는 조합 최적화 문제(combinatorial optimization problem)를 유전자 알고리즘을 사용하여 해결하고자한다. 이진 위상 홀로그램의 설게는 출력 면에서 원하는 이미지를 생성하기 위하여 홀로그램의 각 셀에 이진 위상을 결정하는 것으로 최적화 문제로 귀착된다. 유전자 알고리즘을 이진 위상 홀로그램 설계에 효율적으로 적용하기 위하여 이차원 염색체 부호화 및 주기성을 고려한 교차 연산자등을 사용하면, 그 결과 홀로그램 설계시 요구되는 이차원 퓨리에 변환(Fourier transform)을 자연스럽고 효율적인 방법으로 수행할수 있다. 유전자 알고리즘을 사용하여 구한 최적의 이진 위상 배열로 공간 빛 변조기(spatial light modulator, SLM)를 이용하여 광학적으로 이미지를 재생하고, 재생된 광학 이미지는 원하는 이미지와 거의 일치함을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.25-27
• /
• 2001

설계 재활용을 위하여서는, 반도체 지적 소유권(Intellectual property)의 표준화와 더불어 레이아웃 자동 이식에 관한 연구와 상품화가 필수적이다. 본 논문은 반도체 설계 형식 중에서 생산 공정과 밀접한 레이아웃 형식의 회로도면 처리를 자동화하여 설계와 생산 시간을 혁신적으로 단축하기 위한 연구이다. 레이아웃 형식은 특성상 도형(폴리곤)으로 구성되어 있으며, 레이아웃 형태에서 다양한 도형의 중첩이 반도체의 트랜지스터, 저항, 캐피시터를 표현함으로써, 반도체 지적소유권의 한 형식으로 자주 활용되고 있다. 본 논문은 반도체 레이아웃 이식 소프트웨어 시스템의 내부 기능에 관한 설명과 처리 능력과 속도를 높이기 위한 알고리즘의 제안과 벤치마킹 결과를 보여 주고 있다. 비교 결과, 자원의 최적 활용(41%)으로 대용량의 처리 가능성을 보여 주고 있으며, 처리 속도는 평균 27배로써 이전의 벤치마킹 회로를 더욱 크게 하여 그 결과를 보여 주고 있다. 이러한 비교 우위는 본 논문에 포함된 소자 처리 알고리즘과 그래프를 이용한 컴팩션 알고리즘에 기인한다. 지면상의 연유로, 참고1에서는 기능 설명을, 본 논문은 알고리즘의 구현에 관한 설명을 중점적으로 기술한다.