• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.1-14
• /
• 2007

IF handoff events are occurred during the transmission of multimedia traffic, the efficient resource allocation and handoff procedures are necessary to maintain the same QoS of transmitted multimedia traffic because the QoS may be defected by some delay and information loss, This paper proposes a handoff scheme to accommodate multimedia traffic based on the resource reservation procedure using direction estimation, This scheme uses a novel mobile tracking method based on Fuzzy Multi Criteria Decision Making, in which uncertain parameters such as PSS (Pilot Signal Strength), the distance between the mobile and the base station, the moving direction, and the previous location are used in the decision process using the aggregation function in fuzzy set theory, With the position information, the moving direction is determined, The handoff requests for real time sessions are handled based on the direction prediction and the resource reservation scheme, The resources in the estimated adjacent cells should be reserved and allocated to guarantee the continuity of the real time sessions, Through simulation results, we show that our proposed resource reservation method provides a better performance than that of the conventional method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.39-44
• /
• 2010

In LTE-Advanced systems, every sector uses the entire range of the frequency resource, and when the UEs are located at a cell edge, user throughputs degrade due to the interferences from the adjacent cells. In this paper, we propose a combined scheme for inter-cell interference avoidance and power control. In the proposed algorithm, the sectors consist of the right edge, the left edge and the center for resource allocation and we control the transmission power to improve the user throughputs at the edge of each cell. Using a system level simulation, we analyze low 5th percentile and average user throughputs of the UEs who are located the cell, center and edge when the inter-cell interference avoidance and the power control are combined.

• Korean Journal of Cognitive Science
• /
• v.24 no.2
• /
• pp.133-171
• /
• 2013

The gist of a scene can be identified in less than 100msec, and violation in the gist can influence the way to allocate attention to the parts of a scene. In other words, people tend to allocate more attention to the object(s) inconsistent with the gist of a scene and to have better memory of them. To investigate the effects of contextual consistency on the attention allocation and object memory, two experiments were conducted. In both experiments, a $3{\times}2$ factorial design was used with scene presentation time(2s, 5s, and 10s) as a between-subject factor and object-background contextual consistency(consistent, inconsistent) as a within-subject factor. In Experiment 1, eye movements were recorded while the participants viewed line-drawing scenes. The results showed that the eye movement patterns were different according to whether the scenes were consistent or not. Context-inconsistent objects showed faster initial fixation indices, longer fixation times, more frequent returns than context-consistent ones. These results are entirely consistent with those of previous studies. If an object is identified as inconsistent with the gist of a scene, it attracts attention. Furthermore, the inconsistent objects and their locations in the scenes were recalled better than the consistent ones and their locations. Experiment 2 was the same as Experiment 1 except that a dual-task paradigm was used to reduce the amount of attention to allocate to the objects. Participants had to detect the positions of the probe occurring every second while they viewed the scenes. Nonetheless, the result patterns were the same as in Experiment 1. Even when the amount of attention to allocate to the scene contents was reduced, the same effects of contextual inconsistency were observed. These results indicate that the object-background contextual consistency has a strong influence on the way of allocating attention and the memory of objects in a scene.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.4
• /
• pp.138-144
• /
• 2020

The Army's engineers are carrying out a range of operations using various equipment, of which, artillery unit support is the representative engineering operation field. The main task of the artillery unit is to attack the enemy's center with firepower from the rear of a friendly force. The artillery must move its original position after firing several times to prevent exposure of the shooting position. This paper proposed a mathematical model and heuristic algorithm that can be used to determine the optimal allocation among engineer equipment, the team (work), and position while reflecting the constraints of the construction of an artillery position. The model proposed in this paper derived the optimal solution for the small size problems, but it takes a long time to derive the optimal solution for the problem of equipment placement of the engineer battalion and brigade scale. Although the heuristic suggested in this study does not guarantee the optimal solution, the solution could be obtained in a reasonable amount of time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.292-297
• /
• 2008

본 논문은 FPGA 기반 설계에서 주변보다 급격한 온도 변화를 보이는 hotspot들을 탐지하기 위한 열 감지 센서 수를 정하고, 센서의 놓여야 할 배치 장소를 결정하는 알고리즘을 제안한다. 열 감지 센서로는 동적으로 설계가 가능한 ring oscillator 센서 기술을 사용한다는 가정 하에, 센서의 사용 개수를 최소화함과 동시에 최적의 센서 배치 위치 찾는다. 기존의 연구의 단점은 센서가 감지하는 영역 범위를 적당한 크기의 정사각형으로 간주하였기에, 실제 원형의 관측 범위를 보이는 센서 감지 영역의 현실을 올바로 반영하지 못하였으며, 또한 잘 알려진 회로 분할(partition) 기법에 의존한 휴리스틱으로 최적의 결과를 보장하지는 못하였다. 이와는 달리 본 연구에서는 센서의 관측 범위를 원형으로 할 수도 있게 함과 동시에 최적의 해를 보장하는 센서 할당 및 배치 알고리즘을 제안한다. 구체적으로 본 제안 알고즘에서는 소위 “Candidate Coloring 기법”을 통해 센서가 놓여야 할 모든 후보 영역을 표시하며, “Candidate Filtering 기법”을 통해 불필요한 후보 영역들을 완전히 삭제하여 탐색 공간을 줄이게 되며 (해의 최적 해는 항상 유지 되도록 하면서), 마지막으로 Branch-and-Bound 알고리즘을 적용해 최적의 센서 할당 및 배치 결과를 찾아내었다.

• Journal of Broadcast Engineering
• /
• v.14 no.1
• /
• pp.89-92
• /
• 2009

In this paper, we discuss the BBA based power scaling scheme in cognitive radio technique for WPAN system. We focus on Cognitive Radio environment which is currently ongoing standard procedure and is able to focus on future communication and show the transmitted power scaling of CR user. We suggest the available communication method of CR user, while it is simultaneously satisfying both minimum interference of PU(Primary User) and possible communication of CR user. The method is using the BBA, and we show several merits in face of received SINR. and we prove that CR vary its transmit power while maintaining a guarantee of service to primary users.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.197-202
• /
• 2014

In order to operate multiple UAVs for multiple tasks efficiently, we need a task allocation algorithm with minimum cost, i.e.,total moving distance required to accomplish the whole mission. In this paper, we have proposed the MCBAA (Modified Consensus Based Auction Algorithm) which can be suitably applied to the operation of multiple UAVs. The key idea of proposed algorithm is to minimize sum of distance from current location of agents to location of tasks based on the conventional CBAA. Several simulation test performed on three UAV agents with multiple tasks demonstrates the overall efficiency both in time and total distance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.766-774
• /
• 2004

The future mobile communication system can support not only voice but also multimedia applications such as data, image and video. It requires greater resources than the voice-oriented mobile system. Efficient resource reservation and hand-over schemes are necessary to maintain the same QoS of transmitted multimedia traffic because the QoS may be defected by some delay and information loss during hand-over. This paper proposes a resource reservation scheme to accommodate multimedia traffics in mobile multimedia networks. In our scheme the position of mobile is estimated in two steps, that is, sector estimation and zone estimation. With this position information, the moving direction is determined. According to simulation results, our scheme provides a better performance than conventional methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.801-804
• /
• 2009

In this paper, the Linux kernel memory map was analyzed as the approach to Improving performance for Embedded Linux system. Since the Linux kernel memory map supporting a stability and various H/W platforms and in which it becomes to the general purpose system with optimization manages the role of being important in the booting time and the efficient system utilization of resources, the analysis of the kernel memory map is required for the performance improvement of the Embedded Linux system in which it is restrictive the resources. According to the analysis result, and of the Linux kernel memory, the booting speed of and improvement of the memory efficiency were confirmed. It is therefore considered that the proposed in this paper and kernel memory allocation method are suitable to the memory availability improvement of the Embedded Linux system.