全文获取类型
收费全文 | 1546篇 |
免费 | 105篇 |
国内免费 | 95篇 |
专业分类
电工技术 | 35篇 |
技术理论 | 1篇 |
综合类 | 203篇 |
化学工业 | 37篇 |
金属工艺 | 14篇 |
机械仪表 | 52篇 |
建筑科学 | 50篇 |
矿业工程 | 22篇 |
能源动力 | 53篇 |
轻工业 | 23篇 |
水利工程 | 7篇 |
石油天然气 | 8篇 |
武器工业 | 6篇 |
无线电 | 90篇 |
一般工业技术 | 84篇 |
冶金工业 | 65篇 |
原子能技术 | 5篇 |
自动化技术 | 991篇 |
出版年
2024年 | 4篇 |
2023年 | 28篇 |
2022年 | 30篇 |
2021年 | 32篇 |
2020年 | 34篇 |
2019年 | 38篇 |
2018年 | 21篇 |
2017年 | 40篇 |
2016年 | 41篇 |
2015年 | 55篇 |
2014年 | 70篇 |
2013年 | 83篇 |
2012年 | 92篇 |
2011年 | 112篇 |
2010年 | 74篇 |
2009年 | 100篇 |
2008年 | 106篇 |
2007年 | 90篇 |
2006年 | 91篇 |
2005年 | 67篇 |
2004年 | 61篇 |
2003年 | 70篇 |
2002年 | 61篇 |
2001年 | 37篇 |
2000年 | 35篇 |
1999年 | 25篇 |
1998年 | 24篇 |
1997年 | 24篇 |
1996年 | 21篇 |
1995年 | 21篇 |
1994年 | 17篇 |
1993年 | 28篇 |
1992年 | 16篇 |
1991年 | 15篇 |
1990年 | 7篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1968年 | 2篇 |
排序方式: 共有1746条查询结果,搜索用时 296 毫秒
71.
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a graph G=(VG,EG) is the k-simplicial power of a graph H=(VH,EH) (H a root graph of G) if VG is the set of all simplicial vertices of H, and for all distinct vertices x and y in VG, xyEG if and only if the distance in H between x and y is at most k. This concept generalizes k-leaf powers introduced by Nishimura, Ragde and Thilikos which were motivated by the search for underlying phylogenetic trees; k-leaf powers are the k-simplicial powers of trees. Recently, a lot of work has been done on k-leaf powers and their roots as well as on their variants phylogenetic roots and Steiner roots. For k≤5, k-leaf powers can be recognized in linear time, and for k≤4, structural characterizations are known. For k≥6, the recognition and characterization problems of k-leaf powers are still open. Since trees and block graphs (i.e., connected graphs whose blocks are cliques) have very similar metric properties, it is natural to study k-simplicial powers of block graphs. We show that leaf powers of trees and simplicial powers of block graphs are closely related, and we study simplicial powers of other graph classes containing all trees such as ptolemaic graphs and strongly chordal graphs. 相似文献
72.
Stock market investors value accurate forecasting of future stock price from trading systems because of the potential for large profits. Thus, investors use different forecasting models, such as the time-series model, to assemble a superior investment portfolio. Unfortunately, there are three major drawbacks to the time-series model: (1) most statistical methods rely on some assumptions about the variables; (2) most conventional time-series models use only one variable in forecasting; and (3) the rules mined from artificial neural networks are not easily understandable. To address these shortcomings, this study proposes a new model based on multi-stock volatility causality, a fusion adaptive-network-based fuzzy inference system (ANFIS) procedure, for forecasting stock price problems in Taiwan. Furthermore, to illustrate the proposed model, three practical, collected stock index datasets from the USA and Taiwan stock markets are used in the empirical experiment. The experimental results indicate that the proposed model is superior to the listing methods in terms of root mean squared error, and further evaluation reveals that the profits comparison results for the proposed model produce higher profits than the listing models. 相似文献
73.
74.
《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. 相似文献
75.
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. 相似文献
76.
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. 相似文献
77.
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. 相似文献
78.
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. 相似文献
79.
80.
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. 相似文献