Author Archives: benkoczi


  • Selfish mining: Dr. Muhammad Khan’s presentation for BTS 2018.
  • Blockchain based systems and IoT: one graduate student supervised

Lethbridge Blockchain Workshop and Hackathon

The Lethbridge Blockchain Workshop and Hackathon is a problem pitch contest and smart contract coding competition, organized at the University of Lethbridge, Alberta, Canada by members of the Optimization Research Group in collaboration with colleagues from the Dhillon School of Business and with the support of the University-Industry Liaison Office.

Organizers: Robert Benkoczi (ORG), Muhammad Khan (ORG), Afrooz Maotari-Kazerouni (DSB), Greg Vilk (UILO), Rossitsa Yalamova (DSB).

Additional information

Optimization Seminar Series – Wed Oct 17, 2018 @ noon in C630

Speaker: Dr Fatih Celik.
Title: Behavior of honeybees foraging for nectar and a large scale routing protocol implementation in wireless sensor networks
Room: C630
Date: Wed, Oct 17, 2018
Time: 12:00 – 12:50 pm.

Insect colonies are an attractive research topic for the researcher in electrical engineering and computer science who develops and designs shortest path algorithms. Bees use energy very efficiently and have the ability to find shortest routes to their source of food. Wireless sensor networks have similarities with honeybee colonies in terms of finding shortest paths for communication and consuming energy efficiently. In this presentation, we focus on an optimal method based on swarm intelligence (SI) inspired by honeybees and the behavior of honeybee foraging for nectar. Also, we analyze a routing protocol implementation in wireless sensor networks.

Fatih Celik received his Ph.D. in Electronics and Computer Science from the University of Sakarya, Turkey. He was an Assistant Professor at Sakarya University and a visiting scholar at University of Pittsburgh, USA. His research interests include parallel and distributed simulation, modeling and simulation of large-scale networks, biologically-inspired optimization schemes, cognitive radio networks, mobile ad hoc networks and wireless sensor networks. His main research interest lies in parallel and distributed simulation and routing protocols for the wireless sensor network.

CPSC 4110/5110/7110 – Introduction to Algorithms in Facility Location

The course materials are available on moodle to registered students.
Course outline.
There is no textbook for this course. Readings from academic articles will be available on the moodle page of the course. A list of classical papers in facility location is available from Trevor Hale’s bibliography.

CPSC 4210/5210: Wireless Networks

The course is available on Moodle.

Optimization Seminar Series – Fri Dec 16, 2016, noon, in B543

Title: Parameterized Query Complexity of Quantum Computation
Speaker: Parijat Purohit, MSc candidate, Optimization Research Group

Abstract: Our proposal is to analyze the query complexity of a problem as a function of some parameter. This extends the parameterized complexity studies in the classical setting. We illustrate the applicability of this methodology on two seemingly unrelated problems. We parameterize the degree of imbalance for an arbitrary function whether it is balanced or not. We consider the same parameterization for the self-duality of a function.
Joint work with Saurya Das (Physics), Daya Gaur, Shahadat Hossain, and Robert Benkoczi.
Work accepted for presentation as a poster at the 20th Annual Conference on Quantum Information Processing, Seattle, WA.

Optimization Seminar Series – Wed. Oct 19, 2016, noon, in C620

Title: Algorithms for Barrier Coverage with Wireless Sensors
Speaker: Dr. Xiao Zhang, City University of Hong-Kong

Abstract: Barrier coverage is a critical problem in wireless sensor networks. In the area, we study the barrier coverage problem from two perspectives, i.e., static sensors with adjustable sensing ranges and mobile sensors with fixed sensing ranges. Specifically, in the first topic, we consider the barrier coverage problem for a line interval, in which we are given a set of sensors and the goal is to determine a range assignment with the lowest possible cost. In the second topic, we consider the problem of covering a line interval by mobile sensors such that the maximum of moving cost is minimized.

Bio: Xiao Zhang received his PhD degree from Department of Computer Science in City University of Hong Kong, Hong Kong, 2016. He was a visiting scholar with the Department of Computer Science in Utah State University, Logan, Utah, USA, in 2015. His research interests include algorithms design and analysis, wireless sensor networks.

CPSC 3780 for Dr. Gaur (Sept 20-22, 2016)

Topics: Fourier transforms, the sampling theorem, Shannon formula for the capacity of a communication channel.



CPSC 2620 for Dr. Hossain (Sept 13-15, 2016)

Lectures for the week: Sep 13-15.
Topic: an introduction to classes.
Text: Chapter 7 in Skansholm.
Notes available here (updated Sept 18).
Source code including homework available at cloud9 or as a zip file (updated Sept 18).

Optimization Seminar Series – Wed. Jul 13, 2016, noon, in B543

Title: Local Search Algorithms for Data Placement Problem
Speaker: Anamay Sarkar, NIT Rourkela, MITACS Globalink Fellow in the Optimization Research Group

Abstract: I will talk about Local Search based Approximation Algorithms for the data placement problem. One of the local search operators is based on the assignment problem and the second one is based on the operators for the Un-capacitated facility location problem. I will report some experimental results on the data set obtained from the OR library. This work was done as part of Mitacs Globalink internship.

Bio: Anamay Sarkar is pursuing B. Tech in Computer Science and Engineering and is currently in his final year at NIT Rourkela. His past internship was at “IIT Delhi” in the area of Approximation Algorithms under Prof Naveen Garg. He is currently the branch topper after 3rd year.