Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Computer Engineering

Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu Jan 2022

Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu

Electrical & Computer Engineering Faculty Publications

Energy detection (ED) represents a low complexity approach used by secondary users (SU) to sense spectrum occupancy by primary users (PU) in cognitive radio (CR) systems. In this paper, we present a new algorithm that senses the spectrum occupancy by performing ED in K consecutive sensing time slots starting from the current slot and continuing by alternating before and after the current slot. We consider a PU traffic model specified in terms of an average duty cycle value, and derive analytical expressions for the false alarm probability (FAP) and correct detection probability (CDP) for any value of K . Our …


Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism For Solving Large-Scale Economic Dispatch With Valve-Point Effects And Multiple Fuel Options, Yude Yang, Bori Wei, Hui Liu, Yiyi Zhang, Junhui Zhao, Emad Manla Aug 2018

Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism For Solving Large-Scale Economic Dispatch With Valve-Point Effects And Multiple Fuel Options, Yude Yang, Bori Wei, Hui Liu, Yiyi Zhang, Junhui Zhao, Emad Manla

Electrical & Computer Engineering and Computer Science Faculty Publications

This paper presents a new metaheuristic optimization algorithm, the firefly algorithm (FA), and an enhanced version of it, called chaos mutation FA (CMFA), for solving power economic dispatch problems while considering various power constraints, such as valve-point effects, ramp rate limits, prohibited operating zones, and multiple generator fuel options. The algorithm is enhanced by adding a new mutation strategy using self-adaptation parameter selection while replacing the parameters with fixed values. The proposed algorithm is also enhanced by a self-adaptation mechanism that avoids challenges associated with tuning the algorithm parameters directed against characteristics of the optimization problem to be solved. The …


Investigation Of Lstm Based Prediction For Dynamic Energy Management In Chip Multiprocessors, Milad Ghorbani Moghaddam, Wenkai Guan, Cristinel Ababei Mar 2018

Investigation Of Lstm Based Prediction For Dynamic Energy Management In Chip Multiprocessors, Milad Ghorbani Moghaddam, Wenkai Guan, Cristinel Ababei

Electrical and Computer Engineering Faculty Research and Publications

In this paper, we investigate the effectiveness of using long short-term memory (LSTM) instead of Kalman filtering to do prediction for the purpose of constructing dynamic energy management (DEM) algorithms in chip multi-processors (CMPs). Either of the two prediction methods is employed to estimate the workload in the next control period for each of the processor cores. These estimates are then used to select voltage-frequency (VF) pairs for each core of the CMP during the next control period as part of a dynamic voltage and frequency scaling (DVFS) technique. The objective of the DVFS technique is to reduce energy consumption …


Heuristic Algorithms For Optimization Of Task Allocation And Result Distribution In Peer-To-Peer Computing Systems, Grzegorz Chmaj, Krzysztof Walkowiak, Michal Tarnawski, Michal Kucharzak Sep 2012

Heuristic Algorithms For Optimization Of Task Allocation And Result Distribution In Peer-To-Peer Computing Systems, Grzegorz Chmaj, Krzysztof Walkowiak, Michal Tarnawski, Michal Kucharzak

Electrical & Computer Engineering Faculty Research

Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects. A significant example of the P2P computing idea is the BOINC (Berkeley Open Infrastructure for Network Computing) project. To improve the performance of the computing system, we propose to use the P2P …


Preliminary Study On Optimization Of Data Distribution In Resource Sharing Systems, Grzegorz Chmaj, Krzysztof Walkowiak Aug 2008

Preliminary Study On Optimization Of Data Distribution In Resource Sharing Systems, Grzegorz Chmaj, Krzysztof Walkowiak

Electrical & Computer Engineering Faculty Research

Grid structures are increasingly considered as very convergent with peer-to-peer networks. This paper presents a model of network acting both as grid and peer-to-peer network, used for data computation and distribution. Presented PPLC algorithm is a complete solution for both grid and peer-to-peer points of view. Problem formulation is presented, as well as solution heuristic algorithm and research results.