全文获取类型
收费全文 | 42936篇 |
免费 | 2403篇 |
国内免费 | 61篇 |
专业分类
电工技术 | 312篇 |
综合类 | 44篇 |
化学工业 | 7850篇 |
金属工艺 | 768篇 |
机械仪表 | 810篇 |
建筑科学 | 1326篇 |
矿业工程 | 89篇 |
能源动力 | 849篇 |
轻工业 | 6081篇 |
水利工程 | 390篇 |
石油天然气 | 177篇 |
武器工业 | 4篇 |
无线电 | 2413篇 |
一般工业技术 | 7463篇 |
冶金工业 | 10682篇 |
原子能技术 | 206篇 |
自动化技术 | 5936篇 |
出版年
2023年 | 363篇 |
2022年 | 379篇 |
2021年 | 938篇 |
2020年 | 775篇 |
2019年 | 702篇 |
2018年 | 1548篇 |
2017年 | 1550篇 |
2016年 | 1611篇 |
2015年 | 1140篇 |
2014年 | 1477篇 |
2013年 | 2825篇 |
2012年 | 2511篇 |
2011年 | 2327篇 |
2010年 | 1841篇 |
2009年 | 1642篇 |
2008年 | 1887篇 |
2007年 | 1673篇 |
2006年 | 1261篇 |
2005年 | 1045篇 |
2004年 | 971篇 |
2003年 | 858篇 |
2002年 | 774篇 |
2001年 | 496篇 |
2000年 | 492篇 |
1999年 | 654篇 |
1998年 | 3437篇 |
1997年 | 2065篇 |
1996年 | 1339篇 |
1995年 | 781篇 |
1994年 | 667篇 |
1993年 | 658篇 |
1992年 | 219篇 |
1991年 | 232篇 |
1990年 | 227篇 |
1989年 | 222篇 |
1988年 | 197篇 |
1987年 | 175篇 |
1986年 | 192篇 |
1985年 | 219篇 |
1984年 | 191篇 |
1983年 | 137篇 |
1982年 | 166篇 |
1981年 | 183篇 |
1980年 | 165篇 |
1979年 | 132篇 |
1978年 | 122篇 |
1977年 | 209篇 |
1976年 | 438篇 |
1975年 | 95篇 |
1973年 | 84篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Kalou Cabrera Castillos Frédéric Dadeau Jacques Julliand 《International Journal on Software Tools for Technology Transfer (STTT)》2011,13(5):431-448
We present in this article a way to produce test suites applied to the POSIX mini-challenge based on a behavioral model of
a file system manager written in UML/OCL. We illustrate the limitations of a fully automated test generation approach, which
justifies the use of test scenarios as a complement to a functional testing approach. Scenarios are expressed through regular
expressions describing sequences of operations, possibly punctuated by intermediate states that have to be reached by the
execution of the model. Scenarios are unfolded into extended sequences of operations that are played on the model using symbolic
animation techniques. We experimented our approach by testing the conformance of two different file systems w.r.t. the POSIX
standard: a recent Linux distribution and a customized Java implementation of POSIX used to evaluate the relevance of our
approach and its complementarity with a structural test generation approach. 相似文献
992.
993.
Antonio Fernández Anta José Luis López-Presa M. Araceli Lorenzo Pilar Manzano Juan Martinez-Romo Alberto Mozo Christopher Thraves 《Theory of Computing Systems》2011,48(1):1-22
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in
Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized
CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing.
In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining
constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the
remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS)
and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference
is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively
(the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds
we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show
that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call
Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy
is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish,
we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection
of packets. 相似文献
994.
The localization of the components of an object near to a device before obtaining the real interaction is usually determined by means of a proximity measurement to the device of the object’s features. In order to do this efficiently, hierarchical decompositions are used, so that the features of the objects are classified into several types of cells, usually rectangular.In this paper we propose a solution based on the classification of a set of points situated on the device in a little-known spatial decomposition named tetra-tree. Using this type of spatial decomposition gives us several quantitative and qualitative properties that allow us a more realistic and intuitive visual interaction, as well as the possibility of selecting inaccessible components. These features could be used in virtual sculpting or accessibility tasks.In order to show these properties we have compared an interaction system based on tetra-trees to one based on octrees. 相似文献
995.
996.
Sónia M. Almeida-Luz Miguel A. Vega-Rodríguez Juan A. Gómez-Púlido Juan M. Sánchez-Pérez 《Applied Soft Computing》2011,11(1):410-427
In this work we present two new approaches to solve the location management problem, respectively, based on the location areas and the reporting cells strategies. The location management problem corresponds to the management of the network configuration with the objective of minimizing the costs involved. We use the differential evolution algorithm to find the best configuration for the location areas and the reporting cells strategies, which principally considers the location update and paging costs. With this work we want to define the best values to the differential evolution configuration, using test networks and also realistic networks, as well as compare our results with the ones obtained by other authors. These two new approaches applied to this problem have given us very good results, when compared with those obtained by other authors. 相似文献
997.
998.
Jean-François Jerier Vincent Richefeu Didier Imbault Fréderic-Victor Donzé 《Computer Methods in Applied Mechanics and Engineering》2010,199(25-28):1668-1676
We introduce a new geometric method to generate sphere packings with restricted overlap values. Sample generation is an important, but time-consuming, step that precedes a calculation performed with the discrete element method (DEM). At present, there does not exist any software dedicated to DEM which would be similar to the mesh software that exists for finite element methods (FEM). A practical objective of the method is to build very large sphere packings (several hundreds of thousands) in a few minutes instead of several days as the current dynamic methods do. The developed algorithm uses a new geometric procedure to position very efficiently the polydisperse spheres in a tetrahedral mesh. The algorithm, implemented into YADE-OPEN DEM (open-source software), consists in filling tetrahedral meshes with spheres. In addition to the features of the tetrahedral mesh, the input parameters are the minimum and maximum radii (or their size ratio), and the magnitude of authorized overlaps. The filling procedure is stopped when a target solid fraction or number of spheres is reached. Based on this method, an efficient tool can be designed for DEMs used by researchers and engineers. The generated packings can be isotropic and the number of contacts per sphere is very high due to its geometric procedure. In this paper, different properties of the generated packings are characterized and examples from real industrial problems are presented to show how this method can be used. The current C++ version of this packing algorithm is part of YADE-OPEN DEM [20] available on the web (https://yade-dem.org). 相似文献
999.
Veronika Šoltészová Daniel Patel Stefan Bruckner Ivan Viola 《Computer Graphics Forum》2010,29(3):883-891
In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent directional occlusion shading model by enabling light source positioning with practically no performance penalty. Light transport is approximated using a tilted cone‐shaped function which leaves elliptic footprints in the opacity buffer during slice‐based volume rendering. We perform an incremental blurring operation on the opacity buffer for each slice in front‐to‐back order. This buffer is then used to define the degree of occlusion for the subsequent slice. Our method is capable of generating high‐quality soft shadowing effects, allows interactive modification of all illumination and rendering parameters, and requires no pre‐computation. 相似文献
1000.
This paper introduces the use of a visual attention model to improve the accuracy of gaze tracking systems. Visual attention models simulate the selective attention part of the human visual system. For instance, in a bottom‐up approach, a saliency map is defined for the image and gives an attention weight to every pixel of the image as a function of its colour, edge or intensity. Our algorithm uses an uncertainty window, defined by the gaze tracker accuracy, and located around the gaze point given by the tracker. Then, using a visual attention model, it searches for the most salient points, or objects, located inside this uncertainty window, and determines a novel, and hopefully, better gaze point. This combination of a gaze tracker together with a visual attention model is considered as the main contribution of the paper. We demonstrate the promising results of our method by presenting two experiments conducted in two different contexts: (1) a free exploration of a visually rich 3D virtual environment without a specific task, and (2) a video game based on gaze tracking involving a selection task. Our approach can be used to improve real‐time gaze tracking systems in many interactive 3D applications such as video games or virtual reality applications. The use of a visual attention model can be adapted to any gaze tracker and the visual attention model can also be adapted to the application in which it is used. 相似文献