• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2824-2837
• /
• 2019

Container technologies are widely used in infrastructures to deploy and manage applications in cloud computing environment. As containers are light-weight software, the cluster of cloud applications can easily scale up or down to provide Internet-based services. Container-based applications can well deal with fluctuate workloads by dynamically adjusting physical resources. Current works of scheduling applications often construct applications' performance models with collected historical training data, but these works with static models cannot self-adjust physical resources to meet the dynamic requirements of cloud computing. Thus, we propose a self-adaptive automatic container scheduling framework AutoScale for cloud applications, which uses a feedback-based approach to adjust physical resources by extending, contracting and migrating containers. First, a queue-based performance model for cloud applications is proposed to correlate performance and workloads. Second, a fuzzy Kalman filter is used to adjust the performance model's parameters to accurately predict applications' response time. Third, extension, contraction and migration strategies based on predicted response time are designed to schedule containers at runtime. Furthermore, we have implemented a framework AutoScale with container scheduling strategies. By comparing with current approaches in an experiment environment deployed with typical applications, we observe that AutoScale has advantages in predicting response time, and scheduling containers to guarantee that response time keeps stable in fluctuant workloads.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2007년도 추계 국제학술대회
• /
• pp.138-138
• /
• 2007

• Journal of Electrical Engineering and Technology
• /
• 제9권3호
• /
• pp.873-881
• /
• 2014

Speed sensorless modes of operation are becoming standard solution in the area of electric drives. This paper presents flux estimator and speed estimator for the speed sensorless vector control of induction motors. The proposed sensorless methods are based on the model reference adaptive system (MRAS) observer and adaptive speed observer (ASO). The proposed speed estimation algorithm can be employed in the power control of grid connected induction generator for wind power applications. Two proposed schemes are verified through computer simulation PSIM and compared their simulation results.

• Interaction and multiscale mechanics
• /
• 제6권2호
• /
• pp.137-156
• /
• 2013

In this paper, a meshfree shell adaptive procedure is developed for the applications in the sheet metal forming simulation. The meshfree shell formulation is based on the first-order shear deformable shell theory and utilizes the degenerated continuum and updated Lagrangian approach for the nonlinear analysis. For the sheet metal forming simulation, an h-type adaptivity based on the meshfree background cells is considered and a geometric error indicator is adopted. The enriched nodes in adaptivity are added to the centroids of the adaptive cells and their shape functions are computed using a first-order generalized meshfree (GMF) convex approximation. The GMF convex approximation provides a smooth and non-negative shape function that vanishes at the boundary, thus the enriched nodes have no influence outside the adapted cells and only the shape functions within the adaptive cells need to be re-computed. Based on this concept, a multi-level refinement procedure is developed which does not require the constraint equations to enforce the compatibility. With this approach the adaptive solution maintains the order of meshfree approximation with least computational cost. Two numerical examples are presented to demonstrate the performance of the proposed method in the adaptive shell analysis.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1346-1349
• /
• 1993

In this paper, we describe the use of certain optimization techniques, principally dynamic programming and high level computational methods, to enhance the capabilities of a fuzzy adaptive neural network controller which we had developed for on-line control and adaption on complex nonlinear processes. Potential applications to an array of processes from diverse fields are discussed.

• Communications for Statistical Applications and Methods
• /
• 제14권1호
• /
• pp.57-69
• /
• 2007

Adaptive cluster sampling design is known as a sampling method for rare clustered population. Three modified adaptive cluster sampling designs are proposed. The adjusted Hansen-Hurwitz estimator and the Horvitz-Thompson estimator are considered. Efficiency issue of the proposed sampling designs is discussed in a Monte-Carlo simulation study.

• 한국기계가공학회지
• /
• 제9권5호
• /
• pp.50-56
• /
• 2010

Meshfree methods show many advantages over finite element method(FEM) in the class of problems for which the remeshing process is inevitable when the conventional FEM used, such as propagating crack problems, large deformation and so on. One of the promising applications of meshfree methods is the adaptive refinement for problems having multi-scale nature. In this study, an adaptive node generation procedure is proposed and several numerical examples are also presented to illustrate the efficiency of proposed method.

• East Asian mathematical journal
• /
• 제33권4호
• /
• pp.413-429
• /
• 2017

This study is a basic study for developing a mathematical learning application program that can be used in smart devices for adaptive learning. We selected 20 mathematical learning applications including middle school contents and analyzed learning types. And we analyzed the contents and the learning process. As a result, most learning types of mathematics learning applications were problem-centered. Contents analysis results showed that the most applications have achievement goals. The factors that induce interest in learning were lacking and feedback was not provided sufficiently. Analysis of the learning process showed that most of the math learning applications were classified according to their purpose and characteristics.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.243-246
• /
• 2005

Recent ubiquitous computing environments increasingly impact on our lives using the current technologies of sensor network and ubiquitous services. In this paper, we propose ubiquitous architectural framework for ubiquitous sleep aid service(UbiSAS) in the subset of ubiquitous computing for refreshing of human's sleep. And we examine technical feasibility. Human can recover his health through refreshing sleep from fatigue. Ubiquitous architectural framework for UbiSAS in digital home offers agreeable sleeping environment and improves recovery from fatigue. So we present new concept of ubiquitous architectural framework dissolving stress. Specially, we apply context to context-aware framework module. This context is transferred to context adaptive inference engine which has service invocation function in intelligent agent module. Ubiquitous architectural framework for UbiSAS using context adaptive rule inference engine without user intervention is technical issue. That is to say, we should take sleep comfortably during our sleeping. And sensed information during sleeping is changed to context-aware information. This presents significant information in context adaptive rule inference engine for UbiSAS. This information includes all sleeping state during sleeping in context-aware computing technique. So we propose more effective and most suitable ubiquitous architectural framework using context adaptive rule inference engine for refreshing sleep in this paper.

• Communications for Statistical Applications and Methods
• /
• 제16권3호
• /
• pp.479-485
• /
• 2009

When a part of data is unobserved the marginal likelihood of parameters given the observed data often involves analytically intractable high dimensional integral and hence it is hard to find the maximum likelihood estimate of the parameters. Simulated maximum likelihood(SML) method which estimates the marginal likelihood via Monte Carlo importance sampling and optimize the estimated marginal likelihood has been used in many applications. A key issue in SML is to find a good proposal density from which Monte Carlo samples are generated. The optimal proposal density is the conditional density of the unobserved data given the parameters and the observed data, and attempts have been given to find a good approximation to the optimal proposal density. Algorithms which adaptively improve the proposal density have been widely used due to its simplicity and efficiency. In this paper, we describe a fully adaptive algorithm which has been used by some practitioners but has not been well recognized in statistical literature, and evaluate its estimation performance and robustness via a simulation study. The simulation study shows a great improvement in the order of magnitudes in the mean squared error, compared to non-adaptive or partially adaptive SML methods. Also, it is shown that the fully adaptive SML is robust in a sense that it is insensitive to the starting points in the optimization routine.