• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.700-702
• /
• 2005

본 논문에서는 대규모 베이지안 망을 빠른 시간 안에 학습하기 위한 방법으로, 클러스터링을 이용한 방법을 제안한다. 제안하는 방법은 베이지안 구조 학습에 있어서 DAG(Directed Acyclic Graph)를 탐색하는 영역을 제한하기 위해 클러스터링을 사용한다. 기존의 베이지안 구조 학습 방법들이 고려하는 후보 DAG의 수가 전체 노드 수에 의해 제한되는 데 반해, 제안되는 방법에서는 미리 정해진 클러스터의 최대 크기에 의해 제한된다. 실험 결과를 통해, 제안하는 방법이 기존의 대규모 베이지안 망 학습에 활용되었던 SC(Sparse Candidate) 방법 보다 훨씬 적은 수의 후보 DAG만을 고려하였음에도 불구하고, 비슷한 정도의 정확도를 나타냄을 보인다.

• Journal of Nutrition and Health
• /
• v.31 no.1
• /
• pp.21-27
• /
• 1998

The objective of this study was to observe the effect of dietary calcium(Ca) level on colonic mucosal levels of cell proliferation, 1, 2-diacylglycerol(DAG), TXB2, PGE2 and phospholipid fatty acid composition which have been known as biomarkers for colon cancer. One hundred male Sprague Dawley rats, at 7 weeks of age, were divided into two fat type groups. Each group of which was further divided into two Ca level groups. Each rt was intramuscularly injected with 1, 2,-dimenthylhydrazine(DMH) for 6 weeks (total dose of 180mg/kg body weight) and simultaneously fed one of four experimental diets containing 15% dietary fat(corn oil or perilla oil )and 0.3% or 1.0% Ca by weight for 20 weeks. Compared to corn oil, perilla oil significantly reduced cell proliferation by decreasing labeling index, proliferating zone, crypt length in colonic mucosa and colonic mucosa and colonic mucosal levels of DAG, TXB2 . PGE2 and phospolipid (PL) arachidonic acid distribution. The effect of Ca on biomarketrs was different depending on the type of dietary fat comsumed . Ca effect of Ca on biomarkers was different depending on the type of dietary fat comsumed. Ca effect was not significantly shown in the PO group, but it was significant in the CO group in which high Ca(1.0%) decreased the levels of levels of PL-C20 : 4(%), DAG and PGE2 . However , high Ca supplementation had shown only the trends of improving cell proliferation. Overall , high dietary Ca significantly reduced cell proliferation by inhibiting the synthesis of eicosanoid and DAG with reduced distribution of PL-C20 : 4 , which may have resulted in lower activation of PKC through reduced signal transduction. Since a high level of dietary Ca was more effective in reducing the risk factor against colon cancer in corn oil fed rats, it could be suggested that a higher amount of dietary Ca be consumed , especially when more vegetable oil rich in linoleic acid is included in the diet.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.9-17
• /
• 1999

In this paper, we propose a new technology mapping algorithm for CPLD 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 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. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces delay time and the number of CLBs much more than the existing tools of technology mapping algoritm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.135-145
• /
• 2010

Efficient Directed Acyclic Graph(DAG) scheduling is critical for achieving high performance in Distributed Heterogeneous computing System(DHCS). In this paper, we present a new high-performance scheduling algorithm, called the LCFT(Levelized Critical First Task) algorithm, for DHCS. The LCFT algorithm is a list-based scheduling that uses a new attribute to efficiently select tasks for scheduling in DHCS. The complexity of LCFT is $O(\upsilon+e)(p+log\;\upsilon)$. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithms such as PETS, HPS, HCPT and GCA in terms of the schedule length and SpeedUp. The comparison studies show that LCFT significantly outperforms PETS, HPS, HCPT and GCA in schedule length, SpeedUp.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.49-57
• /
• 2005

In this paper. a CLB-based CPLD low power technology mapping algorithm for trade-off is proposed. To perform low power technology mapping for CPLD, a given Boolean network has to be represented to DAG. The proposed algorithm consists of three step. In the first step, TD(Transition Density) calculation have to be Performed. Total power consumption is obtained by calculating switching activity of each nodes in a DAG. In the second step, the feasible clusters are generated by considering the following conditions : the number of output. the number of input and the number of OR-terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. The proposed algorithm is examined by using benchmarks in SIS. In the case that the number of OR-terms is 5, the experiments results show reduction in the power consumption by 30.73$\%$ comparing with that of TEMPLA, and 17.11$\%$ comparing with that of PLAmap respectively

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.35-46
• /
• 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 Cl.B. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time much more than the TMCPLD.

• Korean Journal of Food Science and Technology
• /
• v.36 no.2
• /
• pp.211-216
• /
• 2004

Mono-and diacylglycerol-enriched oil was produced from corn oil through enzymatic glycerolysis using 1,3-specific immobilized lipase in solvent-free system and stirred-tank batch reactor. HPLC analysis revealed enriched oil was respectively composed of: 45.05, 16.27, 23.05, and 14.98% triacylglycerol, 1,3-diacylglycerol, 1,2-diacylglycerol, and monoacylglycerol; 13.21, 0.15, 2.02, 34.36, 49.12, and 1.14 mol% palmitic, palmitoleic, stearic, oleic, linoleic, and linolenic acids; and 0.014, 0.029, 0.010 and 0.053% ${\alpha},\;{\gamma},\;{\delta}-$, and total tocopherols. Physiochemical and melting properties of enriched oil were evaluated. Oxidative stability study revealed enriched oil showed higher peroxide and p-anisidine values than corn oil. Rosemary extracts (100 to 300 ppm) reduce oxidation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.316-318
• /
• 2005

무선 ad-hoc 네트워크는 중앙 집중화된 관리 시스템이나 지원 서비스 없이 동적으로 임시 네트워크를 구성하는 이동 호스트(MH)들의 집합이다. 이러한 네트워크는 백본 호스트나 다른 MH로의 연결을 제공하기 위한 고정된 제어장치를 갖지 않으며, 각 MH가 라우터로 동작하며 전달받은 패킷을 다른 MH로 전달한다. 이러한 무선 ad-hoc 네트워크에서 단순히 최선의 서비스만을 제공하던 기존의 방법과 달리, 많은 사용자가 요구하는 QoS 서비스를 지원하기 위하여 기존 네트워크를 효율적으로 최대 활용하는 방안에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 무선 ad-hoc 네트워크 내에서 QoS 서비스를 제공하기 위한 기법으로 각각의 이동 호스트들은 QoS DAG 그래프를 유지하며 이러한 그래프를 바탕으로 만들어진 QoS 정보 패킷을 이웃 이동 호스트들에게 지역 브로드캐스트 함으로써 전역적인 QoS 정보의 검색과 운용없이, 유용한 QoS 정보를 전역적으로 각 이동 호스트가 유지할 수 있고 이를 바탕으로 효율적인 QoS 라우팅이 수행되어지는 기법이다.

• Journal of Animal Science and Technology
• /
• v.55 no.4
• /
• pp.303-314
• /
• 2013

Knowledge regarding lipid catabolism has been of great interest in the field of animal sciences. In the livestock industry, excess fat accretion in meat is costly to the producer and undesirable to the consumer. However, intramuscular fat (marbling) is desirable to enhance carcass and product quality. The manipulation of lipid content to meet the goals of animal production requires an understanding of the detailed mechanisms of lipid catabolism to help meticulously design nutritional, pharmacological, and physiological approaches to regulate fat accretion. The concept of a basic system of lipases and their co-regulators has been identified. The major lipases cleave triacylglycerol (TAG) stored in lipid droplets in a sequential manner. In adipose tissue, adipose triglyceride lipase (ATGL) performs the first and rate-limiting step of TAG breakdown through hydrolysis at the sn-1 position of TAG to release a non-esterified fatty acid (NEFA) and diacylglycerol (DAG). Subsequently, cleavage of DAG occurs via the rate-limiting enzyme hormone-sensitive lipase (HSL) for DAG catabolism, which is followed by monoglyceride lipase (MGL) for monoacylglycerol (MAG) hydrolysis. Recent identification of the co-activator (Comparative Gene Identification-58) and inhibitor [G(0)/G(1) Switch Gene 2] of ATGL have helped elucidate this important initial step of TAG breakdown, while also generating more questions. Additionally, the roles of these lipolysis-related enzymes in muscle, liver and skin tissue have also been found to be of great importance for the investigation of systemic lipolytic regulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.