It is known by the Conley’s theorem that the chain recurrent set CR(φ) of a deterministic flow φ on a compact metric space is the complement of the union of sets B(A) − A, where A varies over the collection of attractors and B(A) is the basin of attraction of A. It has recently been shown that a similar decomposition result holds for random dynamical systems on noncompact separable complete met...

Traffic congestion brings not only delay and inconvenience, but other associated national concerns, such as greenhouse gases, air pollutants, road safety issues and risks. Identification, measurement, tracking, and control of urban recurrent congestion are vital for building a livable and smart community. A considerable amount of works has made contributions to tackle the problem. Several metho...

This paper presents our metric (UoWLSTM) submitted in the WMT-15 metrics task. Many state-of-the-art Machine Translation (MT) evaluation metrics are complex, involve extensive external resources (e.g. for paraphrasing) and require tuning to achieve the best results. We use a metric based on dense vector spaces and Long Short Term Memory (LSTM) networks, which are types of Recurrent Neural Netwo...

The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving ris...

The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving ris...