• Title/Summary/Keyword: Module sequence

Search Result 208, Processing Time 0.032 seconds

An Integrated Process Planning System and Finite Element Simulation for Multistage Cold Forging (유한요소해석을 통합한 다단 냉간단조 공정설계시스템)

  • 최재찬;김병민;이언호
    • Transactions of Materials Processing
    • /
    • v.4 no.1
    • /
    • pp.28-38
    • /
    • 1995
  • An integrated process planning system can determine desirable operation sequences even if they have little experience in the design of multistage cold forging process. This system is composed of seven major modules such as input module, pre-design module, formability check module, forming sequence design module, forming analysis module, FEM verification module, and output module which are used independently or in all. The forming sequence for the part can be determined by means of primitive geometries such as cylinder, cone, convex, and concave. By utilizing this geometrical characteristics(diameter, height, and radius), the part geometry is expressed by a list of the primitive geometries. Accordingly, the forming sequence design is formulated as the search problem which starts with a billet geometry and finishes with a given product one. Using the developed system, the sequence drawing with all dimensions, which includes the dimensional tolerances and the proper sequence of operations for parts, is generated under the environment of AutoCAD. Several forming sequences generated by the planning system can be checked by the forming analysis module. The acceptable forming sequences can be verified further, using FE simulation.

  • PDF

A Functional Design of Programmable Logic Controller Based on Parallel Architecture (병렬 구조에 의한 가변 논리제어장치의 기능적 설계)

  • 이정훈;신현식
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.8
    • /
    • pp.836-844
    • /
    • 1991
  • PLC(programmable logic controller) system is widely used for the control of factory. PLC system receives ladder diagram which is drawn by the user to implement hardware logic, converts the ladder diagram into sequence program which is executable in the PLC system, and executes the sequence program indefinitely unless user breaks. The sequence program processes the data of on/off signal, and endures 1 scan delay and missing of pulse-type signal shorter than a scan time. So, data dependency doesn't exist. By applying theis characteristics to multiprocessor architecture, we design parellel PLC functionally and evaluate performance upgrade. Parallel PLC consists of central processing module, N general processing unit, and a shared memory by master-slave type. Each module executes allocated sequence program by the control of central processing module. We can expect performance upgrade by parallel processing, and reliability by relocation of sequence program when error occurs in processing module.

  • PDF

An end-to-end synthesis method for Korean text-to-speech systems (한국어 text-to-speech(TTS) 시스템을 위한 엔드투엔드 합성 방식 연구)

  • Choi, Yeunju;Jung, Youngmoon;Kim, Younggwan;Suh, Youngjoo;Kim, Hoirin
    • Phonetics and Speech Sciences
    • /
    • v.10 no.1
    • /
    • pp.39-48
    • /
    • 2018
  • A typical statistical parametric speech synthesis (text-to-speech, TTS) system consists of separate modules, such as a text analysis module, an acoustic modeling module, and a speech synthesis module. This causes two problems: 1) expert knowledge of each module is required, and 2) errors generated in each module accumulate passing through each module. An end-to-end TTS system could avoid such problems by synthesizing voice signals directly from an input string. In this study, we implemented an end-to-end Korean TTS system using Google's Tacotron, which is an end-to-end TTS system based on a sequence-to-sequence model with attention mechanism. We used 4392 utterances spoken by a Korean female speaker, an amount that corresponds to 37% of the dataset Google used for training Tacotron. Our system obtained mean opinion score (MOS) 2.98 and degradation mean opinion score (DMOS) 3.25. We will discuss the factors which affected training of the system. Experiments demonstrate that the post-processing network needs to be designed considering output language and input characters and that according to the amount of training data, the maximum value of n for n-grams modeled by the encoder should be small enough.

Computer-Aided Process Planning System of Cold Forging and its Verification by F.E. Simulation (냉간단조 공정설계 시스템과 유한요소해석에 의한 검증)

  • Lee, E.H.;Kim, D.J.;Park, J.C.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.4
    • /
    • pp.43-52
    • /
    • 1996
  • This paper describes interactive computer procedures for design the forming sequences in cold forging. This system is implemented on the personal computer and its environment is a commercial AutoCAD system. The programming language. AutoLISP, was used for the configuration of the system. Since the process of metal forming can be considered as a transformation of geometry, treatment of the geometry of the part is a key in process planning. To recognize the part section geometry, the section entity representation, the section coordinate-redius representation and the section primitive geometru were adopted. This system includes six major modules such as input module, forging design module, forming sequence design module, die design module, FEM verification module and output module which are used independently or in all. The sequence drawing wigh all dimensions, which includes the dimensional tolerances and the proper sequence of operations, can generate under the environment of AutoCAD. The acceptable forming sequences can be verified further, using the FE simulation.

  • PDF

CHARACTERIZING S-FLAT MODULES AND S-VON NEUMANN REGULAR RINGS BY UNIFORMITY

  • Zhang, Xiaolei
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.3
    • /
    • pp.643-657
    • /
    • 2022
  • Let R be a ring and S a multiplicative subset of R. An R-module T is called u-S-torsion (u-always abbreviates uniformly) provided that sT = 0 for some s ∈ S. The notion of u-S-exact sequences is also introduced from the viewpoint of uniformity. An R-module F is called u-S-flat provided that the induced sequence 0 → A ⊗R F → B ⊗R F → C ⊗R F → 0 is u-S-exact for any u-S-exact sequence 0 → A → B → C → 0. A ring R is called u-S-von Neumann regular provided there exists an element s ∈ S satisfying that for any a ∈ R there exists r ∈ R such that sα = rα2. We obtain that a ring R is a u-S-von Neumann regular ring if and only if any R-module is u-S-flat. Several properties of u-S-flat modules and u-S-von Neumann regular rings are obtained.

Analytical System Development for Reinforced Tall Buildings with Construction Sequence (시공단계에 따른 철근콘크리트 고층건물의 해석시스템 개발)

  • Lee, Tae-Gyu
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.9
    • /
    • pp.410-417
    • /
    • 2013
  • Long-term behavior analysis considering construction sequence should be performed in the design and the actual construction of reinforced tall buildings. Most of the analytical studies on this subject, however, has not been applied directly to the structural design and the construction caused by the simple approach. As the axial force redistribution of shores and columns is time-dependent, the actual construction sequence with the placement of concrete, form removal, reshoring, shore removal, and the additional load application is very important. Object-oriented analysis program considering construction sequence, especially time-dependent deformation in early days, is developed. This system is composed of input module, database module, database store module, analysis module, and result generation module. Linkage interface between the central database and each of the related module is implemented by the visual c# concept. Graphic user interface and the relational database table are supported for user's convenience.

ESSENTIAL EXACT SEQUENCES

  • Akray, Ismael;Zebari, Amin
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.469-480
    • /
    • 2020
  • Let R be a commutative ring with identity and M a unital R-module. We give a new generalization of exact sequences called e-exact sequences. A sequence $0{\rightarrow}A{\longrightarrow[20]^f}B{\longrightarrow[20]^g}C{\rightarrow}0$ is said to be e-exact if f is monic, Imf ≤e Kerg and Img ≤e C. We modify many famous theorems including exact sequences to one includes e-exact sequences like 3 × 3 lemma, four and five lemmas. Next, we prove that for torsion-free module M, the contravariant functor Hom(-, M) is left e-exact and the covariant functor M ⊗ - is right e-exact. Finally, we define e-projective module and characterize it. We show that the direct sum of R-modules is e-projective module if and only if each summand is e-projective.

Performance Change of Crystalline Photovoltaic Module in Modified Test Sequence (복합 환경시험 순서에 따른 태양전지모듈의 특성 변화)

  • Kim, Kyung-Soo;Kang, Gi-Hwan;Yu, Gwon-Jong;Yoon, Soon-Gil
    • 한국태양에너지학회:학술대회논문집
    • /
    • 2011.04a
    • /
    • pp.23-24
    • /
    • 2011
  • In this paper, I performed the IEC test in crystalline photovoltaic module described in test standard. And sometimes I changed the test sequence and impact factors for testing modules. Comparing the current test trees in IEC 61215, some ideas are suggested in proper test sequence to guarantee the long-term durability for 25 years.. The detail discussion will be shown in the following paper.

  • PDF

A NOTE ON A DIFFERENTIAL MODULES

  • Lee, Chong Yun
    • The Mathematical Education
    • /
    • v.14 no.1
    • /
    • pp.22-26
    • /
    • 1975
  • In this paper, we define a differential module and study its properties. In section 2, as for propositions, Ive research some properties, directsum, isomorphism of factorization, exact sequence of derived modules. And then as for theorem, I try to present the following statement, if the sequence of homomorphisms of differential modules is exact. Then the sequence of homomorphisms of Z(X) is exact, also the sequence of homomorphisms of Z(X) is exact. According to the theorem, as for Lemma, we consider commutative diagram between exact sequence of Z(X) and exact sequence of Z'(X) . As an immediate consequence of this theorem, we obtain the following result. If M is an arbitrary module and the sequence of homomorphisms of the modules Z(X) is exact, then the sequence of their tensor products with the trivial endomorphism is semi-exact.

  • PDF

A Note on the Homomorphisms Between Modules

  • Kim, Doo Ho
    • The Mathematical Education
    • /
    • v.10 no.1
    • /
    • pp.4-5
    • /
    • 1972
  • 이 논문은 modules 사이의 homomorphisms의 exact sequence에서 다음과 같은 것을 밝힌 것임. 1. (equation omitted)이 하나의 exact sequence 이고 P가 임의의 R-module일 때 (equation omitted)은 abelian group의 하나의 exact sequence라는 것. 2. (equation omitted)이 exact sequence 이고 P가 임의의 R-modele이면 (equation omitted)는 abelian group의 하나의 exact sequence라는 것.

  • PDF