首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   765篇
  免费   47篇
  国内免费   5篇
电工技术   14篇
综合类   4篇
化学工业   196篇
金属工艺   9篇
机械仪表   12篇
建筑科学   40篇
矿业工程   2篇
能源动力   21篇
轻工业   54篇
水利工程   9篇
石油天然气   8篇
无线电   68篇
一般工业技术   183篇
冶金工业   99篇
原子能技术   7篇
自动化技术   91篇
  2024年   3篇
  2023年   12篇
  2022年   22篇
  2021年   36篇
  2020年   28篇
  2019年   24篇
  2018年   24篇
  2017年   20篇
  2016年   21篇
  2015年   26篇
  2014年   23篇
  2013年   49篇
  2012年   44篇
  2011年   60篇
  2010年   58篇
  2009年   27篇
  2008年   41篇
  2007年   38篇
  2006年   37篇
  2005年   27篇
  2004年   20篇
  2003年   18篇
  2002年   5篇
  2001年   4篇
  2000年   8篇
  1999年   7篇
  1998年   12篇
  1997年   10篇
  1996年   10篇
  1995年   6篇
  1994年   7篇
  1993年   3篇
  1992年   4篇
  1991年   6篇
  1990年   10篇
  1989年   3篇
  1988年   2篇
  1987年   5篇
  1986年   10篇
  1985年   4篇
  1984年   5篇
  1983年   9篇
  1981年   5篇
  1980年   3篇
  1979年   3篇
  1978年   3篇
  1977年   3篇
  1976年   4篇
  1975年   2篇
  1946年   1篇
排序方式: 共有817条查询结果,搜索用时 15 毫秒
61.
TreeNetViz: revealing patterns of networks over tree structures   总被引:1,自引:0,他引:1  
Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns.  相似文献   
62.
Abstract— Defect‐free large‐area inorganic thick‐dielectric EL (TDEL) displays using Color by Blue (CBB) technology have been successfully developed. We have achieved the world's highest blue‐phosphor luminance of 900 cd/m2 for a single‐pixel device by using CBB and by optimizing the e‐beam gun configuration and the flow rate of H2S in the vacuum chamber. By analyzing the defects on panels with triple‐pattern phosphors and CBB panels, we also found that the number of defects on CBB panels can be drastically reduced compared with those on triple‐pattern panels. The defect‐free 17‐in. VGA CBB panels show better characteristics, a high peak luminance of 600 cd/m2 and a high contrast ratio of 1000:1, compared with those of triple‐pattern panels.  相似文献   
63.
64.
User-Level Device Drivers: Achieved Performance   总被引:2,自引:0,他引:2       下载免费PDF全文
Running device drivers as unprivileged user-level code, encapsulated into their own process, has often been proposed as a technique for increasing system robustness. However, in the past, systems based on user-level drivers have generally exhibited poor I/O performance. Consequently, user-level device drivers have never caught on to any significant degree. In this paper we demonstrate that it is possible to build systems which employ user-level device drivers, without significant performance degradation, even for high-bandwidth devices such as Gigabit Ethernet.  相似文献   
65.
Modification point depth and genome growth in genetic programming   总被引:1,自引:0,他引:1  
The evolutionary computation community has shown increasing interest in arbitrary-length representations, particularly in the field of genetic programming. A serious stumbling block to the scalability of such representations has been bloat: uncontrolled genome growth during an evolutionary run. Bloat appears across the evolutionary computation spectrum, but genetic programming has given it by far the most attention. Most genetic programming models explain this phenomenon as a result of the growth of introns, areas in an individual which serve no functional purpose. This paper presents evidence which directly contradicts intron theories as applied to tree-based genetic programming. The paper then uses data drawn from this evidence to propose a new model of genome growth. In this model, bloat in genetic programming is a function of the mean depth of the modification (crossover or mutation) point. Points far from the root are correspondingly less likely to hurt the child's survivability in the next generation. The modification point is in turn strongly correlated to average parent tree size and to removed subtree size, both of which are directly linked to the size of the resulting child.  相似文献   
66.
67.
The origins of the sampling theorem   总被引:1,自引:0,他引:1  
The publications of Claude E. Shannon brought the sampling theorem to the broad attention of communication engineers. This article demonstrates how practicians, theoreticians, and mathematicians discovered the implications of the sampling theorem almost independent of one another  相似文献   
68.
69.
We report continuous carbon nanotube (CNT) fibers and yarns dry-drawn directly from water-assisted chemical vapor deposition (CVD) grown forests with about 1-mm height. As-drawn CNT fibers exist as aerogel and can be transformed into more compact fibers through twisting or densification with a volatile organic liquid. CNT fibers are characterized by scanning electron microscopy, X-ray photoelectron spectroscopy, Raman microscopy, and wide-angle X-ray diffraction. Mechanical properties and electrical conductivity of the post-treated CNT fibers are investigated. The resulting fibers show the work of rupture of 30 J/g and DC electrical conductivity of 5.0 × 104 S/m.  相似文献   
70.

The implementation of periodic boundary conditions (PBCs) is one of the most important and difficult steps in the computational analysis of structures and materials. This is especially true in cases such as mechanical metamaterials which typically possess intricate geometries and designs which makes finding and implementing the correct PBCs a difficult challenge. In this work, we analyze one of the most common PBCs implementation technique, as well as implement and validate an alternative generic method which is suitable to simulate any possible 2D microstructural geometry with a quadrilateral unit cell regardless of symmetry and mode of deformation. A detailed schematic of how both these methods can be employed to study 3D systems is also presented.

  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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