全文获取类型
收费全文 | 2572篇 |
免费 | 196篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 39篇 |
综合类 | 1篇 |
化学工业 | 658篇 |
金属工艺 | 51篇 |
机械仪表 | 46篇 |
建筑科学 | 68篇 |
矿业工程 | 4篇 |
能源动力 | 90篇 |
轻工业 | 251篇 |
水利工程 | 21篇 |
石油天然气 | 2篇 |
无线电 | 232篇 |
一般工业技术 | 541篇 |
冶金工业 | 146篇 |
原子能技术 | 18篇 |
自动化技术 | 605篇 |
出版年
2024年 | 4篇 |
2023年 | 39篇 |
2022年 | 65篇 |
2021年 | 114篇 |
2020年 | 85篇 |
2019年 | 78篇 |
2018年 | 81篇 |
2017年 | 84篇 |
2016年 | 109篇 |
2015年 | 94篇 |
2014年 | 123篇 |
2013年 | 170篇 |
2012年 | 205篇 |
2011年 | 229篇 |
2010年 | 172篇 |
2009年 | 150篇 |
2008年 | 153篇 |
2007年 | 128篇 |
2006年 | 128篇 |
2005年 | 81篇 |
2004年 | 73篇 |
2003年 | 62篇 |
2002年 | 42篇 |
2001年 | 26篇 |
2000年 | 21篇 |
1999年 | 24篇 |
1998年 | 49篇 |
1997年 | 33篇 |
1996年 | 16篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 5篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1979年 | 6篇 |
1975年 | 3篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1967年 | 1篇 |
1931年 | 1篇 |
排序方式: 共有2773条查询结果,搜索用时 31 毫秒
81.
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”. 相似文献
82.
Xavier Maurice Anders Sandholm Nicolas Pronost Ronan Boulic Daniel Thalmann 《The Visual computer》2009,25(9):835-842
Today, to create and to simulate a virtual anatomical version of a subject is useful in the decision process of surgical treatments.
The muscular activity is one of the factors which can contribute to abnormal movements such as in spasticity or static contracture.
In this paper, we propose a numerical solution, based on the Finite Element (FE) method, able to estimate muscles deformations
during contraction. Organized around a finite element solver and a volumetric environment, this solution is made of all the
modeling and simulation processes from the discretization of the studied domain to the visualization of the results. The choices
of materials and properties of the FE model are also presented such as the hyperelasticity, the contention model based on
inter-meshes neighboring nodes pairing, and the estimation of nodal forces based on the subject-specific muscular forces and
action lines.
相似文献
Nicolas PronostEmail: |
83.
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. 相似文献
84.
85.
86.
Claudio Schepke Nicolas Maillard Philippe O. A. Navaux 《International journal of parallel programming》2009,37(6):593-611
This paper presents and discusses a blocked parallel implementation of bi- and three-dimensional versions of the Lattice Boltzmann
Method. This method is used to represent and simulate fluid flows following a mesoscopic approach. Most traditional parallel
implementations use simple data distribution strategies to parallelize the operations on the regular fluid data set. However,
it is well known that block partitioning is usually better. Such a parallel implementation is discussed and its communication
cost is established. Fluid flows simulations crossing a cavity have also been used as a real-world case study to evaluate
our implementation. The presented results with our blocked implementation achieve a performance up to 31% better than non-blocked
versions, for some data distributions. Thus, this work shows that blocked, parallel implementations can be efficiently used
to reduce the parallel execution time of the method. 相似文献
87.
In this paper we explore the interest of computational intelligence tools in the management of heterogeneous communication networks, specifically to predict congestion, failures and other anomalies in the network that may eventually lead to degradation of the quality of offered services. We show two different applications based on neural and neuro-fuzzy systems for quality of service (QoS) management in next generation networks for voice and video service over heterogeneous Internet protocol (V2oIP) services. The two examples explained in this paper attempt to predict the communication network resources for new incoming calls, and visualizing the QoS of a communication network by means of self-organizing maps. 相似文献
88.
89.
90.
Papadakis N Bugeau A 《IEEE transactions on pattern analysis and machine intelligence》2011,33(1):144-157
This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimations. Separating these predicted areas into good and bad parts with respect to the final segmentation and representing the objects with their visible and occluded parts permit handling partial and complete occlusions. To achieve this tracking, a label is assigned to each object and an energy function representing the multilabel problem is minimized via a graph cuts optimization. This energy contains terms based on image intensities which enable segmenting and regularizing the visible parts of the objects. It also includes terms dedicated to the management of the occluded and disappearing areas, which are defined on the areas of prediction of the objects. The results on several challenging sequences prove the strength of the proposed approach. 相似文献