全文获取类型
收费全文 | 8598篇 |
免费 | 513篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 132篇 |
综合类 | 24篇 |
化学工业 | 1769篇 |
金属工艺 | 186篇 |
机械仪表 | 198篇 |
建筑科学 | 433篇 |
矿业工程 | 39篇 |
能源动力 | 114篇 |
轻工业 | 1345篇 |
水利工程 | 41篇 |
石油天然气 | 12篇 |
无线电 | 646篇 |
一般工业技术 | 2442篇 |
冶金工业 | 342篇 |
原子能技术 | 83篇 |
自动化技术 | 1306篇 |
出版年
2023年 | 113篇 |
2022年 | 58篇 |
2021年 | 180篇 |
2020年 | 135篇 |
2019年 | 136篇 |
2018年 | 300篇 |
2017年 | 309篇 |
2016年 | 339篇 |
2015年 | 249篇 |
2014年 | 322篇 |
2013年 | 611篇 |
2012年 | 408篇 |
2011年 | 509篇 |
2010年 | 409篇 |
2009年 | 424篇 |
2008年 | 472篇 |
2007年 | 437篇 |
2006年 | 322篇 |
2005年 | 278篇 |
2004年 | 227篇 |
2003年 | 230篇 |
2002年 | 208篇 |
2001年 | 177篇 |
2000年 | 148篇 |
1999年 | 123篇 |
1998年 | 171篇 |
1997年 | 142篇 |
1996年 | 116篇 |
1995年 | 74篇 |
1994年 | 80篇 |
1993年 | 66篇 |
1992年 | 50篇 |
1991年 | 53篇 |
1990年 | 34篇 |
1989年 | 38篇 |
1988年 | 33篇 |
1987年 | 36篇 |
1986年 | 51篇 |
1985年 | 107篇 |
1984年 | 66篇 |
1983年 | 54篇 |
1982年 | 55篇 |
1981年 | 41篇 |
1980年 | 48篇 |
1979年 | 37篇 |
1978年 | 45篇 |
1977年 | 25篇 |
1976年 | 31篇 |
1973年 | 31篇 |
1943年 | 26篇 |
排序方式: 共有9112条查询结果,搜索用时 56 毫秒
81.
Images can be acquired at high rates with modern fluorescence microscopy hardware, giving rise to a demand for high-speed analysis of image data. Digital image cytometry, i.e., automated measurements and extraction of quantitative data from images of cells, provides valuable information for many types of biomedical analysis. There exists a number of different image analysis software packages that can be programmed to perform a wide array of useful measurements. However, the multi-application capability often compromises the simplicity of the tool. Also, the gain in speed of analysis is often compromised by time spent learning complicated software. We provide a free software called BlobFinder that is intended for a limited type of application, making it easy to use, easy to learn and optimized for its particular task. BlobFinder can perform batch processing of image data and quantify as well as localize cells and point like source signals in fluorescence microscopy images, e.g., from FISH, in situ PLA and padlock probing, in a fast and easy way. 相似文献
82.
Vesa Halava Tero Harju Tomi Kärki Patrice Séébold 《Theoretical computer science》2009,410(8-10):943-948
We prove that there exist infinitely many infinite overlap-free binary partial words containing at least one hole. Moreover, we show that these words cannot contain more than one hole and the only hole must occur either in the first or in the second position. We define that a partial word is -overlap-free if it does not contain a factor of the form where the length of is at least . We prove that there exist infinitely many 2-overlap-free binary partial words containing an infinite number of holes. 相似文献
83.
JavaScript provides the technological foundation of Web 2.0 applications. AJAX (Asynchronous JavaScript And XML) applications have received wide-spread attention as a new way to develop highly interactive web applications. Breaking with the complete-page-reload paradigm of traditional web applications, AJAX applications rival desktop applications in their look-and-feel. But AJAX places a high burden on a web developer requiring extensive JavaScript knowledge as well as other advanced client-side technologies. In this paper, we introduce a technique that allows a developer to implement an application in Java or any.NET language and then automatically cross-compile it to an AJAX-enabled web application. 相似文献
84.
85.
On Definability in Dependence Logic 总被引:1,自引:1,他引:0
We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic. 相似文献
86.
Anne Köpsel Päivi Majaranta Poika Isokoski Anke Huckauf 《Behaviour & Information Technology》2016,35(12):1044-1062
Modern interaction techniques like non-intrusive gestures provide means for interacting with distant displays and smart objects without touching them. We were interested in the effects of feedback modality (auditory, haptic or visual) and its combined effect with input modality on user performance and experience in such interactions. Therefore, we conducted two exploratory experiments where numbers were entered, either by gaze or hand, using gestures composed of four stroke elements (up, down, left and right). In Experiment 1, a simple feedback was given on each stroke during the motor action of gesturing: an audible click, a haptic tap or a visual flash. In Experiment 2, a semantic feedback was given on the final gesture: the executed number was spoken, coded by haptic taps or shown as text. With simultaneous simple feedback in Experiment 1, performance with hand input was slower but more accurate than with gaze input. With semantic feedback in Experiment 2, however, hand input was only slower. Effects of feedback modality were of minor importance; nevertheless, semantic haptic feedback in Experiment 2 showed to be useless at least without extensive training. Error patterns differed between both input modes, but again not dependent on feedback modality. Taken together, the results show that in designing gestural systems, choosing a feedback modality can be given a low priority; it can be chosen according to the task, context and user preferences. 相似文献
87.
We consider broadcasting in random d-regular graphs by using a simple modification of the random phone call model introduced by Karp et al. (Proceedings of the FOCS ’00, 2000). In the phone call model, in every time step, each node calls a randomly chosen neighbour to establish a communication channel to this node. The communication channels can then be used bi-directionally to transmit messages. We show that, if we allow every node to choose four distinct neighbours instead of one, then the average number of message transmissions per node required to broadcast a message efficiently decreases exponentially. Formally, we present an algorithm that has time complexity \(O(\log n)\) and uses \(O(n\log \log n)\) transmissions per message. In contrast, we show for the standard model that every distributed algorithm in a restricted address-oblivious model that broadcasts a message in time \(O(\log n)\) requires \(\Omega (n \log n{/} \log d)\) message transmissions. Our algorithm efficiently handles limited communication failures, only requires rough estimates of the number of nodes, and is robust against limited changes in the size of the network. Our results have applications in peer-to-peer networks and replicated databases. 相似文献
88.
This paper develops and tests a motivational model to explain the overall continuance intention to use computers and smartphones. Based on survey data from 192 undergraduate students, structural equation modeling analysis is used to report: (1) the independent effect of intrinsic motivation on the continuance intention to use computers and smartphones; (2) the independent effect of extrinsic motivation on the continuance intention to use computers but not smartphones; (3) intrinsic motivation mediating the effect of extrinsic motivation on the continuance intention to use computers; (4) the independent effect of technology cognizance on the continuance intention to use computers but not smartphones; (5) intrinsic motivation positively influencing extrinsic motivation and technology cognizance, with respect to both devices. This research contributes to an improved understanding of the independent and interrelated effects of intrinsic and extrinsic motivations to use technological devices. The findings have important implications for theory and practice regarding the overall use of technology. 相似文献
89.
90.