• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.49-58
• /
• 2019

In this paper, we propose an edge cloud platform architecture for implementing smart factory. The edge cloud platform is one of edge computing architecture which is mainly focusing on the efficient computing between IoT devices and central cloud. So far, edge computing has put emphasis on reducing latency, bandwidth and computing cost in areas like smart homes and self-driving cars. On the other hand, in this paper, we suggest not only common functional architecture of edge system but also light weight cloud based architecture to apply to the specialized requirements of smart factory. Cloud based edge architecture has many advantages in terms of scalability and reliability of resources and operation of various independent edge functions compare to typical edge system architecture. To make sure the availability of edge cloud platform in smart factory, we also analyze requirements of smart factory edge. We redefine requirements from a 4M1E(man, machine, material, method, element) perspective which are essentially needed to be digitalized and intelligent for physical operation of smart factory. Based on these requirements, we suggest layered(IoT Gateway, Edge Cloud, Central Cloud) application and data architecture. we also propose edge cloud platform architecture using lightweight container virtualization technology. Finally, we validate its implementation effects with case study. we apply proposed edge cloud architecture to the real manufacturing process and compare to existing equipment engineering system. As a result, we prove that the response performance of the proposed approach was improved by 84 to 92% better than existing method.

• Journal of Internet Computing and Services
• /
• v.17 no.3
• /
• pp.25-32
• /
• 2016

In this paper, we propose a method that is tracking an object in real time using particle filter and the observation model with edge. First of all, the proposed method defines the object to be tracked in the initial frame. Then, it generates the edge observation model for the object to be tracked and a set of particles. It calculates the weight by comparing the average of the middle distance in eight-way of particle filter edge model with that in edge observation model, and then updates the weight with the calculated value. After resampling particles using the updated weights, it estimates the current location of the tracked object. Finally, this paper demonstrates the performance of the stable tracking through comparison with the existing method by using a number of experimental data.

• The Journal of Society for e-Business Studies
• /
• v.9 no.3
• /
• pp.277-288
• /
• 2004

The purpose of multimedia contents transmission is to resolve the large size and nonformal issues. Various multicasting technologies have been researched to support these issues. This paper suggests a technique to build multicast routing for safe and reliable transmission of multimedia contents. Network server nodes have their own weight with respect to communication loads. The weight is computed by a server's communication load with others. This suggests low delay routing with two or more edge server of content delivery network. We will show the weighted inter-server routing technique and analyze the network performance improvement caused by lower network traffic and delay.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.26-31
• /
• 2010

We proposed a new directional edge based interpolation, DEBI, by combining two weighted directional information to reduce blurred edges and annoying artifacts. Four isotropic gradient masks are employed in defining edge directions and they are proven to hold a first order derivative relation with respect to a rotating coordinate. Two minimum gradients among four absolute directional results are shown to be sufficient to describe slant edges efficiently. Compared with widely used bilinear and bicubic interpolation methods, the proposed algorithm results in a noticeable improvement along edge area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.355-362
• /
• 2009

A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• International Journal of Highway Engineering
• /
• v.17 no.6
• /
• pp.37-45
• /
• 2015

PURPOSES : The purpose of this study is to validate the design criteria of the concrete modular road system, which is a new semi-bridge-type concept road, through a comparison of numerical analysis results and actual loading test results under static axial loads. METHODS : To design the semi-bridge-type modular road, both the bridge design code and the concrete structural design code were adopted. The standard truck load (KL-510) was applied as the major traffic vehicle for the design loading condition. The dimension of the modular slab was designed in consideration of self-weight, axial load, environmental load, and combined loads, with ultimate limit state coefficients. The ANSYS APDL (2010) program was used for case studies of center and edge loading, and the analysis results were compared with the actual mock-up test results. RESULTS : A full-scale mock-up test was successfully conducted. The maximum longitudinal steel strains were measured as about 35 and 83.5 micro-strain (within elastic range) at center and edge loading locations, respectively, under a 100 kN dual-wheel loading condition by accelerating pavement tester. CONCLUSIONS : Based on the results of the comparison between the numerical analysis and the full-scale test, the maximum converted stress range at the edge location is 32~51% of the required standard flexural strength under the two times over-weight loading condition. In the case of edge loading, the maximum converted stresses from the Westergaard equation, the ANSYS APDL analysis, and the mock-up test are 1.95, 1.7, and 2.3 times of that of the center loading case, respectively. The primary reason for this difference is related to the assumption of the boundary conditions of the vertical connection between the slab module and the crossbeam module. Even though more research is required to fully define the boundary conditions, the proposed design criteria for the concrete modular road finally seems to be reasonable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1365-1377
• /
• 2019

Summarizing the differences in Chinese-Vietnamese bilingual news plays an important supporting role in the comparative analysis of news views between China and Vietnam. Aiming at cross-language problems in the analysis of the differences between Chinese and Vietnamese bilingual news, we propose a new method of summarizing the differences based on an undirected graph model. The method extracts elements to represent the sentences, and builds a bridge between different languages based on Wikipedia's multilingual concept description page. Firstly, we calculate the similarity between Chinese and Vietnamese news sentences, and filter the bilingual sentences accordingly. Then we use the filtered sentences as nodes and the similarity grade as the weight of the edge to construct an undirected graph model. Finally, combining the random walk algorithm, the weight of the node is calculated according to the weight of the edge, and sentences with highest weight can be extracted as the difference summary. The experiment results show that our proposed approach achieved the highest score of 0.1837 on the annotated test set, which outperforms the state-of-the-art summarization models.