• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• Journal of the Korea Concrete Institute
• /
• v.17 no.3 s.87
• /
• pp.369-374
• /
• 2005

This study proposes a technique for the recognition of crack patterns, which includes horizontal, vertical, diagonal($-45^{\circ}$), diagonal($+45^{\circ}$), and random cracks, based on image processing technique and artificial neural network. A MATLAB code was developed for the proposed image processing algorithm and artificial neural network. Features were determined using total projection technique, and the structure(no. of layers and hidden neurons) and weight of artificial neural network were determined by learning from artificial crack images. In this process, we adopted Bayesian regularization technique as a generalization method to eliminate overfitting Problem. Numerical tests were performed on thirty-eight crack images to examine validity of the algorithm. Within the limited tests in the present study, the proposed algorithm was revealed as accurately recognizing the crack patterns when compared to those classified by a human expert.

• Journal of the Korea Convergence Society
• /
• v.9 no.9
• /
• pp.61-67
• /
• 2018

Emulab software was developed by the team of University of Utah and it has been replicated at dozens of other sites in the world. Although KREONET Emulab, which established by the Korea Institute of Science and Technology Information, has only a modest number of compute nodes it has been provided an ideal playground to conduct various research for network protocols, cyber security and convergence research. A testbed is a critical enabler of experimental research and researchers only carry out the experiments that are supported by the testbed. This paper outlines the Utah Emulab's status and use types among the last 10 years of operation results and compares them with the ones with the KREONET Emulab. In addition, Testbed-as-a-Service(TaaS) is discussed to upgrade the testbed for the convergence research community services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1947-1957
• /
• 2015

CCN networking is one of the future internet. With the rapid development of network platforms emerged a wide range of services through a virtual network environment. The performance of CCN in the high bandwidth delay is important to provide various services between nations. We can check the high bandwidth delay product in federation. Federation between the nations has the advantage of being effective to do a various services for the users, and the remote heterogeneous physical hardware engine supports various environments. Data transmission delay can be occur in long distance network even though the network is federated network. In this paper, we propose CCN-Helper protocol for data transmission delay in ling distance networks. We connect from KREONET in Korea to iLab.t in Belgique in order to test CCNx over heterogeneous federated environment.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.6
• /
• pp.719-730
• /
• 2007

This study presents a thin-walled space frame element based on the classical Timoshenko beam theory. The element is derived according to the assumed strain field in order to resolve the shear-locking phenomenon. The shape function is developed in accordance with the strain field which is assumed to be constant at a 2-noded straight frame element. In this study, the geometrically nonlinear analysis applies the Corotational procedure in order to evaluate unbalanced loads. The bowing effect is also considered faithfully. Two numerical examples are given; monosymmetric curved and nonsymmetric straight cantilever. When these example structures behave lateral-torsional bucking, the critical loads are obtained by this study and ABAQUS shell elements. Also, the post-buckling behavior is examined. The results give good agreement between this study and ABAQUS shell.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.723-729
• /
• 2001

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. The users connect to the Solid Modeler Server through m and they create 3D shape and manipulate them variously. Then the users will share 3D objects and two problems can arise. The users must be able to pick the objects effectively which they want to manipulate. When one of the users manipulates a particular object, others should not disturb with the same object. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy. To have effective concurrency, we used shared lock and exclusive lock as the action in work space.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2596-2604
• /
• 1997

There are two kinds of backends in ACK:code generator(full-fledged backend) and code expander(fast backend). Code generators generate target code using string pattern matching and code expanders generate target code using macro expansion. ACK translates EM to SPARC code using code expander. The corresponding SPARC code sequences for a EM code are generated and then push-pop optimization is performed. But, there is the problem of maintaining hybrid stack. And code expander is not considered to passes parameters of a procedure call through register windows. The purpose of this paper is to improve SPARC code quality. We suggest a method of SPARC cod generation using EM tree. Our method is divided into two phases:EM tree building phase and code expansion phase. The EM tree building phase creates the EM tree and code expansion phase translates it into SPARC code. EM tree is designed to pass parameters of a procedure call through register windows. To remove hybrid stack, we extract an additional information from EM code. We improved many disadvantages that arise from code expander in ACK.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.148-156
• /
• 2000

This paper proposed that an MPLS-based VPN using next-generation If switches and appropriate set of traffic engineering algorithms is the best way to implement QoS-capable IP VPNs. While ATM-based solution would not rely scalable the number of connections becomes too large, MPLS-based VPNs’ efficiency could be confirmed network delay time through performance evaluation. And we evaluated the performance about the If VPN based on proposed MPLS, at the result of evaluation. We figured out that delay increased more slowly in case of VPN based on MPLS comparing with the VPN based on ATM which has rapid delay increasement. Therefore we confirm that the VPN based on MPLS has high speed of packet processing and high degree of network efficiency through the performance evaluation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.11
• /
• pp.834-841
• /
• 2018

A power amplifier for subgigahertz short-range wireless communication using $0.18-{\mu}m$ CMOS technology is presented. It is designed as a differential structure to form easily a virtual ground node, to increase output power, and to design a cascode structure to prevent breakdown. The transistor gate width was determined to maximize the output power and power-added efficiency(PAE), and the balun was optimized through electromagnetic simulation to minimize the loss caused by the matching network. This power amplifier had a gain of more than 49.5 dB, a saturation power of 26.7 dBm, a peak PAE of 20.7 % in the frequency range of 860 to 960 MHz, and a chip size of $2.14mm^2$.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.4
• /
• pp.87-97
• /
• 2019

SRS was proposed for immediate processing of the meaning of sensor data on mobile devices independent from specific sensor networks and sensor type. However, each time new sensor data is received, sensor data inspection operations are performed repeatedly, and it cause resulting in low performance. App profile-based SRS has been proposed to resolve the problem. The app profile-based SRS has improved the SRS problem through the profile, but has been tested in a virtual simulation environment. After that the test was experimented in a real-time environment, but has not been tested with a variety of dynamic factors. Therefore, this paper experiment considering such as user mobility and sensor density in real-time environment. And this paper also evaluate performance of the App profile-based through analysis of the results of the experiment. As a result, app profile-based SRS is high influence by density and sensor type, and the number of sensor node is not influence.