• 대한후두음성언어의학회지
• /
• 제8권1호
• /
• pp.38-43
• /
• 1997

Backgroud : Now a days, most studies for professional voice user have been performed after artificial voice abuse without consideration of environmental and personal factors, and occupational specificity, therefore those studies have some problems. Objectives : To make a basic guideline for the management of untrained professional voice user, practically we ananalyzed the voice of experimental group. Materials and methods : Just after working, the sustained vowel sounds of the 15 female telephone operators (subjective group) and the 20 normal female persons (control group) were analysed, using a history paper, acoustic analyzer and videostroboscopy. Results : The most common symptom in subjective group was dysphonia. Stroboscopic findings in subjective group were as following ; posterior chink 11 cases (73%), incomplete closure 2 cases (13%), anterior chink 1 case (7%). The mean maximal phonation time in telephone operators was 12.8 seconds and in control group was 16.8 seconds. Jitter, pitch pertubation quotient (PPQ), shimmer and amplitude pertubation quotient (ASQ) were significantly increased in subjective group than control group, but there is no difference between two group in fundamental frequency and noise to harmonic ratio. Conclusion : Untrained professional voice user needs professional career guidance and counseling. And when we manage the untrained professional voice user, we should consider specific occupational, personal and environmental factors as well as laryngeal factors.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권5호
• /
• pp.570-576
• /
• 2004

열의 수가 수십만에 이르는 대규모 maximal covering 문제(MCP)를 유전 알고리즘을 통해 해결하는 것에는 한계가 있다. 본 논문에서는 대규모 MCP를 유전알고리즘이 효율적으로 풀 수 있도록 하기 위해 특별히 고안된 교차 연산자와 돌연변이 연산자를 소개한다. 또한, 본 연구에서는 비발현 유전자를 사용하는 새로운 유전 알고리즘을 제시한다. 비발현 유전자는 유전 연산 과정에서 상실될 정보 중 이후의 세대에서 유용할 가능성이 있는 정보를 자손에게 전달하기 위해 보존하는 역할만 할 뿐, 발현되지 않음으로 인해 해의 평가 시에는 반영되지 않는 유전자이다. 비발현 유전자를 사용하는 유전 알고리즘은 집단의 다양성을 유지하는데 유리하여 대규모 MCP를 해결하는데 있어서 보다 효율적으로 탐색을 수행할 수 있다. 현장의 대규모 MCP 데이타로 실험한 결과 비발현 유전자를 가진 유전 알고리즘이 이웃해 탐색 알고리즘인 타부 탐색보다 훨씬 우수한 탐색 성능을 보임을 확인할 수 있었다.

• 한국통신학회논문지
• /
• 제17권4호
• /
• pp.424-432
• /
• 1992

본 논문에서는 고위영역합성(High-level synthesis)의 가장 중요한 과제인 스케듈링 문제를 다루었다. 스케듈링 문제에 대한 접근 방식으로서, IP(integer programming)을 이용한 방식을 택하였다. 본 논문에서는 특히, 가용(可用)자원이 제한된 상태에서의 스케듈링이 효율적으로 수행될 수 있는 방법을 연구하여, 임의의 스케듈링방식에 의해 구해진 스케듈링 결과로부터, 주어진 조건을 만족하는 스케듈링을 행할수 있는 방법을 연구하였다. 멀티싸이클 연산의 연산자할당 및 구조적 파이프라이닝을 위한 스케듈링에 중점을 주어, 가능한한 최대의 성능과 최대의 자원공유가 이루어 지도록, 연산자의 특성을 세밀히 분석하였다.

• 대한수학회논문집
• /
• 제24권3호
• /
• pp.367-379
• /
• 2009

For a prime number p, let $\mathbb{Q}_p$ denote the p-adic field and let $\mathbb{Q}_p^d$ denote a vector space over $\mathbb{Q}_p$ which consists of all d-tuples of $\mathbb{Q}_p$. For a function f ${\in}L_{loc}^1(\mathbb{Q}_p^d)$, we define the Hardy-Littlewood maximal function of f on $\mathbb{Q}_p^d$ by $$M_pf(x)=sup\frac{1}{\gamma{\in}\mathbb{Z}|B_{\gamma}(x)|H}{\int}_{B\gamma(x)}|f(y)|dy$$, where |E|$_H$ denotes the Haar measure of a measurable subset E of $\mathbb{Q}_p^d$ and $B_\gamma(x)$ denotes the p-adic ball with center x ${\in}\;\mathbb{Q}_p^d$ and radius $p^\gamma$. If 1 < q $\leq\;\infty$, then we prove that $M_p$ is a bounded operator of $L^q(\mathbb{Q}_p^d)$ into $L^q(\mathbb{Q}_p^d)$; moreover, $M_p$ is of weak type (1, 1) on $L^1(\mathbb{Q}_p^d)$, that is to say, |{$x{\in}\mathbb{Q}_p^d:|M_pf(x)|$>$\lambda$}|$_H{\leq}\frac{p^d}{\lambda}||f||_{L^1(\mathbb{Q}_p^d)},\;\lambda$ > 0 for any f ${\in}L^1(\mathbb{Q}_p^d)$.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.315-326
• /
• 2013

In this paper, a new monotonicity, $M({\cdot},{\cdot})$-monotonicity, is introduced in Banach spaces, and the resolvent operator of an $M({\cdot},{\cdot})$-monotone operator is proved to be single valued and Lipschitz continuous. By using the resolvent operator technique associated with $M({\cdot},{\cdot})$-monotone operators, we construct a proximal point algorithm for solving a class of variational inclusions. And we prove the convergence of the sequences generated by the proximal point algorithms in Banach spaces. The results in this paper extend and improve some known results in the literature.

• Kyungpook Mathematical Journal
• /
• 제59권2호
• /
• pp.259-275
• /
• 2019

The aim of this paper is to prove that Marcinkiewicz integral operators are bounded from ${\dot{K}}^{{\alpha}({\cdot}),q({\cdot})}_{p({\cdot})}({\mathbb{R}}^n)$ to ${\dot{K}}^{{\alpha}({\cdot}),q({\cdot})}_{p({\cdot})}({\mathbb{R}}^n)$ when the parameters ${\alpha}({\cdot})$, $p({\cdot})$ and $q({\cdot})$ satisfies some conditions. Also, we prove the boundedness of ${\mu}$ on variable Herz-type Hardy spaces $H{\dot{K}}^{{\alpha}({\cdot}),q({\cdot})}_{p({\cdot})}({\mathbb{R}}^n)$.

• 대한수학회논문집
• /
• 제17권1호
• /
• pp.31-36
• /
• 2002

In this paper we first introduce a space of homogeneous type X, and we consider a kind of generalized upper half-space X $\times$ (0, $\infty$). We are mainly concerned with some inequalities in terms of Carleson measures or in terms of certain maximal operators with respect to general approach regions in X $\times$ (0, $\infty$). The main tool of the proof is the Whitney decomposition.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.369-389
• /
• 2006

The iterative algorithms with errors for solutions to accretive operator inclusions are investigated in Banach spaces, including a modification of Rockafellar's proximal point algorithm. Some applications are given in Hilbert spaces. Our results improve the corresponding results in [1, 15-17, 29, 35].

• 한국전문물리치료학회지
• /
• 제16권4호
• /
• pp.37-43
• /
• 2009

This study compared the electromyographic activities and input performance of computer operators using a computer mouse and a trackball. Muscle activities were assessed at the upper trapezius (UT), middle deltoid (MD), extensor digitorum (ED), and first dorsal interosseous muscle (FDI). Twenty-six healthy subjects were recruited, and the test order was selected randomly for each subject. The task set was to click moving targets on a Windows program. The EMG amplitude was normalized using the percentage of reference voluntary contraction for UT and MD and the percentage of maximal voluntary contraction for ED and FDI. To analyze the differences in EMG activity, a paired t-test was used. UT muscle activities were significantly greater when the computer mouse was used (p<.05). FDI muscle activities were significantly greater when the trackball was used (p<.05). Using a trackball can reduce the load on the UT during computer work and help to prevent and manage work-related musculoskeletal disorders.

• 충청수학회지
• /
• 제21권2호
• /
• pp.147-155
• /
• 2008

In this paper, we consider proximal point algorithms based on ($A,{\eta}$)-monotone mappings in the framework of Hilbert spaces. Since ($A,{\eta}$)-monotone mappings generalize A-monotone mappings, H-monotone mappings and many other mappings, our results improve and extend the recent ones announced by [R.U. Verma, Rockafellars celebrated theorem based on A-maximal monotonicity design, Appl. Math. Lett. 21 (2008), 355-360] and [ R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877-898] and some others.