全文获取类型
收费全文 | 10994篇 |
免费 | 1016篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 85篇 |
综合类 | 6篇 |
化学工业 | 2721篇 |
金属工艺 | 136篇 |
机械仪表 | 346篇 |
建筑科学 | 501篇 |
矿业工程 | 26篇 |
能源动力 | 239篇 |
轻工业 | 2237篇 |
水利工程 | 86篇 |
石油天然气 | 20篇 |
无线电 | 806篇 |
一般工业技术 | 2158篇 |
冶金工业 | 710篇 |
原子能技术 | 26篇 |
自动化技术 | 1920篇 |
出版年
2024年 | 39篇 |
2023年 | 161篇 |
2022年 | 137篇 |
2021年 | 371篇 |
2020年 | 319篇 |
2019年 | 312篇 |
2018年 | 443篇 |
2017年 | 455篇 |
2016年 | 561篇 |
2015年 | 478篇 |
2014年 | 613篇 |
2013年 | 1127篇 |
2012年 | 986篇 |
2011年 | 775篇 |
2010年 | 573篇 |
2009年 | 550篇 |
2008年 | 588篇 |
2007年 | 512篇 |
2006年 | 458篇 |
2005年 | 309篇 |
2004年 | 276篇 |
2003年 | 247篇 |
2002年 | 237篇 |
2001年 | 147篇 |
2000年 | 126篇 |
1999年 | 111篇 |
1998年 | 149篇 |
1997年 | 126篇 |
1996年 | 91篇 |
1995年 | 90篇 |
1994年 | 80篇 |
1993年 | 72篇 |
1992年 | 45篇 |
1991年 | 33篇 |
1990年 | 23篇 |
1989年 | 23篇 |
1988年 | 27篇 |
1987年 | 19篇 |
1986年 | 26篇 |
1985年 | 31篇 |
1984年 | 25篇 |
1983年 | 18篇 |
1982年 | 23篇 |
1981年 | 18篇 |
1980年 | 18篇 |
1979年 | 23篇 |
1978年 | 12篇 |
1977年 | 11篇 |
1976年 | 17篇 |
1973年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
151.
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. 相似文献
152.
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. 相似文献
153.
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. 相似文献
154.
155.
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco 《Computers & Operations Research》2010,37(11):1886-1898
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP. 相似文献
156.
157.
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. 相似文献
158.
Abir Ben Hmida Mohamed Haouari Marie-José Huguet Pierre Lopez 《Computers & Operations Research》2010,37(12):2192-2201
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones. 相似文献
159.
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. 相似文献
160.
Ivan Alsina-Jurnet José Gutiérrez-Maldonado 《International journal of human-computer studies》2010,68(10):788-801
In the literature, there are few studies of the human factors involved in the engagement of presence. The present study aims to investigate the influence of five user characteristics – test anxiety, spatial intelligence, verbal intelligence, personality and computer experience – on the sense of presence. This is the first study to investigate the influence of spatial intelligence on the sense of presence, and the first to use an immersive virtual reality system to investigate the relationship between users’ personality characteristics and presence. The results show a greater sense of presence in test anxiety environments than in a neutral environment. Moreover, high test anxiety students feel more presence than their non-test anxiety counterparts. Spatial intelligence and introversion also influence the sense of presence experienced by high test anxiety students exposed to anxiety triggering virtual environments. These results may help to identify new groups of patients likely to benefit from virtual reality exposure therapy. 相似文献