全文获取类型
收费全文 | 7214篇 |
免费 | 208篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 109篇 |
综合类 | 8篇 |
化学工业 | 1534篇 |
金属工艺 | 169篇 |
机械仪表 | 115篇 |
建筑科学 | 406篇 |
矿业工程 | 44篇 |
能源动力 | 137篇 |
轻工业 | 903篇 |
水利工程 | 46篇 |
石油天然气 | 14篇 |
无线电 | 570篇 |
一般工业技术 | 1116篇 |
冶金工业 | 1350篇 |
原子能技术 | 66篇 |
自动化技术 | 844篇 |
出版年
2022年 | 67篇 |
2021年 | 104篇 |
2020年 | 72篇 |
2019年 | 100篇 |
2018年 | 108篇 |
2017年 | 92篇 |
2016年 | 138篇 |
2015年 | 111篇 |
2014年 | 201篇 |
2013年 | 335篇 |
2012年 | 276篇 |
2011年 | 295篇 |
2010年 | 254篇 |
2009年 | 262篇 |
2008年 | 273篇 |
2007年 | 244篇 |
2006年 | 273篇 |
2005年 | 206篇 |
2004年 | 186篇 |
2003年 | 180篇 |
2002年 | 140篇 |
2001年 | 124篇 |
2000年 | 128篇 |
1999年 | 126篇 |
1998年 | 329篇 |
1997年 | 227篇 |
1996年 | 177篇 |
1995年 | 114篇 |
1994年 | 135篇 |
1993年 | 120篇 |
1992年 | 80篇 |
1991年 | 72篇 |
1990年 | 77篇 |
1989年 | 95篇 |
1988年 | 73篇 |
1987年 | 77篇 |
1986年 | 62篇 |
1985年 | 79篇 |
1984年 | 79篇 |
1983年 | 61篇 |
1982年 | 49篇 |
1981年 | 66篇 |
1980年 | 64篇 |
1979年 | 60篇 |
1978年 | 68篇 |
1977年 | 80篇 |
1976年 | 112篇 |
1975年 | 60篇 |
1974年 | 58篇 |
1973年 | 44篇 |
排序方式: 共有7431条查询结果,搜索用时 15 毫秒
101.
Integrating intelligent job-scheduling into a real-world production-scheduling system 总被引:1,自引:0,他引:1
The paper addresses the problem of scheduling production orders (jobs). First, an approach based on simulated annealing and Hopfield nets is described. Since performance was unsatisfactory for real-world applications, we changed the problem representation and tuned the scheduling method, dropping features of the Hopfield net and retaining simulated annealing. Both computing time and solution quality were significantly improved. The scheduling method was then integrated into a software system for short-term production planning and control (electronic leitstand). The paper describes how real-world requirements are met, and how the scheduling method interacts with the leitstand's database and graphical representation of schedules. 相似文献
102.
Mimicking human motion with a humanoid robot is essential for allowing humanoid robots to be used in service applications.
Simply creating motions without considerations for balance and stability or directly copying motion from a human using motion
capture and implementing it on a humanoid robot may not be successful because of the difference in physical properties between
the human and the humanoid robot, which may cause instability and make it fall. Using the Zero Moment Point as the stability
criteria, this work proposes a Constrained Analytical Trajectory Filter as part of an Analytical Motion Filter, which stabilizes
a reference motion that can come from human motion capture data, kinematic synthesis, or animation software. The resulting
solutions used in the Constrained Analytical Trajectory Filter provide insight into the complex interactions of motion and
stability. The solutions were verified in simulation and with hardware, showing that the analytical filter can be successfully
applied for stabilizing reference motions for humanoid robots which may be unstable otherwise. 相似文献
103.
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems. 相似文献
104.
105.
Fabien Tricoire Martin Romauch Karl F. Doerner Richard F. Hartl 《Computers & Operations Research》2010,37(2):351-367
We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms. 相似文献
106.
Sophie N. Parragh Karl F. Doerner Richard F. Hartl 《Computers & Operations Research》2010,37(6):1129-1138
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant considered in this paper aims at minimizing total routing costs while respecting maximum route duration limits, time windows, and maximum user ride time limits. We propose a competitive variable neighborhood search-based heuristic, using three classes of neighborhoods. The first neighborhood class uses simple swap operations tailored to the dial-a-ride problem; the second neighborhood class is based on the ejection chain idea; and the third neighborhood class exploits the existence of arcs where the vehicle load is zero, giving rise to natural sequences of requests. We report new best results for 16 out of 20 benchmark instances. 相似文献
107.
In recent work, Kalai, Klivans, Mansour, and Servedio (2005) studied a variant of the “Low-Degree (Fourier) Algorithm” for learning under the uniform probability distribution on {0,1} n . They showed that the L 1 polynomial regression algorithm yields agnostic (tolerant to arbitrary noise) learning algorithms with respect to the class of threshold functions—under certain restricted instance distributions, including uniform on {0,1} n and Gaussian on ? n . In this work we show how all learning results based on the Low-Degree Algorithm can be generalized to give almost identical agnostic guarantees under arbitrary product distributions on instance spaces X 1×???×X n . We also extend these results to learning under mixtures of product distributions. The main technical innovation is the use of (Hoeffding) orthogonal decomposition and the extension of the “noise sensitivity method” to arbitrary product spaces. In particular, we give a very simple proof that threshold functions over arbitrary product spaces have δ-noise sensitivity $O(\sqrt{\delta})$ , resolving an open problem suggested by Peres (2004). 相似文献
108.
Stefan Wagner 《Information and Software Technology》2010,52(11):1230-1241
ContextSoftware quality is a complex concept. Therefore, assessing and predicting it is still challenging in practice as well as in research. Activity-based quality models break down this complex concept into concrete definitions, more precisely facts about the system, process, and environment as well as their impact on activities performed on and with the system. However, these models lack an operationalisation that would allow them to be used in assessment and prediction of quality. Bayesian networks have been shown to be a viable means for this task incorporating variables with uncertainty.ObjectiveThe qualitative knowledge contained in activity-based quality models are an abundant basis for building Bayesian networks for quality assessment. This paper describes a four-step approach for deriving systematically a Bayesian network from an assessment goal and a quality model.MethodThe four steps of the approach are explained in detail and with running examples. Furthermore, an initial evaluation is performed, in which data from NASA projects and an open source system is obtained. The approach is applied to this data and its applicability is analysed.ResultsThe approach is applicable to the data from the NASA projects and the open source system. However, the predictive results vary depending on the availability and quality of the data, especially the underlying general distributions.ConclusionThe approach is viable in a realistic context but needs further investigation in case studies in order to analyse its predictive validity. 相似文献
109.
A turbulent environment characterized by unsteady economic cycles, customized products, a growing bandwidth of products, an exploding number of variants and shorter product life cycles force manufacturers to permanent adaptation of their factories. Flexible and changeable structures will be required to enable factories dealing with the technological challenges and economic pressure of the future competitively. In order to achieve changeability objectives in manufacturing, a detailed analysis of existing structures and its representative attributes is essential. It is the basis for systematic structure planning of factories. In this paper a method for analyzing the capacitive and technological structure of a factory embedded in a network of manufacturing and its network of suppliers is presented. The synchronization of product and production development under the influence of change is intended. Therefore, the structural views of product and production are specifically in focus of the method. Based on the results of the analysis models an approach of a tool for giving product and production structure dynamism is suggested to investigate the effects and dependencies of change drivers in manufacturing. 相似文献
110.
Ko-ichiro Miyamoto Torsten Wagner Shuhei MimuraShin’ichiro Kanoh Tatsuo Yoshinobu Michael J. Schöning 《Sensors and actuators. B, Chemical》2011,154(2):119-123
The constant-phase-mode operation of the light-addressable potentiometric sensor (LAPS) is proposed and demonstrated. In this new operation mode, the temporal change and the spatial distribution of the analyte concentration are recorded in the form of the bias voltage applied to the LAPS sensor plate, which is servo-controlled to maintain the phase of the photocurrent at a constant value with respect to the light modulation. The constant-phase-mode LAPS is advantageous for its wider measurement range and reduction of artifacts. 相似文献