全文获取类型
收费全文 | 4586篇 |
免费 | 264篇 |
国内免费 | 93篇 |
专业分类
电工技术 | 60篇 |
技术理论 | 1篇 |
综合类 | 165篇 |
化学工业 | 632篇 |
金属工艺 | 47篇 |
机械仪表 | 180篇 |
建筑科学 | 260篇 |
矿业工程 | 59篇 |
能源动力 | 195篇 |
轻工业 | 2155篇 |
水利工程 | 44篇 |
石油天然气 | 87篇 |
武器工业 | 12篇 |
无线电 | 207篇 |
一般工业技术 | 233篇 |
冶金工业 | 49篇 |
原子能技术 | 96篇 |
自动化技术 | 461篇 |
出版年
2024年 | 28篇 |
2023年 | 67篇 |
2022年 | 118篇 |
2021年 | 141篇 |
2020年 | 142篇 |
2019年 | 109篇 |
2018年 | 121篇 |
2017年 | 144篇 |
2016年 | 159篇 |
2015年 | 176篇 |
2014年 | 213篇 |
2013年 | 331篇 |
2012年 | 303篇 |
2011年 | 381篇 |
2010年 | 274篇 |
2009年 | 283篇 |
2008年 | 220篇 |
2007年 | 287篇 |
2006年 | 249篇 |
2005年 | 139篇 |
2004年 | 132篇 |
2003年 | 131篇 |
2002年 | 101篇 |
2001年 | 103篇 |
2000年 | 105篇 |
1999年 | 95篇 |
1998年 | 65篇 |
1997年 | 49篇 |
1996年 | 45篇 |
1995年 | 40篇 |
1994年 | 37篇 |
1993年 | 22篇 |
1992年 | 26篇 |
1991年 | 20篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有4943条查询结果,搜索用时 15 毫秒
41.
A. NabokAuthor Vitae A. TsargorodskayaAuthor VitaeM.K. MustafaAuthor Vitae I. SzékácsAuthor Vitae N.F. StarodubAuthor VitaeA. SzékácsAuthor Vitae 《Sensors and actuators. B, Chemical》2011,154(2):232-237
The method of total internal reflection ellipsometry (TIRE), which records simultaneously two parameters Δ and Ψ related to the amplitudes and phases of p- and s-components of polarised light, respectively, was exploited here for detection of mycotoxins (T-2 and zearalenone). The above mycotoxins in sub-ppb concentrations were detected using TIRE in both direct and competitive immunoassay. The study of immune reaction kinetics allowed the evaluation of adsorption/desorption rates and the association constant for zearalenone. The investigation of grain products samples revealed the presence of high concentrations of T-2 (>600 ng/ml) in mould products. 相似文献
42.
This paper considers the flexible flow line problem with unrelated parallel machines at each stage and with a bottleneck stage on the line. The objective of the problem is to minimize the total tardiness. Two bottleneck-based heuristics with three machine selection rules are proposed to solve the problem. The heuristics first develop an indicator to identify a bottleneck stage in the flow line, and then separate the flow line into the upstream stages, the bottleneck stage, and the downstream stages. The upstream stages are the stages ahead of the bottleneck stage and the downstream stages are the stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage. Using the new approach, the bottleneck-based heuristics develop two decision rules to iteratively schedule the jobs at the bottleneck stage, the upstream stages, and the downstream stages. In order to evaluate the performance of the bottleneck-based heuristics, seven commonly used dispatching rules and a basic tabu search algorithm are investigated for comparison purposes. Seven experimental factors are used to design 128 production scenarios, and ten test problems are generated for each scenario. Computational results show that the bottleneck-based heuristics significantly outperform all the dispatching rules for the test problems. Although the effective performance of the bottleneck-based heuristics is inferior to the basic tabu search algorithm, the bottleneck-based heuristics are much more efficient than the tabu search algorithm. Also, a test of the effect of the experimental factors on the dispatching rules, the bottleneck-based heuristics, and the basic tabu search algorithm is performed, and some interesting insights are discovered. 相似文献
43.
This report proposes a solution to the open shop scheduling problem with the objective of minimizing total job tardiness in the system. Some practical processing restrictions, such as independent setup and dependent removal times, are taken into account as well. The addressed problem is first described as a 0–1 integer programming model, and is then solved optimally. Subsequently, some hybrid genetic-based heuristics are proposed to solve the problem in an acceptable computation time. To demonstrate the adaptability of these heuristics, some performance comparisons are made with solutions provided by running either a mathematical programming model or certain classic meta-heuristics such as genetic algorithm, simulated annealing, and tabu search in various manufacturing scenarios. The experimental results show that the hybrid genetic-based heuristics perform well, especially the DGA. However, these heuristics require some more additional computations but are still acceptable. 相似文献
44.
Jean-François Aujol 《Journal of Mathematical Imaging and Vision》2009,34(3):307-327
This paper deals with first-order numerical schemes for image restoration. These schemes rely on a duality-based algorithm proposed in 1979 by Bermùdez and Moreno. This is an old and forgotten algorithm that is revealed wider than recent schemes (such as the Chambolle projection algorithm) and able to improve contemporary schemes. Total variation regularization and smoothed total variation regularization are investigated. Algorithms are presented for such regularizations in image restoration. We prove the convergence of all the proposed schemes. We illustrate our study with numerous numerical examples. We make some comparisons with a class of efficient algorithms (proved to be optimal among first-order numerical schemes) recently introduced by Y. Nesterov. 相似文献
45.
46.
47.
Daniel Oron 《Information Processing Letters》2011,111(19):962-967
In various industries jobs undergo a batching, or burn in, process where different tasks are grouped into batches and processed simultaneously. The processing time of each batch is equal to the longest processing time among all jobs contained in the batch. All to date studies dealing with batching machines have considered fixed job processing times. However, in many real life applications job processing times are controllable through the allocation of a limited resource. The most common and realistic model assumes that there exists a non-linear and convex relationship between the amount of resource allocated to a job and its processing time. The scheduler?s task when dealing with controllable processing times is twofold. In addition to solving the sequencing problem, one must establish an optimal resource allocation policy. We combine these two widespread models on a single machine setting, showing that both the makespan and total completion time criteria can be solved in polynomial time. We then show that our proposed approach can be applied to general bi-criteria objective comprising of the makespan and the total completion time. 相似文献
48.
In this note, we prove that both problems studied by Cheng et al. [Cheng, T. C. E., Hsu, C.-J., & Yang, D.-L. (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602–605] can be solved in O(nm+3) time no matter what the processing time of a job after a maintenance activity is greater or less than its processing time before the maintenance activity, where m is the number of machines and n is the number of jobs. 相似文献
49.
In traditional scheduling problems, the processing time for the given job is assumed to be a constant regardless of whether the job is scheduled earlier or later. However, the phenomenon named “learning effect” has extensively been studied recently, in which job processing times decline as workers gain more experience. This paper discusses a bi-criteria scheduling problem in an m-machine permutation flowshop environment with varied learning effects on different machines. The objective of this paper is to minimize the weighted sum of the total completion time and the makespan. A dominance criterion and a lower bound are proposed to accelerate the branch-and-bound algorithm for deriving the optimal solution. In addition, the near-optimal solutions are derived by adapting two well-known heuristic algorithms. The computational experiments reveal that the proposed branch-and-bound algorithm can effectively deal with problems with up to 16 jobs, and the proposed heuristic algorithms can yield accurate near-optimal solutions. 相似文献
50.
The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with ready times and due date-to-deadline window to minimize total weighted tardiness. ARSP assumes that the jobs have different ready times and a due date-to-deadline window between refueling due date and a deadline to return without refueling. In this paper, we first formulate the ARSP as a mixed integer programming model. The objective function is a piece-wise tardiness cost that takes into account due date-to-deadline windows and job priorities. Since ARSP is NP-hard, two heuristics are proposed to obtain solutions in reasonable computation times, namely (1) modified ATC rule (MATC), (2) a simulated annealing method (SA). The proposed heuristic algorithms are tested in terms of solution quality and CPU time through computational experiments with data randomly generated to represent aerial refueling operations of an in-theater air operation. Solutions provided by both algorithms were compared to optimal solutions for problems with up to 12 jobs and to each other for larger problems with up to 60 jobs. The results show that, MATC is more likely to outperform SA especially when the problem size increases, although it has significantly worse performance than SA in terms of deviation from optimal solution for small size problems. Moreover CPU time performance of MATC is significantly better than SA in both cases. 相似文献