• Kyungpook Mathematical Journal
• /
• v.63 no.1
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.

• Journal of Korea Technical Association of The Pulp and Paper Industry
• /
• v.41 no.5
• /
• pp.50-58
• /
• 2009

Periodic variation of local paper structure was evaluated using two-dimensional fast Fourier transform (FFT) and spectral analysis. Since the periodic variation could originate from various sources and have different magnitudes and patterns depending on the origins, a complete analysis of local paper structure properties such as local grammage, local thickness, local apparent density and surface topography was proposed in this study. For a commercial copy paper, the individual periodic patterns for each local structural property were identified by using inverse FFT spectrums of the filtered spectrum. The spectral analysis of newsprint sample provided the period of variation quantitatively, which was useful in comparing the origins of the individual periodic patterns of the local structural properties.

• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.33-40
• /
• 2014

One of the most important requirements for the Ethernet-based automobile is the reliability. In order to achieve this goal, we propose using the High-availability Seamless Redundancy (HSR) protocol (IEC 62439-3 clause 5) in these networks. The HSR protocol provides duplicated frame copies for each sent frame, which means that the destination node will receive at least one copy in case the second copy is lost due to a failure. In other words, there will be no network stoppage even if failure occurs. Moreover, the destination node will receive at least one frame copy with zero-recovery time (seamless) and it will not need to wait to receive the other copy if the first one is lost, which occurs it in the Ethernet standard, as a result of reconfiguration of the network paths. However, the main drawback of the HSR protocol is the unnecessary redundant traffic that is caused by the duplicated frames. Several solutions, including QR, VRing, RURT, and DVP, have already been proposed to improve the traffic performance of the HSR protocol. In this paper, we propose three automobile network topologies. each of which has pros and cons depending on the automobile requirements. Then we applied the HSR protocol with and without the QR and VRing approaches to each scenario. The comparison among these topologies depend on the traffic performance result for each of them. The QR and VRing approaches give a better traffic reduction percentage, ranging from 48% to 75% compared to the standard HSR protocol. Therefore they could limit the redundant traffic in automobile networks when the HSR protocol is used instead of the Ethernet network, which does not provide any seamless recovery if a failure occurs.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.23 no.1
• /
• pp.65-75
• /
• 2005

An accurate characterization of the display device is essential for better color matching. The calibration and characterization process in display device is needed to transform the device dependent color to the device independent color. The process of characterization performs a linearization and transforms the linearized values into the CIE XYZ tristimulus values. The purposes of this paper is to propose optimal color transformation method for accurate reproduction of original copy in display device and to explain the propriety of transformation method using specific variable for the power of gradation expression.

• Journal of the Korea Convergence Society
• /
• v.13 no.2
• /
• pp.21-29
• /
• 2022

Based on the importance of dialect research, preservation, and communication, this paper conducted a study on machine translation of Korean dialects for dialect users who may be marginalized. For the dialect data used, AIHUB dialect data distributed based on the highest administrative district was used. We propose a many-to-one dialect machine translation that promotes the efficiency of model distribution and modeling research to improve the performance of the dialect machine translation by applying Copy mechanism. This paper evaluates the performance of the one-to-one model and the many-to-one model as a BLEU score, and analyzes the performance of the many-to-one model in the Korean dialect from a linguistic perspective. The performance improvement of the one-to-one machine translation by applying the methodology proposed in this paper and the significant high performance of the many-to-one machine translation were derived.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.39-48
• /
• 2005

A convex region covers a family of curves if it contains a congruent copy of each curve in the family, and a 'worm problem' for that family is to find the convex region of smallest area. In this paper, we find the smallest triangular cover of any prescribed shape for the family S of all triangles of diameter 1.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1251-1259
• /
• 2006

The headline of advertisements holds the important position in advertisement recognition and receptivity. The mobile advertisements show an immediate reaction of customers because it is possible to do 'one-to-one communication'. And this makes the mobile advertisement as important as any kind of traditional marketing channel, like TV, Radio, Print. In this paper, we classified the headlines as several types and measured the effect of headline types.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.419-422
• /
• 2006

This paper deals with a study on copy rate for program when there is a conflict with programs. Therefore, it is presented a setting method on weight and degree of importance on each factors.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.1
• /
• pp.81-96
• /
• 2007

The headline of advertisements holds the important position in advertisement recognition and receptivity. In this paper, we classified the headlines as several types with measuring the response effects for purpose of understanding the customer's behavior. Also we conducted the decision tree analysis and correspondence analysis. The decision tree shows the difference between responders and non-responders, and the correspondence analysis shows the relationship between the sales and the customer's demographic information.