• Title/Summary/Keyword: Selection Time

Search Result 3,498, Processing Time 0.051 seconds

Penalized variable selection in mean-variance accelerated failure time models (평균-분산 가속화 실패시간 모형에서 벌점화 변수선택)

  • Kwon, Ji Hoon;Ha, Il Do
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.3
    • /
    • pp.411-425
    • /
    • 2021
  • Accelerated failure time (AFT) model represents a linear relationship between the log-survival time and covariates. We are interested in the inference of covariate's effect affecting the variation of survival times in the AFT model. Thus, we need to model the variance as well as the mean of survival times. We call the resulting model mean and variance AFT (MV-AFT) model. In this paper, we propose a variable selection procedure of regression parameters of mean and variance in MV-AFT model using penalized likelihood function. For the variable selection, we study four penalty functions, i.e. least absolute shrinkage and selection operator (LASSO), adaptive lasso (ALASSO), smoothly clipped absolute deviation (SCAD) and hierarchical likelihood (HL). With this procedure we can select important covariates and estimate the regression parameters at the same time. The performance of the proposed method is evaluated using simulation studies. The proposed method is illustrated with a clinical example dataset.

A Comprehensive Study on the Meal Intake Behavior according to Ramyun's Selection Attributes for Korean Adults (성인의 시판 라면류 선택 속성에 따른 식사 행동 차이에 대한 탐색적 고찰)

  • Jung, Hyo Sun;Yu, Kyung Jin;Yoon, Hye Hyun
    • Journal of the East Asian Society of Dietary Life
    • /
    • v.22 no.6
    • /
    • pp.895-902
    • /
    • 2012
  • This study was conducted to understand the Ramyun's selection attributes of Korean adults and examine differences in demographic characteristics and meal intake behavior among three groups of samples divided based on the Ramyun's selection attributes. Self-administered questionnaires were completed by 702 adults, and data were subjected to frequency analysis, chi-square analysis, factor analysis, reliability tests, cluster analysis, and discriminant analysis using SPSS. The results of the study were as follows. The Ramyun's selection attributes for Korean adults investigated were food quality (four variables), price (three variables), and company reliability (four variables). Cluster analysis resulted in the subjects being divided into three groups according to their Ramyun's selection attributes, a high-selection group, mid-selection group, and low-selection group. Three groups of samples classified by Ramyun's selection attributes differed based on demographic characteristics (gender and education level) and meal intake behavior (meal numbers, reason for meal, meal time, and meal size).

AGV travel time estimation for an AGV-based transport system (AGV기반 운반체계에서의 차량이동시간에 관한 연구)

  • 구평회;장재진
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.5-8
    • /
    • 2000
  • Vehicle travel time (empty travel time pius loaded travel time) is a key parameter for designing AGV-based material handling systems. Especially, the determination of empty vehicle travel time is difficult because of the stochastic nature of the empty vehicle locations. This paper presents a method to estimate vehicle travel times for AGV-based material transport systems. The model considers probabilistic aspects for the travel time and vehicle location under random vehicle selection rule and nearest vehicle selection rule. The estimation of empty travel time is of major effort. Simulation experiments are used to verify the proposed travel time model, and the simulation results show that the presented model provides reasonable travel time estimations.

  • PDF

Design and Implementation of a Grid System META for Executing CFD Analysis Programs on Distributed Environment (분산 환경에서 CFD 분석 프로그램 수행을 위한 그리드 시스템 META 설계 및 구현)

  • Kang, Kyung-Woo;Woo, Gyun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.533-540
    • /
    • 2006
  • This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.2
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

Optimal Voltage Vector Selection Method for Torque Ripple Reduction in the Direct Torque Control of Five-phase Induction Motors

  • Kang, Seong-Yun;Shin, Hye Ung;Park, Sung-Min;Lee, Kyo-Beum
    • Journal of Power Electronics
    • /
    • v.17 no.5
    • /
    • pp.1203-1210
    • /
    • 2017
  • This paper presents an improved switching selection method for the direct torque control (DTC) of five-phase induction motors (IMs). The proposed method is conducted using optimal switching selection. A five-phase inverter has 32 voltage vectors which are divided into 30 nonzero voltage vectors and two zero voltage vectors. The magnitudes of the voltage vectors consist of large, medium, and small voltage vectors. In addition, these vectors are related to the torque response and torque ripple. When a large voltage vector is selected in a drive system, the torque response time decreases with an increased torque ripple. On the other hand, when a small voltage vector is selected, the torque response time and torque ripple increase. As a result, this paper proposes an optimal voltage vector selection method for improved DTC of a five-phase induction machine depending on the situation. Simulation and experimental results verify the effectiveness of the proposed control algorithm.

Radial Scanning Technique for 31P MR Spectroscopy In Vivo (생체내에서 인의 핵자기공명 분광분석을 위한 방사형 주사기법)

  • Rim, C.Y.;Chun, K.W.;Ra, J.B.;Cho, Z.H.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1990 no.05
    • /
    • pp.39-42
    • /
    • 1990
  • In recent years, several volume selection techniques have been tried to obtain 31P MR spectroscopy in vivo. Most volume selection techniques, however, suffer from T2 decay in VOI due to the relatively long selection time. In this paper, we propose a new localized 3-D volume selection technique which is specially suitable for 31P spectroscopy. The proposed technique, which uses the radial scans in the k-space, minimizes T2 decay during the selection time and also provides good volume selectivity.

  • PDF

A Study on Effective Satellite Selection Method for Multi-Constellation GNSS

  • Taek Geun, Lee;Yu Dam, Lee;Hyung Keun, Lee
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.1
    • /
    • pp.11-22
    • /
    • 2023
  • In this paper, we propose an efficient satellite selection method for multi-constellation GNSS. The number of visible satellites has increased dramatically recently due to multi-constellation GNSS. By the increased availability, the overall GNSS performance can be improved. Whereas, due to the increase of the number of visible satellites, the computational burden in implementing advanced processing such as integer ambiguity resolution and fault detection can be increased considerably. As widely known, the optimal satellite selection method requires very large computational burden and its real-time implementation is practically impossible. To reduce computational burden, several sub-optimal but efficient satellite selection methods have been proposed recently. However, these methods are prone to the local optimum problem and do not fully utilize the information redundancy between different constellation systems. To solve this problem, the proposed method utilizes the inter-system biases and geometric assignments. As a result, the proposed method can be implemented in real-time, avoids the local optimum problem, and does not exclude any single-satellite constellation. The performance of the proposed method is compared with the optimal method and two popular sub-optimal methods by a simulation and an experiment.

Analysis on Tower Crane Selection in Precast Concretes Structures and its Connection with Precast Rate

  • Guo, Jingjing;Fu, Yan;Wang, Kang;Peng, Zhenyu
    • International conference on construction engineering and project management
    • /
    • 2017.10a
    • /
    • pp.192-200
    • /
    • 2017
  • With the acceleration of construction industrialization, the buildings that China has adopted the construction of industrialization technology are increasing day by day, and Precast Concrete (PC) Structure technology is one of the main technologies of construction industrialization. Compared with the traditional cast-in-place concrete structure, PC structure is more conducive to shorten the construction period, reduce the number of construction workers and the site construction waste. Nevertheless, PC structure improves the requirements of hoisting machinery in the construction site, and the lay-out and selection of hoisting machinery become an important factor influencing the construction cost. The paper regards the typical tower crane in China as the research object, and establishes the time optimization model for the lifting scheme. The influence of the different precast rate on the selection of the tower crane is analyzed. This paper obtains the time variation of the tower crane under different precast rate, provides a theoretical basis for the design of precast concrete structures under the influence of assembly construction, and lays the foundation for the selection of tower crane under the precast rate.

  • PDF

Evolutionary Computation for the Real-Time Adaptive Learning Control(I) (실시간 적응 학습 제어를 위한 진화연산(I))

  • Chang, Sung-Ouk;Lee, Jin-Kul
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.724-729
    • /
    • 2001
  • This paper discusses the composition of the theory of reinforcement learning, which is applied in real-time learning, and evolutionary strategy, which proves its the superiority in the finding of the optimal solution at the off-line learning method. The individuals are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because the learning process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes. In the future, studies are needed on the proof of the theory through experiments and the characteristic considerations of the robustness against the outside disturbances.

  • PDF