Presented by: Shuang Li

Date: Friday, July 4, 2025
Time: 2:00 pm - 3:00 pm
Place: Zoom - see below.

Abstract: In wireless body area networks (WBANs), ensuring energy efficiency while maintaining reliable transmission poses a significant and inherently conflicting design challenge. This work introduces a multi-objective optimization (MOO) design for wireless transmission in the finite blocklength (FBL) regime within a WBAN environment, aimed at minimizing both energy consumption and packet error rate (PER) for each transmission session. An intelligent agent is trained to determine near-optimal transmission parameter values for different user preferences. Specifically, the MOO problem is reformulated as a multi-objective Markov decision process (MOMDP), and a multi-objective deep reinforcement learning (MODRL)-based solution is developed to approximate the Pareto front, where the penalty-based boundary intersection (PBI) approach is utilized for reward scalarization. Simulation results demonstrate that the proposed solution effectively adapts transmission parameters to balance energy efficiency and reliability according to user preferences. Furthermore, compared to linear scalarization, the PBI-based approach provides a more complete Pareto front.    

Join Zoom Meeting:

https://uvic.zoom.us/j/88502455728?pwd=zG5e2G6qzY1Sy4npl4Lca5dPVgx5JX.1

Meeting ID: 885 0245 5728

Password: 723504

One tap mobile

+16475580588,,88502455728# Canada

+17789072071,,88502455728# Canada

Dial by your location

        +1 647 558 0588 Canada

        +1 778 907 2071 Canada

Meeting ID: 885 0245 5728

Find your local number: https://uvic.zoom.us/u/kev7OXtKXz

Note: Please log in to Zoom via SSO and your UVic Netlink ID.

Presented by: Mehrab Najafian

Date: Tuesday, July 8, 2025
Time: 2:00 pm
Place: Zoom - see below.

Zoom Link: https://uvic.zoom.us/j/89048728223?pwd=TBRgGTaRarJcnDxoa0WtBfb4PJfZru.1

Meeting ID: 890 4872 8223

Password: 370127

Abstract:

In this seminar a new class of twin Sudoku tables (TSTs) is presented. These tables can be divided into both s×d and d×s subtables. They are constructed using the cyclotomic cosets of Zn via two distinct vectors of cyclotomic cosets elements and their Kronecker product. We prove that it is possible to generate m twin Sudoku tables that are strongly mutually distinct (SMD), i.e. for every 0 ≤ i, j ≤ m-1, the (i, j)-th entry of the tables contains different symbols. We also provide a method to construct m different TSTs that can be converted into twin solid Sudoku tables (TSSTs) as a perfect set of strongly mutually distinct TSSTs to make triplet solid Sudoku cubes (TSSCs). These TSSCs are symmetric cubes so that a cut from any of the six faces is a TSST.

Standard solid Sudoku cubes (SSSCs), a three-dimensional (3D) extension of Sudoku tables, are introduced, and a method to construct these cubes is presented. This is the first class of standard solid Sudoku cubes. An SSSC of order m is a solid Latin cube of order m with solid subcubes of order x×y×z in which each element occurs exactly once in each row, column, depth, and subcube. We make use of a vector Z and a basic table T to construct SSSCs. We obtain m tables by multiplying all entries of T by a number from the vector Z. Then, these tables are converted to an SSSC by stacking them in order. Based on this method of construction, a perfect set of strongly mutually distinct standard solid Sudoku cubes is designed. We also provide a two-dimensional (2D) representation of these SSSCs in a table with numbers placed on the main diagonal of its subtables. Finally, a new class of 3D Sudoku puzzles based on SSSCs is presented as standard solid Sudoku puzzles (SSSPs).

Presented by: Nafeesa Sheikh

Date: Thursday, July 10, 2025
Time: 9:30 am
Place: Zoom - see below.

Abstract : Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. One-dimensional Cellular Automata (CA) have been employed to produce m-sequences and pseudorandom sequences with high linear complexity and strong randomness characteristics. This thesis explores the application of one-dimensional CA with the shrinking generator approach to obtain sequences with high linear complexity and good randomness. An analysis of the properties of these sequences in relation to the corresponding m-sequences is given. Three types of shrinking generators are considered in this thesis.

Join Zoom Meeting

https://uvic.zoom.us/j/8524891329?pwd=VnNZbUE0RDFNQWdJNlBhdGpJcEdCdz09&omn=88199603737

Meeting ID: 852 489 1329

Password: 304802

One tap mobile

+17789072071,,8524891329# Canada

+16475580588,,8524891329# Canada

Dial by your location

        +1 778 907 2071 Canada

        +1 647 558 0588 Canada

Meeting ID: 852 489 1329

Find your local number: https://uvic.zoom.us/u/kcySgDAYTr