• International Commerce and Information Review
• /
• v.15 no.3
• /
• pp.411-430
• /
• 2013

Overseas marketing before the conclusion of a contract is a huge obstacle to enter the global market because it has needed the company's maximum capacities which are some cost, time and human resources. Thus it required a reestablishment about the education fields and research schemes. Due to the advancements in ICT and internet, a subject of e-trade is becoming a critical issue with a subject of a practice of international trade. However, since the mid-2000s, e-trade research articles and educational materials such as textbooks, research papers are being gradually reduced. Therefore the purpose of this study, from an oversea marketing point of view among the various e-trade fields, is to measure an education performance and an academic research scheme. And this study will suggest direction of improvement about research scheme and educational performance in the overseas marketing. According to the result, to establish the education and research scheme about SEM(Search Engine Marketing), SEO(Search Engine Optimization) and SNA(Social Network Analysis) which are introduced in the industry among the education and research field related the e-trade is urgent. And some subjects need a capstone-design reconcile theory and practice.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3529-3550
• /
• 2016

In heterogeneous networks (HetNets), energy saving is vital for a sustainable network development. Many techniques, such as spectrum allocation, network planning, etc., are used to improve the network energy efficiency (EE). In this paper, micro BSs utilizing cell range expansion (CRE) and spectrum allocation are considered in multi-channel heterogeneous networks to improve EE. Hotspot region is assumed to be covered by micro BSs which can ensure that the hotspot capacity is greater than the average demand of hotspot users. The expressions of network energy efficiency are derived under shared, orthogonal and hybrid subchannel allocation schemes, respectively. Particle swarm optimization (PSO) algorithm is used to solve the optimal ratio of subchannel allocation in orthogonal and hybrid schemes. Based on the results of the optimal analysis, we propose three service control strategies on the basis of large-scale user behaviors, i.e., adjust micro cell rang expansion (AmCRE), adjust micro BSs density (AmBD) and adjust micro BSs transmit power (AmBTP). Both theoretical and simulation results show that using shared subchannel allocation scheme in AmBD strategies can obtain maximal EE with a very small area ratio. Using orthogonal subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is larger. Using hybrid subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is large enough. No matter which service control strategy is used, orthogonal spectrum scheme can obtain the maximal hotspot user rates.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.92-101
• /
• 2012

In this paper, we propose a distributed transmit power control algorithm for optimal end-to-end throughput in wireless multihop networks. Considering a solidarity property of link rates consisting of a multihop link and the fact that the multihop end-to-end throughput is determined by the minimum link rate, the proposed scheme controls the transmit power to make all link rates be equal and so maximizes the end-to-end throughput of multihop link. In addition, in the proposed scheme the transmit node calculates its transmit power autonomously in a distributed manner just through the information sharing with its neighbor nodes and so decreases the information sharing overhead. Simulation results show that the proposed scheme achieves significant improvements in terms of end-to-end throughput and power consumption compared with the conventional maximum equal power allocation scheme.

• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.21-27
• /
• 2013

In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. Hadoop has been widely utilized as a typical distributed storage and processing framework. The tasks in Mapreduce based on the Hadoop distributed file system are allocated to the map as close as possible by considering the data locality. However, there are data being requested frequently according to the data analysis tasks of Mapreduce. In this paper, we propose a hot-data replication mechanism to improve the processing speed of Mapreduce according to data access patterns. The proposed scheme reduces the task processing time and improves the data locality using the replica optimization algorithm on the high access frequency of hot data. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the load of access frequency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1102-1112
• /
• 2012

We propose a cell selection and resource allocation scheme that assigns users to nearby accessible cells in heterogeneous wireless networks consisting of macrocell, femtocells, and Wi-Fi access points, under overload situation. Given the current power level of all accessible cells nearby users, the proposed scheme finds all possible cell assignment mappings of which user should connect to which cell to maximize the number of users that the network can accommodate at the same time. We formulate the cell selection problem with heterogeneous cells into an optimization problem of binary integer programming, and compute the optimal solution. We evaluate the proposed algorithm in terms of network access failure compared to a local ad-hoc based cell selection scheme used in practical systems using network level simulations. We demonstrate that our cell selection algorithm dramatically reduces network access failure in overload situation by fully leveraging network resources evenly across heterogeneous networks. We also validate the practical feasibility in terms of computational complexity of our binary integer program by measuring the computation time with respect to the number of users.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.357-375
• /
• 2008

With the rapid distribution and active usage of the Internet, information search and retrieval through Internet has become a primary form of information access. This ubiquity of information access through Internet means the increased significance of search performance offered by Internet portals, since the optimization of search performance by portal has strong implication for the effective access of information through Internet in general. In this context, this paper investigates the classification scheme used in the directory service of internet portals, which provides selected and organized access to Internet information. First, the author analyzes the deployment of directory classification of standard subdivision topics used in traditional library classification system, with emphasis on the table composed of the form and approach, which are applicable to diverse subject areas. Then, based on this analysis, he proposed a method of applying certain subdivisions of the standard subdivision to directory service of Internet portals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.353-364
• /
• 2002

To prevent the performance degradation of TCP due to packet loss in the smooth handoff by the route optimization extension of Mobile If protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers the packets dropped during the handoff by forwarding the buffered packets at the old base station to the mobile user. But, when the mobile user moves to a new foreign network which is connected to a congested router, the buffered packets forwarded by the old base station are dropped and the link utilization performance degraded due to increased congestion by the forwarded packets. In this paper, when the mobile user moves to a new foreign network which is connected to a congested router, Ive propose a packet forwarding control scheme required far the old base station to improve TCP performance in mobile networks. The old base station forwards or discards the buffered packets during handoff by proposed packet forwarding control scheme based on congestion states of RED(Random Early Detection) at the congested router. Simulation results slow that link utilization performance can be improved by applying proposed packet forwarding control scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.5
• /
• pp.29-44
• /
• 2000

Adaptation of operator probabilities is one of the most important and promising issues in evolutionary computation areas. This is because the setting of appropriate probabilities is not only very tedious and difficult but very important to the performance improvement of genetic algorithms. Many researchers have introduced their algorithms for setting or adapting operator probabilities. Experimental results in most previous works, however, have not been satisfiable. Moreover, Tuson have insisted that “the adaptation is not necessarily a good thing” in his papers［$^1$$^2$］. In this paper, we propose a self-tuning scheme for adapting operator probabilities in genetic algorithms. Our scheme was extensively tested on four function optimization problems and one combinational problem； and compared to simple genetic algorithms with constant probabilities and adaptive genetic algorithm proposed by Srinivas et al［$^3$］. Experimental results showed that our scheme was superior to the others. Our scheme compared with previous works has three advantages： less computational efforts, co-evolution without additional operations for evolution of probabilities, and no need of additional parameters.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.49-56
• /
• 2004

An Internet draft, named RR(Return Routability) protocol, proposed to IETF mobileip WG, in order to establish an optimal path to MN(Mobile Node) by securely sending the BU(Binding Update) message to CN(Correspondent Node). However, it has some problems with initiating the protocol by the MN: it causes to increases in communication load in the home network, to increases communication delay between MN and CN, and increases in communication load due to unnecessary message exchanges. To resolve the problems, this paper proposes an alternative scheme for the RR protocol in MIPv6. The proposed scheme is devised to start the protocol by HA on receiving the first packet from CN. It decreases the route optimization overhead by reducing the number of BU messages as well as the communication time. Beside these advantages, this scheme provides the same security grade as the original RR protocol.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.10
• /
• pp.49-55
• /
• 2019

In this paper, we propose a simple precoding vector design scheme for multi-user multiple-input single-output (MISO) interference channel when there are multiple eavesdroppers. We aim to obtain a mathematical closed-form solution of the secrecy rate optimization problem. For this goal, we design the precoding vector based on the signal-to-leakage plus noise ratio (SLNR). More specifically, the proposed precoding vector is designed to completely eliminate a wiretap channel capacity for refraining the eavesdroppers from detecting the transmitted information, and to maximize the transmitter-receiver link achievable rate. We performed simulation for the performance investigation. Simulation results show that the proposed scheme has better secrecy rate than the conventional scheme over all signal-to-noise ratio (SNR) range even though the special condition among the numbers of transmit antennas, transmitter-receiver links, and eavesdroppers is not satisfied.