• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.3
• /
• pp.197-203
• /
• 2009

Finite field arithmetic is very important in the area of cryptographic applications and coding theory, and it is efficient to use normal bases in hardware implementation. Using the fact that $GF(2^{mk})$ having a type-I optimal normal basis becomes the extension field of $GF(2^m)$, we, in this paper, propose a new serial multiplier which reduce the critical XOR path delay of the best known Reyhani-Masoleh and Hasan's serial multiplier by 25% and the number of XOR gates of Kwon et al.'s multiplier by 2 based on the Reyhani-Masoleh and Hasan's serial multiplier for type-I optimal normal basis.

• Korean Journal of Materials Research
• /
• v.25 no.5
• /
• pp.221-225
• /
• 2015

In-situ neutron diffraction has been employed to examine the effect of strain path on lattice strain evolution during monotonic and cyclic tension in an extruded Mg-8.5wt.%Al alloy. In the cyclic tension test, the maximum applied stress increased with cycle number. Lattice strain data were acquired for three grain orientations, characterized by the plane normal to the stress axis. The lattice strain in the hard {10.0} orientation, which is unfavorably oriented for both basal slip and {10.2} extension twinning, evolved linearly throughout both tests during loading and unloading. The {00.2} orientation exhibited significant relaxation associated with {10.2} extension twinning. Coupled with a linear lattice strain unloading behavior, this relaxation led to increasingly compressive residual strains in the {00.2} orientation with increasing cycle number. The {10.1} orientation is favorably oriented for basal slip, and thus showed a soft grain behavior. Microyielding occurred in the monotonic tension test and in all cycles of the cyclic test at an applied stress of ~50 MPa, indicating that strain hardening in this orientation was not completely stable from one cycle to the next. The lattice strain unloading behavior was linear in the {10.1} orientation, leading to a compressive residual strain after every cycle, which, however, did not increase systematically from one cycle to the next as in the {00.2} orientation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• Journal of Arbitration Studies
• /
• v.32 no.4
• /
• pp.103-141
• /
• 2022

Traditionally, schedule analysis in Korea has been used, mainly through the Critical Path Method, to evaluate the claim for extension of time and/or the amount of liquidated damages for delay. Critical path method, however, cannot identify the delay event and its impact occurred in non-critical path especially in multi facility projects. In multi facility projects that comprise several independent but related facilities or structures, each facility has its own facility critical path the duration of which will be impacted by facility specific critical delays. Thus, only through the non-critical delay analysis along with the critical delay analysis damages not attributable to contractors may be remedied in full. Because all the records and pictures can reveal what has actually happened in post contract review, only the retrospective analysis rather than the prospective analysis based on the assumptions can establish the cause and allocate the each parties' responsibilities appropriately.

• Korean Journal of Mathematics
• /
• v.29 no.3
• /
• pp.577-580
• /
• 2021

For a finite simplicial graph 𝚪, let G(𝚪) denote the right-angled Artin group on the complement graph of 𝚪. For path graphs P_k, cycle graphs C_ℓ and complete bipartite graphs K_n,m, this article characterizes the embeddability of G(K_n,m) in G(P_k) and in G(C_ℓ).

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.37-44
• /
• 2017

Wireless sensor networks are composed of many wireless sensor nodes that are sensing the environments. These networks have many constraints that are resource constraints, wireless communication, self-construction, etc. But they have many applications that are monitoring environment, tracking the object, etc. In this paper, a mechanism of finding QoS Satisfied multi-path is proposed in wireless sensor networks. In order to satisfy the QoS requirement, the proposed mechanism extends the AODV protocol to find multiple paths from a source node to a destination node by using the additional AODV message types that are proposed. This mechanism will be used to support many QoS applications such as minimum delay time, the better reliability and the better throughput by using the QoS satisfied multi-path. Overheads of the proposed mechanism are evaluated using simulation, and it is showed that QoS satisfied multiple paths are found with a little more overhead than the AODV mechanism.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.314-318
• /
• 2001

Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.559-580
• /
• 1997

It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Korean Society for Railway
• /
• v.19 no.5
• /
• pp.663-671
• /
• 2016

This paper investigates how to change passengers' preferences for express trains according to line extension in Seoul Metro Line 9. Before-and-after line extension, we traced passengers' path choices using Smart Card data via the method suggested by Kim et al. (2015). We developed two multinomial logit models before-and-after line extension. Transferability test showed that there is no difference between the two models. However, the load factor of the express train increased by 6.7% and the gap between the local and express trains became significantly wider.