• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1059-1065
• /
• 2007

In this paper, we propose a class of polyphase signature sequences, whose general odd correlation properties are useful for M-ary phase signaling systems. The maximum magnitude of the general odd correlation functions of the proposed sequences are investigated and compared with those of FZC (Frank-Zadoff-Chu) sequences and those of EOE (equivalent odd and even correlation) sequences. The performance of the asynchronous M-ary phase signaling systems using the proposed sequences is simulated and compared with that using FZC sequences in direct sequence code division multiple access (DS/CDMA) systems. The performance of the system using the proposed sequence is shown to be better than that using FZC sequences when the multipath fading is in existence.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.31-39
• /
• 1998

This paper presents the design and implementation of a new multimedia fixed-point DSP (MDSP) core for portable multimedia applications. The MDSP instruction set is designed through the analysis of multimedia algorithms and DSP instruction sets. The MDSP architecture employs parallel processing techniques, such as SIMD and vector processing as well as DSP techniques. The instruction set can handle various data formats and MDSP can perform two MAC operations in parallel. The switching network and packing network can increase the performance by overlapping data rearrangement cycles with computation cycles. We have designed Verilog HDL models and the 0.6 $\mu\textrm{m}$ Samsung KG75000 SOG library is used. The total gate count is 68,831 and the clock frequency is 30 MHz.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.646-653
• /
• 2005

This paper proposes that wavelength assignment algorithm maximizes residual links considering more real wavelength conversion in the WDM network. The existing algorithms are inefficient that they ignore wavelength conversion ability in each nodes and fixed uniformly wavelength conversion ability on all nodes. Proposed method makes a ring shape that maximize available residual links considering wavelength conversion ability in each nodes. Maximizing residual links can assign a wavelength for any path require. Then blocking probability is reduced by the maximum 19 percent and wavelength conversion number is improved by about 40 percent. These can be showed in performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.1-11
• /
• 2012

When the microarray experiment developed, main interest was limited to detect differentially expressed genes associated with a phenotype of interest. However, as human diseases are thought to occur through the interactions of multiple genes within a same functional category, the unit of analysis of the microarray experiment expanded to the set of genes. For the phenotype of censored survival time, Gene Set Enrichment Analysis(GSEA), Global test and Wald type test are widely used. In this paper, we modified the Wald type test by adopting normal score transformation of gene expression values and developed a parametric test which requires much less computation than others. The proposed method is compared with other methods using a real data set of ovarian cancer and a simulation data set.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.995-1000
• /
• 2016

The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.499-506
• /
• 2005

Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.1027-1030
• /
• 2011

휴머노이드 로봇 중 초상화를 그리는 로봇이 있지만 다양한 영상을 입력받아 명암 및 그림자까지 그림을 그리는 로봇은 흔하지 않다. 기존의 화가로봇들은 사용자의 얼굴을 영상으로 입력받아 윤곽선만 추출하여 그리는 방식으로, 입력된 영상으로부터 로봇 암을 제어하는 과정에서 제대로 동기화가 이뤄지지 못해 드로잉 속도가 느리고 원본 영상과 비교 시 차이가 많이 난다. 본 연구에서는 입력된 영상으로부터 명암과 그림자를 인식하여 표현해 줌으로써 입체감 있는 그림의 드로잉이 가능하다. 또한, 로봇 암의 미세한 컨트롤을 통해 드로잉 선 두께를 제어함으로써 자연스러운 그림을 그리고, 드로잉 속도가 향상되어 정확도를 높일 수 있게 하는 휴리스틱 암 제어 기술을 제안한다. 이를 구현하기 위해서는 영상으로부터 명암, 그림자의 농도에 따라 레벨을 결정하고, 레벨을 바탕으로 주변 명암 픽셀들을 평활화 하여 좌표 집합을 추출한다. 좌표 값들로 부터 유효 궤적을 분석하여 로봇 암이 이동할 경로를 추출하고, 효율적인 드로잉 기법을 통해 명암을 표현하여 드로잉하려 한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.689-692
• /
• 2021

This paper is a prior study to improve the efficiency of offloading based on mobile agents to optimize allocation of computing resources and reduce latency that support user proximity of application services in a Fog/Edge Computing (FEC) environment. We propose an algorithm that effectively reduces the execution time and the amount of memory required when extracting optimal moving patterns from the vast set of spatio-temporal movement history data of moving objects. The proposed algorithm can be useful for the distribution and deployment of computing resources for computation offloading in future FEC environments through frequency-based optimal path extraction.