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

In this paper, a novel spatially non-stationary channel model is proposed for link-level computer simulations of massive multiple-input multiple-output (mMIMO) with extremely large aperture array (ELAA). The proposed channel model allows a mix of non-line-of-sight (NLoS) and LoS links between a user and service antennas. The NLoS/LoS state of each link is characterized by a binary random variable, which obeys a correlated Bernoulli distribution. The correlation is described in the form of an exponentially decaying window. In addition, the proposed model incorporates shadowing effects which are non-identical for NLoS and LoS states. It is demonstrated, through computer emulation, that the proposed model can capture almost all spatially non-stationary fading behaviors of the ELAA-mMIMO channel. Moreover, it has a low implementational complexity. With the proposed channel model, Monte-Carlo simulations are carried out to evaluate the channel capacity of ELAA-mMIMO. It is shown that the ELAA-mMIMO channel capacity has considerably different stochastic characteristics from the conventional mMIMO due to the presence of channel spatial non-stationarity.

相關內容

For practical deep neural network design on mobile devices, it is essential to consider the constraints incurred by the computational resources and the inference latency in various applications. Among deep network acceleration related approaches, pruning is a widely adopted practice to balance the computational resource consumption and the accuracy, where unimportant connections can be removed either channel-wisely or randomly with a minimal impact on model accuracy. The channel pruning instantly results in a significant latency reduction, while the random weight pruning is more flexible to balance the latency and accuracy. In this paper, we present a unified framework with Joint Channel pruning and Weight pruning (JCW), and achieves a better Pareto-frontier between the latency and accuracy than previous model compression approaches. To fully optimize the trade-off between the latency and accuracy, we develop a tailored multi-objective evolutionary algorithm in the JCW framework, which enables one single search to obtain the optimal candidate architectures for various deployment requirements. Extensive experiments demonstrate that the JCW achieves a better trade-off between the latency and accuracy against various state-of-the-art pruning methods on the ImageNet classification dataset. Our codes are available at //github.com/jcw-anonymous/JCW.

In this paper, we consider a more general four-terminal memoryless relay-eavesdropper channel with state information (REC-SI) and derive an achievable perfect secrecy rate for it. We suppose that the state information is non-causally available at the transmitter and relay only. The transmitter wishes to establish a secure communication with the legitimate receiver by the help of a relay where a confidential message will be kept secret from a passive eavesdropper. We consider active cooperation between the relay and transmitter. The relay helps the transmitter by relaying the message using decode-and-forward (DF) scheme. The proposed model is a generalization of some existing models and the derived achievable perfect secrecy rate is compared to the special cases. The results are also validated numerically for the additive white Gaussian noise (AWGN) channel.

As a fundamental issue in network analysis, structural node similarity has received much attention in academia and is adopted in a wide range of applications. Among these proposed structural node similarity measures, role similarity stands out because of satisfying several axiomatic properties including automorphism conformation. Existing role similarity metrics cannot handle top-k queries on large real-world networks due to the high time and space cost. In this paper, we propose a new role similarity metric, namely \textsf{ForestSim}. We prove that \textsf{ForestSim} is an admissible role similarity metric and devise the corresponding top-k similarity search algorithm, namely \textsf{ForestSimSearch}, which is able to process a top-k query in $O(k)$ time once the precomputation is finished. Moreover, we speed up the precomputation by using a fast approximate algorithm to compute the diagonal entries of the forest matrix, which reduces the time and space complexity of the precomputation to $O(\epsilon^{-2}m\log^5{n}\log{\frac{1}{\epsilon}})$ and $O(m\log^3{n})$, respectively. Finally, we conduct extensive experiments on 26 real-world networks. The results show that \textsf{ForestSim} works efficiently on million-scale networks and achieves comparable performance to the state-of-art methods.

In this article we propose an inverse analysis algorithm to find the best fit of multiple material parameters in different coupled multi-physics biofilm models. We use a nonlinear continuum mechanical approach to model biofilm deformation that occurs in flow cell experiments. The objective function is based on a simple geometrical measurement of the distance of the fluid biofilm interface between model and experiments. A Levenberg-Marquardt algorithm based on finite difference approximation is used as an optimizer. The proposed method uses a moderate to low amount of model evaluations. For a first presentation and evaluation the algorithm is applied and tested on different numerical examples based on generated numerical results and the addition of Gaussian noise. Achieved numerical results show that the proposed method serves well for different physical effects investigated and numerical approaches chosen for the model. Presented examples show the inverse analysis for multiple parameters in biofilm models including fluid-solid interaction effects, poroelasticity, heterogeneous material properties and growth.

The Sixth Generation (6G) of mobile networks is expected to use carrier frequencies in the spectrum above 100 GHz, to satisfy the demands for higher data rates and bandwidth of future digital applications. The development of networking solutions at such high frequencies is challenged by the harsh propagation environment, and by the need for directional communications and signal processing at high data rates. A fundamental step in defining and developing wireless networks above 100 GHz is given by an accurate performance evaluation. For simulations, this strongly depends on the accuracy of the modeling of the channel and of the interaction with the higher layers of the stack. This paper introduces the implementation of two recently proposed channel models (based on ray tracing and on a fully stochastic model) for the 140 GHz band for the ns-3 TeraSim module, which enables simulation of macro wireless networks in the sub-terahertz and terahertz spectrum. We also compare the two channel models with full-stack simulations in an indoor scenario, highlighting differences and similarities in how they interact with the protocol stack and antenna model of TeraSim.

In this paper, a high-order gas-kinetic scheme is developed for the equation of radiation hydrodynamics in equilibrium-diffusion limit which describes the interaction between matter and radiation. To recover RHE, the Bhatnagar-Gross-Krook (BGK) model with modified equilibrium state is considered. In the equilibrium-diffusion limit, the time scales of radiation diffusion and hydrodynamic part are different, and it will make the time step very small for the fully explicit scheme. An implicit-explicit (IMEX) scheme is applied, in which the hydrodynamic part is treated explicitly and the radiation diffusion is treated implicitly. For the hydrodynamics part, a time dependent gas distribution function can be constructed by the integral solution of modified BGK equation, and the time dependent numerical fluxes can be obtained by taking moments of gas distribution function. For the radiation diffusion term, the nonlinear generalized minimal residual (GMRES) method is used. To achieve the temporal accuracy, a two-stage method is developed, which is an extension of two-stage method for hyperbolic conservation law. For the spatial accuracy, the multidimensional weighted essential non-oscillation (WENO) scheme is used for the spatial reconstruction. A variety of numerical tests are provided for the performance of current scheme, including the order of accuracy and robustness.

Sixth generation (6G) cellular systems are expected to extend the operational range to sub-Terahertz (THz) frequencies between 100 and 300 GHz due to the broad unexploited spectrum therein. A proper channel model is needed to accurately describe spatial and temporal channel characteristics and faithfully create channel impulse responses at sub-THz frequencies. This paper studies the channel spatial statistics such as the number of spatial clusters and cluster power distribution based on recent radio propagation measurements conducted at 142 GHz in an urban microcell (UMi) scenario. For the 28 measured locations, we observe one to four spatial clusters at most locations. A detailed spatial statistical multiple input multiple output (MIMO) channel generation procedure is introduced based on the derived empirical channel statistics. We find that beamforming provides better spectral efficiency than spatial multiplexing in the LOS scenario due to the boresight path, and two spatial streams usually offer the highest spectral efficiency at most NLOS locations due to the limited number of spatial clusters.

The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer and more expressive feature embeddings and hence also perform well on relation prediction. However, we observe that these KG embeddings treat triples independently and thus fail to cover the complex and hidden information that is inherently implicit in the local neighborhood surrounding a triple. To this effect, our paper proposes a novel attention based feature embedding that captures both entity and relation features in any given entity's neighborhood. Additionally, we also encapsulate relation clusters and multihop relations in our model. Our empirical study offers insights into the efficacy of our attention based model and we show marked performance gains in comparison to state of the art methods on all datasets.

Because of continuous advances in mathematical programing, Mix Integer Optimization has become a competitive vis-a-vis popular regularization method for selecting features in regression problems. The approach exhibits unquestionable foundational appeal and versatility, but also poses important challenges. We tackle these challenges, reducing computational burden when tuning the sparsity bound (a parameter which is critical for effectiveness) and improving performance in the presence of feature collinearity and of signals that vary in nature and strength. Importantly, we render the approach efficient and effective in applications of realistic size and complexity - without resorting to relaxations or heuristics in the optimization, or abandoning rigorous cross-validation tuning. Computational viability and improved performance in subtler scenarios is achieved with a multi-pronged blueprint, leveraging characteristics of the Mixed Integer Programming framework and by means of whitening, a data pre-processing step.

Person re-identification is being widely used in the forensic, and security and surveillance system, but person re-identification is a challenging task in real life scenario. Hence, in this work, a new feature descriptor model has been proposed using a multilayer framework of Gaussian distribution model on pixel features, which include color moments, color space values and Schmid filter responses. An image of a person usually consists of distinct body regions, usually with differentiable clothing followed by local colors and texture patterns. Thus, the image is evaluated locally by dividing the image into overlapping regions. Each region is further fragmented into a set of local Gaussians on small patches. A global Gaussian encodes, these local Gaussians for each region creating a multi-level structure. Hence, the global picture of a person is described by local level information present in it, which is often ignored. Also, we have analyzed the efficiency of earlier metric learning methods on this descriptor. The performance of the descriptor is evaluated on four public available challenging datasets and the highest accuracy achieved on these datasets are compared with similar state-of-the-arts, which demonstrate the superior performance.

北京阿比特科技有限公司