全文获取类型
收费全文 | 459237篇 |
免费 | 5893篇 |
国内免费 | 1426篇 |
专业分类
电工技术 | 8015篇 |
综合类 | 452篇 |
化学工业 | 71251篇 |
金属工艺 | 16656篇 |
机械仪表 | 13725篇 |
建筑科学 | 11497篇 |
矿业工程 | 1894篇 |
能源动力 | 11614篇 |
轻工业 | 48048篇 |
水利工程 | 4275篇 |
石油天然气 | 6826篇 |
武器工业 | 37篇 |
无线电 | 53953篇 |
一般工业技术 | 84632篇 |
冶金工业 | 85972篇 |
原子能技术 | 8663篇 |
自动化技术 | 39046篇 |
出版年
2021年 | 3658篇 |
2019年 | 3447篇 |
2018年 | 5672篇 |
2017年 | 5648篇 |
2016年 | 6213篇 |
2015年 | 4117篇 |
2014年 | 7049篇 |
2013年 | 20788篇 |
2012年 | 11913篇 |
2011年 | 16647篇 |
2010年 | 12984篇 |
2009年 | 14566篇 |
2008年 | 15240篇 |
2007年 | 15391篇 |
2006年 | 14018篇 |
2005年 | 12536篇 |
2004年 | 12034篇 |
2003年 | 11770篇 |
2002年 | 11374篇 |
2001年 | 11550篇 |
2000年 | 10813篇 |
1999年 | 11236篇 |
1998年 | 26748篇 |
1997年 | 18756篇 |
1996年 | 14297篇 |
1995年 | 10972篇 |
1994年 | 9688篇 |
1993年 | 9511篇 |
1992年 | 7127篇 |
1991年 | 6639篇 |
1990年 | 6663篇 |
1989年 | 6367篇 |
1988年 | 6151篇 |
1987年 | 5150篇 |
1986年 | 5109篇 |
1985年 | 6105篇 |
1984年 | 5630篇 |
1983年 | 5120篇 |
1982年 | 4780篇 |
1981年 | 4923篇 |
1980年 | 4639篇 |
1979年 | 4413篇 |
1978年 | 4304篇 |
1977年 | 4834篇 |
1976年 | 6180篇 |
1975年 | 3715篇 |
1974年 | 3504篇 |
1973年 | 3712篇 |
1972年 | 2915篇 |
1971年 | 2720篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
Douay M. Xie W.X. Taunay T. Bernage P. Niay P. Cordier P. Poumellec B. Dong L. Bayon J.F. Poignant H. Delevaque E. 《Lightwave Technology, Journal of》1997,15(8):1329-1342
A comprehensive survey of photosensitivity in silica glasses and optical fiber is reviewed. Recent work on understanding the mechanisms contributing to germanium or aluminum doped fiber photosensitivity is discussed within the framework of photoelastic densification models 相似文献
82.
The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency 相似文献
83.
Approaches to using visual language in a cultural context can be placed on a continuum, with global (universal) on one end and culture-focused on the other. Each approach reveals contrasting assumptions about three central design issues: perception, aesthetics and pragmatics. The global approach is characterized by attempts to invent an objective, universal visual language or to define such a language through perceptual principles and empirical research. The culture-focused perspective is founded on the principle that visual communication is intimately bound to experience and hence can function only within a given cultural context, to which designers must be sensitive. While the modernist, universal approach has been losing ground to the postmodern, culture-focused approach, the two complement each other in a variety of ways and, depending on the rhetorical situation, offer pragmatic benefits and drawbacks 相似文献
84.
85.
John C. Hart Gordon W. Lescinsky Daniel J. Sandin Thomas A. DeFanti Louis H. Kauffman 《The Visual computer》1993,9(7):346-355
The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well. 相似文献
86.
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 相似文献
87.
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 相似文献
88.
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 相似文献
89.
It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B+trees. The effectiveness of the B +tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B+tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described 相似文献
90.
We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes 相似文献