全文获取类型
收费全文 | 3337篇 |
免费 | 223篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 25篇 |
综合类 | 4篇 |
化学工业 | 657篇 |
金属工艺 | 62篇 |
机械仪表 | 85篇 |
建筑科学 | 148篇 |
矿业工程 | 11篇 |
能源动力 | 81篇 |
轻工业 | 444篇 |
水利工程 | 31篇 |
石油天然气 | 5篇 |
无线电 | 290篇 |
一般工业技术 | 687篇 |
冶金工业 | 386篇 |
原子能技术 | 8篇 |
自动化技术 | 641篇 |
出版年
2024年 | 7篇 |
2023年 | 48篇 |
2022年 | 37篇 |
2021年 | 106篇 |
2020年 | 83篇 |
2019年 | 79篇 |
2018年 | 148篇 |
2017年 | 167篇 |
2016年 | 171篇 |
2015年 | 116篇 |
2014年 | 152篇 |
2013年 | 314篇 |
2012年 | 256篇 |
2011年 | 207篇 |
2010年 | 196篇 |
2009年 | 175篇 |
2008年 | 161篇 |
2007年 | 133篇 |
2006年 | 101篇 |
2005年 | 96篇 |
2004年 | 67篇 |
2003年 | 73篇 |
2002年 | 75篇 |
2001年 | 34篇 |
2000年 | 25篇 |
1999年 | 32篇 |
1998年 | 86篇 |
1997年 | 68篇 |
1996年 | 36篇 |
1995年 | 36篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 13篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 7篇 |
1988年 | 15篇 |
1987年 | 12篇 |
1986年 | 15篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1976年 | 12篇 |
1974年 | 6篇 |
1973年 | 8篇 |
排序方式: 共有3565条查询结果,搜索用时 15 毫秒
41.
42.
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. 相似文献
43.
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. 相似文献
44.
The availability of multicore processors and programmable NICs, such as TOEs (TCP/IP Offloading Engines), provides new opportunities for designing efficient network interfaces to cope with the gap between the improvement rates of link bandwidths and microprocessor performance. This gap poses important challenges related with the high computational requirements associated to the traffic volumes and wider functionality that the network interface has to support. This way, taking into account the rate of link bandwidth improvement and the ever changing and increasing application demands, efficient network interface architectures require scalability and flexibility. An opportunity to reach these goals comes from the exploitation of the parallelism in the communication path by distributing the protocol processing work across processors which are available in the computer, i.e. multicore microprocessors and programmable NICs.Thus, after a brief review of the different solutions that have been previously proposed for speeding up network interfaces, this paper analyzes the onloading and offloading alternatives. Both strategies try to release host CPU cycles by taking advantage of the communication workload execution in other processors present in the node. Nevertheless, whereas onloading uses another general-purpose processor, either included in a chip multiprocessor (CMP) or in a symmetric multiprocessor (SMP), offloading takes advantage of processors in programmable network interface cards (NICs). From our experiments, implemented by using a full-system simulator, we provide a fair and more complete comparison between onloading and offloading. Thus, it is shown that the relative improvement on peak throughput offered by offloading and onloading depends on the rate of application workload to communication overhead, the message sizes, and on the characteristics of the system architecture, more specifically the bandwidth of the buses and the way the NIC is connected to the system processor and memory. In our implementations, offloading provides lower latencies than onloading, although the CPU utilization and interrupts are lower for onloading. Taking into account the conclusions of our experimental results, we propose a hybrid network interface that can take advantage of both, programmable NICs and multicore processors. 相似文献
45.
Using an asymptotic characterization of probabilistic finite state languages over a one-letter alphabet we construct a probabilistic
language with regular support that cannot be generated by probabilistic CFGs. Since all probability values used in the example
are rational, our work is immune to the criticism leveled by Suppes (Synthese 22:95–116, 1970) against the work of Ellis (1969) who first constructed probabilistic FSLs that admit no probabilistic FSGs. Some implications for probabilistic language
modeling by HMMs are discussed. 相似文献
46.
47.
Fumiya Iida Yohei Minekawa Jürgen Rummel André Seyfarth 《Robotics and Autonomous Systems》2009,57(2):139-144
Conventional models of bipedal walking generally assume rigid body structures, while elastic material properties seem to play an essential role in nature. On the basis of a novel theoretical model of bipedal walking, this paper investigates a model of biped robot which makes use of minimum control and elastic passive joints inspired from the structures of biological systems. The model is evaluated in simulation and a physical robotic platform by analyzing the kinematics and ground reaction force. The experimental results show that, with a proper leg design of passive dynamics and elasticity, an attractor state of human-like walking gait patterns can be achieved through extremely simple control without sensory feedback. The detailed analysis also explains how the dynamic human-like gait can contribute to adaptive biped walking. 相似文献
48.
Pattern classification with mixtures of weighted least-squares support vector machine experts 总被引:1,自引:1,他引:0
Clodoaldo A. M. Lima André L. V. Coelho Fernando J. Von Zuben 《Neural computing & applications》2009,18(7):843-860
Support Vector Machine (SVM) classifiers are high-performance classification models devised to comply with the structural risk minimization principle and to properly exploit the kernel artifice of nonlinearly mapping input data into high-dimensional feature spaces toward the automatic construction of better discriminating linear decision boundaries. Among several SVM variants, Least-Squares SVMs (LS-SVMs) have gained increased attention recently due mainly to their computationally attractive properties coming as the direct result of applying a modified formulation that makes use of a sum-squared-error cost function jointly with equality, instead of inequality, constraints. In this work, we present a flexible hybrid approach aimed at augmenting the proficiency of LS-SVM classifiers with regard to accuracy/generalization as well as to hyperparameter calibration issues. Such approach, named as Mixtures of Weighted Least-Squares Support Vector Machine Experts, centers around the fusion of the weighted variant of LS-SVMs with Mixtures of Experts models. After the formal characterization of the novel learning framework, simulation results obtained with respect to both binary and multiclass pattern classification problems are reported, ratifying the suitability of the novel hybrid approach in improving the performance issues considered. 相似文献
49.
In this study, an optimization of the airfoil of a sailplane is carried out by a recently developed multi-objective genetic algorithm based on microevolution, containing crowding, range adaptation, knowledge-based reinitialization and ε-dominance. Its efficiency was tested on a set of test problems. The results are encouraging, suggesting that very small populations can be used effectively to solve real-world multi-objective optimization problems in many cases of interest. 相似文献
50.
André Twele Wenxi Cao Simon Plank Sandro Martinis 《International journal of remote sensing》2016,37(13):2990-3004
This article presents an automated Sentinel-1-based processing chain designed for flood detection and monitoring in near-real-time (NRT). Since no user intervention is required at any stage of the flood mapping procedure, the processing chain allows deriving time-critical disaster information in less than 45 min after a new data set is available on the Sentinel Data Hub of the European Space Agency (ESA). Due to the systematic acquisition strategy and high repetition rate of Sentinel-1, the processing chain can be set up as a web-based service that regularly informs users about the current flood conditions in a given area of interest. The thematic accuracy of the thematic processor has been assessed for two test sites of a flood situation at the border between Greece and Turkey with encouraging overall accuracies between 94.0% and 96.1% and Cohen’s kappa coefficients (κ) ranging from 0.879 to 0.910. The accuracy assessment, which was performed separately for the standard polarizations (VV/VH) of the interferometric wide swath (IW) mode of Sentinel-1, further indicates that under calm wind conditions, slightly higher thematic accuracies can be achieved by using VV instead of VH polarization data. 相似文献