• Title/Summary/Keyword: Selection Time

Search Result 3,471, Processing Time 0.031 seconds

Queuing Analysis of Opportunistic in Network Selection for Secondary Users in Cognitive Radio Systems

  • Tuan, Le Ahn;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.265-267
    • /
    • 2012
  • This paper analyzes network selection issues of secondary users (SUs) in Cooperative Cognitive Radio Networks (CRNs) by utilizing Queuing Model. Coordinating with Handover Cost-Based Network selection, this paper also addresses an opportunity for the secondary users (SUs) to enhance QoS as well as economics efficiency. In this paper, network selection of SUs is the optimal association between Overall System Time Minimization Problem evaluation of Secondary Connection (SC) and Handover Cost-Based Network selection. This will be illustrated by simulation results.

A Novel Statistical Feature Selection Approach for Text Categorization

  • Fattah, Mohamed Abdel
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1397-1409
    • /
    • 2017
  • For text categorization task, distinctive text features selection is important due to feature space high dimensionality. It is important to decrease the feature space dimension to decrease processing time and increase accuracy. In the current study, for text categorization task, we introduce a novel statistical feature selection approach. This approach measures the term distribution in all collection documents, the term distribution in a certain category and the term distribution in a certain class relative to other classes. The proposed method results show its superiority over the traditional feature selection methods.

Performance of Convolutionally-Coded MIMO Systems with Antenna Selection

  • Hamouda Walaa;Ghrayeb Ali
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.307-312
    • /
    • 2005
  • In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

An Application of the Clustering Threshold Gradient Descent Regularization Method for Selecting Genes in Predicting the Survival Time of Lung Carcinomas

  • Lee, Seung-Yeoun;Kim, Young-Chul
    • Genomics & Informatics
    • /
    • v.5 no.3
    • /
    • pp.95-101
    • /
    • 2007
  • In this paper, we consider the variable selection methods in the Cox model when a large number of gene expression levels are involved with survival time. Deciding which genes are associated with survival time has been a challenging problem because of the large number of genes and relatively small sample size (n<

Bayesian bi-level variable selection for genome-wide survival study

  • Eunjee Lee;Joseph G. Ibrahim;Hongtu Zhu
    • Genomics & Informatics
    • /
    • v.21 no.3
    • /
    • pp.28.1-28.13
    • /
    • 2023
  • Mild cognitive impairment (MCI) is a clinical syndrome characterized by the onset and evolution of cognitive impairments, often considered a transitional stage to Alzheimer's disease (AD). The genetic traits of MCI patients who experience a rapid progression to AD can enhance early diagnosis capabilities and facilitate drug discovery for AD. While a genome-wide association study (GWAS) is a standard tool for identifying single nucleotide polymorphisms (SNPs) related to a disease, it fails to detect SNPs with small effect sizes due to stringent control for multiple testing. Additionally, the method does not consider the group structures of SNPs, such as genes or linkage disequilibrium blocks, which can provide valuable insights into the genetic architecture. To address the limitations, we propose a Bayesian bi-level variable selection method that detects SNPs associated with time of conversion from MCI to AD. Our approach integrates group inclusion indicators into an accelerated failure time model to identify important SNP groups. Additionally, we employ data augmentation techniques to impute censored time values using a predictive posterior. We adapt Dirichlet-Laplace shrinkage priors to incorporate the group structure for SNP-level variable selection. In the simulation study, our method outperformed other competing methods regarding variable selection. The analysis of Alzheimer's Disease Neuroimaging Initiative (ADNI) data revealed several genes directly or indirectly related to AD, whereas a classical GWAS did not identify any significant SNPs.

PORTFOLIO SELECTION WITH HYPERBOLIC DISCOUNTING AND INFLATION RISK

  • Lim, Byung Hwa
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.169-180
    • /
    • 2021
  • This paper investigates the time-inconsistent agent's optimal consumption and investment problem under inflation risk. The agents' discount factor is governed by hyperbolic discounting, which has a random time to change. We impose the inflation risk which plays a crucial role in long-term financial planning. We derive the semi-analytic solution to the problem of sophisticated agents when the time horizon is finite.

Evaluating Variable Selection Techniques for Multivariate Linear Regression (다중선형회귀모형에서의 변수선택기법 평가)

  • Ryu, Nahyeon;Kim, Hyungseok;Kang, Pilsung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.5
    • /
    • pp.314-326
    • /
    • 2016
  • The purpose of variable selection techniques is to select a subset of relevant variables for a particular learning algorithm in order to improve the accuracy of prediction model and improve the efficiency of the model. We conduct an empirical analysis to evaluate and compare seven well-known variable selection techniques for multiple linear regression model, which is one of the most commonly used regression model in practice. The variable selection techniques we apply are forward selection, backward elimination, stepwise selection, genetic algorithm (GA), ridge regression, lasso (Least Absolute Shrinkage and Selection Operator) and elastic net. Based on the experiment with 49 regression data sets, it is found that GA resulted in the lowest error rates while lasso most significantly reduces the number of variables. In terms of computational efficiency, forward/backward elimination and lasso requires less time than the other techniques.

A Path Fragment Management Structure for Fast Projection Candidate Selection of the Path Prediction Algorithm (경로 예측 알고리즘의 빠른 투영 후보 선택을 위한 경로 단편 관리 구조)

  • Jeong, Dongwon;Lee, Sukhoon;Baik, Doo-Kwon
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.145-154
    • /
    • 2015
  • This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.

An Efficient Mode Selection Method for OFDM Based Multi-System Wireless Communication Systems (OFDM 기반 다중 무선 통신 환경에서의 효과적인 모드 선택 기법)

  • Park, Jong-Min;Kang, Min-Soo;Cho, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.19-25
    • /
    • 2008
  • When there are numerous wireless communication systems co-existing in the limited available frequency resource, an unexpected time delay can be caused during the system switching. So, in order to reduce this time delay, a mode selection method is required. In this paper, we propose a mode selection method to minimize the time delay for multi-system wireless communication systems. For the sake of efficiency, the mode selection method is designed by analyzing the preamble characteristics of different standards. Instead of performing a full search, we propose the preamble partial search to reduce the time delay to a minimum. Simulated with Matlab in an additive white Gaussian noise(AWGN) environment with a signal to noise ratio(SNR) of 10dB and bit error rate(BER) of $10^{-6}$, we evaluated and showed the performance improvement gained by using our proposed mode selection method.

Optimal Variable Selection in a Thermal Error Model for Real Time Error Compensation (실시간 오차 보정을 위한 열변형 오차 모델의 최적 변수 선택)

  • Hwang, Seok-Hyun;Lee, Jin-Hyeon;Yang, Seung-Han
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.3 s.96
    • /
    • pp.215-221
    • /
    • 1999
  • The object of the thermal error compensation system in machine tools is improving the accuracy of a machine tool through real time error compensation. The accuracy of the machine tool totally depends on the accuracy of thermal error model. A thermal error model can be obtained by appropriate combination of temperature variables. The proposed method for optimal variable selection in the thermal error model is based on correlation grouping and successive regression analysis. Collinearity matter is improved with the correlation grouping and the judgment function which minimizes residual mean square is used. The linear model is more robust against measurement noises than an engineering judgement model that includes the higher order terms of variables. The proposed method is more effective for the applications in real time error compensation because of the reduction in computational time, sufficient model accuracy, and the robustness.

  • PDF