Information on false paths in a circuit is useful for design and test. Since identification of the false paths at gate level is hard, several methods using high-level design information have been proposed. These methods are effective only if the correspondence between paths at register transfer level (RTL) and at gate level can be established. Until now, the correspondence has been established ...

Thematic structure, an important factor for textual metafunction, plays a significant role in inspecting and promoting the textual coherence. With a theoretical statement of Thematic theory and TP patterns, this paper proposes the feasibility of the Thematic Operational Approach in the teaching of college English writing. This approach is proved to not only strengthen students’ application awar...

As a grammatical device, Theme-Rheme structure plays an important role in organizing and analyzing discourse. Theme Progression patterns (hereinafter called TP patterns) are significant method of the analysis of textual cohesion and organization. Based on linguist Danes’ theory about TP patterns, this paper tries to present a contrastive analysis of the texts of consecutive interpretation in En...

We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus...

A key feature of Simonovits’ proof of the classic Erdős-Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to A-paths. With it we deduce a simple proof of Gallai’s theorem, although with a worse bound, and we verify the Erdős-Pósa property for long and for even A-paths. We also show that even A-paths do not ...

In highly reliable communication network design, disjoint paths between pairs of nodes are often needed in the design phase. The problem of finding k paths which are as diverse as possible and have the lowest total cost is called a k-best paths problem. We propose an algorithm for finding the k-best paths connecting a pair of nodes in a graph G. Graph extension is used to transfer the k-best pa...

The ability to apply existing knowledge in new situations and settings is clearly a vital skill that all students need to develop. Nowhere is this truer than in the rapidly developing world of Web-based learning, which is characterized by non-sequential courses and the absence of an effective cross-subject guidance system. As a result, questions have arisen about how to best explore and stimula...