• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.31-39
• /
• 2013

In this paper, we propose a power-efficient scheduling scheme that stochastically minimizes the power consumption of a real-time parallel task while meeting the deadline on multicore processors. The proposed scheme applies the parallel processing that executes a task on multiple cores concurrently, and activates a part of all available cores with unused cores powered off, in order to save power consumption. It is proved that the proposed scheme minimizes the mean power consumption of a real-time parallel task with probabilistic computation amount on DVFS-enabled multicore processors with a finite set of discrete clock frequencies. Evaluation shows that the proposed scheme saves up to 81% power consumption of the previous method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.12 no.5
• /
• pp.1197-1205
• /
• 1988

An analytical method to predict qualitative performance characteristics of the Stirling Engines in the preliminary design stages is investigated. Both the expansion and the compression cylinder are treated as adiabatic and piston motions are approximated as saw-toothed waves. Basic equations which were originally proposed by Finkelstein consist of mass conservation and energy balances for each adiabatic cylinder. The approximation on piston motions and physical conditions make it possible to divide an engine cycle into four fundamental processes. In each process, first, pressure can be expressed as a function of the crank angle by solving a nonlinear first order ordinary differential equation and other thermodynamic variables are determined in turn. Application of the cyclic steady condition to the whole processes can complete a cycle. Also, further analysis results in analytic expressions for cyclic work and heat transfer in terms of the engine parameters and thermodynamic variables at boundary points. The results are expected useful as a quick reference for the engine performances. Finally, the present method can be applied to the other adiabatic analyses on the Stirling Engines with piece wise linear piston motions, if mass variations are predictable.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.117-120
• /
• 1993

기게공업의 근간이라고 할 수 있는 공작기계산업은 첨단산업과 관련한 소재공업의 고도화에 따라 고속 고능률화 및 고정밀화 하여 가는 추세에 있으며 이에대한 성능향상 요구는 앞으로도 계속적으로 이어질것이다. 여기서 공작기계의 가공정밀도 및 가공 능률에 결정적인 영향을 주는 요소는 대부분 주축유닛트 부분이며 최근과 같이 고속 고정밀과 유연성을 추구하는 공작기계에서 주축 시스템이 수행하는 역할이란 매우 중요한 위치를 갖는다. 본 연구는 모터내장형 주축시스템에 관해 정.동적측면에서의 구조설계와 시제품에 대한 평가를 수행하여 활용측면에서의 신뢰성을 높일 수있도록 하는 것을 주요 내용으로 하였다. 즉 연구의 첫단계로서 정적인 측면에서의 구조설계를 하여 연구모델을 결정하였으며 다음단계로서 설정된 구조모델에 대해 유한요소 법(FEM)을 이용한 동적해석을 실시하고 실험해석에 의한 이론해석 과정의 수학적모델을 수정,보완한후 고속회전에서의 동적특성을 실제 현상에 가깝도록 예측하여 설계단계에서의 고속운전특성이 주축계의 동적안정성에 미치는 여러 영향등에 관해 고찰하였다.

• Annual Conference of KIPS
• /
• 2021.11a
• /
• pp.1116-1119
• /
• 2021

2018 년 Google 사의 사전 학습된 언어 인공지능 BERT 를 기점으로, 자연어 처리 학계는 주요 구조를 유지한 채 경쟁적으로 모델을 대형화하는 방향으로 발전했다. 그 결과, 오늘날 자연어 인공지능은 거대 사기업과 그에 준하는 컴퓨팅 자원을 소유한 연구 단체만의 전유물이 되었다. 본 논문에서는 다층 퍼셉트론을 병렬적으로 배열해 자연어 인공지능을 제작하는 기법의 모델을 제안하고, 이를 적용한'조건부 게이트 다층 퍼셉트론 모델(SG-MLP)'을 구현하고 그 결과를 비교 관찰하였다. SG-MLP 는 BERT 의 20%에 해당하는 사전 학습량만으로 다수의 지표에서 그것과 준하는 성능을 보였고, 동일한 과제에 대해 더 적은 연산 비용을 소요한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2179-2188
• /
• 1994

In this paper, we studied the deployment of AIN(Advanced Intelligent Network) that was recommended by ITU-T there are five methods of deployment. Here we divided these methods into two types. One is the direct connection with SCP(Service Control Point) and IP(Intelligent Peripheral) via No.7 and the other is the indirect connection with SCP and IP Through SSP(Service Switching Point). First, we suggested the structure of AIN SSP and defined S/W functional blocks. Second, we proposed H/W functional extension for interaction with IP. On the basis of the suggested structure, we mathematically evaluated and simulated two types of the deployment of AIN. In the result, we knew that, in comparison with the indirect method, the direct method was effective.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.385-390
• /
• 2010

Fair and efficient bandwidth allocation methods using the coalition game theory and the bargaining game theory following the axiomatic approach have been proposed when sending nodes with different traffic input rate try to share the bandwidth. These methods satisfy the axiomatic fairness provided by the mathematical ground of the game theories. However, since the axioms of the two game models are different from one another, the allocated bandwidths to each sending nodes become different even in the same communication environments. Thus, in this paper, we model the bandwidth allocation problem with these game theories, and quantitatively compare and analyze the allocated bandwidth and loss rate of each sending nodes in various communication environments. The results show that the bargaining game allocates relatively less bandwidth to a node with a higher sending rate than that with a lower sending rate while coalition game allocates bandwidth according to the sending rate of each node.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2797-2806
• /
• 2000

Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.1-7
• /
• 2019

In this paper, we propose an approach to design a practical filter and a mathematical modeling for images. In the areas of signal processing, including high-dimensional image processing, the filtering process has been fundamental and crucial in diverse practical applications such as image processing, computer vision, and pattern recognition. In general, the ideal filter is modeled as circular-shaped in the 2D frequency domain as the rectangular shape is ideal for the 1D frequency domain. This paper proposes an approach to modeling practical and efficient image filter in the 2D frequency domain. Instead of employing a circular-shaped filter, this study proposes a polygon-shaped filter inspired by the concept of a hexagon cellular system for frequency reuse in wireless communication systems. By employing the concept of frequency reuse, bandwidth efficiency is also achieved in the frequency domain. To substantiate the proposed approach, quantitative evaluation is performed using PSNR.