We propose a bi-level bargaining framework for distributed user association and resource allocation. In the followerlevel game, UE competition occurs in a non-cooperative manner. In contrast, full coordination is assumed among the BSs in the leader-level game. Congestion factors are introduced to balance the loads on small BSs with different capacities We consider two fundamental limitations of HetNets: the backhaul bottleneck and UE capability constraints. Accordingly, constraints are introduced on the wireless resources and maximum number of serving UEs in small BSs to reflect the backhaul bottleneck, and minimum rate requirements for UE devices are introduced to represent the UE capability constraints. Potential game theory is used to decouple the backhaul bottleneck constraints. The existence, uniqueness and convergence of the Nash equilibrium (NE) of the follower-level game are also verified. Finally, the resident-oriented GS algorithm is used to obtain a stable single-BS association.翻译

TEA: A Traffic-efficient Erasure-coded Archival Scheme for In-memory Stores

An issue of redundancy transition from replication to erasure coding (a.k.a., erasure-coded archival) should be addressed for unpopular in-memory datasets, since caching workloads exhibit long-tail ...

A Layer-Level Parallel Encoding Framework for SVC

In this paper, we we first propose a parallel video coding framework, where three important factors: parallel strategy, computation complexity and scheduling of tasks are considered. Then ...

Algorithm 1: The online LyDROO algorithm for solving (P1). input : Parameters V , {γi, ci}Ni=1, K, training interval δT , Mt update interval δM ; output: Control actions 􏰕xt,yt􏰖Kt=1; 1 Initialize the DNN with random parameters θ1 and empty replay memory, M1 ← 2N; 2 Empty initial data queue Qi(1) = 0 and energy queue Yi(1) = 0, for i = 1,··· ,N; 3 fort=1,2,...,Kdo 4 Observe the input ξt = 􏰕ht, Qi(t), Yi(t)􏰖Ni=1 and update Mt using (8) if mod (t, δM ) = 0; 5 Generate a relaxed offloading action xˆt = Πθt 􏰅ξt􏰆 with the DNN; 6 Quantize xˆt into Mt binary actions 􏰕xti|i = 1, · · · , Mt􏰖 using the NOP method; 7 Compute G􏰅xti,ξt􏰆 by optimizing resource allocation yit in (P2) for each xti; 8 Select the best solution xt = arg max G 􏰅xti , ξt 􏰆 and execute the joint action 􏰅xt , yt 􏰆; { x ti } 9 Update the replay memory by adding (ξt,xt); 10 if mod (t, δT ) = 0 then 11 Uniformly sample a batch of data set {(ξτ , xτ ) | τ ∈ St } from the memory; 12 Train the DNN with {(ξτ , xτ ) | τ ∈ St} and update θt using the Adam algorithm; 13 end 14 t ← t + 1; 15 Update {Qi(t),Yi(t)}N based on 􏰅xt−1,yt−1􏰆 and data arrival observation 􏰙At−1􏰚N using (5) and (7). i=1 i i=1 16 end With the above actor-critic-update loop, the DNN consistently learns from the best and most recent state-action pairs, leading to a better policy πθt that gradually approximates the optimal mapping to solve (P3). We summarize the pseudo-code of LyDROO in Algorithm 1, where the major computational complexity is in line 7 that computes G􏰅xti,ξt􏰆 by solving the optimal resource allocation problems. This in fact indicates that the proposed LyDROO algorithm can be extended to solve (P1) when considering a general non-decreasing concave utility U (rit) in the objective, because the per-frame resource allocation problem to compute G􏰅xti,ξt􏰆 is a convex problem that can be efficiently solved, where the detailed analysis is omitted. In the next subsection, we propose a low-complexity algorithm to obtain G 􏰅xti, ξt􏰆. B. Low-complexity Algorithm for Optimal Resource Allocation Given the value of xt in (P2), we denote the index set of users with xti = 1 as Mt1, and the complementary user set as Mt0. For simplicity of exposition, we drop the superscript t and express the optimal resource allocation problem that computes G 􏰅xt, ξt􏰆 as following (P4) : maximize 􏰀j∈M0 􏰕ajfj/φ − Yj(t)κfj3􏰖 + 􏰀i∈M1 {airi,O − Yi(t)ei,O} (28a) τ,f,eO,rO 17 ，建立了什么模型

这段文字并没有建立具体的模型，而是介绍了LyDROO算法的伪代码以及解决问题(P1)和(P4)的方法。该算法是一种在线学习算法，利用深度神经网络来近似最优策略，并通过解决最优资源分配问题来求解目标函数。...

The human visual cortex is biased towards shape components while CNNs produce texture biased features. This fact may explain why the performance of CNN significantly degrades with low-labeled input data scenarios. In this paper, we propose a frequency re-calibration U-Net (FRCU-Net) for medical image segmentation. Representing an object in terms of frequency may reduce the effect of texture bias, resulting in better generalization for a low data regime. To do so, we apply the Laplacian pyramid in the bottleneck layer of the U-shaped structure. The Laplacian pyramid represents the object proposal in different frequency domains, where the high frequencies are responsible for the texture information and lower frequencies might be related to the shape. Adaptively re-calibrating these frequency representations can produce a more discriminative representation for describing the object of interest. To this end, we first propose to use a channel-wise attention mechanism to capture the relationship between the channels of a set of feature maps in one layer of the frequency pyramid. Second, the extracted features of each level of the pyramid are then combined through a non-linear function based on their impact on the final segmentation output. The proposed FRCU-Net is evaluated on five datasets ISIC 2017, ISIC 2018, the PH2, lung segmentation, and SegPC 2021 challenge datasets and compared to existing alternatives, achieving state-of-the-art results.请详细介绍这段话中的技术点和实现方式

该网络结构的核心思想是将物体表示为频率，在低数据情况下降低纹理偏差的影响，从而获得更好的泛化性能。具体实现方式包括以下技术点： 1. 使用Laplacian金字塔将物体表示在不同的频率域中，其中高频率负责纹理信息...

Recall that to solve (P2) in the tth time frame, we observe ξt 􏰗 {hti, Qi(t), Yi(t)}Ni=1, consisting of the channel gains {hti}Ni=1 and the system queue states {Qi(t),Yi(t)}Ni=1, and accordingly decide the control action {xt, yt}, including the binary offloading decision xt and the continuous resource allocation yt 􏰗 􏰄τit, fit, eti,O, rit,O􏰅Ni=1. A close observation shows that although (P2) is a non-convex optimization problem, the resource allocation problem to optimize yt is in fact an “easy” convex problem if xt is fixed. In Section IV.B, we will propose a customized algorithm to efficiently obtain the optimal yt given xt in (P2). Here, we denote G􏰀xt,ξt􏰁 as the optimal value of (P2) by optimizing yt given the offloading decision xt and parameter ξt. Therefore, solving (P2) is equivalent to finding the optimal offloading decision (xt)∗, where (P3) : 􏰀xt􏰁∗ = arg maximize G 􏰀xt, ξt􏰁 . (20) xt ∈{0,1}N In general, obtaining (xt)∗ requires enumerating 2N offloading decisions, which leads to significantly high computational complexity even when N is moderate (e.g., N = 10). Other search based methods, such as branch-and-bound and block coordinate descent [29], are also time-consuming when N is large. In practice, neither method is applicable to online decision- making under fast-varying channel condition. Leveraging the DRL technique, we propose a LyDROO algorithm to construct a policy π that maps from the input ξt to the optimal action (xt)∗, i.e., π : ξt 􏰕→ (xt)∗, with very low complexity, e.g., tens of milliseconds computation time (i.e., the time duration from observing ξt to producing a control action {xt, yt}) when N = 10.，为什么要使用深度强化学习

在这个问题中，我们需要使用深度强化学习来解决一个在线决策问题，即在快速变化的信道条件下，每个时刻需要决定哪些任务应该在本地执行，哪些任务应该在边缘设备上执行。由于任务数量可能很大，传统的搜索和优化方法...

The major contributions of this paper are summarized as follows: . We investigate a new automotive architecture and implementation method. We propose an extended SAE (Society of Automotive Engineer) Benchmark and the use of DDS middleware as an alternative for the existing architecture. . We detail the implementation of the electronic stability unit based on the extended SAE benchmark. . We propose a new design of the DDS based on the MBD approach. Thus, the implementation of the application and the new DDS block are realized under SIMULINK. We intend to improve DDS's programming approach, facilitate con¯guring and generation of DDS description and take into account the real-time network drivers. . In order to validate our DDS implementation and highlight its contributions in the context of hard real-time automotive systems, we detail latency computation for automotive networks, and we present the implemented algorithm to calculate the Worst Case Response Time (WCRT). We prove that DDS qualities of service on the top of the SAE vehicle application are respected. We also give a comparison of system performance using real time networks FlexRay and Ethernet.

本文的主要贡献总结如下： 1. 我们研究了一种新的汽车架构和实现方法。我们提出了扩展的SAE（汽车工程师协会）基准以及将DDS中间件作为现有架构的替代方案。 2. 我们详细介绍了基于扩展SAE基准的电子稳定单元的实现...

The veri¯cation of latency time for distributed hard real-time systems is considered to be the most important performance metrics. It is important for safety critical applications and for performance evaluation of the transmission systems. The integration of a middleware in such application, can induce some communication delays. Therefore, we focused our interest to the computation of end to end latency. Some existing works, adopt optimization or scheduling methods in network computation.35,36 In our work, we propose the WCRT to take into account all possible delays. Latency is considered as the period of time since a message is written by a DataWriter until it is received by a DataReader. It consists of delay caused by signal processing, propagation, queuing and transmission. We detail the computation of latency period of a packet on its entire network path, and we verify its validity with DDS QoS:

对于分布式硬实时系统的延迟时间的验证被认为是最重要的性能指标。对于安全关键应用程序和传输系统的性能评估而言，它非常重要。在这种应用程序中集成中间件可能会引入一些通信延迟。因此，我们将重点放在计算端到端...

Another example is the SRIOV_NET_VF resource class, which is provided by SRIOV-enabled network interface cards. In the case of multiple SRIOV-enabled NICs on a compute host, different qualitative traits may be tagged to each NIC. For example, the NIC called enp2s0 might have a trait “CUSTOM_PHYSNET_PUBLIC” indicating that the NIC is attached to a physical network called “public”. The NIC enp2s1 might have a trait “CUSTOM_PHYSNET_INTRANET” that indicates the NIC is attached to the physical network called “Intranet”. We need a way of representing that these NICs each provide SRIOV_NET_VF resources but those virtual functions are associated with different physical networks. In the resource providers data modeling, the entity which is associated with qualitative traits is the resource provider object. Therefore, we require a way of representing that the SRIOV-enabled NICs are themselves resource providers with inventories of SRIOV_NET_VF resources. Those resource providers are contained on a compute host which is a resource provider that has inventory records for other types of resources such as VCPU, MEMORY_MB or DISK_GB. This spec proposes that nested resource providers be created to allow for distinguishing details of complex components of some resource providers. During review the question came up about “rolling up” amounts of these nested providers to the root level. Imagine this scenario: I have a NIC with two PFs, each of which has only 1 VF available, and I get a request for 2 VFs without any traits to distinguish them. Since there is no single resource provider that can satisfy this request, it will not select this root provider, even though the root provider “owns” 2 VFs. This spec does not propose any sort of “rolling up” of inventory, but this may be something to consider in the future. If it is an idea that has support, another BP/spec can be created then to add this behavior.

在计算主机上存在多个支持SRIOV的网卡的情况下，可以对每个网卡标记不同的定性特征。例如，名为enp2s0的网卡可能具有一个名为“CUSTOM_PHYSNET_PUBLIC”的特征，表示该网卡连接到名为“public”的物理网络。...

帮我润色论文。In this paper, we propose a balancing training method to address problems in imbalanced data learning. To this end, we derive a new loss used in the balancing training phase that alleviates the influence of samples that cause an overfitted decision boundary. The proposed loss efficiently improves the performance of any type of imbalance learning methods. In experiments on multiple benchmark data sets, we demonstrate the validity of our method and reveal that the proposed loss outperforms the state-of-the-art cost-sensitive loss methods. Furthermore, since our loss is not restricted to a specific task, model, or training method, it can be easily used in combination with other recent resampling, meta-learning, and cost-sensitive learning methods for class-imbalance problems. Our code is made available at https://github.com/pseulki/IB-Loss.

在本文中，我们提出了一种平衡训练方法，以解决不平衡数据学习中的问题。为此，我们在平衡训练阶段推导出一种新的损失，以减少导致过度拟合决策边界的样本的影响。所提出的损失有效提高了任何类型的不平衡学习方法的...

Abstract— Image nonlocal self-similarity (NSS) property has been widely exploited via various sparsity models such as joint sparsity (JS) and group sparse coding (GSC). However, the existing NSS-based sparsity models are either too restrictive, e.g., JS enforces the sparse codes to share the same support, or too general, e.g., GSC imposes only plain sparsity on the group coefficients, which limit their effectiveness for modeling real images. In this paper, we propose a novel NSS-based sparsity model, namely, low-rank regularized group sparse coding (LR-GSC), to bridge the gap between the popular GSC and JS. The proposed LR-GSC model simultaneously exploits the sparsity and low-rankness of the dictionary-domain coefficients for each group of similar patches. An alternating minimization with an adaptive adjusted parameter strategy is developed to solve the proposed optimization problem for different image restoration tasks, including image denoising, image deblocking, image inpainting, and image compressive sensing. Extensive experimental results demonstrate that the proposed LR-GSC algorithm outperforms many popular or state-of-the-art methods in terms of objective and perceptual metrics.翻译

摘要—图像的非局部自相似性（NSS）属性已经被广泛应用于各种稀疏模型中，例如联合稀疏（JS）和群组稀疏编码（GSC）。然而，现有的基于NSS的稀疏模型要么太过严格，例如JS强制使稀疏编码共享相同的支持，要么太过...

童心派贪吃蛇游戏pygame版

Matlab实现雪融优化算法SAO-TCN-Multihead-Attention多输入单输出回归预测算法研究.rar

1.版本：matlab2014/2019a/2024a 2.附赠案例数据可直接运行matlab程序。 3.代码特点：参数化编程、参数可方便更改、代码编程思路清晰、注释明细。 4.适用对象：计算机，电子信息工程、数学等专业的大学生课程设计、期末大作业和毕业设计。替换数据可以直接使用，注释清楚，适合新手

python学习代码2KL.zip

python python学习代码2【KL】.zip

C#面向对象23种设计模式.zip

C#面向对象23种设计模式

相关推荐

TEA: A Traffic-efficient Erasure-coded Archival Scheme for In-memory Stores

A Layer-Level Parallel Encoding Framework for SVC

python小爬虫.zip

最全的JAVA设计模式，包含原理图解+代码实现.zip

CPPC++_世界上最快的3d贴图转换工具.zip

【风电】基于TCN-BiGRU的风电功率单变量输入多步预测研究附Matlab代码.rar

CPPC++_OSGI for C 通往架构师之路.zip

童心派贪吃蛇游戏pygame版

Matlab实现雪融优化算法SAO-TCN-Multihead-Attention多输入单输出回归预测算法研究.rar

python学习代码2KL.zip

C#面向对象23种设计模式.zip

最新推荐

python小爬虫.zip

最全的JAVA设计模式，包含原理图解+代码实现.zip

CPPC++_世界上最快的3d贴图转换工具.zip

【风电】基于TCN-BiGRU的风电功率单变量输入多步预测研究附Matlab代码.rar

CPPC++_OSGI for C 通往架构师之路.zip

前端协作项目：发布猜图游戏功能与待修复事项

管理建模和仿真的文件

【高斯信道信号编码优化】：4大方法优化Chirp信号编码过程

对给定图，实现图的深度优先遍历和广度优先遍历。以邻接表或邻接矩阵为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列，并调试算法。使用C语言

Spring框架REST服务开发实践指南