• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.375-382
• /
• 2017

We exhibit a one-to-one correspondence between 3-colored graphs and subarrangements of certain hyperplane arrangements denoted ${\mathcal{J}}_n$, $n{\in}{\mathbb{N}}$. We define the notion of centrality of 3-colored graphs, which corresponds to the centrality of hyperplane arrangements. Via the correspondence, the characteristic polynomial ${\chi}{\mathcal{J}}_n$ of ${\mathcal{J}}_n$ can be expressed in terms of the number of central 3-colored graphs, and we compute ${\chi}{\mathcal{J}}_n$ for n = 2, 3.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.488-491
• /
• 2011

For given g ${\geq}$ 3, this paper provides an O(1) time and O(n) space complexity algorithm for generation of biconnected rooted colored outerplanar graphs with face size bound g, where the graphs generated contain at most n vertices. The vertices are colored in such a way that each color has a corresponding degree bound. There is also a face size bound for each inner face of the graph. No duplications or isomorphic copies of a same graph are generated.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.105-115
• /
• 2011

Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

• Bulletin of the Korean Chemical Society
• /
• v.25 no.8
• /
• pp.1137-1142
• /
• 2004

A spectrophotometric and first derivative spectrophotometric method was developed in aquatic Tween 80 micellar solutions for selective determination of nickel without using any pre-separation step. 1-(2-Pyridylazo)-2-naphthol (PAN), as a sensitive chromogenic complexing agent formed a red-colored Ni(II)-PAN complex in Tween 80 media with satisfactory solubility and stability. Conditions such as pH, PAN concentration, type and concentration of micellizing agent were optimized. Molar absorptivity of Ni-PAN complex was found $4.62\;{\times}\;10^4L\;cm^{?1}\;mol^{?1}$ at 569 nm, under the optimum condition. Calibration graphs were derived by zero, first and second derivative spectrophotometry at maximum wavelengths of 569, 578 and 571 nm with linear ranges of 30-1800, 20-2500 and 30-2000 ng $mL^{?1}$ , respectively. Precision as standard deviation as well as accuracy as recovery percent were in the range of 1-20 ng $mL^{?1}$, and 93.3-103.3%, respectively, for the entire of the linear ranges. Spectrophotometric detection limit was 3 ng $mL^{?1}$ and effects of diverse ions on the first derivative determination of nickel were studied to investigate selectivity of the method. Interferences of cobalt and copper on the nickel determination were prevented using o-phenanthroline as masking agent. The recommended procedures were applied to the various synthetic and stainless steel alloys, tea leaves and human hair, with satisfactory results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.210-216
• /
• 2000

Place/Transition(P/T) nets has been used in protocol verification and concurrent system verification since it is suitable for describing concurrency and provides several well-established verification techniques. And it has been used as a base formalism for such high-level Petri nets as colored Petri nets, object-oriented Petri nets and etc. However, when analyzing complex models using P/T nets and P/T nets-based high-level Petri nets, there may be state explosion in reachability analysis due to improper handling of concurrency. In this paper, we define a structural concurrency in P/T nets, propose a partitioning algorithm based on the detected structural concurrency, and provide analysis techniques for such properties as boundedness of places and liveness of transitions, which are performed on compositional reachability graphs. The analysis techniques based on Petri net slices can be used in efficiently analyzing P/T nets-based high-level Petri net models as well as P/T net models.

• Bulletin of the Korean Chemical Society
• /
• v.25 no.3
• /
• pp.365-372
• /
• 2004

Two simple, rapid and sensitive spectrophotometric methods for the determination of three fluoroquinolones, namely levofloxacin, norfloxacin and ciprofloxacin have been performed either in pure form or in their tablets. In the first method, levofloxacin and norfloxacin are directly treated with bromocresol green (BCG) in dichloromethane while ciprofloxacin is allowed to react with the same dye in aqueous acidic buffer. Highly yellow colored complex species were formed instantaneously in case of levofloxacin and norfloxacin or after extraction into dichloromethane for ciprofloxacin. The formed complexes are quantified spectrophotometrically at their absorption maxima at 411 nm for levofloxacin and 412 nm for norfloxacin and ciprofloxacin. The second method involves the reaction of levofloxacin with ${\rho}$-chloranilic acid ( ${\rho}$-CA) and norfloxacin with tetracyanoethylene (TCNE) in acetonitrile to give complexes with maximum absorbance at 521 and 333 nm for the two drugs, respectively. Adopting the first procedure, calibration graphs were linear over the range 1- 20 ${\mu}g\;mL^{-1}$ with mean percentage recoveries of 100.41 ${\pm}$ 0.72, 99.99 ${\pm}$ 0.54 and 100.23 ${\pm}$ 0.91 for the theree drugs, respectively. For the second procedure, the concentration ranges were 15-250 ${\mu}g\;mL^{-1}$ for levofloxacin using ${\rho}$-CA and 0.8-16 ${\mu}g\;mL^{-1}$ for norfloxacin using TCNE with mean percentage recoveries of 99.88 ${\pm}$ 0.45 and 100.26 ${\pm}$ 0.68 for the two drugs, respectively. The proposed methods were successfully applied to determine these drugs in their tablet formulations and the results compared favorably to that of reference methods. The proposed methods are recommended for quality control and routine analysis.

• Journal of Intelligence and Information Systems
• /
• v.20 no.4
• /
• pp.89-105
• /
• 2014

After emergence of Internet, social media with highly interactive Web 2.0 applications has provided very user friendly means for consumers and companies to communicate with each other. Users have routinely published contents involving their opinions and interests in social media such as blogs, forums, chatting rooms, and discussion boards, and the contents are released real-time in the Internet. For that reason, many researchers and marketers regard social media contents as the source of information for business analytics to develop business insights, and many studies have reported results on mining business intelligence from Social media content. In particular, opinion mining and sentiment analysis, as a technique to extract, classify, understand, and assess the opinions implicit in text contents, are frequently applied into social media content analysis because it emphasizes determining sentiment polarity and extracting authors' opinions. A number of frameworks, methods, techniques and tools have been presented by these researchers. However, we have found some weaknesses from their methods which are often technically complicated and are not sufficiently user-friendly for helping business decisions and planning. In this study, we attempted to formulate a more comprehensive and practical approach to conduct opinion mining with visual deliverables. First, we described the entire cycle of practical opinion mining using Social media content from the initial data gathering stage to the final presentation session. Our proposed approach to opinion mining consists of four phases: collecting, qualifying, analyzing, and visualizing. In the first phase, analysts have to choose target social media. Each target media requires different ways for analysts to gain access. There are open-API, searching tools, DB2DB interface, purchasing contents, and so son. Second phase is pre-processing to generate useful materials for meaningful analysis. If we do not remove garbage data, results of social media analysis will not provide meaningful and useful business insights. To clean social media data, natural language processing techniques should be applied. The next step is the opinion mining phase where the cleansed social media content set is to be analyzed. The qualified data set includes not only user-generated contents but also content identification information such as creation date, author name, user id, content id, hit counts, review or reply, favorite, etc. Depending on the purpose of the analysis, researchers or data analysts can select a suitable mining tool. Topic extraction and buzz analysis are usually related to market trends analysis, while sentiment analysis is utilized to conduct reputation analysis. There are also various applications, such as stock prediction, product recommendation, sales forecasting, and so on. The last phase is visualization and presentation of analysis results. The major focus and purpose of this phase are to explain results of analysis and help users to comprehend its meaning. Therefore, to the extent possible, deliverables from this phase should be made simple, clear and easy to understand, rather than complex and flashy. To illustrate our approach, we conducted a case study on a leading Korean instant noodle company. We targeted the leading company, NS Food, with 66.5% of market share; the firm has kept No. 1 position in the Korean "Ramen" business for several decades. We collected a total of 11,869 pieces of contents including blogs, forum contents and news articles. After collecting social media content data, we generated instant noodle business specific language resources for data manipulation and analysis using natural language processing. In addition, we tried to classify contents in more detail categories such as marketing features, environment, reputation, etc. In those phase, we used free ware software programs such as TM, KoNLP, ggplot2 and plyr packages in R project. As the result, we presented several useful visualization outputs like domain specific lexicons, volume and sentiment graphs, topic word cloud, heat maps, valence tree map, and other visualized images to provide vivid, full-colored examples using open library software packages of the R project. Business actors can quickly detect areas by a swift glance that are weak, strong, positive, negative, quiet or loud. Heat map is able to explain movement of sentiment or volume in categories and time matrix which shows density of color on time periods. Valence tree map, one of the most comprehensive and holistic visualization models, should be very helpful for analysts and decision makers to quickly understand the "big picture" business situation with a hierarchical structure since tree-map can present buzz volume and sentiment with a visualized result in a certain period. This case study offers real-world business insights from market sensing which would demonstrate to practical-minded business users how they can use these types of results for timely decision making in response to on-going changes in the market. We believe our approach can provide practical and reliable guide to opinion mining with visualized results that are immediately useful, not just in food industry but in other industries as well.