• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.6
• /
• pp.324-333
• /
• 2004

This paper discusses the development of an educational web-based power flow program for undergraduate students. The interaction between lectures and users can be much enhanced via the web-based programs which result in the student's learning effectiveness on the power flow problem. However the difficulties for developing web-based application programs are that there can be the numerous unspecified users to access the application programs. To overcome the aforementioned multi-users problem and to develope the educational web-based power flow program, we have revised the system architecture, the modeling of application programs, and database which efficiently and effectively manages the complex data sets related to the power flow analysis program. The developed application program is composed of the physical three tiers where the middle tier is logically divided into two kinds of application programs. The divided application programs are interconnected by using the Web-service based on XML (Extended Markup Technology) and HTTP (Hyper Text Transfer Protocol) which make it possible the distributed computing technology Also, this paper describes the method of database modeling to handle effectively when the numerous users change the parameters of the power system to compare the results of the base case.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.1
• /
• pp.68-77
• /
• 2018

Regarding demand response (DR) by residential users (R-users), the users try to reduce electricity costs by adjusting their power consumption in response to the time-varying price. However, their power consumption may be affected not only by the price, but also by user convenience for using appliances. This paper proposes a methodology for appliance scheduling (AS) that considers the user convenience based on historical data. The usage pattern for appliances is first modeled applying the copula function or clustering method to evaluate user convenience. As the modeling results, the comfort distribution or representative scenarios are obtained, and then used to formulate a discomfort index (DI) to assess the degree of the user convenience. An AS optimization problem is formulated in terms of cost and DI. In the case study, various AS tasks are performed depending on the weights for cost and DI. The results show that user convenience has significant impacts on AS. The proposed methodology can contribute to induce more DR participation from R-users by reflecting properly user convenience to AS problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.385-387
• /
• 2022

With the tremendous rise in popularity of the Internet and technological advancements, many news keeps generating every day from multiple sources. As a result, the information (News) on the network has been highly increasing. The critical problem is that the volume of articles or news content can be overloaded for the readers. Therefore, the people interested in reading news might find it difficult to decide which content they should choose. Recommendation systems have been known as filtering systems that assist people and give a list of suggestions based on their preferences. This paper studies a personalized news recommendation system to help users find the right, relevant content and suggest news that readers might be interested in. The proposed system aims to build a hybrid system that combines collaborative filtering with content-based filtering to make a system more effective and solve a cold-start problem. Twitter social media data will analyze and build a user's profile. Based on users' tweets, we can know users' interests and recommend personalized news articles that users would share on Twitter.

• Journal of Advanced Marine Engineering and Technology
• /
• v.27 no.1
• /
• pp.65-75
• /
• 2003

The internet telephony service is one of the successful internet application services. VoIP is the key technology for the service to come true. VoIP uses H.323 or SIP as the standard protocol for the distributed multimedia services over the internet environment, in which QoS is not guaranteed. VoIP carries the packetized voice by using the RTP/UDP/IP protocol stack. The UDP-based internet services cause the data transmission problem to the users behind the internet firewall. So does the internet telephony service. The users are not able to listen the voices of the counter-parts on the public internet or PSTN. It makes the problem more difficult that the internet telephony service addressed in this paper uses only one UDP port number to send the voice data of all sessions from gateway to terminal node. In this paper, two schemes including the usage of dummy UDP datagrams, and the protocol conversion are suggested. The implementation of one of the schemes, the protocol conversion, and the performance evaluation are described in detail.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.25-31
• /
• 2018

In this paper, we consider the game theoretic approach to investigate the transmit power optimization problem where D2D users share the uplink of the cellular system. Especially, we formulate the transmit power optimization problem as a non cooperative power control game. In the user wide sense, each user may try to select its transmit power level so as to maximize its utility in a selfish way. In the system wide, the transmit power levels of all users eventually converge to the unique point, called Nash Equilibrium. We first formulate the transmit power optimization problem as a non cooperative power control game. Next, we examine the existence of Nash Equilibrium. Finally, we present the numerical example that shows the convergence to the unique transmit power level.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.140-150
• /
• 2012

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.565-581
• /
• 2019

This paper investigates the wireless powered two way relay network (WPTWRN), where two single-antenna users and one single-antenna relay firstly harvest energy from signals emitted by a multi-antenna power beacon (PB) and then two users exchange information with the help of the relay by using their harvested energies. In order to improve the energy transfer efficiency, energy beamforming at the PB is deployed. For such a network, to explore the performance limit of the presented WPTWRN, an optimization problem is formulated to obtain the achievable rate region bounds by jointly optimizing the time allocation and energy beamforming design. As the optimization problem is non-convex, it is first transformed to be a convex problem by using variable substitutions and semidefinite relaxation (SDR) and then solve it efficiently. It is proved that the proposed method achieves the global optimum. Simulation results show that the achievable rate region of the presented WPTWRN architecture outperforms that of wireless powered one way relay network architecture. Results also show that the relay location has significant impact on achievable rate region of the WPTWRN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.921-940
• /
• 2015

In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.812-824
• /
• 2021

Recently, with an increase in Internet usage, users of online social networks (OSNs) have increased. Consequently, privacy leakage has become more serious. However, few studies have investigated the difference between privacy and actual behaviors. In particular, users' desire to change their privacy status is not supported by their privacy literacy. Presenting an accurate measurement of users' privacy status can cultivate the privacy literacy of users. However, the highly interactive nature of interpersonal communication on OSNs has promoted privacy to be viewed as a communal issue. As a large number of redundant users on social networks are unrelated to the user's privacy, existing algorithms are no longer applicable. To solve this problem, we propose a structural similarity measurement method suitable for the characteristics of social networks. The proposed method excludes redundant users and combines the attribute information to measure the privacy status of users. Using this approach, users can intuitively recognize their privacy status on OSNs. Experiments using real data show that our method can effectively and accurately help users improve their privacy disclosures.