• Smart Structures and Systems
• /
• v.6 no.3
• /
• pp.335-347
• /
• 2010

Recent advances in hardware and instrumentation technology have allowed the possibility of deploying very large sensor arrays on structures. Exploiting the huge amount of data that can result in order to perform vibration-based structural health monitoring (SHM) is not a trivial task and requires research into a number of specific problems. In terms of pressing problems of interest, this paper discusses: the design and optimisation of appropriate sensor networks, efficient data reduction techniques, efficient and automated feature extraction methods, reliable methods to deal with environmental and operational variability, efficient training of machine learning techniques and multi-scale approaches for dealing with very local damage. The paper is a result of the ESF-S3T Eurocores project "Smart Sensing For Structural Health Monitoring" (S3HM) in which a consortium of academic partners from across Europe are attempting to address issues in the design of automated vibration-based SHM systems for structures.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.71-79
• /
• 2013

Web server cluster systems are widely used, where a large number of PC level servers are interconnected via network. This paper focuses on forecasting an appropriate number of web servers which can serve four different classes of user requests, simple web page viewing, knowledge query, motion picture viewing and motion picture uploading. Two ways of serving different classes of web service requests are considered, commonly used web servers and service dedicated web servers. Computer simulation experiments are performed in order to find a good way of allocating web servers among different classes of web service requests, maintaining certain levels of resource utilization and response time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.450-456
• /
• 2006

Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Although MCL is capable of estimating the robot pose even for a completely unknown initial pose in the known environment, it takes considerable time to give an initial pose estimate because the number of random samples is usually very large especially for a large-scale environment. For practical implementation of MCL, therefore, a reduction in sample size is desirable. This paper presents a novel approach to reducing the number of samples used in the particle filter for efficient implementation of MCL. To this end, the topological information generated through the thinning technique, which is commonly used in image processing, is employed. The global topological map is first created from the given grid map for the environment. The robot then scans the local environment using a laser rangefinder and generates a local topological map. The robot then navigates only on this local topological edge, which is likely to be similar to the one obtained off-line from the given grid map. Random samples are drawn near the topological edge instead of being taken with uniform distribution all over the environment, since the robot traverses along the edge. Experimental results using the proposed method show that the number of samples can be reduced considerably, and the time required for robot pose estimation can also be substantially decreased without adverse effects on the performance of MCL.

• Journal of Information Processing Systems
• /
• v.18 no.3
• /
• pp.374-388
• /
• 2022

Database systems usually have many parameters that must be configured by database administrators and users. RocksDB achieves fast data writing performance using a log-structured merged tree. This database has many parameters associated with write and space amplifications. Write amplification degrades the database performance, and space amplification leads to an increased storage space owing to the storage of unwanted data. Previously, it was proven that significant performance improvements can be achieved by tuning the database parameters. However, tuning the multiple parameters of a database is a laborious task owing to the large number of potential configuration combinations. To address this problem, we selected the important parameters that affect the performance of RocksDB using random forest. We then analyzed the effects of the selected parameters on write and space amplifications using analysis of variance. We used a genetic algorithm to obtain optimized values of the major parameters. The experimental results indicate an insignificant reduction (-5.64%) in the execution time when using these optimized values; however, write amplification, space amplification, and data processing rates improved considerably by 20.65%, 54.50%, and 89.68%, respectively, as compared to the performance when using the default settings.

• Smart Structures and Systems
• /
• v.29 no.1
• /
• pp.53-62
• /
• 2022

The deployment of advanced structural health monitoring (SHM) systems in large-scale civil structures collects large amounts of data. Note that these data may contain multiple types of anomalies (e.g., missing, minor, outlier, etc.) caused by harsh environment, sensor faults, transfer omission and other factors. These anomalies seriously affect the evaluation of structural performance. Therefore, the effective analysis and mining of SHM data is an extremely important task. Inspired by the deep learning paradigm, this study develops a novel generative adversarial network (GAN) and convolutional neural network (CNN)-based data anomaly detection approach for SHM. The framework of the proposed approach includes three modules : (a) A three-channel input is established based on fast Fourier transform (FFT) and Gramian angular field (GAF) method; (b) A GANomaly is introduced and trained to extract features from normal samples alone for class-imbalanced problems; (c) Based on the output of GANomaly, a CNN is employed to distinguish the types of anomalies. In addition, a dataset-oriented method (i.e., multistage sampling) is adopted to obtain the optimal sampling ratios between all different samples. The proposed approach is tested with acceleration data from an SHM system of a long-span bridge. The results show that the proposed approach has a higher accuracy in detecting the multi-pattern anomalies of SHM data.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.924-942
• /
• 2005

Recently, large-scale directories have been developed for LINUX cluster file systems to store and retrieve huge amount of data. One of them, GFS directory, has attracted much attention because it is based on extendible hashing, one of dynamic hashing techniques, to support fast access to files. One distinctive feature of the GFS directory is the flat structure where all the leaf nodes are located at the same level of the tree. Hut one disadvantage of the mode structure is that the height of the mode tree has to be increased to make the tree flat after a byte is inserted to a full tree which cannot accommodate it. Thus, one byte addition makes the height of the whole mode tree grow, and each data block of the new tree needs one more link access than the old one. Another dynamic hashing technique which can be used for directories is linear hashing and a couple of researches have shown that it can get better performance at file access times than extendible hashing. [n this research, we have designed and implemented an extendible hashing directory and a linear hashing directory for large-scale LINUX cluster file systems and have compared performance between them. We have used the semi-flat structure which is known to have better access performance than the flat structure. According to the results of the performance evaluation, the linear hashing directory has shown slightly better performance at file inserts and accesses in most cases, whereas the extendible hashing directory is somewhat better at space utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.421-428
• /
• 2006

In this paper, the way of remote installation and back-up of 3-tier structure is introduced for efficient utilizing the cluster system resources distributed at several places. Recently, cluster system is constructed as the system of over hundreds nodes under complex network system mixed with public networks and private networks. Therefore, the as installation method suitable for the large scale cluster system and the remote recovery of failure nodes are important. However the previous researches which are based on 2-tier architecture may not provide the efficient cluster installation and image back-up method when the network of cluster system is composed of several private networks and public networks. In this paper, RISE (Remote Installation Service and Environment) based on the 3-tier architecture is proposed to solve this problem. In our approach, the managing node's role is divided into the global master node (GRISE) and the local master node (LRISE) to provide the efficient initial system deployment and remote failure recovery of distributed cluster system under the various network systems. Also, LRISE's availability is ensured under the complex network environments by adopting the auto-synchronization mechanism between GRISE and LRISE. In this work, a 64-node cluster system with gigabit network system is utilized for the experiment. From the experimental result, the system image with 1.86GB data can be obtained in 5 minutes and 53 seconds and the image-based installation of 64-node system can be carried out in 17 minutes and 53 seconds.

• Journal of Korean Society of Forest Science
• /
• v.108 no.4
• /
• pp.562-573
• /
• 2019

In a cable yarding system, a small-scale tower yarder attached to a farm tractor wasdeveloped and used for small-diameter tree harvesting operations. Based on this design, improvement of traction performance was required for medium- and large-diameter tree harvesting operations. In this study, the mechanical transmission employed for the tower yarder was modified into ahydro-mechanical transmission system. Maximum traction forces, including tractor engine speed and hydraulic power pressure, were investigated, and comparisons were made between the mechanical and hydro-mechanical transmission systems. Six tractor engine speeds (1,200, 1,400, 1,600, 1,800, 2,000, and 2,200) and three levels of power transmission mechanism pressure (4.9, 6.9, and 8.8 MPa) were investigated in the two different transmission systems. Results showed a maximum traction force of 15,146.6 N at an engine rotation speed of 757 rpm in the current mechanical transmission system, and 36,140.0 N at anengine rotation speed of 1,575 rpm in the modified hydro-mechanical transmission system. The maximum traction forces for the hydro-mechanical transmission were 2.4 times greater than those of the mechanical transmission, and may therefore be applicable to medium and large-diameter tree harvesting operations. Thus,as a modified version of the conventional transmission system, the new hydro-mechanical transmission system may be cost-effective for use in large-scale cable yarding operations. In the future, however, it will be necessary to investigate problems that may arise from field application tests.

• Journal of the Economic Geographical Society of Korea
• /
• v.7 no.1
• /
• pp.97-115
• /
• 2004

The purpose of this study is to investigate the spatial pattern of retail services and the consumer behaviors. For the purpose we select Jeju Island as the study area, because it retains relatively little distorted retail service systems by it's locational isolation. The retail service systems comprise three types: large-scale modern marts, conventional markets, and periodic markets. This study attempts to examine the interrelationships between these three different types, of retail services, and to figure out the spatial characteristics of consumer behaviors for each of them. We performed questionnaire surveys for getting the data of consumer behaviors. We applied several statistical methods to analyze the survey data. Most of retail services are located in two urban centers, Jeju City and Seoguipo City. We found that the locations of retail services are determined strongly by population size. The selection of market type and the location to go for shopping are related strongly with the types of goods. However, there is a wide difference in the consumer behaviors according to the consumer's socio-economic characteristics. Young wives tend to go shopping to large-scale marts in Jeju City which is the higher level central place, while old wives go shopping to conventional markets and periodic markets. They also show different shopping behaviors according to the household income levels. Low income groups prefer to go conventional markets located near to their residence, middle income groups go to large-scale marts in Jeju, and high income group go out of the Jeju Island. However, the consumer behavior does not show big difference according to the size of family. There are also no difference in the selection for shopping location according to the consumer's resident locations.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1359-1371
• /
• 1999

대규모 네트워크 상에서 동작하는 분산 시스템의 구현을 위해 제시된 방법 중의 하나인 이동 코드 개념은 네트워크 공유 자원에 접근할 수 있는 효과적인 방법을 제시하였고 이 개념을 지원하는 많은 언어들의 개발을 가져왔다. 개발된 언어들이 가지고 있는 이동 코드를 지원하기 위한 언어 구문과 적용하려는 문제 영역의 특성을 반영한 언어 구문은 네트워크 프로그래밍을 하는데 있어서 효율과 문제 중심의 프로그램의 두 가지를 모두 가능하게 하고 있다. 본 논문에서는 현재 분산 컴퓨팅 환경에서 가장 많이 사용되고 있는 클라이언트-서버 모델을 확장하여 서버의 자원에 접근할 수 있는 또 다른 방법을 가진 모델을 제시하고, 이 모델을 표현할 수 있는 언어를 설계하였다. 설계된 언어는 이동 코드의 개념을 지원함으로써 대규모 네트워크에서 수행되는 프로그램의 작성을 가능하게 하고, 분산 범위 규칙을 채택함으로써 이동 코드의 기술을 일반 함수를 기술하듯 명확한 관점에서 할 수 있도록 하였다. 또한 네트워크 관련 자원들을 언어 구문으로 채택하여 네트워크 프로그래밍을 언어 수준에서 할 수 있도록 하였다. 언어의 이론적인 설계에 그치지 않고 설계된 언어를 수행할 수 있는 실행 시간 지원 시스템을 구현하였다. 실행 시간 지원 시스템은 언어를 해석하고 실행하는 코드 해석기와 이동 코드를 지원하는 네트워크 감독으로 구성되며 설계된 언어를 사용하여 실제로 네트워크 응용 프로그램을 작성하고 테스트 해 볼 수 있다.Abstract Some studies bring up a concept of code mobility as an innovative way to access network resources in order to develop distributed systems working on a large scale network. After that, many languages are suggested to support this concept. In these languages, language constructors for their particular application domains and mobile codes provide both problem-oriented views to the programmer and reasonable performance to the system. In this thesis, we extend the client-server model that is the most popular model in developing distributed systems these days. We propose a model to have another method to access server's resources and extend the C language to implement the proposed model for the large scale network. The new language has capability to build a software working on a large scale network by supporting mobile code and gives a consistent network programming view to the programmer by adapting distributed semantics. The language also makes network programming easy by providing network primitives at the language level. We implement a prototype of run-time system to support this language. The run-time system is composed of two major parts: code-interpreter that interprets and executes the language and network-daemon that supports mobile codes.