• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.466-473
• /
• 2000

Optimality Criteria algorithm based on the derivation of reciprocal approximations has been applied to structural optimization of large-scale structures. However, required computational cost for the serial analysis algorithm of large-scale structures consisting of a large number of degrees of freedom and members is too high to be adopted in the solution process of O.C. algorithm Thus, parallel version of O.C. algorithm on the network of personal computers is presented in this Paper. Parallelism in O.C. algorithm may be classified into two regions such as analysis and optimizer part As the first step of development of parallel algorithm, parallel structural analysis algorithm is developed and used in O.C. algorithm The algorithm is applied to optimal design of a 54-story plane frame structure

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.393-402
• /
• 2013

For 0 < $p$ < ${\infty}$, ${\alpha}$ > -1 and 0 < $r$ < 1, we show that if $f$ is in the space of Dirichlet type $\mathfrak{D}^p_{p-1}$, then ${\int}_{1}^{0}M_{p}^{p}(r,f^{\prime})(1-r)^{p-1}rdr$ < ${\infty}$ and ${\int}_{1}^{0}M_{(2+{\alpha})p}^{(2+{\alpha})p}(r,f^{\prime})(1-r)^{(2+{\alpha})p+{\alpha}}rdr$ < ${\infty}$ where $M_p(r,f)=\[\frac{1}{2{\pi}}{\int}_{0}^{2{\pi}}{\mid}f(re^{it}){\mid}^pdt\]^{1/p}$. For 1 < $p$ < $q$ < ${\infty}$ and ${\alpha}+1$ < $p$, we show that if there exists some positive constant $c$ such that ${\parallel}f{\parallel}_{L^{q(d{\mu})}}{\leq}c{\parallel}f{\parallel}_{\mathfrak{D}^p_{\alpha}}$ for all $f{\in}\mathfrak{D}^p_{\alpha}$, then ${\parallel}f{\parallel}_{L^{q(d{\mu})}}{\leq}c{\parallel}f{\parallel}_{\mathcal{B}_p(q)}$ where $\mathcal{B}_p(q)$ is the weighted Besov space. We also find the condition of measure ${\mu}$ such that ${\sup}_{a{\in}D}{\int}_D(k_a(z)(1-{\mid}a{\mid}^2)^{(p-a-1)})^{q/p}d{\mu}(z)$ < ${\infty}$.

• Journal of the Korean Statistical Society
• /
• v.13 no.2
• /
• pp.114-120
• /
• 1984

A parallel flats fraction for the $3^n$ design is defined as union of flats ${t}At=c_i(mod 3)}, i=1,2,\cdots, f$ and is symbolically written as At=C where A is rank r. The A matrix partitions the effects into n+1 alias sets where $u=(3^{n-r}-1)/2. For each alias set the f flats produce an ACPM from which a detection matrix is constructed. The set of all possible parallel flats fraction C can be partitioned into equivalence classes. In this paper, we develop some properties of a detection matrix and C.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.4
• /
• pp.699-708
• /
• 2004

Niebergall and Ryan posed many open problems on real hypersurfaces in complex space forms. One of them is "Are there any Ricci-parallel real hypersurfaces in complex projective space $P_2C$ or complex hyperbolic space $H_2C$\ulcorner" The purpose of present paper is to prove the nonexistence of such hypersurfaces.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.149-158
• /
• 2012

In this paper, we prove the superstability and the generalized Hyers-Ulam stability of Jordan *-homomorphisms between unital $C^*$-algebras associated with the following functional equation$$f(\frac{-x+y}{3})+f(\frac{x-3z}{c})+f(\frac{3x-y+3z}{3})=f(x)$$. Morever, we investigate Jordan *-homomorphisms between unital $C^*$-algebras associated with the following functional inequality $${\parallel}f(\frac{-x+y}{3})+f(\frac{x-3z}{3})+f(\frac{3x-y+3z}{3}){\parallel}\leq{\parallel}f(x)\parallel$$.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.161-173
• /
• 2013

This paper is concerned with the space $\mathcal{K}_{w^*}(X^*,Y)$ of $weak^*$ to weak continuous compact operators from the dual space $X^*$ of a Banach space X to a Banach space Y. We show that if $X^*$ or $Y^*$ has the Radon-Nikod$\acute{y}$m property, $\mathcal{C}$ is a convex subset of $\mathcal{K}_{w^*}(X^*,Y)$ with $0{\in}\mathcal{C}$ and T is a bounded linear operator from $X^*$ into Y, then $T{\in}\bar{\mathcal{C}}^{{\tau}_{\mathcal{c}}}$ if and only if $T{\in}\bar{\{S{\in}\mathcal{C}:{\parallel}S{\parallel}{\leq}{\parallel}T{\parallel}\}}^{{\tau}_{\mathcal{c}}}$, where ${\tau}_{\mathcal{c}}$ is the topology of uniform convergence on each compact subset of X, moreover, if $T{\in}\mathcal{K}_{w^*}(X^*, Y)$, here $\mathcal{C}$ need not to contain 0, then $T{\in}\bar{\mathcal{C}}^{{\tau}_{\mathcal{c}}}$ if and only if $T{\in}\bar{\mathcal{C}}$ in the topology of the operator norm. Some properties of $\mathcal{K}_{w^*}(X^*,Y)$ are presented.

• Journal of Korean Society of Water and Wastewater
• /
• v.21 no.2
• /
• pp.215-224
• /
• 2007

The purpose of this study was to estimates water supply reliability indices of the water supply by Allocation Rules(AR) for parallel reservoirs. Rule (A) can be considered it as only current storage, Rule(B) can be considered it as current storage and inflow and Rule(C) can be considered it as current storage, inflow and water supply capacity. First, conditions of water supply are divided by Condition I for the monthly constant water supply and Condition II for the monthly varied water supply. Second, results of allocation coefficients are revealed the smallest different at Rule(C). The analysis of water supply showed that the capability of water supply is superior to the Rule(B), it is superior to the Rule(C) on the base of the balance of water supply. The reliability analysis was highly showed at the Rule(B) and Rule(C). A methodology for the analysis of water supply was developed and applied to the parallel reservoir system from this research, The operation rule for the parallel reservoir can be slightly modified and successfully applied to the different kinds of the parallel reservoir system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.485-496
• /
• 1999

Comparing with sequential programming, parallel programming has additional complexity due to the consideration of parallelism, communication and synchronization of processes. A synergism between users and compliers should be established, each assisting the other to produce high quality parallel programs. On the above underlying philosophy, we developed a parallel Object-Oriented specification language, POOSL, as preliminary works. However, it is still likely to hard for users to write parallel program because users have to consider grammar of POOSL and to write text-based parallel program. It would be more desirable to provide users wit visual environment for effective parallel programming. Therefore, we propose a visual programming environment. VEPO(Visual environment for Parallel Object-Oriented Programming), based on POOSL in order that users can develop parallel programs more easily and conveniently. It aims at supporting a programming environment in which users can represent their programs more naturally and visually I parallel manner with object-oriented concept and essential steps during parallel program development such as program specification, compilation, execution and animation of execution are integrated. VEPO has useful features for parallel processing. Especially, complicated parallel codes for synchronization and communication of processes are automatically generated in the translation phase, so users can be relieved of writing error-prone parallel codes. The system is targeted to the transputer-based parallel system, MC-3. The graphic user interface of VEPO was implemented using Visual C++. Visual programs descirbed on VEPO are translated into Inmos C and executed on MC-3.

• Journal of the Korean Wood Science and Technology
• /
• v.38 no.1
• /
• pp.1-10
• /
• 2010

In this study, to study an effective use and improve strength performances of woods and wood-based materials, three-ply hybrid laminated woods which are composed of spruce in the face and three kinds of wood-based boards (MDF, PB, OSB) in the core were manufactured, and the effect of constitution elements used for the core laminae on bending creep performances was investigated. The shape of creep curves showed exponential function plots which the upper right side was increased, and differed among the kinds of wood-based boards used for the core laminae of hybrid laminated wood. The creep deformation perpendicular to the grain of faces of hybrid laminated woods was in order $C_{\perp}$(P) > $C_{\perp}$(M) > $C_{\perp}$(O) with PB, MDF and OSB in the core, respectively. It was found that the creep deformation arranged with OSB in the core had 2 times smaller than those arranged with MDF and PB in the core. By hybrid laminating, the creep deformation of spruce perpendicular to the grain was markedly decreased. On the other hand, the creep deformation parallel to the grain of the faces ($C_{\parallel}$ type) of hybrid laminated woods was in order $C_{\parallel}$(P) > $C_{\parallel}$(O) > $C_{\parallel}$(M) with PB, OSB and MDF in the core. The ratios among three hybrid laminated woods were considerably decreased, especially the difference between $C_{\parallel}$(P) and $C_{\parallel}$(O) hybrid laminated woods arranged with PB and OSB in the core was very small. These values showed 0.108~0.464 times smaller than creep deformation of three wood-based boards and it was found that creep deformation of three wood-based boards was considerably decreased by hybrid laminating. Creep anisotropy of hybrid laminated woods was greater in creep deformation than in initial deformation, whereas it was found that the values was much smaller than that of spruce parallel laminated woods.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.851-856
• /
• 2003

The LM generator is an improved summation generator with maximum period, near maximum linear complexity and maximum order of correlation immunity, and it has a property with the input-output correlation immunity In this paper, we propose the high-speed m-parallel LM-BSG and 8-parallel LM-BSG for detail as a design example. When compared with a conventional stream cipher, the properties of the proposed cipher exhibited the same crypto-degree (security) with a rt times faster processing.