Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adaboost (1)
- Arithmetic Cost (1)
- Artificial neural networks (1)
- Content caching (1)
- Convergence (1)
-
- Cooperative cognitive radio network (1)
- Costs (1)
- DCT circuitry (1)
- Deep Q-learning (DQN) (1)
- Deep learning (1)
- Digital signal processors (1)
- Discrete Fourier Transforms (1)
- Discrete Sine Transform (1)
- Edge server (1)
- Fast algorithms (1)
- Fast and Efficient Algorithms (1)
- Games (1)
- Image compression techniques (1)
- Images (1)
- Internet of Things (1)
- Inversion algorithms (1)
- Mobile intelligent terminal (1)
- Power allocation (1)
- Q-learning (1)
- Quasiseparable matrix (1)
- Recursive Algorithms (1)
- Security level classifcation (1)
- Signal Flow Graphs (1)
- Sparse and Orthogonal Factors (1)
- Task analysis (1)
Articles 1 - 7 of 7
Full-Text Articles in Engineering
Cooperative Deep Q -Learning Framework For Environments Providing Image Feedback, Krishnan Raghavan, Vignesh Narayanan, Sarangapani Jagannathan
Cooperative Deep Q -Learning Framework For Environments Providing Image Feedback, Krishnan Raghavan, Vignesh Narayanan, Sarangapani Jagannathan
Publications
In this article, we address two key challenges in deep reinforcement learning (DRL) setting, sample inefficiency, and slow learning, with a dual-neural network (NN)-driven learning approach. In the proposed approach, we use two deep NNs with independent initialization to robustly approximate the action-value function in the presence of image inputs. In particular, we develop a temporal difference (TD) error-driven learning (EDL) approach, where we introduce a set of linear transformations of the TD error to directly update the parameters of each layer in the deep NN. We demonstrate theoretically that the cost minimized by the EDL regime is an approximation …
Reduced Multiplicative Complexity Discrete Cosine Transform (Dct) Circuitry, Sirani Kanchana Mututhanthrige Perera
Reduced Multiplicative Complexity Discrete Cosine Transform (Dct) Circuitry, Sirani Kanchana Mututhanthrige Perera
Publications
System and techniques for reduced multiplicative complexity discrete cosine transform (DCT) circuitry are described herein. An input data set can be received and, upon the input data set, a self-recursive DCT technique can be performed to produce a transformed data set. Here, the self-recursive DCT technique is based on a product of factors of a specified type of DCT technique. Recursive components of the technique are of the same DCT type as that of the DCT technique. The transformed data set can then be produced to a data consumer.
W-Gun: Whale Optimization For Energy And Delay-Centric Green Underwater Networks, Rajkumar Singh Rathore, Houbing Song, Suman Sangwan, Sukriti Mazumdar, Omprakash Kaiwartya, Kabita Adhikari, Rupak Kharel
W-Gun: Whale Optimization For Energy And Delay-Centric Green Underwater Networks, Rajkumar Singh Rathore, Houbing Song, Suman Sangwan, Sukriti Mazumdar, Omprakash Kaiwartya, Kabita Adhikari, Rupak Kharel
Publications
Underwater sensor networks (UWSNs) have witnessed significant R&D attention in both academia and industry due to their growing application domains, such as border security, freight via sea or river, natural petroleum production and the fishing industry. Considering the deep underwater-oriented access constraints, energy-centric communication for the lifetime maximization of tiny sensor nodes in UWSNs is one of the key research themes in this domain. Existing literature on green UWSNs are majorly adapted from the existing techniques in traditional wireless sensor network relying on geolocation and the quality of service-centric underwater relay node selection, without paying much attention to the dynamic …
Cache-Enabled In Cooperative Cognitive Radio Networks For Transmission Performance, Jiachen Yang, Houbing Song, Chaofan Ma, Jiabao Man, Huifang Xu, Gan Zheng
Cache-Enabled In Cooperative Cognitive Radio Networks For Transmission Performance, Jiachen Yang, Houbing Song, Chaofan Ma, Jiabao Man, Huifang Xu, Gan Zheng
Publications
The proliferation of mobile devices that support the acceleration of data services (especially smartphones) has resulted in a dramatic increase in mobile traffic. Mobile data also increased exponentially, already exceeding the throughput of the backhaul. To improve spectrum utilization and increase mobile network traffic, in combination with content caching, we study the cooperation between primary and secondary networks via content caching. We consider that the secondary base station assists the primary user by pre-caching some popular primary contents. Thus, the secondary base station can obtain more licensed bandwidth to serve its own user. We mainly focus on the time delay …
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Publications
With the rapid development of Internet of Things, massive mobile intelligent terminals are ready to access edge servers for real-time data calculation and interaction. However, the risk of private data leakage follows simultaneously. As the administrator of all intelligent terminals in a region, the edge server needs to clarify the ability of the managed intelligent terminals to defend against malicious attacks. Therefore, the security level classification for mobile intelligent terminals before accessing the network is indispensable. In this paper, we firstly propose a safety assessment method to detect the weakness of mobile intelligent terminals. Secondly, we match the evaluation results …
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Publications
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky
A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky
Publications
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having O(n2) complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we …