• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.423-432
• /
• 2011

Recently, OpenFlow has been paid attention to as a fundamental technology which provides a function of virtualization and programmability in network. In Korea, deployment of OpenFlow networks in campuses and the interconnection between them through tunneling in layer 3 has been performed. However, the performance of the interconnected networks is decreased due to delay in IP layer. In this paper, we design and deploy nation-wide, not local, OpenFlow networks in a pure layer 2 environment over KREONET. After that, we do end-to-end Round-trip Time measurements and TCP/UDP performance tests in OpenFlow and normal networks, and do comparison and analysis on the test results. The results show that the nation-wide OpenFlow networks provide equal performance to normal networks except for the initial packet loss for UDP streaming. In regards to the performance decrease due to early UDP packet loss, we can mitigate it by implementing exceptional procedures in a controller which deal with the same continuous "Packet_in" events.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.9
• /
• pp.29-35
• /
• 2019

The structure of the machinery industry due to the 4th industrial revolution is changing from precision and durability to intelligent and smart machinery through sensing and interconnection(IoT). There is a growing need for research on prognostics and health management(PHM) that can prevent abnormalities in processing machines and accurately predict and diagnose conditions. PHM is a technology that monitors the condition of a mechanical system, diagnoses signs of failure, and predicts the remaining life of the object. In this study, the vibration generated during machining is measured and a classification algorithm for normal and fault signals is developed. Arbitrary fault signal is collected by changing the conditions of un stable supply cutting oil and fixing jig. The signal processing is performed to apply the measured signal to the learning model. The sampling rate is changed for high speed operation and performed machine learning using raw signal without FFT. The fault classification algorithm for 1D convolution neural network composed of 2 convolution layers is developed.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.233-240
• /
• 2009

In this paper we made the serious game learning multiplication table to be evolved. The serious game is to induce the interest of the learner. This program has an interaction form which reflects the intention of the user and using this program a learner to learn the multiplication table as teacher's location are training a program that are seen as the abata and came to be that learner is smart. A study ability to be evolved used an back propagation neural networks. But we improved a study speed using divided weight table concept. The engine is studied perfectly in 60~80 times training. The learning rate increase to various non-monotonic functional form not to do a mechanical rise. And the learning rate is similar with the study ability of the human.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.31-46
• /
• 1997

In this paper, a parallel Optimal Best-First search Branch-and-Bound(B&B) algorithm(pobs) is designed and evaluated for MIN-based multiprocessor systems. The proposed algorithm decomposes a problem into G subproblems, where each subproblem is processed on a group of P processors. Each processor group uses tile sub-Global Best-First search technique to find a local solution. The local solutions are broadcasted through the network to compute the global solution. This broadcast provides not only the comparison of G local solutions but also the load balancing among the processor groups. A performance analysis is then conducted to estimate the speed-up of the proposed parallel B&B algorithm. The analytical model is developed based on the probabilistic properties of the B&B algorithm. It considers both the computation time and communication overheads to evaluate the realistic performance of the algorithm under the parallel processing environment. In order to validate the proposed evaluation model, the simulation of the parallel B&B algorithm on a MIN-based system is carried out at the same time. The results from both analysis and simulation match closely. It is also shown that the proposed Optimal Best-First search B&B algorithm performs better than other reported schemes with its various advantageous features such as: less subproblem evaluations, prefer load balancing, and limited scope of remote communication.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.4
• /
• pp.731-751
• /
• 2021

The Internet of Things is a huge group of devices communicating each other and the interconnection of objects in the network is a basic requirement. Choosing a reliable device is critical because malicious devices can compromise networks and services. However, it is difficult to create a trust management model due to the mobility and resource constraints of IoT devices. For the centralized approach, there are issues of single point of failure and resource expansion and for the distributed approach, it allows to expand network without additional equipment by interconnecting each other, but it has limitations in data exchange and storage with limited resources and is difficult to ensure consistency. Recently, trust management models using fog nodes and blockchain have been proposed. However, blockchain has problems of low throughput and delay. Therefore, in this paper, a trust management model for selecting reliable devices in a fog-based IoT environment is proposed by applying IOTA, a blockchain technology for the Internet of Things. In this model, Directed Acyclic Graph-based ledger structure manages trust data without falsification and improves the low throughput and scalability problems of blockchain.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.3
• /
• pp.1-12
• /
• 2021

Technologies for an MVDC(medium voltage direct current) distribution system are being considered as an effective alternative to overcome the interconnection delay issues of PV systems. However, the implementation of a DC distribution system might lead to economic problems because of the development of DC devices. Therefore, this paper deals with the scale of a PV plant based on its capacity and proposes hosting-capacity models for PV systems to establish a network to evaluate the feasibility of an MVDC distribution system. The proposed models can be classified as AC and DC distribution systems by the power-supply method. PV systems with hundreds of MW, dozens of MW, and a few MW can be categorized as large-scale, medium-scale, and small-scale models, respectively. This paper also performed modeling for an economic evaluation of MVDC distribution system by considering both the cost of AC and DC network construction, converter replacement, operation, etc. The profit was composed of the SMP and REC rate of a PV plant. A simulation for economic evaluation was done for the MVDC distribution system using the present worth and equal-principal costs repayment method. The results confirmed that the proposed model is a useful tool to evaluate economic issues of a DC distribution system.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.07a
• /
• pp.60-61
• /
• 2003

A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.517-534
• /
• 2017

This paper proposes an Internet of Things (IoT) middleware called Middleware for Cooperative Interaction of Things (MinT). MinT supports a fully distributed IoT environment in which IoT devices directly connect to peripheral devices, easily constructing a local or global network and sharing their data in an energy efficient manner. MinT provides a sensor abstract layer, a system layer and an interaction layer. These layers enable integrated sensing device operations, efficient resource management, and interconnection between peripheral IoT devices. In addition, MinT provides a high-level API, allowing easy development of IoT devices by developers. We aim to enhance the energy efficiency and performance of IoT devices through the performance improvements offered by MinT resource management and request processing. The experimental results show that the average request rate increased by 25% compared to existing middlewares, average response times decreased by 90% when resource management was used, and power consumption decreased by up to 68%. Finally, the proposed platform can reduce the latency and power consumption of IoT devices.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.293-304
• /
• 2011

The world of ubiquitous computing is one in which we will be surrounded by an ever-richer set of networked devices and services. Especially, mobile phone now becomes one of the key issues in ubiquitous computing environments. Mobile phones have been infecting our normal lives more thoroughly, and are the fastest technology in human history that has been adapted to people. In Korea, the number of mobile phones registered to the telecom company, is more than the population of the country. Last year, the numbers of mobile phone sold are many times more than the number of personal computer sold. The new advanced technology of mobile phone is now becoming the most concern on every field of technologies. The mix of wireless communication technology (wifi) and mobile phone (smart phone) has made a new world of ubiquitous computing and people can always access to the network anywhere, in high speed, and easily. In such a world, people cannot expect to have available to us specific applications that allow them to accomplish every conceivable combination of information that they might wish. They are willing to have information they want at easy way, and fast way, compared to the world we had before, where we had to have a desktop, cable connection, limited application, and limited speed to achieve what they want. Instead, now people can believe that many of their interactions will be through highly generic tools that allow end-user discovery, configuration, interconnection, and control of the devices around them. Serendipity is an application of the architecture that will help people to solve a concern of achieving their information. The word 'serendipity', introduced to scientific fields in eighteenth century, is the meaning of making new discoveries by accidents and sagacity. By combining to the field of ubiquitous computing and smart phone, it will change the way of achieving the information. Serendipity may enable professional practitioners to function more effectively in the unpredictable, dynamic environment that informs the reality of information seeking. This paper designs the Serendipity Service based on NFC (Near Field Communication) technology. When users of NFC smart phone get information and services by touching the NFC tags, serendipity service will be core services which will give an unexpected but valuable finding. This paper proposes the architecture, scenario and the interface of serendipity service using tag touch data, serendipity cases, serendipity rule base and user profile.