• Title/Summary/Keyword: Generator matrix

Search Result 139, Processing Time 0.029 seconds

Performance Evaluation of the WiMAX Network Based on Combining the 2D Markov Chain and MMPP Traffic Model

  • Saha, Tonmoy;Shufean, Md. Abu;Alam, Mahbubul;Islam, Md. Imdadul
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.653-678
    • /
    • 2011
  • WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.

Applying the Nash Equilibrium to Constructing Covert Channel in IoT

  • Ho, Jun-Won
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.243-248
    • /
    • 2021
  • Although many different types of covert channels have been suggested in the literature, there are little work in directly applying game theory to building up covert channel. This is because researchers have mainly focused on tailoring game theory for covert channel analysis, identification, and covert channel problem solving. Unlike typical adaptation of game theory to covert channel, we show that game theory can be utilized to establish a new type of covert channel in IoT devices. More specifically, we propose a covert channel that can be constructed by utilizing the Nash Equilibrium with sensor data collected from IoT devices. For covert channel construction, we set random seed to the value of sensor data and make payoff from random number created by running pseudo random number generator with the configured random seed. We generate I × J (I ≥ 2, J ≥ 2) matrix game with these generated payoffs and attempt to obtain the Nash Equilibrium. Covert channel construction method is distinctly determined in accordance with whether or not to acquire the Nash Equilibrium.

A Study on the Effect of Controllers in Small Signal Stability of Power Systems (전력계통의 미소신호안정도에 미치는 제어기의 영향에 관한 연구)

  • 권세혁;김덕영
    • Journal of Energy Engineering
    • /
    • v.5 no.1
    • /
    • pp.72-79
    • /
    • 1996
  • The effect of controllers-Exciter, Power System Stabilizer, and Static Var Compensator-in one machine infinite bus system is investigated in this paper. The structure of generator state matrix with controllers is represented, while the Static Var Compensator is installed in generator terminal bus. Eigen-value analysis is performed and the effects of controllers to the dominant eigenvalue in one machine infinite bus system are represented by first order eigenvalue sensitivity coefficients while the operating conditions of the system are varied. Optimization of controller parameters using first order eigenvalue sensitivity coefficients is performed by the Simplex Method. It is proved that exciter control is the most efficient method to improve stability of the system and the effect of Static Var Compensator is small, in the case of one machine infinite bus system.

  • PDF

An Improved Reconstruction Algorithm of Convolutional Codes Based on Channel Error Rate Estimation (채널 오류율 추정에 기반을 둔 길쌈부호의 개선된 재구성 알고리즘)

  • Seong, Jinwoo;Chung, Habong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.951-958
    • /
    • 2017
  • In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.

Estimation of Future Land Cover Considering Shared Socioeconomic Pathways using Scenario Generators (Scenario Generator를 활용한 사회경제경로 시나리오 반영 미래 토지피복 추정)

  • Song, Cholho;Yoo, Somin;Kim, Moonil;Lim, Chul-Hee;Kim, Jiwon;Kim, Sea Jin;Kim, Gang Sun;Lee, Woo-Kyun
    • Journal of Climate Change Research
    • /
    • v.9 no.3
    • /
    • pp.223-234
    • /
    • 2018
  • Estimation of future land cover based on climate change scenarios is an important factor in climate change impact assessment and adaptation policy. This study estimated future land cover considering Shared Socioeconomic Pathways (SSP) using Scenario Generators. Based on the storylines of SSP1-3, future population and estimated urban area were adopted for the transition matrix, which contains land cover change trends of each land cover class. In addition, limits of land cover change and proximity were applied as spatial data. According to the estimated land cover maps from SSP1-3 in 2030, 2050, and 2100, respectively, urban areas near a road were expanded, but agricultural areas and forests were gradually decreased. More drastic urban expansion was seen in SSP3 compared to SSP1 and SSP2. These trends are similar with previous research with regard to storyline, but the spatial results were different. Future land cover can be easily adjusted based on this approach, if econometric forecasts for each land cover class added. However, this requires determination of econometric forecasts for each land cover class.

On the Construction of the 90/150 State Transition Matrix Corresponding to the Trinomial x2n-1 + x + 1 (3항 다항식 x2n-1 + x + 1에 대응하는 90/150 상태전이행렬의 구성)

  • Kim, Han-Doo;Cho, Sung-Jin;Choi, Un-Sook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.2
    • /
    • pp.383-390
    • /
    • 2018
  • Since cellular automata(CA) is superior to LFSR in randomness, it is applied as an alternative of LFSR in various fields. However, constructing CA corresponding to a given polynomial is more difficult than LFSR. Cattell et al. and Cho et al. showed that irreducible polynomials are CA-polynomials. And Cho et al. and Sabater et al. gave a synthesis method of 90/150 CA corresponding to the power of an irreducible polynomial, which is applicable as a shrinking generator. Swan characterizes the parity of the number of irreducible factors of a trinomial over the finite field GF(2). These polynomials are of practical importance when implementing finite field extensions. In this paper, we show that the trinomial $x^{2^n-1}+X+1$ ($n{\geq}2$) are CA-polynomials. Also the trinomial $x^{2^a(2^n-1)}+x^{2^a}+1$ ($n{\geq}2$, $a{\geq}0$) are CA-polynomials.

Fabrication of nickel nanoparticles-embedded carbon particles by solution plasma in waste vegetable oil

  • Pansuwan, Gun;Phuksawattanachai, Surayouth;Kerdthip, Kraiphum;Sungworawongpana, Nathas;Nounjeen, Sarun;Anantachaisilp, Suranan;Kang, Jun;Panomsuwan, Gasidit;Ueno, Tomonaga;Saito, Nagahiro;Pootawang, Panuphong
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.10
    • /
    • pp.894-898
    • /
    • 2016
  • Solution plasma is a unique method which provides a direct discharge in solutions. It is one of the promising techniques for various applications including the synthesis of metallic/non-metallic nanomaterials, decomposition of organic compounds, and the removal of microorganism. In the context of nanomaterial syntheses, solution plasma has been utilized to produce carbon nanoparticles and metallic-carbon nanoparticle systems. The main purpose of this study was to synthesize nickel nanoparticles embedded in a matrix of carbon particles by solution plasma in one-step using waste vegetable oil as the carbon source. The experimental setup was done by simply connecting a bipolar pulsed power generator to nickel electrodes, which were submerged in the waste vegetable oil. Black powders of the nickel nanoparticles-embedded carbon (NiNPs/Carbon) particles were successfully obtained after discharging for 90 min. The morphology of the synthesized NiNPs/Carbon was investigated by a scanning electron microscope, which revealed a good dispersion of NiNPs in the carbon-particle matrix. The X-ray diffraction of NiNPs/Carbon clearly showed the co-existence of crystalline Ni nanostructures and amorphous carbon. The crystallite size of NiNPs (through the Ni (111) diffraction plane), as calculated by the Scherrer equation was found to be 64 nm. In addition, the catalytic activity of NiNPs/Carbon was evaluated by cyclic voltammetry in an acid solution. It was found that NiNPs/Carbon did not show a significant catalytic activity in the acid solution. Although this work might not be helpful in enhancing the activity of the fuel cell catalysts, it is expected to find application in other processes such as the CO conversion (by oxidation) and cyclization of organic compounds.

Development of Monte Carlo Simulation Code for the Dose Calculation of the Stereotactic Radiosurgery (뇌 정위 방사선수술의 선량 계산을 위한 몬테카를로 시뮬레이션 코드 개발)

  • Kang, Jeongku;Lee, Dong Joon
    • Progress in Medical Physics
    • /
    • v.23 no.4
    • /
    • pp.303-308
    • /
    • 2012
  • The Geant4 based Monte Carlo code for the application of stereotactic radiosurgery was developed. The probability density function and cumulative density function to determine the incident photon energy were calculated from pre-calculated energy spectrum for the linac by multiplying the weighting factors corresponding to the energy bins. The messenger class to transfer the various MLC fields generated by the planning system was used. The rotation matrix of rotateX and rotateY were used for simulating gantry and table rotation respectively. We construct accelerator world and phantom world in the main world coordinate to rotate accelerator and phantom world independently. We used dicomHandler class object to convert from the dicom binary file to the text file which contains the matrix number, pixel size, pixel's HU, bit size, padding value and high bits order. We reconstruct this class object to work fine. We also reconstruct the PrimaryGeneratorAction class to speed up the calculation time. because of the huge calculation time we discard search process of the ThitsMap and used direct access method from the first to the last element to produce the result files.

Simulation of the Phase-Type Distribution Based on the Minimal Laplace Transform (최소 표현 라플라스 변환에 기초한 단계형 확률변수의 시뮬레이션에 관한 연구)

  • Sunkyo Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.33 no.1
    • /
    • pp.19-26
    • /
    • 2024
  • The phase-type, PH, distribution is defined as the time to absorption into a terminal state in a continuous-time Markov chain. As the PH distribution includes family of exponential distributions, it has been widely used in stochastic models. Since the PH distribution is represented and generated by an initial probability vector and a generator matrix which is called the Markovian representation, we need to find a vector and a matrix that are consistent with given set of moments if we want simulate a PH distribution. In this paper, we propose an approach to simulate a PH distribution based on distribution function which can be obtained directly from moments. For the simulation of PH distribution of order 2, closed-form formula and streamlined procedures are given based on the Jordan decomposition and the minimal Laplace transform which is computationally more efficient than the moment matching methods for the Markovian representation. Our approach can be used more effectively than the Markovian representation in generating higher order PH distribution in queueing network simulation.

A Combining Scheme to Reduce Power Consumption in Cooperation and Cyclic Code for Wireless Sensor Networks (협력-순환 부호를 이용한 무선 센서 네트워크에서의 전력 소모 감소를 위한 결합기법에 관한 연구)

  • Kong, Hyung Yun;Hwang, Yun Kyeong;Hong, Seong Wook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.63-69
    • /
    • 2008
  • In this paper, our goal is to find a power-effective protocol that improves the accuracy of transmission in sensor networks. Therefore we propose a cooperative communication protocol based on MRC(Maximal Ratio Combining) and cyclic code. In our proposal, one sensor node assists two others to communicate with a clusterhead that can get diversity effect and MRC can improve diversity effect also. The proposed protocol with cyclic code can correct error up to 3-bit and reduce decoding complexity compared with convolutional code. Simulation results reveal proposed protocol can save the network energy up to 6dB over single-hop protocol at BER(Bit Error Rate) of $10^{-2}$.

  • PDF