首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19928篇
  免费   1674篇
  国内免费   851篇
电工技术   878篇
技术理论   1篇
综合类   885篇
化学工业   3583篇
金属工艺   1052篇
机械仪表   944篇
建筑科学   1179篇
矿业工程   298篇
能源动力   613篇
轻工业   2019篇
水利工程   354篇
石油天然气   560篇
武器工业   106篇
无线电   1990篇
一般工业技术   2814篇
冶金工业   1970篇
原子能技术   208篇
自动化技术   2999篇
  2024年   110篇
  2023年   355篇
  2022年   936篇
  2021年   1175篇
  2020年   737篇
  2019年   585篇
  2018年   646篇
  2017年   746篇
  2016年   699篇
  2015年   840篇
  2014年   1060篇
  2013年   1257篇
  2012年   1347篇
  2011年   1478篇
  2010年   1193篇
  2009年   1152篇
  2008年   1049篇
  2007年   941篇
  2006年   865篇
  2005年   688篇
  2004年   499篇
  2003年   412篇
  2002年   383篇
  2001年   345篇
  2000年   272篇
  1999年   277篇
  1998年   544篇
  1997年   407篇
  1996年   290篇
  1995年   180篇
  1994年   155篇
  1993年   138篇
  1992年   66篇
  1991年   44篇
  1990年   56篇
  1989年   48篇
  1988年   33篇
  1987年   36篇
  1986年   30篇
  1985年   42篇
  1984年   34篇
  1983年   36篇
  1982年   26篇
  1981年   49篇
  1980年   35篇
  1979年   21篇
  1978年   16篇
  1977年   35篇
  1976年   35篇
  1975年   13篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
On the basis of the available thermodynamic parameters, the atomic mobilities of Nb and Zr in bcc Nb–Zr alloys are critically assessed as functions of temperatures and compositions by the CALPHAD method, where self-diffusion coefficients, impurity diffusion coefficients, tracer diffusion coefficients, interdiffusion coefficients and concentration curves are simultaneously optimized. Comparisons between the calculated and experimentally measured diffusion coefficients are made, where good agreement is evident. In addition, the obtained mobility parameters can reproduce a reasonable concentration profile for the Nb/Zr diffusion couple annealed at 1868 K for 5400 s.  相似文献   
32.
本文介绍了基于ARM处理器的PC/104总线嵌入式计算机的构成,对ARM实现PC/104总线嵌入式计算机技术进行了研究。最后,描述了用ARM处理器替代X86在工业控制领域应用的方法和具体设计。  相似文献   
33.
王立声  高云  咸迪 《计算机仿真》2009,26(9):194-198
气象卫星数据在采集或者传输的过程中,往往会引入不同程度的脉冲噪声。为提高图像质量,滤除噪音,进行可信度分析,提出了一种三阶段气象卫星数据脉冲噪声检测和滤除方法。在算法第一阶段,利用均值与均方差比值差值序列建立排序检测器(ROD),检测出图像中所有可能的脉冲噪声点;第二阶段,采用逐点滑动N×N窗口,按照每个可能的脉冲噪声点在不同的滑动窗口被重复检测到的次数,建立噪声可信度。第三阶段,对高噪声点进行滤波;对低噪声点迭代排序检测,如果可识别有噪声点,再进行滤波。结果表明,算法可以准确检测和滤除脉冲噪声,并保持数据中非噪声点信息。  相似文献   
34.
35.
Journal of Electronic Testing -  相似文献   
36.
Spina bifida aperta are complex congenital malformations resulting from failure of fusion in the spinal neural tube during embryogenesis. Despite surgical repair of the defect, most patients who survive with spina bifida aperta have a multiple system handicap due to neuron deficiency of the defective spinal cord. Tissue engineering has emerged as a novel treatment for replacement of lost tissue. This study evaluated the prenatal surgical approach of transplanting a chitosan–gelatin scaffold seeded with bone marrow mesenchymal stem cells (BMSCs) in the healing the defective spinal cord of rat fetuses with retinoic acid induced spina bifida aperta. Scaffold characterisation revealed the porous structure, organic and amorphous content. This biomaterial promoted the adhesion, spreading and in vitro viability of the BMSCs. After transplantation of the scaffold combined with BMSCs, the defective region of spinal cord in rat fetuses with spina bifida aperta at E20 decreased obviously under stereomicroscopy, and the skin defect almost closed in many fetuses. The transplanted BMSCs in chitosan–gelatin scaffold survived, grew and expressed markers of neural stem cells and neurons in the defective spinal cord. In addition, the biomaterial presented high biocompatibility and slow biodegradation in vivo. In conclusion, prenatal transplantation of the scaffold combined with BMSCs could treat spinal cord defect in fetuses with spina bifida aperta by the regeneration of neurons and repairmen of defective region.  相似文献   
37.
It is well known that the main difficulties of the algorithms based on backpropagation are the susceptibility to local minima and the slow adaptivity to the patterns during the training. In this paper, we present a class of algorithms, which overcome the above difficulties by utilizing some "direct" numerical methods for the computation of the matrices of weights. In particular, we investigate the performances of the FBFBK-LSB (least-squares backpropagation) algorithms and iterative conjugate gradient singular-value decomposition (ICGSVD), respectively, introduced by Barmann and Biegler-Konig (1993) and by the authors. Numerical results on several benchmark problems show a major reliability and/or efficiency of our algorithm ICGSVD.  相似文献   
38.
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well-known result, due to Kari, says that all nontrivial properties of limit sets are undecidable. In this paper we consider the properties of limit set dynamics, i.e. properties of the dynamics of CA restricted to their limit sets. There can be no equivalent of Kari’s theorem for limit set dynamics. Anyway we show that there is a large class of undecidable properties of limit set dynamics, namely all properties of limit set dynamics which imply stability or the existence of a unique subshift attractor. As a consequence we have that it is undecidable whether the cellular automaton map restricted to the limit set is the identity map and whether it is closing, injective, expansive, positively expansive and transitive.  相似文献   
39.
在现有的基于傅里叶描绘子的CBIR系统中,为了提高检索速度,一般需要舍去物体轮廓经傅里叶变换后的大部分高频分量.当物体轮廓在细节部分具有较高能量时,此方法不具备有效性.为尽可能保证检索准确率并兼顾检索速度,在原有傅里叶描绘子上进行扩展,避免直接舍去高频分量,引入Fisher判别分析法将描绘子映射到子空间进行降维,并保证...  相似文献   
40.
Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the labeled maximum matching problem. It is a relatively new problem whose application is related to the timetabling problem. We prove it is NP-complete and present four different mathematical formulations. Moreover, we propose an exact algorithm based on a branch-and-bound approach to solve it. We evaluate the performance of our algorithm on a wide set of instances and compare our computational times with the ones required by CPLEX to solve the proposed mathematical formulations. Test results show the effectiveness of our procedure, that hugely outperforms the solver.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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