Page Not Found
Page not found. Your pixels are in another canvas.
Sitemap
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Pages
About me
About me
Page not in menu
This is a page not in th emain menu
Posts
[Ongoing Updates] CSI-based Human Pose Estimation
Published:
Human Pose Estimation
[Ongoing Updates] iOS Development Basics - To Do List
Published:
Basic To Do List Development for iOS
Sample Post
Published:
This is a sample blog post.
publications
Communication Efficiency and Security for Multi-Agent Reinforcement Learning
Published in OhioLink, 2023
Z. Zhang
Sample and Communication Efficient Fully Decentralized MARL Policy Evaluation via a New Approach: Local TD update
Published in International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2024
FNU Hairi, Z. Zhang, J. Liu
Digital Twin-Assisted Data-Driven Optimization for Reliable Edge Caching in Wireless Networks (Under Review)
Published in , 1900
Z. Zhang, Y. Liu, Z. Peng, M. Chen, D. Xu, S. Cui
Poisoning Attacks on Federated Learning-based Wireless Traffic Prediction
Published in IFIP/IEEE Networking, 2024
Z. Zhang, M. Fang, J. Huang, Y. Liu
Mapping Wireless Networks into Digital Reality through Joint Vertical and Horizontal Learning
Published in IFIP/IEEE Networking, 2024
Z. Zhang, M. Chen, Z. Yang, Y. Liu
Toward Byzantine-Robust Decentralized Federated Learning
Published in The 31th ACM Conference on Computer and Communications Security (CCS), 2024
M. Fang, Z. Zhang, Hairi, P. Khanduri, J. Liu, S. Lu, Y. Liu, Z. Gong
teaching
Teaching Assistant for ECE 3561
Undergraduate course, the Ohio State University, 2021
Served as TA from FA21 to SP23. Design and analysis of sequential circuits; digital circuit design using building blocks, programmable logic devices; design of basic computer components such as arithmetic logic units.
Teaching Assistant for CSC 505
Graduate course, North Carolina State University, 2023
Algorithm design techniques: use of data structures, divide and conquer, dynamic programming, greedy techniques, local and global search. Complexity and analysis of algorithms: asymptotic analysis, worst case and average case, recurrences, lower bounds, NP-completeness. Algorithms for classical problems including sorting, searching and graph problems (connectivity, shortest paths, minimum spanning trees).
Teaching Assistant for CSC 230
Undergraduate course, North Carolina State University, 2024
In this course, students will develop skills in several important areas. First, we’ll get some experience working in C, a language that lets us think like procedural rather than object-oriented developers. Also, being a fairly low-level language, C lets us see and control more of what’s going on in the hardware. This can help us think about using the hardware more effectively, whether we’re actually programming in C or in a higher-level language. While we learn C, we’ll also learn about tools and techniques that help us build, manage, debug and analyze software projects.