• International journal of advanced smart convergence
• /
• v.6 no.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
• /
• v.10 no.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.

• Journal of Energy Engineering
• /
• v.29 no.3
• /
• pp.86-90
• /
• 2020

This paper examines a blockchain network-based transaction system using location proofing in power direct transactions between networked energy clouds, energy communities, and prosumer machines participating in smart cities. It utilizes location-based blockchain network technology, which enables long-distance travel with recharging by power purchases during autonomous movements, autonomous electric vehicles that can purchase and sell electricity, and solar street lights that can be produced and sold in fixed form. In addition, it is possible to provide optimum power transaction matching and settlement reliability between machines without human intervention in power transactions between electric chargers. It also introduces a business-to-object business model between autonomous machines that exist in multiple and different spaces and through energy clouds that are expected to be scattered with various transaction prices, policies, and incentives.

• Journal of the Korean Society of Systems Engineering
• /
• v.18 no.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.

• Journal of the Korea Convergence Society
• /
• v.6 no.1
• /
• pp.93-101
• /
• 2015

As the axle at the vehicle of railway has the important role for safe running, the strength, and impact-proof, safety factor, stress and deformation must be considered. There are the simulation models of 1 and 2 in this study. These models are investigated by performing the convergence technique through the design, the structural and fatigue analyses with CATIA and ANSYS. As the maximum deformation and equivalent stress of model A are lower than those of model B, model A has more durability than model B. The durability to prevent the damage can be investigated by applying the result of this study into the part design of the vehicle of rail road. And it is possible to be grafted onto the convergence technique at design and show the esthetic sense.

• Journal of applied mathematics & informatics
• /
• v.30 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.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
• /
• v.6 no.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.

• Journal of the Korean Mathematical Society
• /
• v.47 no.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.

• Journal of the Korean Mathematical Society
• /
• v.55 no.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.