• Journal of the Korean Vacuum Society
• /
• v.21 no.3
• /
• pp.171-177
• /
• 2012

The computer program (EPR-NMR program version 6.2) employed here sets up the spin Hamiltonian matrices and determines their eigenvalues using exact diagonalization. We study the electron spin resonance for $Mn^{2+}$ in ferroelectric $LiNbO_3$ single crystals. The self-energy is obtained using the projection operator method developed by Argyres and Sigel. The self-energy is calculated to be axially symmetric about the by the spin Hamiltonian. The line-widths decreased as the temperature increased; we assume that the hyperfine structure transition is a more dominant scattering than the other transitions. We conclude that the calculation process presented in this study is useful for quantum optical transitions.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2639-2641
• /
• 2003

유전자 알고리즘은 다윈의 자연선택설과 유전자의 진화 개념을 이용한 적응 탐색 알고리즘으로 적용하고자 하는 문제의 매개 변수를 유전자와 비슷한 데이터 구조로 부호화하고, 유전 연산자를 이용하여 문제의 해답을 찾는 알고리즘이다. 최근 유전자 알고리즘은 이러한 복수개의 목적 함수를 최적화 하기 위한 다중 최적화 문제를 위한 최적화 기술로서의 관심이 크게 다루어지고 있으며 전송 문제, 생산 공정 문제 계획 등과 같은 다목적 함수를 다루는 많은 응용 부분에 대해 적용되고 있다. 본 논문에서는 기본적인 다중 목적 함수용 예와 Gen과 Kim이 제안한 네트워크 신뢰도를 고려한 연결 비용과 메시지 지연을 고려한 이중 구속 통신망 설계 문제를 가지고 가중치 합과 여러 가지 파레토 방법들을 비교하고 연구 검토 하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.872-875
• /
• 2014

본 논문에서는 사칙연산자 기반의 유전 프로그래밍을 사용하여 교통량을 예측하였다. 기존의 시계열 분석에서 활용되는 전문적인 지식을 사용하지 않고 유전 프로그래밍만을 사용하여 설계한 결과 기존의 시계열 모형 보다 근접하게 실제 교통량 변화와 근접했음을 확인했다. 또한 기존에 적합도 함수로 자주 사용하는 함수보다 빠르고 정확하게 교통량을 예측 할 수 있는 적합도 함수를 제안하였다.

• Spatial Information Research
• /
• v.5 no.2
• /
• pp.147-160
• /
• 1997

"The "Map Algebra", beeing recognized as a viable theoretical framework for GIS (Geographica Infonnation System), models map layers as "operands" which are the basic unit of geo-processing, and a variety of GIS commands as "operators." In this paper, we attempt at lifting some limitations of map algebras proposed in GIS literature. First, we model map layer as "function" such that we may employ the notion of meta operator (or, higher-order funtion) available in the functional programming paradigm. This approach provides map algebraic language with "programmability" needed in GIS user language. Second, we extend the semantics of, and improve on the sytactic structure of map algebraic language. Mer the data model and language associated with map algebra are formalized, we proceed to design and implement a prototype of map algebraic processor. The parser of the language in our prototype plays the role of transforming the native and heterogeneous user language of current GISs into a canonical map algebraic language. The prototype, named "MapSee" is a proof-of-concept system for the ideas we propsed in this paper. We believe that the uniform interface based on the map algebraic language will make promising infrastructure to support "Internet GIS." This is because the uniform but powerful interface through the Web clients allow access to both geo-data and geo-processing resources distributed over the network.to both geo-data and geo-processing resources distributed over the network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.4
• /
• pp.74-81
• /
• 1997

This paper proposes an evolutionary learning algorithm to discipline the projection neural nctworks (PNNs) with special type of hidden nodes which can activate radial basis functions as well as sigmoid functions. The proposed algorithm not only trains the parameters and the connection weights hut also c~ptimizes the network structure. Through the structure optimization, the number of hidden node:; necessary to represent a given target function is determined and the role of each hidden node is decided whether it activates a radial basis function or a sigmoid function. To apply the algorithm, PNN is realized by a self-organizing genotype representation with a linked list data structure. Simulations show that the algorithm can build the PNN with less hidden nodes than thc existing learning algorithm using error hack propagation(EE3P) and network growing strategy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.214-216
• /
• 2002

시간에 따라 변화하는 사건을 기록하는 시간 데이타베이스에서는 사건을 저장할 때 시간 속성도 같이 저장한다. 최근에는 시간 데이타베이스의 속성을 고려하여 집지 함수와 같이 기존의 연산자를 확장하여 시간 데이타베이스에서 효율적으로 처리하려는 연구가 활발하게 진행되어 왔다. 사용자들은 종종 여러 애트리뷰트에 가중치를 두고 그 가중치 순서대로 결과가 보여지는 순위 질의를 실행한다. 기존의 순위 질의 개념을 그대로 시간 지인 데이타메이스에서 사용할 수 없다. 따라서 본 논문에서는 기존의 순위 질의에 시간 개념을 확장한 시간 순위 질의를 정의한다. 또한 시간 순위 질의 처리방법을 제 시 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2B
• /
• pp.137-144
• /
• 2002

In this paper, we optimize the base station placement and transmission power using genetic approach. A new representation describing base station placement and transmit power with real number is proposed, and new genetic operators are introduced. This new representation can describe the locations, powers, and number of base stations, Considering coverage, power and economy efficiency, we also suggest a weighted objective function. Our algorithm is applied to an obvious optimization problem, and then it is verified. Moreover, our approach is tried in inhomogeneous traffic distribution. Simulation result proves that the algorithm enables to fad near optimal solution according to the weighted objective function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.748-753
• /
• 2004

Edge includes variety of information about image's location and shape etc. So a lot of researches for detecting those edges have been continuing even now and at the early stage of the research, edge detection operators searched neighborhood pixels and used relation among pixels. However, these methods do not have excellent performance in the image which exists noise and can not detect edges selectively. For this reason, in this paper we detected image's line-edge element from degraded image by AWGN (additive white gaussian noise) with wavelet function which is independent of line's width.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.6
• /
• pp.1027-1034
• /
• 2017

In this paper, we propose a new function embedding method that can measure mathematical projections of probability amplitude, probability, average expectation and matrix elements of stationary-state unit matrix at all control operation points of quantum gates. The function embedding method in this paper is to embed orthogonal normalization condition of probability amplitude for each control operating point into a binary scalar operator by using Dirac symbol and Kronecker delta symbol. Such a function embedding method is a very effective means of controlling the arithmetic power function of a unitary gate in a unitary transformation which expresses a quantum gate function as a tensor product of a single quantum. We present the results of evolutionary operation and projective measurement when we apply the proposed function embedding method to the ternary 2-qutrit cNOT gate and compare it with the existing methods.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.123-130
• /
• 2001

As the growth of database volume, it has required a need and an opportunity of data analysis and extracting knowledge from database. Data mining method is the representative example. The size of most minable data set is huge, and stored in a database. To implement effective mining function, we must extract minable data set to be analyzed from existing relational database, and it must be managed with its generalized information. In this paper, the new mining operator is defined in a similar manner to the existing SQL operators and SQL is extended to extract data subset from relations and to generalize it using domain-oriented method. The background knowledge includes attribute values, which will be mind and generalized information, and it is managed as the same structure with a relation in relational database. These functions are implemented by defining some SQL - like operators and aggregated functions, and we describe the expressive powers of these new operators and functions through examples.