全文获取类型
收费全文 | 255500篇 |
免费 | 2794篇 |
国内免费 | 871篇 |
专业分类
电工技术 | 4810篇 |
综合类 | 194篇 |
化学工业 | 36221篇 |
金属工艺 | 9518篇 |
机械仪表 | 7557篇 |
建筑科学 | 6143篇 |
矿业工程 | 881篇 |
能源动力 | 7234篇 |
轻工业 | 21189篇 |
水利工程 | 2203篇 |
石油天然气 | 3230篇 |
武器工业 | 15篇 |
无线电 | 34288篇 |
一般工业技术 | 50013篇 |
冶金工业 | 50812篇 |
原子能技术 | 5080篇 |
自动化技术 | 19777篇 |
出版年
2021年 | 2179篇 |
2020年 | 1566篇 |
2019年 | 1923篇 |
2018年 | 3272篇 |
2017年 | 3308篇 |
2016年 | 3405篇 |
2015年 | 2222篇 |
2014年 | 3967篇 |
2013年 | 11481篇 |
2012年 | 6237篇 |
2011年 | 8581篇 |
2010年 | 6911篇 |
2009年 | 7895篇 |
2008年 | 8408篇 |
2007年 | 8299篇 |
2006年 | 7372篇 |
2005年 | 6501篇 |
2004年 | 6289篇 |
2003年 | 6566篇 |
2002年 | 6049篇 |
2001年 | 6526篇 |
2000年 | 5990篇 |
1999年 | 6467篇 |
1998年 | 17167篇 |
1997年 | 11834篇 |
1996年 | 9054篇 |
1995年 | 6755篇 |
1994年 | 6027篇 |
1993年 | 5994篇 |
1992年 | 4149篇 |
1991年 | 4050篇 |
1990年 | 3884篇 |
1989年 | 3675篇 |
1988年 | 3582篇 |
1987年 | 3040篇 |
1986年 | 2956篇 |
1985年 | 3225篇 |
1984年 | 2929篇 |
1983年 | 2837篇 |
1982年 | 2652篇 |
1981年 | 2554篇 |
1980年 | 2490篇 |
1979年 | 2318篇 |
1978年 | 2120篇 |
1977年 | 2669篇 |
1976年 | 3722篇 |
1975年 | 1774篇 |
1974年 | 1730篇 |
1973年 | 1669篇 |
1972年 | 1466篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
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 相似文献
92.
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 相似文献
93.
Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead 相似文献
94.
Several variations of cache-based checkpointing for rollback error recovery from transient errors in shared-memory multiprocessors have been recently developed. By modifying the cache replacement policy, these techniques use the inherent redundancy in the memory hierarchy to periodically checkpoint the computation state. Three schemes, different in the manner in which they avoid rollback propagation, are evaluated in this paper. By simulation with address traces from parallel applications running on an Encore Multimax shared-memory multiprocessor, we evaluate the performance effect of integrating the recovery schemes in the cache coherence protocol. Our results indicate that the cache-based schemes can provide checkpointing capability with low performance overhead, but with uncontrollable high variability in the checkpoint interval 相似文献
95.
McKinley P.K. Xu H. Esfahanian A.-H. Ni L.M. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(12):1252-1265
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log 2 m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given 相似文献
96.
Shrivastava S.K. McCue D.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(4):421-432
The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring 相似文献
97.
98.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach. 相似文献
99.
Vascular injuries may occur as complications of elbow dislocation and usually involve the brachial artery. A case report is presented in which only the radial artery was compromised as a result of the dislocation. 相似文献
100.
The synthesis of ten tris-sydnone imine derivatives, unknown up to now, is described. All compounds are alkyl or arylalkyl substituted in 3-position of the sydnone imine. The most powerful agent was the 3-propyl derivative 6c. It inhibits the aggregation of human platelets induced by collagen in a concentration of 1 mumol/L half maximally. Its N-ethoxycarbonyl derivative 7c, which was designed as a prodrug, showed only small antithrombotic effects in rats. The reason for this low degree of activity is discussed. 相似文献