• 수산경영론집
• /
• 제46권3호
• /
• pp.143-161
• /
• 2015

This study presents a comparative analysis on mackerel distribution process and price formation process, and investigation of price and margin between traditional markets and Large-scale discount store distribution channel. Through this, the study investigated distribution efficiency of each channel, and examined whether a difference of distribution efficiency leads to a difference of performance through the investigation of a difference of function and role between members of a wholesale market and vendor of Large scale discount store. The following are the results of this study. As a consequence of investigating supply and sum by distribution channel of mackerel, it appeared that mackerels shipped from port market are distributed into 9 consumption sites(Wholesale market, Large scale discount store, Institutional Food Service, etc.). In the comparison of distribution efficiency between traditional retail store and Large scale discount store 52.0% margin is formed in traditional retail store distribution channel and 43.1% margin is formed in Large scale discount store, and a distribution cost rate consists of 19.4% cost in a traditional retail store for fishery products and 18.1% cost in a Large-scale discount store. To analyze a difference of performance, the study examine a difference of role and function between vendor and Wholesale market company, wholesaler and middleman. Wholesale market company and middleman of wholesale market for consumer have slightly high or similar score in collection function, sorting function, evaluation function and financial function which are traditional and original. However, it was confirmed that vendor has a better score in other functions, that is, newly-demanded functions(ex : market frontier function, product development function, Integral Distribution Function, etc.).

• 한국정보통신학회논문지
• /
• 제14권4호
• /
• pp.939-947
• /
• 2010

IEEE 802.11n 무선 랜 표준의 채널 부호화 방법 중 하나인 LDPC(Low-Density Parity-Check) 부호는 오류정정 성능이 매우 우수하나 복호기 회로의 복잡도가 커서 복호성능과 하드웨어 복잡도 사이의 trade-off 관계를 고려한 설계가 중요하다. 본 논문에서는 최소합 알고리듬(Min-Sum Algorithm; MSA) 기반 LDPC 복호기에서 LLR(Log-Likelihood Ratio) 근사화가 복호성능에 미치는 영향을 분석하고, 이를 통해 LDPC 복호기의 최적 설계조건을 도출하였다. IEEE 802.11n 무선 랜 표준의 블록길이 1,944 비트, 부호화율 1/2의 LDPC 패리티 검사 행렬과 최소합 기반의 반복복호 알고리듬을 적용하여 LLR 근사화에 따른 비트오율(BER) 성능을 분석하였다. $BER=10^{-3}$에 대해 LLR 비트 폭 (6,4)와 (7,5)의 $E_b/N_o$는 0.62 dB의 차이를 보였으며, 최대 반복복호 횟수 6과 7에 대한 $E_b/N_o$의 차이는 약 0.3 dB로 나타났다. 시뮬레이션 결과로부터, LLR 근사화 비트 폭이 (7,5)이고 반복복호 횟수가 7인 경우에 가장 우수한 비트오율 성능을 나타내었다.

• 한국정보전자통신기술학회논문지
• /
• 제12권6호
• /
• pp.636-642
• /
• 2019

본 논문에서는 다중 입출력 시스템을 위한 MMSE (Minimum Mean Square Error) 기반 연판정 간섭 제거 기법의 검출 순서에 따른 BER (Bit Error Rate) 통신 성능을 분석하였다. 검출 순서 방식으로 안테나 Index 순서 방식, 채널 원소들의 절대값 크기 순서 방식, 채널 원소들의 절대값 합의 크기 순서 방식, SNR (Signal Noise Ratio) 순서 방식에 대하여 제안하였으며, 시뮬레이션을 통해 각각의 제안된 검출 순서 방식에 대한 BER 성능을 측정 및 분석하였다. 시뮬레이션 환경으로 M×M 다중 입출력 시스템의 비부호화 환경에서 16-QAM (Quadrature Amplitude Modulation) 변조 방식을 사용하였으며, 독립적 레일리 감쇄 채널이 고려되었다. 시뮬레이션 결과를 통해 SNR 기반의 검출 순서 방식이 M=4 일 때 성능이득은 약 1.5dB, M=8일 경우 성능이득은 약 3.5dB, M=16일 경우 성능이득은 약 3.5dB로 안테나 수가 증가할수록 더 큰 BER 성능 향상을 확인하였으며, 이는 수신 신호의 검출 순서 방식이 검출 과정에서 발생하는 간섭 및 오류 확산을 방지하고 있음을 나타낸다.

• 제어로봇시스템학회논문지
• /
• 제6권8호
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.457-468
• /
• 2007

This paper proposes an adaptive moving average (A-MA) control chart with variable sampling intervals (VSI) for detecting shifts in the process mean. The basic idea of the VSI A-MA chart is to adjust sampling intervals as well as to accumulate previous samples selectively in order to increase the sensitivity. The VSI A-MA chart employs a threshold limit to determine whether or not to increase sampling rate as well as to accumulate previous samples. If a standardized control statistic falls outside the threshold limit, the next sample is taken with higher sampling rate and is accumulated to calculate the next control statistic. If the control statistic falls within the threshold limit, the next sample is taken with lower sampling rate and only the sample is used to get the control statistic. The VSI A-MA chart produces an 'out-of-control' signal either when any control statistic falls outside the control limit or when L-consecutive control statistics fall outside the threshold limit. The control length L is introduced to prevent small mean shifts from being undetected for a long period. A Markov chain model is employed to investigate the VSI A-MA sampling process. Formulae related to the steady state average time-to signal (ATS) for an in-control state and out-of-control state are derived in closed forms. A statistical design procedure for the VSI A-MA chart is proposed. Comparative studies show that the proposed VSI A-MA chart is uniformly superior to the adaptive Cumulative sum (CUSUM) chart and to the Exponentially Weighted Moving Average (EWMA) chart, and is comparable to the variable sampling size (VSS) VSI EWMA chart with respect to the ATS performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• 한국지능시스템학회논문지
• /
• 제15권4호
• /
• pp.400-405
• /
• 2005

본 논문에서는 고유얼굴을 이용한 얼굴인식 시스템의 성능을 분석한다. 개인의 신분을 확인하는 시스템의 단점을 보완하기 위하여 최근 생체인식 기술이 활발하게 연구되어오고 있으며, 그 중에서도 얼굴인식은 직관적인 이해가 가능하기 때문에 컴퓨터 비전과 패턴인식 분야에서 폭 넓게 연구되고 있다. 고유얼굴을 이용한 얼굴인식 방법은 훈련집합의 얼굴 이미지의 중요한 변화를 효율적으로 표현하는 특징 공간으로 투영시키면서 이루어진다. 여기서 특징 공간에 투영된 얼굴 이미지의 특징을 고유얼굴이라 한다. 개개의 얼굴 이미지는 고유얼굴의 가중함으로 근사화 되므로, 입력 얼굴의 인식은 훈련집합의 가중치와 입력 영상의 가중치를 비교하면서 이루어진다. 본 논문에서는 고유얼굴을 이용한 얼굴인식 방법의 성능을 검증하기 위해서 Harvard 데이터베이스를 이용하였으며, 시스템의 성능 분석을 위하여 조명에 대한 인식성능의 변화, 사용한 고유얼굴의 수에 대한 인식률의 변화, 전처리를 통하여 얻을 수 있는 인식률의 변화, 인식 거부 곡선을 통하여 시스템의 실제 적용 가능성에 대한 실험을 수행하고 결과를 분석한다.

• Journal of Communications and Networks
• /
• 제16권1호
• /
• pp.1-9
• /
• 2014

Block diagonalization (BD) has been proposed as a simple and effective technique in multiuser multiple-input multiple-output (MU-MIMO) broadcast channels. However, when channel state information (CSI) knowledge is limited at the transmitter, the performance of the BD may be degraded because inter-user interference cannot be completely eliminated. In this paper, we propose an efficient CSI quantization technique for BD precoded systems with limited feedback where users supported by a base station are selected by dynamic scheduling. First, we express the received signal-to-interference-plus-noise ratio (SINR) when multiple data streams are transmitted to the user, and derive a lower bound expression of the expected received SINR at each user. Then, based on this measure, each user determines its quantized CSI feedback information which maximizes the derived expected SINR, which comprises both the channel direction and the amplitude information. From simulations, we confirm that the proposed SINR-based channel quantization scheme achieves a significant sum rate gain over the conventional method in practical MU-MIMO systems.

• 한국통신학회논문지
• /
• 제40권11호
• /
• pp.2298-2304
• /
• 2015

본 논문은 다중 셀 다중입력 단일 출력 (MISO : multiple-input single-output) 하향링크 능동 안테나 시스템 (AAS : active antenna systems)에서 기지국의 수직 각도를 최적화하는 새로운 기법을 제시한다. 본 연구에서는 기존의 전역 탐색 방식 대신 간단하면서 최적의 값에 근사한 알고리듬들을 제안한다. 먼저, random matrix theory의 특성을 반영하여 평균 전송용량에 large system approximation이 적용된 수직적 빔포밍 알고리듬을 소개한다. 다음으로, signal-to-leakage-and-noise ratio (SLNR)을 기반으로 최적화 문제를 간단하게 만드는 수직적 빔포밍 알고리듬을 제안한다. 실험 결과를 통해 제안된 알고리듬들의 성능이 기존의 전역 탐색 알고리듬에 비해 복잡도가 매우 감소됨에도 불구하고 거의 비슷한 성능을 보임을 증명하였다.

• 한국생산제조학회지
• /
• 제19권1호
• /
• pp.57-64
• /
• 2010

Metal Injection Molding (MIM) is attractive because it produces consistent, complex-geometry components for high-volume, high-strength, and high-performance applications. Also MIM using in optical communication field, display field, and semi-conductor field is a cost-effective alternative to metal machining or investment casting parts. It offers tremendous single-step parts consolidation potential and design flexibility. The objective of this paper is to study the suitability of design, flow analysis, debinding and sinterin processes, and capability analysis. The suitable injection conditions were 0.5~1.5 second filling time, 11.0~12.5 MPa injection pressure derived from flow analysis. The gravity of the product is measured after debinding an sintering. The maximum and minimum gravity levels are 7.5939 and 7.5097. the average and standard deviation are 7.5579 and 0.0122; when converted into density, the figure stands at 98.154%. According to an analysis of overall capacity, PPM total, which refers to defect per million opportunities(DPMO), stands at 166,066.3 Z.Bench-the sum of defect rates exceeding the actual lowest and highest limits-is 0.97, which translates into the good quality rate of around 88.4% and the sigma level of 2.47.