Zero attracting recursive least squares algorithms

The l1-norm sparsity constraint is a widely used technique for constructing sparse models. In this contribution, two zero-attracting recursive least squares algorithms, referred to as ZA-RLS-I and ZA-RLS-II, are derived by employing the l1-norm of parameter vector constraint to facilitate the model sparsity. In order to achieve a closed-form solution, the l1-norm of the parameter vector is approximated by an adaptively weighted l2-norm, in which the weighting factors are set as the inversion of the associated l1-norm of parameter estimates that are readily available in the adaptive learning environment. ZA-RLS-II is computationally more efficient than ZA-RLS-I by exploiting the known results from linear algebra as well as the sparsity of the system. The proposed algorithms are proven to converge, and adaptive sparse channel estimation is used to demonstrate the effectiveness of the proposed approach.

Heterogeneous tensor decomposition for clustering via manifold optimization

Tensor clustering is an important tool that exploits intrinsically rich structures in real-world multiarray or Tensor datasets. Often in dealing with those datasets, standard practice is to use subspace clustering that is based on vectorizing multiarray data. However, vectorization of tensorial data does not exploit complete structure information. In this paper, we propose a subspace clustering algorithm without adopting any vectorization process. Our approach is based on a novel heterogeneous Tucker decomposition model taking into account cluster membership information. We propose a new clustering algorithm that alternates between different modes of the proposed heterogeneous tensor model. All but the last mode have closed-form updates. Updating the last mode reduces to optimizing over the multinomial manifold for which we investigate second order Riemannian geometry and propose a trust-region algorithm. Numerical experiments show that our proposed algorithm compete effectively with state-of-the-art clustering algorithms that are based on tensor factorization.

Accuracy of Periapical Radiography and Cone-Beam Computed Tomography Scans in Diagnosing Apical Periodontitis Using Histopathological Findings as a Gold Standard

Introduction: The aim of this study was to evaluate the accuracy of two imaging methods in diagnosing apical periodontitis (AP) using histopathological findings as a gold standard. Methods: The periapex of 83 treated or untreated roots of dogs` teeth was examined using periapical radiography (PR), cone-beam computed tomography (CBCT) scans, and histology. Sensitivity, specificity, predictive values, and accuracy of PR and CBCT diagnosis were calculated. Results: PR detected AP in 71% of roots, a CBCT scan detected AP in 84%, and AP was histologically diagnosed in 93% (p = 0.001). Overall, sensitivity was 0.77 and 0.91 for PR and CBCT, respectively. Specificity was 1 for both. Negative predictive value was 0.25 and 0.46 for PR and CBCT, respectively. Positive predictive value was 1 for both. Diagnostic accuracy (true positives + true negatives) was 0.78 and 0.92 for PR and CBCT (p = 0.028), respectively. Conclusion: A CBCT scan was more sensitive in detecting AP compared with PR, which was more likely to miss AP when it was still present. (J Endod 2009;35:1009-1012)

Effect of agitation on the performance of an anaerobic sequencing batch biofilm reactor in the treatment of dairy effluents

Agitation rate is an important parameter in the operation of Anaerobic Sequencing Biofilm Batch Reactors (ASBBRs), and a proper agitation rate guarantees good mixing, improves mass transfer, and enhances the solubility of the particulate organic matter. Dairy effluents have a high amount of particulate organic matter, and their anaerobic digestion presents inhibitory intermediates (e. g., long-chain fatty acids). The importance of studying agitation in such batch systems is clear. The present study aimed to evaluate how agitation frequency influences the anaerobic treatment of dairy effluents. The ASBBR was fed with wastewater from milk pasteurisation process and cheese manufacture with no whey segregation. The organic matter concentration, measured as chemical oxygen demand (COD), was maintained at approximately 8,000 mg/L. The reactor was operated with four agitation frequencies: 500 rpm, 350 rpm, 200 rpm, and no agitation. In terms of COD removal efficiency, similar results were observed for 500 rpm and 350 rpm (around 90%) and for 200 rpm and no agitation (around 80%). Increasing the system`s agitation thus not only improved the global efficiency of organic matter removal but also influenced volatile acid production and consumption and clearly modified this balance in each experimental condition.

Association of Human T Lymphotropic Virus 1 Amplification of Periodontitis Severity with Altered Cytokine Expression in Response to a Standard Periodontopathogen Infection

Background. Periodontal diseases (PDs) are infectious diseases in which periodontopathogens trigger chronic inflammatory and immune responses that lead to tissue destruction. Recently, viruses have been implicated in the pathogenesis of PDs. Individuals infected with human T lymphotropic virus 1 (HTLV-1) present with abnormal oral health and a marked increased prevalence of periodontal disease. Methods. In this study, we investigated the patterns of periodontopathogen infection and local inflammatory immune markers in HTLV-1-seropositive individuals with chronic periodontitis (CP/HTLV-1 group) compared with HTLV-1 -seronegative individuals with chronic periodontitis (CP group) and periodontally healthy, HTLV-1 -seronegative individuals (control group). Results. Patients in the CP/HTLV-1 group had significantly higher values of bleeding on probing, mean probing depth, and attachment loss than patients in the CP group. The expression of tumor necrosis factor a and interleukin (IL) 4 was found to be similar in the CP and CP/HTLV-1 groups, whereas IL-12 and IL-17 levels trended toward a higher expression in the CP/HTLV-1 group. A significant increase was seen in the levels of IL-1 beta and interferon gamma in the CP/HTLV-1 group compared with the CP group, whereas expression of the regulatory T cell marker FOXp3 and IL-10 was significantly decreased in the lesions from the CP/HTLV-1 group. Interestingly, similar frequency and/or load of periodontopathogens (Porphyromonas gingivalis, Tannerella forsythia, Treponema denticola, and Aggregatibacter actinomycetemcomitans) and frequency of viruses (herpes simplex virus 1, human cytomegalovirus, and Epstein-Barr virus) characteristically associated with PDs were found in the CP/HTLV and CP groups. Conclusions. HTLV-1 may play a critical role in the pathogenesis of periodontal disease through the deregulation of the local cytokine network, resulting in an exacerbated response against a standard periodontopathogen infection.

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

The non-twist standard map with robust tori

The non-twist standard map occurs frequently in many fields of science specially in modelling the dynamics of the magnetic field lines in tokamaks. Robust tori, dynamical barriers that impede the radial transport among different regions of the phase space, are introduced in the non-twist standard map in a conservative fashion. The resulting non-twist standard map with robust tori is an improved model to study transport barriers in plasmas confined in tokamaks.

Formulation of the standard model in terms of spinor fields

We propose an alternative formulation of the Standard Model which reduces the number of free parameters. In our framework, fermionic fields are assigned to fundamental representations of the Lorentz and the internal symmetry groups, whereas bosonic field variables transform as direct products of fundamental representations of all symmetry groups. This allows us to reduce the number of fundamental symmetries. We formulate the Standard Model by considering the SU(3) and SU(2) symmetry groups as the underlying symmetries of the fundamental interactions. This allows us to suggest a model, for the description of the interactions of the intermediate bosons among themselves and interactions of fermions, that makes use of just two parameters. One parameter characterizes the symmetric phase, whereas the other parameter (the asymmetry parameter) gives the breakdown strength of the symmetries. All coupling strengths of the Standard Model are then derived in terms of these two parameters. In particular, we show that all fermionic electric charges result from symmetry breakdown.

Extending the use of canonical and microcanonical Monte Carlo algorithms to spin models

We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.

Electroweak precision constraints on the Lee-Wick standard model

We perform an analysis of the electroweak precision observables in the Lee-Wick Standard Model. The most stringent restrictions come from the S and T parameters that receive important tree level and one loop contributions. In general the model predicts a large positive S and a negative T. To reproduce the electroweak data, if all the Lee-Wick masses are of the same order, the Lee-Wick scale is of order 5 TeV. We show that it is possible to find some regions in the parameter space with a fermionic state as light as 2.4-3.5 TeV, at the price of rising all the other masses to be larger than 5-8 TeV. To obtain a light Higgs with such heavy resonances a fine-tuning of order a few per cent, at least, is needed. We also propose a simple extension of the model including a fourth generation of Standard Model fermions with their Lee-Wick partners. We show that in this case it is possible to pass the electroweak constraints with Lee-Wick fermionic masses of order 0.4-1.5 TeV and Lee-Wick gauge masses of order 3 TeV.

Noninvasive Evaluation of Oral Lesions Using Depth-sensitive Optical Spectroscopy

BACKGROUND: Optical spectroscopy is a noninvasive technique with potential applications for diagnosis of oral dysplasia and early cancer. In this study, we evaluated the diagnostic performance of a depth-sensitive optical spectroscopy (DSOS) system for distinguishing dysplasia and carcinoma from non-neoplastic oral mucosa. METHODS: Patients with oral lesions and volunteers without any oral abnormalities were recruited to participate. Autofluorescence and diffuse reflectance spectra of selected oral sites were measured using the DSOS system. A total of 424 oral sites in 124 subjects were measured and analyzed, including 154 sites in 60 patients with oral lesions and 270 sites in 64 normal volunteers. Measured optical spectra were used to develop computer-based algorithms to identify the presence of dysplasia or cancer. Sensitivity and specificity were calculated using a gold standard of histopathology for patient sites and clinical impression for normal volunteer sites. RESULTS: Differences in oral spectra were observed in: (1) neoplastic versus nonneoplastic sites, (2) keratinized versus nonkeratinized tissue, and (3) shallow versus deep depths within oral tissue. Algorithms based on spectra from 310 nonkeratinized anatomic sites (buccal, tongue, floor of mouth, and lip) yielded an area under the receiver operating characteristic curve of 0.96 in the training set and 0.93 in the validation set. CONCLUSIONS: The ability to selectively target epithelial and shallow stromal depth regions appeared to be diagnostically useful. For nonkeratinized oral sites, the sensitivity and specificity of this objective diagnostic technique were comparable to that of clinical diagnosis by expert observers. Thus, DSOS has potential to augment oral cancer screening efforts in community settings. Cancer 2009;115:1669-79. (C) 2009 American Cancer Society.

Cross-situational learning of object-word mapping using Neural Modeling Fields

The issue of how children learn the meaning of words is fundamental to developmental psychology. The recent attempts to develop or evolve efficient communication protocols among interacting robots or Virtual agents have brought that issue to a central place in more applied research fields, such as computational linguistics and neural networks, as well. An attractive approach to learning an object-word mapping is the so-called cross-situational learning. This learning scenario is based on the intuitive notion that a learner can determine the meaning of a word by finding something in common across all observed uses of that word. Here we show how the deterministic Neural Modeling Fields (NMF) categorization mechanism can be used by the learner as an efficient algorithm to infer the correct object-word mapping. To achieve that we first reduce the original on-line learning problem to a batch learning problem where the inputs to the NMF mechanism are all possible object-word associations that Could be inferred from the cross-situational learning scenario. Since many of those associations are incorrect, they are considered as clutter or noise and discarded automatically by a clutter detector model included in our NMF implementation. With these two key ingredients - batch learning and clutter detection - the NMF mechanism was capable to infer perfectly the correct object-word mapping. (C) 2009 Elsevier Ltd. All rights reserved.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.