Recently a generalized hidden Markov model (GHMM) was proposed for solving the information fusion problems under aleatory and epistemic uncertainties in engineering application. In GHMM, aleatory uncertainty is captured by the probability measure whereas epistemic uncertainty is modeled by generalized interval. In this paper, the problem of how to train the GHMM with a small amount of observati...

The possibility of handling infrequent, higher density, additional loads, used mainly for on-line characterization of workloads, is considered. This is achieved through a sliding version of a hidden Markov model (SlidHMM). Essentially, a SlidHMM keeps track of processes that change with time and the constant size of the observation set helps reduce the space and time complexity of the Baum-Welc...

We have been developing a general symbolic-statistical modeling language [6, 19, 20] based on the logic programming framework that semantically uni es (and extends) major symbolic-statistical frameworks such as hidden Markov models (HMMs) [18], probabilistic contextfree grammars (PCFGs) [23] and Bayesian networks [16]. The language, PRISM, is intended to model complex symbolic phenomena governe...

Abstract In this article, we will design a computer program to solve graph colouring and visualize the variation of exam scheduling modelling at Binus University in graphs based on Welch Powell Algorithm. A vertex G = (V, E) is an F: V → N mapping where adjacent are different colours N, i.e. if edge (u, v) E, then F (u) not equal (v). The formulation problems regarding programs small experiment...

This condition is implied by (1). Thus, we have proved one can correct e errors under (1). Now we have to prove that one can correct the s erasures under (1). Let z′ be the output after correcting e errors. Now we extend z′ to z ∈ (F∪ {?}) in the natural way. Finally, run the erasure decoding algorithm on z. This works as long as s < (n− k + 1), which in turn is true by (1). The time complexity...

A new secret writing using DES and DEFLATE algorithm is explored by improving the previous attempts in this sense in terms of security and compression. A Matching Pursuit algorithm using redundant basis decomposition technique is used to securely hide a message. The stability and computational complexity problems are solved by introducing new selection and update rules working entirely in the i...

This article re-examines two historic Supreme Court’s decisions—the 1964 Times v. Sullivan and the 1974 Gertz v. Welch—as they apply to the digital era. The Court’s decision in Sullivan established the federal legal guidelines for a victim to prove a libel case including actual malice. In Gertz v. Welch the Court established three categories of public figures who must prove actual malice in a l...

The discrimination technique for estimating parameters of Gaussian mixtures that is based on the Extended Baum-Welch transformations (EBW) has had significant impact on the speech recognition community. In this paper we introduce a general definition of a family of EBW transformations that can be associated with a weighted sum of updated and initial models. We compute a gradient steepness measu...

Since 1968, when the Golomb–Welch conjecture was raised, it has become the main motive power behind the progress in the area of the perfect Lee codes. Although there is a vast literature on the topic and it is widely believed to be true, this conjecture is far from being solved. In this paper, we provide a survey of papers on the Golomb–Welch conjecture. Further, new results on Golomb–Welch con...

We study the nonlinearity of Exponential Welch Costas functions using the Fourier transform on Zn. Exponential Welch Costas functions are bijections from Zp−1 to Zp−1 defined using the exponential function of Zp, where p is an odd prime. Their linearity properties were recently studied by Drakakis, Requena, and McGuire, who conjectured that the absolute values of the Fourier coefficients of an ...