• Structural Engineering and Mechanics
• /
• v.77 no.4
• /
• pp.495-508
• /
• 2021

This study devises a novel approach, namely quadruple 1D convolutional neural network, for detecting connection stiffness reduction in steel truss bridge structure using experimental and numerical modal data. The method is developed based on expertise in two domains: firstly, in Structural Health Monitoring, the mode shapes and its high-order derivatives, including second, third, and fourth derivatives, are accurate indicators in assessing damages. Secondly, in the Machine Learning literature, the deep convolutional neural networks are able to extract relevant features from input data, then perform classification tasks with high accuracy and reduced time complexity. The efficacy and effectiveness of the present method are supported through an extensive case study with the railway Nam O bridge. It delivers highly accurate results in assessing damage localization and damage severity for single as well as multiple damage scenarios. In addition, the robustness of this method is tested with the presence of white noise reflecting unavoidable uncertainties in signal processing and modeling in reality. The proposed approach is able to provide stable results with data corrupted by noise up to 10%.

• Advances in concrete construction
• /
• v.11 no.3
• /
• pp.261-270
• /
• 2021

In this study, a new understanding is presented on the microcracking behavior of high strength concrete (HSC) with steel fiber addition having prior compressive loading history. Microcracking behavior at critical stress (σcr) region, using seven fiber addition volume of 0.5, 0.75, 1.0, 1.25, 1.5, 1.75, and 2.0% was evaluated, at two aspect ratios (60 and 75). The specimens were loaded up to a specified compressive stress levels (0.70fc-0.96fc), and subsequently subjected to split tensile tests. This was followed by microscopic analyses afterwards. Four compressive stress levels as percentage of fc were selected according to the linearity end point based on stress-time (σ-t) diagram under uniaxial compression. It was seen that pre-compression has an effect on the linearity end point as well as fiber addition where it lies within 85-91% of fc. Tensile strength gain was observed in some cases with respect to the 'maiden' tensile strength as oppose to tensile strength loss due to the fiber addition with teething effect. Aggregate cracking was the dominant failure mode instead of bond cracks due to improved matrix quality. The presence of the steel fiber improved the extensive failure pattern of cracks where it changes from 'macrocracks' to a branched network of microcracks especially at higher fiber dosages. The applied pre-compression resulted in hardening effect, but the cracking process is similar to that in concrete without fiber addition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.946-955
• /
• 2004

It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

• Korean Institute of Interior Design Journal
• /
• v.21 no.1
• /
• pp.228-239
• /
• 2012

This study aims to propose the improvement direction of spatial organization of orphanage facilities by reflecting the international trend of child welfare facilities including 'enhancement of habitability', 'opening to the local community' and 'multi-functionality' on the basis of ideas of 'right of housing' and 'normalization'. Orphanage facilities are evolving from 'facilities' to accommodate unfortunate children to the concept of the 'community-care', and the residential space is also rapidly shifting to 'cottage' type resembling a residential type of ordinary family so as to enhance the self-esteem and relationship. To suggest the future-oriented changeability of current orphanage facilities, the present study conducted a nationwide survey of child welfare facilities and four Visiting researches of cottage type orphanage with different locations to investigate the appropriateness of housing type, organization of common use space, mode of management and facilities criteria. The results of this study are following: 1) For enhancement of habitability it is suggested that cottage type with various plans in the form of ordinary housing is appropriate, that the number of children per cottage is six or so, and that the number of less than two or three children per room is recommended. At the same time the adjustment of facilities criteria, simplified or complex, is suggested to support a similar residence pattern to ordinary home. 2) Specialized programs must be introduced to establish a base of welfare-network for community children according to features of location and a complex management must be sought in the connection with neighboring public facilities. 3) To secure the residential environment and quality of life for children, the concept of a simple playground space by the current facilities criteria must be broken away to reinforce the network of various outdoor spaces closely connected with living space.

• Journal of Korea Game Society
• /
• v.12 no.3
• /
• pp.3-10
• /
• 2012

Social network game induces to continue participation among the players through asynchronous connection mode. This characteristic of SNG that is required active social connectedness and that is the main purpose of SNG. The player's behavior attributes related with social connectedness can be divided by the environmental conception. In this paper, the player's behavior is divided into two types : Social Connectedness(SC) and Non-Social Connectedness(NC). Each type is categorized in specific actions of players that is explored. Also, experimental data collected from player's playing-game is analyzed in the comparison of each behavior and the relation of playfulness. Those results have suggested the scope for designing a appliable model on SNG development and represented the guideline to verify speedy the massive player's behavior through simplifying the player's behavior derived in SNG play experiences.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.45-52
• /
• 2015

Since the broadcast message in satellite signals the security of the data is extremely poor compared to other communication technologies such as the broadcast signal. Thus, encryption of the communication satellite has become a very important issue, an analysis of the communication performance of a general service is always required. In this paper, In order to analyze the encrypted communication the turbo code in an IP-based satellite communication applies the code rate compatible punctured and The wireless channel in consideration of the actual satellite communication was constructed by placing a weight on the Rayleigh fading and the Rician fading two channels. Retransmission-based error control scheme were constructed in the best performance of H-ARQ Type-II, III scheme of a number of ways that are recently considered. we analyzed the effects of normal service against a satellite communication network The security services were configured with encryption algorithms AES, ARIA (CTR, CBC mode).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.81-90
• /
• 2006

The GNUnet proposed a file encoding method by 1KB block size to support anonimity of files, decentralizes encoded block to peers through unstructed mode and original data decoding method a block searching or encoded blocks. but, the encoding and block decentralizing method with $600\sim700MB$ large multimedia file appered two problems. First problem, it need addition R block and I block, which make about 4% of storage resource. Second problem, unstructured model added network load by broadcasting decentralizing method. Third problem, The critical point of keyword search function. This paper suggest variable encoding block size and structured model by block decentralizing solution. Suggested encoding method reduced block request supplementary block generation from 4% to 1%, network load by proposal structured model sending answer through dedicated peer to decentralize block and we defined content-based keyword and identifier of sharing file.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.99-103
• /
• 2006

In this paper, we focus on the problem of designing an energy efficient MAC protocol for wireless sensor networks and analyze S(Sensor)-MAC and T(Time-out)-MAC. S-MAC is based on the concept of the 'listen/sleep mode cycle'. This applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data moves through the network. However unlike the S-MAC, where the duration of the cycle is fixed, T-MAC introduces an adaptive duty cycle in a novel way: by dynamical ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages while still maintaining a reasonable throughput. In this paper we discuss the design of these two Protocols. We analyze them from the aspect of latency, throughput, and power savings when using the OMNeT++ simulator in various environments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.6
• /
• pp.89-103
• /
• 2001

Through the increment of requirement for group oriented communication services, the multicast infrastructure based on a wire and wireless network has become a widely discussed researching topic. However the research of the security properties safety, efficiency and scaleability in a multicast structure, has not been enough. In this study, we propose a scalable secure multicast key management structure based on PKI(Public Key Infrastructure), IPSec, domain subgroup and structural two mode scheme to provide a integrated multicast service. Also we discuss and propose the digital nominative group signature a refreshing method for satisfying the security and trusty on the network. At the base of this work we certify to the usability of new proposed scheme from comparing it with conventional schemes in the part of safety, efficiency and scaleability.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.