首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1785篇
  免费   43篇
  国内免费   68篇
化学   96篇
晶体学   4篇
力学   51篇
综合类   4篇
数学   1416篇
物理学   325篇
  2024年   1篇
  2023年   21篇
  2022年   22篇
  2021年   22篇
  2020年   30篇
  2019年   28篇
  2018年   30篇
  2017年   35篇
  2016年   41篇
  2015年   29篇
  2014年   101篇
  2013年   149篇
  2012年   98篇
  2011年   85篇
  2010年   77篇
  2009年   146篇
  2008年   140篇
  2007年   119篇
  2006年   123篇
  2005年   72篇
  2004年   75篇
  2003年   48篇
  2002年   28篇
  2001年   41篇
  2000年   47篇
  1999年   41篇
  1998年   53篇
  1997年   35篇
  1996年   33篇
  1995年   18篇
  1994年   17篇
  1993年   15篇
  1992年   10篇
  1991年   5篇
  1990年   9篇
  1989年   5篇
  1988年   3篇
  1987年   3篇
  1986年   6篇
  1985年   5篇
  1984年   8篇
  1983年   4篇
  1982年   5篇
  1981年   1篇
  1980年   5篇
  1979年   1篇
  1978年   1篇
  1977年   3篇
  1976年   1篇
  1974年   1篇
排序方式: 共有1896条查询结果,搜索用时 203 毫秒
51.
Nanocomposites comprising flexible polymers and high dielectric constant inorganic nanoparticles are considered to be one of the promising candidates for electrostatic capacitor dielectrics.However,the effect of interfacial property on electrical ene rgy storage of dielectric polymer nanocomposites is still not clear.Herein,the role of the polarity of the interfacial region is investigated.For this purpose,three polymers with different polarity,polymethyl methacrylate(PMMA),polyglycidyl methacrylate,and polymethylsulfonyl ethyl methacrylate(PMSEMA) are attached onto BaTi03(BT) na noparticle surface via surface-initiated reversible addition-fragmentation chain transfer polymerization.It is found that the polarity of shell polymers shows an apparent effect on the dielectric and energy storage of dielectric polymer nanocomposites.For example,PMSEMA@BT(shell polymer possesses the highest polarity)increases dielectric loss and decreases the breakdown strength of the nanocomposites,leading to lower ene rgy storage capability.However,PMMA@BT(shell polymer possesses the lowest polarity) can induce higher breakdown strength of the nanocomposites.As a result,the PMMA@BT nanocomposite exhibits the highest electrical energy sto rage capability among the three nanocomposites.This re search provides new insight into the design of core-shell nanofillers for dielectric energy storage applications.  相似文献   
52.
The characterization of dielectric materials in space environment requires to understand and predict their electric behaviour, taking into account ionisation, and ageing effect (through electron or UV radiation, thermal cycling, …)For this purpose, new methods have been developed for the characterisation and qualification of space materials and satellite structure. These studies led initially to the development of dedicated facilities for the simulation of representative irradiation conditions. This work is focused on a new non-disturbing technique for the measurement of charge distribution within space irradiated polymers. This technique named PEA (Pulsed Electro-Acoustic) has been implemented in the irradiation facility for in-situ and real time measurement during irradiation and relaxation of polymer materials. Implementation and validation of this technique are presented and discussed in this paper.  相似文献   
53.
《Physics letters. A》2020,384(3):126082
In this paper, we derive a set of projectors on a large Hilbert space which can universally work for approximating quantum assemblages with binary inputs and outputs. The dimension of the Hilbert space depends on the accuracy of the approximation.  相似文献   
54.
高效透明导电膜荧光屏的研究   总被引:8,自引:8,他引:0  
介绍了一种新型荧光屏结构,采用透明导电膜代替传统荧光屏中的铝膜作电极.分别测试了新型荧光屏和传统荧光屏的加电特性.实验结果表明新型荧光屏具有较高的耐压性能,对提高X射线变像管的空间分辨率有重要作用,而且能延长变像管的寿命.采用透明导电膜制作荧光屏还具有工艺简单,成本低和成品率高的优点.  相似文献   
55.
研究了三阶非线性发展方程的初边值问题的解。采用基于Sinc函数的微分求积法发展了线性化有理逼近方法。通常的配点法不适用于上述三阶问题的求解。本文把提出的方法用于求解KdV方程,取得了良好的效果。  相似文献   
56.
在决策信息系统中引入拓扑结构,借助拓扑学的基本概念(拓扑、内部和闭包等)研究决策问题,用它们刻画决策信息系统中的一些重要概念(决策协调集、决策约简集、下近似协调集、下近似约简集、上近似协调集、上近似约简集),并利用它们把这些重要概念推广到最一般的情况,建立起相应的约简理论.  相似文献   
57.
We consider a special case of the directed subgraph homeomorphism or topological minor problem, where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this application domain, the task is to simultaneously schedule, bind and route a so-called data-flow graph, where vertices represent operations and arcs stand for data dependencies between the operations, given an orthogonal grid structure of reconfigurable processing elements (PEs) that have restricted communication abilities. We show that the problem of simultaneously scheduling, binding and routing is NP-complete by describing a logic engine reduction from NAE-3-SAT. This result holds even when the input graph is a directed tree with maximum indegree two. We also give a |V|3/2-approximation algorithm. J. A. Brenner’s research supported by the DFG Research Center Matheon “Mathematics for key technologies”. J. C. van der Veen’s research supported by DFG Focus Program 1148, “Reconfigurable Architectures”, Grants FE 407/8-1 and FE 407/8-2.  相似文献   
58.
A mathematical study via variational convergence of a periodic distribution of classical linearly elastic thin plates softly abutted together shows that it is not necessary to use a different continuum model nor to make constitutive symmetry hypothesis as starting points to deduce the Reissner–Mindlin plate model.  相似文献   
59.
60.
We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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