• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4A
• /
• pp.353-359
• /
• 2010

Cementitious matrix based composites are vulnerable to the drying shrinkage crack during the curing process. In this study, the drying shrinkage induced fracture behavior of the fiber reinforced concrete is simulated and the effects of the fiber reinforcement conditions on the fracture characteristics are analysed. The numerical model is composed of conduit elements and rigid-body-spring elements on the identical irregular lattice topology, where the drying shrinkage is presented by the coupling of nonmechanical-mechanical behaviors handled by those respective element types. Semi-discrete fiber elements are applied within the rigid-body-spring network to model the fiber reinforcement. The shrinkage parameters are calibrated through the KS F 2424 free drying shrinkage test simulation and comparison of the time-shrinkage strain curves. Next, the KS F 2595 restrained drying shrinkage test is simulated for various fiber volume fractions and the numerical model is verified by comparison of the crack initiating time with the previous experimental results. In addition, the drying shrinkage cracking phenomenon is analysed with change in the length and the surface shape of the fibers, the measurement of the maximum crack width in the numerical experiment indicates the judgement of the crack controlling effect.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.171-178
• /
• 2003

Differentiated Services (DiffServ) is a technique to provide Quality of Service (QoS) in an efficient and scalable way. However, current DiffServ specifications have limitations in providing the complete QoS management framework and its implementation model. This paper proposes a policy-based QoS management model that supports DiffServ policies for managing QoS of DiffServ networks. The management model conforms to Model-View-Controller (MVC) architecture, and is based on Enterprise JavaBeans (EJBs) technologies. In our model, high-level DiffServ QoS policies are represented as valid XML documents with an XML Schema and are translated to low-level EJB policy beans in the EJB-based policy server. The routing topology and role information required to define QoS policies is discovered by using SNMP MIB-II, and the QoS policy distribution and monitoring is accomplished by using SNMP DiffServ MIB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.2
• /
• pp.139-150
• /
• 2014

This paper suggests an algorithm to improve QoS by using DTR bit employed in the MIL-STD-188-220 protocol, when there is a multi-path between source and destination in the environment of KVMF tactical network supporting NCW. The MIL-STD-188-220 protocol can evaluate the link quality relatively but it cannot support optimal path selection for QoS. In order to solve this problem, we design an algorithm for selecting path using topology table which reflects measured DTR of path after the completion of transmission. The performance of the proposed algorithm has been evaluated by OPNET simulator. As a result of the simulation, it is found that QoS of proposed algorithm is enhanced higher than that of the MIL-STD-188-220 in the aggravated communication environment.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.385-392
• /
• 2015

In IoT(Internet of Things), it is important for wireless networks to communicate data created among resource-constrained wireless nodes, where time synchronization is needed for meaningful data creation and transmission. Time Synchronization by flooding is one of the mostly used protocols for WSN(Wireless Sensor Networks). Even though this type of scheme has some advantages over other types (i.e. a simple algorithm and independency of topology and so on), too many data transmission is required, leading to large power consumption. So, reducing transmission data is an important issue for energy efficiency in this kind of networks. In this paper, a new Flooding-based time synchronization protocol is proposed to use energy efficiently by reducing a transmitted traffic. The proposed scheme's performance has been evaluated and compared with an representative scheme, FTSP(Flooding Time Synchronization Protocol) by simulation. The results are shown that the proposed scheme is better than FTSP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1624-1647
• /
• 2020

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.4
• /
• pp.77-97
• /
• 2017

A recent sharp increase of the biomedical literature causes researchers to struggle to grasp the current research trends and conduct creative studies based on the previous results. In order to alleviate their difficulties in keeping up with the latest scholarly trends, numerous attempts have been made to develop specialized analytic services that can provide direct, intuitive and formalized scholarly information by using various text mining technologies such as information extraction and event detection. This paper introduces and evaluates total 8 Convolutional Neural Network (CNN) models for extracting biomedical events from academic abstracts by applying various feature utilization approaches. Also, this paper conducts performance comparison evaluation for the proposed models. As a result of the comparison, we confirmed that the Entity-Type-Fully-Connected model, one of the introduced models in the paper, showed the most promising performance (72.09% in F-score) in the event classification task while it achieved a relatively low but comparable result (21.81%) in the entire event extraction process due to the imbalance problem of the training collections and event identify model's low performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3952-3963
• /
• 2000

This paper considers the WRA(Wavelength and Houting Assignment) problem on all-optical tree networks using WDM(Wavelength Division Multiplexing). Each link between a pair of request nodes on all optical networks is assigned different wavelengths because of technical constraint. On the basis of this, we give an polynomial time algorithm to assign wavelengths to the all patbs of a arbitrary tree network using divide and conquer method. The time complexity of this algorithm is O(Q. R), in which Q is the request nodes for all to'all communication in a tree topology and U is the maximum number of wavelength. Also we implemented our algorithm using C in Pentium II 233MHz and analyzed performance results.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.419-428
• /
• 2008

IEEE 802.15.4 reserves transmission time to support real-time transport by sending GTS request packets to the PAN coordinator in advance. This paper introduces GTS-FAT technique to reduce the reservation time by giving a higher sending priority to GTS request packets than data packets. Differently from the conventional scheme where these two kinds of packets share a single transmission queue, GTS-FAT scheme allocates two queues with two different contention window sizes like IEEE 802.11e. This paper also proposes an analytical GTS delay model by combining the two legacy models for 802.15.4 and 802.11e to accurately predict the GTS-FAT delay over a given network topology. Our analysis shows that GTS-FAT reduces GTS service delay by up to 50% at the expense of the data delay by only up to 6.1% when GTS request packets four times outnumber data packets.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.311-317
• /
• 2008

This paper proposes a session key exchange scheme for providing secure communication between Vehicles and Infrastructure in VANET. In the current VANET environment, IEEE 802.11i or PKI based mechanism is used to provide secure communication between V2I. However, since the vehicles and the frequent changes of network topology, VANET nodes have some difficulties to exchange the session key using IEEE 802.11i or PKI method. In the proposed scheme, Local Router is newly defined for exchanging the session key between moving vehicles and infrastructure. A session key is generated by XOR operation based on the random values between Local Router and OBU. As a result, the proposed scheme has a noticeable advantage on the fastness of key exchange by exchanging session keys between LR and OBU.