The theory of rough set represents a non-statistical methodology for analyzing ambiguity and imprecise information.It can be characterized by two crisp sets,named the upper and lower approximations that are used to de...The theory of rough set represents a non-statistical methodology for analyzing ambiguity and imprecise information.It can be characterized by two crisp sets,named the upper and lower approximations that are used to determine the boundary region and accurate measure of any subset.This article endeavors to achieve the best approximation and the highest accuracy degree by using the minimal structure approximation space MSAS via ideal J.The novel approach(indicated by JMSAS)modifies the approximation space to diminish the bound-ary region and enhance the measure of accuracy.The suggested method is more accurate than Pawlak’s and EL-Sharkasy techniques.Via illustrated examples,several remarkable results using these notions are obtained and some of their properties are established.Several sorts of near open(resp.closed)sets based on JMSAS are studied.Furthermore,the connections between these assorted kinds of near-open sets in JMSAS are deduced.The advantages and disadvan-tages of the proposed approach compared to previous ones are examined.An algorithm using MATLAB and a framework for decision-making problems are verified.Finally,the chemical application for the classification of amino acids(AAs)is treated to highlight the significance of applying the suggested approximation.展开更多
Let N be a nest of projections on a Hilbert space H and T(N) be the corresponding nest algebra. Let A be a large subalgebra of T(N). It is proved that any maximal n-nilpotent ideal of A is in the form of A∩R F,where...Let N be a nest of projections on a Hilbert space H and T(N) be the corresponding nest algebra. Let A be a large subalgebra of T(N). It is proved that any maximal n-nilpotent ideal of A is in the form of A∩R F,where F is a finite subnest of N and R F is the Jacobson radical of T(F).Using this result can prove that two large subalgebras are isomorphic if and only if the corresponding nests are similar.展开更多
In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which g...In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which generalize the coupled fixed point theorems obtained by Guo Da-jun and Lankshmikantham[21 and the results obtained by Lan in [4], and [6].展开更多
The concept of linear tangle was introduced as an obstruction to mixed searching number. The concept of (maximal) single ideal has been introduced as an obstruction to linear-width. Moreover, it was already known that...The concept of linear tangle was introduced as an obstruction to mixed searching number. The concept of (maximal) single ideal has been introduced as an obstruction to linear-width. Moreover, it was already known that mixed search number is equivalent to linear-width. Hence, by combining those results, we obtain a proof of the equivalence between linear tangle and maximal single ideal. This short report gives an alternative proof of the equivalence.展开更多
This article is concerned with the existence of maximal attractors in Hi （i = 1, 2, 4） for the compressible Navier-Stokes equations for a polytropic viscous heat conductive ideal gas in bounded annular domains Ωn i...This article is concerned with the existence of maximal attractors in Hi （i = 1, 2, 4） for the compressible Navier-Stokes equations for a polytropic viscous heat conductive ideal gas in bounded annular domains Ωn in Rn（n = 2,3）. One of the important features is that the metric spaces H（1）, H（2）, and H（4） we work with are three incomplete metric spaces, as can be seen from the constraints θ 〉 0 and u 〉 0, with θand u being absolute temperature and specific volume respectively. For any constants δ1, δ2……,δ8 verifying some conditions, a sequence of closed subspaces Hδ（4） H（i） （i = 1, 2, 4） is found, and the existence of maximal （universal） attractors in Hδ（i） （i = 1.2.4） is established.展开更多
Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be ...Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.展开更多
Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In ...Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In this work, MALE changes between members of 26 gene families from four representative species (Arabidopsis thaliana, Oryza sativa, Mus mus- culus and Homo sapiens) were investigated. Comparative study of paralogous’ MALE and amino acid substitution rate (dA<0.5) indicated that a close relationship existed between them. The results suggested that MALE could be a sound evolutionary scale for the divergent time for paralogous genes during their early evolution. A reference table between MALE and divergent time for the four species was set up, which would be useful widely, for large-scale genome alignment and comparison. As an example, de- tection of large-scale duplication events of rice genome based on the table was illustrated.展开更多
目的:系统评价舒适化浅镇静策略(eCASH策略)对重症监护室(ICU)机械通气病人谵妄的干预效果。方法:计算机检索万方数据库、中国知网、维普数据库、中国生物医学文献服务系统、Web of Science、PubMed、EMbase、the Cochrane Library数据...目的:系统评价舒适化浅镇静策略(eCASH策略)对重症监护室(ICU)机械通气病人谵妄的干预效果。方法:计算机检索万方数据库、中国知网、维普数据库、中国生物医学文献服务系统、Web of Science、PubMed、EMbase、the Cochrane Library数据库中关于舒适化浅镇静策略对ICU机械通气病人谵妄干预效果的随机对照试验,检索时限为建库至2022年3月31日。由2名研究者严格按照纳入与排除标准独立进行文献筛选、质量评价、资料提取后,应用RevMan 5.4软件进行Meta分析。结果:共纳入22项随机对照试验。Meta分析结果显示,与常规护理相比,舒适化浅镇静策略能降低ICU机械通气病人谵妄发生率[OR=0.42,95%CI(0.34,0.52),P<0.00001],缓解谵妄持续状态[MD=-1.30,95%CI(-1.48,-1.12),P<0.00001],缩短机械通气时间[SMD=-1.23,95%CI(-1.57,-0.89),P<0.00001]和ICU住院时间[SMD=-1.06,95%CI(-1.27,-0.85),P<0.00001],降低住院死亡和放弃治疗率[OR=0.37,95%CI(0.22,0.60),P<0.0001]。结论:现有证据表明,舒适化浅镇静策略能降低ICU机械通气病人谵妄发生率和住院死亡、放弃治疗率,缓解谵妄持续状态,减少机械通气时间和ICU住院治疗时间。展开更多
文摘The theory of rough set represents a non-statistical methodology for analyzing ambiguity and imprecise information.It can be characterized by two crisp sets,named the upper and lower approximations that are used to determine the boundary region and accurate measure of any subset.This article endeavors to achieve the best approximation and the highest accuracy degree by using the minimal structure approximation space MSAS via ideal J.The novel approach(indicated by JMSAS)modifies the approximation space to diminish the bound-ary region and enhance the measure of accuracy.The suggested method is more accurate than Pawlak’s and EL-Sharkasy techniques.Via illustrated examples,several remarkable results using these notions are obtained and some of their properties are established.Several sorts of near open(resp.closed)sets based on JMSAS are studied.Furthermore,the connections between these assorted kinds of near-open sets in JMSAS are deduced.The advantages and disadvan-tages of the proposed approach compared to previous ones are examined.An algorithm using MATLAB and a framework for decision-making problems are verified.Finally,the chemical application for the classification of amino acids(AAs)is treated to highlight the significance of applying the suggested approximation.
文摘Let N be a nest of projections on a Hilbert space H and T(N) be the corresponding nest algebra. Let A be a large subalgebra of T(N). It is proved that any maximal n-nilpotent ideal of A is in the form of A∩R F,where F is a finite subnest of N and R F is the Jacobson radical of T(F).Using this result can prove that two large subalgebras are isomorphic if and only if the corresponding nests are similar.
文摘In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which generalize the coupled fixed point theorems obtained by Guo Da-jun and Lankshmikantham[21 and the results obtained by Lan in [4], and [6].
文摘The concept of linear tangle was introduced as an obstruction to mixed searching number. The concept of (maximal) single ideal has been introduced as an obstruction to linear-width. Moreover, it was already known that mixed search number is equivalent to linear-width. Hence, by combining those results, we obtain a proof of the equivalence between linear tangle and maximal single ideal. This short report gives an alternative proof of the equivalence.
基金supported in part by the NSF of China (10571024,10871040)the grant of Prominent Youth of Henan Province of China (0412000100)
文摘This article is concerned with the existence of maximal attractors in Hi （i = 1, 2, 4） for the compressible Navier-Stokes equations for a polytropic viscous heat conductive ideal gas in bounded annular domains Ωn in Rn（n = 2,3）. One of the important features is that the metric spaces H（1）, H（2）, and H（4） we work with are three incomplete metric spaces, as can be seen from the constraints θ 〉 0 and u 〉 0, with θand u being absolute temperature and specific volume respectively. For any constants δ1, δ2……,δ8 verifying some conditions, a sequence of closed subspaces Hδ（4） H（i） （i = 1, 2, 4） is found, and the existence of maximal （universal） attractors in Hδ（i） （i = 1.2.4） is established.
文摘Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 30270810, 90208022 and 30471067) and IBM Shared University Research (Life Science), China
文摘Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In this work, MALE changes between members of 26 gene families from four representative species (Arabidopsis thaliana, Oryza sativa, Mus mus- culus and Homo sapiens) were investigated. Comparative study of paralogous’ MALE and amino acid substitution rate (dA<0.5) indicated that a close relationship existed between them. The results suggested that MALE could be a sound evolutionary scale for the divergent time for paralogous genes during their early evolution. A reference table between MALE and divergent time for the four species was set up, which would be useful widely, for large-scale genome alignment and comparison. As an example, de- tection of large-scale duplication events of rice genome based on the table was illustrated.
