Recently, street furniture, including bins, seats, and bus shelters, has become smart as it has been equipped with environmental sensors, wireless modules, processors, and microcontrollers. Accordingly, smart furniture is expected to become a vital part of the IoT infrastructure and one of the drivers of future smart cities. This work focuses on how smart street furniture can be exploited within the IoT architecture as a basis of recommender systems, toward achieving smart cities' different components. We present and discuss recent relevant work as well as the key challenges and opportunities for future research. We explain that much work is still required when it comes to combining scalability, real-time processing, smart furniture, and recommender systems.
Data Security is the most important issue nowadays. A lot of cryptosystems are introduced to provide security. Public key cryptosystems are the most common cryptosystems used for securing data communication. Modular multiplication is the basic operation of common public key cryptosystems such as RSA, Diffie-Hellman key agreement (DH), ElGamal and ECC. Much research is now directed to reduce overall time consumed by modular multiplication operation. In this paper, we propose a parallelized version of the standard interleaved modular multiplication algorithm with a corresponding architecture. The proposed algorithm, EIMM, is based on an enhanced sign detection technique proposed by AbdelFattah et al. EIMM computes all possible intermediate results in parallel using the enhanced sign detection technique. EIMM computes modular multiplication without a pre computational phase or predefined sets for moduli. The proposed architecture is compared with a recent architecture, MIMM, proposed by AbdelFattah et al. Our architecture speeds up modular multiplication operation up to 1.99x compared with MIMM architecture. Additionally, our architecture improves area-time product. Hardware implementations of the existing and proposed algorithms have been introduced.
Matrix factorization is an advanced and efficient technique for recommender systems. Recently, Stochastic Gradient Descent (SGD) method is considered to be one of the most popular techniques for matrix factorization. SGD is a sequential algorithm, which is difficult to be parallelized for large-scale problems. Nowadays, researches focus on efficiently parallelizing SGD. In this research, we propose an efficient parallel SGD method, ESGD, for GPU. ESGD is more efficient than recent parallel methods because it utilizes GPU, reducing non-coalesced access of global memory and achieving load balance of threads. In addition, ESGD does not require any sorting and/or data shuffling as preprocessing phase. Although platform used for ESGD implementation is old, ESGD demonstrates 12.5× speedup over state-of-the-art GPU method, BSGD.