In this paper, a global methodology for the long-term prediction of time series is proposed. This methodology combines direct prediction strategy and sophisticated input selection criteria: k-nearest neighbors approximation method (k-NN), mutual information (MI) and nonparametric noise estimation (NNE). A global input selection strategy that combines forward selection, backward elimination (or ...

For some applications where the speed of decoding and the fault tolerance are important, like in video storing, one of the successful answers is Fix-Free Codes. These codes have been applied in some standards like H.263+ and MPEG-4. The cost of using fix-free codes is to increase the redundancy of the code which means the increase in the amount of bits we need to represent any peace of informat...

How can we test the correctness of a computer implementation of an algorithm such as Gaussian elimination, or the QR algorithm for the eigenproblem? This is an important question for program libraries such as LAPACK, that are designed to run on a wide range of systems. We discuss testing based on verifying known backward or forward error properties of the algorithms, with particular reference t...

Two sequential methods are described for sampling constrained binary sequences from partial solutions. The backward method computes elimination ideals over finite fields and constructs partial solutions that extend. The forward method uses numerical global optimization to determine which partial solutions extend. The methods are applied to restricted orderings, binary dynamics, and random graphs.

This paper deals with the recognition of spelled names over the telephone. It introduces an efficient way of handling the spelling grammar, that is the lexicon of the allowed spelled names. The proposed approach is based on a forward-backward algorithm. The constraints on the sequences of letters are derived from the lexicon and are used by the A* algorithm in the backward pass. This forward-ba...

In nite perfect information extensive (FPIE) games, backward induction (BI) gives rise to all pure-strategy subgame perfect Nash equilibria, and iterative elimination of weakly dominated strategies (IEWDS) may give di erent outcomes for di erent orders of elimination. Duggan recently posed several conjectures in an e ort to better understand the relationship between BI and IEWDS in FPIE games. ...

Software development involves many activities, and decision making is an essential one. Various factors can impact a decision-making process, by understanding such factors, one improve the process. Since people are ones decisions, some human-related aspects amongst those influencing factors. One aspect maker’s personality. This research investigates relationship between style personality within...