首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1384篇
  免费   9篇
电工技术   15篇
化学工业   248篇
金属工艺   17篇
机械仪表   17篇
建筑科学   50篇
矿业工程   3篇
能源动力   29篇
轻工业   85篇
水利工程   11篇
石油天然气   5篇
无线电   128篇
一般工业技术   164篇
冶金工业   465篇
原子能技术   5篇
自动化技术   151篇
  2023年   21篇
  2021年   25篇
  2020年   26篇
  2019年   19篇
  2018年   18篇
  2015年   16篇
  2014年   20篇
  2013年   44篇
  2012年   30篇
  2011年   50篇
  2010年   29篇
  2009年   35篇
  2008年   51篇
  2007年   39篇
  2006年   34篇
  2005年   28篇
  2004年   24篇
  2003年   22篇
  2002年   28篇
  2001年   30篇
  2000年   21篇
  1999年   23篇
  1998年   73篇
  1997年   53篇
  1996年   52篇
  1995年   25篇
  1994年   24篇
  1993年   24篇
  1992年   18篇
  1991年   14篇
  1990年   21篇
  1989年   20篇
  1987年   14篇
  1986年   13篇
  1985年   19篇
  1984年   20篇
  1981年   14篇
  1980年   12篇
  1978年   13篇
  1977年   16篇
  1976年   19篇
  1975年   15篇
  1974年   10篇
  1973年   12篇
  1972年   19篇
  1971年   15篇
  1970年   11篇
  1968年   12篇
  1967年   12篇
  1966年   22篇
排序方式: 共有1393条查询结果,搜索用时 0 毫秒
61.
Systematically compared the birth order and family size of 150 male and 99 female homosexuals with those of 108 male and 97 female heterosexuals. Results show that neither birth order nor family size represented distinct or meaningful contrasts between male or female homosexuals or heterosexuals. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
62.
63.
The goal of this work is to provide a framework for applications to probabilistically meet latency targets using redundancy and multipath routing. It investigates the amount of redundancy necessary to maximize the probability of constructing a copy of a file F no later than a given delay bound Δ without any reservations. Redundancy is obtained from the information dispersal algorithm (IDA) of Rabin. Specifically, F is broken into b pieces, each of size s, and each piece is sent on one of the several (disjoint) paths from source to destination. Each piece contains some redundant information in such a way that any m≡|F|/s pieces are enough to reconstruct the file. This work presents both analytical and computational results to determine the optimal values of b and s to maximize the success probability. It also examines the impact of various parameters such as the file size, delay bound, loss rate, distance from the destination, on the probabilistic quality of service (QoS) guarantee. This is a novel approach to QoS routing since it does not require any reservations or extra overhead at intermediate nodes and effectively shifts the burden from nodes to links.  相似文献   
64.
ABSTRACT

The instrumental setup used for simultaneous bipolar ion detection in on-line single-particle analysis by laser mass spectrometry is described. Particle size calibration has been performed using aerodynamic time-of-flight techniques. Mass spectra of several hundred ambient particles with aerodynamic diameters of 0.8 μm have been evaluated for statistical classification (Principal Components Analysis [PCA]) in order to identify main chemical components of the prominent particle classes.  相似文献   
65.
66.
67.
Neben den Kontroversen um die Vorratsdatenspeicherung, den personenbezogenen Daten aus der Mautüberwachung und den Reaktionsm?glichkeiten gegenüber dem Terrorismus herrschte auch in der Judikatur zum Datenschutz rege Bewegung. Die davon betroffenen Rechtsgebiete waren mannigfaltig, was abermals unterstreicht, dass das Datenschutzrecht eine Querschnittmaterie darstellt. Dies ist der Anlass, die wichtigsten Entscheidungen des vergangenen Jahres kurz darzustellen.  相似文献   
68.
Nachdem sich der erste Teil der Rechtsprechungsübersicht insbesondere der Judikatur des BVerfG und des BGH gewidmet hat, befasst sich der zweite Teil vornehmlich mit Entscheidungen aus dem Zeitraum Januar bis Anfang November 2006, die im Arbeitsrecht und dem Internetrecht sowie auf den Gebieten der Werbung und des Marketing ergangen sind.  相似文献   
69.
The empirical investigation of Perspective-Based Reading   总被引:5,自引:1,他引:5  
We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.To test the effectiveness of PBR, we conducted a controlled experiment with professional software developers from the National Aeronautics and Space Administration/Goddard Space Flight Center (NASA/GSFC) Software Engineering Laboratory (SEL). The subjects read two types of documents, one generic in nature and the other from the NASA domain, using two reading techniques, a PBR technique and their usual technique. The results from these experiments, as well as the experimental design, are presented and analyzed. Teams applying PBR are shown to achieve significantly better coverage of documents than teams that do not apply PBR.We thoroughly discuss the threats to validity so that external replications can benefit from the lessons learned and improve the experimental design if the constraints are different from those posed by subjects borrowed from a development organization.  相似文献   
70.
In this paper we present an algorithm for the routing problem in a routing region which is bordered by a simple polygonal line, such that there are no rectilinearly visible corners. The routing problem consists in finding pairwise edge-disjoint paths in the grid for the nets connecting some given pairs of boundary vertices. Whenever a solution exists our algorithm finds it in time O(U log2U), where U is the size of the boundary. This is a generalization of the algorithm for rectangle routing by Mehlhorn and Preparata (1986, J. Assoc. Comput. Mach.33, 60-85), which up to now has been the only method with sublinear running time in respect of the routing area.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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