• Title/Summary/Keyword: Single Game

Search Result 141, Processing Time 0.037 seconds

Beamforming Games with Quantized CSI in Two-user MISO ICs (두 유저 MISO 간섭 채널에서 불완전한 채널 정보에 기반한 빔포밍 게임)

  • Lee, Jung Hoon;Lee, Jin;Ryu, Jong Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1299-1305
    • /
    • 2017
  • In this paper, we consider a beamforming game between the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter is able to find a modified strategy from the quantized channel state information (CSI). In the beamforming game, each of the transmitters (i.e., a player) tries to maximize the achievable rate (i.e., a payoff function) via a proper beamforming strategy. In our case, each transmitter's beamforming strategy is represented by a linear combining factor between the maximum ratio transmission (MRT) and the zero forcing (ZF) beamforming vectors, which is the Pareto optimal achieving strategy. With the quantized CSI, the transmitters' strategies may not be valid because of the quantization errors. We propose a modified solution, which takes into account the effects of the quantization errors.

Thwarting Sybil Attackers in Reputation-based Scheme in Mobile Ad hoc Networks

  • Abbas, Sohail;Merabti, Madjid;Kifayat, Kashif;Baker, Thar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6214-6242
    • /
    • 2019
  • Routing in mobile ad hoc networks is performed in a distributed fashion where each node acts as host and router, such that it forwards incoming packets for others without relying on a dedicated router. Nodes are mostly resource constraint and the users are usually inclined to conserve their resources and exhibit selfish behaviour by not contributing in the routing process. The trust and reputation models have been proposed to motivate selfish nodes for cooperation in the packet forwarding process. Nodes having bad trust or reputation are detected and secluded from the network, eventually. However, due to the lack of proper identity management and use of non-persistent identities in ad hoc networks, malicious nodes can pose various threats to these methods. For example, a malicious node can discard the bad reputed identity and enter into the system with another identity afresh, called whitewashing. Similarly, a malicious node may create more than one identity, called Sybil attack, for self-promotion, defame other nodes, and broadcast fake recommendations in the network. These identity-based attacks disrupt the overall detection of the reputation systems. In this paper, we propose a reputation-based scheme that detects selfish nodes and deters identity attacks. We address the issue in such a way that, for normal selfish nodes, it will become no longer advantageous to carry out a whitewash. Sybil attackers are also discouraged (i.e., on a single battery, they may create fewer identities). We design and analyse our rationale via game theory and evaluate our proposed reputation system using NS-2 simulator. The results obtained from the simulation demonstrate that our proposed technique considerably diminishes the throughput and utility of selfish nodes with a single identity and selfish nodes with multiple identities when compared to the benchmark scheme.

Real-Time Simulation of Single and Multiple Scattering of Light (빛의 단일 산란과 다중 산란의 실시간 시뮬레이션 기법)

  • Ki, Hyun-Woo;Lyu, Ji-Hye;Oh, Kyoung-Su
    • Journal of Korea Game Society
    • /
    • v.7 no.2
    • /
    • pp.21-32
    • /
    • 2007
  • It is significant to simulate scattering of light within media for realistic image synthesis; however, this requires costly computation. This paper introduces a practical image-space approximation technique for interactive subsurface scattering. We use a general two-pass approach, which creates transmitted irradiance samples onto shadow maps and computes illumination using the shadow maps. We estimate single scattering efficiently using a method similar to common shadow mapping with adaptive deterministic sampling. A hierarchical technique is applied to evaluate multiple scattering, based on a diffusion theory. We further accelerate rendering speed by tabulating complex functions and utilizing level of detail. We demonstrate that our technique produces high-quality images of animated scenes with blurred shadow at hundreds frames per second on graphics hardware. It can be integrated into existing interactive systems easily.

  • PDF

User Experience Evaluation of Augmented Reality based Guidance Systems for Solving Rubik's Cube using HMD (HMD를 이용한 증강현실 큐브 맞추기 안내 시스템의 사용자 경험 평가)

  • Park, Jaebum;Park, Changhoon
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.7
    • /
    • pp.935-944
    • /
    • 2017
  • As augmented reality technology has developed, various augmented reality contents can be seen in real life, and the performance of mobile device is improved, so augmented reality technology can be used even without special device. As a result, a training system, guidance system and a museum art guide system based on augmented reality technology are emerging, and interest in augmented reality is also increasing. However, the existing guidance systems using a single mobile device have limitations in terms of the user experience (UX) because the camera of the device limits the field of view or the two hands are not free and the user input is difficult. In this paper, we compare augmented reality based guidance systems for Rubik's Cube using tablet and HMD to improve the constraint of user experience of such a single mobile device, and find elements that positively improve user experience. After that, we evaluate whether the user experience is actually improved through the user experience comparison test and the questionnaire.

Optimal Controller Design for Single-Phase PFC Rectifiers Using SPEA Multi-Objective Optimization

  • Amirahmadi, Ahmadreza;Dastfan, Ali;Rafiei, Mohammadreza
    • Journal of Power Electronics
    • /
    • v.12 no.1
    • /
    • pp.104-112
    • /
    • 2012
  • In this paper a new method for the design of a simple PI controller is presented and it has been applied in the control of a Boost based PFC rectifier. The Strength Pareto evolutionary algorithm, which is based on the Pareto Optimality concept, used in Game theory literature is implemented as a multi-objective optimization approach to gain a good transient response and a high quality input current. In the proposed method, the input current harmonics and the dynamic response have been assumed as objective functions, while the PI controller's gains of the PFC rectifier (Kpi, Tpi) are design variables. The proposed algorithm generates a set of optimal gains called a Pareto Set corresponding to a Pareto Front, which is a set of optimal results for the objective functions. All of the Pareto Front points are optimum, but according to the design priority objective function, each one can be selected. Simulation and experimental results are presented to prove the superiority of the proposed design methodology over other methods.

Rational Criterion of Suing and Labouring Charge in Marine Insurance -Using Game Theoretic Approach-

  • Kang, Jun-Won
    • Journal of Korea Port Economic Association
    • /
    • v.20 no.2
    • /
    • pp.73-87
    • /
    • 2004
  • The purpose of this paper is to setup reasonable criterion for underwriters to reimburse the expenses of suing and labouring incurred by assured, using game theory. As for the upper limit for the reimbursement, MIA and ICC do not mention at all but stipulate that proper and reasonable expenses shall be reimbursed, while ITC-Hulls set the amount insured as the upper limit to compensate the sum of expenses and damage loss. And as for failed measures of averting and minimizing loss, MIA and ICC do not mention either, while ITC-Hulls stipulates underwriters shall compensate the expenses and damage loss within the amount insured. The main results of this paper are as follows: First, it is for the benefit of underwriters to reimburse the expenses incurred to take such reasonable measures to avert or minimizing a loss which would be recoverable under the insurance. Second, the expenses of single measure should not be above the amount insured. Third, even if the measures failed, the expense should be reimbursed if it is less than the expected value of the subject-matter insured that could be recovered by the measures. Last, if the measures are taken several times individually, even if the sum of expenses might be above the amount insured, it should be reimbursed.

  • PDF

OpenGL ES 2.0 based Shader Compilation Method for the Instruction-Level Parallelism (OpenGL ES 2.0 기반 셰이더 명령어 병렬 처리를 위한 컴파일 기법)

  • Kim, Jong-Ho;Kim, Tae-Young
    • Journal of Korea Game Society
    • /
    • v.8 no.2
    • /
    • pp.69-76
    • /
    • 2008
  • In this paper, we present the architecture of graphics processor and its instruction format for the mobile device. In addition, we introduce tile shader data structure for the on/off-line compilation based on the OpenGL ES 2.0 and a new optimization method based on the ILP(Instruction-Level Parallelism). This paper shows where a processor with the sane core clock is being used, the shader instruction resulted from the compile structure and method in this paper is approximately 1.5 to 2 times faster than a code based on the single instruction.

  • PDF

A Pixel Pipeline Architecture with Effective Visibility Test for 3D Graphics Accelerators (향상된 가시성 검사를 수행하는 3차원 그래픽 가속기의 픽셀 파이프라인 구조)

  • Kim, Il-San;Park, Woo-Chan;Park, Jin-Hong;Han, Tack-Don
    • Journal of Korea Game Society
    • /
    • v.7 no.3
    • /
    • pp.31-38
    • /
    • 2007
  • In this paper, we proposed an effective visibility test architecture with improving the mid-texturing architecture. The proposed architecture uses the property of fragments that the visibility of adjacent fragments is identical, and performs only a single visibility test per fragment. To compare with the mid-texturing architecture, simulation results show that the bandwidth requirements and the cell area of the depth cache in the proposed architecture are reduce by 25% and 34%, respectively, in exchange for less than 5% performance decline.

  • PDF

Lossless Compression and Rendering of Multiple Layer Displacement Map (다층 변위 맵의 비손실 압축과 렌더링)

  • Chun, Young-Jae;Kim, Hae-Dong;Cho, Sung-Hyun
    • Journal of Korea Game Society
    • /
    • v.9 no.6
    • /
    • pp.171-178
    • /
    • 2009
  • Multiple layer displacement mapping methods are able to represent more complex and general geometries which cannot be presented by single layer displacement mapping methods, and provide a realistic scene to digital contents such as 3D games and movies with relatively low costs. However, as we use more layers for details, data space is wasted more because lower layers have less displacement data than higher layers. In this paper, we suggest a lossless compression and rendering method of a multiple layer displacement map. Since we compress the map without data loss, the proposed method provides the same quality as the rendering result that uses an original multiple layer displacement map.

  • PDF

Research of Real-Time Emotion Recognition Interface Using Multiple Physiological Signals of EEG and ECG (뇌파 및 심전도 복합 생체신호를 이용한 실시간 감정인식 인터페이스 연구)

  • Shin, Dong-Min;Shin, Dong-Il;Shin, Dong-Kyoo
    • Journal of Korea Game Society
    • /
    • v.15 no.2
    • /
    • pp.105-114
    • /
    • 2015
  • We propose a real time user interface that utilizes emotion recognition by physiological signals. To improve the problem that was low accuracy of emotion recognition through the traditional EEG(ElectroEncephaloGram), We developed a physiological signals-based emotion recognition system mixing relative power spectrum values of theta/alpha/beta/gamma EEG waves and autonomic nerve signal ratio of ECG (ElectroCardioGram). We propose both a data map and weight value modification algorithm to recognize six emotions of happy, fear, sad, joy, anger, and hatred. The datamap that stores the user-specific probability value is created and the algorithm updates the weighting to improve the accuracy of emotion recognition corresponding to each EEG channel. Also, as we compared the results of the EEG/ECG bio-singal complex data and single data consisting of EEG, the accuracy went up 23.77%. The proposed interface system with high accuracy will be utillized as a useful interface for controlling the game spaces and smart spaces.