首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   416篇
  免费   41篇
  国内免费   30篇
化学   63篇
晶体学   1篇
力学   22篇
综合类   17篇
数学   302篇
物理学   82篇
  2023年   5篇
  2022年   5篇
  2021年   11篇
  2020年   9篇
  2019年   16篇
  2018年   9篇
  2017年   14篇
  2016年   29篇
  2015年   17篇
  2014年   30篇
  2013年   34篇
  2012年   21篇
  2011年   24篇
  2010年   22篇
  2009年   23篇
  2008年   30篇
  2007年   29篇
  2006年   23篇
  2005年   17篇
  2004年   14篇
  2003年   14篇
  2002年   11篇
  2001年   9篇
  2000年   8篇
  1999年   8篇
  1998年   6篇
  1997年   13篇
  1996年   4篇
  1995年   4篇
  1994年   4篇
  1993年   6篇
  1992年   2篇
  1991年   4篇
  1990年   1篇
  1989年   3篇
  1988年   1篇
  1987年   2篇
  1986年   1篇
  1985年   1篇
  1981年   1篇
  1979年   1篇
  1977年   1篇
排序方式: 共有487条查询结果,搜索用时 15 毫秒
471.
For acyclic systems the center of a graph has been known to be either a single vertex of two adjacent vertices, that is, an edge. It has not been quite clear how to extend the concept of graph center to polycyclic systems. Several approaches to the graph center of molecular graphs of polycyclic graphs have been proposed in the literature. In most cases alternative approaches, however, while being apparently equally plausible, gave the same results for many molecules, but occasionally they differ in their characterization of molecular center. In order to reduce the number of vertices that would qualify as forming the center of the graph, a hierarchy of rules have been considered in the search for graph centers. We reconsidered the problem of “the center of a graph” by using a novel concept of graph theory, the vertex “weights,” defined by counting the number of pairs of vertices at the same distance from the vertex considered. This approach gives often the same results for graph centers of acyclic graphs as the standard definition of graph center based on vertex eccentricities. However, in some cases when two nonequivalent vertices have been found as graph center, the novel approach can discriminate between the two. The same approach applies to cyclic graphs without additional rules to locate the vertex or vertices forming the center of polycyclic graphs, vertices referred to as central vertices of a graph. In addition, the novel vertex “weights,” in the case of acyclic, cyclic, and polycyclic graphs can be interpreted as vertex centralities, a measure for how close or distant vertices are from the center or central vertices of the graph. Besides illustrating the centralities of a number of smaller polycyclic graphs, we also report on several acyclic graphs showing the same centrality values of their vertices. © 2013 Wiley Periodicals, Inc.  相似文献   
472.
In [Aghajani A, Abbas M, Roshan JR. Common fixed point of generalized weak contractive mappings in partially ordered Gb-metric spaces. Filomat, 2013, in press], using the concepts of G-metric and b-metric Aghajani et al. defined a new type of metric which is called generalized b-metric or Gb-metric. In this paper, we prove a common fixed point theorem for three mappings in Gb-metric space which is not continuous. An example is presented to verify the effectiveness and applicability of our main result.  相似文献   
473.
Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a self-mapping on a partial metric space that characterizes the partial metric 0-completeness. In this article, we introduce the notion of partial G-metric spaces and prove a result of Suzuki type in the setting of partial G-metric spaces. We deduce also a result of common fixed point.  相似文献   
474.
In [Aghajani A, Abbas M, Roshan JR. Common fixed point of generalized weak contractive mappings in partially ordered Gb-metric spaces. Filomat, 2013, in press], using the concepts of G-metric and b-metric Aghajani et al. defined a new type of metric which is called generalized b-metric or Gb-metric. In this paper, we prove a common fixed point theorem for three mappings in Gb-metric space which is not continuous. An example is presented to verify the effectiveness and applicability of our main result.  相似文献   
475.
研究带退化工件的单机排序问题,即工件的加工时间是其开始加工时间的线性递增函数,且不同的工件具有不同的退化率.要求为所有工件寻找一共同的最优交货期和最优序,以极小化这些工件的共同交货期、超前罚和迟后罚之和.给出了一O(nlogn)时间的最优算法.  相似文献   
476.
基于故障树的多光纤陀螺冗余系统可靠性分析   总被引:1,自引:0,他引:1  
多光纤陀螺冗余系统的可靠性分析是惯性测量系统健康状态管理中的一个关键问题.针对传统可靠性分析方法没有考虑共因失效以及在考虑共因失效后难以得到可靠度解析解的问题,提出通过一种多 Beta 因子模型描述多光纤陀螺冗余系统中的共因失效现象,并采用故障树分析方法定量评估常用多光纤陀螺冗余系统的可靠性.算例分析表明,不考虑共因失效或采用简化的共因失效模型会得到相对乐观的可靠性分析结果,从而增加系统失效的风险,因此需要采用多 Beta 因子模型.采用多 Beta因子模型后,通过故障树定量分析方法得到了典型系统可靠度的解析解,结果令人满意.  相似文献   
477.
针对红外搜索跟踪系统对目标的探测,为提高光学系统在复杂背景下的探测能力,设计了双色红外共口径光学系统。系统工作波段为红外中波3 m~5 m和红外长波8 m~12 m,采用分光型RC系统实现双波段共孔径清晰成像,总焦距为400 mm,相对孔径D/f=1/2,全视场角为2,为了抑制中波的热辐射杂光,对中波系统实现了二次成像,通过红外材料与光焦度的合理分配实现了折反式被动消热差设计。设计结果表明,系统在-40℃~+60℃工作温度下像质优良,能够满足红外搜索跟踪系统的使用需求。  相似文献   
478.
对双波段红外扫描成像光学系统进行了研究,结合三次成像技术和100%冷光栏效率技术,设计了一个共口径双通道红外扫描成像光学系统。该系统包括前端共用的双反射系统、分束镜、准直镜组、扫描镜和成像镜组。光波经过双反射系统在主镜之后被分束镜分成中波红外通道(3 m~5 m)和长波红外通道(10 m~12 m),经准直镜组及成像镜组会聚探测器上,实现中波红外系统与长波红外系统共口径同步成像。设计结果表明,长波红外系统传递函数在18 lp/mm处达到0.4以上,中波红外系统传递函数在18 lp/mm处达到0.78以上,满足实际应用的要求。  相似文献   
479.
In this paper,we study the dynamic evolution of friendship network in SNS (Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community,but also on the friendship network generated by those friends.In addition,we propose a model which is based on two processes:first,connecting nearest neighbors;second,strength driven attachment mechanism.The model reflects two facts:first,in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor;second,new nodes connect more likely to nodes which have larger weights and interactions,a phenomenon called strength driven attachment (also called weight driven attachment).From the simulation results,we find that degree distribution P(k),strength distribution P(s),and degree-strength correlation are all consistent with empirical data.  相似文献   
480.
张吟  陈崇宏  林玲  陈一农 《色谱》2009,27(6):787-793
建立了利用蛋白沉淀提取血浆中61种常见的中枢神经系统药物并用高效液相色谱-二极管阵列检测器(HPLC-DAD)分析的方法。1 mL血浆样品中加入1.5 mL乙腈,旋涡混合后,离心,上清液过滤后直接采用HPLC测定。选用Agilent TC-C18色谱柱(250 mm×4.6 mm,5 μm),以磷酸盐缓冲液和乙腈为流动相进行梯度洗脱,流速1.5 mL/min,柱温35 ℃,检测波长210 nm。61种药物的回收率均大于80%,相对标准偏差为0.94%-11.23%。采用乙腈沉淀蛋白,方法简便、快速、回收率高且稳定,能够作为系统毒物分析的通用前处理方法。该蛋白沉淀方法与HPLC-DAD技术结合,可应用于61种药物的分析。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号