• Journal of Intelligence and Information Systems
• /
• v.11 no.3
• /
• pp.1-23
• /
• 2005

Personalized reminder systems have to identify the user's current needs dynamically and proactively based on the user's current context. However, need identification methodologies and their feasible architectures for personalized reminder systems have been so far rare. Hence, this paper aims to propose a proactive need awaring mechanism by applying agent, semantic web technologies and RFID-based context subsystem for a personalized reminder system which is one of the supporting systems for a robust ubiquitous service support environment. RescorlaWagner model is adopted as an underlying need awaring theory. We have created a prototype system called NAMA(Need Aware Multi-Agent)-RFID, to demonstrate the feasibility of the methodology and of the mobile settings framework that we propose in this paper. NAMA considers the context, user profile with preferences, and information about currently available services, to discover the user's current needs and then link the user to a set of services, which are implemented as web services. Moreover, to test if the proposed system works in terms of scalability, a simulation was performed and the results are described.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.80-94
• /
• 2003

In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1120-1127
• /
• 2007

In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.51-58
• /
• 2010

Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost. However, there is a bottleneck problem in wireless mesh network since the traffic is aggregated into a gateway. Placement of multi-radio can easy the bottleneck problem, but without careful design it results in unnecessary system cost increasement. In this paper, we propose a system cost minimization through differential antenna placement where optimum antenna placement is determined by the required wireless link capacity. With CPLEX program, optimum number of antennae is determined as a function of local user traffic and gateway capacity. From numerical analysis, it is confirmed that our proposed model can solve bottleneck problem, and at the same time save the system cost.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.1-8
• /
• 2008

It is essential to maintain constant QoS despite of cell overload or erroneous wireless link during transmission because QoS of a multimedia service may be severely degraded by small delay or packet loss. This paper deals with a cell selection method for supporting the QoS of multimedia services over heterogeneous networks. The proposed scheme is based on Fuzzy Multi-Criteria Decision Making (FMCDM), in which uncertain parameters such as user system preference, the communication cost and cell load, and the transmission delay are used in the decision process using the aggregation function in fuzzy set theory. In this scheme, errors in the evaluation parameters impose milder changes on the total evaluation value than in binary logics. Simulation is focused on the average delay and packet loss rate, and the simulation results show that our proposed method provides mobile terminals the optimal performance.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.77-88
• /
• 2003

This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.

• KIEAE Journal
• /
• v.13 no.1
• /
• pp.93-100
• /
• 2013

A outdoor space of the brand apartment can improve the quality of the whole environment in apartment and has differentiated identity in apartment housing through various versions of the green space and water space plan. The purpose of this study is to evaluate nature-friendly design characteristics in brand apartments and to offer a basic information for planning of brand apartment. In concrete, nature-friendly design did by green space and water space that can analyze by visual, and investigation contents divided to position, form, user behavior, link space from user viewpoint by case study. This study examined a case of eight brand apartments located in Gangnamgu, Seoul. We has divided the characteristics of a green space into horizontal type, vertical type, multi-dimensional type and has divided the water space into stagnant water type, flowing stream type, waterfall type and fountain type. The findings are summarized as follows: First, in case of the space of brand apartment, the application of horizontal and vertical greenery was lower compare with multi-dimensional green space. The most of items for multi-dimensional greenery have been planned to the open space and promenade. Second, a stagnant water type of water space features well used in most of the cases but a water space of signs of activity like a flowing stream, waterfall, fountain types were underused because of problem of administrative and maintenance expenses. Thirdly, Water space of brand apartments was planned with specialization item by apartment housing but green space does not have differentiated item and was planned by most similar form.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

• Journal of Digital Contents Society
• /
• v.6 no.2
• /
• pp.101-106
• /
• 2005

In this paper, performance evaluation of mobile access layer for multiple-input multiple-output (MIMO) MultiCarrier(MC)/CDMA 16 QAM system is considered to mitigate multiple access interference and enhance system channel capacity in Rayleigh wireless fading channel. Traditionally, multi-path is viewed as an undesirable feature of wireless communications. Therefore, diversity and adaptive array schemes are proposed to mitigate its effects. Recently, to increase the spectrum efficiency and the link reliability, MIMO schemes is devised to exploit multi-path in a scattering wireless channel. In particular, the channel capacity of MIMO-MC/CDMA 16 QAM system is evaluated according to Eb/No, Mc, p. From the results, in order to improve the channel capacity, the signals at various elements must be uncorrelated. And if the paths are correlated due to inappropriate spacing or mutual coupling effects, the channel capacity of MIMO-MC/CDMA 16 QAM system becomes substantially smaller.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.54-62
• /
• 2012

A Wi-Fi mesh network providing multi-hop wireless connections based on IEEE 802.11 PHY/MAC technology has recently received a significant attention as a network infrastructure that interconnects RFID systems and wireless sensor networks (WSNs). However, the current IEEE 802.11 contention-based MAC protocol cannot fully utilize the network capacity due to eithor frame collisions or unused network resources. In this paper, we propose a novel multi-channel scheduling MAC (MCS-MAC) protocol for Wi-Fi mesh networks. Under the secondary interference model of Wi-Fi mesh networks, the MCS-MAC protocol can maximize the network throughput via activation of collision-free links that has a maximal link weight. Through the simulations, we show that the throughput of the MCS-MAC protocol is at least three times higher than that of existing MAC protocols in Wi-Fi mesh networks.