Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactio...
详细信息
In order to provide guidance for the development of high performance millimeter-wave complementary metal oxide semiconductor (MMW-CMOS) integrated circuits (IC), this paper provides a survey of key technologies on MMW...
In order to provide guidance for the development of high performance millimeter-wave complementary metal oxide semiconductor (MMW-CMOS) integrated circuits (IC), this paper provides a survey of key technologies on MMW-CMOS IC. Technical background of MMW wireless communications is described. Then the recent development of the critical technologies of the MMW-CMOS IC are introduced in detail and compared. A summarization is given, and the development prospects on MMW-CMOS IC are also discussed.
Unsupervised Domain Adaptation (UDA) aims to adapt a model trained on a labeled source domain to an unlabeled target domain by addressing the domain shift. Existing Unsupervised Domain Adaptation (UDA) methods often f...
In the original paper [1], there are two errors on page 5. The rules in the algorithm are not sufficient since we omitted one rule during publication. The following rule should be added to the paper. Rule 3: If P1 = (...
In the original paper [1], there are two errors on page 5. The rules in the algorithm are not sufficient since we omitted one rule during publication. The following rule should be added to the paper. Rule 3: If P1 = (u, v) and P2 = (x, y) are two maximal leaf-paths both with two vertices in T, where u and x are leaves in T and (v, y) ∈ E(G), we remove (y′, y) and then add (v, y) to T where y′ is the non-leaf neighbor of y in T. The expression of Algorithm 2 is not accurate. It should be modified as follows. Line 3: Exhaustively apply Rules 1–3, and for i ∈ {2, 3} only apply Rule i when none of Rules j where 1 ⩽ j < i is applicable. Line 8: Determine the longest path P among all paths whose endpoints have nonempty neighbors in T \ V(T′).
The typical representative of the hard clustering algorithm, K-means, is one of the fastest processing algorithms with good scalability. However, it cannot deal with categorical attributes, which is one of the importa...
The typical representative of the hard clustering algorithm, K-means, is one of the fastest processing algorithms with good scalability. However, it cannot deal with categorical attributes, which is one of the important indicators to measure the pros and cons. Due to the lack of processing capabilities on categorical attributes, k-means has a large limit on dataprocessing capabilities. This paper proposes a clustering algorithm extends from K-means. This algorithm introduces the concept of a Pseudo-mean distance calculation formula and a counting-table so that categorical attributes can be processed while reducing the time cost as much as possible. Experimental results illustrate the proposed Pseudo-means can extend the processing range of k-means to category-type data, and the counting table also effectively reduces the time cost.
Reconfigurable intelligent surface (RIS) constitutes an essential and promising paradigm that relies programmable wireless environment and provides capability for space-intensive communications, due to the use of low-...
详细信息
暂无评论