• Title/Summary/Keyword: discrete scheme

Search Result 593, Processing Time 0.03 seconds

Efficient Outsourced Multiparty Computations Based on Partially Homomorphic Encryption (부분동형암호와 외부서버를 이용한 효율적인 다자간 연산 기법)

  • Eun, Hasoo;Ubaidullah, Ubaidullah;Oh, Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.3
    • /
    • pp.477-487
    • /
    • 2017
  • Multiparty computation (MPC) is a computation technique where many participants provide their data and jointly compute operations to get a computation result. Earlier MPC protocols were mostly depended on communication between the users. Several schemes have been presented that mainly work by delegating operations to two non-colluding servers. Peter et al. propose a protocol that perfectly eliminates the need of users' participation during the whole computation process. However, the drawback of their scheme is the excessive dependence on the server communication. To cater this issue, we propose a protocol that reduce server communication overhead using the proxy re-encryption (PRE). Recently, some authors have put forward their efforts based on the PRE. However, these schemes do not achieve the desired goals and suffer from attacks that are based on the collusion between users and server. This paper, first presents a comprehensive analysis of the existing schemes and then proposes a secure and efficient MPC protocol. The proposed protocol completely eliminates the need of users' participation, incurs less communication overhead and does not need to solve the discrete logarithm problem (DLP) in order to get the computation results.

A Recovery Scheme of Single Node Failure using Version Caching in Database Sharing Systems (데이타베이스 공유 시스템에서 버전 캐싱을 이용한 단일 노드 고장 회복 기법)

  • 조행래;정용석;이상호
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.409-421
    • /
    • 2004
  • A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

2.4kbps Speech Coding Algorithm Using the Sinusoidal Model (정현파 모델을 이용한 2.4kbps 음성부호화 알고리즘)

  • 백성기;배건성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.196-204
    • /
    • 2002
  • The Sinusoidal Transform Coding(STC) is a vocoding scheme based on a sinusoidal model of a speech signal. The low bit-rate speech coding based on sinusoidal model is a method that models and synthesizes speech with fundamental frequency and its harmonic elements, spectral envelope and phase in the frequency region. In this paper, we propose the 2.4kbps low-rate speech coding algorithm using the sinusoidal model of a speech signal. In the proposed coder, the pitch frequency is estimated by choosing the frequency that makes least mean squared error between synthetic speech with all spectrum peaks and speech synthesized with chosen frequency and its harmonics. The spectral envelope is estimated using SEEVOC(Spectral Envelope Estimation VOCoder) algorithm and the discrete all-pole model. The phase information is obtained using the time of pitch pulse occurrence, i.e., the onset time, as well as the phase of the vocal tract system. Experimental results show that the synthetic speech preserves both the formant and phase information of the original speech very well. The performance of the coder has been evaluated in terms of the MOS test based on informal listening tests, and it achieved over the MOS score of 3.1.

저압 전력선 채널 특성을 고려한 OFDM변조 전송

  • Kang Duk-Ha;Heo Yoon-Seok;Cho Ki-Hyung;Lee Dae-Young
    • The Journal of Information Technology
    • /
    • v.6 no.2
    • /
    • pp.1-8
    • /
    • 2003
  • This paper is about power line communication(PLC) over the low power voltage grid. The main advantage with power line communication is the use of an existing infrastructure. The PLC channel can be modeled as having multi-path propagation with frequency-selective fading, typical power lines exhibit signal attenuation increasing with length and frequency. OFDM(Orthogonal Frequency Division Multiplexing) is a modulation technique where multiple low data rate carriers are combined by a transmitter to form a composite high data rate transmission. To implement the multiple carrier scheme using a bank of parallel modulators would not be very efficient in analog hardware. Each carrier in an OFDM is a sinusoid with a frequency that is an integer multiple of a base or fundamental sinusoid frequency. Therefore, each carrier is a like a Fourier series component of the composite signal. In fact, it will be shown later that an OFDM signal is created in the frequency domain, and then transformed into the time domain via the Discrete Fourier Transform(DFT).

  • PDF

A study on the Encoding Method for High Performance Moving Picture Encoder (고속 동영상 부호기를 위한 부호화 방법에 관한 연구)

  • 김용욱;허도근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.352-358
    • /
    • 2004
  • This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.

CA Joint Resource Allocation Algorithm Based on QoE Weight

  • LIU, Jun-Xia;JIA, Zhen-Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2233-2252
    • /
    • 2018
  • For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.

Correction of Rotated Frames in Video Sequences Using Modified Mojette Transform (변형된 모젯 변환을 이용한 동영상에서의 회전 프레임 보정)

  • Kim, Ji-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.1
    • /
    • pp.42-49
    • /
    • 2013
  • The camera motion is accompanied with the translation and/or the rotation of objects in frames of a video sequence. An unnecessary rotation of objects declines the quality of the moving pictures and in addition is a primary cause of the viewers' fatigue. In this paper, a novel method for correcting rotated frames in video sequences is presented, where the modified Mojette transform is applied to the motion-compensated area in each frame. The Mojette transform is one of discrete Radon transforms, and is modified for correcting the rotated frames as follows. First, the bin values in the Mojette transform are determined by using pixels on the projection line and the interpolation of pixels adjacent to the line. Second, the bin values are calculated only at some area determined by the motion estimation between current and reference frames. Finally, only one bin at each projection is computed for reducing the amount of the calculation in the Mojette transform. Through the simulation carried out on various test video sequences, it is shown that the proposed scheme has good performance for correcting the rotation of frames in moving pictures.

A probabilistic framework for drought forecasting using hidden Markov models aggregated with the RCP8.5 projection

  • Chen, Si;Kwon, Hyun-Han;Kim, Tae-Woong
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • pp.197-197
    • /
    • 2016
  • Forecasting future drought events in a region plays a major role in water management and risk assessment of drought occurrences. The creeping characteristics of drought make it possible to mitigate drought's effects with accurate forecasting models. Drought forecasts are inevitably plagued by uncertainties, making it necessary to derive forecasts in a probabilistic framework. In this study, a new probabilistic scheme is proposed to forecast droughts, in which a discrete-time finite state-space hidden Markov model (HMM) is used aggregated with the Representative Concentration Pathway 8.5 (RCP) precipitation projection (HMM-RCP). The 3-month standardized precipitation index (SPI) is employed to assess the drought severity over the selected five stations in South Kore. A reversible jump Markov chain Monte Carlo algorithm is used for inference on the model parameters which includes several hidden states and the state specific parameters. We perform an RCP precipitation projection transformed SPI (RCP-SPI) weight-corrected post-processing for the HMM-based drought forecasting to derive a probabilistic forecast that considers uncertainties. Results showed that the HMM-RCP forecast mean values, as measured by forecasting skill scores, are much more accurate than those from conventional models and a climatology reference model at various lead times over the study sites. In addition, the probabilistic forecast verification technique, which includes the ranked probability skill score and the relative operating characteristic, is performed on the proposed model to check the performance. It is found that the HMM-RCP provides a probabilistic forecast with satisfactory evaluation for different drought severity categories, even with a long lead time. The overall results indicate that the proposed HMM-RCP shows a powerful skill for probabilistic drought forecasting.

  • PDF

A Study of Reinforcement Learning-based Cyber Attack Prediction using Network Attack Simulator (NASim) (네트워크 공격 시뮬레이터를 이용한 강화학습 기반 사이버 공격 예측 연구)

  • Bum-Sok Kim;Jung-Hyun Kim;Min-Suk Kim
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.3
    • /
    • pp.112-118
    • /
    • 2023
  • As technology advances, the need for enhanced preparedness against cyber-attacks becomes an increasingly critical problem. Therefore, it is imperative to consider various circumstances and to prepare for cyber-attack strategic technology. This paper proposes a method to solve network security problems by applying reinforcement learning to cyber-security. In general, traditional static cyber-security methods have difficulty effectively responding to modern dynamic attack patterns. To address this, we implement cyber-attack scenarios such as 'Tiny Alpha' and 'Small Alpha' and evaluate the performance of various reinforcement learning methods using Network Attack Simulator, which is a cyber-attack simulation environment based on the gymnasium (formerly Open AI gym) interface. In addition, we experimented with different RL algorithms such as value-based methods (Q-Learning, Deep-Q-Network, and Double Deep-Q-Network) and policy-based methods (Actor-Critic). As a result, we observed that value-based methods with discrete action spaces consistently outperformed policy-based methods with continuous action spaces, demonstrating a performance difference ranging from a minimum of 20.9% to a maximum of 53.2%. This result shows that the scheme not only suggests opportunities for enhancing cybersecurity strategies, but also indicates potential applications in cyber-security education and system validation across a large number of domains such as military, government, and corporate sectors.

  • PDF

Prediction of the Glucose Concentration Based on Its Optical Absorbance at Multiple Discrete Wavelengths (복수 개의 광파장에 대한 상대적 흡광 특성을 이용한 글루코스 농도 측정)

  • Kim, Ki-Do;Son, Geun-Sik;Lim, Seong-Soo;Lee, Sang-Shin
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.6
    • /
    • pp.416-421
    • /
    • 2008
  • A scheme for predicting the concentration of a glucose solution based on its relative optical absorbance at multiple probe wavelengths was proposed and verified. The relative absorbance at each of the probe wavelength was obtained with respect to the absorbance at a reference wavelength. The single reference wavelength (1310 nm) and a group of four different probe wavelengths (1064, 1550, 1685, 1798 nm) were selected to exhibit the glucose absorbance with opposite signs, thereby enhancing the accuracy of the prediction. The final glucose concentration was estimated by taking the average of the predicted values provided by the four probe wavelengths. The absorbance of the glucose solution for the path length of 5 mm was $-1.42{\times}10^{-6}\;AU$/(mg/dL) at the reference wavelength of 1310 nm and peaked at $+8.12{\times}10^{-6}\;AU$/(mg/dL) at 1685 nm. The concentration of the glucose solution was decently predicted by means of the proposed scheme with the standard error of prediction of ${\sim}28\;mg/dL$. In addition, the influence of the ambient temperature and the fat thickness upon the prediction of the glucose concentration was examined. The absorption change with the temperature was $-9.1{\times}10^{-5}\;AU/^{\circ}C$ in the temperature range of $26{\sim}40^{\circ}C$ at the reference wavelength, and $-2.08{\times}10^{-2}\;AU/^{\circ}C$ at 1550 nm. And the absorption change with respect to the fat thickness was +1.093 AU/mm at the probe wavelength of 1685 nm.