|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Efficacy and safety of Shaoyang Xibi decoction in patients with knee osteoarthritis:a multi-center,single-blind,randomized controlled trial显示文摘PURPOSE: To observe the efficacy and safety of Shaoyang Xibi decoction(SYXBD) in patients with knee osteoarthritis(KOA), and to verify that the theory of 'Shaoyang dominating bone' in Traditional Chinese Medicine(TCM) can be applied to KOA treatment.METHODS: Participants were randomly allocated to two groups: SYXBD(treatment group, n = 66)and Meloxicam(control group, n = 66). Western Ontario and McMaster Universities Osteoarthritis Index(WOMAC) and 36-Item Short Form Health Survey(SF-36) were used to assess efficacy before the treatment and 8 weeks after the treatment.RESULTS: Baseline data before the treatment between the two groups were similar. The WOMAC scores significantly decreased and the SF-36 scores significantly increased after 8-week treatment in both groups compared with before the treatment(P < 0.05). SYXBD significantly decreased pain scores(P < 0.001), physical function scores(P <0.001) and the total scores(P < 0.001) in WOMAC compared to Meloxicam. SYXBD significantly improved physical function(P = 0.021), bodily pain(P = 0.002) and general health(P = 0.014), with no significant difference in role emotional(P = 0.053),role physical(P = 0.517), vitality(P = 0.241), social function(P = 0.712) and mental health(P = 0.800)in SF-36 compared to Meloxicam. No adverse events were reported in the treatment group while13 adverse events happened in the control group during the study.CONCLUSION: SYXBD, prepared based on the theory of 'Shaoyang dominating bone', has a better curative efficay and safety in patients with KOA compared with Meloxicam. The TCM theory of 'Shaoyang dominating bone' may be useful in KOA treatment. | Si Yuhao Ma Yong Guo Yang Pan Yalan Zheng Suyang Xu Guihua Da Weiwei Xu Lili | 2018 | Journal of Traditional Chinese Medicine2018，38，5： | 11 |
| 2 | ON DOMINATING SEQUENCE METHOD IN THE POINT ESTIMATE AND SMALE THEOREM显示文摘It can be optimized for the work of the point estimate on the Newton iteration, reported by Smale at the 20th Congress of Mathematicians in 1986. It has been proved that iffα(z,f) , for every analytic map f:E→F, z ∈ is an approximate zero of f,whereE and F are real or complex Banach spaces. In addition, if α,(z,f) , z is anapproximate zero of the second kind of f. | 王兴华 韩丹夫 | 1990 | Science China Mathematics1990，33，2： | 7 |
| 3 | FORCES ON CYLINDERS IN COEXISTING FIELD OF REGULAR WAVES AND CURRENTS显示文摘Based on the linear wave theory, the lift force on the cylinder under the action of both regular waves and currents related to inline force and the resultant force has been investigated. The relationship between the hydrodynamic coefficients of resultant force Cf, of drag force Cd, of inertia force Cm and of lift force CL and the redefined KC number is reported. It is indicated that in a certain region of KC number, the influence of lift force on the resultant force can not be ignored. | Li Yucheng and Zhang Chunrong Professor,Dalian University of Technilogy, Dalian Master, Dalian University of Technology, Dalian | 1990 | China Ocean Engineering1990，5，1： | 3 |
| 4 | LONG DOMINATING CYCLES IN GRAPHS显示文摘Let G be a connected graph of order n, and NC2(G) denote min{|N(u)U(v) |:dist(u,v) = 2}, where dist(u,v) is the distance between u and v in G. A cycle C in Gis called a dominatiny cycle, if V(G)\V(C) is an independent set in G. In this paper, weprove that if G contains a domillating cycle and 2, then G contains a dominating cycleof length at least min{n, 2NC2(G) - 2}, which proves partially a conjecture of R. Shenand F. Tian. And we give a class of graphs that show the result is shrpg. | SUN Zhiren(Department Of Mathematics, Nanjing Normal University, Nanjing 210097,Institute of Systems Science, Academia Silica, Beijing 100080, China) | 1998 | Systems Science and Mathematical Sciences1998，11，4： | 1 |
| 5 | Diversity of Pareto front: A multiobjective genetic algorithm based on dominating information显示文摘In this paper, the diversity information included by dominating number is analyzed, and the probabilistic relationship between dominating number and diversity in the space of objective function is proved. A ranking method based on dominating number is proposed to build the Pareto front. Without increasing basic Pareto method’s computation complexity and introducing new parameters, a new multiobjective genetic algorithm based on proposed ranking method (MOGA-DN) is presented. Simulation results on function optimization and parameters optimization of control system verify the efficiency of MOGA-DN. | Wei CHEN 1 , Jingyu YAN 2 , Mei CHEN 1 , Xin LI 1 (1.Department of Automation, Hefei University of Technology, Hefei Anhui 230009, China 2.Department of Mechanical and Automation Engineering, the Chinese University of Hong Kong, Hong Kong, China) | 2010 | 控制理论与应用(英文版)2010，8，2： | 1 |
| 6 | Minimum Dominating Tree Problem for Graphs显示文摘A dominating tree T of a graph G is a subtree of G which contains at least one neighbor of each vertex of G.The minimum dominating tree problem is to find a dominating tree of G with minimum number of vertices,which is an NP-hard problem.This paper studies some polynomially solvable cases,including interval graphs,Halin graphs,special outer-planar graphs and others. | LIN Hao LIN Lan | 2014 | Chinese Quarterly Journal of Mathematics2014，29，1： | 1 |
| 7 | States on sharply dominating effect algebras显示文摘We prove that sharply dominating Archimedean atomic lattice effect algebras can be characterized by the property called basic decomposition of elements.As an application we prove the state smearing theorem for these effect algebras. | Zdenka RIE■ANOV | 2008 | Science China Mathematics2008，51，5： | 1 |
| 8 | ASYMPTOTIC BEHAVIOR OF THE SOLUTION FOR THE NEUTRON TRANSPORT EQUATION IN A SLAB WITH GENERALIZED REFLECTING BOUNDARY CONDITIONS显示文摘This paper discusses the neutron transport equation in a slab with generalized reflectingboundary conditions.By means of the positive C0-semigroup theory,we have proved that this problemhas a unique nonnegative solution and found the spectral property of the corresponding transportoperator.Finally we give the asymptotic behavior of the solution for this equation. | 徐建国 王绵森 朱广田 | 1989 | Systems Science and Mathematical Sciences1989，2，1： | 1 |
| 9 | What China Can Teach Facebook显示文摘Facebook has a proven track record of dominating new markets, and it may still prove able to conquer China’s crowded | Paul Mozur | 2012 | China's Foreign Trade2012，，7： | 0 |
| 10 | Unpacking Misconceptions显示文摘China has always looked to cooperating with rather than dominating other countries The Second Belt and Road Forum for International Cooperation held in Beijing on April 25-27 was a milestone for the Belt and Road Initiative along with international development and global governance.However,it is undeniable that there are still a few misperceptions and misunderstandings about the initiative or other key topics related to China that are in urgent need of clarifi cation.For example,whether China is utilizing the Belt and Road Initiative to pursue its“sharp power”is one of the most heated topics. | Wang Peng | 2019 | Beijing Review2019，62，18： | 0 |
| 11 | 子图的度与 Dominating 圈显示文摘笔者利用子图的度给出了如下结果:对2-连通无爪图 G,若任意同构于 K2的不相邻子图 H1,H2,H3满足:d(H1)+d(H2)+d(H3)≥|G|-1,则 G 的任意最长圈是 Dominating 圈。 | 孙运伟 王江鲁 | 2014 | 山东师范大学学报(自然科学版)2014，29，1： | 0 |
| 12 | Spatial-Temporal Event Detection Method with Multivariate Water Quality Data显示文摘With the rapid development of the society,water contamination events cause great loss if the accidents happen in the water supply system.A large number of sensor nodes of water quality are deployed in the water supply network to detect and warn the contamination events to prevent pollution from speading.If all of sensor nodes detect and transmit the water quality data when the contamination occurs,it results in the heavy communication overhead.To reduce the communication overhead,the Connected Dominated Set construction algorithm-Rule K,is adopted to select a part fo sensor nodes.Moreover,in order to improve the detection accuracy,a Spatial-Temporal Abnormal Event Detection Algorithm with Multivariate water quality data(M-STAEDA)was proposed.In M-STAEDA,first,Back Propagation neural network models are adopted to analyze the multiple water quality parameters and calculate the possible outliers.Then,M-STAEDA algorithm determines the potential contamination events through Bayesian sequential analysis to estimate the probability of a contamination event.Third,it can make decision based on the multiple event probabilities fusion.Finally,a spatial correlation model is applied to determine the spatial-temporal contamination event in the water supply networks.The experimental results indicate that the proposed M-STAEDA algorithm can obtain more accuracy with BP neural network model and improve the rate of detection and the false alarm rate,compared with the temporal event detection of Single Variate Temporal Abnormal Event Detection Algorithm(M-STAEDA). | Yingchi Mao Zhitao Li Xiaoli Chen Longbao Wang | 2017 | 国际计算机前沿大会会议论文集2017，，1： | 0 |
| 13 | HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS显示文摘HAMILTONICITYIN2-CONNECTED{K_(1,3)F}-FREEGRAPHS￥LIGuojun(MathematicsDepertmentofYantaiTeacher'sCollege,Yantai264000,China)LIU?.. | LI Guojun(Mathematics Depertment of Yantai Teacher’s College, Yantai 264000, China)LIU Zhenhong(Institute of Systems Science, Academic Sinica, Beijing 100080, China) | 1996 | Systems Science and Mathematical Sciences1996，9，4： | 0 |
| 14 | ON THE RELATIONS OF GRAPH PARAMETERS显示文摘Let σ(G), σ1(G), αT(G), βT(G) and G denote the dominating number, edge-dominating number, total covering number, total independence number and complementary graph of the graph G(V, E), respectively. | 张建勋 张忠辅 马续援 | 1991 | Chinese Science Bulletin1991，36，5： | 0 |
| 15 | An Application of Dominating Families显示文摘<正> In this paper,we prove that x(Seqε)=d, when εis Frechet filter or P-point in ω~*with X(ε,ω~*)≤d. | 朱建平 | 1993 | Acta Mathematica Sinica,English Series1993，9，1： | 0 |
| 16 | ON THE LATTICE PATH METHOD IN CONVOLUTION-TYPE COMBINATORIAL IDENTITIES(Ⅱ)—THE WEIGHTED COUNTING FUNCTION METHOD ON LATTICE PATHS显示文摘An independent method for paper[10]is presented.Weighted lattice paths areemumerated by counting function which is a natural extension of Gaussian multinomialcoefficient in the case of unrestricted paths.Convolutions for path counts are investigated.which yields some Vandermonde-type identities for multinomial and q-multinomialcoefficients. | 初文吕 | 1989 | Applied Mathematics and Mechanics(English Edition)1989，10，12： | 0 |
| 17 | Robustness-supported user association and small cell switching ON/OFF strategies in 5G mm-wave networks显示文摘The problem of robustness-supported user association and small cell station(SCS) switching ON/OFF strategies in 5G millimeter wave(mm-wave) networks is investigated, where the robustness of access links is ensured and the number of active SCSs is minimized for the reduction of the aggregation power consumption. Firstly, the problem is formulated as an integer programming(IP) problem. Then the problem is proved as a NP-hard problem by means of the simplification into the minimum dominant set(MDS), which is a NP-hard problem and is intractable to be solved in polynomial time. Secondly, a greedy-idea-based heuristic algorithm(GIHA) is proposed under the consideration of the complexity of the original optimization problem. Finally, superiorities of GIHA are demonstrated with the extensive simulations in 60 GHz mm-wave ultra-dense network in terms of access robustness and aggregate power consumption. | 马忠彧 Li Bo Yan Zhongjiang Yang Mao | 2020 | High Technology Letters2020，26，1： | 0 |
| 18 | 有效的子空间支配查询算法——Ranking-k显示文摘针对Top-k dominating查询算法需要较高的时空消耗来构建属性组合索引,并且在相同属性值较多情况下的查询结果准确率低等问题,提出一种通过B+-trees和概率分布模型相结合的子空间支配查询算法——Ranking-k算法。首先,采用B+-trees为待查找数据各属性构建有序列表;然后,采取轮询调度算法读取skyline准则涉及到的有序列表,生成候选元组并获得k组终结元组;其次,根据生成的候选元组和终结元组,采用概率分布模型计算终结元组支配分数。迭代上述过程优化查询结果,直到满足条件为止。实验结果表明:Ranking-k与基本扫描算法(BSA)相比,查询效率提高了94.43%;与差分算法(DA)相比,查询效率提高了7.63%;与早剪枝Top-k支配(TDEP)算法、BSA和DA相比,查询结果更接近理论值。 | 李秋生 吴亚东 林茂松 王松 王海洋 冯鑫淼 | 2015 | 计算机应用2015，35，1： | 0 |
| 19 | SOME RESULTS ON UNIVERSAL MINIMAL TOTAL DOMINATING FUNCTION显示文摘In this paper, we introduce the concepts of redundant constraint and exceptional vertex which play an important role in the characterization of universal minimal total dominating functions (universal MTDFs), and establish some further results on universal MTDFs in general graphs. By extending these results to trees, we get a necessary and sufficient condition for universal MTDFs and show that there is a good algorithm for deciding whether a given tree has a universal MTDF. | 方奇志 蔡茂诚 | 2001 | Acta Mathematicae Applicatae Sinica2001，17，2： | 0 |
| 20 | A two-level meta-heuristic approach for the minimum dominating tree problem显示文摘1 Introduction The minimum dominating tree(MDT)problem was first proposed by Zhang et al.[1]to produce a routing backbone of a WSN.Shin et al.[2]proved that the MDT problem is NP-hard and introduced an approximation framework for solving it.Recent important MDT problem algorithms are the artificial bee colony(ABC_DT)algorithm and ant colony optimization(ACO_DT)algorithm proposed by Sundar and Singh[3],the evolutionary algorithm with guided mutation(EA/G-MP)proposed by Chaurasia and Singh[4],the variable neighborhood search algorithm proposed by Dražićet al.[5],one improved artificial bee colony(ABC_DTP)algorithm proposed by Singh and Sundar[6],and a hybrid algorithm combining genetic algorithm proposed by Hu et al.[7].In this paper,we develop a two-level meta-heuristic(TLMH)for solving the MDT problem,aiming to find a dominating tree with the minimum weight for a given graph. | Caiquan XIONG Hang LIU Xinyun WU Na DENG | 2023 | Frontiers of Computer Science2023，17，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员