全文获取类型
收费全文 | 525287篇 |
免费 | 7110篇 |
国内免费 | 1469篇 |
专业分类
电工技术 | 9559篇 |
综合类 | 526篇 |
化学工业 | 78655篇 |
金属工艺 | 19960篇 |
机械仪表 | 15190篇 |
建筑科学 | 12665篇 |
矿业工程 | 2269篇 |
能源动力 | 14516篇 |
轻工业 | 47053篇 |
水利工程 | 5219篇 |
石油天然气 | 9334篇 |
武器工业 | 37篇 |
无线电 | 59910篇 |
一般工业技术 | 101756篇 |
冶金工业 | 103495篇 |
原子能技术 | 10558篇 |
自动化技术 | 43164篇 |
出版年
2022年 | 3159篇 |
2021年 | 4893篇 |
2020年 | 3477篇 |
2019年 | 4553篇 |
2018年 | 7808篇 |
2017年 | 7607篇 |
2016年 | 7932篇 |
2015年 | 5559篇 |
2014年 | 9241篇 |
2013年 | 24065篇 |
2012年 | 14625篇 |
2011年 | 20142篇 |
2010年 | 15797篇 |
2009年 | 17693篇 |
2008年 | 18089篇 |
2007年 | 17775篇 |
2006年 | 15503篇 |
2005年 | 14208篇 |
2004年 | 13599篇 |
2003年 | 13397篇 |
2002年 | 12633篇 |
2001年 | 12830篇 |
2000年 | 11867篇 |
1999年 | 12594篇 |
1998年 | 32811篇 |
1997年 | 22895篇 |
1996年 | 17446篇 |
1995年 | 13033篇 |
1994年 | 11283篇 |
1993年 | 10972篇 |
1992年 | 7913篇 |
1991年 | 7417篇 |
1990年 | 7261篇 |
1989年 | 7013篇 |
1988年 | 6468篇 |
1987年 | 5766篇 |
1986年 | 5655篇 |
1985年 | 6265篇 |
1984年 | 5900篇 |
1983年 | 5170篇 |
1982年 | 4900篇 |
1981年 | 4966篇 |
1980年 | 4705篇 |
1979年 | 4609篇 |
1978年 | 4408篇 |
1977年 | 5334篇 |
1976年 | 6971篇 |
1975年 | 3796篇 |
1974年 | 3550篇 |
1973年 | 3665篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
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 相似文献
92.
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 相似文献
93.
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 相似文献
94.
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 相似文献
95.
96.
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 相似文献
97.
Weijia Shang O'Keefe M.T. Fortes J.A.B. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(2):193-204
This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes 相似文献
98.
Malloy B.A. Lloyd E.L. Soffa M.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):498-508
A new approach is given for scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors. The key idea in our approach is to exploit the fine grained parallelism present in the instruction stream. In this context, schedules are constructed by a careful balancing of execution and communication costs at the level of individual instructions, and their data dependencies. Three methods are used to evaluate our approach. First, several existing methods are extended to the fine grained situation. Our approach is then compared to these methods using both static schedule length analyses, and simulated executions of the scheduled code. In each instance, our method is found to provide significantly shorter schedules. Second, by varying parameters such as the speed of the instruction set, and the speed/parallelism in the interconnection structure, simulation techniques are used to examine the effects of various architectural considerations on the executions of the schedules. These results show that our approach provides significant speedups in a wide-range of situations. Third, schedules produced by our approach are executed on a two-processor Data General shared memory multiprocessor system. These experiments show that there is a strong correlation between our simulation results, and these actual executions, and thereby serve to validate the simulation studies. Together, our results establish that fine grained parallelism can be exploited in a substantial manner when scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors 相似文献
99.
A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was studied by S. Even and S. Rajsbaum (1990) under the assumption that message transmission delays and processing times are constant. We study the behavior of the simple synchronizer when processing times and transmission delays are random. The main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network per unit time. We analyze the effect of the topology and the probability distributions of the random variables on the behavior of the network. For random variables with exponential distribution, we provide tight (i.e., attainable) bounds and study the effect of a bottleneck processor on the rate 相似文献
100.
We consider the design problem for a class of discrete-time and continuous-time neural networks. We obtain a characterization of all connection weights that store a given set of vectors into the network, that is, each given vector becomes an equilibrium point of the network. We also give sufficient conditions that guarantee the asymptotic stability of these equilibrium points. 相似文献