7 A homogeneous set of a graph G is a set X of vertices such that 2 ≤ |X| < |V (G)| 8 and no vertex in V (G) − X has both a neighbor and a non-neighbor in X. A graph 9 is prime if it has no homogeneous set. We present an algorithm to decide whether a 10 class of graphs given by a finite set of forbidden induced subgraphs contains infinitely 11 many non-isomorphic prime graphs. 12

In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M .

A semigroup is amiable if there is exactly one idempotent in each R⇤-class and in each L⇤-class. A semigroup is adequate if it is amiable and if its idempotents commute. We characterize adequate semigroups by showing that they are precisely those amiable semigroups which do not contain isomorphic copies of two particular nonadequate semigroups as subsemigroups.

Keyword extraction of scientific articles is beneficial for retrieving scientific articles of a certain topic and grasping the trend of academic development. For the task of keyword extraction for Chinese scientific articles, we adopt the framework of selecting keyword candidates by Document Frequency Accessor Variety(DF-AV) and running TextRank algorithm on a phrase network. To improve domain ...

Dynamic control of chaotic dark dissipative envelope solitons in a microwave active ring resona tor containing two nonlinear elements: one-dimensional magnonic crystal (MC) with dynamic linear defect and transistor amplifier is performed. Dissipative are formed on long-wavelength surface magnetostatic wave propagating the MC parametrically decaying into short-wavelength spin waves. A constant e...

As the number of systems which offer annotations on digital documents increases, robust anchoring of annotations is a key challenge. It is especially important if the annotator lacks write-access to the document being annotated. For example, if someone makes an annotation on a web page today and the web page changes tomorrow, what happens to the annotation? One approach is simply to “orphan” th...

Text mining techniques are generally applied for classifying the text, finding fuzzy relations and structures in data sets. This research provides plenty text mining capabilities. One common application is text classification and event extraction, which encompass deducing specific knowledge concerning incidents referred to in texts. The main contribution of this paper is the clarification of a ...

The goal of our research is to improve event extraction by learning to identify secondary role filler contexts in the absence of event keywords. We propose a multilayered event extraction architecture that progressively “zooms in” on relevant information. Our extraction model includes a document genre classifier to recognize event narratives, two types of sentence classifiers, and noun phrase c...