• Journal of KIISE
• /
• v.41 no.9
• /
• pp.674-685
• /
• 2014

The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.567-581
• /
• 2008

As the size of the web is growing explosively, search engines are becoming increasingly important as the primary means to retrieve information from the Internet. A search engine periodically downloads web pages and stores them in the database to provide readers with up-to-date search results. The web crawler is a program that downloads and stores web pages for this purpose. A large-scale search engines uses a parallel web crawler to retrieve the collection of web pages maximizing the download rate. However, the service architecture or experimental analysis of parallel web crawlers has not been fully discussed in the literature. In this paper, we propose an architecture of the parallel web crawler and discuss implementation issues in detail. The proposed parallel web crawler is based on the coordinator/agent model using multiple machines to download web pages in parallel. The coordinator/agent model consists of multiple agent machines to collect web pages and a single coordinator machine to manage them. The parallel web crawler consists of three components: a crawling module for collecting web pages, a converting module for transforming the web pages into a database-friendly format, a ranking module for rating web pages based on their relative importance. We explain each component of the parallel web crawler and implementation methods in detail. Finally, we conduct extensive experiments to analyze the effectiveness of the parallel web crawler. The experimental results clarify the merit of our architecture in that the proposed parallel web crawler is scalable to the number of web pages to crawl and the number of machines used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.643-645
• /
• 2010

The Internet-based multimedia services such as IPTV is being expanded with the development of technology to support the convergence of broadcasting and telecommunications technology for the control seems to be growing larger. Especially for the real-time TV broadcast multicast control technology to support the authentication and resource control, in addition to the technology services that enhance the value of technology for a variety of services in both directions seems to be developed. And, Internet-based transmission system transmit the video content for the video content delivery using RTP(Real Time Transport Protocol). Standardization body, IETF(Internet Engineering Task Force) within the RTP, according to a variety of audio and video formats only transmission format(RTP Payload Format) Establish a separate standard and scalable video content "RTP Payload Format for SVC(Switched Virtual Connection) Video" the standardization is currently processing. In this paper we are improving the quality of broadcasting and telecommunication systems, so that the upper layer by the application can react adaptively to the existing MPEG2-TS and RTP who are provided by a variety of content applied to a variety of devices consumers ETE(End- to-End) QoS(Quality of Service) for enhance the system who was designed and implemented.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.370-381
• /
• 2005

Mobile IP provides an efficient and scalable mechanism for host mobility within the Internet. Using Mobile If, mobile nodes may change their point of attachment to the Internet without changing their If address. However, it would result in a high signaling cost. To reduce the signaling cost, we factor in the fact that mobile users will not be actively communicating much of the time. In fact, there Is no necessity to send a binding update message to the home agent when an mobile node does not communicates with others while moving. From this point of view, we propose a lazy update strategy for minimizing signaling cost using the forwarding pointer in hierarchical Mobile IPv6. In our proposal, binding updates are sent only when a mobile node is in a busy mode. If an mobile node is in a dormant mode, binding update messages are delayed until busy mode using the forwarding pointer. As a result, our proposal can reduce the total signaling cost by eliminating unnecessary binding update messages when a mobile node Is in a dormant mode. In addition to, our proposal reduces unnecessary location update cost resulting from ping-pong effect under mobile node's dormant mode. Analysis results using the discrete analytic model presented in this paper shows that our proposal can has superior performance than hierarchical Mobile nv6 when the call-to-mobility ratio is low and the length of the forwarding pointer chain K is low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.21-30
• /
• 2012

Sensor networks are composed of a great number of sensor nodes with constrained battery. Disjoint multipath scheme based flooding method has a merit that efficiently construct multipath in irregular networks, but causes lots of energy consumption in networks. Flooding method is not a suitable technology in wireless sensor networks with constrained battery. We introduce energy-efficient geographic routing scheme considered as an efficient, simple, and scalable routing protocol for wireless sensor networks. The geographic routing scheme on multipath generates a problem with a congestion. So we introduce the concept of multipath pipeline as a congestion avoidance strategy. But multipath pipelines have a big problem on the boundary of holes under irregular networks. We propose a novel disjoint multipath scheme as combined method with geographic routing scheme and hole detouring algorithm on multipath. A novel disjoint multipath scheme constructs disjoint multipath pipelines efficiently for reliability without a collision in irregular wireless sensor networks. Simulation results are provided to validate the claims.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.939-945
• /
• 2008

Tn this paper we described the process and the results of an implementation of Internet terminal using G.729.1 wideband speech codec for next generation network. For this purpose firstly we chose a high performance RISC application processor having DSP features for speech codec processing and enhanced Multimedia Accelerator(eMMA) function for video codec. In the implementation of this terminal, we used G.729.1 codec recently standardized in ITU-T which is a new scalable speech and audio codec that extends 0.729 speech coding standard. To adopt G.729.1 codec to this terminal we transformed most of the fixed point C codes which require more complexity into assembly codes so as to minimize processing time in the processor. As a result of this work we reduced the execution time of the original C codes about 80% and operated in real time on the terminal. For video we used H.263/MPEG-4 codec which is supported by the eMMA with hardware in the processor. In the SIP call processing test connected to real network we obtained under looms end-to-end delay and 3.8 MOS value measured with PESQ instrument. Besides this terminal operated well with commercial terminals.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.474-483
• /
• 2003

The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.375-385
• /
• 2002

The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.76-90
• /
• 2006

Sensor network consists of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The life time of each node in the sensor network significantly affects the life time of whole sensor network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all sensor nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Cluster-Based Power-Efficient Routing (CBPER) Protocol which provides scalable and efficient data delivery to multiple mobile sinks. Previous r(luting protocols, such as Directed Diffusion and TTDD, need to flood many control packets to support multiple mobile sinks and many sources, causing nodes to consume their battery. In CBPER, we use the fact that sensor nodes are stationary and location-aware to construct and maintain the permanent grid structure, which makes nodes live longer by reducing the number of the flooding control packets. We have evaluated CBPER performance with TTDD. Our results show that CBPER is more power-efficient routing protocol than TTDD.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.5
• /
• pp.63-71
• /
• 2021

Among drone autonomous flight technologies, obstacle avoidance is a very important technology that can prevent damage to drones or surrounding environments and prevent danger. Although the LiDAR sensor-based obstacle avoidance method shows relatively high accuracy and is widely used in recent studies, it has disadvantages of high unit price and limited processing capacity for visual information. Therefore, this paper proposes an obstacle avoidance algorithm for drones using camera-based PPO(Proximal Policy Optimization) reinforcement learning, which is relatively inexpensive and highly scalable using visual information. Drone, obstacles, target points, etc. are randomly located in a learning environment in the three-dimensional space, stereo images are obtained using a Unity camera, and then YOLov4Tiny object detection is performed. Next, the distance between the drone and the detected object is measured through triangulation of the stereo camera. Based on this distance, the presence or absence of obstacles is determined. Penalties are set if they are obstacles and rewards are given if they are target points. The experimennt of this method shows that a camera-based obstacle avoidance algorithm can be a sufficiently similar level of accuracy and average target point arrival time compared to a LiDAR-based obstacle avoidance algorithm, so it is highly likely to be used.