• Title/Summary/Keyword: 데이터 확장 기법

Search Result 827, Processing Time 0.028 seconds

A study on the estimation of rock mass classes using the information off a tunnel center line (터널 중심선으로부터 이격된 자료를 활용한 미시추구간의 암반등급 산정에 관한 연구)

  • You, Kwang-Ho;Lee, Sang-Ho;Choo, Suk-Yeon;Jue, Kwang-Sue
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.6 no.2
    • /
    • pp.101-111
    • /
    • 2004
  • In order to guarantee the stability of a tunnel and its optimum design, it is very important to obtain enough ground investigation data. In realty, however, it is not the case due to the limitation of measuring spatially distributed data and economical reasons. Especially, there are regions where drilling is impossible due to civil appeal and mountainous topology, and it is also difficult to estimate rock mass classes quantitatively with only geophysical exploration data. In this study, therefore, 3 dimensional multiple indicator kriging (3D-MI kriging), which can incorporate geophysical exploration data and drill core data off a tunnel center line, is proposed to cope with such problems. To this end, two dimensional mutiple indicator kriging, which is one of the geostatistical techniques, is extended for three dimensional analysis. Also, the proposed 3D-MI kriging was applied to determine the rock mass classes by RMR system for the design of a Kyungbu express rail way tunnel.

  • PDF

Cyclic Prefix Reconstruction and Equalization for EST based Modulation (EST기반 변조에서 Cyclic Prefix 복원 및 등화기법)

  • Kwun, Soon-Ik;Kwon, Byung-Uk;Hwang, Tea-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.835-843
    • /
    • 2010
  • Energy spreading transform (EST) based equalization is a very effective technique to remove inter symbol interference (ISI) in frequency selective channel. EST based system uses cyclic prefix (CP) similar to orthogonal frequency division multiplexing (OFDM) system. Since CP is a redundancy, it degrades the data transmission rate. RISIC is an algorithm that removes an inter block interference (IBI) caused by insufficient CP length and reconstructs CP. In this paper, we propose a system that combines the existing EST system with quadrature phase shift keying (QPSK) modulation and RISIC algorithm to enhance the efficiency of the transmission. Also we extend the proposed system to 16 quadrature amplitude modulation (QAM) modulation. The proposed system is shown to performance close to matched filter bound (MFB) even with insufficient CP.

Fuzzy Minimum Interval Partition for Uncertain Time Interval (불확실한 시간 간격을 위한 퍼지 최소 간격 분할 기법)

  • Heo, Mun-Haeng;Lee, Gwang-Gyu;Lee, Jun-Uk;Ryu, Geun-Ho;Kim, Hong-Gi
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.571-578
    • /
    • 2002
  • In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

Discovery of Frequent Sequence Pattern in Moving Object Databases (이동 객체 데이터베이스에서 빈발 시퀀스 패턴 탐색)

  • Vu, Thi Hong Nhan;Lee, Bum-Ju;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.179-186
    • /
    • 2008
  • The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.

Research on the Analysis of Maritime Traffic Pattern using Centroid Method (중심점 기법을 이용한 통항패턴 분석에 관한 연구)

  • Kim, Hye-Jin;Oh, Jae-Yong
    • Journal of Navigation and Port Research
    • /
    • v.42 no.6
    • /
    • pp.453-458
    • /
    • 2018
  • The analysis of maritime traffic refers to the processes that are used to analyze the environmental characteristics of the target area and, based on this analysis, predict the traffic pattern of the vessels. In recent years, maritime traffic analysis has become significant with increase maritime traffic volume and expansion of VTS coverage area. In addition, maritime traffic analysis is also applicable in the safety assessment of port facilities and the VTS (Vessel Traffic Service). In this paper, we propose a method to analyze the vessels' traffic pattern by using the heat map and the centroid method. This method is efficient for the analysis of the vessel trajectory data where spatial characteristics change with time. In the experiments, the traffic density and centroid by time have were analyzed. Trajectory data collected at Mokpo harbor was adopted. Finally, we reviewed the experimental results to verify the feasibility of the proposed method as a maritime traffic analysis method.

Definition of Relational Operators for Effective Extracting Data Mining Information from Relational Relational Database (관계형 데이터베이스에서 효과적 데이터 마이닝 정보 추출을 위한 관계 연산자의 정의)

  • 송지영
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.2
    • /
    • pp.123-130
    • /
    • 2001
  • As the growth of database volume, it has required a need and an opportunity of data analysis and extracting knowledge from database. Data mining method is the representative example. The size of most minable data set is huge, and stored in a database. To implement effective mining function, we must extract minable data set to be analyzed from existing relational database, and it must be managed with its generalized information. In this paper, the new mining operator is defined in a similar manner to the existing SQL operators and SQL is extended to extract data subset from relations and to generalize it using domain-oriented method. The background knowledge includes attribute values, which will be mind and generalized information, and it is managed as the same structure with a relation in relational database. These functions are implemented by defining some SQL - like operators and aggregated functions, and we describe the expressive powers of these new operators and functions through examples.

  • PDF

Design of Customized Research Information Service Based on Prescriptive Analytics (처방적 분석 기반의 연구자 맞춤형 연구정보 서비스 설계)

  • Lee, Jeong-Won;Oh, Yong-Sun
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.3
    • /
    • pp.69-74
    • /
    • 2022
  • Big data related analysis techniques, the prescriptive analytics methodology improves the performance of passive learning models by ensuring that active learning secures high-quality learning data. Prescriptive analytics is a performance maximizing process by enhancing the machine learning models and optimizing systems through active learning to secure high-quality learning data. It is the best subscription value analysis that constructs the expensive category data efficiently. To expand the value of data by collecting research field, research propensity, and research activity information, customized researcher through prescriptive analysis such as predicting the situation at the time of execution after data pre-processing, deriving viable alternatives, and examining the validity of alternatives according to changes in the situation Provides research information service.

Discovering Interdisciplinary Convergence Technologies Using Content Analysis Technique Based on Topic Modeling (토픽 모델링 기반 내용 분석을 통한 학제 간 융합기술 도출 방법)

  • Jeong, Do-Heon;Joo, Hwang-Soo
    • Journal of the Korean Society for information Management
    • /
    • v.35 no.3
    • /
    • pp.77-100
    • /
    • 2018
  • The objectives of this study is to present a discovering process of interdisciplinary convergence technology using text mining of big data. For the convergence research of biotechnology(BT) and information communications technology (ICT), the following processes were performed. (1) Collecting sufficient meta data of research articles based on BT terminology list. (2) Generating intellectual structure of emerging technologies by using a Pathfinder network scaling algorithm. (3) Analyzing contents with topic modeling. Next three steps were also used to derive items of BT-ICT convergence technology. (4) Expanding BT terminology list into superior concepts of technology to obtain ICT-related information from BT. (5) Automatically collecting meta data of research articles of two fields by using OpenAPI service. (6) Analyzing contents of BT-ICT topic models. Our study proclaims the following findings. Firstly, terminology list can be an important knowledge base for discovering convergence technologies. Secondly, the analysis of a large quantity of literature requires text mining that facilitates the analysis by reducing the dimension of the data. The methodology we suggest here to process and analyze data is efficient to discover technologies with high possibility of interdisciplinary convergence.

An Adaptive Cell Selection Scheme for Ultra Dense Heterogeneous Mobile Communication Networks (초밀집 이종 이동 통신망을 위한 적응형 셀 선택 기법)

  • Jo, Jung-Yeon;Ban, Tae-Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1307-1312
    • /
    • 2015
  • As smart-phones become popular, mobile data traffic has been dramatically increasing and intensive researches on the next-generation mobile communication network is in progress to meet the increasing demand for mobile data traffic. In particular, heterogeneous network (HetNet) is attracting much interest because it can significantly enhance the network capacity by increasing the spatial reuse with macro and small cells. In the HetNet, we have several problems such as load imbalance and interference because of the difference in transmit power between macro and small cells and cell range expansion (CRE) can mitigate the problems. In this paper, we propose a new cell selection scheme with adaptive cell range expansion bias (CREB) for ultra dense HetNet and we analyze the performance of the proposed scheme in terms of average cell transmission rate through system-level simulations and compare it with those of other schemes.

Dynamic Buffer Partitioning Technique for Efficient Continuous Media Service in VOD Servers (VOD 서버에서 효율적인 연속미디어 서비스를 위한 동적 버퍼 분할 기법)

  • Kwon, Chun-Ja;Choi, Chang-Yeol;Choi, Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.137-146
    • /
    • 2002
  • In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.