• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.134-142
• /
• 2012

This paper analyze an LDPC code replication method suitable for cloud computing. First, we determine the number of blocks suitable for cloud computing through analysis of the performance for the file availability and storage overhead. Also we determine the type of LDPC code appropriate for cloud computing through the performance for three types of LDPC codes. Finally we present the graph random generation method and the comparing method of each generated LDPC code's performance by the iterative decoding process. By the simulation, we confirmed the best graph's regularity is left-regular or least left-regular. Also, we confirmed the best graph's total number of edges are minimum value or near the minimum value.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Journal of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1199-1211
• /
• 2013

We introduce a new class of graphs, called quasi $m$-Cayley graphs, having good symmetry properties, in the sense that they admit a group of automorphisms G that fixes a vertex of the graph and acts semiregularly on the other vertices. We determine when these graphs are strongly regular, and this leads us to define a new algebro-combinatorial structure, called quasi-partial difference family, or QPDF for short. We give several infinite families and sporadic examples of QPDFs. We also study several properties of QPDFs and determine, under several conditions, the form of the parameters of QPDFs when the group G is cyclic.

• Journal of Korean Elementary Science Education
• /
• v.31 no.3
• /
• pp.321-333
• /
• 2012

The purpose of this study was to examine elementary school students' characteristics and difficulties in drawing and interpreting a line graph, and to present educational implications. Twenty five students(4th grader: 6, 5th grader: 9, and 6th grader: 10) at an elementary school participated in this study. We used a student's task which was about graphing on a given data table and interpreting his/her graph. The data table was on heating 200mL and 500mL of water and measuring their temperature at regular time intervals. We collected multiple source of data, and data analyzed based on the sub-variables of TOGS. The some results of this study are as follows: First, five children (20.0%), especially two of 10 sixth graders (20.0%), could not construct a line graph about a given data table. Second, twenty students (80.0%) had the ability on 'Scaling axes' and on 'Assigning variables to the axes', however, only a student understood why the time is on the longitudinal axis and the temperature is on the vertical axis. Third, in the case of 'Plotting points', twelve children (48.0%) could drew two graphs on a coordinate. Fourth, in the case of 'Selecting the corresponding value for Y (or X)', twenty student had little difficulty. on 'Describing the relationship between variables', seventeen students (68.0%) understood the relationship between time and temperature of water, and the relationship between temperature and amount of water. Finally, eleven students (44%) had the ability on 'Interrelating and extrapolation graphs.' Educational implications are also presented in this paper.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.276-281
• /
• 2011

This paper presents a method of constructing the switching function using edge-valued decision diagrams. The proposed method is as following. The edge-valued decision diagram is a new data structure type of decision diagram which is recently used in constructing the digital logic systems based on the graph theory. Next, we apply edge-valued decision diagram to function minimization of digital logic systems. The proposed method has the visible, schematic and regular properties.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.213-217
• /
• 2004

This paper presents a method of constructing the digital logic systems(DLS) using edge-valued decision diagrams(EVDD). The proposed method is as following. The EVDD is a new data structure type of decision diagram(DD) that is recently used in constructing the digital logic systems based on the graph theory. Next, we apply EVDD to function minimization of digital logic systems. The proposed method has the visible, schematical and regular properties.

• Kyungpook Mathematical Journal
• /
• v.61 no.1
• /
• pp.155-168
• /
• 2021

We express the Seidel Laplacian polynomial and Seidel signless Laplacian polynomial of a graph in terms of the Seidel polynomials of induced subgraphs. Further, we determine the Seidel Laplacian polynomial and Seidel signless Laplacian polynomial of the join of regular graphs.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.409-419
• /
• 2015

The concept of Cayley-symmetric semigroups is introduced, and several equivalent conditions of a Cayley-symmetric semigroup are given so that an open problem proposed by Zhu [19] is resolved generally. Furthermore, it is proved that a strong semilattice of self-decomposable semigroups $S_{\alpha}$ is Cayley-symmetric if and only if each $S_{\alpha}$ is Cayley-symmetric. This enables us to present more Cayley-symmetric semi-groups, which would be non-regular. This result extends the main result of Wang [14], which stated that a regular semigroup is Cayley-symmetric if and only if it is a Clifford semigroup. In addition, we discuss Cayley-symmetry of Rees matrix semigroups over a semigroup or over a 0-semigroup.

• Korean journal of applied entomology
• /
• v.17 no.2 s.35
• /
• pp.81-87
• /
• 1978

Late blight incited by Phytophthora infestans (Mont.) de Bary, is an important problem for seed potato prodcution in Korea. At the alpine Daekwanryeong area, unprotected potatoes are often defoliated within 14 days after late blight is first observed in the field. Since regular spraying can control late blight, the forecasting service is needed for timely initiation of the spraying program. Climatological data and notes on late blight incidence were recorded during 1970-1977 at the Alpine Experiment Station. The moving graph method using 7-day average mean temperature and 7-day total rainfall did not give highly accurate forecasts. Adding data on relative humidity and 7-day average minimum temperature increased the usefulness of the moving graph. Yields of late blight susceptible varietieties in sprayed plots were related to late blight occurrence and to the rainfall distribution pattern.

• Journal of Wetlands Research
• /
• v.15 no.3
• /
• pp.397-406
• /
• 2013

Wetland conservation plan has been established to protect ecologically important wetlands based on vegetation integrity, spatial distribution of endangered species, but recently more demands are concentrated on the landscape ecological approaches such as topological relationship, neighboring area, spatial arrangements between wetlands at the broad scale. Landscape ecological analysis and graph theory are conducted to identify spatial characteristics related to core nodes and weak links of wetland networks in Nakdong basin. Regular planar model, which is selected for wetland networks, is applied in the Nakdong basin. The analysis indicates that 5 regional groups and 4 core wetlands are extracted with 15km threshold distance. The IIC and PC values based on the binary and probability models suggest that the wetland group C composed of main stream of Nakdong river and Geumho river is the most important area for wetland network. Wetland conservation plan, restoration projected of damaged and weak links between wetlands should be proposed through evaluating the node, links, and networks from wetlands at the local to the regional scale in Nakdong basin.