• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.3
• /
• pp.185-194
• /
• 2012

This paper deals with free vibrations of the tapered Timoshenko beam in which both the rotatory inertia and shear deformation are included. The cross section of the tapered beam is chosen as the rectangular cross section whose depth is constant but breadth is varied with the parabolic function. The fourth order ordinary differential equation with respect the vertical deflection governing free vibrations of such beam is derived based on the Timoshenko beam theory. This governing equation is solved for determining the natural frequencies corresponding with their mode shapes. In the numerical examples, three end constraints of the hinged-hinged, hinged-clamped and clamped-clamped ends are considered. The effects of various beam parameters on natural frequencies are extensively discussed. The mode shapes of both the deflections and stress resultants are presented, in which the composing rates due to bending rotation and shear deformation are determined.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.25-33
• /
• 2012

Ptak & Smith published ORLICKY'S Material Requirement Planning Third Edition in 2011 to correspond the rapidly changed market demand by improving the original MRP based on Theory of Constraints(TOC) replenishment inventory management. This study is to develop the simulation model to decide the proper target inventory level for TOC replenishment inventory management using system dynamics Vensim software. This study shows that the proper target replenishment level is how much significant to manage the inventory by the random sample data simulation. This simulation model will be extended to compare the results of the TOC replenishment inventory management planning with the results of the old MRP planning by the enterprise actual inventory data.

• KIEAE Journal
• /
• v.10 no.1
• /
• pp.73-83
• /
• 2010

In urban regeneration, resident participation and respect of residents' need have become a major important issue. The purpose of this study is to identify residential area improvement characteristics expected by local residents. Data used for this study were collected from survey which used questionnaire and village image map construction tool kit, developed for facilitating the residents' participation in an actual housing improvement area at Kwngjoo, Korea. The major contents surveyed through questionnaire were first, future images of the area second, directions of improvement third, preferred architectural types such as high or low rise buildings. and a total of 335 data was collected within 4 days during 12-14 December, 2008. The kit was used by parents of students at a local elementary school, and 205 image maps were collected. Content analysis was to analyse characteristics of villages shown in the constructed image maps. Lynch's five elements were utilized to select areas for analysis. As a result, types of buildings desired by residents at the selected four local areas were identified. In general, residents desired their village to be improved with low and mid rise buildings, respecting existing cultural assets. This study showed that there is certain characteristics in relation to the selected areas. Besides, the tool kit used this study showed the effectiveness in collecting opinions from young households in the improvement area within a short time. The tool is expected to be useful in attracting residents and in facilitating participation of wide range of local residents by improving the constraints stemming from time and space.

• Steel and Composite Structures
• /
• v.25 no.1
• /
• pp.105-116
• /
• 2017

This paper presents the dynamic stability study of laminated composite plates with different force combinations and aspect ratios. Optimum non-diverging stacking is obtained for certain loading combination and aspect ratio. In addition, the stability force is maximized for a definite operating frequency. A dynamic version of the principle of virtual work for laminated composites is used to obtain force-frequency relation. Since dynamic stiffness governs the divergence or flutter, an efficient optimization method is necessary for the response functional and the relevant constraints. In this way, a model based on the ant colony optimization (ACO) algorithm is proposed to search for the proper stacking. The ACO algorithm is used since it treats with large number of dynamic stability parameters. Governing equations are formulated using classic laminate theory (CLT) and von-Karman plate technique. Load-frequency relations are explicitly obtained for fundamental and secondary flutter modes of simply supported composite plate with arbitrary aspect ratio, stacking and boundary load, which are used in optimization process. Obtained results are compared with the finite element method results for validity and accuracy convince. Results revealed that the optimum stacking with stable dynamic response and maximum critical load is in angle-ply mode with almost near-unidirectional fiber orientations for fundamental flutter mode. In addition, short plates behave better than long plates in combined axial-shear load case regarding stable oscillation. The interaction of uniaxial and shear forces intensifies the instability in long plates than short ones which needs low-angle layup orientations to provide required dynamic stiffness. However, a combination of angle-ply and cross-ply stacking with a near-square aspect ratio is appropriate for the composite plate regarding secondary flutter mode.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1185-1193
• /
• 1999

최적 스택 필터는 시그널 또는 영상의 임의의 특성 정보를 보존하고자 하는 요구조건에 의해 강제된 구조적 제약 하에서 최대의 잡음제거 효과를 얻을 수 있다. 그리고 임계치 분할 특성과 양의 부울 함수에 기반한 이진 영역에서의 처리 특성은 이 필터가 높은 병렬성을 갖고 있음을 보여준다. 본 논문에서는 두 개의 병렬 계산 모델 MCC(Mesh-Connected Computer)와 CCC(Cube-Connected Computer)에서 최적 스택 필터를 위한 1차원 병렬 알고리즘을 개발한다. 최적 스택 필터의 실행 시간은 주로 이진 median 연산에 의해 결정되고 본 논문에서 제안된 알고리즘은 선형 분리성에 의해 이 연산을 구현한다. 이를 바탕으로, M 레벨의 1-D 시그널의 길이가 L이고 윈도우 폭이 N이라고 가정할 때, 제안된 알고리즘은 {{{{root M times root M`` MCC에서 O(L sqrt{M}`) 시간에 그리고 M 개의 PE를 갖는 CCC에서 O(L log M)시간에 수행될 수 있다. 또한 잡음을 더욱 효과적으로 제거하기 위해 윈도우 폭 N을 증가시킬 때, 제안된 병렬 알고리즘의 계산 시간은 일정하게 유지됨을 보인다.Abstract An optimal stack filter achieves the maximum noise attenuation under the structural constraints imposed by the requirement of preserving certain signal or image features. And the filter provides a high parallelism due to the principles of threshold decomposition and binary processing based on positive Boolean functions(PBFs). In this paper, we develop an one-dimensional parallel algorithm for the optimal stack filter on two parallel computation models, MCC(Mesh-Connected Computer) and CCC(Cube-Connected Computer). The running time of the optimal stack filter depends mainly on the binary median operation and our algorithm realizes this operation by the linear separability. Based on this scheme, our parallel algorithm can be performed in {{{{O(L sqrt{M}`) MCC and inO(L log M) time on CCC with M PEs, when the length of M``-valued 1-D signal is L`` and window width is N`` Also, we show that the computation time of our parallel algorithm keeps constant when the window width N increases in order to achieve the best noise attenuation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1206-1216
• /
• 1999

이동 호스트란 시간과 공간의 제약 없이 필요한 기능을 수행하고, 또한 원하는 정보에 접근할 수 있는 휴대용 컴퓨터를 일컫는다. 이동 컴퓨팅 환경이란 이러한 이동 호스트들을 지원할 수 있도록 구성된 분산 환경이다. 따라서 이동 컴퓨팅 환경에서의 분산 알고리즘은 정적 호스트만을 고려한 기존의 분산 환경에서와는 다르게 이동 호스트의 여러 가지 특성들을 고려하여 제안되어야 한다. 즉, 이동 컴퓨팅 환경의 도래로 인하여 이동성과 휴대성, 그리고 무선 통신과 같은 특성들을 고려한 새로운 분산 상호 배제 알고리즘이 필요하다. 이제까지 이동 컴퓨팅 환경에서의 상호 배제 알고리즘은 토큰 링 구조에 기반을 두고 설계되었다. 토큰 링 구조는 이동 호스트들의 위치를 유지하기 위하여 높은 비용을 필요로 하는 단점을 가지고 있다. 본 논문에서는 균형 높이 트리(height-balanced tree)라는 새로운 모형을 제안함으로써 정적 분산 환경과 이동 분산 환경이 혼합된 환경에서 상호 배제 비용을 감소시킬 수 있는 새로운 알고리즘을 제안하며, 각 경우에 있어서의 비용을 산출하고 평가한다.Abstract The mobile host is a potable computer that carries out necessary functions and has the ability to access desirable informations without any constraints in time and space. Mobile computing environment is a distributed environment that is organized to support such mobile hosts. In that environment, distributed algorithms of which environment not only with static hosts but with mobile host's several properties should be proposed. With the emergence of mobile computing environments, a new distributed mutual exclusion method should be required to consider properties mobile computing system such as mobility, portability, and wireless communication. Until now, distributed mutual exclusion methods for mobile computing environments are designed based on a token ring structure, which have the drawbacks of requiring high costs in order to locate mobile hosts. In this paper, we propose a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a height-balanced tree for static distributed networks and for networks with mobile hosts. We evaluated the operation costs in each case.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.581-591
• /
• 2001

We consider some problems of remote file accesses of multiple clients in mobile computing environments. In this environment, user mobility affects file access latency. Mobile hosts have severe resource constraints in terms of limited size of non-volatile storage. Thus, the burden of computation and communication load raise file access latency. In this paper, we propose a scheme for reducing the file access latency through the file migration. The objective is to minimize of file accesses for all mobile hosts which delivering the file to clients as quickly as possible. We develope an on-demand scheme which determines when the file server should migrate files to another server, or when it should transfer files to mobile hosts. Using simulation, we examine the effects which parameters such as file access frequency, file size, mobility rate have on file system access latency. Through simulation results, we show that our proposed migration scheme is effective in reducing the access latency on the requested file of a mobile host with high access rate and low mobility.

• The Journal of the Korea Contents Association
• /
• v.19 no.7
• /
• pp.110-119
• /
• 2019

is a movie about the frustration and the despair of young people in Korean society today. It is different from the previous Lee Chang-dong's film in that it provides the main character's perception and feelings about the world as the ultimate cause of the protagonist's actions. Lee Chang-dong's characters begin to change from . The main character of Burning goes one step further. He seems to believe that the main character's only weapon to overcome the logic and constraints of reality is obsessive and compulsive behaviors. Unlike previous movies, the character in Burning is a person who practices awareness and proves his character through action. I will analyze characters in to suggest the change of film form. Especially I will look at how the character's actions and the writer's own voice can meet and what results it bring about in this movie. It will lead to his changes in film form and an idea on the young people in Korean society today.

• Journal of Information Science Theory and Practice
• /
• v.9 no.2
• /
• pp.66-82
• /
• 2021

Recommender Systems have gained immense popularity due to their capability of dealing with a massive amount of information in various domains. They are considered information filtering systems that make predictions or recommendations to users based on their interests and preferences. The more recent technology, Linked Open Data (LOD), has been introduced, and a vast amount of Resource Description Framework data have been published in freely accessible datasets. These datasets are connected to form the so-called LOD cloud. The need for semantic data representation has been identified as one of the next challenges in Recommender Systems. In a LOD-enabled recommendation framework where domain awareness plays a key role, the semantic information provided in the LOD can be exploited. However, dealing with a big chunk of the data from the LOD cloud and its integration with any domain datasets remains a challenge due to various issues, such as resource constraints and broken links. This paper presents the challenges of interconnecting and extracting the DBpedia data with the MovieLens 1 Million dataset. This study demonstrates how LOD can be a vital yet rich source of content knowledge that helps recommender systems address the issues of data sparsity and insufficient content analysis. Based on the challenges, we proposed a few alternatives and solutions to some of the challenges.