• Tunnel and Underground Space
• /
• v.8 no.3
• /
• pp.200-208
• /
• 1998

This research is intended to investigate the behavior of the jointed rock under various loading conditions: static or dynamic load. The distributed state concept (DSC) is based on the idea that the response of the joint can be related to and expressed as the response of the reference states : relative intact (RI) and fully adjusted (FA) states. In the DSC, an initially RI joint modifies continuously through a process of natural self-adjustment, and a part of it approaches the FA state at randomly disturbed locations in the joint areas. In this study, based on the DSC concept, RI state, FA state, and disturbance function (D) are defined for characterizing the behavior of rock joint. From the results of this research, it can be stated that DSC model is capable of capturing the physical behavior of jointed rock such as softening and hardening and considering the size of joint and roughness of joint surface.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1581-1589
• /
• 1999

In B-ISDN(Broadband Integrated Services Digital Networks), the efficient implementation of multicast function is very important since the demand for distributed type of service such as VOD(Video On Demand) system is expected to grow. In this paper, the multicast performance characteristics of fully-interconnected switch fabric used for our research is the proper architecture for a small-sized switch element, and it uses bit addressing method for addressing scheme and thus it is easy to implement multicast function without adding a function block. To incorporate the bursty nature of traffic in ATM networks, we used IBP(Interrupted Bernoulli Process) model as an input traffic model. We presented and analyzed the simulation results in terms of the multicast operation of the switch. Based. on this study, it its analyzed that congestion avoidance may be feasible if we use a proper traffic control scheme by finding an overload point due to multicast.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1033-1036
• /
• 2013

A study about collision resolution is needed because huge file, video and multimedia information are transmitted to wireless LAN. CSMA/CR protocol guarantees fairness, but doesn't consider QoS. To practicalize CSMA/CR protocol in saturation fully-connected single hop network environments, this paper proposes method of collision compensation. previous CSMA/CR protocol chooses CR Slot only considering fairness, but this paper chooses front CR Slot for compensation of collision to station experiencing collisions. The station transmits jam signal and has channel priority of transmission. So transmitting efficiency and successful transmission probability rise. This proposed simple method can offer benefit to station experiencing collisions without additional hardware cost.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.226-238
• /
• 2007

In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2018

Enhancing performance of big data analytics in distributed environment has been issued because most of the big data related applications such as machine learning techniques and streaming services generally utilize distributed computing frameworks. Thus, optimizing performance of those applications at Spark has been actively researched. Since optimizing performance of the applications at distributed environment is challenging because it not only needs optimizing the applications themselves but also requires tuning of the distributed system configuration parameters. Although prior researches made a huge effort to improve execution performance, most of them only focused on one of three performance optimization aspect: application design, system tuning, hardware utilization. Thus, they couldn't handle an orchestration of those aspects. In this paper, we deeply analyze and model the application processing procedure of the Spark. Through the analyzed results, we propose performance optimization schemes for each step of the procedure: inner stage and outer stage. We also propose appropriate partitioning mechanism by analyzing relationship between partitioning parallelism and performance of the applications. We applied those three performance optimization schemes to WordCount, Pagerank, and Kmeans which are basic big data analytics and found nearly 50% performance improvement when all of those schemes are applied.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.476-489
• /
• 1999

HW/SW codesign is integrated design of systems implemented using both hardware and software components. Many design tools has been developed to support this new paradigm, so far. Current codesign tools are not widely used as been expected because of variety problems - rapidly evolving technology, platform dependency, absence of standard specification method, inconsistent user interface, varying target system, different functionality In this paper, we propose a web-based distributed HW/SW codesign environment to remedy this kinds of problem. Our codesign environment has object-based 3 tier client/server architecture. It supports collaborative workspace through session service. Fully object-oriented design of user interface(OOUI) enables easy extension without change of user Interface. Furthermore it contains transaction server and security server for efficient and safe transfer of design data. To show a validity of our design, we developed prototype of web-based HW/SW codesign environment called WebCEDA. Our model of HW/SW codesign can be used for web-based generic CAD tools.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• Journal of Digital Convergence
• /
• v.15 no.6
• /
• pp.229-236
• /
• 2017

An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called "CAWFP-Growth" that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

• Journal of IKEEE
• /
• v.13 no.3
• /
• pp.7-17
• /
• 2009

WiMedia UWB technology is a fully distributed data communication technology developed for the application demanding a high data transmission rate in the wireless PAN area. In general, devices can send data either by reserving time slots or by using prioritized CSMA/CA. If the PCA protocol of prioritized CSMA/CA is used, they are suffered congestion as the number of devices increases. In this paper, we propose a Deterministic Access Protocol(DAP) in WiMedia WPANs. A DAP is a method to transmit data in the non-reserved DRP period without competition as each device informs the beacon order information in the beacon period and the queue information. In addition, the problem that the devices with a lower beacon slot number have more transmission opportunities is addressed by introducing the reference point. Simulation results are given to demonstrate that a DAP can improve the throughput and reduce the packet loss rate.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.77-86
• /
• 2008

The Web information sources can be regarded as the largest distributed database to the users. By virtually integrating the distributed information sources and regarding them as a single huge database, we can query the database to extract information. This capability is important to develop Web application programs. We have to infer a database schema from browsing-oriented Web documents in order to integrate databases. This paper presents a heuristic algorithm to infer the XML Schema fully automatically from semi-structured Web documents. The algorithm first extracts candidate pattern regions based on predefined structure-making tags, and determines a target pattern region using a few heuristic factors, and then derives XML Schema extraction rules from the target pattern region. The schema extraction rule is represented in XQuery, which makes development of various application systems possible using open standard XML tools. We also present the experimental results for several public web sources to show the effectiveness of the algorithm.