• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.646-680
• /
• 2000

In this paper, we discuss the design and implementation of a concurrency control manager for a main memory DBMS(MMDBMS). Since an MMDBMS, unlike a disk-based DBMS, performs all of data update or retrieval operations by accessing main memory only, the portion of the cost for concurrency control in the total cost for a data update or retrieval is fairly high. Thus, the development of an efficient concurrency control manager highly accelerates the performance of the entire system. Our concurrency control manager employs the 2-phase locking protocol, and has the following characteristics. First, it adapts the partition, an allocation unit of main memory, as a locking granule, and thus, effectively adjusts the trade-off between the system concurrency and locking cost through the analysis of applications. Second, it enjoys low locking costs by maintaining the lock information directly in the partition itself. Third, it provides the latch as a mechanism for physical consistency of system data. Our latch supports both of the shared and exclusive modes, and maximizes the CPU utilization by combining the Bakery algorithm and Unix semaphore facility. Fourth, for solving the deadlock problem, it periodically examines whether a system is in a deadlock state using lock waiting information. In addition, we discuss various issues arising in development such as mutual exclusion of a transaction table, mutual exclusion of indexes and system catalogs, and realtime application supports.

• Geophysics and Geophysical Exploration
• /
• v.13 no.1
• /
• pp.40-50
• /
• 2010

The building process of any geological map involves linking sparse lithological outcrop information with equally sparse geometrical measurements, all in a single entity which is the preferred interpretation of the field geologist. The actual veracity of this interpretative map is partially dependent upon the frequency and distribution of geological outcrops compounded by the complexity of the local geology. Geophysics is commonly used as a tool to augment the distribution of data points, however it normally does not have sufficient geometrical constraints due to: a) all geophysical inversion models being inherently non-unique; and b) the lack of knowledge of the physical property contrasts associated with specific lithologies. This contribution proposes the combined use of geophysical edge detection routines and 'three point' solutions from topographic data as a possible approach to obtaining geological contact geometry information (strike and dip), which can be used in the construction of a preliminary geological model. This derived geological information should first be assessed for its compatibility with the scale of the problem, and any directly observed geological data. Once verified it can be used to help constrain the preferred geological map interpretation being developed by the field geologist. The method models the contacts as planar surfaces. Therefore, it must be ensured that this assumption fits the scale and geometry of the problem. Two examples are shown from folded sequences at the Bathurst Mining Camp, New Brunswick, Canada.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.3
• /
• pp.278-287
• /
• 2013

Modern information technologies continue to provide industries with new and improved methods. With the rapid development of Machine to Machine (M2M) communication, a smart container supply chain management is formed based on high performance sensors, computer vision, Global Positioning System (GPS) satellites, and Globle System for Mobile (GSM) communication. Existing supply chain management has limitation to real time container tracking. This paper focuses on the studies and implementation of real time container chain management with the development of the container identification system and automatic alert system for interrupts and for normal periodical alerts. The concept and methods of smart container modeling are introduced together with the structure explained prior to the implementation of smart container tracking alert system. Firstly, the paper introduces the container code identification and recognition algorithm implemented in visual studio 2010 with Opencv (computer vision library) and Tesseract (OCR engine) for real time operation. Secondly it discusses the current automatic alert system provided for real time container tracking and the limitations of those systems. Finally the paper summarizes the challenges and the possibilities for the future work for real time container tracking solutions with the ubiquitous mobile and satellite network together with the high performance sensors and computer vision. All of those components combine to provide an excellent delivery of supply chain management with outstanding operation and security.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.22-30
• /
• 2009

Due to high levels of integration and complexity, the Network-on-Chip (NoC) approach has emerged as a new design paradigm to overcome on-chip communication issues and data bandwidth limits in conventional SoC(System-on-Chip) design. In particular, exponentially growing of energy consumption caused by high frequency, synchronization and distributing a single global clock signal throughout the chip have become major design bottlenecks. To deal with these issues, a globally asynchronous, locally synchronous (GALS) design combined with low power techniques is considered. Such a design style fits nicely with the concept of voltage-frequency-islands (VFI) which has been recently introduced for achieving fine-grain system-level power management. In this paper, we propose an efficient design methodology that minimizes energy consumption by VFI partitioning on an NoC architecture as well as assigning supply and threshold voltage levels to each VFI. The proposed algorithm which find VFI and appropriate core (or processing element) supply voltage consists of traffic-aware core graph partitioning, communication contention delay-aware tile mapping, power variation-aware core dynamic voltage scaling (DVS), power efficient VFI merging and voltage update on the VFIs Simulation results show that average 10.3% improvement in energy consumption compared to other existing works.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.65-73
• /
• 2016

Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.

• Journal of the Korea Convergence Society
• /
• v.8 no.12
• /
• pp.39-47
• /
• 2017

The Internet have increased the number of digital web documents related to the history and traditions of Korean Culture. However, users who search for creators or materials related to traditional cultures are not able to get the information they want and the results are not enough. Document classification is required to access this effective information. In the past, document classification has been difficult to manually and manually classify documents, but it has recently been difficult to spend a lot of time and money. Therefore, this paper develops an automatic text classification model of traditional cultural contents based on the data of the Korean information culture field composed of systematic classifications of traditional cultural contents. This study applied TF-IDF model, Bag-of-Words model, and TF-IDF/Bag-of-Words combined model to extract word frequencies for 'Korea Traditional Culture' data. And we developed the automatic text classification model of traditional cultural contents using Support Vector Machine classification algorithm.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.139-149
• /
• 2004

As the expansion of road capacity has become impractical in many urban areas, congestion pricing has been widely considered as an effective method to reduce urban traffic congestion in recent years. The principal reason is that the congestion pricing may lead the user equilibrium (UE) flow pattern to system optimum (SO) pattern in road network. In the context of network equilibrium, the link tolls according to the marginal cost pricing principle can user an UE flow to a SO pattern. Thus, the pricing method offers an efficient tool for moving toward system optimal traffic conditions on the network. This paper proposes a continuous network design program (CNDP) in network equilibrium condition, in order to find optimal congestion toll for maximizing net economic benefit (NEB). The model could be formulated as a bi-level program with continuous variable(congestion toll) such that the upper level problem is for maximizing the NEB in elastic demand, while the lower level is for describing route choice of road users. The bi-level CNDP is intrinsically nonlinear, non-convex, and hence it might be difficult to solve. So, we suggest a heuristic solution algorithm, which adopt derivative information of link flow with respect to design parameter, or congestion toll. Two example networks are used for test of the model proposed in the paper.

• Journal of the Korea Concrete Institute
• /
• v.27 no.4
• /
• pp.331-341
• /
• 2015

The main purpose of this study is reducing the cost and effort for characterization of tensile strength of fiber reinforced concrete, in order to use in structural design. For this purpose, in this study, test for fiber reinforced concrete was carried out. Because fiber reinforced concrete is consisted of diverse material, it is hard to define the correlation between mix proportions and strength. Therefore, compressive strength test and tensile strength test were carried out for the range of smaller than 100 MPa of compressive strength and 0.25~1% of steel fiber volume fraction. as a results of test, two types of tensile strength were highly affected by compressive strength of concrete. However, increase rate of tensile strength was decreased with increase of compressive strength. Increase rate of tensile strength was decreased with increase of fiber volume fraction. Database was constructed using previous research data. Because estimation equations for tensile strength of fiber reinforced concrete should be multiple variable function, linear regression is hard to apply. Therefore, in this study, we decided to use the ANN(Artificial Neural Network). ANN was constructed using multiple layer perceptron architecture. Sigmoid function was used as transfer function and back propagation training method was used. As a results of prediction using artificial neural network, predicted values of test data and previous research which was randomly selected were well agreed with each other. And the main effective parameters are water-cement ratio and fiber volume fraction.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.4
• /
• pp.569-579
• /
• 2013

Robot control and image processing using a smartphone and Wi-Fi communication is introduced. The robot has a wheel and quadruped mechanism that is transformed according to the environment and is mainly used for drug bottle delivery. The captured image on the camera is transmitted to the smartphone in the form of stream data, and the image data is processed in the smartphone to enable the robot to identify an object and to control the robot itself. A network was constructed so that only image data from the stream data was used, and an image processing scheme to identify the drug bottle and deliver it to a person using a robot arm is also presented. In this study, image processing techniques and algorithms were purely implemented on a smartphone with considerable computational power and multiple functions rather than a computer, which contributes to the intelligence and miniaturization of the robot system.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.