• 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 Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.80-89
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the$^1$costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that it fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs by 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.224-234
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, 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. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, 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. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.8
• /
• pp.2253-2280
• /
• 2024

In the upcoming era of transportation, a groundbreaking technology, known as vehicle-to-everything (V2X) communication, is poised to redefine our driving experience and revolutionize traffic management. Real-time and secure communication plays a pivotal role in V2X networks, with the decision-making process being a key factor in establishing communication and determining malicious nodes. The proposed framework utilizes a directed acyclic graph (DAG) to facilitate real-time processing and expedite decision-making. This innovative approach ensures seamless connectivity among vehicles, the surrounding infrastructure, and various entities. To enhance communication efficiency, the entire roadside unit (RSU) region can be subdivided into various sub-regions, allowing RSUs to monitor and govern each sub-region. This strategic approach significantly reduces transaction approval time, thereby improving real-time communication. The framework incorporates a consensus mechanism to ensure robust security, even in the presence of malicious nodes. Recognizing the dynamic nature of V2X networks, the addition and removal of nodes are aligned. Communication latency is minimized through the deployment of computational resources near the data source and leveraging edge computing. This feature provides invaluable recommendations during critical situations that demand swift decision-making. The proposed architecture is further validated using the "veins" simulation tool. Simulation results demonstrate a remarkable success rate exceeding 95%, coupled with a significantly reduced consensus time compared to prevailing methodologies. This comprehensive approach not only addresses the evolving requirements of secure V2X communication but also substantiates practical success through simulation, laying the foundation for a transformative era in transportation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.831-832
• /
• 2017

링크드오픈데이터를 통해 다양한 분야의 RDF 데이터가 공개되고 있으며 그 양이 지속적으로 증가하고 있다. RDF 데이터는 그래프 형태이기 때문에 대용량 RDF 데이터를 효율적으로 관리하기 위한 그래프 데이터베이스에 대한 연구가 중요하다. 2개의 RDF 리소스가 그래프 상에서 연결됐는지 여부를 알아내는 기능은 RDF 요소간 연관관계를 식별하는 데에 관련이 있기 때문에 그래프 데이터베이스의 중요한 기능 중 하나이다. 대용량 그래프 데이터에 대한 그래프 도달가능성을 빠르게 처리하기 위해서 2-Hop 레이블링 변형들이 제안됐다. 최근에 2-Hop 레이블 크기를 줄이기 위해 2-Hop 레이블링이 진행되기 전에 노드 아이디를 부여하는 방법이 제안됐다. 하지만 그래프의 지역 정보만을 활용하기 때문에 복잡한 형태의 그래프에 대해서는 비효율적이라는 문제점이 있다. 본 논문에서는 그래프의 전역 정보를 반영할 수 있는 Topological Sort를 활용한 노드 아이디 부여 기법에 대한 설계를 제안한다.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.135-148
• /
• 2000

In this paper, we present a linear scheduling method for homogeneous multiprocessor systems using genetic algorithms. In general, genetic algorithms randomly generate initial strings, which leads to long operation time and slow convergence due to an inappropriate initialization. The proposed algorithm considers communication costs among processors and generates initial strings such that successive nodes are grouped into the same cluster. In the crossover and mutation operations, the algorithm maintains linearity in scheduling by associating a node with its immediate successor or predecessor. Linear scheduling can fully utilize the inherent parallelism of a given program and has been proven to be superior to nonlinear scheduling on a coarse grain DAG (directed acyclic graph). This paper emphasizes the usability of the genetic algorithm for real-time applications. Simulation results show that the proposed algorithm rapidly converges within 50 generations in most DAGs.

• The Korean Journal of Physiology and Pharmacology
• /
• v.5 no.4
• /
• pp.287-297
• /
• 2001

Contraction of smooth muscle is initiated by an increase in cytosolic $Ca^{2+}$ leading to activation of $Ca^{2+}$/ calmodulin-dependnet myosin light chain (MLC) kinase and phosphorylation of MLC. The types of contraction and signaling mechanisms mediating contraction differ depending on the region. The involvement of these different mechanisms varies depending on the source of $Ca^{2+}$ and the kinetic of $Ca^{2+}$ mobilization. $Ca^{2+}$ mobilizing agonists stimulate different phospholipases $(PLC-{\beta},\;PLD\;and\;PLA_2)$ to generate one or more $Ca^{2+}$ mobilizing messengers $(IP_3\;and\;AA),$ and diacylglycerol (DAG), an activator of protein kinase C (PKC). The relative contributions of $PLC-{\beta},\;PLA_2$ and PLD to generate second messengers vary greatly between cells and types of contraction. In smooth muscle cell derived form the circular muscle layer of the intestine, preferential hydrolysis of $PIP_2$ and generation of $IP_3$ and $IP_3-dependent\;Ca^{2+}$ release initiate the contraction. In smooth muscle cells derived from longitudinal muscle layer of the intestine, preferential hydrolysis of PC by PLA2, generation of AA and AA-mediated $Ca^{2+}$ influx, cADP ribose formation and $Ca^{2+}-induced\;Ca^{2+}$ release initiate the contraction. Sustained contraction, however, in both cell types is mediated by $Ca^{2+}-independent$ mechanism involving activation of $PKC-{\varepsilon}$ by DAG derived form PLD. A functional linkage between $G_{13},$ RhoA, ROCK, $PKC-{\varepsilon},$ CPI-17 and MLC phosphorylation in sustained contraction has been implicated. Contraction of normal esophageal circular muscle (ESO) in response to acetylcholine (ACh) is linked to $M_2$ muscarinic receptors activating at least three intracellular phospholipases, i.e. phosphatidylcholine-specific phospholipase C (PC-PLC), phospholipase D (PLD) and the high molecular weight (85 kDa) cytosolic phospholipase $A_2\;(cPLA_2)$ to induce phosphatidylcholine (PC) metabolism, production of diacylglycerol (DAG) and arachidonic acid (AA), resulting in activation of a protein kinase C (PKC)-dependent pathway. In contrast, lower esophageal sphincter (LES) contraction induced by maximally effective doses of ACh is mediated by muscarinic $M_3$ receptors, linked to pertussis toxin-insensitive GTP-binding proteins of the $G_{q/11}$ type. They activate phospholipase C, which hydrolyzes phosphatidylinositol bisphosphate $(PIP_2),$ producing inositol 1, 4, 5-trisphosphate $(IP_3)$ and DAG. $IP_3$ causes release of intracellular $Ca^{2+}$ and formation of a $Ca^{2+}$-calmodulin complex, resulting in activation of myosin light chain kinase and contraction through a calmodulin-dependent pathway.