• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.2
• /
• pp.51-59
• /
• 2010

Two logic transformations, De Morgan and re-substitution, are sufficient to convert a unate gate network (UGN) to a more general balanced inversion parity (BIP) network. Circuit classes of interest are discussed in detail. We prove that De Morgan and re-substitution transformations are test-set preserving for path delay faults. Using the results of this paper, we can easily show that a high-level test set for a function z that detects all path delay faults in any UGN realizing z also detects all path delay faults in any BIP realization of z.

• Plant Journal
• /
• v.10 no.2
• /
• pp.48-59
• /
• 2014

Coupons which have same figure as weld joint of the forged steel valves and 1 inch nominal weld thickness were manufactured using ASTM A182 F92 material. After welding with GTAW method, the welded specimens have been post-weld heat treated at $705^{\circ}C$, $735^{\circ}C$, $750^{\circ}C$, $765^{\circ}C$, $795^{\circ}C$ and $825^{\circ}C$ for 1 hour per 1 inch nominal weld thickness each (Group 1) to evaluate characteristics of welds based on various holding temperature. Indeed, 3 welded specimens were post-weld heat treated for 30 minutes, 1 hour and 2 hour (Group 2) at $735^{\circ}C$ to evaluate characteristics of welds based on various holding time. Hardness values were measured at the weld metal, heat affected zone and base metal to observe hardness change depending on the condition. As a result of the evaluation, appropriate holding temperature for PWHT is proved as $750^{\circ}C$ and $765^{\circ}C$ for 1hour per 1 inch nominal weld thickness. Indeed, holding for 1 hour per 1 inch nominal weld thickness was insufficient for PWHT effect when the holding temperature was at $735^{\circ}C$. The microstructure of post-weld heat treated weld metal was determined as tempered-martensite structure.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.328-339
• /
• 2007

Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.22 no.5
• /
• pp.31-38
• /
• 2018

The effects of polymer-binder ratio and metakaolin content on the properties of ultrarapid-hardening polymer-modified concretes using metakaolin are examined. As a result, regardless of the metakaolin content, the flexural, compressive and adhesion in tension strength of the ultrarapid-hardening polymer-modified concretes tend to increase with increasing polymer-binder ratio. Regardless of the polymer-binder ratio, the strengths of the ultrarapid-hardening polymer-modified concretes increase with increasing metakaolin content, and reaches a maximum at metakaolin content of 5%. The water absorption, carbonation depth and resistance of chloride ion penetration of the ultrarapid-hardening polymer-modified concretes decrease with increasing polymer-binder ratio. The resistance of freezing and thawing improvement is attributed to the improved bond between cement hydrates and aggregates because of the incorporation of polymer dispersion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1215-1227
• /
• 2002

This paper presents a genetic algorithmic approach to shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges partial chromosomes (partial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network sizes and topologies) for almost all source-destination pairs.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.131-143
• /
• 2014

A triple database consisting of a number of three-column tables require high cost of query processing, whereby building a shortcut is known as an effective way to reduce the cost. It is important to figure out what shortcuts needs to be selectively built. Most shortcut selection algorithms make use of a benefit model that considers the query frequency. However they work poor to reflect the database update. In this paper, we consider a benefit model for triple databases. The model considers not only the profit of query response times but also the building and maintenance costs of the shortcuts. We apply the model to design a benefit function which can be plugged in a greedy-based shortcut selection algorithm. We perform the empirical experiments on a real-world dataset and analyze the effect of each factor employed in the benefit function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1561-1567
• /
• 2015

Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path's stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.748-750
• /
• 2001

Ad hoc 네트워크에서 클러스터링은 여러 채널을 효율적으로 사용 가능하게 하고 제어메시지의 교환부하를 감소시키며, 이동성 관리를 용이하게 하는 이점이 있다. 그러나 대부분의 클러스터 기반 Ad hoc 라우팅 연구에서 클러스터의 생성과 유지에만 초점을 맞추고 있고, 클러스터 구조를 이용하는 경우에는 많은 채널을 소비하고 클러스터 재구성시간이 심각하게 길어진다. 이에 본 논문은 클러스터 구조를 이용하여 클러스터 정보가 모든 네트워크에 한번만 전달되도록 해서 경로를 설정하는 방법을 제안한다. 이 방법은 또한 클러스터 정보가 전달되는 도중의 경로단절 시, 빠르게 대체경로를 획득한다.

• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.31-40
• /
• 2011

Sensor nodes are easily exposed to malicious attackers by physical attacks. The attacker can generate various attacks using compromised nodes in a sensor network. The false report generating application layers injects the network by the compromised node. If a base station has the injected false report, a false alarm also occurs and unnecessary energy of the node is used. In order to defend the attack, a statistical en-route filtering method is proposed to filter the false report that goes to the base station as soon as possible. A path renewal method, which improves the method, is proposed to maintain a detection ability of the statistical en-route filtering method and to consume balanced energy of the node. In this paper, we proposed the secure path cycle method to consume effective energy for a path renewal. To select the secure path cycle, the base station determines through hop counts and the quantity of report transmission by an evaluation function. In addition, three methods, which are statistical en-route filter, path selection method, and path renewal method, are evaluated with our proposed method for efficient energy use. Therefore, the proposed method keeps the secure path and makes the efficiency of energy consumption high.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.