No abstract

A linear receiver for direct-sequence spreadspectrum multiple-access communication systems under the aperiodic random sequence model is considered. The receiver consists of the conventional matched filter followed by a tapped delay line with the provision of incorporating the use of antenna arrays. It has the ability of suppressing multipleaccess interference (MAI) and narrowband interference in some weighted proportions, as well as combining multipath components without explicit estimation of any channel conditions. Under some specific simplified channel models, the receiver reduces to the minimum variance distortionless response beamformer, the RAKE receiver, a notch filter, or an MAI suppressor. The interference rejection capability is made possible through a suitable choice of weights in the tapped delay line. The optimal weights can be obtained by straightforward but computationally complex eigenanalysis. In order to reduce the computational complexity, a simple blind adaptive algorithm is also developed.

This paper proposes a novel method that can predict protein interaction sites in heterocomplexes using residue spatial sequence profile and evolution rate approaches. The former represents the information of multiple sequence alignments while the latter corresponds to a residueÕs evolutionary conservation score based on a phylogenetic tree. Three predictors using a support vector machines algorithm are constructed to predict whether a surface residue is a part of a protein-protein interface. The efficiency and the effectiveness of our proposed approach is verified by its better prediction performance compared with other models. The study is based on a non-redundant data set of heterodimers consisting of 69 protein chains.

Mobile-edge computing (MEC) is an emerging technology for enhancing the computational capabilities of the mobile devices and reducing their energy consumption via offloading complex computation tasks to the nearby servers. Multiuser MEC at servers is widely realized via parallel computing based on virtualization. Due to finite shared I/O resources, interference between virtual machines (VMs), called I/O interference, degrades the computation performance. In this paper, we study the problem of joint radio-and-computation resource allocation (RCRA) in multiuser MEC systems in the presence of I/O interference. Specifically, offloading scheduling algorithms are designed targeting two system performance metrics: sum offloading throughput maximization and sum mobile energy consumption minimization. Their designs are formulated as non-convex mixed-integer programming problems, which account for latency due to offloading, result downloading and parallel computing. A set of low-complexity algorithms are designed based on a decomposition approach and leveraging classic techniques from combinatorial optimization. The resultant algorithms jointly schedule offloading users, control their offloading sizes, and divide time for communication (offloading and downloading) and computation. They are either optimal or can achieve close-to-optimality as shown by simulation. Comprehensive simulation results demonstrate considering of I/O interference can endow on an offloading controller robustness against the performance-degradation factor. Index TermsMobile edge computing (MEC), parallel computing, I/O interference, virtual machine (VM), resource allocation.

A linear decentralized receiver capable of suppressing multiple-access interference (MAI) for asynchronous directsequence code-division multiple-access (DS-CDMA) systems with aperiodic random signature sequences is proposed. Performance bounds on this receiver are also obtained. Using them as performance measures, the problem of chip waveform selection in DS-CDMA systems with the proposed receiver under the near-far scenario is investigated. In particular, the performance of several practical chip waveforms is compared. An LMS-type adaptive algorithm is developed to obtain the parameters needed in the receiver, which only requires the signature sequence and coarse timing information of the desired user.