全文获取类型
收费全文 | 700272篇 |
免费 | 11035篇 |
国内免费 | 2214篇 |
专业分类
电工技术 | 12531篇 |
综合类 | 691篇 |
化学工业 | 104574篇 |
金属工艺 | 25585篇 |
机械仪表 | 20152篇 |
建筑科学 | 17507篇 |
矿业工程 | 2709篇 |
能源动力 | 19694篇 |
轻工业 | 65287篇 |
水利工程 | 6587篇 |
石油天然气 | 10901篇 |
武器工业 | 41篇 |
无线电 | 82765篇 |
一般工业技术 | 133106篇 |
冶金工业 | 137682篇 |
原子能技术 | 12769篇 |
自动化技术 | 60940篇 |
出版年
2021年 | 6044篇 |
2020年 | 4456篇 |
2019年 | 5651篇 |
2018年 | 9479篇 |
2017年 | 9325篇 |
2016年 | 9883篇 |
2015年 | 7001篇 |
2014年 | 11626篇 |
2013年 | 32736篇 |
2012年 | 18879篇 |
2011年 | 26469篇 |
2010年 | 20717篇 |
2009年 | 23241篇 |
2008年 | 24012篇 |
2007年 | 23658篇 |
2006年 | 21038篇 |
2005年 | 19201篇 |
2004年 | 18419篇 |
2003年 | 18189篇 |
2002年 | 17194篇 |
2001年 | 17427篇 |
2000年 | 16137篇 |
1999年 | 17243篇 |
1998年 | 44041篇 |
1997年 | 30751篇 |
1996年 | 23399篇 |
1995年 | 17618篇 |
1994年 | 15333篇 |
1993年 | 15029篇 |
1992年 | 10773篇 |
1991年 | 10114篇 |
1990年 | 9819篇 |
1989年 | 9469篇 |
1988年 | 8917篇 |
1987年 | 7687篇 |
1986年 | 7509篇 |
1985年 | 8651篇 |
1984年 | 8025篇 |
1983年 | 7151篇 |
1982年 | 6716篇 |
1981年 | 6860篇 |
1980年 | 6422篇 |
1979年 | 6201篇 |
1978年 | 5866篇 |
1977年 | 7062篇 |
1976年 | 9180篇 |
1975年 | 5061篇 |
1974年 | 4743篇 |
1973年 | 4941篇 |
1972年 | 3928篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
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 相似文献
992.
A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N3 processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1⩽d⩽log N, if O(d) time is allowed 相似文献
993.
Moser L.E. Melliar-Smith P.M. Agrawala V. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):459-473
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols 相似文献
994.
Nicol D.M. Greenberg A.G. Lubachevsky B.D. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(8):849-859
Considers the use of massively parallel architectures to execute a trace-driven simulation of a single cache set. A method is presented for the least-recently-used (LRU) policy, which, regardless of the set size C, runs in time O(log N) using N processors on the EREW (exclusive read, exclusive write) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. We present timings of this algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference-based line replacement policies are considered, which includes LRU as well as the least-frequently-used (LFU) and random replacement policies. A simulation method is presented for any such policy that, on any trace of length N directed to a C line set, runs in O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation 相似文献
995.
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 相似文献
996.
in the above paper Yu (IEEE Trans. Neural Networks, vol.3, no.6, p.1019-21 (1992)) claims to prove that local minima do not exist in the error surface of backpropagation networks being trained on data with t distinct input patterns when the network is capable of exactly representing arbitrary mappings on t input patterns. The commenter points out that the proof presented is flawed, so that the resulting claims remain unproved. In reply, Yu points out that the undesired phenomenon that was sited can be avoided by simply imposing the arbitrary mapping capacity of the network on lemma 1 in the article. 相似文献
997.
998.
Different hierarchical models in pattern analysis and recognition are proposed, based on occurrence probability of patterns. As an important application of recognizing handprinted characters, three typical kinds of hierarchical models such asM
89-89,M
89-36 andM
36-36 have been presented, accompanied by the computer algorithms for computing recognition rates of pattern parts. Moreover, a comparative study of their recognition rates has been conducted theoretically; and numerical experiments have been carried out to verify the analytical conclusions made. Various hierarchical models deliberated in this paper can provide users more or better choices of pattern models in practical application, and lead to a uniform computational scheme (or code). The recognition rates of parts can be improved remarkably by a suitable hierarchical model. For the modelM
89-36 in which case some of the Canadian standard handprinted characters have multiple occurrence probabilities, the total mean recognition rates of the given sample may reach 120% of that by the model proposed by Li et al., and 156% of that obtained from the subjective experiments reported by Suen. 相似文献
999.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献
1000.
Taking advantage of the structure of logical representations, we report an algorithm that evaluates conjunctive queries in a massively parallel environment under an object-based representation for deductive databases. By distributing objects in a database, we show that parallel evaluation of a query can be achieved in a cooperative way so that the conventional tuple-by-tuple, operation-by-operation evaluation strategy can be replaced by a global, parallel matching approach. With the proposed scheme, all conjuncts of a given query can be examined at the same time, which enables us to eliminate the need of any temporary relation. On the other hand, compared with the interpretive method, we show that any data dependency imposed by shared variables is no longer a major problem in achieving AND-parallelism by the proposed scheme 相似文献