• Title/Summary/Keyword: iPROVE

Search Result 818, Processing Time 0.028 seconds

The Cluster Damage in a $extsc{k}th-Order$ Stationary Markov Chain

  • Yun, Seokhoon
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.2
    • /
    • pp.235-251
    • /
    • 1999
  • In this paper we examine extremal behavior of a $textsc{k}$th-order stationary Markov chain {X\ulcorner} by considering excesses over a high level which typically appear in clusters. Excesses over a high level within a cluster define a cluster damage, i.e., a normalized sum of all excesses within a cluster, and all excesses define a damage point process. Under some distributional assumptions for {X\ulcorner}, we prove convergence in distribution of the cluster damage and obtain a representation for the limiting cluster damage distribution which is well suited for simulation. We also derive formulas for the mean and the variance of the limiting cluster damage distribution. These results guarantee a compound Poisson limit for the damage point process, provided that it is strongly mixing.

  • PDF

STRONG CONVERGENCE OF HYBRID ITERATIVE SCHEMES WITH ERRORS FOR EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS

  • Kim, Seung-Hyun;Kang, Mee-Kwang
    • The Pure and Applied Mathematics
    • /
    • v.25 no.2
    • /
    • pp.149-160
    • /
    • 2018
  • In this paper, we prove a strong convergence result under an iterative scheme for N finite asymptotically $k_i-strictly$ pseudo-contractive mappings and a firmly nonexpansive mappings $S_r$. Then, we modify this algorithm to obtain a strong convergence result by hybrid methods. Our results extend and unify the corresponding ones in [1, 2, 3, 8]. In particular, some necessary and sufficient conditions for strong convergence under Algorithm 1.1 are obtained.

SPECTRAL PROPERTIES OF k-QUASI-2-ISOMETRIC OPERATORS

  • SHEN, JUNKI;ZUO, FEI
    • The Pure and Applied Mathematics
    • /
    • v.22 no.3
    • /
    • pp.275-283
    • /
    • 2015
  • Let T be a bounded linear operator on a complex Hilbert space H. For a positive integer k, an operator T is said to be a k-quasi-2-isometric operator if T∗k(T∗2T2 − 2TT + I)Tk = 0, which is a generalization of 2-isometric operator. In this paper, we consider basic structural properties of k-quasi-2-isometric operators. Moreover, we give some examples of k-quasi-2-isometric operators. Finally, we prove that generalized Weyl’s theorem holds for polynomially k-quasi-2-isometric operators.

Study of Comparative Lyrics for Joy and Sad Emotions in Korean Popular Songs (한국대중가요에서의 기쁨과 슬픈 감성을 위한 가사 비교 연구)

  • Kwon, Ji-Yeon;Lee, Seungyon-Seny
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.3
    • /
    • pp.68-77
    • /
    • 2015
  • As popular music grows, lyrics are taking a more important part of the pop music. In the thesis suggests that to prove that each can I maximize based on the lyrics' emotions, the study compares between a sense of cheerful and sad songs. For this reason, many emotional words were extracted by various word expressions in the cheerful songs and limited expressions of grief sensibilities were shown through relatively small amount of emotional words in the sorrowful songs.

Investigation on Dynamic Behavior of Formant Information (포만트 정보의 동적 변화특성 조사에 관한 연구)

  • Jo, Cheolwoo
    • Phonetics and Speech Sciences
    • /
    • v.7 no.2
    • /
    • pp.157-162
    • /
    • 2015
  • This study reports on the effective way of displaying dynamic formant information on F1-F2 space. Conventional ways of F1-F2 space (different name of vowel triangle or vowel rectangle) have been used for investigating vowel characteristics of a speaker or a language based on statistics of the F1 and F2 values, which were computed by spectral envelope search method. Those methods were dealing mainly with the static information of the formants, not the changes of the formant values (i.e. dynamic information). So a better way of investigating dynamic informations from the formant values of speech signal is suggested so that more convenient and detailed investigation of the dynamic changes can be achieved on F1-F2 space. Suggested method used visualization of static and dynamic information in overlapped way to be able to observe the change of the formant information easily. Finally some examples of the implemented display on some cases of the continuous vowels are shown to prove the usefulness of suggested method.

A Study on Design of Barrel Cam for Automatic Bulb Production Machine (전구 자동화 생산기계용 바렐 캠의 형상설계에 관한 연구)

  • Kim, Jong-Su;Yun, Ho-Eop
    • 연구논문집
    • /
    • s.33
    • /
    • pp.89-97
    • /
    • 2003
  • A barrel cam is used as a very important part of an index drive unit. The index drive unit must have an intermittent-rotational motion. The barrel typed cam and roller gear mechanism has the advantages of high reliability to perform a prescribed motion of a follower. This paper proposes a new method for the shape design of the barrel cam and also a CAD program is developed by using the proposed method. As defined in this paper, the relative velocity method for the shape design calculates the relative velocity of the follower versus cam at a center of roller, and then detemines a contact point by using the geometric relationships and the kinematic constraints, where the direction of the relative velocity must be parallel to a common tangential line at the contact point of two independent bodies, i.e. the cam and the follower. Then, the shape of the cam is defined by the coordinate transformation of the trace of the contact points. This paper presents shape design of the barrel cam in order to prove the accuracy of the proposed methods

  • PDF

Derivations on Semiprime Rings and Banach Algebras, I

  • Kim, Byung-Do;Lee, Yang-Hi
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.7 no.1
    • /
    • pp.165-182
    • /
    • 1994
  • The aim of this paper is to give the partial answer of Vukman's conjecture [2]. From the partial answer we also generalize a classical result of Posner. We prove the following result: Let R be a prime ring with char$(R){\neq}2,3$, and 5. Suppose there exists a nonzero derivation $D:R{\rightarrow}R$ such that the mapping $x{\longmapsto}$ [[[Dx,x],x],x] is centralizing on R. Then R is commutative. Using this result and some results of Sinclair and Johnson, we generalize Yood's noncom-mutative extension of the Singer-Wermer theorem.

  • PDF

A Study on the Temperature Distribution of Convecting Layer of the Solar Pond According to Output (Solar Pond의 출력(出力)에 따른 대류층(對流層)에서의 온도분포(溫度分布)에 관한 연구(硏究))

  • Seoh, J.I.;Lee, Y.S.;Kang, W.
    • Solar Energy
    • /
    • v.5 no.2
    • /
    • pp.20-27
    • /
    • 1985
  • The aims of this study is to examine closely the temperature distribution of the solar pond for conditions of Seoul area climate and to prove capability of the solar pond utilization in Seoul area. In this study the equations for the convecting zone temperature of the solar pond were derived from Rabl and Nielsen's model. As the result of computer simulation, it was found that the average temperature of convecting zone is over $100^{\circ}C$ under conditions which is no output and 120cm depth or over of the insulating layer. Consequently if solar pond is constructed in Seoul area, it is a effective heat storage system.

  • PDF

AN APPROXIMATE ALTERNATING LINEARIZATION DECOMPOSITION METHOD

  • Li, Dan;Pang, Li-Ping;Xia, Zun-Quan
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1249-1262
    • /
    • 2010
  • An approximate alternating linearization decomposition method, for minimizing the sum of two convex functions with some separable structures, is presented in this paper. It can be viewed as an extension of the method with exact solutions proposed by Kiwiel, Rosa and Ruszczynski(1999). In this paper we use inexact optimal solutions instead of the exact ones that are not easily computed to construct the linear models and get the inexact solutions of both subproblems, and also we prove that the inexact optimal solution tends to proximal point, i.e., the inexact optimal solution tends to optimal solution.

Multidisk data allocation method based on genetic algorithm (유전자 알고리즘을 이용한 다중 디스크 데이터 배치 방식)

  • 안대영;박규호;임기욱
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.3
    • /
    • pp.46-58
    • /
    • 1998
  • Multi-disk data allocation problem examined in this paper is to find a method to distribute a Binary Cartesian Product File on multiple disks to maximize parallel disk I/O accesses for partial match retrieval. This problem is known to be NP-hard, and heuristkc approaches have been applied to obtain sub-optimal solutions. Recently, efficient methods have been proposed with a restriction that the number of disks in which files are stored should be power of 2. In this paper, we propose a new disk Allocation method based on Genetic Algorithm(GA) to remove the restriction on the number of disks to be applied. Using the schema theory, we prove that our method can find a near-optimal solutionwith high probability. We compare the quality of solution derived by our method with General Disk Modulo, Binary Disk Modulo, and Error Correcting Code methods through the simulation. The simulation results show that proposed GA is superior to GDM method in all cases and provides comparable performance to the BDM method which has a restriction on the number of disks.

  • PDF