全文获取类型
收费全文 | 26277篇 |
免费 | 2693篇 |
国内免费 | 2556篇 |
学科分类
工业技术 | 31526篇 |
出版年
2024年 | 86篇 |
2023年 | 286篇 |
2022年 | 493篇 |
2021年 | 551篇 |
2020年 | 750篇 |
2019年 | 692篇 |
2018年 | 673篇 |
2017年 | 851篇 |
2016年 | 989篇 |
2015年 | 1059篇 |
2014年 | 1834篇 |
2013年 | 2278篇 |
2012年 | 2073篇 |
2011年 | 1893篇 |
2010年 | 1527篇 |
2009年 | 1835篇 |
2008年 | 1867篇 |
2007年 | 1890篇 |
2006年 | 1615篇 |
2005年 | 1474篇 |
2004年 | 1137篇 |
2003年 | 954篇 |
2002年 | 779篇 |
2001年 | 708篇 |
2000年 | 564篇 |
1999年 | 471篇 |
1998年 | 366篇 |
1997年 | 295篇 |
1996年 | 226篇 |
1995年 | 217篇 |
1994年 | 182篇 |
1993年 | 144篇 |
1992年 | 128篇 |
1991年 | 101篇 |
1990年 | 91篇 |
1989年 | 95篇 |
1988年 | 66篇 |
1987年 | 31篇 |
1986年 | 29篇 |
1985年 | 28篇 |
1984年 | 25篇 |
1983年 | 18篇 |
1982年 | 11篇 |
1981年 | 17篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1975年 | 11篇 |
1964年 | 8篇 |
1963年 | 9篇 |
1961年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
61.
Qing-Chang Zhong Author Vitae 《Automatica》2003,39(3):499-508
This paper generalizes the frequency-domain results on the delay-type Nehari problem in the stable case to the unstable case. The solvability condition of the delay-type Nehari problem is formulated in terms of the nonsingularity of three matrices. The optimal value γopt is the maximal γ∈(0,∞) such that one of the three matrices becomes singular. All sub-optimal compensators are parameterized in a transparent structure incorporating a modified Smith predictor. 相似文献
62.
由于在机器人导航等领域新的图像装置不符合透视规则,无法运用传统的透视位置估计方法,采用吴氏零点分解方法,给出非透视3点问题的解析解.利用新图像装置的几何条件,建立了非透视3点方程系统. 相似文献
63.
Colzato Lorenza S.; Raffone Antonino; Hommel Bernhard 《Canadian Metallurgical Quarterly》2006,32(3):705
Four experiments were conducted to investigate the relationship between the binding of visual features (as measured by their aftereffects on subsequent binding) and the learning of feature-conjunction probabilities. Both binding and learning effects were obtained, but they did not interact. Interestingly, (shape-color) binding effects disappeared with increasing practice, presumably because of the fact that only 1 of the features involved was relevant to the task. However, this instability was only observed for arbitrary, not highly overlearned combinations of simple geometric features and not for real objects (colored pictures of a banana and strawberry), where binding effects were strong and resistant to practice. These findings suggest that learning has no direct impact on the strength or resistance of bindings or on speed with which features are bound; however, learning does affect the amount of attention particular feature dimensions attract, which again can influence which features are considered in binding. (PsycINFO Database Record (c) 2011 APA, all rights reserved) 相似文献
64.
Curry I. Guinn 《Knowledge》1994,7(4):277-278
Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized. 相似文献
65.
针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析,井提出了改进途径,指出小水电站的联网改造应立足安全,争取效益。 相似文献
66.
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented. 相似文献
67.
68.
The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach. 相似文献
69.
Modeling video sources for real-time scheduling 总被引:1,自引:0,他引:1
What is the impact of the autocorrelation of variable-bit-rate (VBR) sources on real-time scheduling algorithms? Our results show that the impact of long term, or interframe, autocorrelation is negligible, while the impact of short term, or intraframe, autocorrelation can be significant. Such results are essentially independent of the video coding scheme employed. To derive these results, video sequences are modeled as a collection of stationary subsequences called scenes. Within a scene, a statistical model is derived for both the sequence of frames and of slices. The model captures the distribution and the autocorrelation function of real-time video data. In previous work, the pseudoperiodicity of the slice level auto-correlation function made it difficult to develop a simple yet accurate model. We present a generalization of previous methods that can easily capture this pseudoperiodicity and is suited for modeling a greater variety of autocorrelation functions. By simply tuning a few parameters, the model reproduces the statistic behavior of sources with different types and levels of correlation on both the frame and the slice level. 相似文献
70.
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs. 相似文献