首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1181篇
  免费   28篇
  国内免费   6篇
电工技术   49篇
综合类   3篇
化学工业   359篇
金属工艺   82篇
机械仪表   38篇
建筑科学   30篇
矿业工程   2篇
能源动力   58篇
轻工业   51篇
石油天然气   2篇
无线电   67篇
一般工业技术   238篇
冶金工业   87篇
原子能技术   53篇
自动化技术   96篇
  2023年   4篇
  2022年   9篇
  2021年   25篇
  2020年   9篇
  2019年   9篇
  2018年   22篇
  2017年   17篇
  2016年   30篇
  2015年   9篇
  2014年   27篇
  2013年   80篇
  2012年   36篇
  2011年   60篇
  2010年   57篇
  2009年   53篇
  2008年   56篇
  2007年   46篇
  2006年   57篇
  2005年   31篇
  2004年   37篇
  2003年   44篇
  2002年   46篇
  2001年   31篇
  2000年   22篇
  1999年   19篇
  1998年   52篇
  1997年   30篇
  1996年   22篇
  1995年   18篇
  1994年   25篇
  1993年   16篇
  1992年   15篇
  1991年   15篇
  1990年   8篇
  1989年   9篇
  1988年   11篇
  1987年   7篇
  1986年   13篇
  1985年   16篇
  1984年   12篇
  1983年   14篇
  1982年   15篇
  1981年   10篇
  1980年   18篇
  1979年   12篇
  1978年   9篇
  1977年   6篇
  1976年   5篇
  1975年   5篇
  1973年   4篇
排序方式: 共有1215条查询结果,搜索用时 15 毫秒
91.
The single linkage method is a fundamental agglomerative hierarchical clustering algorithm. This algorithm regards each point as a single cluster initially. In the agglomeration step, it connects a pair of clusters such that the distance between the nearest members is the shortest. This step is repeated until only one cluster remains. The single linkage method can efficiently detect clusters in arbitrary shapes. However, a drawback of this method is a large time complexity of O(n 2), where n represents the number of data points. This time complexity makes this method infeasible for large data. This paper proposes a fast approximation algorithm for the single linkage method. Our algorithm reduces the time complexity to O(nB) by rapidly finding the near clusters to be connected by Locality-Sensitive Hashing, a fast algorithm for the approximate nearest neighbor search. Here, B represents the maximum number of points going into a single hash entry and it practically diminishes to a small constant as compared to n for sufficiently large hash tables. Experimentally, we show that (1) the proposed algorithm obtains clustering results similar to those obtained by the single linkage method and (2) it runs faster for large data than the single linkage method. Hisashi Koga received the M.S. and Ph.D. degree in information science in 1995 and 2002, respectively, from the University of Tokyo. From 1995 to 2003, he worked as a researcher at Fujitsu Laboratories Ltd. Since 2003, he has been a faculty member at the University of Electro-Communications, Tokyo (Japan). Currently, he is an associate professor at the Graduate School of Information Systems, University of Electro-Communications. His research interest includes various kinds of algorithms such as clustering algorithms, on-line algorithms, and algorithms in network communications. Tetsuo Ishibashi received the M.E. degree in information systems design from the Graduate School of Information Systems at the University of Electro-Communications in 2004. Presently, he is a system engineer at Fujitsu Broad Solution & Consulting Inc. Toshinori Watanabe received the B.E. degree in aeronautical engineering in 1971 and the D.E. degree in 1985, both from the University of Tokyo. In 1971, he worked at Hitachi as a researcher in the field of information systems design. His experience includes demand forecasting, inventory and production management, VLSI design automation, knowledge-based nonlinear optimizer, and a case-based evolutionary learning system nicknamed TAMPOPO. He also engaged in FGCS (Fifth Generation Computer System) project of Japan and developed a new hierarchical message-passing parallel cooperative VLSI layout problem solver that ran on PIM (Parallel Inference Machine) in 1991. Since 1992, he has been a professor at the Graduate School of Information Systems, University of Electro-Communications, Tokyo, Japan. His areas of interest include media analysis, learning intelligence, and the semantics of information systems. He is a member of the IEEE.  相似文献   
92.
A new approach to analyze HDD seeking acoustics is proposed. An acoustic transfer function was derived that has seeking current as input and seeking acoustics as response. The derivation and the advantage and limitation of this acoustic transfer function approach is discussed in details in this paper. HDD seeking acoustics is mainly determined by the seeking current spectrum and the mechanical design. The acoustics transfer function represents the mechanical design, and was used to diagnose trouble mechanical modes and to guide servo design to reduce specific seeking current frequency content. The acoustic transfer function approach also enables quick performance prediction of combination of different mechanical designs and seeking currents. Various HDDs with different seeking current profiles and mechanical designs were evaluated experimentally and numerically. Finally, a new seeking servo algorithm was evaluated, and good agreement was shown between the numerical prediction using the acoustics transfer function approach and the measured seeking acoustics.  相似文献   
93.
A mixed ionic and electronic conducting hydrogen separation membrane, which consisted of proton-conductive oxide and metallic palladium, was fabricated. A porous alumina tube was employed as a support, and proton-conductive oxide particles were introduced into a microporous top layer of the support by an impregnation method. Palladium particles were deposited into the same porous layer by chemical vapor deposition. Hydrogen permeated preferentially via the membrane thus obtained with a hydrogen permeance (PH2) of 1.2 × 10− 9 mol·m− 2·s− 1·Pa− 1 at 873 K. Selectivity for hydrogen (PH2/PN2) increased with the operating temperature due to an increase in proton conductivity of the membrane, and PH2/PN2 = 5.7 was attained at 873 K.  相似文献   
94.
A system procedure is proposed for a multi-robot rescue system that performs real-time exploration over disaster areas. Real-time exploration means that every robot exploring the area always has a communication path to human operators standing by at a base station and that the communication path is configured by ad hoc wireless networking. Real-time exploration is essential in multi-robot systems for USAR (urban search and rescue) because operators must communicate with every robot to support the victim detection process and ad hoc networking is suitable to configure a communication path among obstacles. The proposed system procedure consists of the autonomous classification of robots into search and relay types and behavior algorithms for each class of robot. Search robots explore the areas and relay robots act as relay terminals between search robots and the base station. The rule of the classification and the behavior algorithm refer to the forwarding table of each robot constructed for ad hoc networking. The table construction is based on DSDV (destination-sequenced distance vector) routing that informs each robot of its topological position in the network and other essentials. Computer simulations are executed with a specific exploration strategy of search robots. The results show that a multi-robot rescue system can perform real-time exploration with the proposed system procedure and reduce exploration time in comparison with the case where the proposed scheme is not adopted.  相似文献   
95.
The aim of this study is to develop an estimation method for a shape space. In this work, “shape space” means a nonlinear subspace formed by a class of visual shapes, in which the continuous change in shapes is naturally represented. By using the shape space, various operations dealing with shapes, such as identification, classification, recognition, and interpolation can be carried out in the shape space. This paper introduces an algorithm based on a generative model of shapes. A higher-rank of the self-organizing map (SOM2) is used to implement the shape space estimation method. We use this method to estimate the shape space of artificial contours. In addition, we present results from a simulation of omnidirectional camera images taken from mobile robots. Our technique accurately predicts changes in image properties as the robot’s attitude changes. Finally, we consider the addition of local features to our method. We show that the inclusion of local features solves the correspondence problem. These results suggest the potential of our technique in the future.  相似文献   
96.
97.
The effects of applied magnetic fields on the anodic dissolution of iron in a sulfuric acid solution were studied by potentiodynamic polarization measurements and electrode morphology observations. Uneven anodic dissolution occurs in the presence of magnetic field and the extent of the electrode surface inhomogeneity increases with magnetic flux density. Severely local dissolution at two edge areas of the iron electrode in the presence of magnetic fields is caused by the inhomogeneous distribution of the magnetic flux density at the ferromagnetic iron electrode and the resultant enhancement of the mass transport rate of interfacial film at local areas.  相似文献   
98.
This paper develops a modularization scheme based on the functional model of a system. The modularization approach makes use of the function–behavior–state (FBS) model of the system to derive the entity relations. The design structure matrix (DSM) is automatically constructed based on the FBS model. In this way, the tedious work of filling the DSM entries based on expert knowledge is avoided. The approach makes use of k-means clustering algorithm to allow the user to try different number of clusters in a fast way. The k-means clustering is adopted for DSM based modularization by defining a proper entity representation, relation measure and objective function. Two modularization schemes are performed, one based on the immediate relations and one on the deeper behavioral relations between the components. Considering the application on the shifting system of the Delft University of Technology (DUT) Formula Student car, the latter modularization resulted in more mechatronic behavior based modules, while the former resulted in modules based on mere disciplinary and spatial closeness.  相似文献   
99.
Effects of LTI addition on the mode I fracture energy of HA/PLLA/PCL were examined and the micro-structural modification due to LTI addition was investigated. Both the mode I energy release rate, G in, and averaged fracture energy, E f, are improved dramatically due to LTI addition. The reason is considered to be the improvements of the interfacial structure connecting HA particles with PLLA/PCL matrix and the miscibility between PLLA and PCL. These changes of blend morphology and interfacial structure reduce the stress concentration and lead to the ductile deformation and resulted in the increase of those fracture properties.  相似文献   
100.
As the memory cell array of DRAM has been scaled down, inter-bit-line coupling noise has emerged as a serious problem. The signal loss due to this noise is estimated at about 40% of the signal amplitude in a polycide-bit-line 16-Mb DRAM with a technologically attainable scaling scheme. Twisted bit-line architectures to reduce or eliminate the noise are proposed and demonstrated by the soft-error rate improvement of a 1-Mb DRAM. The effective critical charge is improved by 35%, which is attributed not only to the improvement of the signal amplitude but also to the elimination of large coupling noise during the sensing operation. The impact of these twisted bit-line architectures from a scaling viewpoint is also examined, and they are shown to be promising candidates for overcoming the scaling problems of DRAMs  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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