A decentralized batch-based group key management potocol for mobile Internet of Thngs (DBGK).

It is anticipated that constrained devices in the Internet of Things (IoT) will often operate in groups to achieve collective monitoring or management tasks. For sensitive and mission-critical sensing tasks, securing multicast applications is therefore highly desirable. To secure group communications, several group key management protocols have been introduced. However, the majority of the proposed solutions are not adapted to the IoT and its strong processing, storage, and energy constraints. In this context, we introduce a novel decentralized and batch-based group key management protocol to secure multicast communications. Our protocol is simple and it reduces the rekeying overhead triggered by membership changes in dynamic and mobile groups and guarantees both backward and forward secrecy. To assess our protocol, we conduct a detailed analysis with respect to its communcation and storage costs. This analysis is validated through simulation to highlight energy gains. The obtained results show that our protocol outperforms its peers with respect to keying overhead and the mobility of members.

Fuzzy interpolative reasoning via scale and move transformation

Z. Huang and Q. Shen. Fuzzy interpolative reasoning via scale and move transformation. IEEE Transactions on Fuzzy Systems, 14(2):340-359.

Subsethood-based Fuzzy Rule Models and their Application to Student Performance

K. Rasmani and Q. Shen. Subsethood-based Fuzzy Rule Models and their Application to Student Performance Classification. Proceedings of the 14th International Conference on Fuzzy Systems, pages 755-760, 2005.

Evolutionary approaches to fuzzy modelling for classification

M. Galea, Q. Shen and J. Levine. Evolutionary approaches to fuzzy modelling. Knowledge Engineering Review, 19(1):27-59, 2004.

Scale and move transformation-based fuzzy interpolative reasoning: A revisit

Z. Huang and Q. Shen. Scale and move transformation-based fuzzy interpolative reasoning: A revisit. Proceedings of the 13th International Conference on Fuzzy Systems, pages 623-628, 2004.

Fuzzy Interpolation and Extrapolation: A Practical Approach

Z. Huang and Q. Shen. Fuzzy interpolative and extrapolative reasoning: a practical approach. IEEE Transactions on Fuzzy Systems, 16(1):13-28, 2008.

'Citizen of nowhere' or 'the point where circles intersect'? Impartialist and embedded cosmopolitanisms?

Erskine, Toni, 'Citizen of nowhere' or 'the point where circles intersect'? Impartialist and embedded cosmopolitanisms', Review of International Studies (2002) 28(3) pp.457-477 RAE2008

Conservatism and Revolution: The All-Russian Union of Landowners, 1916-1918

Rendle, Matthew, 'Conservatism and Revolution: The All-Russian Union of Landowners, 1916-1918', Slavonic and East European Review (2006) 84(3) pp.481-507 RAE2008

Writing Home : Martin Walser's Ein fliehendes Pferd as Anti-Tourist Literature

Wilkinson, Jane, 'Writing Home: Martin Walser's Ein fliehendes Pferd as Anti-Tourist Literature', Journal of Tourism and Cultural Change (2006) 4(3) pp.001-017 RAE2008

Współpraca transgraniczna i regionalna w obszarze Morza Bałtyckiego w latach 1989 -2007

Wydział Nauk Politycznych i Dziennikarstwa

Akcesja Polski do Unii Europejskiej na łamach prasy regionalnej Ziem Zachodnich

Wydział Nauk Politycznych i Dziennikarstwa

Stosunki pomiędzy uprawnionym autorsko a organizacjami zbiorowego zarządzania w prawie polskim

Wydział Prawa i Administracji: Katedra Prawa Cywilnego, Ubezpieczeniowego i Handlowego

Charakter prawny spółki cywilnej na tle historycznym i prawnoporównawczym

Wydział Prawa i Administracji

Płynna tożsamość? Identyfikacje Francuzów algierskiego pochodzenia w powieściach autobiograficznych

Wydział Nauk Społecznych

On Learning Counting Functions With Queries

We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q ≥ 2 is polynomial time learnable using at most n + 1 equivalence queries, where the hypotheses issued by the learner are disjunctions of at most n counting functions with weights from Zp. The result is obtained through learning linear systems over an arbitrary field. In general a counting function may have a composite modulus. We prove that, for any given integer q ≥ 2, over the domain Zn2, the class of read-once disjunctions of Boolean-weighted counting functions with modulus q is polynomial time learnable with only one equivalence query, and the class of disjunctions of log log n Boolean-weighted counting functions with modulus q is polynomial time learnable. Finally, we present an algorithm for learning graph-based counting functions.