全文获取类型
收费全文 | 3721篇 |
免费 | 123篇 |
国内免费 | 108篇 |
专业分类
电工技术 | 61篇 |
综合类 | 111篇 |
化学工业 | 505篇 |
金属工艺 | 486篇 |
机械仪表 | 246篇 |
建筑科学 | 233篇 |
矿业工程 | 112篇 |
能源动力 | 134篇 |
轻工业 | 101篇 |
水利工程 | 22篇 |
石油天然气 | 35篇 |
武器工业 | 9篇 |
无线电 | 232篇 |
一般工业技术 | 303篇 |
冶金工业 | 671篇 |
原子能技术 | 29篇 |
自动化技术 | 662篇 |
出版年
2024年 | 5篇 |
2023年 | 34篇 |
2022年 | 61篇 |
2021年 | 65篇 |
2020年 | 59篇 |
2019年 | 69篇 |
2018年 | 73篇 |
2017年 | 90篇 |
2016年 | 93篇 |
2015年 | 117篇 |
2014年 | 181篇 |
2013年 | 244篇 |
2012年 | 184篇 |
2011年 | 265篇 |
2010年 | 173篇 |
2009年 | 186篇 |
2008年 | 178篇 |
2007年 | 272篇 |
2006年 | 225篇 |
2005年 | 178篇 |
2004年 | 136篇 |
2003年 | 134篇 |
2002年 | 110篇 |
2001年 | 114篇 |
2000年 | 95篇 |
1999年 | 89篇 |
1998年 | 82篇 |
1997年 | 83篇 |
1996年 | 87篇 |
1995年 | 57篇 |
1994年 | 67篇 |
1993年 | 44篇 |
1992年 | 29篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有3952条查询结果,搜索用时 0 毫秒
71.
模式搜索方法是求解最优化问题的一种直接搜索方法,它只根据函数值信息来进行求优。但模式搜索对起始点非常敏感,对好的起始点,模式搜索可以搜索到全局最优点,但对某些起始点,模式搜索只能搜索到局部极值点。本文提出基于模式搜索的一个新方法,实验证明,它能搜索到全局最优。 相似文献
72.
Patrick Ciarlet Jr. Grace Hechme 《Computer Methods in Applied Mechanics and Engineering》2008,198(2):358-365
Costabel and Dauge proposed a variational setting to solve numerically the time-harmonic Maxwell equations in 3D polyhedral geometries, with a continuous approximation of the electromagnetic field. In order to remove spurious eigenmodes, three computational strategies are then possible. The original method, which requires a parameterization of the variational formulation. The second method, which is based on an a posteriori filtering of the computed eigenmodes. And the third method, which uses a mixed variational setting so that all spurious modes are removed a priori. In this paper, we discuss the relative merits of the approaches, which are illustrated by a series of 3D numerical examples. 相似文献
73.
Ludovic Giet 《Computational statistics & data analysis》2008,52(6):2945-2965
A minimum disparity estimator minimizes a φ-divergence between the marginal density of a parametric model and its non-parametric estimate. This principle is applied to the estimation of stochastic differential equation models, choosing the Hellinger distance as particular φ-divergence. Under an hypothesis of stationarity, the parametric marginal density is provided by solving the Kolmogorov forward equation. A particular emphasis is put on the non-parametric estimation of the sample marginal density which has to take into account sample dependence and kurtosis. A new window size determination is provided. The classical estimator is presented alternatively as a distance minimizer and as a pseudo-likelihood maximizer. The latter presentation opens the way to Bayesian inference. The method is applied to continuous time models of the interest rate. In particular, various models are tested using alternatively tests and their results are discussed. 相似文献
74.
We perform continuous collision detection (CCD) for articulated bodies where motion is governed by an adaptive dynamics simulation.
Our algorithm is based on a novel hierarchical set of transforms that represent the kinematics of an articulated body recursively,
as described by an assembly tree. The performance of our CCD algorithm significantly improves as the number of active degrees
of freedom in the simulation decreases. 相似文献
75.
In our previous work, we introduced a computational architecture that effectively supports the tasks of continuous monitoring
and of aggregation querying of complex domain meaningful time-oriented concepts and patterns (temporal abstractions), in environments featuring large volumes of continuously arriving and accumulating time-oriented raw data. Examples include
provision of decision support in clinical medicine, making financial decisions, detecting anomalies and potential threats
in communication networks, integrating intelligence information from multiple sources, etc. In this paper, we describe the
general, domain-independent but task-specific problem-solving method underling our computational architecture, which we refer
to as incremental knowledge-based temporal abstraction (IKBTA). The IKBTA method incrementally computes temporal abstractions by maintaining persistence and validity of continuously computed
temporal abstractions from arriving time-stamped data. We focus on the computational framework underlying our reasoning method,
provide well-defined semantic and knowledge requirements for incremental inference, which utilizes a logical model of time,
data, and high-level abstract concepts, and provide a detailed analysis of the computational complexity of our approach. 相似文献
76.
It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics,
integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a
music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and
similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple
queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose
a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are
similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy
computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are
irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial
answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in
which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor
the music streams. Experiment results show the effectiveness and efficiency of the proposed approach. 相似文献
77.
一种带有链约束的连续型批处理机调度问题 总被引:1,自引:0,他引:1
针对链式约束下工件释放时间和工期同序的情况,证明了即使所有工件都是单位加工时间时,极小化最大拖期问题也是强NP-难的.对于工件的零时刻都到达且同一链中工件工期相同的特殊情况,给出了多项式时间的最优算法. 相似文献
78.
79.
80.
Cameron Talischi Glaucio H. Paulino Chau H. Le 《Structural and Multidisciplinary Optimization》2009,37(6):569-583
Traditionally, standard Lagrangian-type finite elements, such as linear quads and triangles, have been the elements of choice
in the field of topology optimization. However, finite element meshes with these conventional elements exhibit the well-known
“checkerboard” pathology in the iterative solution of topology optimization problems. A feasible alternative to eliminate
such long-standing problem consists of using hexagonal (honeycomb) elements with Wachspress-type shape functions. The features
of the hexagonal mesh include two-node connections (i.e. two elements are either not connected or connected by two nodes),
and three edge-based symmetry lines per element. In contrast, quads can display one-node connections, which can lead to checkerboard;
and only have two edge-based symmetry lines. In addition, Wachspress rational shape functions satisfy the partition of unity
condition and lead to conforming finite element approximations. We explore the Wachspress-type hexagonal elements and present
their implementation using three approaches for topology optimization: element-based, continuous approximation of material
distribution, and minimum length-scale through projection functions. Examples are presented that demonstrate the advantages
of the proposed element in achieving checkerboard-free solutions and avoiding spurious fine-scale patterns from the design
optimization process. 相似文献