-
1.
公开(公告)号:US20220231960A1
公开(公告)日:2022-07-21
申请号:US17338718
申请日:2021-06-04
发明人: Jie Feng , Qingqi Pei , Peixin Yue
IPC分类号: H04L12/873 , H04W72/04 , H04L5/00 , H04N21/647
摘要: A method for joint optimization of resource allocation includes: obtaining network data volumes of two services; obtaining queue statuses at a time t; computing sub-channel slices; computing a local CPU speed scaling, a user association, a sub-carrier assignment, and a power allocation of service 1; computing a user association, a video quality decision, and a sub-carrier assignment of service 2; obtaining an initial sub-carrier assignment and an initial power allocation; obtaining the user association; obtaining the power allocation and the sub-carrier assignment of service 1; obtaining the video quality decision; obtaining the sub-carrier assignment of service 2; obtaining an optimal data transmission rate and the user association to obtain a data rate allocation; and obtaining an optimal CPU speed scaling, an optimal user association, an optimal sub-carrier assignment, an optimal power allocation, an optimal video quality decision and an optimal sub-channel allocation.
-
2.
公开(公告)号:US11757786B2
公开(公告)日:2023-09-12
申请号:US17338718
申请日:2021-06-04
发明人: Jie Feng , Qingqi Pei , Peixin Yue
IPC分类号: H04L12/873 , H04L47/52 , H04L5/00 , H04N21/647 , H04W72/0453
CPC分类号: H04L47/522 , H04L5/0098 , H04N21/647 , H04W72/0453
摘要: A method for joint optimization of resource allocation includes: obtaining network data volumes of two services; obtaining queue statuses at a time t; computing sub-channel slices; computing a local CPU speed scaling, a user association, a sub-carrier assignment, and a power allocation of service 1; computing a user association, a video quality decision, and a sub-carrier assignment of service 2; obtaining an initial sub-carrier assignment and an initial power allocation; obtaining the user association; obtaining the power allocation and the sub-carrier assignment of service 1; obtaining the video quality decision; obtaining the sub-carrier assignment of service 2; obtaining an optimal data transmission rate and the user association to obtain a data rate allocation; and obtaining an optimal CPU speed scaling, an optimal user association, an optimal sub-carrier assignment, an optimal power allocation, an optimal video quality decision and an optimal sub-channel allocation.
-
3.
公开(公告)号:US20220237519A1
公开(公告)日:2022-07-28
申请号:US17317908
申请日:2021-05-12
发明人: Lichuan Ma , Qingqi Pei , Zijun Huang
摘要: A distributed support vector machine privacy-preserving method includes: dividing a secret through secret sharing among all participating entities, iteratively exchanging a part of the information divided by the participating entities, and solving sub-problems locally; performing an iteration until a convergence is reached to find a global optimal solution; and in consideration of the generality of the privacy-preserving method, adopting a privacy-preserving method based on a vertical data distribution and a privacy-preserving method based on a horizontal data distribution, respectively; wherein the participating entities do not trust each other, and interact through a multi-party computation for local training. The method is applied to an honest-but-curious scenario, and uses the idea of data division to perform local computation through the interaction of part of the data among users to finally reconstruct the secret to preserve data privacy.
-
公开(公告)号:US20220222536A1
公开(公告)日:2022-07-14
申请号:US17325246
申请日:2021-05-20
发明人: Yang Xiao , Qingqi Pei , Zhuolin Xing
摘要: A trusted graph data node classification method includes: (1) inputting a topological graph and node features, and calculating a discrete Ricci curvature of the discrete topological graph; (2) preprocessing the curvature and the node features; (3) mapping the curvature, reconstructing original features, and performing a semi-supervised training on graph data containing adversarial examples; and (4) performing a classification on unlabeled nodes. The new method uses a discrete curvature to extract topological information, and uses a residual network to reconstruct node feature vectors without knowing the technical details of the adversarial examples, and without using a large number of adversarial examples for adversarial training. Hence, the system effectively defends against attacks from adversarial examples on the graph data, outperforms the existing mainstream models in terms of accuracy when used in data without adversarial examples, and is thus a trusted node classification system.
-
-
-