• Macromolecular Research
• /
• v.14 no.3
• /
• pp.287-299
• /
• 2006

To successively synthesize star-branched polymers, we developed a new iterative methodology which involves only two sets of the reactions in each iterative process: (a) an addition reaction of DPE or DPE-functionalized polymer to a living anionic polymer, and (b) an in-situ reaction of 1-(4-(4-bromobutyl)phenyl)-1-phenylethylene with the generated 1,1-diphenylalkyl anion to introduce one DPE functionality. With this methodology, 3-, 4-, and 5-arm, regular star-branched polystyrenes, as well as 3-arm ABC, 4-arm ABCD, and a new 5-arm ABCDE, asymmetric star-branched polymers, were successively synthesized. The A, B, C, D, and E arm segments were poly(4-trimethylsilylstyrene), poly(4-methoxystyrene), poly(4-methylstyrene), polystyrene, and poly(4-tert-butyldimethylsilyloxystyrene), respectively. All of the resulting star-branched polymers were well-defined in architecture and precisely controlled in chain length, as confirmed by SEC, $^1H$ NMR, VPO, and SLS analyses. Furthermore, we extended the iterative methodology by the use of a new functionalized DPE derivative, 1-(3-chloromethylphenyl)-1-((3-(1-phonyletheny1)phenyl) ethylene, capable of introducing two DPE functionalities via one DPE anion reaction site in the reaction (b). The number of arm segments of the star-branched polymer synthesized by the methodology could be dramatically increased to 2, 6, and up to 14 by repeating the iterative process.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.4
• /
• pp.31-39
• /
• 1990

A systematic methodology for efficient implementation of processor arrays from regular iterative algorithms is proposed. One of the modern parallel processing array architectures is the Systolic arrays and we use it for processor arrays on this paper. On designing the systolic arrays, there are plenty of mapping functions which satisfy necessary conditions for its implementation to the time-space domain. In this paper, we sue a few conditions to reduce the total number of computable mapping functions efficiently. As a results of applying this methodology, efficient designs of systolic arrays could be done with considerable saving on design time and efforts.

• Macromolecular Research
• /
• v.14 no.3
• /
• pp.272-286
• /
• 2006

Dendritic hyperbranched poly(methyl methacrylate)s (PMMA)s, whose branched architectures resemble the 'dendron' part(s) of dendrimer, were synthesized by an iterative methodology consisting of two reactions in each iteration process: (a) a coupling reaction of u-functionalized, living, anionic PMMA having two tert-butyldimethylsilyloxymethylphenyl(SMP) groups with benzyl bromide(BnBr)-chain-end-functionalized PMMA, and (b) a transformation reaction of the introduced SMP groups into BnBr functionalities. These two reactions, (a) and (b), were repeated three times to afford a series of dendron-like, hyperbranched (PMMA)s up to third generation. Three dendron-like, hyperbranched (PMMA)s different in branched architecture were also synthesized by the same iterative methodology using a low molecular weight, functionalized 1,1-diphenylalkyl anion prepared from sec-BuLi and 1,1-bis(3-tert-butyldime-thylsilyloxymethylphenyl)ethylene in the reaction step (b) in each iterative process. Furthermore, structurally similar, dendron-like, hyperbranched block copolymers could be successfully synthesized by the iterative methodology using $\alpha$-functionalized, living, anionic poly(2-(perfluorobutyl) ethyl methacrylate) (PRfMA) in addition to $\alpha$-functionalized, living PMMA. Accordingly, the resulting block copolymers were comprised of both PMMA and PRfMA segments with different sequential orders. After the block copolymers were cast into films and annealed, their surface structures were characterized by angle-dependent XPS and contact angle measurements. All three samples showed significant segregation and enrichment of PRfMA segments at the surfaces.

• Coupled systems mechanics
• /
• v.4 no.3
• /
• pp.263-277
• /
• 2015

This paper presents a coupled FEM-BEM strategy for the numerical analysis of elastodynamic problems where infinite-domain models and complex heterogeneous media are involved, rendering a configuration in which neither the Finite Element Method (FEM) nor the Boundary Element Method (BEM) is most appropriate for the numerical analysis. In this case, the coupling of these methodologies is recommended, allowing exploring their respective advantages. Here, frequency domain analyses are focused and an iterative FEM-BEM coupling technique is considered. In this iterative coupling, each sub-domain of the model is solved separately, and the variables at the common interfaces are iteratively updated, until convergence is achieved. A relaxation parameter is introduced into the coupling algorithm and an expression for its optimal value is deduced. The iterative FEM-BEM coupling technique allows independent discretizations to be efficiently employed for both finite and boundary element methods, without any requirement of matching nodes at the common interfaces. In addition, it leads to smaller and better-conditioned systems of equations (different solvers, suitable for each sub-domain, may be employed), which do not need to be treated (inverted, triangularized etc.) at each iterative step, providing an accurate and efficient methodology.

• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.747-760
• /
• 2014

In this paper a higher order iterative algorithm is developed for an unconstrained multivariate optimization problem. Taylor expansion of matrix valued function is used to prove the cubic order convergence of the proposed algorithm. The methodology is supported with numerical and graphical illustration.

• Journal of Korean Society for Quality Management
• /
• v.40 no.4
• /
• pp.481-496
• /
• 2012

Purpose: This paper aims at improving inefficiency of an existing posterior preference articulation method proposed for dual response surface optimization. The method generates a set of non-dominated solutions and then allows a decision maker (DM) to select the best solution among them through an interval selection strategy. Methods: This paper proposes an iterative posterior preference articulation method, which repeatedly generates the predetermined number of non-dominated solutions in an interval which becomes gradually narrower over rounds. Results: The existing method generates a good number of non-dominated solutions not used in the DM's selection process, while the proposed method generates the minimal number of non-dominated solutions necessitated in the selection process. Conclusion: The proposed method enables a satisfactory compromise solution to be achieved with minimal cognitive burden of the DM as well as with light computation load in generating non-dominated solutions.

• Korean Journal of Mathematics
• /
• v.31 no.4
• /
• pp.419-431
• /
• 2023

In this paper, we propose an iterative method for a symmetric interior penalty Galerkin method for heterogeneous elliptic problems. The iterative method consists mainly of two parts based on a non-overlapping domain decomposition approach. One is an intermediate preconditioner constructed by understanding the properties of the discontinuous finite element functions and the other is a preconditioning related to the dual-primal finite element tearing and interconnecting (FETI-DP) methodology. Numerical results for the proposed method are presented, which demonstrate the performance of the iterative method in terms of various parameters associated with the elliptic model problem, the finite element discretization, and non-overlapping subdomain decomposition.

• Environmental and Resource Economics Review
• /
• v.22 no.3
• /
• pp.499-520
• /
• 2013

This study proposes an iterative approach to the estimation of the marginal abatement costs of undesirable outputs by computing the slope of the efficient production possibilities frontier on the basis of the efficient projection points generated by the directional output distance function approach due to Fare et al. (2005) based on duality theory. In case of the latter methodology, the estimated marginal abatement costs differ significantly depending on the choice of the directional output vector. In addition, depending on the curvature of the underlying PPF the efficient projection points may be located at a significant distance away from their actually observed counterparts. While it would be more logical to estimate marginal abatement costs as a PPF slope at a point corresponding to the actually observed emissions level, the methodology based on duality theory is likely to produce unstable results due to the problems associated with applying the theorem of implicit function differentiation. Since our methodology is not based on duality theory, our results are immune to both of these problems. We apply our methodology to a sample of Western European countries for the period of 1995-2011 to illustrate our approach.

• Journal of Industrial Technology
• /
• v.9
• /
• pp.51-56
• /
• 1989

A methodology for determining optimal sampling plans for Bayesian multiattribute curtailed inspection models is proposed, whereby sampling inspection is terminated as soon as the disposition of the inspection lot is determined. An iterative solution procedure is developed for obtaining optimal multiattribute acceptance sampling plans under cuntailed sampling inspection.

• Journal of Information Technology Applications and Management
• /
• v.26 no.1
• /
• pp.65-75
• /
• 2019

As the use of semantic web based on XML increases in the field of data management, a lot of studies to extract useful information from the data stored in ontology have been tried based on association rule mining. Ontology data is advantageous in that data can be freely expressed because it has a flexible and scalable structure unlike a conventional database having a predefined structure. On the contrary, it is difficult to find frequent patterns in a uniformized analysis method. The goal of this study is to provide a basis for extracting useful knowledge from ontology by searching for frequently occurring subgraph patterns by applying transaction-based graph mining techniques to ontology schema graph data and instance graph data constituting ontology. In order to overcome the structural limitations of the existing ontology mining, the frequent pattern search methodology in this study uses the methodology used in graph mining to apply the frequent pattern in the graph data structure to the ontology by applying iterative node chunking method. Our suggested methodology will play an important role in knowledge extraction.