• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.295-309
• /
• 2020

Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2865-2870
• /
• 2015

Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.26-31
• /
• 2005

In this paper, we present the document summarizers which are simpler and more condense than the existing ones generally used in the web search engines. This method is a statistic-based summarization method using the concept of the complete graph. We suppose that each sentence as a vertex and the similarity between two sentences as a link of the graph. We compare this summarizer with those of Clustering and MMR techniques which are well-known as the good summarization methods. For the comparison, we use FScore using the summarization results generated by human subjects. Our experimental results verify the accuracy of this method, being about $30\%$ better than the others.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.09a
• /
• pp.60-68
• /
• 2010

In this study, the seepage flow monitoring method by hydaulic head loss rate graph was developed for the purpose of monitoring the seepage flow from the see side or from the lake on sea dike in which seepage force was varied periodically. The hydraulic head loss rate was defined in this method. The value of the rate is in the range from 0 to 1. the value of 0 means perfectly free flow of seepage. the value of 1 means perfect waterproofing. The value of coefficient of determination in the hydraulic head loss rate graph closer to 1 means that the seepage flow way is stable. The value of coefficient of determination in the hydraulic head loss rate graph closer to 0 means that the hole may exist or the piping may be in the progress. The pore water pressure data measured in Saemangeum sea dike was analyzed with the developed method The result showed that the variation of seepage flow state was detected sensitively by this method and the interception effect of sea dike could be estimated quantitatively.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.65-72
• /
• 1998

Many optimization problems like domination and Steiner tree are NP-complete on chordal graphs but can be solved in polyno-mial time on doubly chordal graphs. Investigating properties of dou-bly chordal graphs probably help to design efficient algorithms for the graphs. We present some characterizations of dobly chordal graphs which are based on clique matrices and neighborhood matrics also men-tioned how a doubly perfect elimination ordering of a doubly chordal graph can be computed from the results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.421-433
• /
• 2015

Recently, there have been fast-growing social network services based on the Internet environment and web technology development, the prevalence of smartphones, etc. Social networks also allow the users to convey the information and news so that they have a great influence on the public opinion formed by social interaction among users as well as the spread of information. On the other hand, these social networks also serve as perfect environments for rampant malware. Malware is rapidly being spread because relationships are formed on trust among the users. In this paper, an effective patch strategy is proposed to deal with malicious worms based on social networks. A graph is formed to analyze the structure of a social network, and subgroups are formed in the graph for the distributed patch strategy. The weighted directions and activities between the nodes are taken into account to select reliable key nodes from the generated subgroups, and the Incremental PageRanking algorithm reflecting dynamic social network features (addition/deletion of users and links) is used for deriving the high influential key nodes. With the patch based on the derived key nodes, the proposed method can prevent worms from spreading over social networks.

• Journal of Gifted/Talented Education
• /
• v.21 no.2
• /
• pp.269-286
• /
• 2011

The purpose of this thesis is to examine difficulties students face in the inquiry activities of quadratic surface throughout mathematically gifted students' analogical inference and the influence of Cabri 3D in students' inquiry activities. For this examination, students' inquiry activities were observed, data of inferring quadratic surface process was analyzed, and students were interviewed in the middle of and at the end of their activities. The result of this thesis is as following: First, students had difficulties to come up with quadratic surfaced graph in the inquiry activity of quadratic surface and express the standard type equation. Secondly, students had difficulties confirming the process of inferred quadratic surface. Especially, students struggled finding out the difference between the inferred quadratic surface and the existing quadratic surface and the cause of it. Thirdly, applying Cabri 3D helped students to think of quadratic surface graph, however, since it could not express the quadratic surface graph in a perfect form, it is hard to say that Cabri 3D is helpful in the process of confirming students' inferred quadratic surface.

• Journal of Internet Computing and Services
• /
• v.20 no.1
• /
• pp.125-133
• /
• 2019

Company A should maintain myriad conversion tools for the purpose of making a geometric compilation of navigation maps. Company A is already using complex compilation tools, which are tailored to geographical areas and various GPS models. However, due to frequent requirement and personnel changes, there is an endless challenge for perfect tool configuration and multiple map consolidation. To solve this problem, Company A launched a process automation project using Graphviz, which is an open source workflow graph visualization software. Before implementation, they had to document their current map compilation processes and then match it with the applicable conversion tool. For effective representation of process controls, a new graphical process notation is designed, i.e. Y Block diagram. The authors will compare Y Block diagram with other process notations and explain why Y Block diagram is more useful for tool based business processes such as digital map generation processes.

• Journal of the Korean School Mathematics Society
• /
• v.16 no.4
• /
• pp.883-898
• /
• 2013

The purpose of this study is to examine that high school students recognize mathematical situation when they are requested for changing identical mathematics situations into different situations. The results of the study are followings. First, percentage of correct answers to the questions of turning equal mathematical situation into function is higher than the one of turning equal mathematical situation into equation and inequality. As a result of individual interview for comprehensibility of the students on these relations, it is found that if degree goes up and there is different expressions of questionaries although mathematical situation is identical, it affects comprehensibility of the subjects. Second, we found that they cannot understand identical mathematics situations because they have trouble in drawing graph or applying to get the answer while many students understand a point of intersection on the graph as a correct answer. Third, As a result of individual interview for comprehensibility of the students on relation between equation, inequality and function, we found that students manage to get correct answer even without perfect comprehensibility on this relation.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.12
• /
• pp.889-898
• /
• 2022

In this paper, parallel computing method on the three-dimensional electromagnetic field is proposed. The present electromagnetic scattering analysis is conducted based on the time-harmonic vector wave equation and the finite element method. The edge-based element and 2^nd -order absorbing boundary condition are used. Parallelization of the elemental numerical integration and the matrix assemblage is accomplished by allocating the partitioned finite element subdomain for each processor. The graph partitioning library, METIS, is employed for the subdomain generation. The large sparse matrix computation is conducted by MUMPS, which is the parallel computing library based on the multi-frontal method. The accuracy of the present program is validated by the comparison against the Mie-series analytical solution and the results by ANSYS HFSS. In addition, the scalability is verified by measuring the speed-up in terms of the number of processors used. The present electromagnetic scattering analysis is performed for a perfect electric conductor sphere, isotropic/anisotropic dielectric sphere, and the missile configuration. The algorithm of the present program will be applied to the finite element and tearing method, aiming for the further extended parallel computing performance.