• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.5
• /
• pp.253-260
• /
• 2014

European Space Agency has recognized Integrated Modular Avionics and ARINC specification 653 as avionics computer system for space application. Integrated Modular Avionics specification reduces the space by integrating a system composed of many electronic devices into a computer. recent researches have been studying how to apply the ARINC 653 into an open source operating system, such as Linux. These studies have concentrated on partition scheduling for time separation. However, requirements to guarantee spatial separation should be further analyzed to ensure deterministic execution time. Therefore, memory management is needed to verify spatial isolation on Linux systems. This research proposes a new method to accomplish spatial isolation for the ARINC 653 specification in Linux. We have added new data structures and system calls to handle functionalities for spatial separation. They are used during the partition startup process. The proposed method was evaluated on the LEON4 processor, which is the next generation microprocessor to be used in the future space missions. All implementations confirm that spatial isolation of the ARINC 653 specification was accomplished.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1101-1112
• /
• 2011

The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.28-34
• /
• 2007

Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes perform local error recovery for their receiver nodes using the data stored in their buffers. We propose a packet loss patterns adaptive feedback scheduling scheme to manage these buffers in an efficient manner. Under our scheme, receiver nodes send NAKs to repair nodes to request packet retransmissions only when the packet losses are independent events from other nodes. At dynamic and infrequent intervals, they also send ACKs to indicate which packets can be safely discarded from the repair node's buffer. Our scheme reduces delay in error recovery because the requested packets are almost always available in the repair node's buffers. It also reduces the repair node's workload because (a) each receiver node sends infrequent ACKs with non-fixed intervals and (b) their sending times are fairly distributed among all the receiver nodes.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.11a
• /
• pp.35-39
• /
• 2004

In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1573-1595
• /
• 2011

In this paper, the outage performance of multiuser multiple-input single-output (MISO) systems exploiting joint spatial and multiuser diversities is investigated for Rayleigh fading channels with outdated feedback. First, we derive closed-form exact outage probabilities for the joint diversity schemes that combine user scheduling with different spatial diversity techniques, including: 1) transmit maximum-ratio combining (TMRC); 2) transmit antenna selection (TAS); and 3) orthogonal space-time block coding (OSTBC). Then the asymptotic outage probabilities are analyzed to gain more insights into the effect of feedback delay. It is observed that with outdated feedback, the asymptotic diversity order of the multiuser OSTBC (M-OSTBC) scheme is equal to the number of transmit antennas at the base station, while that of the multiuser TMRC (M-TMRC) and the multiuser TAS (M-TAS) schemes reduce to one. Further by comparing the asymptotic outage probabilities, it is found that the M-TMRC scheme outperforms the M-TAS scheme, and the M-OSTBC scheme can perform best in the outage regime of practical interest when the feedback delay is large. Theoretical analysis is verified by simulation results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.6-12
• /
• 2009

In this paper, we propose the opportunistic channel state information feedback scheme for eigen based scheduling in multiuser MIMO systems. According to 3GPP SMC channel model, the system capacity of MU-MIMO systems is severly degraded, since the antennas are highly correlated in urban macro cell. Although the eigen based scheduling scheme mitigates the adverse effect of the antenna correlation, it achieves only small amount of the multiuser diversity gain. Since the opportunistic channel state information scheme can achieve sufficient multiuser diversity gain, the system capacity of MU-MIMO systems can be improved. The system capacity improvement is verified by the computer simulation results.

• The Korean Journal of Applied Statistics
• /
• v.26 no.4
• /
• pp.623-634
• /
• 2013

In this study, we provide empirical evidence of whether a spatial correlation among mode choices at the TAZ(Traffic Analysis Zone) level exists based on transit smart card data observed in Seoul, Korea. The results show that the areas with a higher probability that passengers choose to take a bus are clustered and that those regions have fewer metro stations than bus stations. We also found that the spatial correlation turned out to be statistically meaningful and provided an opportunity for the potential use of the spatial correlation in modeling mode choices. A reliable spatial interaction would constitute valuable information for transportation agencies in terms of their route planning and scheduling based on the transit smart card data.

• The Journal of the Korea Contents Association
• /
• v.20 no.12
• /
• pp.230-240
• /
• 2020

To develop a virtual world-based immersive tutoring system, we would like to develop a simulation in the spatial aspect to maximize the diversity and realism of the situation. This implementation requires the modeling of virtual space as well as the knowledge and intelligent thinking functions of virtual humans. First, information structures are needed to simulate the hierarchical and multifaceted composition of space and the corresponding knowledge of virtual humans. Specifically, four structures for 2.5D spatial distribution expression, complex spatial relationship expression, object expression, and temporal and spatial representation of events are developed respectively. It then uses these expressed knowledge to develop the spatial thinking function of virtual humans needed to make spatial movement. In general, events have a chain effect on adjacent or connected objects through force, resulting in a variety of situations and reflected in the planning of the next action by the virtual humans involved. For this purpose, the development of events according to historical trends is recorded on the representation structure of time and space. It embodies typical events to demonstrate the feasibility of independent behavior in complex spaces among virtual people.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.38-42
• /
• 2018

In this paper, we consider measurement allocation problem in a spatially correlated sensor field. Our goal is to determine the probability of each sensor's being measured based on its contribution to the estimation reliability; it is desirable that a sensor improving the estimation reliability is measured more frequently. We consider a spatial correlation model of a sensor field reflecting transmission power limit, noise in measurement and transmission channel, and channel attenuation. Then the estimation reliability is defined distortion error between event source and its estimation at sink. Motivated by the correlation nature, we model the measurement allocation problem into a cooperative game, and then quantify each sensor's contribution using Shapley value. Against the intractability in the computation of exact Shapley value, we deploy a randomized method that enables to compute the approximate Shapley value within a reasonable time. Besides, we envisage a measurement scheduling achieving the balance between network lifetime and estimation reliability.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.