• Title/Summary/Keyword: Candidate Selection

Search Result 501, Processing Time 0.023 seconds

A Study on Selecting Bitmap Join Index to Speed up Complex Queries in Relational Data Warehouses (관계형 데이터 웨어하우스의 복잡한 질의의 처리 효율 향상을 위한 비트맵 조인 인덱스 선택에 관한 연구)

  • An, Hyoung-Geun;Koh, Jae-Jin
    • The KIPS Transactions:PartD
    • /
    • v.19D no.1
    • /
    • pp.1-14
    • /
    • 2012
  • As the size of the data warehouse is large, the selection of indices on the data warehouse affects the efficiency of the query processing of the data warehouse. Indices induce the lower query processing cost, but they occupy the large storage areas and induce the index maintenance cost which are accompanied by database updates. The bitmap join indices are well applied when we optimize the star join queries which join a fact table and many dimension tables and the selection on dimension tables in data warehouses. Though the bitmap join indices with the binary representations induce the lower storage cost, the task to select the indexing attributes among the huge candidate attributes which are generated is difficult. The processes of index selection are to reduce the number of candidate attributes to be indexed and then select the indexing attributes. In this paper on bitmap join index selection problem we reduce the number of candidate attributes by the data mining techniques. Compared to the existing techniques which reduce the number of candidate attributes by the frequencies of attributes we consider the frequencies of attributes and the size of dimension tables and the size of the tuples of the dimension tables and the page size of disk. We use the mining of the frequent itemsets as mining techniques and reduce the great number of candidate attributes. We make the bitmap join indices which have the least costs and the least storage area adapted to storage constraints by using the cost functions applied to the bitmap join indices of the candidate attributes. We compare the existing techniques and ours and analyze them in order to evaluate the efficiencies of ours.

Derivation of Candidate Sites for a Tidal Current-Pumped Storage Hybrid Power Plant Using GIS-based Site Selection Analysis (GIS기반 적지분석을 통한 조류-양수 융합발전시스템 설치후보지 도출 연구)

  • LEE, Cholyoung;CHOI, Hyun-Woo;PARK, Jinsoon;KIM, Jihoon;PARK, Junseok
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.23 no.4
    • /
    • pp.184-207
    • /
    • 2020
  • This study aimed to determine candidate areas for tidal current-pumped storage hybrid power plants using GIS-based site selection analysis. The study area is the southwestern sea surrounding Jindo Island in South Korea. Factors to be considered for the site selection analysis were derived considering the design and installation characteristics of the hybrid power plant. Numerical simulation to predict tidal speed was performed using the MOHID(Modelo HIDrodin?mico) and the results were converted into spatial data. Subsequently, a GIS-based overlay analysis method proposed in this study was applied to derive the installation candidate area. A total of 10 regions were identified as candidate sites. Among them, it was determined that the power generator could be installed in relatively wide sea areas in Jindo, Seongnamdo, and Hajodo.

Opportunistic Multiple Relay Selection for Two-Way Relay Networks with Outdated Channel State Information

  • Lou, Sijia;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.389-405
    • /
    • 2014
  • Outdated Channel State Information (CSI) was proved to have negative effect on performance in two-way relay networks. The diversity order of widely used opportunistic relay selection (ORS) was degraded to unity in networks with outdated CSI. This paper proposed a multiple relay selection scheme for amplify-and-forward (AF) based two-way relay networks (TWRN) with outdated CSI. In this scheme, two sources exchange information through more than one relays. We firstly select N best relays out of all candidate relays with respect to signal-noise ratio (SNR). Then, the ratios of the SNRs on the rest of the candidate relays to that of the Nth highest SNR are tested against a normalized threshold ${\mu}{\in}[0,1]$, and only those relays passing this test are selected in addition to the N best relays. Expressions of outage probability, average bit error rate (BER) and ergodic channel capacity were obtained in closed-form for the proposed scheme. Numerical results and Simulations verified our theoretical analyses, and showed that the proposed scheme had significant gains comparing with conventional ORS.

Analysis of mixture experimental data with process variables (공정변수를 갖는 혼합물 실험 자료의 분석)

  • Lim, Yong-B.
    • Journal of Korean Society for Quality Management
    • /
    • v.40 no.3
    • /
    • pp.347-358
    • /
    • 2012
  • Purpose: Given the mixture components - process variables experimental data, we propose the strategy to find the proper combined model. Methods: Process variables are factors in an experiment that are not mixture components but could affect the blending properties of the mixture ingredients. For example, the effectiveness of an etching solution which is measured as an etch rate is not only a function of the proportions of the three acids that are combined to form the mixture, but also depends on the temperature of the solution and the agitation rate. Efficient designs for the mixture components - process variables experiments depend on the mixture components - process variables model which is called a combined model. We often use the product model between the canonical polynomial model for the mixture and process variables model as a combined model. Results: First we choose the reasonable starting models among the class of admissible product models and practical combined models suggested by Lim(2011) based on the model selection criteria and then, search for candidate models which are subset models of the starting model by the sequential variables selection method or all possible regressions procedure. Conclusion: Good candidate models are screened by the evaluation of model selection criteria and checking the residual plots for the validity of the model assumption. The strategy to find the proper combined model is illustrated with examples in this paper.

Location Selection of an LNG Bunkering Port in Korea

  • Lu, Wen;Seo, Jeong-Ho;Yeo, Gi-Tae
    • Journal of Korea Trade
    • /
    • v.23 no.2
    • /
    • pp.59-75
    • /
    • 2019
  • Purpose - The International Maritime Organization (IMO) has promulgated strict regulations on emissions in the maritime shipping industry. LNG (Liquefied Natural Gas) is, therefore, recognized as the optimal fuel alternative solution. The aim of this study is to select the most suitable location for an LNG bunkering port. This is formulated as a multiple-criteria ranking problem regarding four candidate ports in South Korea: the ports of Busan, Gwangyang, Incheon, and Ulsan. Design/Methodology/approach - An analysis employing the Consistent Fuzzy Preference Relation (CFPR) methodology is carried out, and the multiple-criteria evaluation of various factors influencing the location selection, such as the average loading speed of LNG, the number of total ships, the distance of the bunkering shuttle, and the degree of safety is performed. Then, based on the combination of both the collected real data and experts' preferences, the final ranking of the four ports is formulated. Findings - The port of Busan ranks first, followed by the ports of Gwangyang and Ulsan, with the port of Incheon last on the list. Originality/value - The Korean government could proceed with a clear vision of the candidate ports' ranking in terms of the LNG bunkering terminal selection problem.

A Political Economic Analysis of Decentralization: Fiscal Autonomy and Primary System (지방분권제도에 대한 정치경제학적 분석: 재정자치 및 국회의원경선제도)

  • Kim, Jaehoon
    • KDI Journal of Economic Policy
    • /
    • v.31 no.1
    • /
    • pp.27-69
    • /
    • 2009
  • This paper studies the logic of fiscal constraints and fiscal autonomy in a political agency model with both moral hazard and adverse selection. The electoral process not only disciplines incumbents who may act against the public interest but also opts in politicians who are most likely to act along voters' interests. We characterize perfect Bayesian equilibria under shared tax system and fiscal autonomy with fiscal constraints for local public good provision. It is shown that the local voters' expected welfare under fiscal autonomy is higher than under shared tax system if the same fiscal constraints are applied. In order to examine the effects of party's candidate selection processes on the behavior of local politician and national politician, we extend the model to an environment where local politician can compete for the candidacy of national assembly with incumbent national politician. If local politician wins majority of votes against incumbent national politician, then he can move on to serve as a national politician. Otherwise, his political career will end as a local politician. It is the gist of this primary system portrayed by this setup that local politician and national politician compete to garner more votes. Therefore, primary system as a candidate selection mechanism enhances local residents' welfare compared to top-down candidate selection processes.

  • PDF

Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks

  • Aung, Cherry Ye;Ali, G.G. Md. Nawaz;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5149-5173
    • /
    • 2016
  • Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

Prediction of Quantitative Traits Using Common Genetic Variants: Application to Body Mass Index

  • Bae, Sunghwan;Choi, Sungkyoung;Kim, Sung Min;Park, Taesung
    • Genomics & Informatics
    • /
    • v.14 no.4
    • /
    • pp.149-159
    • /
    • 2016
  • With the success of the genome-wide association studies (GWASs), many candidate loci for complex human diseases have been reported in the GWAS catalog. Recently, many disease prediction models based on penalized regression or statistical learning methods were proposed using candidate causal variants from significant single-nucleotide polymorphisms of GWASs. However, there have been only a few systematic studies comparing existing methods. In this study, we first constructed risk prediction models, such as stepwise linear regression (SLR), least absolute shrinkage and selection operator (LASSO), and Elastic-Net (EN), using a GWAS chip and GWAS catalog. We then compared the prediction accuracy by calculating the mean square error (MSE) value on data from the Korea Association Resource (KARE) with body mass index. Our results show that SLR provides a smaller MSE value than the other methods, while the numbers of selected variables in each model were similar.

An Improved key Frame Selection Algorithm Based on Histogram Difference Between Frames (프레임간 히스토그램 차이를 이용한 개선된 대표프레임 추출 알고리즘)

  • 정지현;전승철;박성한
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.137-140
    • /
    • 2000
  • In this paper, we propose as new algorithm for the selection of key frames in a given video. For the selected key frames to be well defined, the selected key frames need to spread out on the whole temporal domain of the given video and guaranteed not to be duplicate. For this purpose, we take the first frame of each shot of the video as the candidate key frame to represent the video. To reduce the overall processing time, we eliminate some candidate key frames which are visually indistinct in the histogram difference. The key frames are then selected using a clustering processing based on the singly linked hierarchical tree. To make the selected key frames be distributed evenly on the whole video, the deviation and time difference between the selected key frames are used. The simulation results demonstrate that our method provides the better performance compared with previous methods.

  • PDF

Improvement of Localization Accuracy with COAG Features and Candidate Selection based on Shape of Sensor Data (COAG 특징과 센서 데이터 형상 기반의 후보지 선정을 이용한 위치추정 정확도 향상)

  • Kim, Dong-Il;Song, Jae-Bok;Choi, Ji-Hoon
    • The Journal of Korea Robotics Society
    • /
    • v.9 no.2
    • /
    • pp.117-123
    • /
    • 2014
  • Localization is one of the essential tasks necessary to achieve autonomous navigation of a mobile robot. One such localization technique, Monte Carlo Localization (MCL) is often applied to a digital surface model. However, there are differences between range data from laser rangefinders and the data predicted using a map. In this study, commonly observed from air and ground (COAG) features and candidate selection based on the shape of sensor data are incorporated to improve localization accuracy. COAG features are used to classify points consistent with both the range sensor data and the predicted data, and the sample candidates are classified according to their shape constructed from sensor data. Comparisons of local tracking and global localization accuracy show the improved accuracy of the proposed method over conventional methods.