• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.727-749
• /
• 2015

We obtain the conditions on ${\beta}$ so that $1+{\beta}zp^{\prime}(z){\prec}1+4z/3+2z^2/3$ implies p(z) ${\prec}$ (2+z)/(2-z), $1+(1-{\alpha})z$, $(1+(1-2{\alpha})z)/(1-z)$, ($0{\leq}{\alpha}$<1), exp(z) or ${\sqrt{1+z}}$. Similar results are obtained by considering the expressions $1+{\beta}zp^{\prime}(z)/p(z)$, $1+{\beta}zp^{\prime}(z)/p^2(z)$ and $p(z)+{\beta}zp^{\prime}(z)/p(z)$. These results are applied to obtain sufficient conditions for normalized analytic function f to belong to various subclasses of starlike functions, or to satisfy the condition ${\mid}log(zf^{\prime}(z)/f(z)){\mid}$ < 1 or ${\mid}(zf^{\prime}(z)/f(z))^2-1{\mid}$ < 1 or zf'(z)/f(z) lying in the region bounded by the cardioid $(9x^2+9y^2-18x+5)^2-16(9x^2+9y^2-6x+1)=0$.

• Journal of Sensor Science and Technology
• /
• v.26 no.1
• /
• pp.28-34
• /
• 2017

An NIR grism Si optical area sensor spectrometer with in-band reference wavelength is designed and fabricated. It is composed of a transmission type diffraction grating (spatial density 300 line/mm), a rectangular N-BK7 prism (apex angle 30 degree), NIR filter(cutoff wavelength 720 nm), an imaging convex lens(focal length 50 mm F1.8) and an IR modified DSLR camera (Canon EOS40D) of Si optical area sensor ($3,888{\times}2,592$ pixels, pixel size $5.710{\mu}m$). "In-band reference wavelength function" is implemented using non-dispersive 0th diffraction order optical beam. The NIR grism spectrometer is tested in a laboratory using a halogen lamp and a Neon lamp. And the spectrometer is used in an astronomy field for obtaining the planet Jupiter NIR spectrum. In-band reference wavelength i.e. un-deviation wavelength is 846 nm, an wavelength resolution is 0.3027 nm/pixel, an wavelength resolving power is 2,794 and an wavelength range is 650~1,000 nm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.1
• /
• pp.31-40
• /
• 1992

This paper presents an automatic feature recognition system for recognizing and extracting feature information needed for the process planning input from a 3D CAD system. A given part is modeled by using the AutoCAD and feature information is automatically extracted from the AutoCAD database. The type of parts considered in this study is prismatic parts composed of faces perpendicular to the X, Y, Z axes and the types of features recognized by the proposed system are through steps, blind steps, through slots, blind slots, and pockets. Features are recognized by using the concept of convex points and concave points. Case studies are implemented to evaluate feasibilities of the function of the proposed system. The developed system is programmed by using Turbo Pascal on the IBM PC/AT on which the AutoCAD and the proposed system are implemented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.1 s.178
• /
• pp.113-120
• /
• 2006

This paper proposed the control algorithm fur aspheric surface grinding and was verified by the experiment. The functions of the algorithm were simultaneous control of the position and interpolation of the aspheric curve. The non-linear formula of the tool position was derived from the aspheric equations and the shape of the tool. The function was partitioned by an certain interval and the control parameters were calculated at each control section. The movement in a session was interpolated with acceleration and velocity. The position error was feed-backed by rotary encorder. The concept of feedback algorithm was correcting position error by increasing or decreasing the speed. In the experiment, two-axis machine was controlled to track the aspheric surface by the proposed algorithm. The effect of the control and process parameters was monitored. The result showed that the maximum tracking error was under sub-micro level for the concave and convex surfaces.

• Transactions of Materials Processing
• /
• v.23 no.6
• /
• pp.369-375
• /
• 2014

Flexible roll forming allows profiles to have variable cross-sections. However, the profile may have some shape errors, such as, warping which is a major defect. The shape error is induced by geometrical deviations in both the concave zone and the convex zone. In the current study, flexible roll forming was modeled with FE simulations to analyze the shape error and the longitudinal strain distribution along the flange section over the profile. A distribution of analytically calculated longitudinal strains was used to develop relationships between the shape error and the longitudinal strain distribution as a function of the defined shape parameters for the profile. The FE simulations showed that the shape error is primarily affected by the deviations between the distribution of analytically calculated longitudinal strain and the longitudinal strain distribution of the profile. The results show that the shape error can be controlled by designing the shape parameters to control the geometrical deviations at the flange section in the transition zones.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.359-366
• /
• 2008

Let A(p) be the class of functions $f\;:\;z^p\;+\;\sum\limits_{j=1}^{\infty}a_jz^{p+j}$ analytic in the open unit disc E. Let, for any integer n > -p, $f_{n+p-1}(z)\;=\;z^p+\sum\limits_{j=1}^{\infty}(p+j)^{n+p-1}z^{p+j}$. We define $f_{n+p-1}^{(-1)}(z)$ by using convolution * as $f_{n+p-1}\;*\;f_{n+p-1}^{-1}=\frac{z^p}{(1-z)^{n+p}$. A function p, analytic in E with p(0) = 1, is in the class $P_k(\rho)$ if ${\int}_0^{2\pi}\|\frac{Re\;p(z)-\rho}{p-\rho}\|\;d\theta\;\leq\;k{\pi}$, where $z=re^{i\theta}$, $k\;\geq\;2$ and $0\;{\leq}\;\rho\;{\leq}\;p$. We use the class $P_k(\rho)$ to introduce a new class of multivalent analytic functions and define an integral operator $L_{n+p-1}(f)\;\;=\;f_{n+p-1}^{-1}\;*\;f$ for f(z) belonging to this class. We derive some interesting properties of this generalized integral operator which include inclusion results and radius problems.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.867-873
• /
• 2011

A navigation mesh (NavMesh) is a suitable tool for the representation of a three-dimensional game world. A NavMesh consists of convex polygons covering free space, so the path can be found reliably without detecting collision with obstacles. The main disadvantage of a NavMesh is the huge state space. When the $A^*$ algorithm is applied to polygonal meshes for detailed terrain representation, the pathfinding can be inefficient due to the many states to be searched. In this paper, we propose a method to reduce the number of states searched by using visibility tests to achieve fast searching even on a detailed terrain with a large number of polygons. Our algorithm finds the visible vertices of the obstacles from the critical states and uses the heuristic function of $A^*$, defined as the distance to the goal through such visible vertices. The results show that the number of searched states can be substantially reduced compared to the $A^*$ search with a straight-line distance heuristic.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.675-685
• /
• 2010

In this paper, we consider a new class of regularized (nonconvex) generalized mixed variational inequality problems in real Hilbert space. We give the concepts of partially relaxed strongly mixed monotone and partially relaxed strongly $\theta$-pseudomonotone mappings, which are extension of the concepts given by Xia and Ding [19], Noor [13] and Kazmi et al. [9]. Further we use the auxiliary principle technique to suggest a two-step iterative algorithm for solving regularized (nonconvex) generalized mixed variational inequality problem. We prove that the convergence of the iterative algorithm requires only the continuity, partially relaxed strongly mixed monotonicity and partially relaxed strongly $\theta$-pseudomonotonicity. The theorems presented in this paper represent improvement and generalization of the previously known results for solving equilibrium problems and variational inequality problems involving the nonconvex (convex) sets, see for example Noor [13], Pang et al. [14], and Xia and Ding [19].