全文获取类型
收费全文 | 1652篇 |
免费 | 238篇 |
国内免费 | 182篇 |
专业分类
电工技术 | 179篇 |
综合类 | 187篇 |
化学工业 | 37篇 |
金属工艺 | 43篇 |
机械仪表 | 227篇 |
建筑科学 | 65篇 |
矿业工程 | 23篇 |
能源动力 | 17篇 |
轻工业 | 14篇 |
水利工程 | 19篇 |
石油天然气 | 44篇 |
武器工业 | 18篇 |
无线电 | 210篇 |
一般工业技术 | 101篇 |
冶金工业 | 32篇 |
原子能技术 | 11篇 |
自动化技术 | 845篇 |
出版年
2024年 | 6篇 |
2023年 | 30篇 |
2022年 | 42篇 |
2021年 | 40篇 |
2020年 | 44篇 |
2019年 | 41篇 |
2018年 | 41篇 |
2017年 | 57篇 |
2016年 | 74篇 |
2015年 | 85篇 |
2014年 | 128篇 |
2013年 | 84篇 |
2012年 | 135篇 |
2011年 | 149篇 |
2010年 | 92篇 |
2009年 | 112篇 |
2008年 | 118篇 |
2007年 | 106篇 |
2006年 | 118篇 |
2005年 | 100篇 |
2004年 | 84篇 |
2003年 | 73篇 |
2002年 | 61篇 |
2001年 | 36篇 |
2000年 | 43篇 |
1999年 | 29篇 |
1998年 | 22篇 |
1997年 | 21篇 |
1996年 | 20篇 |
1995年 | 18篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1963年 | 1篇 |
排序方式: 共有2072条查询结果,搜索用时 15 毫秒
1.
In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time. 相似文献
2.
Christos Bouras Agisilaos Konidaris 《International Journal of Communication Systems》2005,18(2):119-142
Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on ‘Web Components’ but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
3.
This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity. 相似文献
4.
5.
应用现代可靠性理论,从设计、工艺、技术等方面对油田集输系统进行了可靠性探讨,提出了增强系统可靠性的措施。 相似文献
6.
P. I. Stetsyuk 《Cybernetics and Systems Analysis》2006,42(1):54-64
New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found
by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the
models proposed. Recommendations on how to develop its strengthened analogs are given.
This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006. 相似文献
7.
In target detection tasks, responses are faster when displays have 2 targets (redundant-targets effect; RTE) and slower when they have no targets (nontargets effect; NTE) relative to displays with a single target. The psychological refractory period paradigm was used to localize these effects. In Experiment 1, participants classified tones as high or low and then classified letters as targets or nontargets after a short or long stimulus onset asynchrony (SOA). The magnitudes of the RTE and NTE did not depend on SOA. In Experiment 2, the order of the tasks was reversed, and at short SOAs the RTE and NTE had similar magnitudes for both tone discrimination and target detection responses. These findings suggest that the RTE and NTE arise during response selection. Interactive effects of tone pitch with the number and type of target features were also observed, and these were tentatively interpreted as synesthetic effects. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.