• Asia pacific journal of information systems
• /
• v.11 no.4
• /
• pp.27-41
• /
• 2001

CRM is at the core of any customer-focused business strategy and includes the people, processes, and technology questions associated with marketing, sales, and service. In today's hyper-competitive world, organizations looking to implement successful CRM strategies need to focus on a common view of the customer using integrated information systems and contact center implementations that allow the customer to communicate via any desired communication channel. A CRM solution contains a number of sophisticated tools that enable to extract detailed information about customers. This information can be used to gain a better understanding of customers. From this we can determine trends, and so refine business toward customers' needs and target new products to particular customer groups. This paper presents an approach for forming the product-customer groups using neural networks for customer relationship management. The Carpenter-Grossberg's neural network, which has been used for manufacturing cell formation in group technology, is modified and applied for product-customer group formation. As a result of numerical experiments, it is also useful for more complex problems in which customers have different preferences for each product.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.19-38
• /
• 2007

Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3338-3351
• /
• 2012

There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3004-3015
• /
• 2014

This letter proposes an efficient joint resource allocation scheme for OFDM-based cooperative cognitive radio networks (CRNs) under various practical limitations. Compared with those traditional approaches, which guarantee the transmission rates of cognitive users, the proposed scheme ensures that cognitive users are maintained in proportion to the predefined target rates. Numerical simulation shows that the proposed scheme can achieve a reasonable tradeoff between performance and computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1394-1399
• /
• 2007

In this paper we propose a Hybrid MAC(HMAC) to enhance the transmission throughput in Wireless Sensor Networks(WSNs). In the proposed HMAC, sender nodes send transmission request packets to the receiver nodes using CSMA/CA MAC protocol. And the receiver node assigns slots according to the network topology and the amount of traffics using TDMA. Using HMAC we get the enhanced throughput by lowering the duplicated slot assignment.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.45-58
• /
• 2002

In the wireless communication systems of the next generation, the hard handover may frequent]y occur between the existing 2G(2nd generation) and the 3(1(3rd generation). When it occurs between the 2G and the 3G, the call setup procedure will be added to MT(Mobile Terminal), the relay bases in 2G and 3G, and the switches. It causes total time to handle the hangover to increase. Therefore, the forced termination probability may be increased since relative time decreases. In this paper, we propose a method to decrease the forced termination. The method execute the handover procedure with speed and direction of the MT preestimated in the inner cell when MT enters the boundary cell.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.481-484
• /
• 2012

차로에서 차량의 많은 증가는 안전과 무선통신의 가용성에 대한 필요성을 높여 왔다. Vehicular ad hoc networks(VANETs)은 다양한 차량 어플리케이션을 위한 용도와 상용분야로의 개발을 점차적으로 해오고 있다. 차량 간의 효과적인 통신범위를 제공하기 위해서 최적화된 라우팅 프로토콜이 필요하다. 지금까지 목적지까지 최적의 경로를 찾는 mobile ad hoc networks(MANETs)를 위한 많은 기존의 프로토콜들이 존재한다. 본 논문에서는 두 개의 라우팅 프로토콜들을 비교함으로써 VANET 환경을 위한 프로토콜 개선방향을 제시하였다. Multicast Ad-hoc On-Demand Distance Vector(MAODV)[1][2] 라우팅 프로토콜의 솔루션은 목적지 대상으로 최적의 경로를 탐색함으로써 더욱 향상된 결과를 보여준다. NS-2[3]는 라우팅 프로토콜 실험을 수행하고 결과를 도출하는데 사용되어 왔다. 실험을 통하여 최적의 라우팅 프로토콜에 대한 연구방향 및 개선될 사항을 찾고자 한다.

• Journal of information and communication convergence engineering
• /
• v.19 no.3
• /
• pp.180-187
• /
• 2021

In this paper, we present a computational volumetric reconstruction method for three-dimensional (3D) photon counting imaging with enhanced visual quality when low-resolution elemental images are used under photon-starved conditions. In conventional photon counting imaging with low-resolution elemental images, it may be difficult to estimate the 3D scene correctly because of a lack of scene information. In addition, the reconstructed 3D images may be blurred because volumetric computational reconstruction has an averaging effect. In contrast, with our method, the pixels of the elemental image rearrangement technique and a Bayesian approach are used as the reconstruction and estimation methods, respectively. Therefore, our method can enhance the visual quality and estimation accuracy of the reconstructed 3D images because it does not have an averaging effect and uses prior information about the 3D scene. To validate our technique, we performed optical experiments and demonstrated the reconstruction results.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.35-42
• /
• 2019

In this paper, we propose an approach to apply network-based moving target defense into Internet of Things (IoT) networks. The IoT is a technology that provides the high interconnectivity of things like electronic devices. However, cyber security risks are expected to increase as the interconnectivity of such devices increases. One recent study demonstrated a man-in-the-middle attack in the statically configured IoT network. In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. The approach continuously changes system's attack surface to prevent attacks. After analyzing IPv4 / IPv6-based moving target defense schemes and IoT network-related technologies, we present our approach in terms of addressing systems, address mutation techniques, communication models, network configuration, and node mobility. In addition, we summarize the direction of future research in relation to the proposed approach.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.197-205
• /
• 2018

Nowadays, wireless sensor networks (WSNs) have been widely adopted in structural health monitoring (SHM) systems for social overhead capital (SOC) public infrastructures. Structural health information, environmental disturbances and sudden changes of weather conditions, damage detections, and external load quantizing are among the capabilities required of SHM systems. These information requires an efficient transmission with which an efficient mobility management support for wireless networks can provide. This paper deals with the analysis of mobility management schemes in order to address the real-time requirement of data traffic delivery for critical SHM information. The host-based and network-based mobility management protocols have been identified and the advantages of network mobility (NEMO) enabled Proxy Mobile Internet Protocol version 6 (PMIPv6) have been leveraged in order to address the SHM information transmission needs. The scheme allows an efficient information transmission as it improves the handover performance due to shortened handover latency as well as reduced signaling overhead.