Unequal User Research Articles

Innovations and Challenges in Primary School English Education in the Industrial Era 4.0

The existence, dynamics, and applicability of English language instruction at the basic school level to the disruptive technology era are all covered in detail in this study. This paper aims to characterize research problems using descriptive-analytical approaches and research methodologies of the literature study type, utilizing literature data from pertinent books, journals, papers, and scientific publications. This study outlines a number of prerequisites for English language instruction in the modern day, including infrastructure and technology, curriculum and instructional strategies, certified teachers, instructional materials and resources, and parental support. The results also show that there are opportunities that can be targeted, such as more extensive access to language learning materials, dynamic and interesting learning opportunities, global connectivity and language exchange, digital applications for language practice, and the provision of a useful system for evaluation and feedback. In the meanwhile, issues include unequal access to technology, unequal user technical proficiency, linguistic difficulties, students' short attention spans and lack of focus, and threats to digital security.

Self-Organization of Multi-UAVs for Improving QoE in Unequal User Distribution

Self-Organization of Multi-UAVs for Improving QoE in Unequal User Distribution

Optimal Caching Policy for D2D Assisted Cellular Networks With Different Cache Size Devices

This paper studies the problem of optimal cache placement to maximize the offloading probability in a device-to-device (D2D) enabled cellular network with small base stations (SBSs). Different from most existing works, we consider unequal users’ equipment (UE) cache memory sizes and all wireless links are modeled as Nakagami-m fading. User preference for each UE and global popularity for SBS, as well as the higher priority of content request from neighboring UEs vs. SBS, are the main factors that make the problem formulation of our work different from that of existing works. It is assumed that each UE caches its desired content with the order of searching its cache, neighboring UEs’ cache via D2D communications, and its serving SBS’ cache. A close to optimal low complexity heuristic cache placement policy is proposed and it is shown that its performance reaches the optimal caching strategy.

Load-Aware Energy Efficiency With Unequal User Priority in Downlink Heterogeneous Network System

Load-Aware Energy Efficiency With Unequal User Priority in Downlink Heterogeneous Network System

Three Cases of Hashtags Used as Learning and Professional Development Environments

Hashtags offer exciting opportunities for professional development, teaching, and learning. However, their use reflects users’ needs and desires. To illustrate and problematize the ways hashtags are used in professional development settings, this study reports on users’ participation patterns, users’ roles, and content contributed to three unique hashtags. This mixed methods research employs data mining techniques to retrieve data. Using a collective case study methodology, the study compares and contrasts the use of three hashtags and offers insights into the use of hashtags as emerging learning and professional development environments. Results show that hashtags exhibit similarities, such as unequal user participation. Findings also reveal differences between hashtags. For instance some hashtags are used on an ongoing basis while others have well-defined start and end dates. Ultimately, these results question deterministic thinking with respect to emerging technologies and novel professional development environments.

User Association With Unequal User Priorities in Heterogeneous Cellular Networks

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.

Are National Parks Inherently Unequal? The 2006 French Park Reform and its Initial Implementation in Mainland France

In France, like in other parts of the world, environmental-protection policies appear to have taken note of local resistance driven by the eviction of populations and restrictions on their use of certain areas. The amendment to the law on French national parks (2006 reform) as such recognized that local populations can help to protect natural environments, as well as their right to participate in defining the charter (or spatial plan) of new parks. This article analyses the creation and local acceptance of the Calanques National Park, a peri-urban park and the first of a new generation of parks in mainland France. Our approach is based on the analytical framework of environmental effort. Using a qualitative corpus of semi-structured interviews and direct observation, we explore three analytical axes. We begin by analyzing the consultation process conducted during the creation of the park. This points up inequalities in access to the public sphere and underscores that only a few, well-endowed user-organizations truly helped define the “good use” of the Calanques that became a reference in the park’s charter. Then we examine how such unequal user participation impacted the wording used in the charter and the distribution of environmental effort demanded of different users. Lastly, the first two observations lead us to question the acceptability of the effort required and its division among users, particularly since the consultation process has been strongly criticized. We question how fairly the effort required by the park’s creation was distributed, particularly given the lack of information and limited legitimacy afforded to the consultation process. Finally, we look at the blaming that has taken place amongst different users of the park—a process compounded for many of those interviewed by their fear of being deprived (unjustifiably, they felt) of their freedom to access nature.

Performance of a Radio Transmission System with Spectrum Pooling and Unequal User Priorities

We examine a radio transmission system based on spectrum pooling, whereby the spectrum owned by the primary user is divided into subchannels, and some users are allowed privileged access to the most reliable unused subchannels. By assuming that a powerful error-control code is used, performance is evaluated by computing the information outage probability. It is shown that choosing the best channels improves considerably the performance of the privileged users, while the remaining (unprivileged) users are penalized only marginally.

Analysis and Performance Evaluation of Linear Multiuser Detectors in the Downlink of DS-CDMA Systems Applying Spectral Decomposition

This paper studies the performance of linear multiuser detectors for direct-sequence code division multiple access systems at different loading levels and users' powers, using singular value decomposition (SVD) techniques in the downlink of Rayleigh flat-fading and additive white Gaussian channels. The performance of the matched filter (MF), decorrelator (zero-forcing), and minimum mean-squared error (MMSE) detectors are studied and compared. Analytical and simulation results are also presented in terms of the bit error rate. From this analysis, a simple linear multiuser detector is developed that exploits the structure of the system's spreading codes matrix from the SVD viewpoint. Also, the numerical performance of this proposed detector is compared to that of the conventional detector (MF) as a function of the signal-to-noise ratio. Finally, the performance limits are established in terms of the singular values of the spreading codes matrix. Extensive simulation results validate the analysis presented in the paper for equal or unequal users' powers.

Co-channel interference reduction in Rayleigh fading channels

Abstract Interference can be a significant problem in loosely organized networks such as ad-hoc radio networks. One technique for dealing with interference is to attempt joint detection of all signals arriving at a node. Iterative algorithms based on the turbo-principle yield significant performance improvements when applied to this problem. This paper concentrates on performance analysis of iterative interference cancellation for forward-error correction coded signals in the presence of Rayleigh fading. The variance transfer analysis of Alexander et al. [European Trans. Telecommun. 9 (5) (1998) 419–426] is generalized for unequal user powers and codes. A surprising result is that the received power variation due to fading can assist convergence.

Complex-valued collaborative coding multiple access for fading channels

The complex-valued collaborative coding multiple access (CV-CCMA) scheme has been previously proposed by the authors to provide a practical means of implementing CCMA over radio channels. The technique employs complex-valued collaborative codes and spatial diversity to estimate the complex channel gain coefficients representing the amplitude and phase associated with each user path and to detect the data of each user in a combined manner. The authors present the complex-valued coding scheme extended to operate in fading channels with equal and unequal users' channel gain coefficients. The conditions for choosing a valid T-user collaborative code set are described and various T-user M-PSK code sets are constructed. The maximum achievable rate region for two-user 2-PSK CV-CCMA is also obtained. The T-user M-PSK CV-CCMA schemes employing these code sets are evaluated in Rayleigh and Rician fading channels and-presented in terms of the probability of error against Eb/N0 per user. The error-performance of these schemes is also investigated with the use of dual and higher-order space diversity and it is shown to give a significant performance gain

Analysis of early failures in unequal size samples : R. A. Heller and S. A. Heller. Proceedings 1973 IEEE Annual Reliability Maintainability Symposium. 23–25 January, p. 198

Interference can be a significant problem in loosely organized networks such as ad-hoc radio networks. One technique for dealing with interference is to attempt joint detection of all signals arriving at a node. Iterative algorithms based on the turbo-principle yield significant performance improvements when applied to this problem. This paper concentrates on performance analysis of iterative interference cancellation for forward-error correction coded signals in the presence of Rayleigh fading. The variance transfer analysis of Alexander et al. [European Trans. Telecommun. 9 (5) (1998) 419–426] is generalized for unequal user powers and codes. A surprising result is that the received power variation due to fading can assist convergence.