• Title/Summary/Keyword: Design of algorithm

Search Result 10,333, Processing Time 0.041 seconds

Developement of Planar Active Array Antenna System for Radar (평면형 능동 위상 배열 레이더용 안테나 시스템 개발)

  • Chon, Sang-Mi;Na, Hyung-Gi;Kim, Soo-Bum;Lee, Jeong-Won;Kim, Dong-Yoon;Kim, Seon-Joo;Ahn, Chang-Soo;Lee, Chang-Hee
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.12
    • /
    • pp.1340-1350
    • /
    • 2009
  • The design and implementation of planar Active Phased Array Antenna System are described in this paper. This Antenna system operates at X-band with its bandwidth 10 % and dual polarization is realized using dual slot feeding microstrip patch antenna and SPDT(Single Pole Double Through) switch. Array Structure is $16\times16$ triangular lattice structure and each array is composed of TR(Transmit & Receive) module with more than 40 dBm power. Each TR module includes digital attenuator and phase shifter so that antenna beam can be electronically steered over a scan angle$({\pm}60^{\circ})$. Measurement of antenna pattern is conducted using a near field chamber and the results coincide with the expected beam pattern. From these results, it can be convinced that this antenna can be used with control of beam steering and beam shaping.

Development of Self-trainer Fitness Wear Based on Silicone-MWCNT Sensor (실리콘-탄소나노튜브 센서 기반의 셀프트레이너 피트니스 웨어 개발)

  • Cho, Seong-Hun;Kim, Kyung-Mi;Cho, Ha-Kyung;Won, You-Seuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.493-503
    • /
    • 2018
  • Recently, as living standards have improved, many people are becoming more interested in health, and self-training is increasing through exercise to prevent and manage pre-illness. In general, an imbalance of muscles causes asymmetry of posture, which can cause various diseases by accompanying an adjustment force, circulation action, displacement of internal organs, etc.. In this study, the development of fitness software that can be self - training among smart wears has attracted considerable attention in recent years. In this study, a technology was proposed for the commercialization of self - trainer fitness wear by a simulation through Android - based applications. Self - trainer fitness software was developed by combining a conductive polymer, fashion design, sewing, and electric and electronic technology to monitor the unbalance of the muscles during exercise and make smart wear that can calibrate the asymmetry by oneself. In particular, a polymer sensor was fabricated by deriving the optimal MWCNT concentration, and the electrode signal was collected by attaching the electrode to the optimal position, where the electrode signal line using the conductive fiber was designed and attached to collect the signal. A signal module that converts the bio-signals collected through electrical signal conversion and transmits them using Bluetooth communication was designed and manufactured. Self-trainer fitness software that can be commercialized was developed by combining noise cancellation with Android-based self-training application using a software algorithm method.

Low Power Implementation of Integrated Cryptographic Engine for Smart Cards (스마트카드 적용을 위한 저전력 통합 암호화 엔진의 설계)

  • Kim, Yong-Hee;Jeong, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.80-88
    • /
    • 2008
  • In this paper, the block cipher algorithms, 3-DES(Triple Data Encryption Standard), AES(Advanced Encryption Standard), SEED, HASH(SHA-1), which are domestic and international standards, have been implemented as an integrated cryptographic engine for smart card applications. For small area and low power design which are essential requirements for portable devices, arithmetic resources are shared for iteration steps in each algorithm, and a two-level clock gating technique was used to reduce the dynamic power consumption. The integrated cryptographic engine was verified with ALTERA Excalbur EPXA10F1020C device, requiring 7,729 LEs(Logic Elements) and 512 Bytes ROM, and its maximum clock speed was 24.83 MHz. When designed by using Samsung 0.18 um STD130 standard cell library, the engine consisted of 44,452 gates and had up to 50 MHz operation clock speed. It was estimated to consume 2.96 mW, 3.03 mW, 2.63 mW, 7.06 mW power at 3-DES, AES, SEED, SHA-1 modes respectively when operating at 25 MHz clock. We found that it has better area-power optimized structure than other existing designs for smart cards and various embedded security systems.

Removing SAR Speckle Noise Based on the Edge Sharpenig Algorithm (경계선 보존을 기반으로 한 SAR 영상의 잡영 제거 알고리즘에 대한 연구)

  • 손홍규;박정환;피문희
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2003.04a
    • /
    • pp.3-8
    • /
    • 2003
  • 모든 SAR 영상에는 전자기파 간의 간섭으로 인한 스페클 잡영(speckle)이 존재하며, 이를 제거하는 것은 양질의 SAR 영상을 얻기 위한 필수적인 전처리 과정 중 하나라고 할 수 있다. 그러나 이러한 스페클 잡영을 제거하기 위하여 기존에 제안되었던 알고리즘은 잡영은 효과적으로 감소시키는 반면 경계선과 같은 영상의 고유 정보까지 함께 감소시키는 한계가 있었다. 따라서 본 연구에서는 SAR 영상의 경계선은 보존시키면서 영상으로부터 불필요한 잡영을 제거할 수 있는 알고리즘을 구현하고, 기존의 알고리즘과 비교하여 그 효율성을 평가하고자 한다. 영상의 통계적 특성에 근거하는 기존의 알고리즘과는 달리 웨이블렛 변환(Wavelet transform)으로 경계선 및 특징 정보의 여부를 판별한 후 평균 필터(mean filter)를 적용하는 경계선 보존(edge sharpening) 알고리즘은 경계 정보의 신뢰성을 향상시킬 수 있으며, 1차원 필터를 수평, 수직, 대각선, 역대각선 방향으로 적용함으로써 하나의 영상소를 중심으로 모든 방향에 대한 경계선 여부를 확인할 수 있는 장점이 있다. 본 연구에서는 512 × 512로 절취한 1-look SAR 영상에 대하여 창 크기 5 × 5의 경계선 보존 필터를 적용하고 동일영상에 대하여 기존의 Lee, Kuan, Frost 필터 등의 실험결과를 비교함으로써 그 적합성을 판단하고자 하였다. 실험결과에 대한 수치적인 평가는 ①정규화 평균을 이용하여 평균값의 보존 여부, ②편차 계수를 이용한 스페클 잡영의 제거 여부, ③경계선 보존지수(EPI)를 이용한 경계선의 보존 정도를 통해 이루어졌다. 본 연구의 실험결과를 통해 경계선 보존 필터는 평균값의 보존 여부 및 스페클 잡영 제거 정도에 있어 다른 필터들과 큰 차이가 없지만 경계선보존지수는 다른 필터들에 비하여 가장 우수함을 확인할 수 있었다.rbon 탐식효율을 조사한 결과 B, D 및 E 분획에서 유의적인 효과를 나타내었다. 이상의 결과를 종합해볼 때, ${\beta}$-glucan은 고용량일 때 직접적으로 또는 $IFN-{\gamma}$ 존재시에는 저용량에서도 복강 큰 포식세로를 활성화시킬 뿐 아니라, 탐식효율도 높임으로써 면역기능을 증진 시키는 것으로 나타났고, 그 효과는 crude ${\beta}$-glucan의 추출조건에 따라 달라지는 것을 알 수 있었다.eveloped. Design concepts and control methods of a new crane will be introduced in this paper.and momentum balance was applied to the fluid field of bundle. while the movement of′ individual material was taken into account. The constitutive model relating the surface force and the deformation of bundle was introduced by considering a representative prodedure that stands for the bundle movement. Then a fundamental equations system could be simplified considering a steady state of the process. On the basis of the simplified model, the simulation was performed and the results could be confirmed by the experiments under various conditions.뢰, 결속 등 다차원

  • PDF

Design and Implementation of Telematics Contents Gateway Based on Interoperability (상호운영성 기반의 텔레매틱스 컨텐츠 게이트웨이 설계 및 구현)

  • Kim, Do-Hyun;Min, Kyoung-Wook;Jang, Byung-Tae;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.249-264
    • /
    • 2007
  • As the need for telematics contents services due to the frequent traveling of people is increasing, it is necessary to provide various telematics contents by connecting and integrating current telematics contents which are collected and provided by each individual data provider. However, it is difficult to integrate or exchange the current telematics contents, because the data providers use different telematics contents models. Therefore, we propose a 'telematics contents gateway(TCG); system, which enables to integrate different telematics contents, so that the contents can be interoperable. The TCG can be a solution for several problems in the current telematics contents providing system. First of all, it has been impossible to search the contents without any information about data providers, because of the absence of metadata in the current systems. For this problem, TCG supports a search function based on a web-service technology. Second, TCG provides a common road network model for interoperability, and the model can be a solution to integrate different road network models into the common model. Moreover, integration algorithm for enhancing the correctness of integration will be proposed. In addition, it is designed by multi threads and multi queue structure. The TCG developed with C# on a windows system has been running and we verified that there was no information loss in the integration process. In addition, the speed of content integration and transfer satisfied the requirement of telematics services providers.

Design and Implementation of Sensibilities Lighting LED Controller using Modbus for a Ship (Modbus를 이용한 선박용 감성조명 LED 제어기의 설계 및 구현)

  • Jeong, Jeong-Soo;Lee, Sang-Bae
    • Journal of Navigation and Port Research
    • /
    • v.39 no.4
    • /
    • pp.299-305
    • /
    • 2015
  • Modbus is a serial communications protocol, it has since become a practically standard communication protocol, and it is now a commonly available means of connecting industrial electronic devices. Therefore, it can be connected with all devices using Modbus protocol to the measurement and remote control on the ships, buildings, trains, airplanes and etc.. In this paper, we add the Modbus communication protocol to the existing lighting controller sensitivity to enable verification and remote control by external environmental factors, and also introduces a fuzzy inference system was configured by external environmental factors to control LED lighting. External environmental factors of temperature, humidity, illuminance value represented by the LED through a fuzzy control algorithm, the values accepted by the controller through the sensor. Modbus is using the RS485 Serial communication with other devices connected to the temperature, humidity, illumination and LED output status check is possible. In addition, the remote user is changed to enable it is possible to change the RGB values in the desired color change. Produced was confirmed that the LED controller output is based on the temperature, humidity and illumination.

Short-Term Prediction of Vehicle Speed on Main City Roads using the k-Nearest Neighbor Algorithm (k-Nearest Neighbor 알고리즘을 이용한 도심 내 주요 도로 구간의 교통속도 단기 예측 방법)

  • Rasyidi, Mohammad Arif;Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.1
    • /
    • pp.121-131
    • /
    • 2014
  • Traffic speed is an important measure in transportation. It can be employed for various purposes, including traffic congestion detection, travel time estimation, and road design. Consequently, accurate speed prediction is essential in the development of intelligent transportation systems. In this paper, we present an analysis and speed prediction of a certain road section in Busan, South Korea. In previous works, only historical data of the target link are used for prediction. Here, we extract features from real traffic data by considering the neighboring links. After obtaining the candidate features, linear regression, model tree, and k-nearest neighbor (k-NN) are employed for both feature selection and speed prediction. The experiment results show that k-NN outperforms model tree and linear regression for the given dataset. Compared to the other predictors, k-NN significantly reduces the error measures that we use, including mean absolute percentage error (MAPE) and root mean square error (RMSE).

Baseline Wander Removing Method Based on Morphological Filter for Efficient QRS Detection (효율적인 QRS 검출을 위한 형태 연산 기반의 기저선 잡음 제거 기법)

  • Cho, Ik-Sung;Kim, Joo-Man;Kim, Seon-Jong;Kwon, Hyeog-Soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.166-174
    • /
    • 2013
  • QRS detection of ECG is the most popular and easy way to detect cardiac-disease. But it is difficult to analyze the ECG signal because of various noise types. The important problem in recording ECG signal is a baseline wandering, which is occurred by rhythm of respiration and muscle contraction attaching to an electrode. Particularly, in the healthcare system that must continuously monitor people's situation, it is necessary to process ECG signal in realtime. In other words, the design of algorithm that exactly detects QRS region using minimal computation by analyzing the person's physical condition and/or environment is needed. Therefore, baseline wander removing method based on morphological filter for efficient QRS detection method is presented in this paper. For this purpose, we detected QRS through the preprocessing method using morphological filter, adaptive threshold, and window. The signal distortion ratio of the proposed method is compared with other filtering method. Also, R wave detection is evaluated by using MIT-BIH arrhythmia database. Experiment result show that proposed method removes baseline wanders effectively without significant morphological distortion.

A Study on the Improvement of Injection Molding Process Using CAE and Decision-tree (CAE와 Decision-tree를 이용한 사출성형 공정개선에 관한 연구)

  • Hwang, Soonhwan;Han, Seong-Ryeol;Lee, Hoojin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.4
    • /
    • pp.580-586
    • /
    • 2021
  • The CAT methodology is a numerical analysis technique using CAE. Recently, a methodology of applying artificial intelligence techniques to a simulation has been studied. A previous study compared the deformation results according to the injection molding process using a machine learning technique. Although MLP has excellent prediction performance, it lacks an explanation of the decision process and is like a black box. In this study, data was generated using Autodesk Moldflow 2018, an injection molding analysis software. Several Machine Learning Algorithms models were developed using RapidMiner version 9.5, a machine learning platform software, and the root mean square error was compared. The decision-tree showed better prediction performance than other machine learning techniques with the RMSE values. The classification criterion can be increased according to the Maximal Depth that determines the size of the Decision-tree, but the complexity also increases. The simulation showed that by selecting an intermediate value that satisfies the constraint based on the changed position, there was 7.7% improvement compared to the previous simulation.

Minimum Cost Path for Private Network Design (개인통신망 설계를 위한 최소 비용 경로)

  • Choe, Hong-Sik;Lee, Ju-Yeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1373-1381
    • /
    • 1999
  • 이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.