The subtle juncture cues in older varieties of English such as Received Pronunciation can be difficult for speakers of new English varieties to perceive. This study looks at the perception of word juncture characteristics in three varieties of English (British, Hong Kong and Singapore) amongst British, Hong Kong and Singaporean listeners in order to widen our understanding of English juncture c...

A previous study has been conducted integrating modification on secure hash algorithm 1 (SHA-1) to document integrity verification of printed documents using quick response (QR) codes. However, encryption is warranted as data transmitted in plaintext directly the server prevent hacking and ensuring not only but security well. more secured QR code was designed developed by successfully incorpora...

We investigate two cooperative variants (with and without lies) of the Guessing Secrets Problem, introduced in [4] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the e¢ cient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we establish that the algebra of all the states...

We show that in an o-minimal expansion of an ordered group finite definable extensions of a definable group which is defined in a reduct are already defined in the reduct. A similar result is proved for finite topological extensions of definable groups defined in o-minimal expansions of the ordered set of real numbers. ∗With partial support from the FCT (Fundação para a Ciência e Tecnologia) pr...

Rough set theory is a useful and effective tool to cope with granularity and vagueness in information system and has been used in many fields. However, it is hard to get the reduct of a covering in rough sets. This paper attempts to get the reduct of a covering at a high speed in theory. It defines upset and downset based on a poset in a covering, studies the relationship between reducible elem...

Keywords: Rough set theory Markov blanket Attribute reduction Rough co-training Partially labeled data Rough set theory is an effective supervised learning model for labeled data. However, it is often the case that practical problems involve both labeled and unlabeled data, which is outside the realm of traditional rough set theory. In this paper, the problem of attribute reduction for partiall...

When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Data mining is concerned with finding previously undiscovered relationships in data sets. Rough set theory provides a theoretical basis from which to find these undiscovered relationships. Automatic Target Recognition (A...

Smart Sort algorithm is a “smart” fusion of heap construction procedures (of Heap sort algorithm) into the conventional “Partition” function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its perfor...

Smart Sort algorithm is a “smart” fusion of heap construction procedures (of Heap sort algorithm) into the conventional “Partition” function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its perfor...

We show that every reduct of a stable, CM-trivial theory of finite Lascar rank is CM-trivial. AMS classification: 03C45