• The Journal of the Korea Contents Association
• /
• v.11 no.10
• /
• pp.41-48
• /
• 2011

In feature selection, the selective evaluation scheme for Ant Colony Optimization(ACO) has recently been proposed, which reduces computational load by excluding unnecessary or less promising candidate solutions from the actual evaluation. Its superiority was supported by experimental results. However the experiment seems to be not statistically sufficient since it used only one dataset. The aim of this paper is to analyze convergence characteristics of the selective evaluation scheme and to make the conclusion more convincing. We chose three datasets related to handwriting, medical, and speech domains from UCI repository whose feature set size ranges from 256 to 617. For each of them, we executed 12 independent runs in order to obtain statistically stable data. Each run was given 72 hours to observe the long-time convergence. Based on analysis of experimental data, we describe a reason for the superiority and where the scheme can be applied.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.658-667
• /
• 2017

The demand for large-scale storage systems has continued to grow due to the emergence of multimedia, social-network, and big-data services. In order to improve the response time and reduce the load of such large-scale storage systems, DRAM-based in-memory cache systems are becoming popular. However, the high cost of DRAM severely restricts their capacity. While the method of compressing cache entries has been proposed to deal with the capacity limitation issue, compression and decompression, which are technically difficult to parallelize, induce significant processing overhead and in turn retard the response time. A selective compression scheme is proposed in this paper for in-memory file system caches that rapidly estimates the compression ratio of incoming cache entries with their Shannon entropies and compresses cache entries with low compression ratio. In addition, a description is provided of the design and implementation of an in-kernel in-memory file system cache with the proposed selective compression scheme. The evaluation showed that the proposed scheme reduced the execution time of benchmarks by approximately 18% in comparison to the conventional non-compressing in-memory cache scheme. It also provided a cache hit ratio similar to the all-compressing counterpart and reduced 7.5% of the execution time by reducing the compression overhead. In addition, it was shown that the selective compression scheme can reduce the CPU time used for compression by 28% compared to the case of the all-compressing scheme.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.217-231
• /
• 2007

Frequent disconnection is connected directly to client's cache consistency problem in Mobile Computing environment. For solving cache consistency problem, research about Invalidation Report is studied. But, existent invalidation report structure comes with increase of size of invalidation report structure and decline of cache efficiency if quantity of data become much, or quantity of updated data increases. Also, while existent method confirms whole cache, invalidation report doesn't support selective listening. This paper proposes TTCI(Timestamp Tree-based Cache Invalidation scheme) as invalidation report structure that solve problem of these existing schemes and improve efficiency. We can make TTCI using timestamp of updated data, composing timestamp tree and list ID of data in updated order. If we utilize this, each client can confirm correct information in point that become own disconnecting and increase cache utilization ratio. Also, we can pare down client's resources consumption by selective listening using tree structure. We experimented in comparison with DRCI(Dual-Report Cache Invalidation) that is existent techniques to verify such efficiency of TTCI scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.55-64
• /
• 2010

In this paper, we propose a new compensation scheme for combined channel distortions and RF impairments based on the analysis of the impacts of IQ(In-phase/Quadrature) imbalance and phase noise on the OFDM(Orthogonal Frequency Division Multiplexing) system in the direct conversion transceiver and frequency selective fading channel distortion. The proposed scheme estimates the combined distortion by the use of training symbols and the residual distortion by pilot symbols and compensates the combined distortion, including IQ imbalance, phase noise and multipath fading at the same time. The simulation results show that the proposed scheme compensates the combined distortion of IQ imbalance, phase noise and multipath fading simultaneously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.73-80
• /
• 2010

A wireless sensor network which is deployed in hostile environment can be easily compromised by attackers. The selective forwarding attack can jam the packet or drop a sensitive packet such as the movement of the enemy on data flow path through the compromised node. Xiao, Yu and Gao proposed the checkpoint-based multi-hop acknowledgement scheme(CHEMAS). In CHEMAS, each path node enable to be the checkpoint node according to the pre-defined probability and then can detect the area where the selective forwarding attacks is generated through the checkpoint nodes. In this scheme, the number of hops is very important because this parameter may trade off between energy conservation and detection capacity. In this paper, we used the fuzzy rule system to determine adaptive threshold value which is the number of hops for the ACK packets. In every period, the base station determines threshold value while using fuzzy logic. The energy level, the number of compromised node, and the distance to each node from base station are used to determine threshold value in fuzzy logic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.974-979
• /
• 2009

The BER performance of a MIMO detection scheme on frequency selective Rayleigh fading channels is analytically discussed. The presented MIMO detection scheme consists of temporal and spatial combiners followed by a ZF detector. It is shown that for a MIMO system with $N_T$ transmit antennas, $N_R$ receive antennas, and L resolvable multipath components, it achieves the diversity order of $LN_R-N_T+1$. In frequency selective Rayleigh fading channels, an analytical error rate expression of the systems is also provided and the analytical error performance is compared with the simulated results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.556-563
• /
• 2009

HMIP, an extending version of MIP, makes the signaling traffic low, thereby reducing the packet losses and delay. However, it still has the same problem in MIPv6 in the case of macro mobility, though it can reduce the out-signaling in the case of a micro mobility, a regional mobility with the MAP protocol. To overcome this problem, this paper proposes a handover which exploits an address insurance with selective buffering for the HMIP macro handover. This scheme can decrease the lost packets and the delay time and provide better performance for high QoS traffic and real-time multimedia transmission. The simulation result shows that the proposed scheme makes the transmission delay time and the lost packets smaller than the existing schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.616-618
• /
• 2005

On-Demand routing protocol들은 Route를 셋업하기 위해 network-wide flooding scheme을 사용한다. 이 경우 않은 수의 overhead가 쿼리 패킷들이 생산되어 네트웍 퍼포먼스가 저하되는 결과를 초래한다. 우리는 이것을 일컬어 " 8roadcast storm problem" 이라고 한다. 여기에 우리는 Selective Query Node라는 scheme을 제안하여 flooding시에 발생하는 broadcast storm 문제를 완화하려고 한다. SQN은 이웃노드의 topology를 고려하여 proactive한 라우팅 정보를 제공하여 세가지 제한요소를 두어 쿼리를 받은 이웃노드가 받은 쿼리를 중지할 수 있도록 하며 퍼포먼스 향상을 기할 수 있도록 한다.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.631-633
• /
• 2009

We introduce an improved Ethernet ring protection method, selective filtering database (FDB) advertisement, to minimize traffic overshoot in the event of a failure or recovery. On the protection switching event, the proposed method makes all ring nodes perform an FDB flush except the FDB entries associated with their client subnets. Then, ring nodes rapidly exchange their client MAC address lists so that their FDBs are immediately updated by indirect MAC address learning. The proposed scheme guarantees fast and reliable protection switching over the standard scheme.