• Bulletin of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.249-262
• /
• 2012

In this paper, under some suitable conditions and in virtue of a selection which depends on a vector-valued function and a feasible set map, the sensitivity analysis of a class of implicit multifunctions is investigated. Moreover, by using the results established, the solution sets of parametric vector optimization problems are studied.

• East Asian mathematical journal
• /
• v.23 no.2
• /
• pp.261-270
• /
• 2007

We provide a local convergence analysis for Secant-like algorithm for solving nonsmooth variational inclusions in Banach spaces. An existence-convergence theorem and an improvement of the ratio of convergence of this algorithm are given under center-conditioned divided difference and Aubin's continuity concept. Our result compare favorably with related obtained in [16].

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

This paper is concerned with the impulsive Cauchy problem (equation omitted) where u is a possibly discontinuous vector-valued function and f, $g_{i}$ : $IR^{n}$ -> $IR^{n}$ are suitably smooth functions. We show that the input-output map is Lipschitz continuous and investigate compactness of reachable sets.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.157-162
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, in this regard, an inner-front creation algorithm is proposed. in which the sizes. shapes. positions, and number of new inner-fronts during the optimization process can be globally and consistently identified by considering both the value of a given criterion for inner-front creation and the occupied volume (area) of material domain. To facilitate the inner-front creation process, the inner-front creation map which corresponds to the discrete valued criterion of inner-front creation is applied to the level set function. In order to regularize the design domain during the optimization process, the edge smoothing is carried out by solving the edge smoothing partial differential equation (PDE). Updating the level set function during the optimization process, in the present work, the least-squares finite element method (LSFEM) is employed. As demonstrative examples for the flexibility and usefulness of the proposed method. the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.12
• /
• pp.1180-1187
• /
• 2007

In the present work, topology optimization method using adaptive inner-front level set method is presented. In the conventional level set based topology optimization method, there exists an incapability for inner-front creation during optimization process. In this regard, as a new attempt to avoid and to overcome the limitation, an inner-front creation algorithm is proposed. In the inner-front creation algorithm, the strain energy density of a structure along with volume constraint is considered. Especially, to facilitate the inner-front creation process during the optimization process, the inner-front creation map which corresponds to the discrete valued function of strain energy density is constructed. In the evolution of the level set function during the optimization process, the least-squares finite element method (LSFEM) is employed. As an application to shell structures, the lightweight design of doubly curved shell and segmented mirror is carried out.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.117-117
• /
• 2017

The onion (Allium cepa L.) is the most widely cultivated species of the genus Allium, especially it has been valued because of the pungent flavor and aroma. Allium species including onion has very large genome sizes ranging from approximately 10 to 20 Gbp, which have complicated genomic studies and precluded genome sequencing until recently. A population of 186 F2 individuals derived from a cross of 'Umjinara' ${\times}$ 'Sinsunhwang' and the two parental lines were used for this study. For the development of framework map, various types of markers including SSRs, RAPD, SNPs, and CAPS makers have been used for polymorphism test. Especially, a lot of SNP and CAPS loci were developed from the onion transcriptome sequence by RNASEQ of two parental lines. The GBS libraries have been constructed based on a modified protocol from Poland Lab using a two-enzyme system. We have been developing markers showing polymorphism between two parental lines, and genotyping for all F2 individuals were finished for a number of polymorphic markers. For the construction of GBS libraries, a set of 192 barcoded adapters were generated from complementary oligonucleotides with XhoI overhang sequence and unique barcodes of length 4-8 bp and they have been tested using two parental linesto determine the optimum conditions for GBS analysis.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.309-315
• /
• 2002

Let I be an open interval and X a complex Banach space. Let$\varepsilon\geq0\;and\;\lambda$ a non-zero complex number with Re $\lambda\neq0$. If $\varphi$ is a strongly differentiable map from I to X with $\parallel\varphi^'(t)-\lambda\varphi(t)\parallel\leq\varepsilon\;for\;all\;t\in\;I$, then we show that the distance between $\varphi$ and the set of all solutions to the differential equation y'=$\lambda$y is at most $\varepsilon/$\mid$Re\lambda$\mid$$.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.343-348
• /
• 1995

Let X and Y be two normed spaces and D a nonempty convex subset of X. Let $T : X \ to L(X,Y)$ be a mapping, where L(X,Y) is the space of all continuous linear mappings from X into Y. And let $C : D \to 2^Y$ be a set-valued map such that for each $x \in D$, C(x) is a convex cone in Y such that Int $C(x) \neq 0 and C(x) \neq Y$, where Int denotes the interior.