• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.243-250
• /
• 2014

In this paper, I devise a balance-swap optimization (BSO) algorithm to solve economic load dispatch with a quadratic fuel cost function. This algorithm firstly sets initial values to $P_i{\leftarrow}P_i^{max}$, (${\Sigma}P_i^{max}$ > $P_d$) and subsequently entails two major processes: a balance process whereby a generator's power i of $_{max}\{F(P_i)-F(P_i-{\alpha})\}$, ${\alpha}=_{min}(P_i-P_i^{min})$ is balanced by $P_i{\leftarrow}P_i-{\alpha}$ until ${\Sigma}P_i=P_d$; and a swap process whereby $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_i+{{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}$ = 1.0, 0.1, 0.1, 0.01, 0.001 is set at $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$. When applied to 15, 20, and 38-generators benchmark data, this simple algorithm has proven to consistently yield the best possible results. Moreover, this algorithm has dramatically reduced the costs for a centralized operation of 73-generators - a sum of the three benchmark cases - which could otherwise have been impossible for independent operations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.55-60
• /
• 2023

When performing the multiplication m×r=p of two binary numbers m and r on a computer, there is a shift-and-add(SA) method in which no time-consuming multiplication is performed, but only addition and shift-right(SR). SA is a very simple method in which when the value of the multiplier r_i is 0, the result p is only SR with m×0=0, and when r_i is 1, the result p=p+m is performed with m×1=m, and p is SR. In SA, the number of SRs can no longer be shortened, and the improvement part is whether the number of additions is shortened. This paper proposes an SA method to minimize addition based on the fact that setting a smaller number to r when converted to a binary number to be processed by a computer can significantly reduce the number of additions compared to the case of setting a smaller number to r based on the decimals that humans perform. The number of additions to the proposed algorithm was compared for four cases with signs (-,-), (-,+), (+,-), and (+,+) for some numbers in the range [-127,128]. The conclusion obtained from the experiment showed that when determining m and r, it should be determined as a binary number rather than a decimal number.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• (The)Study of the Eastern Classic
• /
• no.56
• /
• pp.209-239
• /
• 2014

Aimed to the aesthetic implication about being a source of Akryul of 'Sungkijiwon' study in this paper. Akyul was kibonyulof HwangjongYul from ancient times. Hwajongyul consists of Yaungyuland Eumyoe, namely 12yul. Sungkijiwon was a role of seedling fundamental to the structure of the Hwangjongyul.Akyul is seen in nature. Nature which is the root of Akyul, it is inherent fully to human So that is the origin of Whangjongyul the source of the sound that the human kee of the fully implicit a world Sungkijiwon. The Sungkijiwon soon 'JeckjajIsong'. JeckjajIsong' is A first Ho, respiration that at birth the human, and the height of the sound is constant sound at this time. This sound is Preserving intact the nature of the human, Seong, Eum. Ack of Ackyul was derived from the expression from a nature of humun. Has a feature that is evident in the degree of Dosu always in the process of being extended to Yaungyul and Eumyoe, is 'original Sungkijiwon. Sungkijiwon comes from Wonkee of Taekuk of Habsanweil. The fundamental Dosu originate from 1. Hwangjong is calculated Kee including 1. 1 of Taekuk 1 of Eum and 1 of Yaung. This is a 3 and 1, the combined Yum-Yaung around Taekuk Similarly, 1 of chun, 1 of gi, 1 of In are three Samjae, And become 1, premier In of chun ji. Yulyoe is generated a 12yul. Yulryo becomes the kijuneum having Habsanweil through the differentiation, and generates the 12yul. Therefore it is possible to know that is based on humanistic a source of neutralizing beauty also original ackyul.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.157-164
• /
• 2023

This paper suggests O(n²) polynomial time heuristic algorithm for corporate tax structure optimization problem that has been classified as NP-complete problem. The proposed algorithm constructs tax tree levels that the target holding company is located at root node of Level 1, and the tax code categories(T_e) 1,4,3,2 are located in each level 2,3,4,5 sequentially. To find the maximum tax-relief path from source(S) to target(T), firstly we connect the minimum witholding tax rate _minr_w(u, v) arc of node u point of view for transfer the profit from u to v node. As a result we construct the spanning tree from all of the source nodes to a target node, and find the initial feasible solution. Nextly, we find the alternate path with minimum foreign tax rate _minr_fi(u, v) of v point of view. Finally we choose the minimum tax-relief path from of this two paths. The proposed heuristic algorithm performs better optimal results than linear programming and Tabu search method that is a kind of metaheuristic method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.51-57
• /
• 2023

Smart mirror is an IoT device that attaches a display and an embedded computer to the mirror and provides various information to the user along with the mirror function. This paper presents performance evaluation of the CoMirror system as an extension of the previous research in which proposed and implemented the CoMirror system that connects Smart Mirrors using a network. First, the login performance utilizing face recognition was evaluated. As result of the performance evaluation, it was concluded that the 40 face images are most suitable for face learning and only one face image is most suitable for face recognition for login. Second, as a result of evaluating the message transmission time, the average time was 0.5 seconds for text, 0.63 seconds for audio, and 2.9 seconds for images. Third, as a result of measuring a video communication performance, the average setup time for video communication was 1.8 seconds and the average video reception time was 1.9 seconds. Finally, according to the performance evaluation results, we conclude that the CoMirror system has high practicality.

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

In this paper, minimizing of a parabolic edge planar monopole antenna by scaling method is presented. With the aid of a matching step and discontinuous CPW, the antenna easily adjusts the impedance matching. We used an FR4 dielectric substrate with a dielectric constant of 4.4. The dimensions of the antenna are $26mm{\times}31mm{\times}1.6mm$. A return loss value of more than 10dB was found in the 2.37GHz to 10.52GHz (8.15GHz) range of the antenna fed by the discontinuous CPW. The radiation pattern is about the same as that of the dipole antenna at all frequencies. Configuration elements of the antenna except feed part were reduced into the same rate. So, the size of the antenna was decreased and a broadband property was maintained. Therefore, the self-complementary characteristic of the antenna was confirmed. While satisfying the UWB band, having the smallest size in the antenna miniaturized by scaling;when scale was 0.6. The dimensions of the antenna are $15.6mm{\times}18.6mm{\times}1.6mm$. The return loss was more than 10 dB of the measured result in the range of 3.07GHz to 12.59GHz (9.52GHz).

• Journal of Convergence for Information Technology
• /
• v.10 no.1
• /
• pp.22-27
• /
• 2020

With the deployment of 5G infrastructure, content delivery network (CDN) will be a key role to provide explosive growing services for the independent media and YouTube which contain high-speed mobile contents. Without a local cache, the mobile backhaul and fronthaul should endure huge burden of bandwidth request for users as the increase number of direct accesses from contents providers. To deal with this issue, this paper fist presents both fronthaul solutions for CDN that use dark fibers and a passive optical network (PON). On top of that, we propose the aggregated content request specialized for PON caching and evaluate and compare its performance to legacy schemes through the simulation. The proposed PON caching scheme can reduce average access time of up to 0.5 seconds, 1/n received request packets, and save 60% of backhaul bandwidth compared to the no caching scheme. This work can be a useful reference for service providers and will be extended to further improve the hit ratio of cache in the future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.269-276
• /
• 2015

This paper proves the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture of the vertex coloring problem, which is so far unresolved. The Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture states that "the union of k copies of k-cliques intersecting in at most one vertex pairwise is k-chromatic." i.e., x(G)=k. In a bid to prove this conjecture, this paper employs a method in which it determines the number of intersecting vertices and that of cliques that intersect at one vertex so as to count a vertex of the minimum degree ${\delta}(G)$ in the Minimum Independent Set (MIS) if both the numbers are even and to count a vertex of the maximum degree ${\Delta}(G)$ in otherwise. As a result of this algorithm, the number of MIS obtained is x(G)=k. When applied to $K_k$-clique sum intersecting graphs wherein $3{\leq}k{\leq}8$, the proposed method has proved to be successful in obtaining x(G)=k in all of them. To conclude, the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture implying that "the k-number of $K_k$-clique sum intersecting graph is k-chromatic" is proven.