全文获取类型
收费全文 | 1173篇 |
免费 | 71篇 |
国内免费 | 49篇 |
专业分类
电工技术 | 10篇 |
综合类 | 132篇 |
化学工业 | 8篇 |
金属工艺 | 14篇 |
机械仪表 | 36篇 |
建筑科学 | 5篇 |
矿业工程 | 2篇 |
能源动力 | 7篇 |
轻工业 | 17篇 |
水利工程 | 1篇 |
石油天然气 | 3篇 |
武器工业 | 5篇 |
无线电 | 74篇 |
一般工业技术 | 70篇 |
冶金工业 | 12篇 |
自动化技术 | 897篇 |
出版年
2024年 | 5篇 |
2023年 | 24篇 |
2022年 | 21篇 |
2021年 | 16篇 |
2020年 | 11篇 |
2019年 | 19篇 |
2018年 | 15篇 |
2017年 | 32篇 |
2016年 | 29篇 |
2015年 | 41篇 |
2014年 | 40篇 |
2013年 | 66篇 |
2012年 | 69篇 |
2011年 | 77篇 |
2010年 | 48篇 |
2009年 | 82篇 |
2008年 | 72篇 |
2007年 | 57篇 |
2006年 | 67篇 |
2005年 | 43篇 |
2004年 | 51篇 |
2003年 | 61篇 |
2002年 | 45篇 |
2001年 | 28篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 21篇 |
1997年 | 23篇 |
1996年 | 20篇 |
1995年 | 21篇 |
1994年 | 17篇 |
1993年 | 29篇 |
1992年 | 14篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有1293条查询结果,搜索用时 31 毫秒
61.
《Journal of Computer and System Sciences》2016,82(6):1144-1160
In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we observe an interesting reversal of the pattern. Assuming that #BIS is not equivalent to #SAT under AP-reductions, we show that counting maximal independent sets in bipartite graphs is harder than counting maximum independent sets. Motivated by this, we show that various counting problems involving minimal separators are #SAT-hard to approximate. These problems have applications for constructing triangulations and phylogenetic trees. 相似文献
62.
The bubble-sort graph is an important interconnection network designed from Cayley graph model. One conjecture is proposed in Shi and Lu (2008) [10] as follows: for any integer n?2, if n is odd then bubble-sort graph Bn is a union of edge-disjoint hamiltonian cycles; if n is even then bubble-sort graph Bn is a union of edge-disjoint hamiltonian cycles and its perfect matching that has no edges in common with the hamiltonian cycles. In this paper, we prove that conjecture is true for n=5,6. 相似文献
63.
Omid Amini Fedor V. Fomin Saket Saurabh 《Journal of Computer and System Sciences》2011,77(6):1159-1171
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well-known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems has been intensively studied in planar graphs and in graphs excluding a fixed graph H as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems. 相似文献
64.
Matthias B. StuartAuthor Vitae Jens SparsøAuthor Vitae 《Microprocessors and Microsystems》2011,35(7):632-642
This paper presents an analytical method to derive the worst-case traffic pattern caused by a task graph mapped to a cache-coherent shared-memory system. Our analysis allows designers to rapidly evaluate the impact of different mappings of tasks to IP cores on the traffic pattern. The accuracy varies with the application’s data sharing pattern, and is around 65% in the average case and 1% in the best case when considering the traffic pattern as a whole. For individual connections, our method produces tight worst-case bandwidths. 相似文献
65.
In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions. 相似文献
66.
67.
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer. A Hamiltonian cycle in a graph is a simple cycle in which each vertex of the graph appears exactly once. The Hamiltonian cycle problem is to determine whether or not a graph contains a Hamiltonian cycle. The best result for the Hamiltonian cycle problem on circular-arc graphs is an O(n2logn)-time algorithm, where n is the number of vertices of the input graph. In fact, the O(n2logn)-time algorithm can be modified as a certifying algorithm although it was published before the term certifying algorithms appeared in the literature. However, whether there exists an algorithm whose time complexity is better than O(n2logn) for solving the Hamiltonian cycle problem on circular-arc graphs has been opened for two decades. In this paper, we present an O(Δn)-time certifying algorithm to solve this problem, where Δ represents the maximum degree of the input graph. The certificates provided by our algorithm can be authenticated in O(n) time. 相似文献
68.
自然语言处理中的逻辑词 总被引:4,自引:0,他引:4
词是自然语言处理中最基本的单位,在当今知识表示领域,知识图作为自然语言理解的语义模型有其独到之处。本文从语言学和逻辑学的角度,首次提出并探讨了逻辑词研究逻辑词分类及如何用知识图表示各类逻辑词的结构。对自然语言处理中研究复句和篇章的理解提供了一种新的途径。 相似文献
69.
Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting)
intervals has been considered in the sequential model. In this paper we present parallel algorithms for computing maximum
cardinality matchings among pairs of disjoint intervals in interval graphs in the EREW PRAM and hypercube models. For the
general case of the problem, our algorithms compute a maximum matching in O( log
3
n) time using O(n/ log
2
n) processors on the EREW PRAM and using n processors on the hypercubes. For the case of proper interval graphs, our algorithm runs in O( log n ) time using O(n) processors if the input intervals are not given already sorted and using O(n/ log n ) processors otherwise, on the EREW PRAM. On n -processor hypercubes, our algorithm for the proper interval case takes O( log n log log n ) time for unsorted input and O( log n ) time for sorted input. Our parallel results also lead to optimal sequential algorithms for computing maximum matchings
among disjoint intervals. In addition, we present an improved parallel algorithm for maximum matching between overlapping
intervals in proper interval graphs.
Received November 20, 1995; revised September 3, 1998. 相似文献
70.
In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We provide bounds for 5≤d≤12. We also give empirical values of the size of the bisection found by the algorithm for some small values of d and compare them with numerical approximations of our theoretical bounds. Our analysis also gives asymptotic lower bounds for the size of the maximum bisection. 相似文献