全文获取类型
收费全文 | 1525篇 |
免费 | 48篇 |
专业分类
电工技术 | 12篇 |
化学工业 | 176篇 |
金属工艺 | 11篇 |
机械仪表 | 19篇 |
建筑科学 | 35篇 |
能源动力 | 36篇 |
轻工业 | 71篇 |
水利工程 | 7篇 |
石油天然气 | 16篇 |
无线电 | 138篇 |
一般工业技术 | 229篇 |
冶金工业 | 677篇 |
原子能技术 | 46篇 |
自动化技术 | 100篇 |
出版年
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 16篇 |
2018年 | 26篇 |
2017年 | 22篇 |
2016年 | 27篇 |
2015年 | 23篇 |
2014年 | 26篇 |
2013年 | 63篇 |
2012年 | 45篇 |
2011年 | 40篇 |
2010年 | 45篇 |
2009年 | 41篇 |
2008年 | 41篇 |
2007年 | 31篇 |
2006年 | 33篇 |
2005年 | 29篇 |
2004年 | 21篇 |
2003年 | 24篇 |
2002年 | 28篇 |
2001年 | 15篇 |
2000年 | 26篇 |
1999年 | 28篇 |
1998年 | 148篇 |
1997年 | 105篇 |
1996年 | 70篇 |
1995年 | 47篇 |
1994年 | 52篇 |
1993年 | 40篇 |
1991年 | 13篇 |
1990年 | 24篇 |
1989年 | 17篇 |
1988年 | 20篇 |
1987年 | 29篇 |
1986年 | 23篇 |
1985年 | 19篇 |
1984年 | 13篇 |
1983年 | 17篇 |
1982年 | 15篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 10篇 |
1978年 | 10篇 |
1977年 | 32篇 |
1976年 | 44篇 |
1975年 | 8篇 |
1974年 | 12篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 12篇 |
排序方式: 共有1573条查询结果,搜索用时 15 毫秒
21.
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of a search on such unstructured P2P networks, as well as other networks. A key limitation of scale-free (power-law) topologies is the high load (i.e., high degree) on a very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store a large number of entries for construction of the overlay topology. Therefore, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology, hence limited scale-free networks. Thus, it is expected that the efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate the construction of scale-free topologies with hard cutoffs (i.e., there are not any major hubs) and the effect of these hard cutoffs on the search efficiency. Interestingly, we observe that the efficiency of normalized flooding and random walk search algorithms increases as the hard cutoff decreases. 相似文献
22.
23.
Zhihai Fan Hongxiang Liu Zhaozhao Ding Liying Xiao Qiang Lu David L Kaplan 《Advanced functional materials》2023,33(33):2301839
Different tissues have complex anisotropic structures to support biological functions. Mimicking these complex structures in vitro remains a challenge in biomaterials designs. Here, inspired by different types of silk nanofibers, a composite materials strategy is pursued toward this challenge. A combination of fabrication methods is utilized to achieve separate control of amorphous and beta-sheet rich silk nanofibers in the same solution. Aqueous solutions containing two types of silk nanofibers are simultaneously treated with an electric field and with ethylene glycol diglycidyl ether (EGDE). Under these conditions, the beta-sheet rich silk nanofibers in the mixture responded to the electric field while the amorphous nanofibers are active in the crosslinking process with the EGDE. As a result, cryogels with anisotropic structures are prepared, including mimics for cortical- and cancellous-like bone biomaterials as a complex osteoinductive niche. In vitro studies revealed that mechanical cues of the cryogels induced osteodifferentiation of stem cells while the anisotropy inside the cryogels influenced immune reactions of macrophages. These bioactive cryogels also stimulated improved bone regeneration in vivo through modulation of inflammation, angiogenesis and osteogenesis responses, suggesting an effective strategy to develop bioactive matrices with complex anisotropic structures beneficial to tissue regeneration. 相似文献
24.
Kamtekar SD Pande R Ayyagari MS Marx KA Kaplan DL Kumar J Tripathy S 《Analytical chemistry》1996,68(1):216-220
A novel technique for the trace analysis of metal ions Zn(II), Be(II), and Bi(III) in bulk solutions is discussed. This technique involves the generation of a chemiluminescence signal from alkaline phosphatase catalyzed hydrolysis of a phosphate derivative of 1,2-dioxetane. Zn(II) can be determined by two methods, reactivation of the alkaline phosphatase apoenzyme and inhibition of the native enzyme. Be(II) and Bi(III) can be determined quantitatively by inhibition of the native enzyme. Subppb to ppm level detection of Zn(II), Be(II), and Bi(III) has been achieved. Initial studies with mixed metals are also reported. The technique described is rapid and sensitive and can be readily applied to the microassay of heavy metal ions. 相似文献
25.
JW Lynch GA Kaplan RD Cohen J Tuomilehto JT Salonen 《Canadian Metallurgical Quarterly》1996,144(10):934-942
Much remains to be understood about how low socioeconomic status (SES) increases cardiovascular disease and mortality risk. Data from the Kuopio Ischemic Heart Disease Risk Factor Study (1984-1993) were used to estimate the associations between acute myocardial infarction and income, all-cause mortality, and cardiovascular mortality in a population-based sample of 2,272 Finnish men, with adjustment for 23 biologic, behavioral, psychologic, and social risk factors. Compared with the highest income quintile, those in the bottom quintile had age-adjusted relative hazards of 3.14 (95% confidence interval (CI) 1.77-5.56), 2.66 (95% CI 1.25-5.66), and 4.34 (95% CI 1.95-9.66) for all-cause mortality, cardiovascular mortality, and AMI, respectively. After adjustment for risk factors, the relative hazards for the same comparisons were 1.32 (95% CI 0.70-2.49), 0.70 (95% CI 0.29-1.69), and 2.83 (95% CI 1.14-7.00). In the lowest income quintile, adjustment for risk factors reduced the excess relative risk of all-cause mortality by 85%, that of cardiovascular mortality by 118%, and that of acute myocardial infarction by 45%. These data show how the association between SES and cardiovascular mortality and all-cause mortality is mediated by known risk factor pathways, but full "explanations" for these associations will need to encompass why these biologic, behavioral, psychologic, and social risk factors are differentially distributed by SES. 相似文献
26.
We introduce a method based on Kolmogorov complexity to prove lower bounds on communication complexity. The intuition behind our technique is close to information theoretic methods.We use Kolmogorov complexity for three different things: first, to give a general lower bound in terms of Kolmogorov mutual information; second, to prove an alternative to Yao’s minmax principle based on Kolmogorov complexity; and finally, to identify hard inputs.We show that our method implies the rectangle and corruption bounds, known to be closely related to the subdistribution bound. We apply our method to the hidden matching problem, a relation introduced to prove an exponential gap between quantum and classical communication. We then show that our method generalizes the VC dimension and shatter coefficient lower bounds. Finally, we compare one-way communication and simultaneous communication in the case of distributional communication complexity and improve the previous known result. 相似文献
27.
Melek Z Mayerich D Yuksel C Keyser J 《IEEE transactions on visualization and computer graphics》2006,12(5):1165-1172
Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed. 相似文献
28.
29.
30.
The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with ready times and due date-to-deadline window to minimize total weighted tardiness. ARSP assumes that the jobs have different ready times and a due date-to-deadline window between refueling due date and a deadline to return without refueling. In this paper, we first formulate the ARSP as a mixed integer programming model. The objective function is a piece-wise tardiness cost that takes into account due date-to-deadline windows and job priorities. Since ARSP is NP-hard, two heuristics are proposed to obtain solutions in reasonable computation times, namely (1) modified ATC rule (MATC), (2) a simulated annealing method (SA). The proposed heuristic algorithms are tested in terms of solution quality and CPU time through computational experiments with data randomly generated to represent aerial refueling operations of an in-theater air operation. Solutions provided by both algorithms were compared to optimal solutions for problems with up to 12 jobs and to each other for larger problems with up to 60 jobs. The results show that, MATC is more likely to outperform SA especially when the problem size increases, although it has significantly worse performance than SA in terms of deviation from optimal solution for small size problems. Moreover CPU time performance of MATC is significantly better than SA in both cases. 相似文献