• International journal of advanced smart convergence
• /
• 제6권1호
• /
• pp.1-8
• /
• 2017

Diverse types of malicious code such as evasive Server-side Polymorphic are developed and distributed in third party open markets. The suspicious new type of polymorphic malware has the ability to actively change and morph its internal data dynamically. As a result, it is very hard to detect this type of suspicious transaction as an evidence of Server-side polymorphic mobile malware because its C&C server was shut downed or an IP address of remote controlling C&C server was changed irregularly. Therefore, we implemented Simulated C&C Server to aggregate activated events perfectly from various Server-side polymorphic mobile malware. Using proposed Simulated C&C Server, we can proof completely and classify veiled server-side polymorphic malicious code more clearly.

• International journal of advanced smart convergence
• /
• 제10권3호
• /
• pp.207-213
• /
• 2021

Informatization and digital transformation across industries are big trends in the world. However, although a few food groups are investing in informatization on a pilot basis, informatization is still delayed in related industries, such as distribution, logistics, etc. Therefore, consumers often are not able to have easy access to detailed information about products. In this paper, to improve these problems, we propose a fresh food logistics solution that adopts Proof of Nonce (PoN) consensus algorithm with Internet of Thing (IoT) technology. The recently developed PoN algorithm dramatically reduces a time for generating a block and is suitable for a platform that collects and services real-time information. We expect to improve their trust in the platform by preventing forgery/falsification of information recorded in real time through this paper.

• 에너지공학
• /
• 제29권3호
• /
• pp.86-90
• /
• 2020

이 논문은 네트워크로 연계된 에너지 클라우드, 에너지 커뮤니티 그리고 스마트시티에 참여한 프로슈머 머신들 간의 전력 직거래에 있어 위치증명방식이 적용된 블록체인 네트워크 기반 거래 시스템에 대한 고찰이다. 이 시스템은 위치증명기반 블록체인 네트워크 기술을 활용하여 자율 이동 중 전력 구매에 의한 배터리 재충전으로 장거리 이동이 가능해 질 수 있는 물류 배송 드론, 전력 구매와 판매가 모두 가능한 자율주행 전기 자동차 그리고 고정형태로 전력생산 및 판매가 가능한 태양광 가로등 및 전기충전기들 간의 전력 거래 시 인간의 개입 없이 머신들 간 최적 전력거래 매칭 및 정산 신뢰성을 제공 할 수 있다. 또한 다수이면서 서로 다른 공간에 존재하기 때문에 발생되는 다양한 거래 가격, 정책 그리고 인센티브들이 산재할 것으로 예상되는 에너지 클라우드를 경유하는 자율 운행 머신들 간의 사물 간 전력 직거래 비즈니스 모델을 소개한다.

• 시스템엔지니어링학술지
• /
• 제18권2호
• /
• pp.126-139
• /
• 2022

The need for synthetic automation is increasing in preparation for a gradual decrease in laboratory research manpower due to low birth rate and aging. In this study, the existing laboratory synthesis method is analyzed based on the systems engineering technique. Then, it led to the derivation of the system requirements for a fixed-based robot manipulator capable of recognition, decision and control. The robot is equipped with replaceable modular end-effectors and designed depending on the purpose and process of the synthesis. The robot with an end-effector was implemented as PoC(Proof-of-Concept), and the functions for pipetting automation was verified.

• 한국융합학회논문지
• /
• 제6권1호
• /
• pp.93-101
• /
• 2015

철도차량에서의 축은 안전한 운행을 하기 위해서는 중요한 역할을 함으로서 그 강도 및 내충격성, 재질, 안전계수, 응력 및 변형이 고려되어야 한다. 본 연구에서는 Model 1과 Model 2의 시뮬레이션 모델들이 있다. 이 모델들은 CATIA와 ANSYS로 설계, 구조 및 피로 해석을 통한 융합 기술을 수행함으로서 연구된다. Model A의 최대 변형량과 최대 등가응력이 Model B보다 더 작음으로서 Model A가 Model B보다 내구성을 더 가지고 있다. 본 연구 결과를 철도 차량의 부품 설계에 응용함으로서 파손을 방지하기 위한 내구성이 고찰될 수 있다. 그리고 디자인 면에서의 융합 기술로의 접목도 가능하여 미적인 감각을 나타낼 수 있다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.365-380
• /
• 2012

Non-negative matrix factorization (NMF) is a very efficient method to explain the relationship between functions for finding basis information of multivariate nonnegative data. The multiplicative update (MU) algorithm is a popular approach to solve the NMF problem, but it fails to approach a stationary point and has inner iteration and zero divisor. So the elementwisely alternating projected gradient (eAPG) algorithm was proposed to overcome the defects. In this paper, we use the fact that the equilibrium point is stable to prove the convergence of the eAPG algorithm. By using a classic model, the equilibrium point is obtained and the invariant sets are constructed to guarantee the integrity of the stability. Finally, the convergence conditions of the eAPG algorithm are obtained, which can accelerate the convergence. In addition, the conditions, which satisfy that the non-zero equilibrium point exists and is stable, can cause that the algorithm converges to different values. Both of them are confirmed in the experiments. And we give the mathematical proof that the eAPG algorithm can reach the appointed precision at the least iterations compared to the MU algorithm. Thus, we theoretically illustrate the advantages of the eAPG algorithm.

• 대한수학회보
• /
• 제31권1호
• /
• pp.105-113
• /
• 1994

In the course of study of dendroids, Czuba [3] introduced a notion of $R^{i}$ -continua which is a generalization of R-arc [1]. He showed a new class of non-contractible dendroids, namely of dendroids which contain an $R^{i}$ -continuum. Subsecequently Charatonik [2] attempted to extend the notion into hyperspace C(X) of metric continuum X. In so doing, there were some oversights in extending some of the results relating $R^{i}$ -continua of dendroids for metric continua. In fact, Proposition 1 in [2] is false (see example C below) and his proof of Theorem 6 in [2] is not correct (Take Example 4 in [4] with K = [e,e'] as an $R^{1}$-continuum of X and work it out. Then one seens that K not .mem. K as he claimed otherwise.). The aims of this paper are to introduce a notion of w-regular convergence which is weaker than 0-regular convergence and to prove that the w-regular convergence of a sequence {Xn}$^{\infty}$$_{n=1}$ to $X_{0}$ of subcontinua of a metric continuum X is a necessary and sufficient for the sequence {C( $X_{n}$)}$^{\infty}$$_{n=1}$ to converge to C( $X_{0}$ ), and also to prove that if a metric continuum X contains an $R^{i}$ -continuum with w-regular convergence, then the hyperspace C(X) of X contains $R^{i}$ -continuum.inuum.uum.

• International Journal of Control, Automation, and Systems
• /
• 제6권4호
• /
• pp.571-582
• /
• 2008

This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.

• 대한수학회지
• /
• 제47권4호
• /
• pp.743-766
• /
• 2010

We study the existence of weak solution for the stationary Nordstr$\ddot{o}$m-Vlasov equations in a bounded domain. The proof follows by fixed point method. The asymptotic behavior for large light speed is analyzed as well. We justify the convergence towards the stationary Vlasov-Poisson model for stellar dynamics.

• 대한수학회지
• /
• 제55권2호
• /
• pp.447-469
• /
• 2018

Types (over parameters) in the theory of atomless random variable structures correspond precisely to (conditional) distributions in probability theory. Moreover, the logic (resp. metric) topology on the type space corresponds to the topology of weak (resp. strong) convergence of distributions. In this paper, we study metrics between types. We show that type spaces under $d^{\ast}-metric$ are isometric to Wasserstein spaces. Using optimal transport theory, two formulas for the metrics between types are given. Then, we give a new proof of an integral formula for the Wasserstein distance, and generalize some results in optimal transport theory.