为提高选煤厂生产的自动化程度,加强对选煤过程的控制,促进选煤厂安全高效生产,保证产品指标的合格稳定。根据斜沟煤矿选煤厂原煤处理量大、介质系统多、设备台数多,不同原煤性质差异大的特点,引进了选煤厂集控操作系统。从集控系统的...为提高选煤厂生产的自动化程度,加强对选煤过程的控制,促进选煤厂安全高效生产,保证产品指标的合格稳定。根据斜沟煤矿选煤厂原煤处理量大、介质系统多、设备台数多,不同原煤性质差异大的特点,引进了选煤厂集控操作系统。从集控系统的配置与设置、集控功能的实现和集控在生产过程中的调节3方面进行了论述。2014年上半年销售精煤合格率100%,混煤合格率100%,介耗1.41 kg/t、电耗6.51 k Wh/t。指标证明了该操作法完全适应本厂工艺、煤质特点。展开更多
The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an inter...The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.展开更多
文摘为提高选煤厂生产的自动化程度,加强对选煤过程的控制,促进选煤厂安全高效生产,保证产品指标的合格稳定。根据斜沟煤矿选煤厂原煤处理量大、介质系统多、设备台数多,不同原煤性质差异大的特点,引进了选煤厂集控操作系统。从集控系统的配置与设置、集控功能的实现和集控在生产过程中的调节3方面进行了论述。2014年上半年销售精煤合格率100%,混煤合格率100%,介耗1.41 kg/t、电耗6.51 k Wh/t。指标证明了该操作法完全适应本厂工艺、煤质特点。
基金Supported by the Natural Science Foundation of Henan Province（082300460190） Sponsored by Program for Science and Technology Innovation Talents in Universities of Henan Province.
文摘The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.
