Quantifying Listeria monocytogenes prevalence and concentration in minced pork meat and estimating performance of three culture media from presence/absence microbiological testing using a deterministic and stochastic approach

Listeria monocytogenes poses a serious threat to public health, and the majority of cases of human listeriosis are associated with contaminated food. Reliable microbiological testing is needed for effective pathogen control by food industry and competent authorities. The aims of this work were to estimate the prevalence and concentration of L. monocytogenes in minced pork meat by the application of a Bayesian modeling approach, and also to determine the performance of three culture media commonly used for detecting L. monocytogenes in foods from a deterministic and stochastic perspective. Samples (n = 100) collected from local markets were tested for L. monocytogenes using in parallel the PALCAM, ALOA and RAPID'L.mono selective media according to ISO 11290-1:1996 and 11290-2:1998 methods. Presence of the pathogen was confirmed by conducting biochemical and molecular tests. Independent experiments (n = 10) for model validation purposes were performed. Performance attributes were calculated from the presence–absence microbiological test results by combining the results obtained from the culture media and confirmative tests. Dirichlet distribution, the multivariate expression of a Beta distribution, was used to analyze the performance data from a stochastic perspective. No L. monocytogenes was enumerated by direct-plating (<10 CFU/g), though the pathogen was detected in 22% of the samples. L. monocytogenes concentration was estimated at 14–17 CFU/kg. Validation showed good agreement between observed and predicted prevalence (error = −2.17%). The results showed that all media were best at ruling in L. monocytogenes presence than ruling it out. Sensitivity and specificity varied depending on the culture-dependent method. None of the culture media was perfect in detecting L. monocytogenes in minced pork meat alone. The use of at least two culture media in parallel enhanced the efficiency of L. monocytogenes detection. Bayesian modeling may reduce the time needed to draw conclusions regarding L. monocytogenes presence and the uncertainty of the results obtained. Furthermore, the problem of observing zero counts may be overcome by applying Bayesian analysis, making the determination of a test performance feasible.     

Blind channel identification and equalization using periodicmodulation precoders: performance analysis

The paper deals with blind identification and equalization of communication channels within the so-called modulation induced cyclostationarity (MIC) framework, where the input symbol stream is modulated by a P periodic precoder with the purpose of inducing cyclostationarity in the transmit sequence. By exploiting the cyclostationarity induced by the periodic precoder, a subspace-based channel identification algorithm that is resilient to the location of channel zeros, channel order overestimation errors, and color of additive stationary noise, is developed. The asymptotic performance of the subspace-based identification approach is analyzed and compared with the asymptotic lower bound provided by the nonlinear cyclic correlation matching approach. Criteria for optimally designing the periodic precoder are also presented. The performance of MMSE-FIR and MMSE-DFE equalizers is quantified for the proposed cyclostationarity-induced framework in terms of the MMSE. Although cyclostationarity-inducing transmitters present several advantages relative to their stationary counterparts from a channel estimation viewpoint, it is shown that from an equalization viewpoint, MIC-based systems exhibit a slightly increased MMSE/BER when compared with the stationary case     

Lagrange/Vandermonde MUI eliminating user codes forquasi-synchronous CDMA in unknown multipath

A family of codes for low-complexity quasi-synchronous code division multiple access (CDMA) systems is developed in order to eliminate multiuser interference (MUI) completely in the presence of unknown and even rapidly varying multipath. Judiciously designed precomputable symbol-periodic user codes, which we term Lagrange or Vandermonde, and the corresponding linear receivers offer a generalization of orthogonal frequency division multiplexing (OFDM), which are especially valuable when deep-fading, carrier frequency errors, and Doppler effects are present. The flexibility inherent to the designed transceivers is exploited to derive transmission strategies that cope with major impairments of wireless CDMA channels. The symbol-periodic code design is also generalized to include the class of aperiodic spreading and orthogonal multirate codes for variable bit rate users. Performance analysis and simulations results illustrate the advantages of the proposed scheme over competing alternatives     

On the estimation of the K parameter for the Rice fadingdistribution

We study the statistical performance of two moment-based estimators for the K parameter of Rice fading distribution, as less complex alternatives to the maximum-likelihood estimator. Our asymptotic analysis reveals that both estimators are nearly asymptotically efficient, and that there is a compromise between the computational simplicity and the statistical efficiency of these two estimators. We also show, by Monte Carlo simulation, that the fading correlation among the envelope samples deteriorates the performance of both estimators. However, the simpler estimator, which employs the second and the fourth moments of the signal envelope, appears to be more suitable for real-world applications     

DCAF: An MPEG-21 Dynamic Content Adaptation Framework

Universal Multimedia Access aims at providing a gratifying end user-experience by either adapting the content, be it static or dynamic, to suit the usage environment or adapting the usage environment, be it client- or server-centric, to suit content. This paper presents our MPEG-21 Dynamic Content Adaptation Framework, acronym DCAF, which uses a fusion of Genetic Algorithms and Strength Pareto Optimality to adapt content in order to suit the usage environment.

Scalable Distributed Sensor Fault Diagnosis for Smart Buildings

The enormous energy use of the building sector and the requirements for indoor living quality that aim to improve occupants’ productivity and health, prioritize Smart Buildings as an emerging technology. The Heating, Ventilation and Air-Conditioning (HVAC) system is considered one of the most critical and essential parts in buildings since it consumes the largest amount of energy and is responsible for humans comfort. Due to the intermittent operation of HVAC systems, faults are more likely to occur, possibly increasing eventually building’s energy consumption and/or downgrading indoor living quality. The complexity and large scale nature of HVAC systems complicate the diagnosis of faults in a centralized framework. This paper presents a distributed intelligent fault diagnosis algorithm for detecting and isolating multiple sensor faults in large-scale HVAC systems. Modeling the HVAC system as a network of interconnected subsystems allows the design of a set of distributed sensor fault diagnosis agents capable of isolating multiple sensor faults by applying a combinatorial decision logic and diagnostic reasoning. The performance of the proposed method is investigated with respect to robustness, fault detectability and scalability. Simulations are used to illustrate the effectiveness of the proposed method in the presence of multiple sensor faults applied to a 83-zone HVAC system and to evaluate the sensitivity of the method with respect to sensor noise variance.      

Passive Attack Detection for a Class of Stealthy Intermittent Integrity Attacks

This paper proposes a passive methodology for detecting a class of stealthy intermittent integrity attacks in cyber-physical systems subject to process disturbances and measurement noise. A stealthy intermittent integrity attack strategy is first proposed by modifying a zero-dynamics attack model. The stealthiness of the generated attacks is rigorously investigated under the condition that the adversary does not know precisely the system state values. In order to help detect such attacks, a backward-in-time detection residual is proposed based on an equivalent quantity of the system state change, due to the attack, at a time prior to the attack occurrence time. A key characteristic of this residual is that its magnitude increases every time a new attack occurs. To estimate this unknown residual, an optimal fixed-point smoother is proposed by minimizing a piece-wise linear quadratic cost function with a set of specifically designed weighting matrices. The smoother design guarantees robustness with respect to process disturbances and measurement noise, and is also able to maintain sensitivity as time progresses to intermittent integrity attack by resetting the covariance matrix based on the weighting matrices. The adaptive threshold is designed based on the estimated backward-in-time residual, and the attack detectability analysis is rigorously investigated to characterize quantitatively the class of attacks that can be detected by the proposed methodology. Finally, a simulation example is used to demonstrate the effectiveness of the developed methodology.      

Assessing stationarity in web analytics: A study of bounce rates

Evidence-based methods for evaluating marketing interventions such as A/B testing have become standard practice. However, the pitfalls associated with the misuse of this decision-making instrument are not well understood by managers and analytics professionals. In this study, we assess the impact of stationarity on the validity of samples from conditioned time series, which are abundant in web metrics. Such a prominent metric is the bounce rate, which is prevalent in assessing engagement with web content as well as the performance of marketing touchpoints. In this study, we show how to control for stationarity using an algorithmic transformation to calculate the optimum sampling period. This distance is based on a novel stationary ergodic process that considers that a stationary series presents reversible symmetric features and is calculated using a dynamic time warping algorithm in a self-correlation procedure. This study contributes to the expert and intelligent systems literature by demonstrating a robust method for sub-sampling time-series data, which are critical in decision making.     

Learning Part Boundaries from 3D Point Clouds

We present a method that detects boundaries of parts in 3D shapes represented as point clouds. Our method is based on a graph convolutional network architecture that outputs a probability for a point to lie in an area that separates two or more parts in a 3D shape. Our boundary detector is quite generic: it can be trained to localize boundaries of semantic parts or geometric primitives commonly used in 3D modeling. Our experiments demonstrate that our method can extract more accurate boundaries that are closer to ground-truth ones compared to alternatives. We also demonstrate an application of our network to fine-grained semantic shape segmentation, where we also show improvements in terms of part labeling performance.