• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1554-1561
• /
• 2018

This paper surveys the DDS, a real - time communication middleware, and proposes ways to improve the DDS secure communication performance. DDS is a communication middleware standard by the OMG. The OMG has released the DDS Security standard to resolve the security issues. The security performance of DDS can be considered into transmission speed and confidentiality. In terms of confidentiality, AES-GCM, currently the encryption algorithm specified by DDS Security, is a very strong encryption algorithm, but there are well known weaknesses associated with authentication. In terms of speed, The computational load for the security function is a restriction to use DDS in systems which requires real-time performance. Therefore, in order to improve the DDS security, algorithms that are faster than AES-GCM and strong in encryption strength are needed. In this paper, we propose a DDS message encryption method applying AES-OCB algorithm to meet these requirements and Compared with the existing DDS, the transmission performance is improved by up to 12%.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.226-226
• /
• 2011

최적 저수지운영을 위한 운영률 도출이나 강우-유출 및 수질 모형의 매개변수 추정 문제처럼 비선형적이고 추정해야할 변수의 수가 많은 경우, 수학적으로 모형화하기에 너무 복잡해서 선형계획법, 비선형계획법, 동적계획법 등을 사용하여 최적해를 구할 수 없는 경우도 있다. 이러한 문제에 대해서는 구조적 진화를 통해 최적해를 구하는 방법들이 사용된다. 일반적으로 미지수의 개수가 많아지면 전역최적해를 찾기가 어려워진다. 전역최적해를 찾는 여러 가지 방법들이 수자원 분야에서는 강우-유출모형의 매개변수를 추정하는데 많이 사용되고 있으며, 특히 유전자 알고리즘, SCE-UA 알고리즘 등 전역최적해를 찾는 메타휴리스틱 방법이 많이 사용되고 있다. 전역최적화 방법을 개발하는 연구자들은 최적화방법의 성능을 평가하기 위해 다양한 검사함수(test function)를 만들어 성능을 평가하고 있다. 본 연구에 사용한 검사함수는 Mishra의 연구(2006a, 2006b)에서 사용한 중요하고 복잡한 검사함수이다. 유전자 알고리즘, SCE-UA 알고리즘, DDS 알고리즘을 검사함수 중 전역해를 찾기 어려운 2 차원 함수 2 가지, 다차원 함수 4 가지 함수에 적용하여 각각의 탐색 성능을 평가하였다. 2차원 함수인 Bukin 함수에 대해서는 모든 최적화 방법이 전역최적해를 찾을 수 없었지만, 유전자 알고리즘이 가장 전역최적해에 가까웠고 다음으로 DDS 알고리즘 순서였다. 지역수렴 영역이 많을 것으로 판단되는 10, 30, 50 차원 Michalewicz 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 매우 근접하였고 다음으로 SCE-UA 알고리즘, 유전자 알고리즘 순이었다. 지역수렴 영역이 상대적으로 다른 함수보다 넓은 10 차원 Schwefel 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 거의 근접하였고 유전자 알고리즘과 SCE-UA 알고리즘은 매우 큰 편차를 보였다. 40, 80 차원 Schwefel 함수에 대해서는 3 가지 알고리즘 모두 전역최적해와 편차를 보였지만 DDS 알고리즘에 의한 최적해와 다른 두 알고리즘에 의한 최적해는 1 오더(order) 정도의 차이가 났다. 지역수렴 영역이 큰 Michalewicz 함수와 Schwefel 함수에 대한 결과는 매우 흡사한 결과이다. 이상과 같은 결과로, 유전자 알고리즘은 매개변수의 수가 적을 경우 우수한 탐색성능을 가졌으며, SCE-UA 알고리즘은 Griewank, Rastrigin 함수와 같은 형태인 경우 우수한 성능을 보였다. DDS 알고리즘은 전체적으로 우수한 탐색 능력을 가진 것으로 판단된다. 그러므로 수위구간 영역별 저수지운영률 도출을 위한 적절한 최적화방법으로 DDS 알고리즘을 선정하였다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.775-784
• /
• 2010

In this paper we propose a design method of X band frequency hopping synthesizer in terms of phase noise and settling time with DDS driven PLL architecture, which has the advantages of high frequency resolution, fast settling time and small size. In addition, a noble method is proposed to remove the synthesizer output spurious signals due to superposition effect of DDS. The spurious signal which depend on its normalized frequency of DDS, can be dominant if they occur within the PLL loop bandwidth. We verify that the sources of that spurious signals are quasi-amplitude modulation and superposition effect, and suggest that such signals can be eliminated by intentionally creating frequency errors in the developed synthesizer.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1181-1187
• /
• 2014

In this paper, we implemented polar transmitt converter based on software for next generation digital wireless communication system. The implemented converter converted from rectangular to polar by CORDIC algorithm, and be made up of sweep for DDS output frequency using software control. The implemented converter shows can frequency control up to 1.16GHz within DDS frequency control range by software control. it means that transmitter can be control of varied blocks such as gain, phase, output and etc.. The implemented converter can be applied digital wireless communication system based on SDR.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.209-217
• /
• 2022

Naval CMS(Combat Management System) is linked to various sensors and weapon equipment and use DDS(Data Distribution Service) for efficient data communication between ICU(Interface Control Unit) Node and IPN(Information Processing Node). In order to use DDS, software in the system communicates in an PUB/SUB(Publication/Subscribe) based on DDS topic. If the DDS messages structure in this PUB/SUB method does not match, problems such as incorrect command processing and wrong information delivery occur in sending and receiving application software. To improve this, this paper proposes a DDS message structure integrity verification method. To improve this, this paper proposes a DDS message structure integrity verification method using a hash tree. To verify the applicability of the proposed method to Naval CMS, the message integrity verification rate of the proposed method was measured, and the integrity verification method was applied to CMS and the initialization time of the existing combat management system was compared and the hash tree generation time of the message structures was measured to understand the effect on the operation and development process of CMS. Through this test, It was confirmed that the message structure verification method for system stability proposed in this paper can be applied to the Naval CMS.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2797-2806
• /
• 2000

Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2000-2007
• /
• 1999

Recently, DDS (Distributed Database System) has been often implemented on VAN (Value Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centrailzed systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time. In a DDS design, the main problem is 1) how to select proper computer, and 2) how to allocate data fragment into proper nodes. This paper addresses DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes tow objectives, the operating and investment cost. GA (Genetic Algorithm) is developed to solve this mathematical formulation. A numerical experiment shows that the proposed method arrives at a good solution.

• Journal of Korea Water Resources Association
• /
• v.55 no.11
• /
• pp.887-901
• /
• 2022

Estimation of the parameters for individual rainfall-rainfall events can lead to a different set of parameters for each event which result in lack of parameter identifiability. Moreover, it becomes even more ambiguous to determine a representative set of parameters for the watershed due to enhanced variability exceeding the range of model parameters. To reduce the variability of estimated parameters, this study proposed a parameter optimization framework with the simultaneous use of multiple rainfall-runoff events based on NSE as an objective function. It was found that the proposed optimization framework could effectively estimate the representative set of parameters pertained to their physical range over the entire watershed. It is found that the difference in NSE value of optimization when it performed individual and multiple rainfall events, is 0.08. Furthermore, In terms of estimating the observed floods, the representative parameters showed a more improved (or similar) performance compared to the results obtained from the single-event optimization process on an NSE basis.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.37-50
• /
• 2023

In general, PLL or DDS are mainly used as precise and stable frequency synthesis methods. For stable operation, a PWM frequency generation algorithm was designed and implemented using FPGA. This is an algorithm that creates a frequency 8,192 times the target frequency and then performs the D flip-flop 13 times to generate multiple frequencies with a precision of 1 Hz. Using the designed algorithm, it is applied to the Berthing system for stopping trains in station. The applied product was developed and tested against the existing operating system to confirm its superior performance in terms of frequency generation accuracy.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.363-370
• /
• 2002

OPKFDD (Ordered Pseudo-Kronecker Functional Decision Diagram) is one of ordered-DDs (Decision Diagrams) in which each node can take one of three decomposition types : Shannon, positive Davio and negative Davio decompositions. Whereas OBDD (Ordered Binary Decision Diagram) uses only the Shannon decomposition in each node, OPKFDD uses the three decompositions and generates representations of functions with smaller number of nodes than other DDs. However, this leads to the extreme difficulty of getting an optimal solution for the minimization of OPKFDD. Since an appropriate decomposition type has to be chosen for each node, the size of the representation is decided by the selection of the decomposition type. We propose a heuristic method to generate OPKFDD efficiently from the OBDD of the given function and the algorithm of the decision of decomposition type for a given variable ordering. Experimental results demonstrate the performance of the algorithm.