• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.03 seconds

Sparse Index Multiple Access for Multi-Carrier Systems with Precoding

  • Choi, Jinho
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.439-445
    • /
    • 2016
  • In this paper, we consider subcarrier-index modulation (SIM) for precoded orthogonal frequency division multiplexing (OFDM) with a few activated subcarriers per user and its generalization to multi-carrier multiple access systems. The resulting multiple access is called sparse index multiple access (SIMA). SIMA can be considered as a combination of multi-carrier code division multiple access (MC-CDMA) and SIM. Thus, SIMA is able to exploit a path diversity gain by (random) spreading over multiple carriers as MC-CDMA. To detect multiple users' signals, a low-complexity detection method is proposed by exploiting the notion of compressive sensing (CS). The derived low-complexity detection method is based on the orthogonal matching pursuit (OMP) algorithm, which is one of greedy algorithms used to estimate sparse signals in CS. From simulation results, we can observe that SIMA can perform better than MC-CDMA when the ratio of the number of users to the number of multi-carrier is low.

An Adaption of Pattern Sequence-based Electricity Load Forecasting with Match Filtering

  • Chu, Fazheng;Jung, Sung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.5
    • /
    • pp.800-807
    • /
    • 2017
  • The Pattern Sequence-based Forecasting (PSF) is an approach to forecast the behavior of time series based on similar pattern sequences. The innovation of PSF method is to convert the load time series into a label sequence by clustering technique in order to lighten computational burden. However, it brings about a new problem in determining the number of clusters and it is subject to insufficient similar days occasionally. In this paper we proposed an adaption of the PSF method, which introduces a new clustering index to determine the number of clusters and imposes a threshold to solve the problem caused by insufficient similar days. Our experiments showed that the proposed method reduced the mean absolute percentage error (MAPE) about 15%, compared to the PSF method.

A rapid screening method for selection and modification of ground motions for time history analysis

  • Behnamfar, Farhad;Velni, Mehdi Talebi
    • Earthquakes and Structures
    • /
    • v.16 no.1
    • /
    • pp.29-39
    • /
    • 2019
  • A three-step screening process is presented in this article for selection of consistent earthquake records in which number of suitable ground motions is quickly screened and reduced to a handful number. Records that remain at the end of this screening process considerably reduce the dispersion of structural responses. Then, an effective method is presented for spectral matching and modification of the selected records. Dispersion of structural responses is explored using different statistical measures for each scaling procedure. It is shown that the Uniform Design Method, presented in this study for scaling of earthquake records, results in most cases in the least dispersion measure.

Automatic Extraction of Route Information from Road Sign Imagery

  • Youn, Junhee;Chong, Kyusoo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.6
    • /
    • pp.595-603
    • /
    • 2015
  • With the advances of the big-data process technology, acquiring the real-time information from the massive image data taken by a mobile device inside a vehicle will be possible in the near future. Among the information that can be found around the vehicle, the route information is needed for safe driving. In this study, the automatic extraction of route information from the road sign imagery was dealt with. The scope of the route information in this study included the route number, route type, and their relationship with the driving direction. For the recognition of the route number, the modified Tesseract OCR (Optical Character Recognition) engine was used after extracting the rectangular-road-sign area with the Freeman chain code tracing algorithm. The route types (expressway, highway, rural highway, and municipal road) are recognized using the proposed algorithms, which are acquired from colour space analysis. Those road signs provide information about the route number as well as the roads that may be encountered along the way. In this study, such information was called “OTW (on the way)” or “TTW (to the way)” which between the two should be indicated is determined using direction information. Finally, the route number is matched with the direction information. Experiments are carried out with the road sign imagery taken inside a car. As a result, route numbers, route number type, OTW or TTW are successfully recognized, however some errors occurred in the process of matching TTW number with the direction.

The Validity Test of Statistical Matching Simulation Using the Data of Korea Venture Firms and Korea Innovation Survey (벤처기업정밀실태조사와 한국기업혁신조사 데이터를 활용한 통계적 매칭의 타당성 검증)

  • An, Kyungmin;Lee, Young-Chan
    • Knowledge Management Research
    • /
    • v.24 no.1
    • /
    • pp.245-271
    • /
    • 2023
  • The change to the data economy requires a new analysis beyond ordinary research in the management field. Data matching refers to a technique or processing method that combines data sets collected from different samples with the same population. In this study, statistical matching was performed using random hotdeck and Mahalanobis distance functions using 2020 Survey of Korea Venture Firms and 2020 Korea Innovation Survey datas. Among the variables used for statistical matching simulation, the industry and the number of workers were set to be completely consistent, and region, business power, listed market, and sales were set as common variables. Simulation verification was confirmed by mean test and kernel density. As a result of the analysis, it was confirmed that statistical matching was appropriate because there was a difference in the average test, but a similar pattern was shown in the kernel density. This result attempted to expand the spectrum of the research method by experimenting with a data matching research methodology that has not been sufficiently attempted in the management field, and suggests implications in terms of data utilization and diversity.

NBR-Safe Transform: Lower-Dimensional Transformation of High-Dimensional MBRs in Similar Sequence Matching (MBR-Safe 변환 : 유사 시퀀스 매칭에서 고차원 MBR의 저차원 변환)

  • Moon, Yang-Sae
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.693-707
    • /
    • 2006
  • To improve performance using a multidimensional index in similar sequence matching, we transform a high-dimensional sequence to a low-dimensional sequence, and then construct a low-dimensional MBR that contains multiple transformed sequences. In this paper we propose a formal method that transforms a high-dimensional MBR itself to a low-dimensional MBR, and show that this method significantly reduces the number of lower-dimensional transformations. To achieve this goal, we first formally define the new notion of MBR-safe. We say that a transform is MBR-safe if a low-dimensional MBR to which a high-dimensional MBR is transformed by the transform contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. We then propose two MBR-safe transforms based on DFT and DCT, the most representative lower-dimensional transformations. For this, we prove the traditional DFT and DCT are not MBR-safe, and define new transforms, called mbrDFT and mbrDCT, by extending DFT and DCT, respectively. We also formally prove these mbrDFT and mbrDCT are MBR-safe. Moreover, we show that mbrDFT(or mbrDCT) is optimal among the DFT-based(or DCT-based) MBR-safe transforms that directly convert a high-dimensional MBR itself into a low-dimensional MBR. Analytical and experimental results show that the proposed mbrDFT and mbrDCT reduce the number of lower-dimensional transformations drastically, and improve performance significantly compared with the $na\"{\i}ve$ transforms. These results indicate that our MBR- safe transforms provides a useful framework for a variety of applications that require the lower-dimensional transformation of high-dimensional MBRs.

Evaluation of the Input Status of Exposure-related Information of Working Environment Monitoring Database and Special Health Examination Database for the Construction of a National Exposure Surveillance System (국가노출감시체계 구축을 위한 작업환경측정과 특수건강진단 자료의 노출 정보 입력 실태 평가)

  • Choi, Sangjun;Koh, Dong-Hee;Park, Ju-Hyun;Park, Donguk;Kim, Hwan-Cheol;Lim, Dae Sung;Sung, Yeji;Ko, Kyoung Yoon;Lim, Ji Seon;Seo, Hoekyeong
    • Journal of Korean Society of Occupational and Environmental Hygiene
    • /
    • v.32 no.3
    • /
    • pp.231-241
    • /
    • 2022
  • Objectives: The purpose of this study is to evaluate the input status of exposure-related information in the working environment monitoring database (WEMD) and special health examination database (SHED) for the construction of a national exposure surveillance system. Methods: The industrial and process code input status of WEMD and SHED for 21 carcinogens from 2014 to 2016 was compared. Data from workers who performed both work environment monitoring and special health examinations in 2019 and 2020 were extracted and the actual status of input of industrial and process codes was analyzed. We also investigated the cause of input errors through a focus group interview with 12 data input specialists. Results: As a result of analyzing WMED and SHED for 21 carcinogens, the five-digit industrial code matching rate was low at 53.5% and the process code matching rate was 19% or less. Among the data that simultaneously conducted work environment monitoring and special health examination in 2019 and 2020, the process code matching rate was very low at 18.1% and 5.2%, respectively. The main causes of exposure-related data input errors were the difference between the WEMD and SHED process code input systems from 2020, the number of standard process and job codes being too large, and the inefficiency of the standard code search system. Conclusions: In order to use WEMD and SHED as a national surveillance system, it is necessary to simplify the number of standard code input codes and improve the search system efficiency.

The Mobility Variation of OTFTs with the Number of TIPS-pentacene Droplets and Substrate Temperature in Ink Jet Printing (TIPS-pentacene의 잉크젯 인쇄공정에서 액적의 수와 기판 온도에 따른 OTFTs의 전계이동도 변화)

  • Kwon, Dong-Hoon;Park, Jin Seok;Song, Chung-Kun
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.26 no.6
    • /
    • pp.468-471
    • /
    • 2013
  • In this paper, we analyzed the effects of the number of TIPS-pentacene droplets and also the substrate temperature on the performance of OTFTs. As the number of the droplets increased, the mobility increased and reached the peak value and then reduced at the all temperatures. The peak mobility was $0.14{\pm}0.03cm^2/V{\cdot}sec$ at 3 droplets and $41^{\circ}C$, $0.19{\pm}0.02cm^2/V{\cdot}sec$ at 4 droplets and $46^{\circ}C$, and $0.35{\pm}0.10cm^2/V{\cdot}sec$ at 7 droplets and $51^{\circ}C$. The reason of existence of peak mobility can be found in matching the evaporation of solvent with the velocity of crystal formation. When two parameters were properly matched, the mobility produced the highest.

A Proof Method of Logic Programs in Parallel Environment (병렬화를 위한 논리 프로그램의 증명 방법)

  • 이원석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.3
    • /
    • pp.425-438
    • /
    • 1993
  • Due to the producer-consumer dependency of shared variables, the potential parallelism embeded in the logic programming language has not been fully examined. The method proposed in this paper eliminates the dependency of shared variables by introducing number-sequenced variables in expanding an AND-OR proof tree. Basically, the execution of a logic program can be divided into two phases : expanding an AND-OR tree and proving the tree by matching facts with leaf nodes. In the course of the first phase, a set of number-sequenced variables are produced by expanding an AND-OR tree in the breadth-first searching. Based on the information of number-sequence, each of them is verified in the second phase in order to prove the tree. Consequently, the proposed algorithm can explore more parallelism without the dependency of shared variables.

  • PDF

The Study on the Development of the Educational Contents for the Natural Number Binary System (자연수의 이진체계 교육자료 개발에 관한 연구)

  • Jang, Junghoon;Kim, Chongwoo
    • Journal of The Korean Association of Information Education
    • /
    • v.19 no.4
    • /
    • pp.525-532
    • /
    • 2015
  • Unplugged has been widely used as an instrument for teaching the basic principles of Computer Science. This study presents the teaching contents developed for the children without any knowledge of binary numbers. which successfully guided them to understand the natural number binary system. The level of the pre-lesson for this learning requires counting numbers, matching numbers with cards, and arranging numbers. The activity-based learning is provided for describing natural numbers with the binary system and finding out them in everyday life. To check the adequacy of these materials on their organization and assessment they were tested at the classroom, which showed effective about the knowledge, the attitude and the generalization.