• Title/Summary/Keyword: DAG

Search Result 215, Processing Time 0.029 seconds

Preparation of Diacylglycerol from Lard by Enzymatic Glycerolysis and Its Compositional Characteristics

  • Diao, Xiaoqin;Guan, Haining;Kong, Baohua;Zhao, Xinxin
    • Food Science of Animal Resources
    • /
    • v.37 no.6
    • /
    • pp.813-822
    • /
    • 2017
  • The aim of this study was to prepare diacylglycerol (DAG) by enzymatic glycerolysis of lard. The effects of reaction parameters such as lipase type, reaction temperature, enzyme amount, substrate molar ratio (lard/glycerol), reaction time, and magnetic stirring speed were investigated. Lipozyme RMIM was found to be a more active biocatalyst than Novozym 435, and the optimal reaction conditions were 14:100 (W/W) of enzyme to lard substrate ratio, 1:1 of lard to glycerol molar ratio, and 500 rpm magnetic stirring speed. The reaction mixture was first incubated at $65^{\circ}C$ for 2 h and then transferred to $45^{\circ}C$ for 8 h. At the optimum reaction conditions, the conversion rate of triacylglycerol (TAG) and the content of DAG in the reaction mixture reached 76.26% and 61.76%, respectively, and the DAG content in purified glycerolized lard was 82.03% by molecular distillation. The distribution of fatty acids and Fourier transform infrared spectra in glycerolized lard samples were similar to those in lard samples. The results revealed that enzymatic glycerolysis and molecular distillation can be used to prepare more highly purified DAG from lard.

Development of CPLD Technology Mapping Algorithm Improving Run-Time under Time Constraint (시간제약 조건하에서 수행시간을 개선한 CPLD 기술 매핑 알고리즘 개발)

  • 윤충모;김희석
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.15-24
    • /
    • 1999
  • In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result. it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB.

  • PDF

Fault-Tolerant Adaptive Routing : Improved RIFP by using SCP in Mesh Multicomputers (적응적 오류 허용 라우팅 : SCP를 이용한 메쉬 구조에서의 RIFP 기법 개선)

  • 정성우;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.603-609
    • /
    • 2003
  • Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

Effects of TPA and IAA on Corn Coleoptile Elongation (옥수수 자엽초의 신장에 미치는 TPA와 IAA의 효과)

  • 정은수
    • Journal of Plant Biology
    • /
    • v.35 no.1
    • /
    • pp.77-84
    • /
    • 1992
  • In view of the well-established role of protein kinase C effector element in signal transduction of animal systems, the possibility of diacylglycerol (DAG) and its analog 12-O-tetradecanoylphorbol13-acetate (TPA) having an effect on auxin-induced growih of com coleoptiles was explored. Both DAG and TP A were found to promote cell elongation in the coleoptile tissue_ Treatment of tissue with these protein kinase C-activating agents resulted in increase in the growth rate over the control by about 300%. When 1M was applied to TPA-pretreated coleoptiles. auxin effect appeared synergistic. Morever. coleoptile growth was found to be inhibited by staurosporine and methylated TPA, both of which are known to specifically inhibit protein kinase C. Electrophoretic and autoradiographic patterns of soluble proteins from the coeoptiles indicated that either 1M or TPA tereatment resulted in increased phosphorylation of certain proteins of 205 Kd. 66 Kd and 32 Kd in size. The results obtained from the present work suggest that protein kinase C may be associated with auxin action on cell elongation in the corn coleoptile segments.gments.

  • PDF

Compositional Changes of Functional Oil from Algae Oil during the Lipase-Catalyzed Production (Algae유로부터 디글리세롤 함유 기능성 유지의 효소적 합성 중 구성성분 변화에 관한 연구)

  • Cho, Eun-Jin;Cho, Kyung-Hyun;Lee, Ki-Teak
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.34 no.7
    • /
    • pp.1059-1063
    • /
    • 2005
  • In the absence of organic solvent, di- and mono-acylglycerol enriched functional oil was produced by lipase-catalyzed glycerolysis in a stirred tank batch reactor. After glycerolysis for 48 hr, functional oil consisted of $47.1\%\;TAG,\;33.6\%\;DAG,\;and\;18.7\%$ MAG. In MAG and DAG, docosahexaenoic acid was found as $10.7\%\;and\;8.1\%$, respectively. During the reaction, total tocopherol content decreased, and $0.065\%$ tocopherols were existed in the functional oil produced after 48hr reaction.

A Study on Crack Fault Diagnosis of Wind Turbine Simulation System (풍력발전기 모사 시스템에서의 균열 결함 진단에 대한 연구)

  • Bae, Keun-Ho;Park, Jong-Won;Kim, Bong-Ki;Choi, Byung-Oh
    • Journal of Applied Reliability
    • /
    • v.14 no.4
    • /
    • pp.208-212
    • /
    • 2014
  • An experimental gear-box was set-up to simulate the real situation of the wind-turbine. Artificial cracks of different sizes were machined into the gear. Vibration signals were acquired to diagnose the different crack fault conditions. Time-domain features such as root mean square, variance, kurtosis, normalized 6th central moments were used to capture the characteristics of different crack conditions. Normal condition, 1 mm crack condition, 2mm crack condition, 6mm crack condition, and tooth fault condition were compared using ANFIS and DAG-SVM methods, and three different DAG-SVM models were compared. High-pass filtering improved the success rates remarkably in the case of DAG-SVM.

An Automatic Generation of XML Syntax Directed Editor (XML 구문 지향 편집기의 자동 생성)

  • 박호병;조용윤;신경희;김영철;유재우
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04b
    • /
    • pp.349-351
    • /
    • 2002
  • XML문서를 작성하는데 있어서 그 규칙이나 DTD에 익숙하지 않은 개발자에게 구문 지향 편집기는 효율적인 환경을 제공해 준다. 이러한 구문 지향 편집기를 생성하는 도구로서 Synthesizer Generator등이 잘 알려져 있는데, 사용자는 Synthesizer Generator를 위해 구문 지향 편집기 생성 정보 표현 언어인 SSL(Syntheizer Specification Language)을 직접 작성해야 한다. 본 연구는 웹 문서 표준인 XML 구문 지향 편집기를 자동 생성하기 위한 방법을 제안한다. 제안된 방법은 입력된 XML DTD를 AST 형태로 변경하여DAG(Directed Acyclic Graph)를 추출하는 DAG 변환기, 생성된 DAG를 SSL로 변환하기 위한 DAG 핸들러와 SSL 변환기 모듈 그리고 변환된 SSL을 이용해 XML 구문 지향 편집기를 자동 생성하기 위한 Synthesizer Generator 사창을 포함한다. SSL 변환기는 SSL문서를 자동 생성하기 위한 모듈로서 추상 구문변환 모듈 역 파싱(Unparsing scheme)모듈 변형 규칙(Transformation rule) 표현 모듈로 구성된다. 사용자는 SSL변환기와 Synthesizer Generator의 사용을 통해 SSL을 직접 코딩해야 하는 노력과 불필요한 학습시간을 줄이고 빠르고 정확한 XML 구문 지향 편집기를 생성하므로 효율적인 XML 문서 작성할 수 있다.

  • PDF

Isolation of the Agarolytic Bacterium Vibrio cyclotrophicus DAG-130 from Abalone Gut

  • Meinita, Maria Dyah Nur;Luyen, Hai-Quoc;Hwang, Seon-Yeong;Kang, Ji-Young;Jin, Deuk-Hee;Hong, Yong-Ki
    • Fisheries and Aquatic Sciences
    • /
    • v.11 no.2
    • /
    • pp.76-81
    • /
    • 2008
  • We isolated 1,916 strains of bacteria from gut and feces of abalone. The most active agarolytic bacterium, DAG-130, was identified from the gut of the abalone Haliotis gigantea. Of the bacteria harbored by both H. discus hannai and H. gigantea, 59% were agarolytic. There was no significant difference in the number of agarolytic bacteria isolated from abalone fed on the seaweeds Gelidium amansii, Laminaria japonica, or Undaria pinnatifida. Of the agarolytic bacteria, 72% were isolated from the guts of all sources tested while 43% came from the feces. The strain DAG-130 showed 100% identity with the bacterium Vibrio cyclotrophicus based on phylogenetic analysis of l6S rDNA. The bacterium produced monomers and oligomers from the agar substrate.

Essential Arcs of a Directed Acyclic Graph

  • Chung, Ee-Suk
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.121-126
    • /
    • 2007
  • Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

A Linear Clustering Method for the Scheduling of the Directed Acyclic Graph Model with Multiprocessors Using Genetic Algorithm (다중프로세서를 갖는 유방향무환그래프 모델의 스케쥴링을 위한 유전알고리즘을 이용한 선형 클러스터링 해법)

  • Sung, Ki-Seok;Park, Jee-Hyuk
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.4
    • /
    • pp.591-600
    • /
    • 1998
  • The scheduling of parallel computing systems consists of two procedures, the assignment of tasks to each available processor and the ordering of tasks in each processor. The assignment procedure is same with a clustering. The clustering is classified into linear or nonlinear according to the precedence relationship of the tasks in each cluster. The parallel computing system can be modeled with a Directed Acyclic Graph(DAG). By the granularity theory, DAG is categorized into Coarse Grain Type(CDAG) and Fine Grain Type(FDAG). We suggest the linear clustering method for the scheduling of CDAG using the genetic algorithm. The method utilizes a properly that the optimal schedule of a CDAG is one of linear clustering. We present the computational comparisons between the suggested method for CDAG and an existing method for the general DAG including CDAG and FDAG.

  • PDF