Explore the vast range of titles available.

Spatial regression models are widely available across several disciplines, such as functional magnetic resonance imaging analysis, econometrics, and house price analysis. In nature, sparsity occurs when a limited number of factors strongly impact overall variation. Sparse covariance structures are common in spatial regression models. The spatial error model is a significant spatial regression model that focuses on the geographical dependence present in the error terms rather than the response variable. This study proposes an effective approach using the pretest and shrinkage ridge estimators for estimating the vector of regression coefficients in the spatial error mode, considering insignificant coefficients and multicollinearity among regressors. The study compares the performance of the proposed estimators with the maximum likelihood estimator and assesses their efficacy using real-world data and bootstrapping techniques for comparison purposes.

This paper investigates the outage probability of a hybrid Radio Frequency–Underwater Wireless Optical Communication (RF-UWOC) system that employs the Decode-and-Forward protocol under composite fading channels. It is assumed that the RF link experiences Generalized K distribution fading along with atmospheric path loss, while the UWOC link endures generalized Gamma distribution turbulent fading, accounting for underwater path loss and pointing errors. Based on these assumptions, when intensity modulation with direct detection (IM/DD) and heterodyne detection (HD) are, respectively, utilized at the receiver, the average outage probability and its corresponding asymptotic expression for the considered hybrid dual-hop systems under high signal-to-noise ratios are derived. Subsequently, Monte Carlo simulations are conducted to validate the accuracy of the theoretical analysis results and to explore the influence of various key system parameters on the dual-hop systems.

Motivated by applications in the computer and food catering service industries, we study an integrated scheduling model of production and distribution operations. In this model, a set of jobs (i.e., customer orders) are first processed in a processing facility (e.g., manufacturing plant or service center) and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that an objective function that takes into account both customer service level and total distribution cost is optimized. Customer service level is measured by a function of the times when the jobs are delivered to the customers. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We study two classes of problems under this integrated scheduling model. In the first class of problems, customer service is measured by the average time when the jobs are delivered to the customers; in the second class, customer service is measured by the maximum time when the jobs are delivered to the customers. Two machine configurations in the processing facility—single machine and parallel machine—are considered. For each of the problems studied, we provide an efficient exact algorithm, or a proof of intractability accompanied by a heuristic algorithm with worst-case and asymptotic performance analysis. Computational experiments demonstrate that the heuristics developed are capable of generating near-optimal solutions. We also investigate the possible benefit of using the proposed integrated model relative to a sequential model where production and distribution operations are scheduled sequentially and separately. Computational tests show that in many cases a significant benefit can be achieved by integration.

In the design of multi-loop Networked Control Systems (NCSs), wherein each control system is characterized by heterogeneous dynamics and associated with a certain set of timing specifications, appropriate metrics need to be employed for the synthesis of control and networking policies to efficiently respond to the requirements of each control loop. The majority of the design approaches for sampling, scheduling, and control policies include either time-based or event-based metrics to perform pertinent actions in response to the changes of the parameters of interest. We specifically focus in this article on Age-of-Information (AoI) as a recently-developed time-based metric and threshold-based triggering function as a generic Event-Triggered (ET) metric. We consider multiple heterogeneous stochastic linear control systems that close their feedback loops over a shared communication network. We investigate the co-design across the NCS and discuss the pros and cons with the AoI and ET approaches in terms of asymptotic control performance measured by Linear-Quadratic Gaussian (LQG) cost functions. In particular, sampling and scheduling policies combining AoI and stochastic ET metrics are proposed. It is argued that pure AoI functions that generate decision variables solely upon minimizing the average age irrespective of control systems dynamics may not be able to improve the overall NCS performance even compared with purely randomized policies. Our theoretical analysis is validated through several simulation scenarios.

Cerebral Palsy (CP) results from an insult to the developing brain and is associated with deficits in locomotor and manual skills and in sensorimotor adaptation. We hypothesized that the poor sensorimotor adaptation in persons with CP is related to their high execution variability and does not reflect a general impairment in adaptation learning. We studied the interaction between performance variability and adaptation deficits using a multi-session locomotor adaptation design in persons with CP. Six adolescents with diplegic CP were exposed, during a period of 15 weeks, to a repeated split-belt treadmill perturbation spread over 30 sessions and were tested again 6 months after the end of training. Compared to age-matched healthy controls, subjects with CP showed poor adaptation and high execution variability in the first exposure to the perturbation. Following training they showed marked reduction in execution variability and an increase in learning rates. The reduction in variability and the improvement in adaptation were highly correlated in the CP group and were retained 6 months after training. Interestingly, despite reducing their variability in the washout phase, subjects with CP did not improve learning rates during washout phases that were introduced only four times during the experiment. Our results suggest that locomotor adaptation in subjects with CP is related to their execution variability. Nevertheless, while variability reduction is generalized to other locomotor contexts, the development of savings requires both reduction in execution variability and multiple exposures to the perturbation.

In the $d$-dimensional hypercube bin packing problem, a given list of $d$-dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SIAM J. Comput. 35 (2005)] showed that the asymptotic performance ratio $\\rho$ of the online bounded space variant is $\\Omega(\\log d)$ and $O(d/\\log d)$, and conjectured that it is $\\Theta(\\log d)$. We show that $\\rho$ is in fact $\\Theta(d/\\log d)$, using probabilistic arguments.

This work is devoted to the error rate analysis of underlay multi-hop cognitive networks with arbitrary number of hops in the presence of multipath fading. Novel analytic expressions are derived in closed-form for the case of Rayleigh fading, which are validated extensively through extensive comparisons with results from computer simulations. In addition, the corresponding asymptotic performance for large maximum transmit power or large maximum interference power is investigated in detail. The derived expressions provide useful insights on the behaviour of the network performance under different operation parameters and include several previous works as special cases. Furthermore, their algebraic representation is relatively simple which renders them convenient to handle both analytically and numerically. The offered results also demonstrate that underlay multi-hop cognitive networks suffer significantly from the error floor phenomenon, the channel estimation error and the order of locating unlicensed users of different maximum transmit power levels, whereas for the linear network model their performance is highly dependant on the number of hops. Moreover, it is shown that optimum positioning of helpers in underlay multi-hop cognitive networks depends on numerous factors and differs substantially from those in traditional multi-hop networks.

In this article, the authors study the effect of peak interference power constraint given by the primary receiver on the performance of multi-hop cognitive amplify-and-forward (AF) relay networks. The athours assume that all involved channels are subject to independent, not necessarily identically distributed Nakagami-m fading and the secondary multi-hop relay network operates in channel state information-assisted AF mode. An analysis of the system performance in terms of outage probability and symbol error rate (SER) is presented. Accordingly, closed-form expressions for the tightly bounded outage probability and SER are formulated which are used for quantifying the impact of the fading channels, the interference power constraint and the number of hops on system performance. More importantly, an asymptotic performance analysis, which intuitively reveals benefits of cooperative diversity of the secondary relay network, is established. The analysis shows that the diversity gain of the considered cognitive relay networks is equal to the minimum of the fading severity parameters of all relaying hops. Also, the interference power constraint imposed by the primary receiver only affects the coding gain of the secondary relay network.

We considered the problem of the estimation of signal-to-noise ratio (SNR) with a real deterministic sinusoid with unknown frequency, phase and amplitude in additive Gaussian noise of unknown variance. A blind SNR estimator that does not require the knowledge of the instantaneous frequency of the sinusoid, through separate estimation of signal and noise power, was derived using the method of moments, a general method to derive estimators based on high-order moments. Statistical performances of the proposed estimators were studied theoretically through derivation of Cramer–Rao lower bounds (CRLBs) and asymptotic variances. Furthermore, results from Monte-Carlo simulations that confirm the validity of the theoretical analysis are presented along with some comments on the use of proposed estimators in practical applications.

This paper studies the asymptotic control problem of a class of large-scale high-order nonlinear systems (LSHONSs), and an asymptotic fuzzy adaptive dynamic surface controller is developed. Unknown nonlinear terms are learned online by fuzzy logic systems (FLSs) such that the accurate nonlinear model is released in the controller design procedure, where the parameters of FLSs are updated by developing adaptive laws. To compensate for the “boundary error” caused by the dynamic surface control method where a linear filter is added in the backstepping procedure to handle the “explosion of complexity” problem, a nonlinear filter is proposed to eliminate the boundary layer error. Some simulations are given to demonstrate the effectiveness of the proposed algorithm.