全文获取类型
收费全文 | 52175篇 |
免费 | 7634篇 |
国内免费 | 5858篇 |
专业分类
电工技术 | 5718篇 |
技术理论 | 1篇 |
综合类 | 6574篇 |
化学工业 | 3647篇 |
金属工艺 | 1911篇 |
机械仪表 | 5273篇 |
建筑科学 | 5381篇 |
矿业工程 | 1823篇 |
能源动力 | 1511篇 |
轻工业 | 929篇 |
水利工程 | 1914篇 |
石油天然气 | 1380篇 |
武器工业 | 1038篇 |
无线电 | 4850篇 |
一般工业技术 | 5895篇 |
冶金工业 | 1155篇 |
原子能技术 | 209篇 |
自动化技术 | 16458篇 |
出版年
2024年 | 312篇 |
2023年 | 899篇 |
2022年 | 1574篇 |
2021年 | 1738篇 |
2020年 | 1960篇 |
2019年 | 1605篇 |
2018年 | 1636篇 |
2017年 | 1994篇 |
2016年 | 2360篇 |
2015年 | 2470篇 |
2014年 | 3407篇 |
2013年 | 3822篇 |
2012年 | 4311篇 |
2011年 | 4179篇 |
2010年 | 3316篇 |
2009年 | 3418篇 |
2008年 | 3377篇 |
2007年 | 3931篇 |
2006年 | 3366篇 |
2005年 | 2833篇 |
2004年 | 2248篇 |
2003年 | 1845篇 |
2002年 | 1514篇 |
2001年 | 1336篇 |
2000年 | 1166篇 |
1999年 | 930篇 |
1998年 | 744篇 |
1997年 | 649篇 |
1996年 | 511篇 |
1995年 | 452篇 |
1994年 | 382篇 |
1993年 | 282篇 |
1992年 | 229篇 |
1991年 | 184篇 |
1990年 | 148篇 |
1989年 | 148篇 |
1988年 | 88篇 |
1987年 | 44篇 |
1986年 | 34篇 |
1985年 | 35篇 |
1984年 | 45篇 |
1983年 | 28篇 |
1982年 | 20篇 |
1981年 | 12篇 |
1980年 | 24篇 |
1979年 | 20篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1955年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
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. 相似文献
2.
In this paper, the dynamic behaviors on the basis of simulation for high-purity heat integrated air separation column (HIASC) are studied. A nonlinear generic model control (GMC) scheme is proposed based on the nonlinear behavior analyses of a HIASC process, and an adaptive generic model control (AGMC) scheme is further presented to correct the model parameters online. Related internal model control (IMC) scheme and multi-loop PID (M-PID) scheme are also developed as the comparative base. The comparative researches are carried out among these linear and nonlinear control schemes in detail. The simulation research results show that the proposed AGMC schemes present advantages in both servo control and regulatory control for the high-purity HIASC. 相似文献
3.
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. 相似文献
4.
Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front... 相似文献
5.
Miroslav Kárný Marko Ruman 《International Journal of Adaptive Control and Signal Processing》2021,35(5):660-675
Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential. 相似文献
6.
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. 相似文献
7.
Mingchang Lin Yufei Zhang Guosong Chen Ming Jiang 《Small (Weinheim an der Bergstrasse, Germany)》2015,11(45):6065-6070
Glyco‐mimicking nanoparticles (glyco‐NPs) with Förster resonance energy transfer (FRET) donor and acceptor groups formed via dynamic covalent bond of benzoboroxole and sugar from two complementary polymers are prepared. The glyco‐NPs are proved to be quite stable under physiological conditions but sensitive to pH. So the glyco‐NPs can be internalized by dendritic cells with integrity and nontoxicity and then dissociate within the acidic organelles. This particle dissociation is directly observed and visualized in vitro, for the first time via the FRET measurements and fluorescent microscopy. This feature makes controlled release of drug or protein by glyco‐NPs possible, i.e., when model antigen Ovalbumin is loaded in the glyco‐NPs, the released Ovalbumin in dendritic cells stimulates T cells more efficiently than the free Ovalbumin itself as a result of the enhanced antigen processing and presentation. Thus, the results enlighten a bright future of the glyco‐NPs in immunotherapy. 相似文献
8.
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. 相似文献
9.
The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method. 相似文献
10.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method. 相似文献