CTCihan Tepedelenlioglu

Cihan Tepedelenlioglu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Cihan Tepedelenlioglu has a total of 63 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Stability Analysis of a Modified SEIRS Compartmental Model for Infectious Diseases

    by Lavanya Shri Seplanatham Anjapuli, Bhavvikumar Patel, Mahesh K. Banavar, Cihan Tepedelenlioglu, Andreas Spanias, Stephanie Schuckers, Monalisa Achalla

    Mathematical representations of infectious diseases include compartment-based SEIR and SEIRS models. These models are represented using coupled differential equations that capture the flow of populations from one compartment to another and have been used for several infectious diseases such as HIV/AIDS, tuberculosis, Dengue fever, and COVID-19. This paper presents a modified Susceptible - Exposed - Infected - Recovered - Susceptible (SEIRS) compartment model for infectious diseases such as Influenza and COVID-19. We incorporate the compartments for exposed vaccinated and unvaccinated populations, and those with symptomatic and asymptomatic infections. We represent this model with a set of coupled differential equations and show that this system has, among its equilibrium points, an endemic equilibrium. The existence of the equilibrium points is validated using attractor plots. We derive the conditions for local and global stability of the two equilibrium points and derive the conditions under which the system moves from one state of equilibrium to another by varying two parameters values.

  • Open Access

    Real-Time Photovoltaic Array Topology Reconfiguration Using Embedded Machine Learning

    by Deep Pujara, Devarajan Srinivasan, Cihan Tepedelenlioglu, Andreas Spanias

  • Open Access

    Optimizing Solar Power Using Array Topology Reconfiguration With Regularized Deep Neural Networks

    by Vivek Narayanaswamy, Raja Ayyanar, Cihan Tepedelenlioglu, Devarajan Srinivasan, Andreas Spanias

    Reconfiguring photovoltaic (PV) array connections among different topologies such as series-parallel, bridge-link, honeycomb, or total-cross-tied is a popular strategy to mitigate impediments in power production caused by partial shading. Conventional approaches rely on either by-passing or replacing shaded modules with auxiliary panels through complex control mechanisms, optimization strategies, or simulator driven approaches to obtain the best topology. However, these solutions are not scalable and incur significant installation costs and computational overhead, motivating the need to develop ‘smart’ methods for topology reconfiguration. To this end, we propose a regularized neural network based algorithm that leverages panel-level sensor data to reconfigure the array to the topology that maximizes power output under arbitrary shading conditions. Based on our simulations that include wiring losses in different configurations, we observe power improvement of up to 11% through reconfiguration. The proposed algorithm can be easily integrated in any cyber-physical PV system with reconfiguration capabilities and is scalable.


  • Open Access

    Distributed Stochastic Gradient Descent with Cost-Sensitive and Strategic Agents

    by Abdullah Basar Akbay, Cihan Tepedelenlioglu

    This study considers a federated learning setup where cost-sensitive and strategic agents train a learning model with a server. During each round, each agent samples a minibatch of training data and sends his gradient update. As an increasing function of his minibatch size choice, the agent incurs a cost associated with the data collection, gradient computation and communication. The agents have the freedom to choose their minibatch size and may even opt out from training. To reduce his cost, an agent may diminish his minibatch size, which may also cause an increase in the noise level of the gradient update. The server can offer rewards to compensate the agents for their costs and to incentivize their participation but she lacks the capability of validating the true minibatch sizes of the agents. To tackle this challenge, the proposed reward mechanism evaluates the quality of each agent's gradient according to the its distance to a reference which is constructed from the gradients provided by other agents. It is shown that the proposed reward mechanism has a cooperative Nash equilibrium in which the agents determine the minibatch size choices according to the requests of the server.

  • Distributed Consensus-Based COVID-19 Hotspot Density Estimation

    by Monalisa Achalla, Gowtham Muniraju, Mahesh K. Banavar, Cihan Tepedelenlioglu, Andreas Spanias, Stephanie Schuckers

  • Graph-Based Classification With Multiple Shift Matrices

    by Jie Fan, Cihan Tepedelenlioglu, Andreas Spanias

    Due to their effectiveness in capturing similarities between different entities, graphical models are widely used to represent datasets that reside on irregular and complex manifolds. Graph signal processing offers support to handle such complex datasets. In this paper, we propose a novel graph filter design method for semi-supervised data classification. The proposed design uses multiple graph shift matrices, one for each feature, and is shown to provide improved performance when the feature qualities are uneven. We introduce three methods to optimize for the graph filter coefficients and the graph combining coefficients. The first method uses the alternating minimization approach. In the second method, we optimize our objective function by convex relaxation that provides a performance benchmark. The third method adopts a genetic algorithm, which is computationally efficient and better at controlling overfitting. In our simulation experiments, we use both synthetic and real datasets with informative and non-informative features. Monte Carlo simulations demonstrate the effectiveness of multiple graph shift operators in the graph filters. Significant improvements in comparison to conventional graph filters are shown, in terms of average error rate and confidence scores. Furthermore, we perform cross validation to show how our approach can control overfitting and improve generalization performance.


  • Open Access

    Dropout and Pruned Neural Networks for Fault Classification in Photovoltaic Arrays

    by Sunil Rao, Gowtham Muniraju, Cihan Tepedelenlioglu, Devarajan Srinivasan, Govindasamy Tamizhmani, Andreas Spanias

    Automatic detection of solar array faults reduces maintenance costs and increases efficiency. In this paper, we address the problem of fault detection, localization, and classification in utility-scale photovoltaic (PV) arrays using machine learning methods. More specifically, we develop a series of customized neural networks for detection and classification of solar array faults. We evaluate fault detection and classification using metrics such as accuracy, confusion matrices, and the Risk Priority Number (RPN). We examine and assess the use of customized neural networks with dropout regularizers. We develop and evaluate neural network pruning strategies and illustrate the trade-off between fault classification model accuracy and algorithm complexity. Our approach promises to elevate the performance and robustness of PV arrays and compares favorably against existing methods.


  • Subspace-Based Estimation of Rapidly Varying Mobile Channels for OFDM Systems

    by Habib Senol, Cihan Tepedelenlioglu

    It is well-known that time-varying channels can provide time diversity and improve error rate performance compared to time-invariant fading channels. However, exploiting time diversity requires very accurate channel estimates at the receiver. In order to reduce the number of unknown channel coefficients while estimating the time-varying channel, basis expansion models can be used along with long transmission frames that contain multiple orthogonal frequency division multiplexing (OFDM) symbols that experience the channel variation. The design of these OFDM frames need to judiciously incorporate training and data insertions in the transmitted signal while maintaining orthogonality. In this work, we propose an inter channel interference (ICI)-free training model depending on pilot symbols only and provide a corresponding time-varying channel estimation method. This scheme relies on an algorithm to determine the number of OFDM symbols per frame and the number of basis functions per path with minimal information about the Doppler bandwidth. As a performance benchmark, Bayesian Cramér Rao lower bound (CRLB) and the corresponding MSE bound are derived analytically for the proposed training model. Theoretical MSE expressions of the proposed estimation scheme are also derived as well as the MSE expressions in the presence of Doppler frequency mismatch. Simulations exhibit substantial MSE improvement and the corresponding Symbol Error Rate (SER) performances of the low complexity estimation scheme. They also corroborate that, unlike the common results in the literature, an OFDM system can perform better as the Doppler frequency increases with judicious design of training and channel estimation schemes.


  • Consensus Based Distributed Spectral Radius Estimation

    by Gowtham Muniraju, Cihan Tepedelenlioglu, Andreas Spanias

    A consensus based distributed algorithm to compute the spectral radius of a network is proposed. The spectral radius of the graph is the largest eigenvalue of the adjacency matrix, and is a useful characterization of the network graph. Conventionally, centralized methods are used to compute the spectral radius, which involves eigenvalue decomposition of the adjacency matrix of the underlying graph. Our distributed algorithm uses a simple update rule to reach consensus on the spectral radius, using only local communications. We consider time-varying graphs to model packet loss and imperfect transmissions, and provide the convergence characteristics of our algorithm, for both static and time-varying graphs. We prove that the convergence error is a function of principal eigenvector of adjacency matrix of the graph and reduces as $\mathcal {O}(1/t)$ , where $t$ is the number of iterations. The algorithm works for any connected graph structure. Simulation results supporting the theory are also presented.


  • Coverage-Based Designs Improve Sample Mining and Hyperparameter Optimization

    by Gowtham Muniraju, Bhavya Kailkhura, Jayaraman J. Thiagarajan, Peer-Timo Bremer, Cihan Tepedelenlioglu, Andreas Spanias

    Sampling one or more effective solutions from large search spaces is a recurring idea in machine learning (ML), and sequential optimization has become a popular solution. Typical examples include data summarization, sample mining for predictive modeling, and hyperparameter optimization. Existing solutions attempt to adaptively trade off between global exploration and local exploitation, in which the initial exploratory sample is critical to their success. While discrepancy-based samples have become the de facto approach for exploration, results from computer graphics suggest that coverage-based designs, e.g., Poisson disk sampling, can be a superior alternative. In order to successfully adopt coverage-based sample designs to ML applications, which were originally developed for 2-D image analysis, we propose fundamental advances by constructing a parameterized family of designs with provably improved coverage characteristics and developing algorithms for effective sample synthesis. Using experiments in sample mining and hyperparameter optimization for supervised learning, we show that our approach consistently outperforms the existing exploratory sampling methods in both blind exploration and sequential search with Bayesian optimization.