Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

The Contractibility problem takes as input two graphs G and H, and the task is to decide whether H can be obtained from G by a sequence of edge contractions. The Induced Minor and Induced Topological Minor problems are similar, but the first allows both edge contractions and vertex deletions, whereas the latter allows only vertex deletions and vertex dissolutions. All three problems are NP-complete, even for certain fixed graphs H. We show that these problems can be solved in polynomial time for every fixed H when the input graph G is chordal. Our results can be considered tight, since these problems are known to be W[1]-hard on chordal graphs when parameterized by the size of H. To solve Contractibility and Induced Minor, we define and use a generalization of the classic Disjoint Paths problem, where we require the vertices of each of the k paths to be chosen from a specified set. We prove that this variant is NP-complete even when k=2, but that it is polynomial-time solvable on chordal graphs for every fixed k. Our algorithm for Induced Topological Minor is based on another generalization of Disjoint Paths called Induced Disjoint Paths, where the vertices from different paths may no longer be adjacent. We show that this problem, which is known to be NP-complete when k=2, can be solved in polynomial time on chordal graphs even when k is part of the input. Our results fit into the general framework of graph containment problems, where the aim is to decide whether a graph can be modified into another graph by a sequence of specified graph operations. Allowing combinations of the four well-known operations edge deletion, edge contraction, vertex deletion, and vertex dissolution results in the following ten containment relations: (induced) minor, (induced) topological minor, (induced) subgraph, (induced) spanning subgraph, dissolution, and contraction. Our results, combined with existing results, settle the complexity of each of the ten corresponding containment problems on chordal graphs.     

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

The problem of computing the chromatic number of a P ₅-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P ₅-free graph admits a k-coloring, and finding one, if it does.     

Vocal-based emotion recognition using random forests and decision tree

This paper proposes a new vocal-based emotion recognition method using random forests, where pairs of the features on the whole speech signal, namely, pitch, intensity, the first four formants, the first four formants bandwidths, mean autocorrelation, mean noise-to-harmonics ratio and standard deviation, are used in order to recognize the emotional state of a speaker. The proposed technique adopts random forests to represent the speech signals, along with the decision-trees approach, in order to classify them into different categories. The emotions are broadly categorised into the six groups, which are happiness, fear, sadness, neutral, surprise, and disgust. The Surrey Audio-Visual Expressed Emotion database is used. According to the experimental results using leave-one-out cross-validation, by means of combining the most significant prosodic features, the proposed method has an average recognition rate of \(66.28\%\), and at the highest level, the recognition rate of \(78\%\) has been obtained, which belongs to the happiness voice signals. The proposed method has \(13.78\%\) higher average recognition rate and \(28.1\%\) higher best recognition rate compared to the linear discriminant analysis as well as \(6.58\%\) higher average recognition rate than the deep neural networks results, both of which have been implemented on the same database.     

Logical Representation of a Conceptual Model for Spatial Data Warehouses

The MultiDimER model is a conceptual model used for representing a multidimensional view of data for Data Warehouse (DW) and On-Line Analytical Processing (OLAP) applications. This model includes a spatial extension allowing spatiality in levels, hierarchies, fact relationships, and measures. In this way decision-making users can represent in an abstract manner their analysis needs without considering complex implementation issues and spatial OLAP tools developers can have a common vision for representing spatial data in a multidimensional model. In this paper we propose the transformation of a conceptual schema based on the MultiDimER constructs to an object-relational schema. We based our mapping on the SQL:2003 and SQL/MM standards giving examples of commercial implementation using Oracle 10g with its spatial extension. Further we use spatial integrity constraints to ensure the semantic equivalence of the conceptual and logical schemas. We also show some examples of Oracle spatial functions, including aggregation functions required for the manipulation of spatial data. The described mappings to the object-relational model along with the examples using a commercial system show the feasibility of implementing spatial DWs in current commercial DBMSs. Further, using integrated architectures, where spatial and thematic data is defined within the same DBMS, facilitates the system management simplifying data definition and manipulation.

Finding Induced Paths of Given Parity in Claw-Free Graphs

The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in $\mathcal{O}(n^{5})$ time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in $\mathcal{O}(n^{5})$ time and $\mathcal{O}(n^{7})$ time, respectively. We also show that we can decide in $\mathcal{O}(n^{7})$ time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in $\mathcal {O}(n^{7})$ time.     

On the Role of C Addition on α Precipitation in a β Titanium Alloy

The onset of α nucleation in a carbon containing β-titanium alloy has been investigated by coupling atom probe tomography (APT) with transmission electron microscopy. The analysis of the APT results indicates that in addition to ω precipitates that can act as potential α nucleation sites, carbon atoms tend to form clusters within the β-matrix, which in turn give rise to additional nucleation sites for α, resulting in finer scale α precipitates due to increased nucleation density.     

Brain Mechanisms of Exercise-Induced Hypoalgesia: To Find a Way Out from “Fear-Avoidance Belief”

It is well known that exercise produces analgesic effects (exercise-induced hypoalgesia (EIH)) in animal models and chronic pain patients, but the brain mechanisms underlying these EIH effects, especially concerning the emotional aspects of pain, are not yet fully understood. In this review, we describe drastic changes in the mesocorticolimbic system of the brain which permit the induction of EIH effects. The amygdala (Amyg) is a critical node for the regulation of emotions, such as fear and anxiety, which are closely associated with chronic pain. In our recent studies using neuropathic pain (NPP) model mice, we extensively examined the association between the Amyg and EIH effects. We found that voluntary exercise (VE) activated glutamate (Glu) neurons in the medial basal Amyg projecting to the nucleus accumbens (NAc) lateral shell, while it almost completely suppressed NPP-induced activation of GABA neurons in the central nucleus of the Amyg (CeA). Furthermore, VE significantly inhibited activation of pyramidal neurons in the ventral hippocampus-CA1 region, which play important roles in contextual fear conditioning and the retrieval of fear memory. This review describes novel information concerning the brain mechanisms underlying EIH effects as a result of overcoming the fear-avoidance belief of chronic pain.     

The Role of Chemokines in the Development of Gastric Cancer—Diagnostic and Therapeutic Implications

Gastric cancer (GC) is the fifth most common cancer worldwide and the second leading cause of cancer-related death. GC is usually diagnosed at an advanced stage due to late presentation of symptoms. Therefore, there is a need for establishing more sensitive and specific markers useful in early detection of the disease when a cancer is asymptomatic to improve the diagnostic and clinical decision-making process. Some researchers suggest that chemokines and their specific receptors play an important role in GC initiation and progression via promotion of angiogenesis, tumor transformation, invasion, survival and metastasis as well as protection from host response and inter-cell communication. Chemokines are small proteins produced by various cells such as endothelial cells, fibroblasts, leukocytes, and epithelial and tumor cells. According to our knowledge, the significance of chemokines and their specific receptors in diagnosing GC and evaluating its progression has not been fully elucidated. The present article offers a review of current knowledge on general characteristics of chemokines, specific receptors and their role in GC pathogenesis as well as their potential usefulness as novel biomarkers for GC.     

Comparison of antimicrobial resistance of Campylobacter jejuni and Campylobacter coli isolated from humans and chicken carcasses in Poland

Campylobacter-associated gastroenteritis remains an important cause of morbidity worldwide, and some evidence suggests that poultry is an important source of this foodborne infection in humans. This study was conducted to analyze the prevalence and genetic background of resistance of 149 Campylobacter jejuni and 54 Campylobacter coli strains isolated from broiler chicken carcasses and from stool samples of infected children in Poland from 2003 through 2005. Nearly all isolates were susceptible to macrolides and aminoglycosides. The highest resistance in both human and chicken strains was observed for ciprofloxacin (more than 40%), followed by ampicillin (13 to 21%), and tetracycline (8 to 29%). Resistance to ampicillin and tetracycline rose significantly between 2003 and 2005. Slight differences in resistance between human and chicken isolates indicate that although chicken meat is not the only source of Campylobacter infection in our population, it can be involved in the transmission of drug-resistant Campylobacter strains to humans.