全文获取类型
收费全文 | 15223篇 |
免费 | 2346篇 |
国内免费 | 2519篇 |
专业分类
电工技术 | 1896篇 |
综合类 | 1520篇 |
化学工业 | 401篇 |
金属工艺 | 164篇 |
机械仪表 | 1386篇 |
建筑科学 | 151篇 |
矿业工程 | 133篇 |
能源动力 | 239篇 |
轻工业 | 76篇 |
水利工程 | 248篇 |
石油天然气 | 44篇 |
武器工业 | 187篇 |
无线电 | 1769篇 |
一般工业技术 | 1695篇 |
冶金工业 | 165篇 |
原子能技术 | 7篇 |
自动化技术 | 10007篇 |
出版年
2024年 | 92篇 |
2023年 | 309篇 |
2022年 | 438篇 |
2021年 | 496篇 |
2020年 | 661篇 |
2019年 | 619篇 |
2018年 | 557篇 |
2017年 | 670篇 |
2016年 | 781篇 |
2015年 | 793篇 |
2014年 | 1067篇 |
2013年 | 1707篇 |
2012年 | 1144篇 |
2011年 | 1145篇 |
2010年 | 869篇 |
2009年 | 1023篇 |
2008年 | 1069篇 |
2007年 | 1096篇 |
2006年 | 920篇 |
2005年 | 830篇 |
2004年 | 676篇 |
2003年 | 534篇 |
2002年 | 432篇 |
2001年 | 391篇 |
2000年 | 317篇 |
1999年 | 287篇 |
1998年 | 219篇 |
1997年 | 195篇 |
1996年 | 152篇 |
1995年 | 132篇 |
1994年 | 102篇 |
1993年 | 72篇 |
1992年 | 77篇 |
1991年 | 65篇 |
1990年 | 31篇 |
1989年 | 26篇 |
1988年 | 12篇 |
1987年 | 4篇 |
1986年 | 14篇 |
1985年 | 12篇 |
1984年 | 18篇 |
1983年 | 8篇 |
1981年 | 4篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1972年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
《International Journal of Hydrogen Energy》2022,47(84):35641-35654
The continuous catalytic regenerative (CCR) reforming process is one of the most significant sources of hydrogen production in the petroleum refining process. However, the fluctuations in feedstock composition and flow rate could significantly affect both product distribution and energy consumption. In this study, a robust deviation criterion based multi-objective optimization approach is proposed to perform the optimal operation of CCR reformer under feedstock uncertainty, with simultaneous maximization of product yields and minimization of energy consumption. Minimax approach is adopted to handle these uncertain objectives, and the Latin hypercube sampling method is then used to calculate these robust deviation criteria. Multi-objective surrogate-based optimization methods are next introduced to effectively solve the robust operational problem with high computational cost. The level diagram method is finally utilized to assist in multi-criteria decision-making. Two robust operational optimization problems with different objectives are solved to demonstrate the effectiveness of the proposed method for robust optimal operation of the CCR reforming process under feedstock uncertainty. 相似文献
2.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
3.
The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances. 相似文献
4.
5.
ABSTRACTThis paper deals with asymptotic stabilisation of a class of nonlinear input-delayed systems via dynamic output feedback in the presence of disturbances. The proposed strategy has the structure of an observer-based control law, in which the observer estimates and predicts both the plant state and the external disturbance. A nominal delay value is assumed to be known and stability conditions in terms of linear matrix inequalities are derived for fast-varying delay uncertainties. Asymptotic stability is achieved if the disturbance or the time delay is constant. The controller design problem is also addressed and a numerical example with an unstable system is provided to illustrate the usefulness of the proposed strategy. 相似文献
6.
Adaptive robust boundary control of shaft vibrations under perturbations with unknown upper bounds 下载免费PDF全文
This paper presents robust and adaptive boundary control designs to stabilize the two‐dimensional vibration of hybrid shaft model. The hybrid shaft is mathematically represented by a set of partial differential equations, governing the shaft vibrations, coupled to ordinary differential equations, describing rigid body spinning and dynamic boundary conditions. The control objective is to stabilize the transverse vibrations of the perturbed shaft while regulating the spinning rate. To achieve this, the paper first establishes robust boundary control laws that fulfil the control objective in the presence of modeling uncertainties and external disturbances operating over the shaft domain and boundary. Lyapunov‐based analyses show that the proposed robust control exponentially stabilizes the shaft with vanishing distributive perturbations, while assuring ultimately bounded vibrations in the case of nonvanishing perturbations. Then, adaptive control philosophy is utilized to achieve redesigned robust controllers that only use online adaptation of control gains without acquiring the knowledge of bounds on perturbations, as well as dynamic parameters. An advantage of this design is avoiding an overconservative robust control law, which may induce poor stability and chattering in tackling system perturbations with unknown upper bounds. Simulations through finite element method illustrate the results. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
7.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
8.
针对跨数据中心的资源调度问题,提出了一种基于组合双向拍卖(PCDA)的资源调度方案。首先,将云资源拍卖分为三个部分:云用户代理报价、云资源提供商要价、拍卖代理组织拍卖;其次,在定义用户的优先级及任务紧迫度的基础上,在拍卖过程中估算每一个工作发生的服务等级协议(SLA)违规并以此计算云提供商的收益,同时每轮竞拍允许成交多项交易;最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率,与传统一次拍卖成交一项的组合双向拍卖方案相比,PCDA在竞拍时间段产生的能耗降低了35.00%,拍卖云提供商的利润提高了约38.84%。 相似文献
9.
The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach. 相似文献
10.
In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases. 相似文献