• Korean Journal of Health Education and Promotion
• /
• v.26 no.5
• /
• pp.15-26
• /
• 2009

Objectives: This paper is intended to illustrate and to discuss the organization and functioning of community resident groups (CRGs) in a community-based participatory health promotion program for healthy aging. Methods: CRGs were convened in 12 government-subsidized apartment communities for low-income seniors in Pennsylvania, U.S.A., to promote healthy aging. Researchers facilitated CRG meetings following a 6-step process of community empowerment and utilizing a social ecological model for assessment and planning. Almost 200 project-related documents were qualitatively analyzed using matrix analysis principles such as cross-classification of multiple dimensions to identify patterns in the data and matrix building for displaying such patterns. Results: CRGs were venues at which apartment building residents could interact, discuss health priorities, and become change agents in their building. CRG members' community health priorities were about their daily living, including building conditions, poor access to fresh food, and unhealthy resident relations. Specific patterns arose in analysis indicating that leadership withing the CRGs, consistency of meetings and participants' attendance, and ability to link health concerns to daily experience impacted the CRGs' capability to identify and accomplish their goals. Conclusion: Community health issues and solutions to those issues identified by CRGs were unique to community contexts and interests. Consistent participation by community members, a consistent pattern of group activities such as monthly meetings, and having established leadership to manage CRG activities were prominent characteristics of community group functioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.341-350
• /
• 2003

In this paper, we evaluate the performance of a moving average (MA) channel estimation filter when space-time block coding transmit diversity (STBC-TD) is applied to the wideband direct sequence code division multiple access (WCDMA) forward link. And we present the infinite impulse response (IIR) filter scheme that can reduce the required memory buffer and the channel estimation delay time. This paper also compares the performance between MA filter scheme and IIR filter scheme in various Rayleigh fading channel environments through the bit error rate (BER) and the frame error rate (FER). Extensive computer simulation results show that transmission with STBC-TD provides a significant gain in performance over no transmit diversity technique, particularly at pedestrian speeds. If STBC-TD technique is employed in the channel estimator based on MA filter, it provides considerable performance gains against Rayleigh fading and reduces the optimum filter tap number. Consequently, the channel estimation delay time and the complexity of the receiver are reduced. In addition, the channel estimator based on IIR filter has the advantages such as little memory requirement and no delay time compared to the MA scheme. However, IIR filter coefficients is very sensitive to the mobile speed change and it exerts a serious influence upon the performance. For that reason, it is important to set uP the optimum IIR filter coefficients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1050-1057
• /
• 2008

Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.1
• /
• pp.1-10
• /
• 2001

In this paper, a multistage parallel interference canceller (MPIC) and a partial multistage parallel interference canceller (PMPIC) are employed as a technique for improving the performance of the asynchronous DS-CDMA systems. The degree of the effect of the timing errors and phase errors on the interference cancellation capability of two types of cancellers is theoretically analyzed and the computer simulation is performed to confirm the analytical results. From the results, the large performance improvement is obtained by employing MPIC and PMPIC with perfect synchronization over the conventional matched filter, and the performance improvement obtained by MPIC and PMPIC is very close to each other as the number of the stage of MPIC and PMPIC increases. When the timing errors and phase errors are considered (in the case of imperfect synchronization), the performance improvement reduces as the performance degradation at the first stage (no cancellation) has a bad effect on the decision statistics at each stage. However MPIC and PMPIC have the strong interference cancellation capability in spite of imperfect synchronization as the number of the stage increases. An interference canceller, which has the strong interference cancellation capability as well as lower complexity for the implementation, is needed for practical systems with timing errors and phase errors because the perfect synchronization is impossible. Therefore, the excellent tradeoff between complexity and performance offered by PMPIC makes it an attractive approach for practical systems.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.7
• /
• pp.805-814
• /
• 2012

Intermittent or periodic signals with undulating amplitudes of mobile devices cause interference noise at audible frequency to the sound system which is installed nearby. In this regard, it is recently issued that the intermittently transmissions of LTE mobile phones cause the interference noises with sound systems, similar to that of GSM mobile phones. For retaining the immunity to noises, a national regulation KN20 suggests a 1 kHz AM 80 % and a CDMA modulation signal as reference signals for immunity test of sound and television broadcast receiver. In this paper, the effects of interference noises of AM and CDMA are compared with those of GSM and LTE, and the improvement of reference signal for national immunity test of sound systems is suggested. It is recommended to delete the CDMA modulation signal from reference signals for immunity test because it hardly cause interference noise with sound systems. On the other hand, it is desirable to select the modulation signal of LTE instead of CDMA as a reference signal for immunity test of sound system and television broadcast receiver because many people use the LTE service and it is analysed that the LTE signal causes considerable interference noises.

• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.35-44
• /
• 2012

Traditional technologies that are used to improve the performance of hard disk drives show many negative cases if they are applied to solid state drives (SSD). Access time and block sequence in hard disk drives that consist of mechanical components are very important performance factors. Meanwhile, SSD provides superior random read performance that is not affected by block address sequence due to the characteristics of flash memory. Practically, it is recommended to disable prefetching if a SSD is installed in a personal computer. However, this paper presents a combinational method of a prefetching scheme and a memory management that consider the internal structure of SSD and the characteristics of NAND flash memory. It is important that SSD must concurrently operate multiple flash memory chips. The I/O unit size of NAND flash memory tends to increase and it exceeded the block size of operating systems. Hence, the proposed prefetching scheme performs in an operating unit of SSD. To complement a weak point of the prefetching scheme, the proposed memory management scheme adaptively evicts uselessly prefetched data to maximize the sum of cache hit rate and prefetch hit rate. We implemented the proposed schemes as a Linux kernel module and evaluated them using a commercial SSD. The schemes improved the I/O performance up to 26% in a given experiment.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.429-436
• /
• 2005

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

• Journal of the Korean association of regional geographers
• /
• v.15 no.5
• /
• pp.671-687
• /
• 2009

This paper aims to link the development strategy of a local government(Guri-si, Kyunggi-do) to a spatial decision support system that is in the early stages of implementation and testing. Spatial Decision for a local governmental authority typically involves multiple stakeholders. To any specific regional problem, stakeholders often have various levels of knowledge and experiences about it, that yield conflicting views. In this point of view, the enhanced access to information can bring the decision process to solve the problem throughout more public participation. Recently, Urban development study was required to improve the decision making of public participation form. This study aim to investigate an analysis local government of Guri-si, can be supported as the suggestion of decision making system. Guri-si has been argued that it would improve citizen's life quality intent theme 'by historical tourism in general dimension' promote region identity, environment friendly and transportational strength, by reflecting various plan of urban development and it executed strategy. There are increasing interest in citizen participation and practical using of policy decision making to respond to uncertain environment and systematic exploration of local government. Focused on the contents of public participation decision making, it is important to investigate how to analysis urban development strategy and geographic information relationship for useful. The paper concludes with a discussion of current issues encountered during development and implementation of spatial decision making(or support) system for the local administrative authority.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.