全文获取类型
收费全文 | 22463篇 |
免费 | 1621篇 |
国内免费 | 1222篇 |
专业分类
电工技术 | 1953篇 |
综合类 | 2328篇 |
化学工业 | 875篇 |
金属工艺 | 958篇 |
机械仪表 | 2038篇 |
建筑科学 | 611篇 |
矿业工程 | 484篇 |
能源动力 | 519篇 |
轻工业 | 266篇 |
水利工程 | 420篇 |
石油天然气 | 278篇 |
武器工业 | 211篇 |
无线电 | 1681篇 |
一般工业技术 | 1695篇 |
冶金工业 | 353篇 |
原子能技术 | 113篇 |
自动化技术 | 10523篇 |
出版年
2024年 | 53篇 |
2023年 | 179篇 |
2022年 | 291篇 |
2021年 | 366篇 |
2020年 | 465篇 |
2019年 | 479篇 |
2018年 | 397篇 |
2017年 | 613篇 |
2016年 | 651篇 |
2015年 | 776篇 |
2014年 | 1184篇 |
2013年 | 1534篇 |
2012年 | 1343篇 |
2011年 | 1448篇 |
2010年 | 1070篇 |
2009年 | 1232篇 |
2008年 | 1273篇 |
2007年 | 1469篇 |
2006年 | 1342篇 |
2005年 | 1188篇 |
2004年 | 990篇 |
2003年 | 928篇 |
2002年 | 794篇 |
2001年 | 666篇 |
2000年 | 641篇 |
1999年 | 578篇 |
1998年 | 469篇 |
1997年 | 455篇 |
1996年 | 384篇 |
1995年 | 325篇 |
1994年 | 300篇 |
1993年 | 231篇 |
1992年 | 209篇 |
1991年 | 157篇 |
1990年 | 129篇 |
1989年 | 118篇 |
1988年 | 98篇 |
1987年 | 65篇 |
1986年 | 61篇 |
1985年 | 44篇 |
1984年 | 55篇 |
1983年 | 39篇 |
1982年 | 42篇 |
1981年 | 30篇 |
1980年 | 25篇 |
1979年 | 34篇 |
1978年 | 12篇 |
1977年 | 24篇 |
1976年 | 17篇 |
1975年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
11.
Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes. 相似文献
12.
Optimization of heat exchanger networks (HENS) is a field of interest in Chemical Engineering. The aim is to use the residual heat of process streams to raise the temperature of other process streams which are cold, thus minimizing the use of hot and cold utilities. The usual way to deal with this task is to pose a linear programming problem according to a transshipment model in order to minimize either the general services consumptions or the number of hot and cold stream matchings required. This optimization is subjected to several restrictions given by the energy balances corresponding to each heat exchange.The high number of variables and equations obliges the use of specific software to solve these problems, e.g. GAMS (General Algebraic Modelling System). However, this software is not intuitive and requires a long time of training and a certain level of practice for the students to adequately use it.This work describes the use of Microsoft Excel-Solver for the sequential solving of HENS optimization problems according to the transshipment model. Solver is a much simpler, intuitive and easily available tool for the students who, besides, usually learn how to use it in the first years of their degree, in Informatics or similar subjects. Thus, it is not necessary to spend extra time in the teaching of the software, time that may be devoted to other contents.This paper presents an example of HENS problem proposed in the subject Simulation and Optimization of Chemical Processes corresponding to the Joint Master in Chemical Engineering of the Rey Juan Carlos University and the Autónoma University of Madrid and solved by the students using Excel-Solver. 相似文献
13.
D.R. Santos‐Peñate C.M. Campos‐Rodríguez J.A. Moreno‐Pérez 《International Transactions in Operational Research》2019,26(1):340-363
The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included. 相似文献
14.
The purpose of feature construction is to create new higher-level features from original ones. Genetic Programming (GP) was usually employed to perform feature construction tasks due to its flexible representation. Filter-based approach and wrapper-based approach are two commonly used feature construction approaches according to their different evaluation functions. In this paper, we propose a hybrid feature construction approach using genetic programming (Hybrid-GPFC) that combines filter’s fitness function and wrapper’s fitness function, and propose a multiple feature construction method that stores top excellent individuals during a single GP run. Experiments on ten datasets show that our proposed multiple feature construction method (Fcm) can achieve better (or equivalent) classification performance than the single feature construction method (Fcs), and our Hybrid-GPFC can obtain better classification performance than filter-based feature construction approaches (Filter-GPFC) and wrapper-based feature construction approaches (Wrapper-GPFC) in most cases. Further investigations on combinations of constructed features and original features show that constructed features augmented with original features do not improve the classification performance comparing with constructed features only. The comparisons with three state-of-art methods show that in majority of cases, our proposed hybrid multiple feature construction approach can achieve better classification performance. 相似文献
15.
Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations. 相似文献
16.
During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction. 相似文献
17.
Automatic load shedding is the ultimate countermeasure against imbalance in a power system and can effectively help preventing large blackouts. Taking into account a high penetration of renewable energy sources (RES) in the distribution grid, a clear distinction between load and generation at the PCC becomes increasingly more difficult. For that reason an adaptation of frequency relay parameters and their locations of installation are necessary. In Europe this is rest on a multi-step plan based on values such as the yearly peak load. In this paper a novel probabilistic method for automatic load shedding is presented that uses the average values instead of peak values for load shedding. Its applicability is verified by a dynamic power system model that was developed to compare the classical and novel probabilistic load shedding principle. The method is verified using data from a German TSO. 相似文献
18.
Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system. 相似文献
19.
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. 相似文献
20.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem. 相似文献