• Title/Summary/Keyword: Smooth 함수

Search Result 127, Processing Time 0.02 seconds

Performance comparison for automatic forecasting functions in R (R에서 자동화 예측 함수에 대한 성능 비교)

  • Oh, Jiu;Seong, Byeongchan
    • The Korean Journal of Applied Statistics
    • /
    • v.35 no.5
    • /
    • pp.645-655
    • /
    • 2022
  • In this paper, we investigate automatic functions for time series forecasting in R system and compare their performances. For the exponential smoothing models and ARIMA (autoregressive integrated moving average) models, we focus on the representative time series forecasting functions in R: forecast::ets(), forecast::auto.arima(), smooth::es() and smooth::auto.ssarima(). In order to compare their forecast performances, we use M3-Competiti on data consisting of 3,003 time series and adopt 3 accuracy measures. It is confirmed that each of the four automatic forecasting functions has strengths and weaknesses in the flexibility and convenience for time series modeling, forecasting accuracy, and execution time.

Optimization of Economic Load Dispatch Problem Using Linearly Approximated Smooth Fuel Cost Function (선형 근사 평활 발전 비용함수를 이용한 경제급전 문제의 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.191-198
    • /
    • 2014
  • This paper proposes a simple linear function approximation method to solve an economic load dispatch problem with complex non-smooth generating cost function. This algorithm approximates a non-smooth power cost function to a linear approximate function and subsequently shuts down a generator with the highest operating cost and reduces the power of generator with more generating cost in order to balance the generating power and demands. When applied to the most prevalent benchmark economic load dispatch cases, the proposed algorithm is found to dramatically reduce the power cost than does heuristic algorithm. Moreover, it has successfully obtained results similar to those obtained through a quadratic approximate function method.

Image segmentation Using Hybrid Level Set (하이브리드 레벨 셋을 이용한 이미지 분할)

  • Joo Ki-See;Kim Eun-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1453-1463
    • /
    • 2004
  • The conventional image segmentation method using level set has been disadvantage since level set function in the gradient-based model evolves depending on the local profile of the edge. In this paper, a new model is introduced by hybridizing level set formulation and complementary smooth function in order to smooth the driving force. We consider an alternative way of getting the complementary function(CF) which is much easier to simulate and makes sense for most cases having no triple junctions. The rule of thumb is that CF must be computed such that the difference between their average and the original CF function should be able to introduce a reliable driving force for the evolution of the level set function. This proposed hybrid method tries to minimize drawbacks the conventional level set method.

Saddlepoint Approximation to the Smooth Functions of Means Model (평균 벡터의 평활함수모형에 대한 안부점근사 -스튜던트화 분산을 중심으로-)

  • 나종화;김주성
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.2
    • /
    • pp.333-344
    • /
    • 2001
  • 통계적 추론에 사용되는 많은 통계량들은 평균벡터의 평활함수의 형태로 표현이 가능하다. 본 연구에서는 이들 통계량들의 분포함수에 대한 안부점근사법을 제시하였다. 이 방법은 Na(1998)에서 제시된 일반적 통계량의 분포함수에 대한 안부점근사법이 평균벡터의 평활함수모형에 특히 유용하게 사용될 수 있음을 보인 것이다. 이 근사법은 정규근사에 비해 근사의 정도가 뛰어나며, 특히 통계량의 꼬리부분의 확률에 대해서도 정확도가 그대로 유지되는 장점이 있어 정밀한 추론이 요구되는 많은 문제에 효과적으로 사용될 수 있다. 모의 실험에 사용할 평균벡터의 평활함수 모형으로는 스튜던트화 분산을 고려하였다.

  • PDF

Estimation of smooth monotone frontier function under stochastic frontier model (확률프런티어 모형하에서 단조증가하는 매끄러운 프런티어 함수 추정)

  • Yoon, Danbi;Noh, Hohsuk
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.5
    • /
    • pp.665-679
    • /
    • 2017
  • When measuring productive efficiency, often it is necessary to have knowledge of the production frontier function that shows the maximum possible output of production units as a function of inputs. Canonical parametric forms of the frontier function were initially considered under the framework of stochastic frontier model; however, several additional nonparametric methods have been developed over the last decade. Efforts have been recently made to impose shape constraints such as monotonicity and concavity on the non-parametric estimation of the frontier function; however, most existing methods along that direction suffer from unnecessary non-smooth points of the frontier function. In this paper, we propose methods to estimate the smooth frontier function with monotonicity for stochastic frontier models and investigate the effect of imposing a monotonicity constraint into the estimation of the frontier function and the finite dimensional parameters of the model. Simulation studies suggest that imposing the constraint provide better performance to estimate the frontier function, especially when the sample size is small or moderate. However, no apparent gain was observed concerning the estimation of the parameters of the error distribution regardless of sample size.

번들의 위상적 구조

  • 정영선;조용승
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.3
    • /
    • pp.671-686
    • /
    • 1994
  • 다양체 M은 매끈하고(smooth) 콤팩트(compact) n 차원 리만다양체이고, 실가함수 f는 M상에서 미분가능 함수임을 가정한다. Morse 함수는 임계점(critical point)들이 모두 비퇴화(non-degenerate)인 실가함수이다. 만약 함수 f가 Morse 함수이고, 임의의 점 $x \in M$에서 $\gamma_x$는 x를 통과하는 흐름(flow)이면 $$ (*) \frac{d\gamma_x(t)}{dt} + \bigtriangledown_{\gamma x(t)}(f) = 0 $$ 이다. 여기서 $\bigtriangledown(f)$는 함수 f에 의해서 정의되는 기울기 벡터장이고 초기조건 $\gamma_x(0) = x$ 이다.

  • PDF

Texture Mapping using Multiperiodic Function on the Smooth Genus N Object (Multiperiodic 함수를 이용한 Smooth Genus N 객체의 텍스쳐매핑)

  • Hwa Jin Park
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.94-104
    • /
    • 2002
  • This paper presents a new way of texture mapping on the Genus N object constructed over a single domain. The problem of 2D texture mapping is the discontinuity of texture domain at the virtual boundary on the object. Such phenomenon decreases smoothness of the object as well as looks unnatural. Especially it is necessary for the Genus N object of infinite coninuity to apply the seamless texture mapping. For seamless texture mapping, a multiperiodic function, which transforms a discontinuous function into a continuous function, is suggested. In some applications, however, the visual seams on the textured object provide more realistic appearance. Therefore, this research supports the interactive control from the discontinuity and the continuity across the boundary using the coefficient of the weight function.

  • PDF

Fuzzy Generalized Topological Spaces (퍼지 일반위상 공간에 관한 연구)

  • Min, Won-Keun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.3
    • /
    • pp.404-407
    • /
    • 2009
  • In this paper, we introduce the concept of fuzzy generalized topologies which are generalizations of smooth topologies and Chang's fuzzy topologies and obtain some basic properties of their structure. Also we introduce and study the concepts of fuzzy generalized continuity and weakly fuzzy generalized continuity.

Improvement of Edge Detection Using Mean Shift Algorithm (Mean Shift 알고리즘을 활용한 경계선 검출의 향상)

  • Shin, Seong-Yoon;Lee, Chang-Woo;Rhee, Yang-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.6
    • /
    • pp.59-64
    • /
    • 2009
  • Edge detection always influenced by the noise of original image, therefore need some methods to eliminate them in advance, and the Mean Shift algorithm has the smooth function which suit for this purpose, so adopt it to fade out the unimportant information and the sensitive noise portions. Above all, we use the Canny algorithm to pick up the contour of the objects we focus on. And, take tests and get better result than the former sole Canny algorithm. This combination method of Mean Shift algorithm and Canny algorithm is suitable for the edge detection processing.

A construction of a time-speed function in the time-distance function of students with chunky reasoning (덩어리 추론을 하는 학생의 시간-거리함수에서 시간-속력함수 구성에 대한 연구)

  • Lee, Donggun
    • The Mathematical Education
    • /
    • v.62 no.4
    • /
    • pp.473-490
    • /
    • 2023
  • Previous studies from domestic and abroad are accumulating information on how to reason students' continuous changes through teaching experiments. These studies deal with scenes in which students who make 'smooth reasoning' and 'chunky reasoning' construct mathematical results together in teaching experiments. However, in order to analyze their results in more detail, it is necessary to check what kind of results a student reasoning in a specific way constructs for the tasks of previous studies. According to the need for these studies, the researcher conducted a total of 14 teaching experiments on one first-year high school student who was found to make 'chunky reasoning'. In this study, it was possible to observe a scene in which a student who makes 'chunky reasoning' constructs an output similar to 'a mathematical result constructed by students with various reasoning methods(smooth reasnoning or chunky reasoning) in previous studies.' In particular, the student who participated in this study observed a consistent construction method of constructing the function of 'time-speed' from the function of 'time-distance'. The researcher expected that information on this student's distinctive construction methods would be helpful for subsequent studies.