• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.38-45
• /
• 2016

For higher efficiency and reliability of railroad trains with many electronic sensors and actuators, a distributed control system with which electronic components communicate with each other in a distributed manner via a data network is considered. This paper considers Ethernet-based Train Communication Network (TCN) for this purpose and proposes a methodology to optimize the topology in terms of transmission latency and reliability, each of which is modeled as the number of traversing backbone nodes and the number of cables between vehicles, respectively. An objective function is derived accordingly and a closed-form optimum is obtained by relaxing the integer constraint of the number of vehicles for a unit network. Then, the final integer optimum is searched around it. Through numerical evaluation, the validity of the proposed methodology and the characteristics of the resulting solutions are shown.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.1-12
• /
• 2021

A dominating set S of a graph G is said to be nonsplit dominating set if the subgraph ⟨V - S⟩ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by ��ns(G). For a minimum nonsplit dominating set S of G, a set T ⊆ S is called a forcing subset for S if S is the unique ��ns-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing nonsplit domination number of S, denoted by f��ns(S), is the cardinality of a minimum forcing subset of S. The forcing nonsplit domination number of G, denoted by f��ns(G) is defined by f��ns(G) = min{f��ns(S)}, where the minimum is taken over all ��ns-sets S in G. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers a and b with 0 ≤ a ≤ b and b ≥ 1, there exists a connected graph G such that f��ns(G) = a and ��ns(G) = b. It is shown that, for every integer a ≥ 0, there exists a connected graph G with f��(G) = f��ns(G) = a, where f��(G) is the forcing domination number of the graph. Also, it is shown that, for every pair a, b of integers with a ≥ 0 and b ≥ 0 there exists a connected graph G such that f��(G) = a and f��ns(G) = b.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.669-674
• /
• 2001

In order to reflect the aggregation situation in the aggregation process, aggregation based on situation assessment (ASA) method was proposed in [1]. It consists of the situation assessment model (SAM) and the ASA algorithm. In the SAM, the value of parameter, p, is transformed into the nearest integer value [1]. The integer-typed output of SAM is used as input for an aggregation. The integer-typed output of SAM indicates the current degree of aggregation situation. The ASA algorithm produces at most finite several aggregation results between min and max. In the sequel, the ASA method can not properly handle the applications with the more sophisticated aggregation results between min and max. In order to solve this problem, we propose two improved ASA (I-ASA) methods. In these I-ASA methods, we allow the value of parameter of SAM to be a real number, and suggest two improved ASA algorithms to make continuous aggregation results between min and max. These I-ASA methods can handle both a precise aggregation and an approximate aggregation. Therefore, when compared to the ASA method [1], the proposed I-ASA methods have advantages in that they can handle the applications with the more sophisticated aggregation results and can be used in the more general applications for aggregations.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.147-156
• /
• 1994

Though optimization method had been used for long time for the optimal design of ship structure, design variables in the most cases were assumed to be continuous real values or it was not easy to solve the mixed integer optimum design problems using the conventional optimization methods. Thus, it was often tried to use various initial starting points to locate the best optimum paint and to use special method such as branch and bound method to handle the discrete design variables in the optimization problems. Sometimes it had succeed, but the essential problems for dealing with the local optimum and discrete design variables was left unsolved. Hence, in this paper, Genetic Algorithms adopting the biological evolution process is applied to the ship structural design problem where the integer values for the number of stiffen design variables or the discrete values for the plate thickness variables would be more preferable in order to find out their effects on the final optimum design. Through the numerical result comparisons, it was found that Genetic Algorithm could always yield the global optimum for the discrete and mixed integer structural optimization problem cases even though it takes more time than other methods.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.135-143
• /
• 2009

Recently, in the mobile device, the increase of the need for encoding and decoding of high-resolution images requires an efficient implementation of the image codec. This paper proposes a time-optimized color conversion method for the JPEG decoder, which reduces the number of calculations in the color conversion by the rearrangement of arithmetic operations being possible due to the linearity of the IDCT and the color conversion matrices and brings down the time complexity of the color conversion itself by the integer mapping replacing floating-point operations to the optimal fixed-point shift and addition operations, eventually reducing the time complexity of the JPEG decoder. And the proposed method compensates a decline of image quality incurred by the quantification error of the operation arrangement and the integer mapping by using the multi-mode chrominance reconstruction. The performance evaluation performed on the development platform of embedded systems showed that, compared to previous color conversion methods, the proposed method greatly reduces the image decoding time, minimizing the distortion of decoded images.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.435-441
• /
• 2016

Let G be a graph, and let g, f be two nonnegative integer-valued functions defined on V (G) with g(x) ≤ f(x) for each x ∈ V (G). A graph G is called a fractional (g, f, n)-critical graph if after deleting any n vertices of G the remaining graph of G admits a fractional (g, f)-factor. In this paper, we obtain a binding number condition for a graph to be a fractional (g, f, n)-critical graph, which is an extension of Zhou and Shen's previous result (S. Zhou, Q. Shen, On fractional (f, n)-critical graphs, Inform. Process. Lett. 109(2009)811-815). Furthermore, it is shown that the lower bound on the binding number condition is sharp.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2021-2026
• /
• 2013

Let G = (V,E) be a graph. A function $f:V{\rightarrow}\{-1,+1\}$ defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, ${\gamma}^s_t(G)$, is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen graphs P(n, 2) and prove that for any integer $n{\geq}6$, ${\gamma}^s_t(P(n,2))=2[\frac{n}{3}]+2t$, where $t{\equiv}n(mod\;3)$ and $0 {\leq}t{\leq}2$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.259-262
• /
• 2007

수학, 물리학, 전자전기공학에서 취급하는 수치 자료는 매우 크거나 정밀도가 높을 수 있고, 이 경우 계산과정에서 흔히 오버플로우나 언더플로우가 발생한다. 본 연구는 이런 현상을 최소화하기 위하여 겁수(Kalpa Number) 표현 방법을 제안하고, 정수형 겁수의 사칙연산과 논리연산을 구현하였다. 겁수를 이용할 경우 실행속도는 느리지만 매우 큰 수의 연산이 가능하다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.241-249
• /
• 1996

In this paper, a 0-1 integer programming model for solving vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve the binary vertical partitioning problem. In relational databases, the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. Vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.59-74
• /
• 2017

A radio labeling of a graph G is a function $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ with the property that ${\mid}f(u)-f(v){\mid}{\geq}1+diam(G)-d(u,v)$ for every pair of vertices $u,v{\in}V(G)$, where diam(G) and d(u, v) are diameter and distance between u and v in the graph G respectively. The radio number of a graph G, denoted by rn(G), is the smallest integer k such that G admits a radio labeling. In this paper, we completely determine radio number of all transformation graphs of a path.