α-Input resolution and α-unit resolution for generalized Horn clause set are discussed in linguistic truth-valued lattice-valued first-order logic (LV(n×2)F(X)), which can represent and handle uncertain linguis...α-Input resolution and α-unit resolution for generalized Horn clause set are discussed in linguistic truth-valued lattice-valued first-order logic (LV(n×2)F(X)), which can represent and handle uncertain linguistic values-based information. Firstly the concepts of α-input resolution and α-unit resolution are presented, and the equivalence of them is shown. Then α-input (α-unit) resolution is equivalently transformed from LV(n×2)F(X) into that of LnP(X), and their soundness and completeness are also established. Finally an algorithm for α-unit resolution is contrived in LnP(X).展开更多
The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in w...The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set （IS） in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.展开更多
The introduction of new treatments for cancer and advances in the intensive care of critically ill cancer patients has improved the prognosis and survival. In recent years, the classical intensive care unit(ICU) admis...The introduction of new treatments for cancer and advances in the intensive care of critically ill cancer patients has improved the prognosis and survival. In recent years, the classical intensive care unit(ICU) admission comorbidity criteria used for this group of patients have been discouraged since the risk factors for death that have been studied, mainly the number and severity of organic failures, allow us to understand the determinants of the prognosis inside the ICU. However, the availability of intensive care resources is dissimilar by country, and these differences are known to alter the indications for admission to critical care setting. Three to five days of ICU management is warranted before making a final decision(ICU trial) to consider keep down intensive management of critically ill cancer patients. Nowadays, taking into account only the diagnosis of cancer to consider ICU admission of patients who need full-supporting management is no longer justified.展开更多
In this paper we study the problem of explicit representation and convergence of Pal type （0;1） interpolation and its converse, with some additional conditions, on the non-uniformly distributed nodes on the unit cir...In this paper we study the problem of explicit representation and convergence of Pal type （0;1） interpolation and its converse, with some additional conditions, on the non-uniformly distributed nodes on the unit circle obtaIned by projecting the interlaced zeros of Pn （x） and Pn′ （x） on the unit circle. The motivation to this problem can be traced to the recent studies on the regularity of Birkhoff interpolation and Pal type interpolations on non-uniformly distributed zeros on the unit circle.展开更多
基金National Natural Science Foundations of China (No. 60875034,No. 61175055)
文摘α-Input resolution and α-unit resolution for generalized Horn clause set are discussed in linguistic truth-valued lattice-valued first-order logic (LV(n×2)F(X)), which can represent and handle uncertain linguistic values-based information. Firstly the concepts of α-input resolution and α-unit resolution are presented, and the equivalence of them is shown. Then α-input (α-unit) resolution is equivalently transformed from LV(n×2)F(X) into that of LnP(X), and their soundness and completeness are also established. Finally an algorithm for α-unit resolution is contrived in LnP(X).
基金supported by the National Natural Science Foundation of China under Grant No 60473090the National "11th Five-Year-Supporting-Plan" of China under Grant No 2006BAH02A0407
文摘The connected dominating set （CDS） problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs （UDGs）. This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set （IS） in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.
文摘The introduction of new treatments for cancer and advances in the intensive care of critically ill cancer patients has improved the prognosis and survival. In recent years, the classical intensive care unit(ICU) admission comorbidity criteria used for this group of patients have been discouraged since the risk factors for death that have been studied, mainly the number and severity of organic failures, allow us to understand the determinants of the prognosis inside the ICU. However, the availability of intensive care resources is dissimilar by country, and these differences are known to alter the indications for admission to critical care setting. Three to five days of ICU management is warranted before making a final decision(ICU trial) to consider keep down intensive management of critically ill cancer patients. Nowadays, taking into account only the diagnosis of cancer to consider ICU admission of patients who need full-supporting management is no longer justified.
文摘In this paper we study the problem of explicit representation and convergence of Pal type （0;1） interpolation and its converse, with some additional conditions, on the non-uniformly distributed nodes on the unit circle obtaIned by projecting the interlaced zeros of Pn （x） and Pn′ （x） on the unit circle. The motivation to this problem can be traced to the recent studies on the regularity of Birkhoff interpolation and Pal type interpolations on non-uniformly distributed zeros on the unit circle.
