• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.143-153
• /
• 2002

Null designs form a vector space and there are only finite number of minimal null designs(up to scalar multiple), hence it is natural to look at the convex polytopes of minimal null designs. For example, when t = 0, k = 1, the convex polytope of minimal null designs is the polytope of roofs of type An. In this article, we look at the convex polytopes of minimal null designs and find many general properties on the vertices, edges, dimension, and some structural properties that might help to understand the structure of polytopes for big n, t through the structure of smaller n, t.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.21-36
• /
• 2000

In this article we study the relation between subinvariant submean and normal structure in a locally convex topological vector space. This extends in a natural way a result obtained recently by Lau and Takahashi. Our approach also follows closely theirs.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.12
• /
• pp.655-660
• /
• 2004

This paper deals with the design of a fixed-structure $H_\infty$ power system stabilizer (PSS) by using an iterative linear matrix inequality (LMI) method. The fixed-structure $H_\infty$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the practical applicability of the proposed algorithm.

• The Pure and Applied Mathematics
• /
• v.22 no.2
• /
• pp.185-197
• /
• 2015

The author considers a Noor-type iterative scheme to approximate com- mon fixed points of an infinite family of uniformly quasi-sup(f_n)-Lipschitzian map- pings and an infinite family of g_n-expansive mappings in convex cone metric spaces. His results generalize, improve and unify some corresponding results in convex met- ric spaces [1, 3, 9, 16, 18, 19] and convex cone metric spaces [8].

• Journal of the Korean Mathematical Society
• /
• v.43 no.5
• /
• pp.1019-1045
• /
• 2006

As a natural generalization of a Sasakian space form, we define a contact strongly pseudo-convex CR-space form (of constant pseudo-holomorphic sectional curvature) by using the Tanaka-Webster connection, which is a canonical affine connection on a contact strongly pseudo-convex CR-manifold. In particular, we classify a contact strongly pseudo-convex CR-space form $(M,\;\eta,\;\varphi)$ with the pseudo-parallel structure operator $h(=1/2L\xi\varphi)$, and then we obtain the nice form of their curvature tensors in proving Schurtype theorem, where $L\xi$ denote the Lie derivative in the characteristic direction $\xi$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.127-135
• /
• 2000

This paper provides a new method of initializing neurons used in self-organizing neural networks and sequencing input nodes for applying to Euclidean traveling salesman problem. We use a general property that in any optimal solution for Euclidean traveling salesman problem, vertices located on the convex hull are visited in the order in which they appear on the convex hull boundary. We composite input nodes as number of convex hulls and initialize neurons as shape of the external convex hull. And then adapt input nodes as the convex hull unit and all convex hulls are adapted as same pattern, clockwise or counterclockwise. As a result of our experiments, we obtain l∼3 % improved solutions and these solutions can be used for initial solutions of any global search algorithms.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.138-143
• /
• 2008

Recently, a new periodic cellular metal(PCM) named as Wire wove Bulk Kagome(WBK) was introduced. Based on the shape of tetrahedra composing a WBK, WBKs are classified into two types, namely, concave and convex type. They are easily differentiated by changing the assembling sequence. The effect of geometrical parameters such as the wire diameter, strut length and number of layers on the compressive behavior of concave type WBK has already been investigated. In this work, the similar works were performed with the convex type WBKs. It was shown that the compressive strength of the convex type WBK was quite similar to that of the concave type. The compressive strengths of convex type specimens also depend on the slenderness ratio, but a little different from those of concave type specimens in the detailed behavior. And densification occurs earlier than the concave type WBK.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.8
• /
• pp.78-88
• /
• 1992

To improve the characteristics of sub$\mu$m short channel MOSFET device, a new device having the convex structure is proposed. This device has 3-dimensionally expandable channel length according to the vertical etched silicon height. For the purpose of comparing the DC and AC characteristics, planar device is also fabricated. Comparing the channel length, the convex device with 0.4$\mu$m silicon height is larger about 0.56$\mu$m in NMOS and 0.78$\mu$m in PMOS than planar devices. DC characteristics, such as threshold voltage, operational current, substrate current and breakdown voltage are compared together with AC characteristics using the ring oscillator inverter delay. Also process and device simulation are performed and the differences between convex and pranaldevice are also compared.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.