• Title/Summary/Keyword: Markov Network

Search Result 371, Processing Time 0.032 seconds

Priority MAC based on Multi-parameters for IEEE 802.15.7 VLC in Non-saturation Environments

  • Huynh, Vu Van;Le, Le Nam-Tuan;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3C
    • /
    • pp.224-232
    • /
    • 2012
  • Priority MAC is an important issue in every communication system when we consider differentiated service applications. In this paper, we propose a mechanism to support priority MAC based on multi-parameters for IEEE 802.15.7 visible light communication (VLC). By using three parameters such as number of backoff times (NB), backoff exponent (BE) and contention window (CW), we provide priority for multi-level differentiated service applications. We consider beacon-enabled VLC personal area network (VPAN) mode with slotted version for random access algorithm in this paper. Based on a discrete-time Markov chain, we analyze the performance of proposed mechanism under non-saturation environments. By building a Markov chain model for multi-parameters, this paper presents the throughput and transmission delay time for VLC system. Numerical results show that we can apply three parameters to control the priority for VLC MAC protocol.

Analysis of a Networked Control System using the Discrete-Time MJLS(Markov Jump Linear System) (이산 MJLS(Markov Jump Linear System)를 이용한 네트워크 제어시스템 해석)

  • Jung, Joon-Hong;Lee, Jae-Ho;Park, Tae-Dong;Park, Ki-Heon
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1693-1694
    • /
    • 2008
  • This paper deals with the stability analysis method of a networked control system using the discrete-time MJLS(Markov Jump Linear System). The necessary and sufficient conditions for the mean stability and mean square stability of a networked control system having data uncertainties are proposed. The numerical example is presented to illustrate the usefulness of proposed stability conditions.

  • PDF

A Method for Short Text Classification using SNS Feature Information based on Markov Logic Networks (SNS 특징정보를 활용한 마르코프 논리 네트워크 기반의 단문 텍스트 분류 방법)

  • Lee, Eunji;Kim, Pankoo
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.7
    • /
    • pp.1065-1072
    • /
    • 2017
  • As smart devices and social network services (SNSs) become increasingly pervasive, individuals produce large amounts of data in real time. Accordingly, studies on unstructured data analysis are actively being conducted to solve the resultant problem of information overload and to facilitate effective data processing. Many such studies are conducted for filtering inappropriate information. In this paper, a feature-weighting method considering SNS-message features is proposed for the classification of short text messages generated on SNSs, using Markov logic networks for category inference. The performance of the proposed method is verified through a comparison with an existing frequency-based classification methods.

Recognition of Restricted Continuous Korean Speech Using Perceptual Model (인지 모델을 이용한 제한된 한국어 연속음 인식)

  • Kim, Seon-Il;Hong, Ki-Won;Lee, Haing-Sei
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.3
    • /
    • pp.61-70
    • /
    • 1995
  • In this paper, the PLP cepstrum which is close to human perceptual characteristics was extracted through the spread time area to get the temperal feature. Phonemes were recognized by artificial neural network similar to the learning method of human. The phoneme strings were matched by Markov models which well suited for sequence. Phoneme recognition for the continuous Korean speech had been done using speech blocks in which speech frames were gathered with unequal numbers. We parameterized the blocks using 7th order PLPs, PTP, zero crossing rate and energy, which neural network used as inputs. The 100 data composed of 10 Korean sentences which were taken from the speech two men pronounced five times for each sentence were used for the the recognition. As a result, maximum recognition rate of 94.4% was obtained. The sentence was recognized using Markov models generated by the phoneme strings recognized from earlier results the recognition for the 200 data which two men sounded 10 times for each sentence had been carried out. The sentence recognition rate of 92.5% was obtained.

  • PDF

A study on the new hybrid recurrent TDNN-HMM architecture for speech recognition (음성인식을 위한 새로운 혼성 recurrent TDNN-HMM 구조에 관한 연구)

  • Jang, Chun-Seo
    • The KIPS Transactions:PartB
    • /
    • v.8B no.6
    • /
    • pp.699-704
    • /
    • 2001
  • ABSTRACT In this paper, a new hybrid modular recurrent TDNN (time-delay neural network)-HMM (hidden Markov model) architecture for speech recognition has been studied. In TDNN, the recognition rate could be increased if the signal window is extended. To obtain this effect in the neural network, a high-level memory generated through a feedback within the first hidden layer of the neural network unit has been used. To increase the ability to deal with the temporal structure of phonemic features, the input layer of the network has been divided into multiple states in time sequence and has feature detector for each states. To expand the network from small recognition task to the full speech recognition system, modular construction method has been also used. Furthermore, the neural network and HMM are integrated by feeding output vectors from the neural network to HMM, and a new parameter smoothing method which can be applied to this hybrid system has been suggested.

  • PDF

Energy Harvesting in Multi-relay Multiuser Networks based on Two-step Selection Scheme

  • Guo, Weidong;Tian, Houyuan;Wang, Qing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4180-4196
    • /
    • 2017
  • In this paper, we analyze average capacity of an amplify-and-forward (AF) cooperative communication system model in multi-relay multiuser networks. In contrast to conventional cooperative networks, relays in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the source for their cooperative information transmission. Based on this structure, a two-step selection scheme is proposed considering both channel state information (CSI) and battery status of relays. Assuming each relay has infinite or finite energy storage for accumulating the energy, we use the infinite or finite Markov chain to capture the evolution of relay batteries and certain simplified assumptions to reduce computational complexity of the Markov chain analysis. The approximate closed-form expressions for the average capacity of the proposed scheme are derived. All theoretical results are validated by numerical simulations. The impacts of the system parameters, such as relay or user number, energy harvesting threshold and battery size, on the capacity performance are extensively investigated. Results show that although the performance of our scheme is inferior to the optimal joint selection scheme, it is still a practical scheme because its complexity is much lower than that of the optimal scheme.

Analysis and Prediction Algorithms on the State of User's Action Using the Hidden Markov Model in a Ubiquitous Home Network System (유비쿼터스 홈 네트워크 시스템에서 은닉 마르코프 모델을 이용한 사용자 행동 상태 분석 및 예측 알고리즘)

  • Shin, Dong-Kyoo;Shin, Dong-Il;Hwang, Gu-Youn;Choi, Jin-Wook
    • Journal of Internet Computing and Services
    • /
    • v.12 no.2
    • /
    • pp.9-17
    • /
    • 2011
  • This paper proposes an algorithm that predicts the state of user's next actions, exploiting the HMM (Hidden Markov Model) on user profile data stored in the ubiquitous home network. The HMM, recognizes patterns of sequential data, adequately represents the temporal property implicated in the data, and is a typical model that can infer information from the sequential data. The proposed algorithm uses the number of the user's action performed, the location and duration of the actions saved by "Activity Recognition System" as training data. An objective formulation for the user's interest in his action is proposed by giving weight on his action, and change on the state of his next action is predicted by obtaining the change on the weight according to the flow of time using the HMM. The proposed algorithm, helps constructing realistic ubiquitous home networks.

A Study on Construction of Acoustical Phoneme Models Using Hidden Markov Network (Hidden Markov Network를 이용한 음향학적 음소모델 작성에 관한 검토)

  • Oh Se-Jin;Lim Young-Choon;Hwang Cheol-Jun;Kim Bum-Koog;Chung Hyun-Yeol
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • autumn
    • /
    • pp.29-32
    • /
    • 2000
  • 본 논문에서는 음성인식 시스템의 음향모델 개선을 위한 기초적 연구로서, 문맥적인 요소를 필요로 하는 SSS(Successive State Splitting)와 필요로 하지 않는 SSS-free 알고리즘을 이용한 HMnet(Hidden Markov Network) 음향모델 작성방법에 대해 검토하고 작성한 음향모델을 한국어에 적용하여 그 유효성을 확인하였다. HMnet을 이용한 음소모델의 작성방법은 전체 학습 데이터에 대해서 각각 2개의 상태를 가지는 초기 모델을 작성한 후, 이를 시간과 문맥방향으로의 최대 분포를 가지는 상태를 재분할한 후 임의의 상태수가 될 때까지 상태분할을 계속적으로 수행케 하여 각 음소모델을 작성하게 된다. 작성한 HMnet 음향모델의 유효성을 확인하기 위해 ETRI 445 단어의 3인에 대한 화자종속 음소인식 실험을 수행하였다. 인식실험 결과, SSS 알고리즘을 이용한 화자종속실험의 경우 상태수 520에서 평균 $62.8\%$의 인식률을, SSS-free 알고리즘의 경우 상태수 420에서 평균 $64.2\%$의 인식률을 얻었다. 이 결과는 HMM을 이용한 경우(약$43.4\%$)보다 $20\%$이상의 인식률 향상을 보여 이 알고리즘의 유효성을 확인할 수 있었다. SSS와 SSS-free를 비교한 경우, SSS-free가 SSS보다 낮은 상태수에서 평균 $1.4\% 향상된 인식률을 보였다.

  • PDF

Hierarchical Power Management Architecture and Optimal Local Control Policy for Energy Efficient Networks

  • Wei, Yifei;Wang, Xiaojun;Fialho, Leonardo;Bruschi, Roberto;Ormond, Olga;Collier, Martin
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.540-550
    • /
    • 2016
  • Since energy efficiency has become a significant concern for network infrastructure, next-generation network devices are expected to have embedded advanced power management capabilities. However, how to effectively exploit the green capabilities is still a big challenge, especially given the high heterogeneity of devices and their internal architectures. In this paper, we introduce a hierarchical power management architecture (HPMA) which represents physical components whose power can be monitored and controlled at various levels of a device as entities. We use energy aware state (EAS) as the power management setting mode of each device entity. The power policy controller is capable of getting information on how many EASes of the entity are manageable inside a device, and setting a certain EAS configuration for the entity. We propose the optimal local control policy which aims to minimize the router power consumption while meeting the performance constraints. A first-order Markov chain is used to model the statistical features of the network traffic load. The dynamic EAS configuration problem is formulated as a Markov decision process and solved using a dynamic programming algorithm. In addition, we demonstrate a reference implementation of the HPMA and EAS concept in a NetFPGA frequency scaled router which has the ability of toggling among five operating frequency options and/or turning off unused Ethernet ports.

Delay characteristics of speech packets in virtual cellular network(VCN) (가상 셀룰라 망(VCN)에서의 음성 패킷 지연 특성)

  • 정명순;김화종
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2305-2312
    • /
    • 1998
  • This paper analyzed the delay characteristics of speech packets in virtual cellular network(VCN). The probability distribution of packet delay is obtained using the markov chain model when periodic speech packets are transmitted by slotted-ALOHA protocol. The effects of probility of capture and retransmission policy on the performance were also analyzed. At first, the probability cumulative function of packet delay is calculated from the probability of capture as a function of location of mobile terminal. In order to investigate the effects of backoff delay, we defined a parameter NPr, where N is the period (frame size) of the speech packets and Pr is the retransmission probability for each speech packet. We also obtained the 1% outage delay for various frame size N.

  • PDF