• Kyungpook Mathematical Journal
• /
• v.48 no.1
• /
• pp.1-14
• /
• 2008

In this paper, we investigate the existence of solutions of second order impulsive neutral functional differential inclusions which the nonlinearity F admits convex and non-convex values. Some results under weaker conditions are presented. Our results extend previous ones. The methods rely on a fixed point theorem for condensing multivalued maps and Schaefer's fixed point theorem combined with lower semi-continuous multivalued operators with decomposable values.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.145-152
• /
• 2011

Stage-broadcasting Fresnel and Plano Convex Lighting fixture were fabricated. Compare illumination simulation and measured values for Fresnel and Plano Convex fixture. After made Lighting install studio motor system construction. In studio Daejeon Health Sciences College we measured illuminance and simulation in order to compare Fresnel and Plano Convex Lighting. And we study how much different illuminance between Fresnel and Plano Convex Lighting. In the result of comparison of simulation Fresnel and Plano Convex Lighting fixture are measures of difference value 39.7~250.6Lux and comparison of actually Fresnel and Plano Convex Lighting fixture are measure of difference value 92.84~157.35Lux.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.201-208
• /
• 2003

Since the real steel box girder bridges have a large number of design variables and show complex structural behavior, it would be impractical to directly use the algorithm for its optimum design. Thus, in this study, for optimum design of real steel box girder bridge, approximated reanalysis using an higher-order Improved self-adjusted Convex Approximation (ISACA) which was newly proposed on a previous study by the author is applied for the numerical efficiency. To demonstrate the efficiency, robustness, and convergence of the approximated reanalysis technique using the ISACA, a real bridge having two continuous spans is used as an illustrative example. From the results of the numerical investigation, it may be positively stated that the efficiency, robustness, and convergence of the approximated reanalysis using an ISACA is superior compared with the previous approximated reanalysis techniques.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Kyungpook Mathematical Journal
• /
• v.55 no.3
• /
• pp.705-714
• /
• 2015

In this paper, we introduce and investigate an interesting subclass $M_{\Sigma}({\gamma},{\lambda},{\delta},{\varphi})$ of analytic and bi-univalent functions of complex order in the open unit disk ${\mathbb{U}}$. For functions belonging to the class $M_{\Sigma}({\gamma},{\lambda},{\delta},{\varphi})$ we investigate the coefficient estimates on the first two Taylor-Maclaurin coefficients ${\mid}{\alpha}_2{\mid}$ and ${\mid}{\alpha}_3{\mid}$. The results presented in this paper would generalize and improve some recent works of [1],[5],[9].

• Interaction and multiscale mechanics
• /
• v.2 no.2
• /
• pp.129-151
• /
• 2009

This paper presents a meshfree procedure using a convex generalized meshfree (GMF) approximation for the large deformation analysis of particle-reinforced rubber compounds on microscopic level. The convex GMF approximation possesses the weak-Kronecker-delta property that guarantees the continuity of displacement across the material interface in the rubber compounds. The convex approximation also ensures the positive mass in the discrete system and is less sensitive to the meshfree nodal support size and integration order effects. In this study, the convex approximation is generated in the GMF method by choosing the positive and monotonic increasing basis function. In order to impose the periodic boundary condition in the unit cell method for the microscopic analysis, a singular kernel is introduced on the periodic boundary nodes in the construction of GMF approximation. The periodic boundary condition is solved by the transformation method in both explicit and implicit analyses. To simulate the interface de-bonding phenomena in the rubber compound, the cohesive interface element method is employed in corporation with meshfree method in this study. Several numerical examples are presented to demonstrate the effectiveness of the proposed numerical procedure in the large deformation analysis.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.476-479
• /
• 2000

This paper deals with a robust pole placement method for uncertain linear systems. For all admissible uncertain parameters, a static output feedback controller is designed such that all the poles of the closed loop system are located within the prespecfied disk. It is shown that the existence of a positive definite matrix belonging to a convex set such that its inverse belongs to another convex set guarantees the existence of the output feedback gain matrix for our control problem. By a sequence of convex optimization the aforementioned matrix is obtained. A numerical example is solved in order to illustrate efficacy of our design method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.6
• /
• pp.1041-1049
• /
• 2003

In this paper, a new local two-point approximation method which is based on the exponential intervening variable is proposed. This new algorithm, called the Two-Point Convex Approximation(TPCA), use the function and design sensitivity information from the current and previous design points of the sequential approximate optimization to generate a sequence of convex, separable subproblems. This paper describes the derivation of the parameters associated with the approximation and the numerical solution procedure. In order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve several typical design problems. These optimization results are compared with those of other optimizers. Numerical results obtained from the test examples demonstrate the effectiveness of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.25 no.5
• /
• pp.453-470
• /
• 2018

We study how to distinguish the parameters of the sparse autoregressive (AR) process from zero using a non-convex penalized estimation. A class of non-convex penalties are considered that include the smoothly clipped absolute deviation and minimax concave penalties as special examples. We prove that the penalized estimators achieve some standard theoretical properties such as weak and strong oracle properties which have been proved in sparse linear regression framework. The results hold when the maximal order of the AR process increases to infinity and the minimal size of true non-zero parameters decreases toward zero as the sample size increases. Further, we construct a practical method to select tuning parameters using generalized information criterion, of which the minimizer asymptotically recovers the best theoretical non-penalized estimator of the sparse AR process. Simulation studies are given to confirm the theoretical results.

• East Asian mathematical journal
• /
• v.21 no.2
• /
• pp.233-240
• /
• 2005

Let $CS^{\alpha}(\beta)$ denote the class of normalized strongly $\alpha$-logarithmic close-to-convex functions of order $\beta$, defined in the open unit disk $\mathbb{U}$ by $$\|arg\{\(\frac{f(z)}{g(z)}\)^{1-\alpha}\(\frac{zf'(z)}{g(z)\)^{\alpha}\}\|\leq\frac{\pi}{2}\beta,\;(\alpha,\beta\geq0)$$ where $g{\in}S^*$ the class of normalized starlike functions. In this paper, we prove sharp $Fekete-Szeg\"{o}$ inequalities for functions $f{\in}CS^{\alpha}(\beta)$.