全文获取类型
收费全文 | 3098篇 |
免费 | 118篇 |
国内免费 | 16篇 |
专业分类
电工技术 | 47篇 |
综合类 | 13篇 |
化学工业 | 506篇 |
金属工艺 | 57篇 |
机械仪表 | 88篇 |
建筑科学 | 135篇 |
矿业工程 | 1篇 |
能源动力 | 95篇 |
轻工业 | 181篇 |
水利工程 | 27篇 |
石油天然气 | 7篇 |
无线电 | 559篇 |
一般工业技术 | 522篇 |
冶金工业 | 484篇 |
原子能技术 | 13篇 |
自动化技术 | 497篇 |
出版年
2024年 | 5篇 |
2023年 | 19篇 |
2022年 | 37篇 |
2021年 | 62篇 |
2020年 | 40篇 |
2019年 | 50篇 |
2018年 | 67篇 |
2017年 | 62篇 |
2016年 | 62篇 |
2015年 | 59篇 |
2014年 | 89篇 |
2013年 | 190篇 |
2012年 | 124篇 |
2011年 | 150篇 |
2010年 | 125篇 |
2009年 | 146篇 |
2008年 | 162篇 |
2007年 | 175篇 |
2006年 | 144篇 |
2005年 | 113篇 |
2004年 | 112篇 |
2003年 | 99篇 |
2002年 | 96篇 |
2001年 | 70篇 |
2000年 | 67篇 |
1999年 | 72篇 |
1998年 | 162篇 |
1997年 | 119篇 |
1996年 | 85篇 |
1995年 | 54篇 |
1994年 | 59篇 |
1993年 | 46篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 22篇 |
1989年 | 36篇 |
1988年 | 26篇 |
1987年 | 22篇 |
1986年 | 33篇 |
1985年 | 25篇 |
1984年 | 19篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 8篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1973年 | 5篇 |
排序方式: 共有3232条查询结果,搜索用时 0 毫秒
51.
Oi-Lam Ng Nathalie Sinclair 《Canadian Journal of Science, Mathematics, & Technology Education》2013,13(1):84-101
AbstractIn this article, we report on two lessons aimed at introducing junior high school students to the idea of shearing in a touchscreen dynamic geometry environment. By using shearing, we hoped to shift students’ attention away from a formula-driven, computational conception of area toward a more geometric one. We found that the students were able to solve several problems involving the comparison of polygons based on verbal and diagrammatic explanations. We describe the features of the touchscreen dynamic geometry technology that supported their learning, as well as the specific role that the teacher played in modeling students’ reasoning about area. 相似文献
52.
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend
learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams
poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the high data arrival
rate of data streams, the combinatorial explosion of itemsets exacerbates the mining task. The high complexity of the FI mining
problem hinders the application of the stream mining techniques. We recognize that a critical review of existing techniques
is needed in order to design and develop efficient mining algorithms and data structures that are able to match the processing
rate of the mining with the high arrival rate of data streams. Within a unifying set of notations and terminologies, we describe
in this paper the efforts and main techniques for mining data streams and present a comprehensive survey of a number of the
state-of-the-art algorithms on mining frequent itemsets over data streams. We classify the stream-mining techniques into two
categories based on the window model that they adopt in order to provide insights into how and why the techniques are useful.
Then, we further analyze the algorithms according to whether they are exact or approximate and, for approximate approaches, whether they are false-positive or false-negative. We also discuss various interesting issues, including the merits and limitations in existing research and substantive areas
for future research. 相似文献
53.
Inverse sampling suggests one continues to sample subjects until a pre-specified number of rare events of interest is observed. It is generally considered to be more appropriate than the usual binomial sampling when the subjects come sequentially, when the response probability is rare, and when maximum likelihood estimators of some epidemiological measures are undefined under binomial sampling. Reliable but conservative exact conditional procedure for the ratio of the response probabilities of subject without the attribute of interest has been studied. However, such a procedure is inapplicable to the risk ratio (i.e., ratio of the response probabilities of subject with the attribute of interest). In this paper, we investigate various test statistics (namely Wald-type, score and likelihood ratio test statistics) for testing non-unity risk ratio under standard inverse sampling scheme, which suggests one continue to sample until the predetermined number of index subjects with the attributes of interest is observed. Both asymptotic and numerical approximate unconditional methods are considered for P-value calculation. Performance of these test procedures are evaluated under different settings by means of Monte Carlo simulation. In general, the Wald-type test statistic is preferable for its satisfactory and stable performance with approximate unconditional procedures. The methodologies are illustrated with a real example from a heart disease study. 相似文献
54.
Errors in measurement of the object illumination angle affect fringe interpretation accuracies in speckle interferometry. To measure the object illumination angle we propose a method based on the moiré effect. The technique is easy to implement and was found to yield fast and accurate measurements. 相似文献
55.
A white-light reconstruction setup for shearograms using optical-fiber waveguides is presented. The setup is compact, is not susceptible to dust and scratches, and enables the two-dimensional fringe pattern on shearograms to be viewed directly under uniform and enhanced illumination with minimal image distortion. 相似文献
56.
Discusses the inclusion of anatomical constraints and anisotropy in static Electrical Impedance Tomography (EIT) using a two-step approach to EIT. In the first step, the boundaries between regions of different conductivities are anatomically constrained using Magnetic Resonance Imaging (MRI) data. In the second step, the conductivity values in different regions are determined. Anisotropic conductivity regions are included to allow better modeling of the muscle regions (e.g., skeletal muscle) which exhibit a greater conductivity in the direction parallel to the muscle fiber. This two-step approach is used to reconstruct the conductivity profile of a canine torso, illustrating its potential application in extracting conductivity values for bioelectric modeling. 相似文献
57.
The circular-harmonic-function correlation filter originally proposed by Hsu and Arsenault [Appl. Opt. 21, 4016 (1982)] for in-plane rotation invariance uses only one harmonic, which results in poor discrimination capability of the filter. Various methods to use multiple harmonics were explored previously by different researchers. We present a new method to combine multiple circular harmonics into a single filter that can provide the desired correlation response to in-plane rotation while minimizing the correlation-plane energy. Since multiple harmonics are included, the filter can discriminate well, and since correlation-plane energy is minimized, correlation peaks tend to be sharp. Since the designer can specify the desired in-plane rotation response, a variety of filter behaviors (including complete invariance to input rotations) can be obtained. Underlying theory is discussed, and simulation results are presented. 相似文献
58.
We study online scheduling on two unbounded parallel-batching machines with limited restarts to minimize the makespan. In this system jobs arrive over time and a batch can be restarted if and only if all the jobs in it have never been restarted. To tackle this difficult problem, we make the second-restart assumption whereby we can only interrupt a running batch B at time t if both machines are busy at time t and batch B has a later starting time than the other running batch. For this case, we provide a best online algorithm with a competitive ratio . For the general problem, we show that no online algorithms can have a competitive ratio less than 1.298, leaving a gap from 1.298 to 1.366. 相似文献
59.
60.
The computational complexity of scheduling jobs with released dates on an unbounded batch processing machine to minimize total completion time and on parallel unbounded batch processing machines to minimize total weighted completion time remains open. In this note we show that the first problem is NP-hard with respect to id-encoding, and the second one is strongly NP-hard. 相似文献