Subject domain restriction and reference-tracking

This paper addresses a question: How does reference-tracking work with non-referential items? Specifically, it explores switch-reference, which typically tracks subjects, in the endangered Kiowa language (of Oklahoma). In it, I propose that switch-reference does not track reference of subjects at all; instead, it tracks the domain restricting resource situation of the subject. This proposal explains a wide variety of switch-reference facts in Kiowa, and the paper brings to light new data that elucidates our understanding of this reference-tracking phenomenon, and perhaps others like it.

Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation

Job scheduling algorithm is one of the key technologies Hadoop platform. In this paper, waiting for a fair scheduling algorithm based on delay resource situation. The algorithm periodically obtain status through the use of cluster resources to determine the wait timeout, it has dynamic. Experimental results show that the Delay Fair Scheduling Algorithm Based On the Resource Situation than the original algorithm to some extent reduces the job run time and improve the throughput of Hadoop platform.

Subject domain restriction and reference-tracking

This paper addresses a question: How does reference-tracking work with non-referential items? Specifically, it explores switch-reference, which typically tracks subjects, in the endangered Kiowa language (of Oklahoma). In it, I propose that switch-reference does not track reference of subjects at all; instead, it tracks the domain restricting resource situation of the subject. This proposal explains a wide variety of switch-reference facts in Kiowa, and the paper brings to light new data that elucidates our understanding of this reference-tracking phenomenon, and perhaps others like it.