全文获取类型
收费全文 | 3530篇 |
免费 | 170篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 49篇 |
综合类 | 4篇 |
化学工业 | 928篇 |
金属工艺 | 80篇 |
机械仪表 | 61篇 |
建筑科学 | 99篇 |
矿业工程 | 4篇 |
能源动力 | 120篇 |
轻工业 | 310篇 |
水利工程 | 26篇 |
石油天然气 | 3篇 |
无线电 | 363篇 |
一般工业技术 | 720篇 |
冶金工业 | 176篇 |
原子能技术 | 34篇 |
自动化技术 | 729篇 |
出版年
2023年 | 44篇 |
2022年 | 93篇 |
2021年 | 124篇 |
2020年 | 93篇 |
2019年 | 92篇 |
2018年 | 90篇 |
2017年 | 94篇 |
2016年 | 116篇 |
2015年 | 99篇 |
2014年 | 149篇 |
2013年 | 225篇 |
2012年 | 249篇 |
2011年 | 280篇 |
2010年 | 219篇 |
2009年 | 201篇 |
2008年 | 202篇 |
2007年 | 168篇 |
2006年 | 170篇 |
2005年 | 122篇 |
2004年 | 97篇 |
2003年 | 90篇 |
2002年 | 75篇 |
2001年 | 37篇 |
2000年 | 32篇 |
1999年 | 46篇 |
1998年 | 62篇 |
1997年 | 45篇 |
1996年 | 34篇 |
1995年 | 34篇 |
1994年 | 32篇 |
1993年 | 25篇 |
1992年 | 19篇 |
1991年 | 23篇 |
1990年 | 12篇 |
1989年 | 12篇 |
1988年 | 14篇 |
1987年 | 18篇 |
1986年 | 11篇 |
1985年 | 15篇 |
1984年 | 15篇 |
1983年 | 13篇 |
1982年 | 16篇 |
1981年 | 19篇 |
1980年 | 15篇 |
1979年 | 12篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1971年 | 6篇 |
排序方式: 共有3706条查询结果,搜索用时 15 毫秒
51.
Ulrich Schmatz Catherine Dubourdieu Oleg Lebedev Gerard Delabouglise Francois Weiss Jean-Pierre Senateur 《Journal of Low Temperature Physics》1996,105(5-6):1301-1306
Thin and thick YBCO Films have been grown by Aerosol Assisted as well as by thermal MOCVD. The Aerosol Assisted MOCVD technique allows the growth of YBCO films from a single liquid source at deposition rates of up to 10m/h.Transport measurements (I-V) on etched microbridges using a single pulse technique have been performed. The angular magnetic field dependence Jc() of the critical current density from Tc down to 50 K has been measured. Transport properties are reported and discussed with respect to the microstructural features as determined by X-ray diffraction and electron microscopy. 相似文献
52.
Emmanuel Bruno Nicolas Faessel Herv�� Glotin Jacques Le Maitre Michel Scholl 《World Wide Web》2011,14(5-6):623-649
We present in this paper a model for indexing and querying web pages, based on the hierarchical decomposition of pages into blocks. Splitting up a page into blocks has several advantages in terms of page design, indexing and querying such as (i) blocks of a page most similar to a query may be returned instead of the page as a whole (ii) the importance of a block can be taken into account, as well as (iii) the permeability of the blocks to neighbor blocks: a block b is said to be permeable to a block b?? in the same page if b?? content (text, image, etc.) can be (partially) inherited by b upon indexing. An engine implementing this model is described including: the transformation of web pages into blocks hierarchies, the definition of a dedicated language to express indexing rules and the storage of indexed blocks into an XML repository. The model is assessed on a dataset of electronic news, and a dataset drawn from web pages of the ImagEval campaign where it improves by 16% the mean average precision of the baseline. 相似文献
53.
Jose Gonzalez-Mora Fernando De la Torre Nicolas Guil Emilio L. Zapata 《Image and vision computing》2010
Over the last decade 3D face models have been extensively used in many applications such as face recognition, facial animation and facial expression analysis. 3D Morphable Models (MMs) have become a popular tool to build and fit 3D face models to images. Critical to the success of MMs is the ability to build a generic 3D face model. Major limitations in the MMs building process are: (1) collecting 3D data usually involves the use of expensive laser scans and complex capture setups, (2) the number of available 3D databases is limited, and typically there is a lack of expression variability and (3) finding correspondences and registering the 3D model is a labor intensive and error prone process. 相似文献
54.
55.
Arnaud Fréville Saïd Hanafi Frédéric Semet Nicolas Yanev 《Computers & Operations Research》2010,37(10):1688-1696
This article proposes a tabu search approach to solve a mathematical programming formulation of the linear classification problem, which consists of determining an hyperplane that separates two groups of points as well as possible in ?m. The tabu search approach proposed is based on a non-standard formulation using linear system infeasibility. The search space is the set of bases defined on the matrix that describes the linear system. The moves are performed by pivoting on a specified row and column. On real machine learning databases, our approach compares favorably with implementations based on parametric programming and irreducible infeasible constraint sets. Additional computational results for randomly generated instances confirm that our method provides a suitable alternative to the mixed integer programming formulation that is solved by a commercial code when the number of attributes m increases. 相似文献
56.
Eugenio Roanes-Lozano Nicolas van Labeke Eugenio Roanes-Macías 《Mathematics and computers in simulation》2010
Many (2D) Dynamic Geometry Systems (DGSs) are able to export numeric coordinates and equations with numeric coefficients to Computer Algebra Systems (CASs). Moreover, different approaches and systems that link (2D) DGSs with CASs, so that symbolic coordinates and equations with symbolic coefficients can be exported from the DGS to the CAS, already exist. Although the 3D DGS Calques3D can export numeric coordinates and equations with numeric coefficients to Maple and Mathematica, it cannot export symbolic coordinates and equations with symbolic coefficients. A connection between the 3D DGS Calques3D and the CAS Maple, that can handle symbolic coordinates and equations with symbolic coefficients, is presented here. Its main interest is to provide a convenient time-saving way to explore problems and directly obtain both algebraic and numeric data when dealing with a 3D extension of “ruler and compass geometry”. This link has not only educational purposes but mathematical ones, like mechanical theorem proving in geometry, geometric discovery (hypotheses completion), geometric loci finding… As far as we know, there is no comparable “symbolic” link in the 3D case, except the prototype 3D-LD (restricted to determining algebraic surfaces as geometric loci). 相似文献
57.
Cédric DamourMichel Benne Lionel BoillereauxBrigitte Grondin-Perez Jean-Pierre Chabriat 《Journal of Process Control》2011,21(1):46-54
This paper illustrates the benefits of a multivariable linearizing control approach applied to an industrial crystallization process. This relevant approach proposes a setpoint tracking for the crystal mass/concentration couple. In this purpose, a model dedicated to last stage crystallization is designed, without consideration of crystal size distribution. The controlled variables, unavailable, are obtained using an extended Luenberger observer. The observer is validated on industrial data and shows good performance in both convergence rate and accuracy. The performance of the proposed linearizing strategy, which application to cane sugar crystallization constitutes a real novelty, is tested via simulation. The good performance in setpoint tracking, even in presence of noise, disturbances and modeling error, allows to consider a significant improvement of the global productivity. 相似文献
58.
This paper proposes a mathematical model, valid inequalities and polyhedral results for the minimum labeling Hamiltonian cycle problem. This problem is defined on an unweighted graph in which each edge has a label. The aim is to determine a Hamiltonian cycle with the least number of labels. We also define two variants of this problem by assigning weights to the edges and by considering the tour length either as an objective or as a constraint. A branch-and-cut algorithm for the three problems is developed, and computational results are reported on randomly generated instances and on modified instances from TSPLIB. 相似文献
59.
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”. 相似文献
60.
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. 相似文献