• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• Journal of the Korean Institute of Educational Facilities
• /
• v.24 no.4
• /
• pp.15-24
• /
• 2017

This paper aims to investigate in what extent subject-centered clusters are different from one another in terms of message system, which is composed of curriculum, pedagogy and evaluation. For this, Bernstein's pedagogic transmission code(i.e., classification and framing) and school typology(i.e., open-type or close-type) have been explored, and then applied into Shimin Junior School, Japan, in order to find out substantial characteristics between subject-centered clusters. In this case study, VGA(visibility graph analysis), as one of syntactical methodologies in space syntax theory, has been used to measure to what degree they are actually different. Throughout in-depth investigation of spatial configurations, it can be said that the square of clusters is strongly connected and integrated very well, so that it acts as an anchor place for school life within a cluster. However, it works in different ways according to message systems. In the subjects like Japanese and Science whose message system are characterized by strong classification and strong framing, integration values are relatively low, and this means that it is hard to expect cross-referencing activities through the subject squares. On the contrary, the subject of Social Studies defined by weak classification and weak framing shows the highest mean integration values, and this can be expected that there are inter-changeable learning activities in the square.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.6
• /
• pp.1309-1316
• /
• 2018

Cattle estrus detection system based on Internet of Things is designed and implemented by using Arduino pro-mini, gyroscope, acceleration sensor, bluetooth master and slave module. The implemented system measures cattle's moving and the measured data are transmitted to the computer connected to RX module by bluetooth TX module. They are plotted in 2-dimensional graph on the computer monitor and the number of transition at each sensor axis are calculated from the graph. The detected and gathered data from the system are analyzed by the proposed algorithm to decide which cows are in the estrus or not. The method to apply bluetooth scatternet is shown and the proposed system can be used to increase the success rate of artificial insemination in normal estrus by detecting the cow's behaviors such as the number of jumping. In this paper, the implemented cattle behavior detecting the system(TX module) are strapped on cattle's leg and it measures the cattle behaviors for determining where that a cattle is estrus or not by the proposed algorithm.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.1
• /
• pp.55-62
• /
• 2019

Hayakawa Kunihiko introduced community space as an open space in Housing in Japan for the first time. We can find the continuity of his architectural intent from his three works (Atrium, Steps, Labyrinth) during the early period of his Housing buildings, In particular, from Labyrinth, his intent was expanded to cities through 'Urban Void', seeking communication and harmony. Accordingly, based on the architectural overview and a field survey of Labyrinth, an analysis was conducted using Space Syntax to investigate whether the space of an inner courtyard is being used as a community space for neighbors who pass through the courtyard and whether the courtyard plays the role of 'Urban Void' as intended by the architect. For this investigation, according to VGA, the courtyard showed the role of great visual connectivity and integration and facilitated connections to the center of the entire space. On the other hand, according to J-Graph, the access stairway connected to each household from the courtyard helped secure privacy in the midst of common space. Step Depth noted that a hierarchy of space was formed to ensure visual privacy within each unit household in addition to privacy for each household.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.5
• /
• pp.28-41
• /
• 2022

A road system with CV(Connected Vehicle)s, which is often referred to as a cooperative intelligent transportation system (C-ITS), provides various road information to drivers using an in-vehicle warning system. Road environments with CVs induce drivers to reduce their speed or change lanes to avoid potential risks downstream. Such avoidance maneuvers can be considered to improve driving behaviors from a traffic safety point of view. Thus, empirically evaluating how a given in-vehicle warning information affects driving behaviors, and monitoring of the correlation between them are essential tasks for traffic operators. To quantitatively evaluate the effect of in-vehicle warning information, this study develops a method to calculate compliance rate of drivers where two groups of speed profile before and after road information is provided are compared. In addition, conventional indexes (e.g., jerk and acceleration noise) to measure comfort of passengers are examined. Empirical tests are conducted by using PVD (Probe Vehicle Data) and DTG (Digital Tacho Graph) data to verify the individual effects of warning information based on C-ITS constructed in Seoul metropolitan area in South Korea. The results in this study shows that drivers tend to decelerate their speed as a response to the in-vehicle warning information. Meanwhile, the in-vehicle warning information helps drivers to improve the safety and comport of passengers.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.2
• /
• pp.55-64
• /
• 2000

In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{［2］}$, the proposed algorithm gives similar results with much less computation time.

• Journal of the Korean Solar Energy Society
• /
• v.29 no.2
• /
• pp.1-7
• /
• 2009

Use of the PV(photovoltaic) generation system is increased in such areas as remote mountain places or islands at which electrical energy is not serviced. The stand alone PV system is required the power storage products such as battery, fly wheel and super capacitor. Several lead storage batteries are connected in series to get high voltages. The life of lead storage battery is shortened when over charge or over discharge takes place. So, it is needed to control batteries not to be overcharged or be discharged deeply. Voltage of each battery was ignored in former control methods in which overall voltage was used to control charge or discharge battery. In this study, the charging and discharging voltage variations of sealed lead storage batteries with l2V/l.2A were investigated step by step experiments. The results of the test show that one should consider and specify the state of each battery to prevent overcharge or deep discharge. With the basis of the experiments, we designed a monitoring unit to monitor battery voltages simultaneously using micro-controller. The unit measures voltage of 20 batteries simultaneously and displays data on the color LCD monitor with curved line graph. It also sends data to PC using the RS232C communication port. The designed unit was adapted to stand alone PV system with 1kW capacity and lead storage batteries are connected to the PV generation system. The number of lead storage batteries was 10 in series and 12V/250Ah each. Resistive load with 3kW was used for discharging.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.349-355
• /
• 2016

For any integer $n{\geq}2$, each palindrome of n induces a circulant graph of order n. It is known that for each integer $n{\geq}2$, there is a one-to-one correspondence between the set of (resp. aperiodic) palindromes of n and the set of (resp. connected) circulant graphs of order n (cf. [2]). This bijection gives a one-to-one correspondence of the palindromes ${\sigma}$ with $gcd({\sigma})=1$ to the connected circulant graphs. It was also shown that the number of palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ is the same number of aperiodic palindromes of n. Let $a_n$ (resp. $b_n$) be the number of aperiodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). Let $c_n$ (resp. $d_n$) be the number of periodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). In this paper, we calculate the numbers $a_n$, $b_n$, $c_n$, $d_n$ in two ways. In Theorem 2.3, we $n_d$ recurrence relations for $a_n$, $b_n$, $c_n$, $d_n$ in terms of $a_d$ for $d{\mid}n$ and $d{\neq}n$. Afterwards, we nd formulae for $a_n$, $b_n$, $c_n$, $d_n$ explicitly in Theorem 2.5.