全文获取类型
收费全文 | 4357篇 |
免费 | 224篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 68篇 |
综合类 | 3篇 |
化学工业 | 1168篇 |
金属工艺 | 95篇 |
机械仪表 | 71篇 |
建筑科学 | 176篇 |
矿业工程 | 5篇 |
能源动力 | 149篇 |
轻工业 | 337篇 |
水利工程 | 21篇 |
石油天然气 | 13篇 |
武器工业 | 1篇 |
无线电 | 531篇 |
一般工业技术 | 776篇 |
冶金工业 | 349篇 |
原子能技术 | 29篇 |
自动化技术 | 798篇 |
出版年
2023年 | 25篇 |
2022年 | 63篇 |
2021年 | 79篇 |
2020年 | 69篇 |
2019年 | 80篇 |
2018年 | 103篇 |
2017年 | 95篇 |
2016年 | 121篇 |
2015年 | 107篇 |
2014年 | 161篇 |
2013年 | 275篇 |
2012年 | 229篇 |
2011年 | 294篇 |
2010年 | 223篇 |
2009年 | 183篇 |
2008年 | 222篇 |
2007年 | 204篇 |
2006年 | 180篇 |
2005年 | 153篇 |
2004年 | 130篇 |
2003年 | 116篇 |
2002年 | 132篇 |
2001年 | 60篇 |
2000年 | 75篇 |
1999年 | 67篇 |
1998年 | 75篇 |
1997年 | 89篇 |
1996年 | 71篇 |
1995年 | 71篇 |
1994年 | 62篇 |
1993年 | 45篇 |
1992年 | 43篇 |
1991年 | 38篇 |
1990年 | 47篇 |
1989年 | 40篇 |
1988年 | 27篇 |
1987年 | 26篇 |
1986年 | 24篇 |
1985年 | 40篇 |
1984年 | 40篇 |
1983年 | 38篇 |
1982年 | 44篇 |
1981年 | 34篇 |
1980年 | 17篇 |
1979年 | 29篇 |
1978年 | 17篇 |
1977年 | 18篇 |
1976年 | 18篇 |
1974年 | 15篇 |
1970年 | 15篇 |
排序方式: 共有4590条查询结果,搜索用时 0 毫秒
71.
Omnibus procedures for testing serial correlation are developed, using spectral density estimation and wavelet shrinkage. The asymptotic distributions of the wavelet coefficients under the null hypothesis of no serial correlation are derived. Under some general conditions on the wavelet basis, the wavelet coefficients asymptotically follow a normal distribution. Furthermore, they are asymptotically uncorrelated. Adopting a spectral approach and using results on wavelet shrinkage, new one-sided test statistics are proposed. As a spatially adaptive estimation method, wavelets can effectively detect fine features in the spectral density, such as sharp peaks and high frequency alternations. Using an appropriate thresholding parameter, shrinkage rules are applied to the empirical wavelet coefficients, resulting in a non-linear wavelet-based spectral density estimator. Consequently, the advocated approach avoids the need to select the finest scale J, since the noise in the wavelet coefficients is naturally suppressed. Simple data-dependent threshold parameters are also considered. In general, the convergence of the spectral test statistics toward their respective asymptotic distributions appears to be relatively slow. In view of that, Monte Carlo methods are investigated. In a small simulation study, several spectral test statistics are compared, with respect to level and power, including versions of these test statistics using Monte Carlo simulations. 相似文献
72.
Abir Ben Hmida Mohamed Haouari Marie-José Huguet Pierre Lopez 《Computers & Operations Research》2010,37(12):2192-2201
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones. 相似文献
73.
Jean-François Collard Pierre Duysinx Paul Fisette 《Structural and Multidisciplinary Optimization》2010,42(3):403-415
This paper presents a novel approach to optimize the design of planar mechanisms with revolute joints for function generation
or path synthesis. The proposed method is based on the use of an extensible-link mechanism model whose strain energy is minimized
to find the optimal rigid design. This enables us to get rid of assembly constraints and the use of natural coordinates makes
the objective function simpler. Two optimization strategies are developed and then discussed. The first one relies on alternate
optimizations of design parameters and point coordinates. The second one uses multiple partial syntheses as starting point
for a full synthesis process. The question of finding the global optimum is also addressed and developed. A simple algorithm
is proposed to find several local optima among which the designer may choose the best one taking other criteria into account
(e.g. stiffness, collision, size,...). Three applications are presented to illustrate the strategies while mentioning their
limits. 相似文献
74.
A simple mathematical model of laser drilling is proposed. Assuming axi-symmetry of the process around the axis of the laser beam, a one-dimensional formulation is obtained after cross-sectional averaging. The novelty of the approach relies on the fact that even after dimension reduction, the shape of the hole can still be described. The model is derived, implemented and validated for drilling using lasers with intensities in the GW/cm2 range and microsecond pulses. 相似文献
75.
This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of outsourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a constraint satisfaction problem (CSP). It is implemented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time. 相似文献
76.
We explore one aspect of the structure of a codified legal system at the national level using a new type of representation
to understand the strong or weak dependencies between the various fields of law. In Part I of this study, we analyze the graph
associated with the network in which each French legal code is a vertex and an edge is produced between two vertices when
a code cites another code at least one time. We show that this network distinguishes from many other real networks from a
high density, giving it a particular structure that we call concentrated world and that differentiates a national legal system (as considered with a resolution at the code level) from small-world graphs identified in many social networks. Our analysis then shows that a few communities (groups of highly wired vertices)
of codes covering large domains of regulation are structuring the whole system. Indeed we mainly find a central group of influent
codes, a group of codes related to social issues and a group of codes dealing with territories and natural resources. The
study of this codified legal system is also of interest in the field of the analysis of real networks. In particular we examine
the impact of the high density on the structural characteristics of the graph and on the ways communities are searched for.
Finally we provide an original visualization of this graph on an hemicyle-like plot, this representation being based on a
statistical reduction of dissimilarity measures between vertices. In Part II (a following paper) we show how the consideration
of the weights attributed to each edge in the network in proportion to the number of citations between two vertices (codes)
allows deepening the analysis of the French legal system. 相似文献
77.
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”. 相似文献
78.
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling ℒ
all
gives each node v of G a label containing the port numbers of all the tree edges incident to v. The upward tree labeling ℒ
up
labels each node v by the number of the port leading from v to its parent in the tree. Our measure of interest is the worst case and total length of the labels used by the scheme, denoted
M
up
(T) and S
up
(T) for ℒ
up
and M
all
(T) and S
all
(T) for ℒ
all
. The problem studied in this paper is the following: Given a graph G and a predefined port labeling for it, with the ports of each node v numbered by 0,…,deg (v)−1, select a rooted spanning tree for G minimizing (one of) these measures. We show that the problem is polynomial for M
up
(T), S
up
(T) and S
all
(T) but NP-hard for M
all
(T) (even for 3-regular planar graphs). We show that for every graph G and port labeling there exists a spanning tree T for which S
up
(T)=O(nlog log n). We give a tight bound of O(n) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port labeling. We conclude by
discussing some applications for our tree representation schemes.
A preliminary version of this paper has appeared in the proceedings of the 7th International Workshop on Distributed Computing
(IWDC), Kharagpur, India, December 27–30, 2005, as part of Cohen, R. et al.: Labeling schemes for tree representation. In:
Proceedings of 7th International Workshop on Distributed Computing (IWDC), Lecture Notes of Computer Science, vol. 3741, pp. 13–24
(2005).
R. Cohen supported by the Pacific Theaters Foundation.
P. Fraigniaud and D. Ilcinkas supported by the project “PairAPair” of the ACI Masses de Données, the project “Fragile” of
the ACI Sécurité et Informatique, and by the project “Grand Large” of INRIA.
A. Korman supported in part by an Aly Kaufman fellowship.
D. Peleg supported in part by a grant from the Israel Science Foundation. 相似文献
79.
Mathieu Le Coz François Delclaux Pierre Genthon Guillaume Favreau 《Computers & Geosciences》2009,35(8):1661-1670
Digital Elevation Models (DEMs) are used to compute the hydro-geomorphological variables required by distributed hydrological models. However, the resolution of the most precise DEMs is too fine to run these models over regional watersheds. DEMs therefore need to be aggregated to coarser resolutions, affecting both the representation of the land surface and the hydrological simulations. In the present paper, six algorithms (mean, median, mode, nearest neighbour, maximum and minimum) are used to aggregate the Shuttle Radar Topography Mission (SRTM) DEM from 3″ (90 m) to 5′ (10 km) in order to simulate the water balance of the Lake Chad basin (2.5 Mkm2). Each of these methods is assessed with respect to selected hydro-geomorphological properties that influence Terrestrial Hydrology Model with Biogeochemistry (THMB) simulations, namely the drainage network, the Lake Chad bottom topography and the floodplain extent.The results show that mean and median methods produce a smoother representation of the topography. This smoothing involves the removing of the depressions governing the floodplain dynamics (floodplain area<5000 km2) but it eliminates the spikes and wells responsible for deviations regarding the drainage network. By contrast, using other aggregation methods, a rougher relief representation enables the simulation of a higher floodplain area (>14,000 km2 with the maximum or nearest neighbour) but results in anomalies concerning the drainage network. An aggregation procedure based on a variographic analysis of the SRTM data is therefore suggested. This consists of preliminary filtering of the 3″ DEM in order to smooth spikes and wells, then resampling to 5′ via the nearest neighbour method so as to preserve the representation of depressions. With the resulting DEM, the drainage network, the Lake Chad bathymetric curves and the simulated floodplain hydrology are consistent with the observations (3% underestimation for simulated evaporation volumes). 相似文献
80.
Maria-Jose Escobar Guillaume S. Masson Thierry Vieville Pierre Kornprobst 《International Journal of Computer Vision》2009,82(3):284-301
We propose a bio-inspired feedforward spiking network modeling two brain areas dedicated to motion (V1 and MT), and we show
how the spiking output can be exploited in a computer vision application: action recognition. In order to analyze spike trains,
we consider two characteristics of the neural code: mean firing rate of each neuron and synchrony between neurons. Interestingly,
we show that they carry some relevant information for the action recognition application. We compare our results to Jhuang
et al. (Proceedings of the 11th international conference on computer vision, pp. 1–8, 2007) on the Weizmann database. As a conclusion, we are convinced that spiking networks represent a powerful alternative framework
for real vision applications that will benefit from recent advances in computational neuroscience. 相似文献