• Kyungpook Mathematical Journal
• /
• 제49권4호
• /
• pp.631-646
• /
• 2009

In the present investigation, we introduce new classes of p-valent meromorphic functions defined by Liu-Srivastava linear operator and the multiplier transform and study their properties by using certain first order differential subordination and superordination.

• 대한수학회보
• /
• 제37권1호
• /
• pp.77-84
• /
• 2000

The product of two localization operators with symbols F and G in some subspace of $L^2(C^n)$ is shown to be a localization operator with symbol in $L^2(C^n)$ and a formula for the symbol of the product in terms of F and G is given.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.362-367
• /
• 1996

In this paper, the eigenstructure of a class of linear time varying systems, termed as linear quasi-time invariant(LQTI) systems, is investigated. A system composed of dynamic devices such as linear time varying capacitors and resistors can be an example of the class. To effectively describe and analyze the LQTI systems, a generalized differential operator G is introduced. Then the dynamic systems described by the operator G are studied in terms of eigenvalue, frequency characteristics, stability and an extended convolution. Some basic attributes of the operator G are compared with those of the differential operator D. Also the corresponding generalized Laplace transform pair is defined and relevant properties are derived for frequency domain analysis of the systems under consideration. As an application example, a LQTI circuit is examined by using the concept of eigenstructure of LQTI system. The LQTI filter processes the sinusoidal signals modulated by some functions.

• Kyungpook Mathematical Journal
• /
• 제54권3호
• /
• pp.365-374
• /
• 2014

In this paper, we introduce a new subclass of meromorphic functions defined in the punctured unit disc. We derive inclusion relationships, radius problem and some other interesting properties of this class are investigated.

• 제어로봇시스템학회논문지
• /
• 제21권5호
• /
• pp.471-476
• /
• 2015

This paper presents a maximum velocity trajectory planning algorithm for differential mobile robots with wheel velocity constraint to cope with physical limits in the joint space for two-wheeled mobile robots (TMR). In previous research, the convolution operator was able to generate a central velocity that deals with the physical constraints of a mobile robot while considering the heading angles along a smooth curve in terms of time-dependent parameter. However, the velocity could not track the predefined path. An algorithm is proposed to compensate an error that occurs between the actual and driven distance by the velocity of the center of a TMR within a sampling time. The velocity commands in Cartesian space are also converted to actuator commands to drive two wheels. In the case that the actuator commands exceed the maximum velocity the trajectory is redeveloped with the compensated center velocity. The new center velocity is obtained according to the curvature of the path to provide a maximum allowable velocity meaning a time-optimal trajectory. The effectiveness of the algorithm is shown through numerical examples.

• 제어로봇시스템학회논문지
• /
• 제19권6호
• /
• pp.540-546
• /
• 2013

This paper presents a trajectory planning algorithm for TMR (Two-wheeled Mobile Robots). The trajectory is developed in joint space and considers the physical limits of a TMR. First, we present a process for generating a smooth curve through a Bezier curve. The trajectory for the center of the TMR following the Bezier curve is developed through a convolution operator taking into consideration its physical limits. The trajectory along the Bezier curve is regenerated using time-dependent parameters which correspond to the distance driven by the velocity of the center of the TMR in a sampling time. The velocity commands in the Cartesian space are converted to actuator commands for two wheels. In case that the actuator commands exceed the maximum velocity, the trajectory is redeveloped with compensated center velocity. We also suggest a smooth trajectory planning algorithm in joint space for the two segmented paths. Finally, the effectiveness of the algorithm is shown through numerical examples and application to a simulator.

• 대한수학회지
• /
• 제42권3호
• /
• pp.573-597
• /
• 2005

A continuous linear operator T, on the space of entire functions in d variables, is PDE-preserving for a given set $\mathbb{P}\;\subseteq\;\mathbb{C}|\xi_{1},\ldots,\xi_{d}|$ of polynomials if it maps every kernel-set ker P(D), $P\;{\in}\;\mathbb{P}$, invariantly. It is clear that the set $\mathbb{O}({\mathbb{P}})$ of PDE-preserving operators for $\mathbb{P}$ forms an algebra under composition. We study and link properties and structures on the operator side $\mathbb{O}({\mathbb{P}})$ versus the corresponding family $\mathbb{P}$ of polynomials. For our purposes, we introduce notions such as the PDE-preserving hull and basic sets for a given set $\mathbb{P}$ which, roughly, is the largest, respectively a minimal, collection of polynomials that generate all the PDE-preserving operators for $\mathbb{P}$. We also describe PDE-preserving operators via a kernel theorem. We apply Hilbert's Nullstellensatz.

• Journal of Electrical Engineering and Technology
• /
• 제12권1호
• /
• pp.363-372
• /
• 2017

This paper presents a novel face recognition algorithm based on the deep convolution neural network and key point detection jointed local binary pattern methodology to enhance the accuracy of face recognition. We firstly propose the modified face key feature point location detection method to enhance the traditional localization algorithm to better pre-process the original face images. We put forward the grey information and the color information with combination of a composite model of local information. Then, we optimize the multi-layer network structure deep learning algorithm using the Fisher criterion as reference to adjust the network structure more accurately. Furthermore, we modify the local binary pattern texture description operator and combine it with the neural network to overcome drawbacks that deep neural network could not learn to face image and the local characteristics. Simulation results demonstrate that the proposed algorithm obtains stronger robustness and feasibility compared with the other state-of-the-art algorithms. The proposed algorithm also provides the novel paradigm for the application of deep learning in the field of face recognition which sets the milestone for further research.

• Nuclear Engineering and Technology
• /
• 제2권4호
• /
• pp.263-268
• /
• 1970

시간과 에너지에 종속된 중성자 전도 방정식에 나타나는 연속 에너지 전도 연산자의 스펙트럼(Spectrum)을 분석했다. 스펙트럼에 관한 4가지 정리를 증명하고 일반화된 Mellin 에너지변화의 Convolution 정리를 얻었다. 또한 최종해에 필요한 완전성정리를 증명하고 점근적으로 가장 우세한 시간붕괴상수 1 - c를 발견하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.283-286
• /
• 2001

Based on a fuzzy system representation of gray scale images, we derive an edge detection algorithm whose convolution kernel is different from the known kernels such as those of Roberts', Prewitt's or Sobel's gradient. Our fuzzy system representation is an exact representation of the bicubic spline function which represents the gray scale image approximately. Hence the fuzzy system is a continuous function and it provides a natural way to define the gradient and the Laplacian operator. We show that the gradient at grid points can be evaluated by taking the convolution of the image with a 3 3 kernel. We also show that our gradient coupled with the approximate value of the continuous function generates an edge detection method which creates edge images clearer than those by other methods. A few examples of applying our methods are included.