• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.1144-1148
• /
• 1997

In this paper, a method for the daily maximum load forecasting which uses a chaotic time series in power system and artificial neural network. We find the characteristics of chaos in power load curve and then determine a optimal embedding dimension and delay time. For the load forecast of one day ahead daily maximum power, we use the time series load data obtained in previous year. By using of embedding dimension and delay time, we construct a strange attractor in pseudo phase plane and the artificial neural network model trained with the attractor mentioned above. The one day ahead forecast errors are about 1.4% for absolute percentage average error.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.578-580
• /
• 1995

In this paper, a method for the daily maximum load forecasting which uses a chaotic time series in power system and artificial neural network. We find the characteristics of chaos in power load curve and then determine a optimal embedding dimension and delay time, For the load forecast of one day ahead daily maximum power, we use the time series load data obtained in previous year. By using of embedding dimension and delay time, we construct a strange attractor in pseudo phase plane and the artificial neural network model trained with the attractor font mentioned above. The one day ahead forecast errors are about 1.4% of absolute percentage average error.

• ETRI Journal
• /
• 제37권5호
• /
• pp.990-1000
• /
• 2015

This paper presents an overlapping pattern substitution (PS) method. The original overlapping PS method as a reversible data hiding scheme works well with only four pattern pairs among fifteen possible such pairs. This paper generalizes the original PS method so that it will work well with an optimal pair from among the fifteen possible pattern pairs. To implement such an overlapping PS method, changeable and embeddable patterns are first defined. A class map is virtually constructed to identify the changeable and embeddable pairs. The run-lengths between consecutive least probable patterns are recorded. Experiments show that an implementation of our overlapping PS method works well with any possible type of pairs. Comparison results show that the proposed method achieves more embedding capacity, a higher PSNR value, and less human visual distortion for a given embedding payload.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.835-837
• /
• 1996

In this paper, a method for the daily maximum load forecasting which uses a chaotic time series in power system and artificial neural network(Back-propagation) is proposed. We find the characteristics of chaos in power load curve and then determine a optimal embedding dimension and delay time. For the load forecast of one day ahead daily maximum power, we use the time series load data obtained in previous year. By using of embedding dimension and delay time, we construct a strange attractor in pseudo phase plane and the artificial neural network model trained with the attractor mentioned above. The one day ahead forecast errors are about 1.4% for absolute percentage average error.

• 반도체디스플레이기술학회지
• /
• 제9권2호
• /
• pp.15-20
• /
• 2010

This paper deals with minimizing layout area of FPGA design. FPGAs are becoming increasingly important in the design of ASICs since they provide both large scale integration and user-programmability. This paper describes a method to obtain tight bound on the worst-case increase in area when drivers are introduced along many long wires in a layout. The area occupied by minimum-area embedding for a circuit can depend on the aspect ratio of the bounding rectangle of the layout. This paper presents a separator-based area-optimal embeddings for FPGA graphs in rectangles of several aspect ratios which solves the longest path problem in the constraint graph.

• 디지털콘텐츠학회 논문지
• /
• 제18권7호
• /
• pp.1419-1425
• /
• 2017

법률 지식 검색의 궁극적 목적은 법령과 판례를 근거로 최적의 법례정보 획득이라고 할 수 있다. 최근, 대규모 자료에서 효율적으로 검색하여야 하는목적을 달성하기 위하여텍스트 마이닝 연구가 활발히 이루어지고 있다. 대표적인 방법으로 Neural Net 기반 학습방법인 워드 임베딩 알고리즘을 들 수 있다. 본 논문에서는 한국 법령정보를 워드임베딩에 적용하여 연관정보 검색방법을 연구하였다. 우선 판례의 참조법령을 순서대로 추출하여 모형의 입력정보로 활용하였다. 추출한 참조법령들은 중심법령을 기준으로 주변 법령을 학습하고 임베딩하는 Law2Vec 모형을 작성하였다. 이 모형으로 법령에 대하여 학습을 수행하고 법령 간의 관계를 추론하였다. 본 연구의 모형을 평가하기 위하여 연관법령으로 도출된 결과가 키워드와 밀접한 관련이 있는지 정밀도와 재현율을 계산하여 검증하였다. 실험결과, 본 연구의 제안방식이기존의 키워드 검색방법보다 연관된 법령을추론하는데유용함을 알 수 있었다.

• 스마트미디어저널
• /
• 제12권11호
• /
• pp.113-124
• /
• 2023

5G 및 B5G(Beyond 5G) 네트워크의 등장으로 기존 네트워크 한계를 극복할 수 있는 네트워크 가상화 기술이 주목받고 있다. 네트워크 가상화의 목적은 효율적 네트워크 자원의 활용과 다양한 전송요구 서비스에 대한 솔루션을 제공하기 위함이다. 이와 관련하여 여러 가지 휴리스틱 기반의 VNE 기법이 연구되고 있으나 네트워크 자원할당 및 서비스의 유연성이 제한되는 문제점을 지니고 있다. 본 논문에서는 다양한 응용의 서비스 요구사항을 충족하기 위해 GNN 기반의 네트워크 슬라이싱 분류 기법과 최적의 자원할당을 위한 RL 기반 VNE 기법을 제안한다. 제안된 기법에서는 Actor-Critic 네트워크를 이용하여 최적의 VNE를 수행한다. 또한 성능 평가를 위해 제안된 기법과 기존의 Node Rank, MCST-VNE, GCN-VNE 기법과의 성능을 비교분석하고 서비스 수용률 제고 및 효율적 자원 할당 측면에서 성능이 향상됨을 보인다.

• Geomechanics and Engineering
• /
• 제14권1호
• /
• pp.91-98
• /
• 2018

Length of a vehicle is an important variation to generate different variants of an automotive platform. This parameter is usually adjusted by embedding dimensional flexibility into different components of the Body in White (BIW) including the floor pan. Due to future uncertainties, it is not necessarily possible to define certain values of wheelbase for the future products of a platform. This work is performed to add flexibility into the design process of a length-variable floor pan. By means of this analysis, the cost and time consuming process of optimization is not necessary to be performed for designing the different variants of a product family. Stiffness and mass of the floor pan are two important functional requirements of this component which directly affect the occupant comfort, dynamic characteristics, fuel economy and environmental protection of the vehicle. A combination of Genetic algorithm, GMDH-type of artificial neural networks and TOPSIS methods is used to optimally design the floor pan associated with arbitrary length of the variant in the defined system range. The correlation between the optimal results shows that for a constant mass of the floor pan, the first natural frequency decreases by increasing the length of this component.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (3)
• /
• pp.762-764
• /
• 1998

완전 이진트리의 통신형태를 갖는 분활 정복방식의 알고리즘 병렬 컴퓨터에서 실행시킬 때 작업들을 프로세서에 분배하여 처리하게 되는데 이때 통신 링크의 충돌을 줄이는 것이 전체 실행시간을 단축하는 중요한 요소가 된다. 본 논문에서는, 웜홀 라우팅과 양방향 링크를 지원하는 3차원 메쉬로의 완전 이진트리의 임베딩 문제를 다룬다. 이 임베딩 방법은 순위차원 라우팅을 사용하며 링크 충돌이 없는 방법으로 최적의 임베딩 알고리즘이다.