亚洲男人的天堂2018av,欧美草比,久久久久久免费视频精选,国色天香在线看免费,久久久久亚洲av成人片仓井空

Reconfigurable Intelligent Surfaces (RISs) are expected to play a crucial role in reaching the key performance indicators (KPIs) for future 6G networks. Their competitive edge over conventional technologies lies in their ability to control the wireless environment propagation properties at will, thus revolutionizing the traditional communication paradigm that perceives the communication channel as an uncontrollable black box. As RISs transition from research to market, practical deployment issues arise. Major roadblocks for commercially viable RISs are i) the need for a fast and complex control channel to adapt to the ever-changing wireless channel conditions, and ii) an extensive grid to supply power to each deployed RIS. In this paper, we question the established RIS practices and propose a novel RIS design combining self-configuration and energy self-sufficiency capabilities. We analyze the feasibility of devising fully-autonomous RISs that can be easily and seamlessly installed throughout the environment, following the new Internet-of-Surfaces (IoS) paradigm, requiring modifications neither to the deployed mobile network nor to the power distribution system. In particular, we introduce ARES, an Autonomous RIS with Energy harvesting and Self-configuration solution. ARES achieves outstanding communication performance while demonstrating the feasibility of energy harvesting (EH) for RISs power supply in future deployments.

Intelligent reflecting surface (IRS) is an emerging technology for wireless communications, thanks to its powerful capability to engineer the radio environment. However, in practice, this benefit is attainable only when the passive IRS is of sufficiently large size, for which the conventional uniform plane wave (UPW)-based far-field model may become invalid. In this paper, we pursue a near-field modelling and performance analysis for wireless communications with extremely large-scale IRS (XL-IRS). By taking into account the directional gain pattern of IRS's reflecting elements and the variations in signal amplitude across them, we derive both the lower- and upper-bounds of the resulting signal-to-noise ratio (SNR) for the generic uniform planar array (UPA)-based XL-IRS. Our results reveal that, instead of scaling quadratically and unboundedly with the number of reflecting elements M as in the conventional UPW-based model, the SNR under the new non-uniform spherical wave (NUSW)-based model increases with $M$ with a diminishing return and eventually converges to a certain limit. To gain more insights, we further study the special case of uniform linear array (ULA)-based XL-IRS, for which a closed-form SNR expression in terms of the IRS size and locations of the base station (BS) and the user is derived. Our result shows that the SNR is mainly determined by the two geometric angles formed by the BS/user locations with the IRS, as well as the dimension of the IRS. Numerical results validate our analysis and demonstrate the necessity of proper near-field modelling for wireless communications aided by XL-IRS.

Reconfigurable intelligent surface (RIS) has entered the public consciousness as a promising technology for enhancing the performance of future wireless communication systems by dynamically constructing the wireless channels. In this letter, we study a double-RIS aided downlink multi-user multiple-input multiple-output (MIMO) communication system. We investigate the mean-square-error (MSE) minimization problem by jointly optimizing the active transmit beamforming, the receive equalizer and the passive beamforming at each RIS. Different from prior works, for the sake of reducing both communication overhead and signal processing complexity, we assume that the two RISs utilize the common reflection pattern. Under this assumption, the coupling of the variables becomes tighter, thereby making the optimization problem more challenging to solve. To effectively address this issue, we propose a majorization-minimization (MM)-based alternating optimization (AO) algorithm.Numerical results show that in high signal-to-noise ratio (SNR) region, the double-RIS with common reflection pattern can achieve nearly the same performance as that with separate reflection pattern whereas the complexity is only half of the latter. Thus, our proposed design enables an effective tradeoff between the performance and the implementation complexity of the considered system.

In this paper, we propose a novel framework for designing a fast convergent multi-agent reinforcement learning (MARL)-based medium access control (MAC) protocol operating in a single cell scenario. The user equipments (UEs) are cast as learning agents that need to learn a proper signaling policy to coordinate the transmission of protocol data units (PDUs) to the base station (BS) over shared radio resources. In many MARL tasks, the conventional centralized training with decentralized execution (CTDE) is adopted, where each agent receives the same global extrinsic reward from the environment. However, this approach involves a long training time. To overcome this drawback, we adopt the concept of learning a per-agent intrinsic reward, in which each agent learns a different intrinsic reward signal based solely on its individual behavior. Moreover, in order to provide an intrinsic reward function that takes into account the long-term training history, we represent it as a long shortterm memory (LSTM) network. As a result, each agent updates its policy network considering both the extrinsic reward, which characterizes the cooperative task, and the intrinsic reward that reflects local dynamics. The proposed learning framework yields a faster convergence and higher transmission performance compared to the baselines. Simulation results show that the proposed learning solution yields 75% improvement in convergence speed compared to the most performing baseline.

While adversarial perturbation of images to attack deep image classification models pose serious security concerns in practice, this paper suggests a novel paradigm where the concept of image perturbation can benefit classification performance, which we call amicable aid. We show that by taking the opposite search direction of perturbation, an image can be modified to yield higher classification confidence and even a misclassified image can be made correctly classified. This can be also achieved with a large amount of perturbation by which the image is made unrecognizable by human eyes. The mechanism of the amicable aid is explained in the viewpoint of the underlying natural image manifold. Furthermore, we investigate the universal amicable aid, i.e., a fixed perturbation can be applied to multiple images to improve their classification results. While it is challenging to find such perturbations, we show that making the decision boundary as perpendicular to the image manifold as possible via training with modified data is effective to obtain a model for which universal amicable perturbations are more easily found.

Many problems arising in control require the determination of a mathematical model of the application. This has often to be performed starting from input-output data, leading to a task known as system identification in the engineering literature. One emerging topic in this field is estimation of networks consisting of several interconnected dynamic systems. We consider the linear setting assuming that system outputs are the result of many correlated inputs, hence making system identification severely ill-conditioned. This is a scenario often encountered when modeling complex cybernetics systems composed by many sub-units with feedback and algebraic loops. We develop a strategy cast in a Bayesian regularization framework where any impulse response is seen as realization of a zero-mean Gaussian process. Any covariance is defined by the so called stable spline kernel which includes information on smooth exponential decay. We design a novel Markov chain Monte Carlo scheme able to reconstruct the impulse responses posterior by efficiently dealing with collinearity. Our scheme relies on a variation of the Gibbs sampling technique: beyond considering blocks forming a partition of the parameter space, some other (overlapping) blocks are also updated on the basis of the level of collinearity of the system inputs. Theoretical properties of the algorithm are studied obtaining its convergence rate. Numerical experiments are included using systems containing hundreds of impulse responses and highly correlated inputs.

As an excellent tool for aiding communication, intelligent reflecting surface (IRS) can extend the coverage area, remove blind area, and achieve a dramatic rate improvement. In this paper, we improve the secret rate (SR) performance at directional modulation (DM) networks using IRS. To fully explore the benefits of IRS, two efficient methods are proposed to enhance SR performance. The first approach computes the confidential message (CM) beamforming vector by maximizing the SR, and the signal-to-leakage-noise ratio (SLNR) method is used to optimize the IRS phase shift matrix, which is called Max-SR-SLNR. Here, Eve is maximally interfered by transmitting artificial noise (AN) along the direct path and null-space projection (NSP) on the remaining two channels. To reduce the computational complexity, the CM, AN beamforming and IRS phase shift design are independently designed in the following methods. The CM beamforming vector is constructed based on maximum ratio transmission (MRT) criteria along the channel from Alice-to-IRS, and phase shift matrix of IRS is directly given by phase alignment (PA) method. This method is called MRT-NSP-PA. Simulation results show that the SR performance of the Max-SR-SLNR method outperforms the MRT-NSP-PA method in the cases of small-scale and medium-scale IRSs, and the latter approaches the former in performance as IRS tends to lager-scale.

Since reconfigurable intelligent surface (RIS) is considered to be a passive reflector for rate performance enhancement, a RIS-aided amplify-and-forward (AF) relay network is presented. By jointly optimizing the beamforming matrix at AF relay and the phase shifts matrices at RIS, two schemes are put forward to address a maximizing signal-to-noise ratio (SNR) problem. Firstly, aiming at achieving a high rate, a high-performance alternating optimization (AO) method based on Charnes-Cooper transformation and semidefinite programming (CCT-SDP) is proposed, where the optimization problem is decomposed to three subproblems solved by CCT-SDP and rank-one solutions can be recovered by Gaussian randomization. While the optimization variables in CCT-SDP method are matrices, which leads to extremely high complexity. In order to reduce the complexity, a low-complexity AO scheme based on Dinkelbachs transformation and successive convex approximation (DT-SCA) is put forward, where matrices variables are transformed to vector variables and three decoupled subproblems are solved by DT-SCA. Simulation results verify that compared to two benchmarks (i.e. a RIS-assisted AF relay network with random phase and a AF relay network without RIS), the proposed CCT-SDP and DT-SCA schemes can harvest better rate performance. Furthermore, it is revealed that the rate of the low-complexity DT-SCA method is close to that of CCT-SDP method.

Generating complex behaviors that satisfy the preferences of non-expert users is a crucial requirement for AI agents. Interactive reward learning from trajectory comparisons (a.k.a. RLHF) is one way to allow non-expert users to convey complex objectives by expressing preferences over short clips of agent behaviors. Even though this parametric method can encode complex tacit knowledge present in the underlying tasks, it implicitly assumes that the human is unable to provide richer feedback than binary preference labels, leading to intolerably high feedback complexity and poor user experience. While providing a detailed symbolic closed-form specification of the objectives might be tempting, it is not always feasible even for an expert user. However, in most cases, humans are aware of how the agent should change its behavior along meaningful axes to fulfill their underlying purpose, even if they are not able to fully specify task objectives symbolically. Using this as motivation, we introduce the notion of Relative Behavioral Attributes, which allows the users to tweak the agent behavior through symbolic concepts (e.g., increasing the softness or speed of agents' movement). We propose two practical methods that can learn to model any kind of behavioral attributes from ordered behavior clips. We demonstrate the effectiveness of our methods on four tasks with nine different behavioral attributes, showing that once the attributes are learned, end users can produce desirable agent behaviors relatively effortlessly, by providing feedback just around ten times. This is over an order of magnitude less than that required by the popular learning-from-human-preferences baselines. The supplementary video and source code are available at: //guansuns.github.io/pages/rba.

Knowledge graph embedding (KGE) is a increasingly popular technique that aims to represent entities and relations of knowledge graphs into low-dimensional semantic spaces for a wide spectrum of applications such as link prediction, knowledge reasoning and knowledge completion. In this paper, we provide a systematic review of existing KGE techniques based on representation spaces. Particularly, we build a fine-grained classification to categorise the models based on three mathematical perspectives of the representation spaces: (1) Algebraic perspective, (2) Geometric perspective, and (3) Analytical perspective. We introduce the rigorous definitions of fundamental mathematical spaces before diving into KGE models and their mathematical properties. We further discuss different KGE methods over the three categories, as well as summarise how spatial advantages work over different embedding needs. By collating the experimental results from downstream tasks, we also explore the advantages of mathematical space in different scenarios and the reasons behind them. We further state some promising research directions from a representation space perspective, with which we hope to inspire researchers to design their KGE models as well as their related applications with more consideration of their mathematical space properties.