全文获取类型
收费全文 | 51027篇 |
免费 | 4226篇 |
国内免费 | 967篇 |
专业分类
电工技术 | 1333篇 |
综合类 | 1610篇 |
化学工业 | 10633篇 |
金属工艺 | 1460篇 |
机械仪表 | 1640篇 |
建筑科学 | 2284篇 |
矿业工程 | 473篇 |
能源动力 | 1293篇 |
轻工业 | 9028篇 |
水利工程 | 825篇 |
石油天然气 | 850篇 |
武器工业 | 137篇 |
无线电 | 3206篇 |
一般工业技术 | 7037篇 |
冶金工业 | 6215篇 |
原子能技术 | 294篇 |
自动化技术 | 7902篇 |
出版年
2024年 | 131篇 |
2023年 | 585篇 |
2022年 | 1110篇 |
2021年 | 1867篇 |
2020年 | 1516篇 |
2019年 | 1401篇 |
2018年 | 1955篇 |
2017年 | 1973篇 |
2016年 | 1993篇 |
2015年 | 2027篇 |
2014年 | 2575篇 |
2013年 | 4129篇 |
2012年 | 3860篇 |
2011年 | 3933篇 |
2010年 | 3200篇 |
2009年 | 2989篇 |
2008年 | 2898篇 |
2007年 | 2671篇 |
2006年 | 1987篇 |
2005年 | 1553篇 |
2004年 | 1210篇 |
2003年 | 1005篇 |
2002年 | 855篇 |
2001年 | 625篇 |
2000年 | 512篇 |
1999年 | 508篇 |
1998年 | 2054篇 |
1997年 | 1330篇 |
1996年 | 842篇 |
1995年 | 480篇 |
1994年 | 369篇 |
1993年 | 376篇 |
1992年 | 133篇 |
1991年 | 110篇 |
1990年 | 99篇 |
1989年 | 83篇 |
1988年 | 106篇 |
1987年 | 102篇 |
1986年 | 80篇 |
1985年 | 99篇 |
1984年 | 72篇 |
1983年 | 47篇 |
1982年 | 48篇 |
1981年 | 74篇 |
1980年 | 69篇 |
1978年 | 35篇 |
1977年 | 109篇 |
1976年 | 221篇 |
1975年 | 35篇 |
1973年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 609 毫秒
901.
The vulnerability of structures to unforeseen events 总被引:2,自引:0,他引:2
A structure is vulnerable to an unforeseen event if it is not sufficiently robust. One insight into the lack of robustness is gained through the vulnerability of a structure to disproportionate collapse. In this paper, the importance of assessing the vulnerability of a structure to unforeseen events is highlighted and the nature of unforeseen events examined. A theory of structural vulnerability which examines the form of the structure to determine the most vulnerable sequence of failure events is briefly described. The potential for damage to propagate through a structure is examined through a new measure of hazard potential and vertical pushover analysis. An analysis of an example structure shows that such an approach is able to capture the weaknesses in a structure either due to form or external actions. 相似文献
902.
Javier Aroba Author Vitae Juan J. Cuadrado-Gallego Author Vitae 《Journal of Systems and Software》2008,81(11):1944-1950
Parametric software cost estimation models are based on mathematical relations, obtained from the study of historical software projects databases, that intend to be useful to estimate the effort and time required to develop a software product. Those databases often integrate data coming from projects of a heterogeneous nature. This entails that it is difficult to obtain a reasonably reliable single parametric model for the range of diverging project sizes and characteristics. A solution proposed elsewhere for that problem was the use of segmented models in which several models combined into a single one contribute to the estimates depending on the concrete characteristic of the inputs. However, a second problem arises with the use of segmented models, since the belonging of concrete projects to segments or clusters is subject to a degree of fuzziness, i.e. a given project can be considered to belong to several segments with different degrees.This paper reports the first exploration of a possible solution for both problems together, using a segmented model based on fuzzy clusters of the project space. The use of fuzzy clustering allows obtaining different mathematical models for each cluster and also allows the items of a project database to contribute to more than one cluster, while preserving constant time execution of the estimation process. The results of an evaluation of a concrete model using the ISBSG 8 project database are reported, yielding better figures of adjustment than its crisp counterpart. 相似文献
903.
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution is found in time that is (i) close to the shortest possible and (ii) superior to any deterministic verification strategy. A provably fastest model verification strategy is designed for the (theoretical) situation when the contamination of data by outliers is known. In this case, the algorithm is the fastest possible (on average) of all randomized \\RANSAC algorithms guaranteeing a confidence in the solution. The derivation of the optimality property is based on Wald's theory of sequential decision making, in particular a modified sequential probability ratio test (SPRT). Next, the R-RANSAC with SPRT algorithm is introduced. The algorithm removes the requirement for a priori knowledge of the fraction of outliers and estimates the quantity online. We show experimentally that on standard test data the method has performance close to the theoretically optimal and is 2 to 10 times faster than standard RANSAC and is up to 4 times faster than previously published methods. 相似文献
904.
Dimas?Martínez?MoreraEmail author Paulo?Cezar?Carvalho Luiz?Velho 《The Visual computer》2008,24(12):1025-1037
This paper discusses the problem of modeling on triangulated surfaces with geodesic curves. In the first part of the paper
we define a new class of curves, called geodesic Bézier curves, that are suitable for modeling on manifold triangulations. As a natural generalization of Bézier curves, the new curves
are as smooth as possible. In the second part we discuss the construction of C
0 and C
1 piecewise Bézier splines. We also describe how to perform editing operations, such as trimming, using these curves. Special
care is taken to achieve interactive rates for modeling tasks. The third part is devoted to the definition and study of convex
sets on triangulated surfaces. We derive the convex hull property of geodesic Bézier curves.
相似文献
Luiz VelhoEmail: |
905.
传统的像素级变化检测方法的检测性能受到以下因素的严重制约: 图像辐射差异、配准误差和差异图像分类门限的选取, 并且难以从检测信息中提取出关键的变化. 本文针对遥感图像中人造目标的变化检测问题, 提出了一种综合特征级和像素级的两步变化检测算法. 首先将大幅多时相遥感图像分成一系列子图像对, 采用有监督子图像对分类方法, 提取人造目标变化的感兴趣区域, 然后采用像素级变化检测算法对感兴趣区域进行变化检测, 得到定量的检测结果. 实验结果表明了该算法的可行性和有效性. 相似文献
906.
907.
In order to be capable of exploiting context for pro-active information recommendation, agents need to extract and understand
user activities based on their knowledge of the user interests. In this paper, we propose a novel approach for context-aware
recommendation in browsing assistants based on the integration of user profiles, navigational patterns and contextual elements.
In this approach, user profiles built using an unsupervised Web page clustering algorithm are used to characterize user ongoing
activities and behavior patterns. Experimental evidence show that using longer-term interests to explain active browsing goals
user assistance is effectively enhanced.
相似文献
Analía AmandiEmail: |
908.
909.
Pablo Amster Pablo De Npoli Juan Pablo Pinasco 《Computers & Mathematics with Applications》2008,55(12):2762-2766
910.
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst
case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with
a very large bound.
In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate
real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by
TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation.
Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred
by the allocators has been also included in order to provide a global view of the behaviour of the allocators.
The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused
by the best existing allocators.
相似文献
Alfons Crespo (Corresponding author)Email: |