• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1755-1777
• /
• 2022

The development of wireless communication technology has led to the underutilization of radio spectra. To address this limitation, an intelligent cognitive radio network was developed. Specific emitter identification (SEI) is a key technology in this network. However, in realistic non-cooperative scenarios, the system may detect signal classes beyond those in the training database, and only a few labeled signal samples are available for network training, both of which deteriorate identification performance. To overcome these challenges, a meta-learning-based open-set identification system is proposed for SEI. First, the received signals were pre-processed using bi-spectral analysis and a Radon transform to obtain signal representation vectors, which were then fed into an open-set SEI network. This network consisted of a deep feature extractor and an intrinsic feature memorizer that can detect signals of unknown classes and classify signals of different known classes. The training loss functions and the procedures of the open-set SEI network were then designed for parameter optimization. Considering the few-shot problems of open-set SEI, meta-training loss functions and meta-training procedures that require only a few labeled signal samples were further developed for open-set SEI network training. The experimental results demonstrate that this approach outperforms other state-of-the-art SEI methods in open-set scenarios. In addition, excellent open-set SEI performance was achieved using at least 50 training signal samples, and effective operation in low signal-to-noise ratio (SNR) environments was demonstrated.

• 한국컴퓨터정보학회논문지
• /
• 제20권3호
• /
• pp.107-113
• /
• 2015

본 논문은 되먹임 집합 문제인 무방향 그래프의 정점과 간선, 방향 그래프의 노드와 호 문제들 중 간선 문제에 한정한 최소 원소개수 되먹임 간선 집합과 최소 가중치 되먹임 간선 집합 문제의 최적 해를 다항시간으로 얻는 알고리즘을 제안하였다. 제안된 알고리즘은 그래프의 간선 집합은 최대신장트리 간선 집합과 최소 되먹임 간선집합의 합이 되는 특성을 적용하였다. 즉, 최소 되먹임 간선집합은 최대신장트리 간선 집합의 여집합인 특성이 있다. 제안된 알고리즘은 최소신장트리를 얻는 Kruskal 알고리즘을 변형시켜 간선들의 가중치를 내림차순으로 정렬시켜 사이클이 발생하지 않는 간선은 최대신장트리 간선 집합 MXST로, 사이클이 발생하는 간선은 되먹임 간선 집합 FES로 양분하는 방법으로 최적 해를 얻었다. 제안된 알고리즘은 그래프의 간선 수 만큼 수행하는 선형시간 복잡도를 갖는 특징이 있다. 간선 가중치가 없는 경우와 가중치가 있는 다양한 무방향 그래프에 제안된 알고리즘을 적용한 결과 100% 쉽게 최적 해를 얻는데 성공하였다.

• The Journal of the Acoustical Society of Korea
• /
• 제28권3E호
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

• Interaction and multiscale mechanics
• /
• 제1권2호
• /
• pp.191-209
• /
• 2008

In this paper, we model grain boundary evolution based on a multiple level set method. Grain boundary migration under a curvature-induced driving force is considered and the level set method is employed to deal with the resulting topological changes of grain structures. The complexity of using a level set method for modeling grain structure evolution is due to its N-phase nature and the associated geometry compatibility constraint. We employ a multiple level set method with a predictor-multicorrectors approach to reduce the gaps in the triple junctions down to the grid resolution level. A ghost cell approach for imposing periodic boundary conditions is introduced without solving a constrained problem with a Lagrange multiplier method or a penalty method. Numerical results for both uniform and random grain structures evolution are presented and the results are compared with the solutions based on a front tracking approach (Chen and Kotta et al. 2004b).

• 대한수학회지
• /
• 제41권5호
• /
• pp.933-944
• /
• 2004

Packing dimension of a set is an upper bound for the packing dimensions of measures on the set. Recently the packing dimension of statistically self-similar Cantor set, which has uniform distributions for contraction ratios, was shown to be its Hausdorff dimension. We study the method to find an upper bound of packing dimensions and the upper Renyi dimensions of measures on a statistically quasi-self-similar Cantor set (its packing dimension is still unknown) which has non-uniform distributions of contraction ratios. As results, in some statistically quasi-self-similar Cantor set we show that every probability measure on it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely and it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely for almost all probability measure on it.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.755-767
• /
• 1997

Analyzing autocorrelated data set is still an open problem. Developing on easy and efficient method for severe positive correlated data set, which is common in simulation output, is vital for the simulation society. Bootstrap is on easy and powerful tool for constructing non-parametric inferential procedures in modern statistical data analysis. Conventional bootstrap algorithm requires iid assumption in the original data set. Proper choice of resampling units for generating replicates has much to do with the structure of the original data set, iid data or autocorrelated. In this paper, a new bootstrap resampling scheme is proposed to analyze the autocorrelated data set : the Threshold Bootstrap. A thorough literature search of bootstrap method focusing on the case of autocorrelated data set is also provided. Theoretical foundations of Threshold Bootstrap is studied and compared with other leading bootstrap sampling techniques for autocorrelated data sets. The performance of TB is reported using M/M/1 queueing model, else the comparison of other resampling techniques of ARMA data set is also reported.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2005년도 춘계 학술기술논문발표대회 논문집
• /
• pp.137-140
• /
• 2005

In spite of a construction of many set building, the government's set building policies being almost indifferent to the maintenance management of them. Currently the personnel is not enough for maintenance management in set building. Therefore many set building does not become accomplished appropriately. On this paper, the set building policies and a questionnaire are analyzed. The result of questionnaire provides fundamental data of proper staff calculation.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2007년도 춘계학술대회A
• /
• pp.354-359
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, an inner-front creation algorithm is proposed, in which the sizes, positions, and number of new inner-fronts during the optimization process can be globally and consistently identified. To update the level set function during the optimization process, the least-squares finite element method is employed. As demonstrative examples for the flexibility and usefulness of the proposed method, the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• 대한수학회보
• /
• 제53권4호
• /
• pp.959-970
• /
• 2016

In this paper, we generalize the stability for an n-dimensional cubic functional equation in Banach space to set-valued dynamics. Let $n{\geq}2$ be an integer. We define the n-dimensional cubic set-valued functional equation given by $$f(2{{\sum}_{i=1}^{n-1}}x_i+x_n){\oplus}f(2{{\sum}_{i=1}^{n-1}}x_i-x_n){\oplus}4{{\sum}_{i=1}^{n-1}}f(x_i)\\=16f({{\sum}_{i=1}^{n-1}}x_i){\oplus}2{{\sum}_{i=1}^{n-1}}(f(x_i+x_n){\oplus}f(x_i-x_n)).$$ We first prove that the solution of the n-dimensional cubic set-valued functional equation is actually the cubic set-valued mapping in [6]. We prove the Hyers-Ulam stability for the set-valued functional equation.

• 호남수학학술지
• /
• 제30권1호
• /
• pp.171-183
• /
• 2008

In a previous work [18], the authors investigated autocontinuity, converse-autocontinuity, uniformly autocontinuity, uniformly converse-autocontinuity, and fuzzy multiplicativity of monotone set function defined by Choquet integral([3,4,13,14,15]) instead of fuzzy integral([16,17]). We consider nonnegative monotone interval-valued set functions and nonnegative measurable interval-valued functions. Then the interval-valued Choquet integral determines a new nonnegative monotone interval-valued set function which is a generalized concept of monotone set function defined by Choquet integral in [18]. These integrals, which can be regarded as interval-valued aggregation operators, have been used in [10,11,12,19,20]. In this paper, we investigate some characterizations of monotone interval-valued set functions defined by the interval-valued Choquet integral such as autocontinuity, converse-autocontinuity, uniform autocontinuity, uniform converse-autocontinuity, and fuzzy multiplicativity.