全文获取类型
收费全文 | 347771篇 |
免费 | 3677篇 |
国内免费 | 1488篇 |
专业分类
电工技术 | 6216篇 |
综合类 | 202篇 |
化学工业 | 54204篇 |
金属工艺 | 14604篇 |
机械仪表 | 10684篇 |
建筑科学 | 8269篇 |
矿业工程 | 2259篇 |
能源动力 | 8248篇 |
轻工业 | 31140篇 |
水利工程 | 3856篇 |
石油天然气 | 8781篇 |
武器工业 | 55篇 |
无线电 | 37296篇 |
一般工业技术 | 70068篇 |
冶金工业 | 61510篇 |
原子能技术 | 9524篇 |
自动化技术 | 26020篇 |
出版年
2021年 | 2851篇 |
2019年 | 2588篇 |
2018年 | 4905篇 |
2017年 | 4864篇 |
2016年 | 5294篇 |
2015年 | 3246篇 |
2014年 | 5462篇 |
2013年 | 14957篇 |
2012年 | 8715篇 |
2011年 | 11505篇 |
2010年 | 9432篇 |
2009年 | 10794篇 |
2008年 | 11007篇 |
2007年 | 10819篇 |
2006年 | 9527篇 |
2005年 | 8846篇 |
2004年 | 8325篇 |
2003年 | 8017篇 |
2002年 | 8014篇 |
2001年 | 7875篇 |
2000年 | 7562篇 |
1999年 | 7529篇 |
1998年 | 17831篇 |
1997年 | 13208篇 |
1996年 | 10140篇 |
1995年 | 7778篇 |
1994年 | 6994篇 |
1993年 | 6919篇 |
1992年 | 5279篇 |
1991年 | 5275篇 |
1990年 | 5135篇 |
1989年 | 5134篇 |
1988年 | 5008篇 |
1987年 | 4303篇 |
1986年 | 4311篇 |
1985年 | 4893篇 |
1984年 | 4582篇 |
1983年 | 4224篇 |
1982年 | 3957篇 |
1981年 | 4110篇 |
1980年 | 3910篇 |
1979年 | 3854篇 |
1978年 | 3930篇 |
1977年 | 4506篇 |
1976年 | 5777篇 |
1975年 | 3609篇 |
1974年 | 3440篇 |
1973年 | 3431篇 |
1972年 | 3016篇 |
1971年 | 2806篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
Ten natural bloom samples of cyanobacteria from the Danish lakes Knud s? (5), Ravn s? (4), and Salten Langs? (1) collected during 1993-1995 were assayed for toxicity by mouse bioassay, for acetylcholinesterase inhibiting activity by a colorimetric method, and for microcystins by enzyme-linked immunosorbent assay. In the mouse bioassay, seven samples were neurotoxic, two were non-toxic and one gave a protracted toxic response. One of the non-toxic and the single protracted toxic sample both contained anticholinesterase activity equivalent to 4 micrograms anatoxin-a(s) g-1. The neurotoxic samples contained equivalents to 20-3300 micrograms anatoxin-a(s) g-1. The highest anticholinesterase activities (equivalent to 2300 and 3300 micrograms anatoxin-a(s) g-1, respectively) were found in samples collected from Lake Knud s? in connection with bird-kills in 1993 and 1994. Small amounts of microcystins (0.1-0.9 microgram g-1) were detected in all samples but one. All Lake Knud s? and Lake Ravn s? samples were dominated by Anabaena lemmermannii, and the Lake Salten Langs? sample by several species of Anabaena. Gel filtration profiles indicated similarity between the toxic component from the Lake Knud s? 1994 bloom with registered bird-kills and anatoxin-a(s) isolated from Anabaena flos-aquae NRC-525-17. Anticholinesterase-producing cultures of A. lemmermannii were isolated from the Lake Knud s? 1993 bloom. These laboratory cultures produced anatoxin-a(s) equivalents of 29-743 micrograms g-1. Other cultures of A. lemmermannii isolated from Lake Knud s? and Lake Ravn s? were hepatotoxic or non-toxic. Dead birds collected from Lake Knud s? during the neurotoxic 1993 Anabaena bloom possibly died from cyanobacterial toxicosis. The stomach contents contained colonies and single trichomes of Anabaena, and anticholinesterase activities equivalent to 2.1-89.7 micrograms anatoxin-a(s) kg-1 body weight and microcystins (53-95 ng kg-1) were also detected. 相似文献
103.
104.
In order to observe the transport ability of peritoneum to small molecular substances, peritoneal equilibration test (PET) was performed in 52 CAPD patients. By analysing the relationship between peritoneal transport function and dialysis adequacy, we found the average urea KT/V and Cr were significantly lower in high and low transport groups (n = 6 and n = 2) than in high average and low average groups (n = 35 and n = 9). According to the results of PET, we adjusted the dialysis program of 11 patients and the dialysis adequacy was markedly improved. We concluded that PET was helpful for selecting and adjusting CAPD program, and discussed some questions which should be payed more attention in PET operation. 相似文献
105.
O Tanaka 《Canadian Metallurgical Quarterly》1997,59(4):155-165
BACKGROUND: Arrhythmias are frequent pathology in patients with chronic hemodialysis. We evaluated whether a relatively new technique, signal averaging, could be useful in predicting the development of complex arrhythmias in these patients. METHODS: Thirty-three patients, 18 male and 15 female, subjected to thrice weekly chronic hemodialytic treatment with various dialysis techniques, were studied. Exclusion criteria were the presence of antiarrhythmic and inotropic treatment. The following examinations were carried out in all patients: a Holter dynamic electrocardiography for a duration of 24 hours, begun on the day of dialysis, high resolution ECG pre- and post-dialysis to find out if there were any ventricular late potential (VLP). Four hundred beats were examined in order to obtain a background noise of less than 0.7 microV and a better definition of the signal. The following parameters were considered significant for the presence of VLP: a) filtered QRS duration > 120 msec; b) the root mean square of the signal expressed in the terminal portion of QRS (RMS) < 25 microV) high frequency low amplitude signals duration (HFLA) > 40 msec. A positive value in two of these parameters was considered indicative of the presence of VLP. In addition various pre and post-dialysis indices of dialytic efficiency and a mono and two-dimensional echocardiogram with pulsed and color Doppler were carried out. Of the 33 patients studied, ten were excluded because they presented too high a background noise at the high resolution ECG. Of the remaining 23 patients, 13 (56%) presented VLP and nine of these (69%) presented complex arrhythmias. Of the ten patients without VLP, 5 (50%) presented complex arrhythmias. The incidence of arrhythmias was highest during the last two hours of dialysis and in the two hours following it. The patients were then divided into two groups (A and B) according to the ejection fraction (EF) found at the echocardiogram. Group A was composed of 17 patients of whom 8 (47%) presented complex arrhythmias; group B (EF < 45%) was composed of the remaining six patients, who all presented complex arrhythmias. In group A nine patients (53%) out of 17 had LVP, in group B four out of six (66%) had it. All the patients except one presented an increase in the thickness of the ventricular wall and alterations of Doppler transmitral filling rate. Left ventricular hypertrophy was diagnosed in 22 out of the 23 patients. Four patients also had chronic ischaemic heart disease; of these three had LVP. There was no correlation between the presence of LVP and the hemodialytic indices and between the latter and complex arrhythmias. CONCLUSIONS: Our study showed that arrhythmias are more frequent in patients with LVP before dialysis than in those without. The difference was statistically significant (p < 0.006); the incidence of arrhythmias was higher in patients with FE < 45% (p < 0.001). The majority of patients (95%) had left ventricular hypertrophy; only four (17%) had ischaemic heart disease too. It is highly probable that the presence of LVP in our patients can be attributed to hypertension and subsequent left ventricular hypertrophy. As patients with LVP at the end of dialysis had a greater incidence of arrhythmias than those without LVP, we suggest that this method could be useful as a first screening in dialysed patients. 相似文献
106.
For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing 相似文献
107.
Kemper A. Kilger C. Moerkotte G. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(4):587-608
View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM 相似文献
108.
We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations 相似文献
109.
Solotorevsky G. Gudes E. Meisels A. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(5):681-697
A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem 相似文献
110.
Graefe G. Linville A. Shapiro L.D. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):934-944
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine 相似文献