• 제목/요약/키워드: iterative methodology

검색결과 94건 처리시간 0.023초

Successive Synthesis of Well-Defined Star-Branched Polymers by an Iterative Approach Based on Living Anionic Polymerization

  • Higashihara Tomoya;Inoue Kyoichi;Nagura Masato;Hirao Akira
    • Macromolecular Research
    • /
    • 제14권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.

순환 알고리즘의 Processor Array에로의 합성 및 구현 (The Synthesizing Implementation of Iterative Algorithms on Processor Arrays)

  • 이덕수;신동석
    • 한국항해학회지
    • /
    • 제14권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.

  • PDF

Precise Synthesis of Dendron-Like Hyperbranched Polymers and Block Copolymers by an Iterative Approach Involving Living Anionic Polymerization, Coupling Reaction, and Transformation Reaction

  • Hirao Akira;Tsunoda Yuji;Matsuo Akira;Sugiyama Kenji;Watanabe Takumi
    • Macromolecular Research
    • /
    • 제14권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.

Elastodynamic analysis by a frequency-domain FEM-BEM iterative coupling procedure

  • Soares, Delfim Jr.;Goncalves, Kleber A.;de Faria Telles, Jose Claudio
    • Coupled systems mechanics
    • /
    • 제4권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.

A HIGHER ORDER ITERATIVE ALGORITHM FOR MULTIVARIATE OPTIMIZATION PROBLEM

  • Chakraborty, Suvra Kanti;Panda, Geetanjali
    • Journal of applied mathematics & informatics
    • /
    • 제32권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.

쌍대반응표면최적화를 위한 반복적 선호도사후제시법 (An Iterative Posterior Preference Articulation Approach to Dual Response Surface Optimization)

  • 정인준
    • 품질경영학회지
    • /
    • 제40권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.

A NON-OVERLAPPING DOMAIN DECOMPOSITION METHOD FOR A DISCONTINUOUS GALERKIN METHOD: A NUMERICAL STUDY

  • Eun-Hee Park
    • Korean Journal of Mathematics
    • /
    • 제31권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.

방향성 벡터 일반화를 통한 이산화탄소의 한계저감비용 연구 (An Iterative Approach to the Estimation of CO2 Abatement Costs)

  • ;민동기
    • 자원ㆍ환경경제연구
    • /
    • 제22권3호
    • /
    • pp.499-520
    • /
    • 2013
  • 기존 연구에서는 이산화탄소의 한계저감비용을 추정할 경우 쌍대성 이론에 근거하여 임의로 설정된 하나의 방향성 벡터(directional vector) 설정하였으나 본 연구에서는 이러한 한계를 극복하고자 다양한 형태의 방향성 벡터를 사용하여 이산화탄소의 한계저감비용을 추정하였다. 기존의 방법론에서는 임의로 설정된 방향성 벡터가 한계저감비용 추정에 결정적인 역할을 하여 선택된 방향성 벡터에 따라 한계저감 비용 추정치가 상당한 차이가 있음을 알 수 있다. 그리고 $45^{\circ}$의 방향성 벡터를 설정하는 경우에는 실제 이산화탄소 배출량 수준과는 다른 배출량 수준에서의 한계저감비용을 추정하게 되지만 본 연구에서 제안한 방법론에 의하여 추정된 한계저감비용은 실제 이산화탄소 배출량 수준에서 한계저감비용을 추정하여 보다 더 현실을 정확하게 반영하는 추정치이다. 새로운 방법론을 서유럽 국가에 적용하여 추정한 이산화탄소의 한계저감비용은 기존 방법론을 사용하는 경우에 비하여 적은 것으로 추정되었다.

베이지안 다특성(多特性) 단축(短縮) 샘플링 검사 방식의 설계 (Bayesian Multiattribute Acceptance Sampling Plans under Curtailed Inspection)

  • 이종성
    • 산업기술연구
    • /
    • 제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.

  • PDF

그래프마이닝을 활용한 빈발 패턴 탐색에 관한 연구 (A Methodology for Searching Frequent Pattern Using Graph-Mining Technique)

  • 홍준석
    • Journal of Information Technology Applications and Management
    • /
    • 제26권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.