全文获取类型
收费全文 | 10998篇 |
免费 | 871篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 85篇 |
综合类 | 8篇 |
化学工业 | 2735篇 |
金属工艺 | 122篇 |
机械仪表 | 333篇 |
建筑科学 | 506篇 |
矿业工程 | 23篇 |
能源动力 | 230篇 |
轻工业 | 2249篇 |
水利工程 | 103篇 |
石油天然气 | 21篇 |
无线电 | 822篇 |
一般工业技术 | 2079篇 |
冶金工业 | 505篇 |
原子能技术 | 25篇 |
自动化技术 | 2036篇 |
出版年
2024年 | 37篇 |
2023年 | 152篇 |
2022年 | 140篇 |
2021年 | 372篇 |
2020年 | 304篇 |
2019年 | 305篇 |
2018年 | 477篇 |
2017年 | 480篇 |
2016年 | 569篇 |
2015年 | 446篇 |
2014年 | 571篇 |
2013年 | 1052篇 |
2012年 | 1013篇 |
2011年 | 908篇 |
2010年 | 575篇 |
2009年 | 538篇 |
2008年 | 602篇 |
2007年 | 548篇 |
2006年 | 431篇 |
2005年 | 313篇 |
2004年 | 298篇 |
2003年 | 248篇 |
2002年 | 237篇 |
2001年 | 136篇 |
2000年 | 134篇 |
1999年 | 90篇 |
1998年 | 82篇 |
1997年 | 85篇 |
1996年 | 70篇 |
1995年 | 65篇 |
1994年 | 67篇 |
1993年 | 55篇 |
1992年 | 39篇 |
1991年 | 30篇 |
1990年 | 20篇 |
1989年 | 24篇 |
1988年 | 24篇 |
1987年 | 13篇 |
1986年 | 19篇 |
1985年 | 28篇 |
1984年 | 28篇 |
1983年 | 18篇 |
1982年 | 21篇 |
1981年 | 24篇 |
1980年 | 16篇 |
1979年 | 26篇 |
1978年 | 13篇 |
1974年 | 9篇 |
1973年 | 11篇 |
1947年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
To meet the requirements of comprehensively characterizing the morphology of thin films and substrates, a suitable combination of different measuring techniques should be chosen, i.e., a nonoptical surface profile measurement should be used together with optical analysis. It is demonstrated on selected examples of fluoride and oxide films that the use of atomic force microscopy and light scattering fulfills the demand of appropriate quantitative characterization over a sufficiently large range of bandwidths. 相似文献
122.
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. 相似文献
123.
Diego Castaño José Patricio Díaz Varela Antoni Torrens 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(7):1449-1455
In this paper, we show that free algebras in the variety of residuated lattices and some of its subvarieties are directly
indecomposable and show, as a consequence, the direct indecomposability of free algebras for some classes of their bounded
implicative subreducts. 相似文献
124.
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. 相似文献
125.
126.
André Maués Brabo Pereira Marcos Aurélio Marques Noronha 《Engineering with Computers》2010,26(1):35-47
Most post-processors for boundary element (BE) analysis use an auxiliary domain mesh to display domain results, working against
the profitable modelling process of a pure boundary discretization. This paper introduces a novel visualization technique
which preserves the basic properties of the boundary element methods. The proposed algorithm does not require any domain discretization
and is based on the direct and automatic identification of isolines. Another critical aspect of the visualization of domain
results in BE analysis is the effort required to evaluate results in interior points. In order to tackle this issue, the present
article also provides a comparison between the performance of two different BE formulations (conventional and hybrid). In
addition, this paper presents an overview of the most common post-processing and visualization techniques in BE analysis,
such as the classical algorithms of scan line and the interpolation over a domain discretization. The results presented herein
show that the proposed algorithm offers a very high performance compared with other visualization procedures. 相似文献
127.
José L. Risco-Martín David Atienza J. Manuel Colmenar Oscar Garnica 《Parallel Computing》2010,36(10-11):572-590
For the last 30 years, several dynamic memory managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers often face difficult choices in selecting the most suitable approach for their applications. This issue has special impact in the field of portable consumer embedded systems, that must execute a limited amount of multimedia applications (e.g., 3D games, video players, signal processing software, etc.), demanding high performance and extensive memory usage at a low energy consumption. Recently, we have developed a novel methodology based on genetic programming to automatically design custom DMMs, optimizing performance, memory usage and energy consumption. However, although this process is automatic and faster than state-of-the-art optimizations, it demands intensive computation, resulting in a time-consuming process. Thus, parallel processing can be very useful to enable to explore more solutions spending the same time, as well as to implement new algorithms. In this paper we present a novel parallel evolutionary algorithm for DMMs optimization in embedded systems, based on the Discrete Event Specification (DEVS) formalism over a Service Oriented Architecture (SOA) framework. Parallelism significantly improves the performance of the sequential exploration algorithm. On the one hand, when the number of generations are the same in both approaches, our parallel optimization framework is able to reach a speed-up of 86.40× when compared with other state-of-the-art approaches. On the other, it improves the global quality (i.e., level of performance, low memory usage and low energy consumption) of the final DMM obtained in a 36.36% with respect to two well-known general-purpose DMMs and two state-of-the-art optimization methodologies. 相似文献
128.
129.
Christian Liebchen Michael Schachtebeck Anita Schöbel Sebastian Stiller André Prigge 《Computers & Operations Research》2010,37(5):857-868
In the past, much research has been dedicated to compute optimum railway timetables. A typical objective has been the minimization of passenger waiting times. But only the planned nominal waiting times have been addressed, whereas delays as they occur in daily operations have been neglected. Delays have been rather treated mainly in an online context and solved as a separate optimization problem, called delay management.We provide the first computational study which aims at computing delay resistant periodic timetables. In particular we assess the delay resistance of a timetable by evaluating it subject to several delay scenarios to which optimum delay management will be applied.We arrive at computing delay resistant timetables by selecting a new objective function which we design to be somehow in the middle of the traditional simple timetabling objective and the sophisticated delay management objective. This is a slight extension of the concept of “light robustness” (LR) as it has been proposed by Fischetti and Monaci [2006. Robust optimization through branch-and-price. In: Proceedings of AIRO]. Moreover, in our application we are able to provide accurate interpretations for the ingredients of LR. We apply this new technique to real-world data of a part of the German railway network of Deutsche Bahn AG. Our computational results suggest that a significant decrease of passenger delays can be obtained at a relatively small price of robustness, i.e. by increasing the nominal travel times of the passengers. 相似文献
130.
Glauston R. Teixeira de Lima José Demísio S. Silva Osamu Saotome 《Neural computing & applications》2010,19(3):421-436
In this paper, we report results obtained with a Madaline neural network trained to classify inductive signatures of two vehicles classes: trucks with one rear axle and trucks with double rear axle. In order to train the Madaline, the inductive signatures were pre-processed and both classes, named C2 and C3, were subdivided into four subclasses. Thus, the initial classification task was split into four smaller tasks (theoretically) easier to be performed. The heuristic adopted in the training attempts to minimize the effects of the input space non-linearity on the classifier performance by uncoupling the learning of the classes and, for this, we induce output Adalines to specialize in learning one of the classes. The percentages of correct classifications presented concern patterns which were not submitted to the neural network in the training process, and, therefore, they indicate the neural network generalization ability. The results are good and stimulate the maintenance of this research on the use of Madaline networks in vehicle classification tasks using not linearly separable inductive signatures. 相似文献