Search

Context: Several text books and papers published between 2000 and 2002 have attempted to introduce experimental design and statistical methods to software engineers undertaking empirical studies. Objective: This paper investigates whether there has been an increase in the quality of human-centric experimental and quasi-experimental journal papers over the time period 1993 to 2010. Method: Seventy experimental and quasi-experimental papers published in four general software engineering journals in the years 1992-2002 and 2006-2010 were each assessed for quality by three empirical software engineering researchers using two quality assessment methods (a questionnaire-based method and a subjective overall assessment). Regression analysis was used to assess the relationship between paper quality and the year of publication, publication date group (before 2003 and after 2005), source journal, average coauthor experience, citation of statistical text books and papers, and paper length. The results were validated both by removing papers for which the quality score appeared unreliable and using an alternative quality measure. Results: Paper quality was significantly associated with year, citing general statistical texts, and paper length (p < 0.05). Paper length did not reach significance when quality was measured using an overall subjective assessment. Conclusions: The quality of experimental and quasi-experimental software engineering papers appears to have improved gradually since 1993. [ABSTRACT FROM PUBLISHER]

Recognizing actions from still images has been popularly studied recently. In this paper, we model an action class as a flexible number of spatial configurations of body parts by proposing a new spatial sum–product network (SPN). First, we discover a set of parts in image collections via unsupervised learning. Then, our new spatial SPN is applied to model the spatial relationship and also the high-order correlations of parts. To learn robust networks, we further develop a hierarchical spatial SPN method, which models pairwise spatial relationship between parts inside subimages and models the correlation of subimages via extra layers of SPN. Our method is shown to be effective on two benchmark data sets. [ABSTRACT FROM PUBLISHER]

The corrosion of transformers by multiple sulfides seriously affects the safe operation of transformers. However, there is a lack of quantitative characterization of the extent to which temperature and oxygen as well as changes in sulfide species affect the aging of oil–paper insulation. In this study, the aging characteristics of oil–paper insulation systems were analyzed in terms of the moisture in the oil, moisture in the paper, acid value, and furfural in the presence of multiple sulfides, where the temperature and the oxygen concentration are used as independent variables. A strong positive correlation between the acid value and the furfural obtained by means of Spearman’s correlation analysis. The acid value and furfural content in the oil were then analyzed and compared according to a nonparametric test, and it was found that both the oxygen changes and the temperature changes had a relatively obvious effect on the acid value in the oil. The effect of the temperature change on the furfural was greater than the effect of the oxygen change on the furfural. Finally, a multiple linear regression analysis was performed for the change in the acid value of the oil with the change in the oxygen content and temperature to obtain the linear fitting formulas for the effects of the time, temperature, oxygen content percentage, and sulfide groups on the acid value. This study can be used to quantify the magnitude of the influences of the oxygen, temperature sulfide groups, and other factors on the aging characteristic parameters of the oil–paper insulation system and to provide a certain reference for studying the quantitative characterization of the sulfur corrosion degree by using the change in the acid value in oil. [ABSTRACT FROM AUTHOR]

In this paper, the sequence families of which maximum correlation is determined by the Weil bound of exponential sums are revisited. Using the same approach, two new constructions with large family sizes and low maximum correlation are given. The first construction is an analog of one recent result derived from the interleaved structure of Sidel'nikov sequences. For a prime p and an integer M\vert (p-1), the new M-ary sequence families of period p are obtained from irreducible quadratic polynomials and known power residue-based sequence families. The new sequence families increase family sizes of the known power residue-based sequence families, but keep the maximum correlation unchanged. In the second construction, the sequences derived from the Weil representation are generalized, where each new sequence is the elementwise product of a modulated Sidel'nikov sequence and a modulated trace sequence. For positive integers d

In this paper, considering spatiotemporal correlations, we propose a novel short-term traffic flow prediction method that is based on diverse ensemble deep learning. First, a new measurement function of spatial correlation is established, quantifying the spatial correlation of traffic flow parameters. Second, the convolutional neural network model embedded long short-term memory (LSTM-CNN) is used, enhancing the learning ability of the spatiotemporal correlation of traffic flow parameters. Third, according to the network structure, ensemble rules of diverse LSTM-CNNs are constructed, combining a series of different and moderately accurate LSTM-CNN models and improving the robustness of the algorithm. Finally, a dynamic optimization method for the weight parameters of the ensemble elements is proposed to accommodate the changes in the actual road networks. The experiments show that the measuring method of spatial correlations, the ensemble combination rules of diverse LSTM-CNN and the dynamic optimization method of ensemble element weight parameters, which are proposed in this paper, have positive effects on improving the performance of the prediction algorithm. In addition, the short-term traffic flow prediction method proposed in this paper can adapt to changes in the traffic flow. It can obtain a better prediction effect even with a small sample, and the prediction performance is better than that of the other four classical short-term traffic flow prediction methods. [ABSTRACT FROM AUTHOR]

In many applications, top-k query is an important operation to return a set of interesting points in a potentially huge data space. It is analyzed in this paper that the existing algorithms cannot process top- k query on massive data efficiently. This paper proposes a novel table-scan-based T2S algorithm to efficiently compute top-k results on massive data. T2S first constructs the presorted table, whose tuples are arranged in the order of the round-robin retrieval on the sorted lists. T2S maintains only fixed number of tuples to compute results. The early termination checking for T2S is presented in this paper, along with the analysis of scan depth. The selective retrieval is devised to skip the tuples in the presorted table which are not top-k results. The theoretical analysis proves that selective retrieval can reduce the number of the retrieved tuples significantly. The construction and incremental-update/batch-processing methods for the used structures are proposed in this paper. The extensive experimental results, conducted on synthetic and real-life data sets, show that T2S has a significant advantage over the existing algorithms. [ABSTRACT FROM AUTHOR]

This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a combination of intended signal and inter-cell interference that is correlated with the received signal at a nearby destination, so a relaying link can effectively allow the antennas at the relay and at the destination to be pooled together for both signal enhancement and interference mitigation. We model this scenario by a multiple-input multiple-output (MIMO) Gaussian relay channel with a digital relay-to-destination link of finite capacity, and with correlated noise across the relay and destination antennas. Assuming a compress-and-forward strategy with Gaussian input distribution and quantization noise, we propose a coordinate ascent algorithm for obtaining a stationary point of the non-convex joint optimization of the transmit and quantization covariance matrices. For fixed input distribution, the globally optimum quantization noise covariance matrix can be found in closed-form using a transformation for the relay’s observation that simultaneously diagonalizes two conditional covariance matrices by congruence. For fixed quantization, the globally optimum transmit covariance matrix can be found via convex optimization. This paper further shows that such an optimized achievable rate is within a constant additive gap of the MIMO relay channel capacity. The optimal structure of the quantization noise covariance enables a characterization of the slope of the achievable rate as a function of the relaying link capacity. Moreover, this paper shows that the improvement in spatial degrees of freedom by MIMO relaying in the presence of noise correlation is related to the aforementioned slope via a connection to the deterministic relay channel. [ABSTRACT FROM AUTHOR]

Multimodal sentiment analysis aims to extract and integrate information from different modalities to accurately identify the sentiment expressed in multimodal data. How to effectively capture the relevant information within a specific modality and how to fully exploit the complementary information among multiple modalities are two major challenges in multimodal sentiment analysis. Traditional approaches fail to obtain the global contextual information of long time-series data when extracting unimodal temporal features, and they usually fuse the features from multiple modalities with the same method and ignore the correlation between different modalities when modeling inter-modal interactions. In this paper, we first propose an Attentional Temporal Convolutional Network (ATCN) to extract unimodal temporal features for enhancing the feature representation ability, then introduce a Multi-layer Feature Fusion (MFF) model to improve the effectiveness of multimodal fusion, which fuses the different-level features by different methods according to the correlation coefficient between the features, and cross-modal multi-head attention is used to fully explore the potential relationship between the low-level features. The experimental results on SIMS and CMU-MOSI datasets show that the proposed model achieves superior performance on sentiment analysis tasks compared to state-of-the-art baselines. [ABSTRACT FROM AUTHOR]

Emotional information plays an important role in various multimedia applications. Movies, as a widely available form of multimedia content, can induce multiple positive emotions and stimulate people's pursuit of a better life. Different from negative emotions, positive emotions are highly correlated and difficult to distinguish in the emotional space. Since different positive emotions are often induced simultaneously by movies, traditional single-target or multi-class methods are not suitable for the classification of movie-induced positive emotions. In this paper, we propose TransEEG, a model for multi-label positive emotion classification from a viewer's brain activities when watching emotional movies. The key features of TransEEG include (1) explicitly modeling the spatial correlation and temporal dependencies of multi-channel EEG signals using the Transformer structure based model, which effectively addresses long-distance dependencies, (2) exploiting the label-label correlations to guide the discriminative EEG representation learning, for that we design an Inter-Emotion Mask for guiding the Multi-Head Attention to learn the inter-emotion correlations, and (3) constructing an attention score vector from the representation-label correlation matrix to refine emotion-relevant EEG features. To evaluate the ability of our model for multi-label positive emotion classification, we demonstrate our model on a state-of-the-art positive emotion database CPED. Extensive experimental results show that our proposed method achieves superior performance over the competitive approaches. [ABSTRACT FROM AUTHOR]

The presence of condensate inside the dryer cylinders produces a significant increase in the power requirements during starting, putting at risk the capacity of the drive to complete a successful start. In past papers, authors developed estimation algorithms for the detection of condensate during section starting. This paper proposes and evaluates a new strategy that will complement the previous algorithms. This strategy will detect the presence of condensate from the condensate collapsing during the section shutdown. The proposed correlations are derived through a complete experimental evaluation in two experimental cylinders covering rim thicknesses up to 55 mm. The estimation algorithms are split into a low-/moderate-condensate-load zone and a high-condensate-load zone. Results confirm the robustness and accuracy of the proposed algorithms. [ABSTRACT FROM PUBLISHER]

A relentless root cause analysis of a series of unresolved bearing failures and friction anomalies on spacecraft utilizing ITHACO reaction wheels was funded and completed by United Technologies Corporation, Danbury, CT, USA, which is now known as Collins Aerospace. The analysis implicated a severe space-charging environment as a likely root cause, a factor that was not considered in the previous failure investigations. The strong correlation of geomagnetic storms with ball bearing friction events observed on-orbit was supported by the results of laboratory tests, which successfully duplicated the friction event signatures. The objective of this paper is to shed a new light on previously unexplained or unverified bearing anomalies and failures using this new approach to mechanism friction behavior. The scope of this paper is to open the discussion of anomalous friction signatures to include the effects of the space environment and electrical discharge and introduce this potential root cause to both the space charging and space mechanism communities. [ABSTRACT FROM AUTHOR]

This paper investigates the Gaussian state-dependent interference channel (IC) and Z-IC, in which two receivers are corrupted respectively by two different but correlated states that are noncausally known to two transmitters but are unknown to the receivers. Three interference regimes are studied, and the capacity region boundary or the sum capacity boundary is characterized either fully or partially under various channel parameters. In particular, the impact of the correlation between states on cancellation of state and interference as well as achievability of capacity is explored with numerical illustrations. For the very strong interference regime, the capacity region is achieved by the scheme where the two transmitters implement a cooperative dirty paper coding. For the strong but not very strong interference regime, the sum-rate capacity is characterized by rate splitting, layered dirty paper coding, and successive cancellation. For the weak interference regime, the sum-rate capacity is achieved via dirty paper coding individually at two receivers as well as treating interference as noise. This paper also provides the achievable region for the state-dependent IC with each state known at its corresponding transmitter. [ABSTRACT FROM AUTHOR]

Human beings tend to learn unknown knowledge in a gradual process, from the basic to the complex. Based on this point, we propose a progressive learning method for producing service strategies according to requests, with a hierarchical priori knowledge and reinforcement learning. Service strategy aims to guide how to perform home services and takes into consideration the relationship between actions and objects in home environment. In this paper, strategy generation is regarded as a text generation problem in question answering (QA). Firstly, a hierarchical priori knowledge with service-object correlation at the bottom and action-object correlation at the top is constructed to assist the understanding on the relationship of objects and actions in service strategies. Service-object correlation guides how to select proper objects with the correct order, while action-object correlation associates actions in strategies according to selected objects. Based on the hierarchical priori knowledge, a progressive learning method is proposed to make the model produce effective strategies with a sequential cognition, from service-object correlation (objects) to action-object correlation (actions). After that, reinforcement learning is employed to enhance the progressive guidance, by designing rewards in terms of the hierarchical priori knowledge. Finally, the proposed method is tested with both comparative experiments and ablation studies, and the experimental results demonstrate the superiority in producing comprehensive and logical strategies, indicating that the progressive learning method in our paper can further improve the QA performance. [ABSTRACT FROM AUTHOR]

Objective: Resting-state functional magnetic resonance imaging (rs-fMRI)-derived functional connectivity (FC) patterns have been extensively used to delineate global functional organization of the human brain in healthy development and neuropsychiatric disorders. In this paper, we investigate how FC in males and females differs in an age prediction framework. Methods: We first estimate FC between regions-of-interest (ROIs) using distance correlation instead of Pearson’s correlation. Distance correlation, as a multivariate statistical method, explores spatial relations of voxel-wise time courses within individual ROIs and measures both linear and nonlinear dependence, capturing more complex between-ROI interactions. Then, we propose a novel non-convex multi-task learning (NC-MTL) model to study age-related gender differences in FC, where age prediction for each gender group is viewed as one task, and a composite regularizer with a combination of the non-convex $\ell _{2,1-2}$ and $\ell _{1-2}$ terms is introduced for selecting both common and task-specific features. Results and Conclusion: We validate the effectiveness of our NC-MTL model with distance correlation-based FC derived from rs-fMRI for predicting ages of both genders. The experimental results on the Philadelphia Neurodevelopmental Cohort demonstrate that our NC-MTL model outperforms several other competing MTL models in age prediction. We also compare the age prediction performance of our NC-MTL model using FC estimated by Pearson’s correlation and distance correlation, which shows that distance correlation-based FC is more discriminative for age prediction than Pearson’s correlation-based FC. Significance: This paper presents a novel framework for functional connectome developmental studies, characterizing developmental gender differences in FC patterns. [ABSTRACT FROM AUTHOR]

The use of antenna arrays is indispensable in radar and multiple-input multiple-output (MIMO) wireless communications areas, as it permits the treatment of wavefronts in the spatial domain, enabling important applications such as beamforming and target detection. Spatial information is commonly given in terms of spatial correlation functions (SCFs), but its representation in terms of angular domain, such as the power azimuth spectrums (PASs), is sometimes more convenient. Therefore, transforming from SCF to PAS, and vice versa, is often required. This is commonly done by employing so-called beamformers, where the Bartlett beamformer (BB) is the most commonly utilized. However, the use of beamformers alone is not enough for retrieving PAS information from a given SCF. Particularly, this paper shows that a non-linear operation is missing in relating SCFs to PASs as provided by current beamformers. The paper also shows the mathematical expressions that correctly relate SCFs to PASs and wavenumber spectrums (WNSs) for the general case of systems with antenna arrays. The developed theory results in two new beamformers, which, corroborated by simulation results, solve any previous inconsistency in estimating PASs from SCFs. [ABSTRACT FROM AUTHOR]

In steady-state visual-evoked potential (SSVEP) based brain-computer interfaces (BCIs), existing detection algorithms utilizing spatial filters like task-related component analysis (TRCA) derive the spatial filters mainly through maximizing the inter-trial similarity between the combined signals over the training set. Although they achieve by far the best classification performance in SSVEP-based BCIs, some important problems are still unresolved. Especially, the mechanism of how spatial filters cancel the background noise in brain signals and optimize the signal-to-noise ratio (SNR) of SSVEPs is still not figured out. Therefore, to solve these problems, in this paper a new perspective of spatial filter design is proposed. Specifically, a linear generative signal model of SSVEP is adopted and the spatial filters are obtained automatically through maximum likelihood estimation of source signals and channel vectors. In the same time, the relation between maximum likelihood estimation and signal-to-noise ratio (SNR) maximization is discussed. Through a step-by-step formulation, this paper provides a theoretical justification for those conventional algorithms utilizing spatial filters. As for the classification performance, the proposed scheme is tested on a benchmark dataset of 35 subjects. Experiment results show that the classification performance of the proposed scheme is competitive against three benchmark algorithms, which include TRCA. Especially, the proposed scheme achieves a fair performance improvement over the benchmark methods in the cases where a shorter time window, or a larger number of electrodes, or a smaller number of training blocks are adopted. [ABSTRACT FROM AUTHOR]

In this paper, the underlying assumptions that have been used for designing adaptive particle swarm optimization (PSO) algorithms in the past years are theoretically investigated. I relate these assumptions to the movement patterns of particles controlled by coefficient values (inertia weight and acceleration coefficients) and introduce three factors, namely the autocorrelation of the particle positions, the average movement distance of the particle in each iteration, and the focus of the search, that describe these movement patterns. I show how these factors represent movement patterns of a particle within a swarm and how they are affected by particle coefficients (i.e., inertia weight and acceleration coefficients). I derive equations that provide exact coefficient values to guarantee to achieve the desired movement pattern defined by these three factors within a swarm. I then relate these movements to the searching capability of particles and provide a guideline for designing potentially successful adaptive methods to control coefficients in particle swarm. Finally, I propose a new simple time adaptive particle swarm and compare its results with previous adaptive particle swarm approaches. Experiments show that the theoretical findings indeed provide a beneficial guideline for the successful adaptation of the coefficients in the PSO algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a planning procedure that allows an anthropomorphic dual-arm robotic system to perform a manipulation task in a natural human-like way by using demonstrated human movements. The key idea of the proposal is to convert the demonstrated trajectories into attractive potential fields defined over the configuration space and then use an RRT*-based planning algorithm that minimizes a path-cost function designed to bias the tree growth toward the human-demonstrated configurations. This paper presents a description of the proposed approach as well as results from a conceptual and a real application example, the latter using a real anthropomorphic dual-arm robotic system. A path-quality measure, based on first-order synergies (correlations between joint velocities) obtained from real human movements, is also proposed and used for evaluation and comparison purposes. The obtained results show that the paths obtained with the proposed procedure are more human-like. [ABSTRACT FROM AUTHOR]

This paper examines the polarized backscattering of spatially anisotropic rough surfaces. To better explore the physical mechanisms that control the azimuthal dependence of the backscattering from anisotropic surfaces, the effects of surface roughness [correlation length and root-mean-square (rms) height], dielectric constant, and radar parameters from anisotropic surfaces are studied. The advanced integral equation model (AIEM) is used to simulate both co- and cross-polarized backscattering coefficients, including the single and multiple scattering. Numerical results suggest that the multiple scattering exhibits a stronger azimuthal dependence for HH than VV polarization, especially more so at a larger incident angle. For weakly anisotropic surface, the azimuthal variation of backscattering tends to be a sinusoidal-like pattern. However, with the enhancement of anisotropy, such a scattering pattern is distorted, and the sharp dip appears at up/down direction. As the rms height and dielectric constant increase, the scattering is enhanced on the whole. The HH/VV ratio at lower dielectric constant is greater than that at higher one. In comparison, scattering shows stronger dependence on anisotropy at lower dielectric constant, especially at a larger incident angle. As an application example, we compare the model predictions with reported measurements from two different sites. Preliminary results are quite encouraging, and thus, the analysis presented in this paper is potentially useful to predict and interpret backscattering from crop field surface, where strong anisotropic surfaces commonly present due to plowing or raking practice. [ABSTRACT FROM AUTHOR]

This correspondence paper studies how correlation of the wiretap channel affects the secrecy rate of the artificial noise (AN) scheme. To this end, we first develop a simple but tight lower bound on the ergodic secrecy rate of the AN scheme on correlated multiple-input single-output wiretap channels. Then, utilizing the derived bound, we investigate the influence of correlation on the secrecy rate, which explicitly manifests how the channel correlation affects the optimal power allocation. Ultimately, this paper answers two fundamental questions: when is the AN signal beneficial? and how much power should be allocated for the AN signal to achieve a higher ergodic secrecy rate? in terms of channel correlation. [ABSTRACT FROM AUTHOR]

In this paper, a general framework of constructing the optimal frequency-hopping sequence (FHS) sets is presented based on the designated direct product. Under this framework, we obtain infinitely many new optimal FHS sets by combining some one-coincide (OC) sequence sets that are newly constructed in this paper with some known optimal FHS sets. Our constructions are also based on extension method. However, our constructions give new and flexible parameters due to the free choice of OC sequence set. As a result, our constructions allow a great flexibility of choosing parameters of FHS sets for a given frequency-hopping spread spectrum system. [ABSTRACT FROM AUTHOR]

One objective of this paper is to propose a novel class of sequence pairs, called “quasi-orthogonal Z-complementary pairs (QOZCPs)”, each depicting Z-complementary property for their aperiodic auto-correlation sums and also having a low correlation zone when their aperiodic cross-correlation is considered. Construction of QOZCPs based on Successively Distributed Algorithms under Majorization Minimization (SDAMM) is presented. Another objective of this paper is to apply the proposed QOZCPs in fully polarimetric radar systems and analyse the corresponding ambiguity functions. It turns out that QOZCP waveforms are much more Doppler resilient than the known Golay complementary waveforms. [ABSTRACT FROM AUTHOR]

Let m be an even positive integer. A Boolean bent function ƒ on F2m-1 × F2 is called a cyclic bent function if for any a ≠ b ∈ F2m-1 and ε ∈ F2, ƒ(ax1, x2)+ ƒ(bx1, x2 + ε) is always bent, where x1 ∈ F2m-1, x2 ∈ F2. Cyclic bent functions look extremely rare. This paper focuses on cyclic bent functions on F2m-1 × F2 and their applications. The first objective of this paper is to establish a link between quadratic cyclic bent functions and a special type of prequasifields, and construct a class of quadratic cyclic bent functions from the Kantor-Williams prequasifields. The second objective is to use cyclic bent functions to construct families of optimal sequences. The results of this paper show that cyclic bent functions have nice applications in several fields such as coding theory, symmetric cryptography, and CDMA communication. [ABSTRACT FROM AUTHOR]

With the rapid development of screen content video applications, screen content coding (SCC) is urgently needed to be used in commercial codecs. However, the extra encoding complexity introduced by the new SCC tools has posed a great challenge for its practical deployment. In this paper, motivated by our observations that there should be a fine-grained mapping between image content and candidate modes, we propose a two-step fast mode decision method to reduce the encoding complexity. First, we propose to use a convolution neural network (CNN) to automatically extract useful features for fine-grained content classification. Second, we build a precise and concise mapping from CUs to candidate modes by simultaneously considering CU content type, CU size, and mode complexity. Note that the spatial correlations between neighboring CUs and current CU are also utilized in candidate modes derivation. In addition to the two-step fast mode decision method, a content-aware early termination algorithm is further proposed to reduce the encoding complexity. Extensive experiments demonstrate that our method achieves better performance compared with state-of-the-art ones, with 50.13% total encoding complexity reduction and only 0.92% BD-rate increase. [ABSTRACT FROM AUTHOR]

Railway turnout systems (RTS), as one of the most critical ground infrastructures of the high-speed rail, which directly impact the railway operation safety, are also susceptible to frequent faults. Hence, efficient fault prediction and intelligent maintenance decision support of RTS are significant to avoid unexpected outages and guarantee the operation safety of trains. A key challenge for fault prediction of RTS is to extract and select effective feature combinations that describe the degradation status of the system and then generate health indicators (HI) with high monotonicity, correlation, and robustness. In this paper, we focus on the jam fault caused by insufficient lubrication, which is one of the most frequent faults of RTS, and we present a novel unsupervised adaptive latent feature extraction method based on the improved sparse auto-encoder (ISAE). The locally weighted regression (LOESS) is performed to smooth the extracted latent features to overcome the influence of the noise. Improved auto-associative kernel regression (IAAKR) is utilized to fuse the feature combination and generate HI, which can intuitively describe the degradation status of RTS. Finally, the gated recurrent unit (GRU) network is introduced to enhance the correlation data process and construct the fault prediction models. The parameters of GRU are optimized by the improved particle swarm optimization (IPSO) algorithm. Extensive experiments are conducted on a real-world RTS degradation dataset collected from the Changsha Railway Station in China, which is related to the jam fault caused by the lubrication reduction, and the results show the proposed method achieves better prediction performance compared to state-of-the-art methods in terms of different evaluation metrics. [ABSTRACT FROM AUTHOR]

Spatial modulation (SM) is one special type of multiple-input multiple-output (MIMO) technique whose advantage is that only one radio-frequency (RF) chain is needed. Recently, the so-called cross Z-complementary pair (CZCP) was proposed as the SM training sequence. Optimal channel estimation performance over frequency-selective channels can be achieved since the CZCPs have the specific zero correlation zone (ZCZ) for auto-correlation and cross-correlation sums. However, the ZCZ width of the CZCP is theoretically upper bounded by half sequence length. In this paper, the CZCP is extended to the cross Z-complementary set (CZCS) to have larger ZCZ width which can be used in SM to combat larger delay spread. Several generic constructions of CZCSs with large ZCZ widths and flexible lengths are proposed in this paper. Even the perfect CZCS, whose ZCZ width has the maximum value, can be obtained. Numerical simulations demonstrate that the proposed CZCS-based training sequence can tolerate large delay spreads to improve the channel estimation performance in SM. [ABSTRACT FROM AUTHOR]

With the emergence of new services, the complex optical network environment makes it more difficult to predict network anomalies. This paper proposes a multi-index anomaly prediction scheme with hybrid supervised/unsupervised deep learning for elastic optical networks. Aimed at complex optical network indicators, the scheme presents three phases to enhance the abnormal prediction. The scheme first selects the most influential indicators of anomaly label among the mass of network indicators by calculating the Spearman correlation coefficient. Then, considering the timeliness of network data, it predicts time series of different indicators to analyze future network conditions by using long short-term memory neural network. In order to improve the accuracy and efficiency of the anomaly detection model, the scheme further establishes a deep neural network for anomaly classification. We also discuss how to process data without anomaly labels. The feasibility of the proposed scheme is verified on a real network dataset. Experimental results show that the scheme can predict the occurrence of future network anomalies with high accuracy, protect network services from potential abnormalities, and enhance the stability and robustness of the network. [ABSTRACT FROM AUTHOR]

Previous 2D saliency detection methods extract salient cues from a single view and directly predict the expected results. Both traditional and deep-learning-based 2D methods do not consider geometric information of 3D scenes. Therefore the relationship between scene understanding and salient objects cannot be effectively established. This limits the performance of 2D saliency detection in challenging scenes. In this paper, we show for the first time that saliency detection problem can be reformulated as two sub-problems: light field synthesis from a single view and light-field-driven saliency detection. This paper first introduces a high-quality light field synthesis network to produce reliable 4D light field information. Then a novel light-field-driven saliency detection network is proposed, in which a Direction-specific Screening Unit (DSU) is tailored to exploit the spatial correlation among multiple viewpoints. The whole pipeline can be trained in an end-to-end fashion. Experimental results demonstrate that the proposed method outperforms the state-of-the-art 2D, 3D and 4D saliency detection methods. Our code is publicly available at https://github.com/OIPLab-DUT/ESCNet. [ABSTRACT FROM AUTHOR]

Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users’ local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the product of two matrices from the library. A structure-agnostic solution is to treat each possible matrix product as an independent file and use the MAN coded caching scheme for single file retrieval. This paper proposes two structure-aware schemes, which partition each matrix in the library by either rows or columns and let a subset of users cache some sub-matrices, that improve on the structure-agnostic scheme. For the case where the library matrices are “fat” matrices, the structure-aware row-partition scheme is shown to be order optimal under some constraint. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of learning undirected graphical models from data generated according to the Glauber dynamics (also known as the Gibbs sampler). The Glauber dynamics is a Markov chain that sequentially updates individual nodes (variables) in a graphical model and it is frequently used to sample from the stationary distribution (to which it converges given sufficient time). Additionally, the Glauber dynamics is a natural dynamical model in a variety of settings. This paper deviates from the standard formulation of graphical model learning in the literature, where one assumes access to independent identically distributed samples from the distribution. Much of the research on graphical model learning has been directed toward finding algorithms with low computational cost. As the main result of this paper, we establish that the problem of reconstructing binary pairwise graphical models is computationally tractable when we observe the Glauber dynamics. Specifically, we show that a binary pairwise graphical model on p nodes with maximum degree d can be learned in time f(d)p^2\log p , for a function f(d) defined explicitly in this paper, using nearly the information-theoretic minimum number of samples. [ABSTRACT FROM AUTHOR]

State estimation (SE) of distribution networks heavily relies on pseudo measurements that introduce significant errors, since real-time measurements are insufficient. Interval SE models are regularly used, where true values of system states are supposed to be within the estimated intervals. However, conventional interval SE algorithms cannot consider the correlations of same interval variables in different terms of constraints, which results in overly conservative estimation results. In this paper, we propose a new interval SE model that is based on the relative distance measure (RDM) arithmetic. In the proposed model, measurement errors are assumed to be bounded in given sets and the state variables are described as RDM variables. Since the SE model is a non-convex, the solution's credibility cannot be guaranteed. Therefore, each nonlinear measurement equation in the model is transformed into dual inequality linear equations using the mean value theorem. The SE model is finally reformulated as a linear programming contractor that iteratively narrows the upper and lower bounds of the estimated state variables. Numerical tests on IEEE three-phase distribution networks show that the proposed method outperforms the conventional interval-constrained propagation, modified Krawczyk-operator and optimization based interval SE methods. [ABSTRACT FROM AUTHOR]

Uncertain data objects are objects that can be characterized by either a probability density function (PDF) or with multiple points. Because of existing levels of uncertainty for uncertain data objects, the scatter of this type of objects might be very different than the scatter of certain data objects. Measures of scatter for uncertain objects have not been defined before. In this paper, we define covariance matrix, within scatter matrix, and between scatter matrix as the measures of scatter for uncertain data objects. Also, in this paper, we extend the idea of Fisher linear discriminant analysis for uncertain objects (UFLDA). We also develop kernel Fisher discriminant analysis for uncertain objects (UKFDA). The developed uncertain kernel Fisher discriminants are for two cases: 1) when the uncertain objects are given with PDF and 2) when the uncertain objects are given with multiple points. We compare the performance of our developed uncertain Fisher discriminants (UFLDA and UKFDA) with a few other methods in classification of uncertain data objects through several examples on both simulated and real-world data. We will show in the experiments that our developed uncertain Fisher discriminants outperform other methods in classifying uncertain data objects. [ABSTRACT FROM AUTHOR]

This paper aims to achieve computationally efficient and high-accuracy subpixel image registration with large displacements under the rotation–scale–translation model. This paper employs the classical phase correlation algorithm and the Lucas–Kanade (LK) algorithm in a two-stage coarse-to-fine framework, for which the motivation is from the observation that the two algorithms exhibit strong complementary property between convergence range and subpixel accuracy. In this framework, the LK algorithm will also become computationally efficient owing to the small residual displacement. On the other hand, this paper takes into account the residual model with respect to the compensation scheme explicitly, and deduces formulas for the final results combination, which is expected to be closer to the true displacement vector and thus further improve the estimation accuracy. Since the compensation can be applied to either the target image or the reference image, two algorithms are presented accordingly, and analysis as well as comparison are also performed. Finally, both simulations and real image experiments are performed to verify the motivation, and the results are consistent with the analysis. [ABSTRACT FROM PUBLISHER]

Over the past several years, we have witnessed impressive progress in the field of learned image compression. Recent learned image codecs are commonly based on autoencoders, that first encode an image into low-dimensional latent representations and then decode them for reconstruction purposes. To capture spatial dependencies in the latent space, prior works exploit hyperprior and spatial context model to build an entropy model, which estimates the bit-rate for end-to-end rate-distortion optimization. However, such an entropy model is suboptimal from two aspects: (1) It fails to capture global-scope spatial correlations among the latents. (2) Cross-channel relationships of the latents remain unexplored. In this paper, we propose the concept of separate entropy coding to leverage a serial decoding process for causal contextual entropy prediction in the latent space. A causal context model is proposed that separates the latents across channels and makes use of channel-wise relationships to generate highly informative adjacent contexts. Furthermore, we propose a causal global prediction model to find global reference points for accurate predictions of undecoded points. Both these two models facilitate entropy estimation without the transmission of overhead. In addition, we further adopt a new group-separated attention module to build more powerful transform networks. Experimental results demonstrate that our full image compression model outperforms standard VVC/H.266 codec on Kodak dataset in terms of both PSNR and MS-SSIM, yielding the state-of-the-art rate-distortion performance. [ABSTRACT FROM AUTHOR]

The performance of the recently proposed orientational beamforming (OBF) system for ultra-wideband (UWB) signals degrades seriously in multiuser situation. Although various techniques have been proposed in the literature to suppress multiuser interference in the time-hopping UWB system, there has been no research on interference suppression in the OBF UWB system. In this paper, we propose a nonlinear OBF system via a modified radial basis function (RBF) neural network, named the RBF-OBF system, to reject orientational UWB interferences caused by multiuser transmission in the OBF system. The RBF neural network is selected mainly because of its simple structure, convenient training process, and fast convergence speed. However, the conventional Euclidean-distance-based RBF neural network is not suitable for the training process used in this work, as the training samples are noiseless orientational steering vectors in frequency domain. Therefore, a modified RBF neural network is proposed in this paper, which evaluates the similarity between an input vector and the center vector of a hidden layer neuron by their signed complex correlation coefficient. Numerous simulations demonstrate that compared to the conventional OBF system, the proposed RBF-OBF system can significantly reduce the bit error rates (BERs) under different noise and interference situations. The BER reduction rate of the proposed RBF-OBF system is higher than 92% in additive white Gaussian noise channel and higher than 89% in line-of-sight multipath channel. [ABSTRACT FROM AUTHOR]

A recent paper claims to classify brain processing evoked in subjects watching ImageNet stimuli as measured with EEG and to employ a representation derived from this processing to construct a novel object classifier. That paper, together with a series of subsequent papers , , , , , , , claims to achieve successful results on a wide variety of computer-vision tasks, including object classification, transfer learning, and generation of images depicting human perception and thought using brain-derived representations measured through EEG. Our novel experiments and analyses demonstrate that their results crucially depend on the block design that they employ, where all stimuli of a given class are presented together, and fail with a rapid-event design, where stimuli of different classes are randomly intermixed. The block design leads to classification of arbitrary brain states based on block-level temporal correlations that are known to exist in all EEG data, rather than stimulus-related activity. Because every trial in their test sets comes from the same block as many trials in the corresponding training sets, their block design thus leads to classifying arbitrary temporal artifacts of the data instead of stimulus-related activity. This invalidates all subsequent analyses performed on this data in multiple published papers and calls into question all of the reported results. We further show that a novel object classifier constructed with a random codebook performs as well as or better than a novel object classifier constructed with the representation extracted from EEG data, suggesting that the performance of their classifier constructed with a representation extracted from EEG data does not benefit from the brain-derived representation. Together, our results illustrate the far-reaching implications of the temporal autocorrelations that exist in all neuroimaging data for classification experiments. Further, our results calibrate the underlying difficulty of the tasks involved and caution against overly optimistic, but incorrect, claims to the contrary. [ABSTRACT FROM AUTHOR]

This paper describes a new pulse sequence design and estimation approach, which can increase the maximum detectable velocity in synthetic-aperture (SA) velocity imaging. In SA, $N$ spherical or plane waves are emitted, and the sequence is repeated continuously. The $N$ emissions are combined to form a high-resolution image (HRI). Correlation of HRIs is employed to estimate velocity, and the combination of $N$ emissions lowers the effective pulse repetition frequency by $N$. Interleaving emission sequences can increase the effective pulse repetition frequency to the actual pulse repetition frequency, thereby increasing the maximum detectable velocity by a factor of $N$. This makes it possible to use longer sequences with better focusing properties. It can also increase the possible interrogation depth for vessels with large velocities. A new cross-correlation vector flow estimator is also presented, which can further increase the maximum detectable velocity by a factor of 3. It is based on transverse oscillation (TO), a preprocessing stage, and cross-correlation of signals beamformed orthogonal to the ultrasound propagation direction. The estimator is self-calibrating without estimating the lateral TO wavelength. This paper develops the theory behind the two methods. The performance is demonstrated in the accompanying paper for convex and phased array probes connected to the synthetic aperture real-time ultrasound system scanner for parabolic flow for both conventional and SA imaging. [ABSTRACT FROM AUTHOR]

This paper addresses the transmission network expansion planning problem under uncertain demand and generation capacity. A two-stage adaptive robust optimization framework is adopted whereby the worst-case operating cost is accounted for under a given user-defined uncertainty set. This paper differs from previously reported robust solutions in two respects. First, the typically disregarded correlation of uncertainty sources is explicitly considered through an ellipsoidal uncertainty set relying on their variance-covariance matrix. In addition, we describe the analogy between the corresponding second-stage problem and a certain class of mathematical programs arising in structural reliability. This analogy gives rise to a relevant probabilistic interpretation of the second stage, thereby revealing an undisclosed feature of the worst-case setting characterizing robust optimization with ellipsoidal uncertainty sets. More importantly, a novel nested decomposition approach based on results from structural reliability is devised to solve the proposed robust counterpart, which is cast as an instance of mixed-integer trilevel programming. Numerical results from several case studies demonstrate that the effect of correlated uncertainty can be captured by the proposed robust approach. [ABSTRACT FROM AUTHOR]

This paper studies the ergodic rate performance of regularized zero-forcing (RZF) precoding in the downlink of a multi-user multiple-input single-output (MISO) system, where the channel between the base station (BS) and each user is modeled by the double scattering model. This non-Gaussian channel model is a function of both the antenna correlation and the structure of scattering in the propagation environment. This paper makes the preliminary contribution of deriving the minimum-mean-square-error (MMSE) channel estimate for this model. Then under the assumption that the users are divided into groups of common correlation matrices, this paper derives deterministic approximations of the signal-to-interference-plus-noise ratio (SINR) and the ergodic rate, which are almost surely tight in the limit that the number of BS antennas, the number of users, and the number of scatterers in each group grow infinitely large. The derived results are expressed in a closed-form for the special case of multi-keyhole channels. The simulation results confirm the close match provided by the asymptotic analysis for moderate system dimensions. We show that the maximum number of users that can be supported simultaneously, while realizing large-scale MIMO gains, is equal to the number of scatterers. [ABSTRACT FROM AUTHOR]

Caching of video files at the wireless edge, i.e., at the base stations or on user devices, is a key method for improving wireless video delivery. While global popularity distributions of video content have been investigated in the past and used in a variety of caching algorithms, this paper investigates the statistical modeling of the individual user preferences. With individual preferences being represented by probabilities, we identify their critical features and parameters and propose a novel modeling framework by using a genre-based hierarchical structure as well as a parameterization of the framework based on an extensive real-world data set. Besides, the correlation analysis between parameters and critical statistics of the framework is conducted. With the framework, an implementation recipe for generating practical individual preference probabilities is proposed. By comparing with the underlying real data, we show that the proposed models and generation approach can effectively characterize the individual preferences of users for video content. [ABSTRACT FROM AUTHOR]