• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.221-227
• /
• 2013

Recent studies have been conducted on powerline communications as a viable alternative to the spread of the spread of the Internet and the Internet as the chief source of information act in the information age, the internet does not reach local Last Mile Solution. Powerline communication, but because it has been designed to transfer power to the high frequency signal to be sent when the close of wireless communications services impacted. The notch filters of a common way to eliminate the interference are used. In this paper, a dynamic high-performance notch filter applying WDF performance was verified through MATLAB and was implemented using a TI's TMS320C6416T DSP board.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.19-24
• /
• 2015

Security has been a major concern in software development. Security tactics are reusable building blocks providing a general solution for recurring security concerns at the architectural level. They are often used together with architectural patterns which provide a general solution for architecting software systems. However, use of security tactics in architectural patterns has been understood only conceptually without concrete understanding of how their involved elements should be structurally and behaviorally co-designed. In this paper, we present model-driven analyses of security tactics in the context of Broker architectural patterns and provide evidences of the analyses in real world case studies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.245-249
• /
• 2010

Now normally using a contact method of vehicle Inhibitor Switch that is use direct voltage level signal. This method is good solution for signal deliverly. but The contacted method have a short lifetime because of deterioration of contact surface. so we suggest to non-contacted method using magnetic sensor. The magnetic sensor is used to non-contacted method that is solution for problem of contacted method. In this paper using that of magnetic sensor feature, so we applied to Vehicle Transmitter switch that of non-contacting method. Sensor voltage outputs have variable electric potential that normally 0 mV to 150 mV, and it is depend on Switch Angle. we used two differential sin wave for switching of 5 state signal.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.63-67
• /
• 2014

A distributed zero-beamforming based cooperative jamming technique is useless when an eavesdropper detects the sharing seed. In addition, the currently alternatives are very limited when the eavesdropper is located nearby a source for wiretapping. This letter presents a solution to this extreme case. Relay randomly generates and transmits a binary jamming message to both source and destination in the first phase. When these two receivers securely and correctly decode the message, the source creates and transmits another message based on the use of exclusive-or for its information message and the decoded message. Consequently, the next transmission can avoid the eavesdropping.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.211-220
• /
• 2013

This paper proposes an algorithm that easily finds an optimal solution for linear bottleneck assignment problems. It is either threshold or augmenting path algorithm that is generally used to solve the bottleneck assignment problem. This paper proposes a reverse-delete algorithm that follows 2 steps. Firstly, the algorithm deletes the maximum cost in a given matrix until it renders a single row or column. Next, the algorithm improves any solution that contains a cost exceeding the threshold value $c^*_{ij}$. Upon its application to 28 balanced assignment problems and 7 unbalanced problems, the algorithm is found to be both successful and simple.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.185-191
• /
• 2019

During the modern battlefields of multi-batches flight formation attack situation, it is an essential task for a commander to make a proper fire distribution of air defense missile launch platforms for threat targets with effectively and quickly. Pan et al. try to solve this problem using genetic algorithm, but they are fails. This paper gets the initial feasible solution using high threat target first destroying strategy only use 75% available fire of each missile launch platform. Then, the assigned missile is moving to another target in the case of decreasing total threat. As a result of experiment, while the proposed algorithm is polynomial-time complexity greedy algorithm but this can be improve the solution than genetic algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.73-78
• /
• 2019

This paper proposes polynomial-time rule for maximum weighted independent set(MWIS) problem that is well known NP-hard. The well known distributed algorithm selects the maximum weighted node as a element of independent set in a local. But the merged independent nodes with less weighted nodes have more weights than maximum weighted node are frequently occur. In this case, existing algorithm fails to get the optimal solution. To deal with these problems, this paper constructs maximum weighted independent set in local area. Application result of proposed algorithm to various networks, this algorithm can be get the optimal solution that fail to existing algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.3
• /
• pp.151-157
• /
• 2021

This paper deals with financing an early retirement scheme problem(FERSP) with minimum initial cash and filling up maximum financial interest. For this problem, Guéret et al. programming the Mosel, and Edvall merely realize the CPLEX Branch-and-Cut MIP Solver program to get the optimal solution. But there is no clear rule to finding the solution. This paper suggests calculation formula of bond number decision-making that the reverse from long arrival due date to short. Then we optimize and confirm the bonds number in accordance with continuative effect of the arrival due date. The shortage prepare with the principal and interest of one year deposit(saving) reversely calculation formula.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.171-176
• /
• 2021

This paper deals with bid evaluation problem that chooses the vendors and quantity with minimum purchasing cost for bid information of setup cost and unit price. For this problem, the branch-and-bound(BB) and branch-and-cut(BC) methods are well-known. But these methods can be fail to obtain the optimal solution. This paper gets the initial feasible solution with procuring quantity assignment principle in accordance with the unit price or setup cost rank-first. Then procuring quantity moving optimization(vendor change) is execute take account of unit price or setup cost rank. As a result of experimentation, the propose algorithm is significantly lower compared to BB and BC.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.177-182
• /
• 2021

Generally, the linear programming (LP) with O(n⁴) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.