Search

This paper explores the formation mechanisms of various architectural forms in a cultural transition region. A field investigation involving 504 ancestral shrines with Guangfu and Hakka styles in Shenzhen was performed. Then, spatial distribution analysis was conducted to reveal the regional structure of aggregation, penetration and juxtaposition of the architectural forms. Case studies were adopted to explain the integration modes of the architectural forms. The results show that, juxtaposition, as a typical mode of coexistence of architectural forms in cultural transition zones, mainly occurs in regions dominated by weak cultures. Through gathering densely in a small region, a weak culture can gain the ability to compete with a strong culture, thus forming a basis for achieving an equilibrium state. The approaches to the integration of architectural forms are diverse. The transformation of the architectural plane involves changes in social organization and cultural essence. The alteration of construction details and decoration involves a compromise regarding noncritical elements adopted by the weak culture to maintain its original characteristics. Finally, their shared human and natural environmental “genes” give the buildings in the cultural transition region an underlying commonality. This study offers a significant addition to the cultural geography and architectural morphology literature.

Covert communication aims to prevent the warden from detecting the presence of communications, i.e. with a negligible detection probability. When the distance between the transmitter and the legitimate receiver is large, large transmission power is needed, which in turn increases the detection probability. Relay is an effective technique to tackle this problem, and various relaying strategies have been proposed for long-distance covert communication in these years. In this article, we first offer a tutorial on the relaying strategies utilized in covert transmission. With the emergence of reflecting intelligent surface and its application in covert communications, we propose a hybrid relay-reflecting intelligent surface (HR-RIS)-assisted strategy to further enhance the performance of covert communications, which simultaneously improves the signal strength received at the legitimate receiver and degrades that at the warden relying on optimizing both the phase and the amplitude of the HR-RIS elements. The numerical results show that the proposed HR-RIS-assisted strategy significantly outperforms the conventional RIS-aided strategy in terms of covert rate.

Addressing the emotional needs of the elderly in urban space design has increasingly become a vital concern. This study innovatively integrates emotional theories with the design of community outdoor spaces, thereby expanding the research on emotional categorization in urban spaces. At 8 community outdoor space sites in Yi Jie Qu, China, 330 elderly residents were randomly recruited to assess their color emotional responses (CER) to the color landscapes of these spaces. Based on the Affective Circumplex Model and Japanese Color Image Theory, a Color Emotion Circumplex was constructed to visually represent the overall emotional tendencies and significant positive emotions of the elderly. The second innovation of this research lies in exploring the driving factors behind positive emotional responses of the elderly, the primary user group of community outdoor spaces. We analyzed the significant differences in CER between autumn and winter scenes, employing variance analysis, correlation, and regression to investigate the substantial effects of individual factors and color characteristics on positive CER. The study discovered that the elderly exhibit a stronger CER towards clean and healthy emotions. Notably, CER was more pronounced in autumn scenes compared to winter. Furthermore, educational level, visit frequency, and color brightness positively influenced positive CER, whereas walking time from residence and the color area ratios of blue and gray negatively impacted CER. These findings not only provide a theoretical basis for age-friendly color design in community spaces, but also offer new perspectives and practical guidance for the international community planning and design domain. Our research underscores the importance of incorporating the emotional needs of the elderly into urban space design, offering novel theoretical and practical guidance for future urban planning and community design. [ABSTRACT FROM AUTHOR]

The number of leaves in maize seedlings is an essential indicator of their growth rate and status. However, manual counting of seedlings is inefficient and limits the scope of the investigation. Deep learning has shown potential for quickly identifying seedlings, but it requires larger, labeled datasets. To address these challenges, we proposed a method for counting maize leaves from seedlings in fields using a combination of semi-supervised learning, deep learning, and UAV digital imagery. Our approach leveraged semi-supervised learning and novel methods for detecting and counting maize seedling leaves accurately and efficiently. Specifically, we used a small amount of labeled data to train the SOLOv2 model based on the semi-supervised learning framework Noisy Student. This model can segment complete maize seedlings from UAV digital imagery and generate foreground images of maize seedlings with background removal. We then trained the YOLOv5x model based on Noisy Student with a small amount of labeled data to detect and count maize leaves. We divided our dataset of 1005 images into 904 training images and 101 testing images, and randomly divided the 904 training images into four sets of labeled and unlabeled data with proportions of 4:6, 3:7, 2:8, and 1:9, respectively. The results indicated that the SOLOv2 Resnet101 outperformed the SOLOv2 Resnet50 in terms of segmentation performance. Moreover, when the labeled proportion was 30%, the student model SOLOv2 achieved a similar segmentation performance to the fully supervised model with a mean average precision (mAP) of 93.6%. When the labeled proportion was 40%, the student model YOLOv5x demonstrated comparable leaf counting performance to the fully supervised model. The model achieved an average precision of 89.6% and 57.4% for fully unfolded leaves and newly appearing leaves, respectively, with counting accuracy rates of 69.4% and 72.9%. These results demonstrated that our proposed method based on semi-supervised learning and UAV imagery can advance research on crop leaf counting in fields and reduce the workload of data annotation. [ABSTRACT FROM AUTHOR]

Network slicing enables the multiplexing of independent logical networks on the same physical network infrastructure to provide different network services for different applications. The resource allocation problem involved in network slicing is typically a decision-making problem, falling within the scope of reinforcement learning. The advantage of adapting to dynamic wireless environments makes reinforcement learning a good candidate for problem solving. In this paper, to tackle the constrained mixed integer nonlinear programming problem in network slicing, we propose an augmented Lagrangian-based soft actor–critic (AL-SAC) algorithm. In this algorithm, a hierarchical action selection network is designed to handle the hybrid action space. More importantly, inspired by the augmented Lagrangian method, both neural networks for Lagrange multipliers and a penalty item are introduced to deal with the constraints. Experiment results show that the proposed AL-SAC algorithm can strictly satisfy the constraints, and achieve better performance than other benchmark algorithms. [ABSTRACT FROM AUTHOR]

In intelligent transportation systems (ITS), incomplete traffic data due to sensor malfunctions and communication faults, seriously restricts the related applications of ITS. Recovering missing data from incomplete traffic data becomes an important issue for ITS. Existing works on traffic data imputation cannot achieve satisfactory accuracy due to inefficiently exploiting the underlying topological structure of the traffic data. In this paper, we model the topology of the road network as a graph and introduce graph Fourier transform (GFT) to process the traffic data. Then we utilize an algebraic framework termed as graph-tensor singular value decompositions (GT-SVD) to extract the hidden spatial information of traffic data. Furthermore, we propose a novel graph spectral regularized tensor completion algorithm based on GT-SVD and construct temporal regularized constraints to improve the recovery accuracy. The extensive experimental results on real traffic datasets demonstrate that the proposed algorithm outperforms the state-of-the-art methods under different missing patterns. [ABSTRACT FROM AUTHOR]

In this paper, we theoretically analyse the uplink (UL) and downlink (DL) performance of massive multiple-input and multiple-output (mMIMO) networks, in term of coverage probability, cell spectral efficiency and network area spectral efficiency, using stochastic geometry. A sophisticated but yet practical system model is considered, taking into account a path loss model differentiating line-of-sight and non-line-of-sight transmissions, an idle mode capability at the base stations and a finite user density. Our analysis pays particular attention to the existence of a finite number of UL pilots for channel estimation and the effect of pilot contamination. We study for the first time the joint impact of the number of UL pilot sequences, the user density, and the base-station density on the pilot contamination issue in a mMIMO network, which in turn characterizes the DL and UL network performance. Moreover, using the proposed framework, we investigate two different scheduling problems—UE and pilot scheduling—, to find the optimal simultaneously scheduled UE density per time-frequency resource as well as the optimal UL pilot number to maximise the spectral efficiency. [ABSTRACT FROM AUTHOR]

Accurate short-time traffic flow prediction has gained gradually increasing importance for traffic plan and management with the deployment of intelligent transportation systems (ITSs). However, the existing approaches for short-term traffic flow prediction are unable to efficiently capture the complex nonlinearity of traffic flow, which provide unsatisfactory prediction accuracy. In this paper, we propose a deep learning based model which uses hybrid and multiple-layer architectures to automatically extract inherent features of traffic flow data. Firstly, built on the convolutional neural network (CNN) and the long short-term memory (LSTM) network, we develop an attention-based Conv-LSTM module to extract the spatial and short-term temporal features. The attention mechanism is properly designed to distinguish the importance of flow sequences at different times by automatically assigning different weights. Secondly, to further explore long-term temporal features, we propose a bidirectional LSTM (Bi-LSTM) module to extract daily and weekly periodic features so as to capture variance tendency of the traffic flow from both previous and posterior directions. Finally, extensive experimental results are presented to show that the proposed model combining the attention Conv-LSTM and Bi-LSTM achieves better prediction performance compared with other existing approaches. [ABSTRACT FROM AUTHOR]

We discover a new capacity scaling law in ultra-dense networks under practical system assumptions, such as a general multi-piece path loss model, a non-zero base station to user equipment antenna height difference, and a finite user equipment density. The intuition and implication of this new capacity scaling law are completely different from those found in the year 2011. That law indicated that the increase of the interference power caused by a denser network would be exactly compensated by the increase of the signal power due to the reduced distance between transmitters and receivers, and thus, network capacity should grow linearly with network densification. However, we find that both the signal and interference powers become bounded in practical ultra-dense networks, which leads to a constant capacity scaling law. Moreover, our new discovery on the constant capacity scaling law indicates three network optimization problems respectively for base station deployment, user equipment scheduling and base station coordination. These three optimization problems are justified and solved in this paper, shedding new light on the deployment and optimization of ultra-dense networks. [ABSTRACT FROM AUTHOR]

In this paper, we show how the absorption and re-radiation energy from molecules in the air can influence the Multiple Input Multiple Output (MIMO) performance in high-frequency bands, e.g., millimeter wave (mmWave) and terahertz. In more detail, some common atmosphere molecules, such as oxygen and water, can absorb and re-radiate energy in their natural resonance frequencies, such as 60 GHz, 180 GHz and 320 GHz. Hence, when hit by electromagnetic waves, molecules will get excited and absorb energy, which leads to an extra path loss and is known as molecular attenuation. Meanwhile, the absorbed energy will be re-radiated towards a random direction with a random phase. These re-radiated waves also interfere with the signal transmission. Although, the molecular re-radiation was mostly considered as noise in literature, recent works show that it is correlated to the main signal and can be viewed as a composition of multiple delayed or scattered signals. Such a phenomenon can provide non-line-of-sight (NLoS) paths in an environment that lacks scatterers, which increases spatial multiplexing and thus greatly enhances the performance of MIMO systems. Therefore in this paper, we explore the scattering model and noise models of molecular re-radiation to characterize the channel transfer function of the NLoS channels created by atmosphere molecules. Our simulation results show that the re-radiation can increase MIMO capacity up to 3 folds in mmWave and 6 folds in terahertz for a set of realistic transmit power, distance, and antenna numbers. We also show that in the high SNR, the re-radiation makes the open-loop precoding viable, which is an alternative to beamforming to avoid beam alignment sensitivity in high mobility applications. [ABSTRACT FROM AUTHOR]

The dynamic exploitation of unlicensed spectrum by mobile operators is becoming a trend of future 5G networks, with several efficient solutions being standardized for enabling spectrum sharing. Solutions with various design philosophies diversify the network architectures and protocols. Among them, LAA aims at the physical-layer coexistence of LTE and WiFi within the unlicensed spectrum, while LWA and LWIP focus on aggregating the link capacity of LTE in the licensed spectrum and WiFi in the unlicensed one. In this article, a comprehensive survey of these three spectrum sharing technologies are provided. Moreover, a novel analytical framework is proposed to evaluate the network performance of these technologies by incorporating both spatial and time domain analyses and integrating different types of cells in one network as a whole. Simulation results are provided to compare the system throughput of these spectrum reuse technologies. [ABSTRACT FROM PUBLISHER]

Cooperative inter-working of the long-term evolution (LTE) and the wireless fidelity (Wi-Fi) networks have drawn much attention recently, and several strategies have been proposed to enhance their network capacity. In this paper, we propose a new framework to analyze the network performance of several inter-working strategies for the LTE and the Wi-Fi. The proposed framework considers both the LTE and the Wi-Fi systems, both the downlink (DL) and the uplink (UL) transmissions, and the generated interference in both the time and the spatial domains. Based on such a framework, we theoretically analyze for the first time the performance of a Wi-Fi network, taking into account the intra-cell time efficiency and the signal and inter-cell interference with spatial randomness. Moreover, we study the performance of: 1) a coexisting architecture where Wi-Fi coexists with an ideal carrier sense multiple access (CSMA) duplex system, which represents an upper bound performance for the LTE Release 14 licensed assisted access network and 2) a brand-new architecture that allows UL on LTE and DL on Wi-Fi, referred to as the Boost architecture. We derive analytical results for both the DL and the UL network performances in terms of the signal quality distribution and the total area system throughput (AST) in these two architectures, and quantify their performance gain compared with the traditional disjoint LTE Wi-Fi architecture. Simulation results validate our analysis results, and show that, in a typical outdoor scenario, the coexisting architecture and the Boost architecture can, respectively, increase the total AST up to 11% and 25%, compared with the traditional disjoint LTE Wi-Fi. [ABSTRACT FROM PUBLISHER]

In heterogeneous networks (HetNets), the load between macrocell base stations (MBSs) and small-cell base stations (SBSs) is imbalanced due to their different transmission powers and locations. This load imbalance significantly impacts system performance and affects the experience of mobile users (MUs) with different priorities. In this paper, we aim to distributively optimize the user association in HetNets with various user priorities to solve the load balancing problem. Since the user association is a binary matching problem, which is NP-hard, we propose a distributed belief propagation (BP) algorithm to approach the optimal solution. We first develop a factor graph model, using the network topology, to represent this user association problem. With this factor graph, we propose a novel distributed BP algorithm by adopting the proportional fairness as the objective. Next, we theoretically prove the existence of the fixed point in our BP algorithm. To be more practical, we develop an approximation method to significantly reduce the computational and communication complexity of the BP algorithm. Furthermore, we analyze some properties of the factor graph relevant to the performance of the BP algorithm using the stochastic geometry. Simulation results show that 1) the proposed BP algorithm well approaches the optimal system performance and achieves a much better performance compared with other association schemes and that 2) the analytical results on the average degree distribution and sparsity of the factor graph match with those obtained from the Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

Evidence indicates that downloading on-demand videos accounts for a dramatic increase in data traffic over cellular networks. Caching popular videos in the storage of small-cell base stations (SBS), namely, small-cell caching, is an efficient technology for reducing the transmission latency while mitigating the redundant transmissions of popular videos over back-haul channels. In this paper, we consider a commercialized small-cell caching system consisting of a network service provider (NSP), several video retailers (VRs), and mobile users (MUs). The NSP leases its SBSs to the VRs for the purpose of making profits, and the VRs, after storing popular videos in the rented SBSs, can provide faster local video transmissions to the MUs, thereby gaining more profits. We conceive this system within the framework of Stackelberg game by treating the SBSs as specific types of resources. We first model the MUs and SBSs as two independent Poisson point processes, and develop, via stochastic geometry theory, the probability of the specific event that an MU obtains the video of its choice directly from the memory of an SBS. Then, based on the probability derived, we formulate a Stackelberg game to jointly maximize the average profit of both the NSP and the VRs. In addition, we investigate the Stackelberg equilibrium by solving a non-convex optimization problem. With the aid of this game theoretic framework, we shed light on the relationship between four important factors: the optimal pricing of leasing an SBS, the SBSs allocation among the VRs, the storage size of the SBSs, and the popularity distribution of the VRs. Monte Carlo simulations show that our stochastic geometry-based analytical results closely match the empirical ones. Numerical results are also provided for quantifying the proposed game-theoretic framework by showing its efficiency on pricing and resource allocation. [ABSTRACT FROM PUBLISHER]

In this paper, we consider the intercell interference coordination (ICIC) problem in heterogeneous cellular networks with randomly deployed small-cell base stations (BSs). Current research on ICIC mainly focuses on optimizing the spectrum and power allocations at BSs, whereas the user–BS association is treated as a separate issue. Nevertheless, the user–BS association problem is an important issue in ICIC and should be jointly optimized with resource allocations to achieve global optimality. In this paper, with the objective of maximizing the system sum rate in a distributed manner, we propose a novel belief propagation (BP) algorithm to jointly optimize user association, subchannel assignment, and power allocation. We first develop a factor graph model to decompose the network-wide objective and constraints into multiple local utilities. Then, we transform the maximization of local utilities into the estimations of marginal distributions and propose a distributed BP algorithm to solve the estimations. Simulations show that our distributed BP algorithm dramatically improves the performance compared with the benchmark scheme. [ABSTRACT FROM AUTHOR]

Heterogeneous cellular networks (HCNs) with embedded small cells are considered, where multiple mobile users wish to download network content of different popularity. By caching data into the small-cell base stations, we will design distributed caching optimization algorithms via belief propagation (BP) for minimizing the downloading latency. First, we derive the delay-minimization objective function and formulate an optimization problem. Then, we develop a framework for modeling the underlying HCN topology with the aid of a factor graph. Furthermore, a distributed BP algorithm is proposed based on the network's factor graph. Next, we prove that a fixed point of convergence exists for our distributed BP algorithm. In order to reduce the complexity of the BP, we propose a heuristic BP algorithm. Furthermore, we evaluate the average downloading performance of our HCN for different numbers and locations of the base stations and mobile users, with the aid of stochastic geometry theory. By modeling the nodes distributions using a Poisson point process, we develop the expressions of the average factor graph degree distribution, as well as an upper bound of the outage probability for random caching schemes. We also improve the performance of random caching. Our simulations show that 1) the proposed distributed BP algorithm has a near-optimal delay performance, approaching that of the high-complexity exhaustive search method; 2) the modified BP offers a good delay performance at low communication complexity; 3) both the average degree distribution and the outage upper bound analysis relying on stochastic geometry match well with our Monte-Carlo simulations; and 4) the optimization based on the upper bound provides both a better outage and a better delay performance than the benchmarks. [ABSTRACT FROM PUBLISHER]

Highlights: [•] We investigated the variation of maize kernel growth along the rachis of ear. [•] Three-year field data of two hybrids with contrasting densities were analyzed. [•] Kernel growth rate and grain-filling duration determine kernel weight variation. [•] Maximum kernel water mass varied with position but moisture content was similar. [•] The variation of maximum kernel water mass was related with the variation in final kernel weight. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs), featured by the high-mobility and high-quality propagation environment, have shown great potential in wireless communication applications. In this paper, a novel UAV-aided small-cell content caching network is proposed and analyzed, where joint transmission (JT) is considered in the dense small-cell networks and mobile UAVs are employed to shorten the serving distance. The system performance is evaluated in terms of the average cache hit probability and the ergodic transmission rate. From the analytical results, we find that (i) the proposed UAV-aided small-cell network shows superior caching performance and, even with a small density of UAVs the system's cache hit probability, can be improved significantly; (ii) the content's optimal caching probability to maximize the cache hit probability is proportional to the (K + 1) -th root of its request probability, where K is the number of small-cell base stations that serve each user by JT; (iii) caching the most popular content in UAVs may lead to a low transmission rate due to the limited resource offered by the low-density UAVs. Simulation results are presented to validate the theoretical results and the performance gain achieved by the optimal caching strategy. [ABSTRACT FROM AUTHOR]