• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제18권3호
• /
• pp.93-100
• /
• 2018

The electronic acupuncture has the advantage of treating the patient with acupuncture by simultaneously analyzing the patient's physical condition and treatment condition. In this paper, it is proposed and developed an electronic acupuncture algorithm embedded in a multi pad. Especially, it is implemented the control algorithm using the optimal electronic dipstick calculation, sensing pad and DSP system for the patient's body condition. Moreover, in this paper, it is developed SW and HW prototypes that can receive personal information by patient and can receive multi-array type electronc needle guiding procedure based on WEB.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제18권3호
• /
• pp.71-75
• /
• 2018

In this paper, we study the secrecy outage probability when using jammer in a relay system based on decode-and-forward. The jammer may be selected among the relays not selected to increase the security capacity in the physical layer so as to generate intentional noise. Jammer noise can equally interfere with the receiver and eavesdropper but can enhance the physical layer security by selecting an optimal jammer that makes the channel quality between the sender-eavesdropper links worse than the channel of the sender-receiver link. In this paper, we compute the theoretical formula of the secrecy outage probability with and without jammers, and compare the theoretical value with the simulation value to prove that the equation is valid.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제20권1호
• /
• pp.69-75
• /
• 2020

This paper introduces the parking guide service developed to address the inconvenience of parking in areas where demand for parking spaces is high, such as busy streets and tourist attractions. Due to difficulties in measuring and developing the actual parking lot while driving the car, we created a temporary parking lot and created Arduino RC Car to replace the actual car. Video processing based on Open CV allows users to identify the entire parking lot, parking space, and completed parking space, and track moving cars, and this information has been developed to enable users to see through the application. The application allows the user to book the desired parking space and introduce a way-finding algorithm to guide them through the optimal path to the selected parking compartment.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권3호
• /
• pp.125-130
• /
• 2020

At the end of 1997, the volatility of the exchange rate intensified as the nation's exchange rate system was converted into a free-floating exchange rate system. As a result, managing the exchange rate is becoming a very important task, and the need for forecasting the exchange rate is growing. The exchange rate prediction model using the existing exchange rate prediction method, statistical technique, cannot find a nonlinear pattern of the time series variable, and it is difficult to analyze the time series with the variability cluster phenomenon. And as the number of variables to be analyzed increases, the number of parameters to be estimated increases, and it is not easy to interpret the meaning of the estimated coefficients. Accordingly, the exchange rate prediction model using artificial neural network, rather than statistical technique, is presented. Using DNN, which is the basis of deep learning among artificial neural networks, and LSTM, a recurrent neural network model, the number of hidden layers, neurons, and activation function changes of each model found the optimal exchange rate prediction model. The study found that although there were model differences, LSTM models performed better than DNN models and performed best when the activation function was Tanh.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제15권1호
• /
• pp.105-110
• /
• 2015

In cognitive radio networks, when the signal-to-noise ratio (SNR) of the link between a primary transmitter and receiver is sufficiently high, the primary transmission does not frequently demand cooperation because direct transmission of the primary communication is usually successful. Therefore, there are few opportunities for a secondary transmitter to cooperate with the primary user system in exchange for an opportunity to share the spectrum. This article proposes a scheme in which the secondary system can deliberately degrade the SNR of the primary transmission, making it so that the primary system needs cooperation from the secondary nodes, and thereby increases opportunities for spectrum sharing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제17권6호
• /
• pp.27-31
• /
• 2017

A high-performance wideband transition from double-sided parallel-stripline (DSPSL) to coplanar stripline (CPS) is proposed. This transition is designed by consideration of gradual field transformation and optimal impedance matching between DSPSL and CPS. Clear design guidelines of proposed transition are provided to determine the ground shape and the transition length. The fabricated transition exhibits less than 0.7 dB insertion loss per transition for frequencies from 6.2 to 18.2 GHz, and less than 1.25 dB insertion loss to over 30 GHz.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제13권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
• /
• 제12권6호
• /
• pp.155-164
• /
• 2012

The compression of software development schedule has a limit without regarding to a development manpower. However, the actually developed softwares includes the impossible short time or unreal long time date. Previously suggested models are driving the development schedule from all of the actually developed software without considering these constraints. This paper recommends a standard of minimum and the most suitable development time period. This paper has chosen a criterion that shows the best development schedule among 5 criteria based on the actually performed projects. Moreover, this paper suggests a model that estimates the development schedule based on the best criterion.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제11권6호
• /
• pp.31-39
• /
• 2011

For rapid formed the ad hoc wireless backbone network in disaster scene, It is necessary for real-time deployment scheme of wireless ad hoc relay devices by first responders without pre-planning. However, in order to realize this scheme, redundant deployment should be minimized, as well as optimal location of relay devices should be selected to expand communication coverage. Therefore, in this paper, we propose a new deployment scheme of relay devices to optimize communication coverage and then through simulations showed that improved performance of algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제14권3호
• /
• pp.111-117
• /
• 2014

In this paper I propose a simple optimal solution seeking algorithm to a stable marriage problem. The proposed algorithm firstly constructs an $n{\times}n$ matrix of the sum of each gender's preference of the other gender $p_{ij}$. It then selects the minimum sum preference $_{min}p_{ij}$ in the constructed matrix and deletes its corresponding row i and column j. This process is repeated until $i=0{\cap}j=0$, after which the algorithm compares initially or last chosen $_{min}p_{ij}$ its alternatives to finally determine one that yields the maximum marginal increase in preference. When applied to 7 stable marriage problems, the proposed algorithm has improved on initial solutions of existing algorithms.