全文获取类型
收费全文 | 2657篇 |
免费 | 143篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 31篇 |
综合类 | 2篇 |
化学工业 | 680篇 |
金属工艺 | 44篇 |
机械仪表 | 61篇 |
建筑科学 | 80篇 |
矿业工程 | 2篇 |
能源动力 | 104篇 |
轻工业 | 170篇 |
水利工程 | 11篇 |
石油天然气 | 5篇 |
无线电 | 309篇 |
一般工业技术 | 511篇 |
冶金工业 | 174篇 |
原子能技术 | 11篇 |
自动化技术 | 606篇 |
出版年
2023年 | 33篇 |
2022年 | 50篇 |
2021年 | 69篇 |
2020年 | 65篇 |
2019年 | 59篇 |
2018年 | 76篇 |
2017年 | 65篇 |
2016年 | 97篇 |
2015年 | 68篇 |
2014年 | 107篇 |
2013年 | 185篇 |
2012年 | 189篇 |
2011年 | 235篇 |
2010年 | 181篇 |
2009年 | 150篇 |
2008年 | 154篇 |
2007年 | 154篇 |
2006年 | 114篇 |
2005年 | 93篇 |
2004年 | 72篇 |
2003年 | 55篇 |
2002年 | 55篇 |
2001年 | 53篇 |
2000年 | 38篇 |
1999年 | 40篇 |
1998年 | 61篇 |
1997年 | 45篇 |
1996年 | 27篇 |
1995年 | 23篇 |
1994年 | 18篇 |
1993年 | 19篇 |
1992年 | 20篇 |
1991年 | 11篇 |
1990年 | 16篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 16篇 |
1986年 | 8篇 |
1984年 | 4篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 5篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1970年 | 2篇 |
排序方式: 共有2801条查询结果,搜索用时 171 毫秒
71.
This paper introduces the use of sets of multiple networks (bundled networks) to manage the variability due to different initialization parameters. This method makes it statistically impossible for the networks to be trapped in the same local minimum, and therefore allows better control of the confidence of the prediction eventually given. The spread of the forecasts given by these different networks can be used for prediction reliability purposes. An illustration of this usage is given with the El Niño phenomenon. 相似文献
72.
In this study, the effect of the centrifugal forces on the eigenvalue solution obtained using two different nonlinear finite
element formulations is examined. Both formulations can correctly describe arbitrary rigid body displacements and can be used
in the large deformation analysis. The first formulation is based on the geometrically exact beam theory, which assumes that the cross section does not deform in its own plane and remains plane after deformation. The second formulation,
the absolute nodal coordinate formulation (ANCF), relaxes this assumption and introduces modes that couple the deformation of the cross section and the axial and bending
deformations. In the absolute nodal coordinate formulation, four different models are developed; a beam model based on a general
continuum mechanics approach, a beam model based on an elastic line approach, a beam model based on an elastic line approach
combined with the Hellinger–Reissner principle, and a plate model based on a general continuum mechanics approach. The use
of the general continuum mechanics approach leads to a model that includes the ANCF coupled deformation modes. Because of these modes, the continuum mechanics model differs from the models based on the elastic line approach. In both
the geometrically exact beam and the absolute nodal coordinate formulations, the centrifugal forces are formulated in terms
of the element nodal coordinates. The effect of the centrifugal forces on the flap and lag modes of the rotating beam is examined, and the results obtained using the two formulations are compared for different values of
the beam angular velocity. The numerical comparative study presented in this investigation shows that when the effect of some
ANCF coupled deformation modes is neglected, the eigenvalue solutions obtained using the geometrically exact beam and the
absolute nodal coordinate formulations are in a good agreement. The results also show that as the effect of the centrifugal
forces, which tend to increase the beam stiffness, increases, the effect of the ANCF coupled deformation modes on the computed
eigenvalues becomes less significant. It is shown in this paper that when the effect of the Poisson ration is neglected, the
eigenvalue solution obtained using the absolute nodal coordinate formulation based on a general continuum mechanics approach
is in a good agreement with the solution obtained using the geometrically exact beam model. 相似文献
73.
Nawal Guermouche Olivier Perrin Christophe Ringeissen 《Electronic Notes in Theoretical Computer Science》2008,200(3):155
Web services are becoming one of the main technologies for designing and building complex inter-enterprise business applications. Usually, a business application cannot be fulfilled by one Web service but by coordinating a set of them. In particular, to perform a coordination, one of the important investigations is the compatibility analysis. Two Web services are said compatible if they can interact correctly. In the literature, the proposed frameworks for the services compatibility checking rely on the supported sequences of messages. The interaction of services depends also on other properties, such that the exchanged data flow. Thus, considering only supported sequences of messages seems to be insufficient. Other properties on which the services interaction can rely on, are the temporal constraints. In this paper, we focus our interest on the compatibility analysis of Web services regarding their (1) supported sequences of messages, (2) the exchanged data flow, (3) constraints related to the exchanged data flow and (4) the temporal requirements. Based on these properties, we study three compatibility classes: (i) absolute compatibility, (ii) likely compatibility and (iii) absolute incompatibility. 相似文献
74.
International Journal of Computer Vision - 相似文献
75.
Training a support vector machine in the primal 总被引:3,自引:0,他引:3
Chapelle O 《Neural computation》2007,19(5):1155-1178
Most literature on support vector machines (SVMs) concentrates on the dual optimization problem. In this letter, we point out that the primal problem can also be solved efficiently for both linear and nonlinear SVMs and that there is no reason for ignoring this possibility. On the contrary, from the primal point of view, new families of algorithms for large-scale SVM training can be investigated. 相似文献
76.
On the hardness of offline multi-objective optimization 总被引:1,自引:0,他引:1
Teytaud O 《Evolutionary computation》2007,15(4):475-491
It has been empirically established that multiobjective evolutionary algorithms do not scale well with the number of conflicting objectives. This paper shows that the convergence rate of all comparison-based multi-objective algorithms, for the Hausdorff distance, is not much better than the convergence rate of the random search under certain conditions. The number of objectives must be very moderate and the framework should hold the following assumptions: the objectives are conflicting and the computational cost is lower bounded by the number of comparisons is a good model. Our conclusions are: (i) the number of conflicting objectives is relevant (ii) the criteria based on comparisons with random-search for multi-objective optimization is also relevant (iii) having more than 3-objectives optimization is very hard. Furthermore, we provide some insight into cross-over operators. 相似文献
77.
78.
This paper introduces an accurate, efficient, and unified engine dedicated to dynamic animation of d-dimensional deformable objects. The objects are modelled as d-dimensional manifolds defined as functional combinations of a mesh of 3D control points, weighted by parametric blending
functions. This model ensures that, at each time step, the object shape conforms to its manifold definitions. The object motion
is deduced from the control points dynamic animation. In fact, control points should be viewed as the degrees of freedom of
the continuous object. The chosen dynamic equations (Lagrangian formalism) reflect this generic modelling scheme and yield
an exact and computationally efficient linear system. 相似文献
79.
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis 总被引:3,自引:0,他引:3
Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite set ofn points in any dimension. In this paper we prove that a randomized construction of thek-Delaunay tree, and thus of all the orderk Voronoi diagrams, can be done inO(n logn+k
3n) expected time and O(k2n) expected storage in the plane, which is asymptotically optimal for fixedk. Our algorithm extends tod-dimensional space with expected time complexityO(k
(d+1)/2+1
n
(d+1)/2) and space complexityO(k
(d+1)/2
n
(d+1)/2). The algorithm is simple and experimental results are given.This work has been supported in part by the ESPRIT Basic Research Action No. 3075 (ALCOM). 相似文献
80.
By transforming the personal computer into a communication appliance, the Internet has initiated the true home computing revolution. As a result, Computer Mediated Communication (CMC) technologies are increasingly used in domestic settings, and are changing the way people keep in touch with their relatives and friends. This article first looks at how CMC tools are currently used in the home, and points at some of their benefits and limitations. Most of these tools supportexplicit interpersonal communication, by providing a new medium for sustaining conversations. The need for tools supportingimplicit interaction between users, in more natural and effottless ways, is then argued for. The idea of affective awareness is introduced as a general sense of being in touch with one's family and friends. Finally, the KAN-G framework, which enables affective awareness through the exchange of digital photographs, is described. Various components, which make the capture, distribution, observation and annotation of snapshots easy and effortless, are discussed. 相似文献