全文获取类型
收费全文 | 3315篇 |
免费 | 316篇 |
国内免费 | 314篇 |
专业分类
电工技术 | 275篇 |
综合类 | 300篇 |
化学工业 | 78篇 |
金属工艺 | 36篇 |
机械仪表 | 137篇 |
建筑科学 | 284篇 |
矿业工程 | 79篇 |
能源动力 | 32篇 |
轻工业 | 26篇 |
水利工程 | 27篇 |
石油天然气 | 874篇 |
武器工业 | 30篇 |
无线电 | 295篇 |
一般工业技术 | 136篇 |
冶金工业 | 37篇 |
原子能技术 | 14篇 |
自动化技术 | 1285篇 |
出版年
2024年 | 5篇 |
2023年 | 15篇 |
2022年 | 49篇 |
2021年 | 60篇 |
2020年 | 77篇 |
2019年 | 49篇 |
2018年 | 54篇 |
2017年 | 73篇 |
2016年 | 96篇 |
2015年 | 107篇 |
2014年 | 185篇 |
2013年 | 188篇 |
2012年 | 298篇 |
2011年 | 286篇 |
2010年 | 218篇 |
2009年 | 241篇 |
2008年 | 233篇 |
2007年 | 273篇 |
2006年 | 251篇 |
2005年 | 196篇 |
2004年 | 163篇 |
2003年 | 145篇 |
2002年 | 111篇 |
2001年 | 93篇 |
2000年 | 73篇 |
1999年 | 63篇 |
1998年 | 58篇 |
1997年 | 54篇 |
1996年 | 44篇 |
1995年 | 33篇 |
1994年 | 34篇 |
1993年 | 15篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 7篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 10篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 3篇 |
排序方式: 共有3945条查询结果,搜索用时 31 毫秒
101.
We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be
used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between
this game-theoretic approach and graph decompositions called q
-branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard)
tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q≥0, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm
for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required
to search a graph with the minimum number of searchers.
Additional support of F.V. Fomin by the Research Council of Norway.
Additional supports of P. Fraigniaud from the INRIA Project “Grand Large”, and from the Project PairAPair of the ACI “Masse de Données”.
Additional supports of N. Nisse from the Project Fragile of the ACI “Sécurité & Informatique”. 相似文献
102.
Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network intruders, in: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO, in: LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70–84] introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to clear a contaminated graph in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. Moreover, the clearing of the graph must be performed using the optimal number of searchers, i.e. the minimum number of searchers sufficient to clear the graph in a monotone connected way in a centralized setting. We show that the minimum number of bits of advice permitting the monotone connected and optimal clearing of a network in a distributed setting is Θ(nlogn), where n is the number of nodes of the network. More precisely, we first provide a labelling of the vertices of any graph G, using a total of O(nlogn) bits, and a protocol using this labelling that enables the optimal number of searchers to clear G in a monotone connected distributed way. Then, we show that this number of bits of advice is optimal: any distributed protocol requires Ω(nlogn) bits of advice to clear a network in a monotone connected way, using an optimal number of searchers. 相似文献
103.
104.
摘 要 多字符串模式匹配是在给定的文本中并行查找多个模式串的一种方法。本文中提出THT-MSMA多模式匹配算法,该算法采用双哈希表来减少尝试比较的次数。分析表明,该算法适合于最短模式串长度很长的环境,时间复杂度要低于经典的算法,尝试比较次数少于传统的多模式匹配算法。最后,实验结果表明,THT-MSMA算法具有良好的时空性能。 相似文献
105.
106.
Distributed adaptive control for vehicular platoon with unknown dead‐zone inputs and velocity/acceleration disturbances 下载免费PDF全文
This paper is focused on designing a distributed adaptive control scheme for a vehicular platoon with unknown bounded velocity/acceleration disturbances and unknown nonlinear dead‐zone inputs. Our aim is to design distributed adaptive controllers based on integral sliding mode control techniques that guarantee practical exponential convergence (i.e., exponential stability of an arbitrarily small neighborhood of zero) of the spacing errors and the string stability of the whole vehicular platoon. The contributions of this paper are that: (i) based on a modified constant time headway policy, the whole vehicular platoon is guaranteed to have string stability despite dead zone inputs; (ii) adaptive compensation terms are constructed to compensate for the time‐variant effects caused by unknown bounded velocity/acceleration disturbances, and unknown dead zone inputs; (iii) an efficient numerical method for avoiding the singularity problem of the control law is also proposed. Numerical simulation results show the validity and advantages of the proposed method are significantly higher traffic density and string stability. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
107.
Li-Vang Lozada-Chang 《Information Sciences》2011,181(11):2340-2355
In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints. 相似文献
108.
We consider a variant of the graph searching games that models the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents aims at processing, or clearing, the vertices of a digraph D. We are interested in two different measures: (1) the total number of agents used, and (2) the total number of vertices occupied by an agent during the processing of D. These measures, respectively, correspond to the maximum number of simultaneous connections interrupted and to the total number of interruptions during a routing reconfiguration in a WDM network.Previous works have studied the problem of independently minimizing each of these parameters. In particular, the corresponding minimization problems are APX-hard, and the first one is known not to be in APX. In this paper, we give several complexity results and study tradeoffs between these conflicting objectives. In particular, we show that minimizing one of these parameters while the other is constrained is NP-complete. Then, we prove that there exist some digraphs for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even for a basic class of digraphs. On the other hand, we exhibit classes of graphs for which good tradeoffs can be achieved. We finally detail the relationship between this game and the routing reconfiguration problem. In particular, we prove that any instance of the processing game, i.e. any digraph, corresponds to an instance of the routing reconfiguration problem. 相似文献
109.
Roland H. C. Yap 《Constraints》2001,6(2-3):157-172
Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries. 相似文献
110.
由于SAR和可见光成象传感器图象的物理特征不同,因此进行匹配难度很大。本文在深入分析了这两种传感器图象物理特征的基础上,提出了一种图象匹配的新方法。该方法运用形态学滤波方法去除SAR图象斑点噪声,利用图象的边缘特征进行匹配,并采用多分辨率分级搜索技术减少计算量,在对实验结果进行分析的基础上提出了搜索真实匹配位置的原则,大大提高了匹配的准确率。通过实验对SAR图象斑点噪声滤波和SAR与可见光图象匹配算法进行了验证,实验证明本算法的SAR图象去噪效果明显优于传统的Frost方法,图象匹配精度高,稳定性好。 相似文献