全文获取类型
收费全文 | 49944篇 |
免费 | 3296篇 |
国内免费 | 45篇 |
专业分类
电工技术 | 352篇 |
综合类 | 21篇 |
化学工业 | 10211篇 |
金属工艺 | 874篇 |
机械仪表 | 1034篇 |
建筑科学 | 1485篇 |
矿业工程 | 104篇 |
能源动力 | 1050篇 |
轻工业 | 8845篇 |
水利工程 | 520篇 |
石油天然气 | 191篇 |
武器工业 | 6篇 |
无线电 | 1927篇 |
一般工业技术 | 8359篇 |
冶金工业 | 11205篇 |
原子能技术 | 180篇 |
自动化技术 | 6921篇 |
出版年
2024年 | 87篇 |
2023年 | 446篇 |
2022年 | 536篇 |
2021年 | 1233篇 |
2020年 | 1062篇 |
2019年 | 1168篇 |
2018年 | 2046篇 |
2017年 | 2009篇 |
2016年 | 2117篇 |
2015年 | 1585篇 |
2014年 | 1897篇 |
2013年 | 4027篇 |
2012年 | 3002篇 |
2011年 | 2773篇 |
2010年 | 2306篇 |
2009年 | 2049篇 |
2008年 | 2055篇 |
2007年 | 1908篇 |
2006年 | 1287篇 |
2005年 | 1109篇 |
2004年 | 1001篇 |
2003年 | 955篇 |
2002年 | 869篇 |
2001年 | 667篇 |
2000年 | 596篇 |
1999年 | 648篇 |
1998年 | 3537篇 |
1997年 | 2325篇 |
1996年 | 1505篇 |
1995年 | 887篇 |
1994年 | 673篇 |
1993年 | 735篇 |
1992年 | 261篇 |
1991年 | 253篇 |
1990年 | 191篇 |
1989年 | 200篇 |
1988年 | 212篇 |
1987年 | 187篇 |
1986年 | 170篇 |
1985年 | 192篇 |
1984年 | 169篇 |
1983年 | 115篇 |
1982年 | 153篇 |
1981年 | 179篇 |
1980年 | 195篇 |
1979年 | 94篇 |
1978年 | 92篇 |
1977年 | 337篇 |
1976年 | 724篇 |
1973年 | 86篇 |
排序方式: 共有10000条查询结果,搜索用时 850 毫秒
911.
Anja Le Blanc John Brooke Donal Fellows Marco Soldati David Pérez-Suárez Alessandro Marassi Andrej Santin 《Journal of Grid Computing》2013,11(3):481-503
In this paper we describe how we have introduced workflows into the working practices of a community for whom the concept of workflows is very new, namely the heliophysics community. Heliophysics is a branch of astrophysics which studies the Sun and the interactions between the Sun and the planets, by tracking solar events as they travel throughout the Solar system. Heliophysics produces two major challenges for workflow technology. Firstly it is a systems science where research is currently developed by many different communities who need reliable data models and metadata to be able to work together. Thus it has major challenges in the semantics of workflows. Secondly, the problem of time is critical in heliophysics; the workflows must take account of the propagation of events outwards from the sun. They have to address the four dimensional nature of space and time in terms of the indexing of data. We discuss how we have built an environment for Heliophysics workflows building on and extending the Taverna workflow system and utilising the myExperiment site for sharing workflows. We also describe how we have integrated the workflows into the existing practices of the communities involved in Heliophysics by developing a web portal which can hide the technical details from the users, who can concentrate on the data from their scientific point of view rather than on the methods used to integrate and process the data. This work has been developed in the EU Framework 7 project HELIO, and is being disseminated to the worldwide Heliophysics community, since Heliophysics requires integration of effort on a global scale. 相似文献
912.
E.?J.?Vega A.?M.?Ga?án-Calvo J.?M.?MontaneroEmail author M.?G.?Cabezas M.?A.?Herrada 《Microfluidics and nanofluidics》2013,14(1-2):101-111
A new technique for producing steady metallic jets is proposed. It allows the production of supercritical jets with Weber numbers well below unity, which entails important technological advantages over existing techniques. The metallic liquid is injected through a micrometer converging nozzle located inside a gas stream. Both the liquid jet and the coflowing gas current cross an orifice located in front of the nozzle. The gas stream stabilizes the jet by sweeping away the capillary waves growing on the free surface. In this way, one can steadily produce microjets with a kinetic energy much lower than the interfacial energy, a possibility that has been predicted theoretically (Gañán-Calvo in Phys Rev E 78:026304, 2008). Experiments were conducted with mercury to assess the performance of the new technique. The experimental results agreed remarkably well with the predictions calculated from the convective/absolute instability transition of the jet. The jet breakup mechanism did not correspond to classical Rayleigh instability, but to the growth of surface waves over a capillary column which ends at a fixed location. The results were compared with those obtained with the well-established flow focusing method to show that the new technique considerably favors the jet’s stability. 相似文献
913.
Juan Manuel González Calleros Josefina Guerrero García Jean Vanderdonckt 《Universal Access in the Information Society》2013,12(4):387-401
The need for accessibility evaluation tools is motivated by several endogenous and exogenous reasons coming from the end user (the designer and the developer) and companies releasing information systems. Existing evaluation tools mainly concentrate on examining the code of Web pages: Web pages more and more frequently contain non-HTML parts that entirely escape from being treated by existing techniques. This is the case of the advanced human–machine interface (AHMI), a piece of software programmed in C/C++, used for controlling the advanced flight management system in the aircraft cockpit. Studying this new user interface (UI) requires a structured approach to evaluate and validate AHMI designs. The goal in this work is to develop an evaluation tool to automate the process of evaluating the AHMI. The method addresses: support of multiple bases of guidelines (accessibility or usability or both) on-demand (partial or total evaluation), with different levels of details (a presentation for developers and for those responsible for certifying accessibility). The method goes a step toward the automatic evaluation of UI containing non-HTML parts. 相似文献
914.
Lázaro Campoalegre Pere Brunet Isabel Navazo 《Personal and Ubiquitous Computing》2013,17(7):1503-1514
Interactive visualization of volume models in standard mobile devices is a challenging present problem with increasing interest from new application fields like telemedicine. The complexity of present volume models in medical applications is continuously increasing, therefore increasing the gap between the available models and the rendering capabilities in low-end mobile clients. New and efficient rendering algorithms and interaction paradigms are required for these small platforms. In this paper, we propose a transfer function-aware compression and interaction scheme, for client-server architectures with visualization on standard mobile devices. The scheme is block-based, supporting adaptive ray-casting in the client. Our two-level ray-casting allows focusing on small details on targeted regions while keeping bounded memory requirements in the GPU of the client. Our approach includes a transfer function-aware compression scheme based on a local wavelet transformation, together with a bricking scheme that supports interactive inspection and levels of detail in the mobile device client. We also use a quantization technique that takes into account a perceptive metrics of the visual error. Our results show that we can have full interaction with high compression rates and with transmitted model sizes that can be of the order of a single photographic image. 相似文献
915.
A new graphical visualization of n-dimensional Pareto front for decision-making in multiobjective optimization 总被引:1,自引:0,他引:1
New challenges in engineering design lead to multiobjective (multicriteria) problems. In this context, the Pareto front supplies a set of solutions where the designer (decision-maker) has to look for the best choice according to his preferences. Visualization techniques often play a key role in helping decision-makers, but they have important restrictions for more than two-dimensional Pareto fronts. In this work, a new graphical representation, called Level Diagrams, for n-dimensional Pareto front analysis is proposed. Level Diagrams consists of representing each objective and design parameter on separate diagrams. This new technique is based on two key points: classification of Pareto front points according to their proximity to ideal points measured with a specific norm of normalized objectives (several norms can be used); and synchronization of objective and parameter diagrams. Some of the new possibilities for analyzing Pareto fronts are shown. Additionally, in order to introduce designer preferences, Level Diagrams can be coloured, so establishing a visual representation of preferences that can help the decision-maker. Finally, an example of a robust control design is presented - a benchmark proposed at the American Control Conference. This design is set as a six-dimensional multiobjective problem. 相似文献
916.
917.
Gildásio Lecchi Cravo Glaydston Mattos Ribeiro Luiz Antonio Nogueira Lorena 《Computers & Geosciences》2008,34(4):373-386
The point-feature cartographic label placement problem (PFCLP) is an NP-hard problem, which appears during the production of maps. The labels must be placed in predefined places avoiding overlaps and considering cartographic preferences. Owing to its high complexity, several heuristics have been presented searching for approximated solutions. This paper proposes a greedy randomized adaptive search procedure (GRASP) for the PFCLP that is based on its associated conflict graph. The computational results show that this metaheuristic is a good strategy for PFCLP, generating better solutions than all those reported in the literature in reasonable computational times. 相似文献
918.
Algorithm based on simulated annealing for land-use allocation 总被引:1,自引:0,他引:1
Inés Santé-Riveira Marcos Boullón-Magán Rafael Crecente-Maseda David Miranda-Barrós 《Computers & Geosciences》2008,34(3):259-268
This article describes the use of simulated annealing for allocation of land units to a set of possible uses on, the basis of their suitability for those uses, and the compactness of the total areas allotted to the same use or kind of use, which are fixed a priori. The results obtained for the Terra Chá district of Galicia (N.W. Spain) using different objective weighting schemes are compared with each other and with those obtained for this district under the same area constraints, using hierarchical optimization, ideal point analysis, and multi-objective land allocation (MOLA) to maximize average use suitability. Inclusion of compactness in the simulated annealing objective function avoids the highly disperse allocations typical of optimizations that ignore this sub-objective. 相似文献
919.
Miloš Hašan Edgar Velázquez‐Armendáriz Fabio Pellacini Kavita Bala 《Computer Graphics Forum》2008,27(4):1105-1114
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation. 相似文献
920.
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. 相似文献