首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5182篇
  免费   168篇
  国内免费   6篇
电工技术   118篇
综合类   6篇
化学工业   1213篇
金属工艺   91篇
机械仪表   116篇
建筑科学   213篇
矿业工程   20篇
能源动力   86篇
轻工业   599篇
水利工程   35篇
石油天然气   18篇
无线电   395篇
一般工业技术   829篇
冶金工业   946篇
原子能技术   29篇
自动化技术   642篇
  2022年   61篇
  2021年   91篇
  2020年   86篇
  2019年   59篇
  2018年   88篇
  2017年   90篇
  2016年   121篇
  2015年   80篇
  2014年   133篇
  2013年   289篇
  2012年   228篇
  2011年   304篇
  2010年   179篇
  2009年   193篇
  2008年   211篇
  2007年   216篇
  2006年   156篇
  2005年   127篇
  2004年   118篇
  2003年   133篇
  2002年   127篇
  2001年   79篇
  2000年   67篇
  1999年   88篇
  1998年   160篇
  1997年   102篇
  1996年   86篇
  1995年   81篇
  1994年   66篇
  1993年   69篇
  1992年   54篇
  1991年   43篇
  1990年   61篇
  1989年   58篇
  1988年   43篇
  1987年   48篇
  1985年   57篇
  1984年   42篇
  1983年   47篇
  1982年   43篇
  1981年   46篇
  1980年   38篇
  1979年   46篇
  1978年   47篇
  1977年   48篇
  1976年   53篇
  1975年   54篇
  1974年   45篇
  1973年   37篇
  1971年   33篇
排序方式: 共有5356条查询结果,搜索用时 15 毫秒
41.
We numerically investigate the performance of atomic transport in optical microtraps via the so called spatial adiabatic passage technique. Our analysis is carried out by means of optimal control methods, which enable us to determine suitable transport control pulses. We investigate the ultimate limits of the optimal control in speeding up the transport process in a triple well configuration for both a single atomic wave packet and a Bose-Einstein condensate within a regime of experimental parameters achievable with current optical technology.  相似文献   
42.
43.
In this paper we consider the p-ary transitive reduction (TR p ) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases of TR p have been investigated before in different contexts; the best previous results are as follows:
(1)  The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972).
(2)  A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999).
In this paper, our contributions are as follows:
•  We observe that TR p , for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137, 1972).
•  We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above.
•  We provide a 2+o(1)-approximation for TR p on general graphs for any fixed prime p>1.
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology. B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973. E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557.  相似文献   
44.
Defects discovered during the testing phase in software projects need to be removed before the software is shipped to the customers. The removal of defects can constitute a significant amount of effort in a project and project managers are faced with a decision whether to continue development or shift some resources to cope with defect removal. The goal of this research is to improve the practice of project management by providing a method for predicting the number of defects reported into the defect database in the project. In this paper we present a method for predicting the number of defects reported into the defect database in a large software project on a weekly basis. The method is based on using project progress data, in particular the information about the test progress, to predict defect inflow in the next three coming weeks. The results show that the prediction accuracy of our models is up to 72% (mean magnitude of relative error for predictions of 1 week in advance is 28%) when used in ongoing large software projects. The method is intended to support project managers in more accurate adjusting resources in the project, since they are notified in advance about the potentially large effort needed to correct defects.  相似文献   
45.
Multithreaded servers with cache-coherent shared memory are the dominant type of machines used to run critical network services and database management systems. To achieve the high availability required for these tasks, it is necessary to incorporate mechanisms for error detection and recovery. Correct operation of the memory system is defined by the memory consistency model. Errors can therefore be detected by checking if the observed memory system behavior deviates from the specified consistency model. Based on recent work, we design a framework for dynamic verification of memory consistency (DVMC). The framework consists of mechanisms to verify three invariants that are proven to guarantee that a specified memory consistency model is obeyed. We describe an implementation of the framework for the SPARCv9 architecture, and we experimentally evaluate its performance using full-system simulation of commercial workloads.  相似文献   
46.
To improve the tarnished reputation of WLAN security, the new IEEE 802.11i standard provides means for mutual user authentication and assures confidentiality of user data. However, the IEEE 802.11 link-layer is still highly vulnerable to a plethora of simple, yet effective attacks which further jeopardize the already fragile security of wireless communications.Some of these vulnerabilities are related to limited hardware capabilities of access points and their abuse may result in serious degradation of control over the wireless connection, which, especially in the case of broadcast communication, allows for client hijacking attacks. Although these issues are known and their impact is expected to be less prevalent on modern equipment, this work demonstrates the opposite. In our experimental analysis, we tested frequently used access points, and by forcing them to operate on their performance limits, we identified significant operational anomalies and demonstrated their impact on security by implementing a novel version of the Man-In-The-Middle attack, to which we refer as the Muzzle attack.Secondly, this work describes DiscoSec, a solution for “patching” WLANs against a variety of such link-layer attacks. DiscoSec provides DoS-resilient key exchange, an efficient frame authentication, and a performance-oriented implementation. By means of extensive real-world measurements DiscoSec is evaluated, showing that even on very resource-limited devices the network throughput is decreased by only 22% compared to the throughput without any authentication, and by 6% on more performance-capable hardware. To demonstrate its effectiveness, DiscoSec is available as an open-source IEEE 802.11 device driver utilizing well-established cryptographic primitives provided by the Linux Crypto API and OpenSSL library.  相似文献   
47.
Zusammenfassung  Im Zeitalter der Informationstechnologie und der umfassenden Vernetzung vieler Systeme ben?tigt ein Dieb weder eine Brechstange noch muss er im Schutze der Dunkelheit vorgehen. Vielmehr kann er über das Internet, oder lokale Netzwerke, kommen und gehen wann er will, ohne sich der Gefahr einer Entdeckung und Verhaftung auszusetzen. In vielen F?llen ist ein solcher Einbrecher l?ngst über alle Berge, bevor seine Tat überhaupt bemerkt wird. Trotzdem hinterl?sst er Spuren — deren Aufspürung und Analyse die Aufgabe des Computer-Forensikers ist. Zur Unterstützung dieser Arbeit existiert eine Vielzahl an Open-Source-Werkzeugen, die es durchaus mit ihrer kommerziellen Konkurrenz aufnehmen k?nnen.  相似文献   
48.
This paper presents a large anisotropic damage theory of continuum damage mechanics. It is developed via a new hypothesis of incremental complementary elastic energy equivalence. This hypothesis is more versatile and accurate if compared to the original hypothesis of total complementary energy equivalence. To model the large damage, we assumed that it occurs as a series of incremental small damage. An expression for the damage effect tensor M(D) for large damage is derived. It is shown that when the damage is small, that is, D i1, the proposed large damage theory reduces to the small damage model of Chow and Wang [1]. To demonstrate this large damage theory, it is applied to model the following cases: (a) uniaxial tension, (b) pure torsion and (c) elastic perfectly-plastic material behavior. In all three cases, the results clearly show that when the damage is small, Chow and Wang's model is recovered. However, for large damage, there are significant differences in predictions. Since this large damage theory is formulated on the basis of the incremental complementary energy, it is applicable to a wider range of problems.  相似文献   
49.
50.
In this article, a fully unsupervised method for brain tissue segmentation of T1‐weighted MRI 3D volumes is proposed. The method uses the Fuzzy C‐Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro‐radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial‐and‐error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro‐Spinal Fluid in an unsupervised way. The method has been tested on the IBSR dataset, on the BrainWeb Phantom, on the BrainWeb SBD dataset, and on the real dataset “University of Palermo Policlinico Hospital” (UPPH), Italy. Sensitivity, Specificity, Dice and F‐Factor scores have been calculated on the IBSR and BrainWeb datasets segmented using the proposed method, the FCM algorithm, and two state‐of‐the‐art brain segmentation software packages (FSL and SPM) to prove the effectiveness of the proposed approach. A qualitative evaluation involving a group of five expert radiologists has been performed segmenting the real dataset using the proposed approach and the comparison algorithms. Finally, a usability analysis on the proposed method and reference methods has been carried out from the same group of expert radiologists. The achieved results show that the segmentations of the proposed method are comparable or better than the reference methods with a better usability and degree of acceptance.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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