Users speaking different languages may prefer different patterns in creating their passwords, and thus knowledge on English passwords cannot help to guess passwords from other languages well. Research has already shown Chinese passwords are one of the most difficult ones to guess. We believe that the conclusion is biased because, to the best of our knowledge, little empirical study has examined...

Machine Translation (MT) systems that process unrestricted text should be able to deal with words that are not found in the MT lexicon. Without some kind of recognition, the parse may be incomplete, there is no transfer for the unfound word, and tests for transfers for surrounding words will often fail, resulting in poor translation. Interestingly, not much has been published on unfoundword gue...

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice’s card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob’s best st...

We obtain minimax lower bounds on the regret for the classical two-armed bandit problem. We provide a finite-sample minimax version of the well-known log asymptotic lower bound of Lai and Robbins. The finite-time lower bound allows us to derive conditions for the amount of time necessary to make any significant gain over a random guessing strategy. These bounds depend on the class of possible d...

Metadiscourse markers help writers make coherent and reader- friendly texts, thus of considerable importance in academic writing. The main aim of this study was to investigate how interactive and interactional metadiscourse markers are used by Iranian EFL learners. An inquiry was carried out to investigate cross-cultural similarities and differences in the use of metadiscourse markers in the Di...

We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph CN , is guessing their own hat colour merely on the basis of observing the hats worn by their two neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at leas...

Machine Translation (MT) systems that process unrestricted text should be able to deal with words that are not found in the MT lexicon. Without some kind of recognition, the parse may be incomplete, there is no transfer for the unfound word, and tests for transfers for surrounding words will often fail, resulting in poor translation. Interestingly, not much has been published on unfoundword gue...