• Journal of the Korean Geotechnical Society
• /
• v.20 no.9
• /
• pp.105-114
• /
• 2004

Consolidation characteristics have been investigated by using Rowe cell consolidation tester for dredged soil, which is more than two times as much as the liquid limit. To examine the effects of variation of water content on consolidation characteristic, tests were carried out varying the initial water content from $100\%\;to\;150\%.$ The results were compared with the consolidation characteristics of remolded clay. The test results showed that the hither the initial water content of dredged clay was, the more noticeable the non-linear behavior of e-log P curves occurred. The variation of the gradient was apparent to load stage 40kPa and became less apparent after load stage 80kPa on the e-log P curves. Ratio of compression index stayed within the range suggested by Mesri and variation of initial water content has hardly influenced the coefficient of consolidation. On the contrary, it was found that the magnitude of consolidation load affects the vertical coefficient of consolidation. The variation of stratum thickness during consolidation processing needs to be taken into consideration since hydraulic fill would go through a much larger scale strain than land soil when it is subject to a load. In this study, the consolidation period considering the variation of stratum thickness was analyzed and the results were compared with those of existing consolidation studies which did not consider the variation of stratum thickness. According to the results of the study, the consolidation period of the ground with a larger strain was calculated more close to observed value in case of Mikasa theory which takes the variation of stratum thickness into consideration.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.265-272
• /
• 2007

In this paper, we implement an automated composition system of web services using hybrid techniques that merge the benefit of BPEL techniques, with the advantage of OWL-S, BPEL techniques have practical capabilities that fulfil the needs of the business environment such as fault handling and transaction management. However, the main shortcoming of these techniques is the static composition approach, where the service selection and flow management are done a priori and manually. In contrast, OWL-S techniques use ontologies to provide a mechanism to describe the web services functionality in machine-understandable form, making it possible to discover, and integrate web services automatically. This allows for the dynamic integration of compatible web services, possibly discovered at run time, into the composition schema. However, the development of these approaches is still in its infancy and has been largely detached from the BPEL composition effort. In this work, we describe the design of the SemanticBPEL architecture that is a hybrid system of BPEL4WS and OWL-S, and propose algorithms for web service search and integration. In particular, the SemanticBPEL has been implemented based on the open source tools. The proposed system is compared with existing BPEL systems by functional analysis. These comparisions show that our system outperforms existing systems.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.10-17
• /
• 2007

It opens a new horizon on spintronics for the potential application of MTJ as a universal logic element, to employ the magneto-logic in substitution for the transistor-based logic device. The magneto-logic based on the MTJ element shows many potential advantages, such as high density, and nonvolatility. Moreover, the MTJ element has programmability and can therefore realize the full logic functions just by changing the input signals. This magneto-logic using MTJ elements can embody the reconfigurable circuit to overcome the rigid architecture. The established magneto-logic element has been designed and fabricated on a triple-layer MTJ. We present a novel magneto-logic structure that consists of a single layer MTJ and a current driver, which requires less processing steps with enhanced functional flexibility and uniformity. A 4-bit gray counter is designed to verify the magneto-logic functionality of the proposed single-layer MTJ and the simulation results are presented with the HSPICE macro-model of MTJ that we have developed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.66-72
• /
• 2014

Histogram of oriented gradient (HOG) feature is widely used in vision-based pedestrian detection. The interpolation is the most important technique in HOG feature calculation to provide high detection rate. In interpolation technique of HOG feature calculation, two nearest orientation bins to gradient orientation for each pixel and the corresponding weights are required. In this paper, therefore, an efficient gradient orientation bin and weight calculation circuit for HOG feature is proposed. In the proposed circuit, pre-calculated values are defined in tables to avoid the operations of tangent function and division, and the size of tables is minimized by utilizing the characteristics of tangent function and weights for each gradient orientation. Pipeline architecture is adopted to the proposed circuit to accelerate the processing speed, and orientation bins and the corresponding weights for each pixel are calculated in two clock cycles by applying efficient coarse and fine search schemes. Since the proposed circuit calculates gradient orientation for each pixel with the interval of $1^{\circ}$ and determines both orientation bins and weights required in interpolation technique, it can be utilized in HOG feature calculation to support interpolation technique to provide high detection rate.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.20 no.2
• /
• pp.127-136
• /
• 2002

DEM(Digital Elevation Model) is used widely in image processing, water resources, construction, GIS, landscape architecture, telecommunication, military operations and other related areas. And it is used especially in producing ortho-photo based on specific DEM and developing 3D GIS database vividly. As LiDAR(Light and Detection And Ranging) system emerged recently, DEM could be developed in urban area more efficiently and more economically, compared to the conventional DEM Production. Traditional method using check points for elevation has tome limitations in structure's height accuracy by LiDAR, because it uses only terrain height. Accordingly after the downtown of Chungju city was selected as a test field in this paper and DEM and digital ortho images was produced by way of LiDar survey, the accuracy was evaluated through analytical plotting map. The result shows that in case of buildings in LiDAR DEM, the accuracy is 0.30 m in X, 0.62 m in Y and RMS is 1.17 m. The difference distribution between DEM and plotting map in range of $\pm$10 cm was 36.2% and $\pm$10 cm $\pm$20 cm was 43.53%. The accuracy of LiDAR in this study meets 1/5,000 which is the regulation for map of NGI(National Geography Institute) and LiDAR can be possibly used in many other applied area.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.729-742
• /
• 2003

Mobile Communication has a possibility of eavesdropping by nature of wireless channel. It is known that eavesdropping of CDMA system is impossible because the voice data spreads with the PN. First of all, we show that it is possible to eavesdrop the CDMA channel by analysis of the forward channel in case that we know the ESN and the MIN. We can monitor the forward traffic channel with easy since ESN and MIN are exposed during the call processing in CDMA service in Korea. In this paper, we will show security weakness and propose an enhanced mechanism for CDMA service. We consider the problem of security in the CDMA service. CDMA system has wireless channels to transmit voice or data. By this reason, CDMA communication has a possibility of being eavesdropped by someone. It is known that eavesdropping in CDMA system is impossible because the voice data spreads with the PN. However, we can eavesdrop the CDMA data in FCM protocol in case that we know the ESN and the MIN. In CDMA system, ESN and MIN are exposed to the wireless channel. In this paper, we analyze the flow of the voice and signal in the CDMA system and monitor the forward traffic channel by the FCM protocol. The FCM protocol is proposed to monitor the forward channel in CDMA system. We can show the possibility of monitoring in one-way channel of CDMA system by the FCM protocol. The test instrument based on the FCM protocol is proposed to monitor the CDMA forward channel. We will show the system architecture of the test instrument to monitor the forward channel in CDMA.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.395-406
• /
• 2009

Korean government has operated EA by the act on efficient introduction of information system and operation, etc. But the evaluation system for EA and the criteria don't prepare well. Particularly, There is no model for EA performance measurement and the way is insufficient. In this study, we derived 8 areas and 17 criteria for the performance evaluation based on the Performance Reference Model of U.S FEA and Korea. And we also derived 8 areas and 10 criteria for it based on the OMB EA Assessment Framework and the EA maturity model in Korea. We propose the performance evaluation model of the five areas that consists of the business performance, customer performance, process, human resource and the technology for EA performance evaluation. To verify the model, we applied the model to three organizations and evaluated EA performance. In addition, we compared the performance result with the performance evaluation area of EA maturity model of Korea to verify the result. We also analyzed the criteria of the proposed performance evaluation model with the current EA maturity model and Performance Reference Model of Korea. As a result of the evaluation, we verified of the proposed performance evaluation model, too.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.355-364
• /
• 2004

These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.