全文获取类型
收费全文 | 4402篇 |
免费 | 303篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 55篇 |
综合类 | 4篇 |
化学工业 | 1168篇 |
金属工艺 | 64篇 |
机械仪表 | 80篇 |
建筑科学 | 159篇 |
矿业工程 | 18篇 |
能源动力 | 178篇 |
轻工业 | 797篇 |
水利工程 | 24篇 |
石油天然气 | 16篇 |
无线电 | 213篇 |
一般工业技术 | 719篇 |
冶金工业 | 201篇 |
原子能技术 | 21篇 |
自动化技术 | 990篇 |
出版年
2024年 | 14篇 |
2023年 | 49篇 |
2022年 | 202篇 |
2021年 | 199篇 |
2020年 | 124篇 |
2019年 | 147篇 |
2018年 | 186篇 |
2017年 | 177篇 |
2016年 | 179篇 |
2015年 | 154篇 |
2014年 | 196篇 |
2013年 | 343篇 |
2012年 | 331篇 |
2011年 | 362篇 |
2010年 | 287篇 |
2009年 | 241篇 |
2008年 | 253篇 |
2007年 | 212篇 |
2006年 | 163篇 |
2005年 | 147篇 |
2004年 | 106篇 |
2003年 | 95篇 |
2002年 | 93篇 |
2001年 | 44篇 |
2000年 | 39篇 |
1999年 | 34篇 |
1998年 | 44篇 |
1997年 | 32篇 |
1996年 | 25篇 |
1995年 | 43篇 |
1994年 | 18篇 |
1993年 | 18篇 |
1992年 | 12篇 |
1991年 | 17篇 |
1990年 | 14篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 8篇 |
1974年 | 3篇 |
排序方式: 共有4707条查询结果,搜索用时 15 毫秒
141.
The use of crack growth resistance curves (R–a) to predict the behaviour of cracked specimens is a well established practice for ceramic and cementitious materials. When the cohesive crack model can be applied to these materials it is shown that the use of R–a curves is equivalent to setting up an elastic equivalence that greatly simplifies the computations. This equivalence has its drawbacks and limitations. This paper analyzes a class of equivalences—the load (P) versus another variable—between cracked cohesive materials and linear elastic ones, ascertaining its applicability to the interpretations of fracture data. 相似文献
142.
Franck J. P. Gleeson J. Kornelsen K. E. Manuel J. R. McGreer K. A. 《Journal of Low Temperature Physics》1985,58(1-2):153-170
Thin layers of solid helium were grown on sapphire single-crystal substrates at pressures from about 500 bar to 9 kbar. Grain boundaries can be observed in these layer crystals. The morphology of the grains depends on the crystal modification. In the hcp phase (below about 1.13 kbar) a system of parallel bands is observed, probably due to slip and twinning. In the fcc phase (above 1.13 kbar) a polygonal structure similar to a helium froth is found. Melting of this froth in the fcc phase shows grain boundary melting; fluid helium is wetting the fcc grains. Grain boundaries in the hcp phase are, in contrast, not wetted by fluid helium. Near the triple point at 1.13 kbar and 15.0 K one can deposit both crystalline phases side by side. In such structures, the transition fcc hcp4He can be observed during isothermal holding. The transition proceeds by the parallel motion of low-energy grain boundaries. 相似文献
143.
Water claims in many of the world??s arid basins exceed reliable supplies. Water demands for irrigation, urban use, the environment, and energy continue to grow, while supplies remain constrained by unsustainable use, drought and impacts of climate change. For example, policymakers in North America??s Upper Rio Grande Basin face the challenge of designing plans for allocating the basin??s water supplies efficiently and fairly to support current uses and current environments. Managers also seek resilient institutions that can ensure adequate supplies for future generations. This paper addresses those challenges by designing and applying an integrated basin-scale framework that accounts for the basin??s most important hydrologic, economic, and institutional constraints. Its unique contribution is a quantitative analysis of three policies for addressing long term goals for the basin??s reservoirs and aquifers: (1) no sustainability for water stocks, (2) sustaining water stocks, and (3) renewing water stocks. It identifies water use and allocation trajectories over time that result from each of these three plans. Findings show that it is hydrologically and institutionally feasible to manage the basin??s water supplies sustainably. The economic cost of protecting the sustainability of the basin??s water stocks can be achieved at 6?C11 percent of the basin??s average annual total economic value of water over a 20?year time horizon. 相似文献
144.
Nanofillers are added to dental adhesives to improve mechanical properties of the hybrid layer. Ethanol or water added to the demineralized dentin to improve adhesive infiltration may produce filler aggregation. OBJECTIVE: To assess the effect of 5 vol% water or ethanol addition on nanoparticles distribution in dental adhesives. METHODS: Six available commercial adhesives systems were selected: Clearfil SE Bond (CSE), Clearfil Protect Bond (CPB), FL‐Bond (FLB), Clearfil S3 (CS3), Bond Force (BF), One Up Bond F plus (OUB), and an experimental adhesive system without filler (EXP). Polymer films were obtained by adding 0 (control) or 5 vol% water or ethanol into the bonding resins. Preparations were light‐cured (40 s). Three specimens were analyzed for each mixture. Three phases and 3D images were taken from each specimen by means of an atomic force microscope in taping mode (TM/AFM). Cluster sizes and surface nanoroughness were assessed. RESULTS: Control specimens from CSE, FLB, OUB, and BF presented clusters. The addition of solvents lead to particles aggregation in tested bonding resins. Ethanol addition produced more aggregates, particularly in adhesives containing fluoraluminosilicate as fillers. CONCLUSIONS: Nanofillers aggregation occurred in all adhesive systems in presence of additional solvents. In general, aggregate sizes were higher after the addition of ethanol. Formed clusters size values are always above the dimensions of the spaces existing between the demineralized collagen fibers. Microsc. Res. Tech. 75:749–757, 2012. © 2011 Wiley Periodicals, Inc. 相似文献
145.
Volunteer computing uses the free resources in Internet and Intranet environments for large-scale computation and storage. Currently, 70 applications use over 12 PetaFLOPS of computing power from such platforms. However, these platforms are currently limited to embarrassingly parallel applications. In an effort to broaden the set of applications that can leverage volunteer computing, we focus on the problem of predicting if a group of resources will be continuously available for a relatively long time period. Ensuring the collective availability of volunteer resources is challenging due to their inherent volatility and autonomy. Collective availability is important for enabling parallel applications and workflows on volunteer computing platforms. We evaluate our predictive methods using real availability traces gathered from hundreds of thousands of hosts from the SETI@home volunteer computing project. We show our prediction methods can guarantee reliably the availability of collections of volunteer resources. We show that this is particularly useful for service deployments over volunteer computing environments. 相似文献
146.
This paper describes a heterogeneous modular robot system design which attempts to give a quick solution to a diversity of tasks. The approach is based on the use of an inventory of three types of modules i.e., power and control module, joint module and specialized module. Each module type aims to balance versatility and functionality. Their design permits rapid and cost effective design and fabrication. They are interchangeable in different ways to form different robot or system configurations. Depending on the task, the operator decides what type of robot can provide the best performance within the mission. A spherical joint module is described and used to build different robots, hence, forward and inverse kinematics models are obtained. Finally, from the modules described in this work, several robot configurations such as robotic arms, leg-based robots and wheel-based robots are assembled to demonstrate the execution of manipulation and locomotion tasks. 相似文献
147.
Peter Sussner Estev?o L. Esmi Ivan Villaverde Manuel Gra?a 《Journal of Mathematical Imaging and Vision》2012,42(2-3):134-149
Many well-known fuzzy associative memory (FAM) models can be viewed as (fuzzy) morphological neural networks (MNNs) because they perform an operation of (fuzzy) mathematical morphology at every node, possibly followed by the application of an activation function. The vast majority of these FAMs represent distributive models given by single-layer matrix memories. Although the Kosko subsethood FAM (KS-FAM) can also be classified as a fuzzy morphological associative memory (FMAM), the KS-FAM constitutes a two-layer non-distributive model. In this paper, we prove several theorems concerning the conditions of perfect recall, the absolute storage capacity, and the output patterns produced by the KS-FAM. In addition, we propose a normalization strategy for the training and recall phases of the KS-FAM. We employ this strategy to compare the error correction capabilities of the KS-FAM and other fuzzy and gray-scale associative memories in terms of some experimental results concerning gray-scale image reconstruction. Finally, we apply the KS-FAM to the task of vision-based self-localization in robotics. 相似文献
148.
Elena Lloret Alexandra Balahur José M. Gómez Andrés Montoyo Manuel Palomar 《Journal of Intelligent Information Systems》2012,39(3):711-747
The exponential increase of subjective, user-generated content since the birth of the Social Web, has led to the necessity of developing automatic text processing systems able to extract, process and present relevant knowledge. In this paper, we tackle the Opinion Retrieval, Mining and Summarization task, by proposing a unified framework, composed of three crucial components (information retrieval, opinion mining and text summarization) that allow the retrieval, classification and summarization of subjective information. An extensive analysis is conducted, where different configurations of the framework are suggested and analyzed, in order to determine which is the best one, and under which conditions. The evaluation carried out and the results obtained show the appropriateness of the individual components, as well as the framework as a whole. By achieving an improvement over 10% compared to the state-of-the-art approaches in the context of blogs, we can conclude that subjective text can be efficiently dealt with by means of our proposed framework. 相似文献
149.
Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods and a multilevel approach of Dhillon et al. (TPAMI 29:1944–1957, 2007), called graclus. Their aim is to obtain good solutions in a small amount of time for large instances. Metaheuristics are general frameworks for stochastic searches often employed in global optimization to improve the solutions obtained by other heuristics. Variable neighborhood search (VNS) is a metaheuristic which exploits systematically the idea of neighborhood change during the search. In this paper, we propose a VNS heuristic for normalized cut segmentation. Computational experiments show that in most cases this VNS heuristic improves significantly, and in moderate time, the solutions obtained by the current state-of-the-art algorithms, i.e., graclus and a spectral method proposed by Yu and Shi (ICCV, 2003). 相似文献
150.
Bergmeir C García Silvente M Benítez JM 《Computer methods and programs in biomedicine》2012,107(3):497-512
In order to automate cervical cancer screening tests, one of the most important and longstanding challenges is the segmentation of cell nuclei in the stained specimens. Though nuclei of isolated cells in high-quality acquisitions often are easy to segment, the problem lies in the segmentation of large numbers of nuclei with various characteristics under differing acquisition conditions in high-resolution scans of the complete microscope slides. We implemented a system that enables processing of full resolution images, and proposes a new algorithm for segmenting the nuclei under adequate control of the expert user. The system can work automatically or interactively guided, to allow for segmentation within the whole range of slide and image characteristics. It facilitates data storage and interaction of technical and medical experts, especially with its web-based architecture. The proposed algorithm localizes cell nuclei using a voting scheme and prior knowledge, before it determines the exact shape of the nuclei by means of an elastic segmentation algorithm. After noise removal with a mean-shift and a median filtering takes place, edges are extracted with a Canny edge detection algorithm. Motivated by the observation that cell nuclei are surrounded by cytoplasm and their shape is roughly elliptical, edges adjacent to the background are removed. A randomized Hough transform for ellipses finds candidate nuclei, which are then processed by a level set algorithm. The algorithm is tested and compared to other algorithms on a database containing 207 images acquired from two different microscope slides, with promising results. 相似文献