全文获取类型
收费全文 | 2330篇 |
免费 | 187篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 27篇 |
化学工业 | 588篇 |
金属工艺 | 70篇 |
机械仪表 | 76篇 |
建筑科学 | 119篇 |
矿业工程 | 8篇 |
能源动力 | 226篇 |
轻工业 | 465篇 |
水利工程 | 11篇 |
石油天然气 | 7篇 |
无线电 | 107篇 |
一般工业技术 | 353篇 |
冶金工业 | 30篇 |
原子能技术 | 58篇 |
自动化技术 | 373篇 |
出版年
2024年 | 15篇 |
2023年 | 44篇 |
2022年 | 75篇 |
2021年 | 142篇 |
2020年 | 101篇 |
2019年 | 80篇 |
2018年 | 177篇 |
2017年 | 153篇 |
2016年 | 162篇 |
2015年 | 91篇 |
2014年 | 138篇 |
2013年 | 357篇 |
2012年 | 156篇 |
2011年 | 165篇 |
2010年 | 188篇 |
2009年 | 163篇 |
2008年 | 97篇 |
2007年 | 124篇 |
2006年 | 39篇 |
2005年 | 13篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有2518条查询结果,搜索用时 515 毫秒
51.
Tarık Çakar 《Journal of Intelligent Manufacturing》2011,22(4):481-490
A neuro-dominance rule (NDR) for single machine total weighted tardiness problem with unequal release date is presented by
the author. To obtain the NDR, backpropagation artificial neural network (BPANN) has been trained using 10,000 data and also
tested using 10,000 another data. Inputs of the trained BPANN are starting date of the first job (t), processing times (pi and pj), due dates (di and dj), weights of the jobs (wi and wj) and ri and rj release dates of the jobs. Output of the BPANN is a decision of which job should precede. Training set and test set have
been obtained using Adjusted Pairwise Interchange method. The proposed NDR provides a sufficient condition for local optimality.
It has been proved that if any sequence violates the NDR then violating jobs are switched according to the total weighted
tardiness criterion. The proposed NDR is compared to a number of competing heuristics (ATC, COVERT, EDD, SPT, LPT, WDD, WSPT,
WPD, CR, FCFS) and meta heuristics (simulated annealing and genetic algorithms) for a set of randomly generated problems.
The problem sizes have been taken as 50, 70, 100. NDR is applied 270,000 randomly generated problems. Computational results
indicate that the NDR dominates the heuristics and meta heuristics in all runs. Therefore, the NDR can improve the upper and
lower bounding schemes. 相似文献
52.
Abdulnasir Yildiz Mehmet Akın Mustafa Poyraz 《Expert systems with applications》2011,38(10):12880-12890
Obstructive sleep apnea (OSA) is a highly prevalent sleep disorder. The traditional diagnosis methods of the disorder are cumbersome and expensive. The ability to automatically identify OSA from electrocardiogram (ECG) recordings is important for clinical diagnosis and treatment. In this study, we proposed an expert system based on discrete wavelet transform (DWT), fast-Fourier transform (FFT) and least squares support vector machine (LS-SVM) for the automatic recognition of patients with OSA from nocturnal ECG recordings. Thirty ECG recordings collected from normal subjects and subjects with sleep apnea, each of approximately 8 h in duration, were used throughout the study. The proposed OSA recognition system comprises three stages. In the first stage, an algorithm based on DWT was used to analyze ECG recordings for the detection of heart rate variability (HRV) and ECG-derived respiration (EDR) changes. In the second stage, an FFT based power spectral density (PSD) method was used for feature extraction from HRV and EDR changes. Then, a hill-climbing feature selection algorithm was used to identify the best features that improve classification performance. In the third stage, the obtained features were used as input patterns of the LS-SVM classifier. Using the cross-validation method, the accuracy of the developed system was found to be 100% for using a subset of selected combination of HRV and EDR features. The results confirmed that the proposed expert system has potential for recognition of patients with suspected OSA by using ECG recordings. 相似文献
53.
Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network. 相似文献
54.
Nilgün Fığlalı Celal Özkale Orhan Engin Alpaslan Fığlalı 《Computers & Industrial Engineering》2009,56(2):538-559
In recent years, one of the most important and promising research fields has been metaheuristics to find optimal or near-optimal solutions for NP-hard combinatorial optimization problems. Improving the quality of the solution or the solution time is basic research area on metaheuristics. Modifications of the existing ones or creation of hybrid approaches are the focus of these efforts. Another area of improving the solution quality of metaheuristics is finding the optimal combination of algorithm control parameters. This is usually done by design of experiments or one-at-a-time approach in genetic algorithms, simulated annealing and similar metaheuristics. We observe that, in studies which use Ant Colonies Optimization (ACO) as an optimization technique; the levels of control parameters are determined by some non-systematic initial experiments and the interactions of the parameters are not studied yet.In this study, the parameters of Ant System have been investigated on different sized and randomly generated job-shop scheduling problems by using design of experiments. The effects and interactions of the parameters have been interpreted with the outputs of the experiments. Referring to the statistical analysis it is observed that none of the interactions between the Ant System parameters has a significant effect on makespan value. A specific fractional experimental design is suggested instead of the full factorial design. Depending on the findings from the benchmark problems it will be a reliable approach to use the suggested design for saving time and effort in experiments without sacrificing the solution quality. 相似文献
55.
This paper presents a new hybrid optimization approach based on immune algorithm and hill climbing local search algorithm. The purpose of the present research is to develop a new optimization approach for solving design and manufacturing optimization problems. This research is the first application of immune algorithm to the optimization of machining parameters in the literature. In order to evaluate the proposed optimization approach, single objective test problem, multi-objective I-beam and machine-tool optimization problems taken from the literature are solved. Finally, the hybrid approach is applied to a case study for milling operations to show its effectiveness in machining operations. The results of the hybrid approach for the case study are compared with those of genetic algorithm, the feasible direction method and handbook recommendation. 相似文献
56.
57.
58.
In this study, a hybrid intelligent solution system including neural networks, genetic algorithms and simulated annealing has been proposed for the inverse kinematics solution of robotic manipulators. The main purpose of the proposed system is to decrease the end effector error of a neural network based inverse kinematics solution. In the designed hybrid intelligent system, simulated annealing algorithm has been used as a genetic operator to decrease the process time of the genetic algorithm to find the optimum solution. Obtained best solution from the neural network has been included in the initial solution of genetic algorithm with randomly produced solutions. The end effector error has been reduced micrometer levels after the implementation of the hybrid intelligent solution system. 相似文献
59.
Bug fixing has a key role in software quality evaluation. Bug fixing starts with the bug localization step, in which developers use textual bug information to find location of source codes which have the bug. Bug localization is a tedious and time consuming process. Information retrieval requires understanding the programme's goal, coding structure, programming logic and the relevant attributes of bug. Information retrieval (IR) based bug localization is a retrieval task, where bug reports and source files represent the queries and documents, respectively. In this paper, we propose BugCatcher, a newly developed bug localization method based on multi‐level re‐ranking IR technique. We evaluate BugCatcher on three open source projects with approximately 3400 bugs. Our experiments show that multi‐level reranking approach to bug localization is promising. Retrieval performance and accuracy of BugCatcher are better than current bug localization tools, and BugCatcher has the best Top N, Mean Average Precision (MAP) and Mean Reciprocal Rank (MRR) values for all datasets. 相似文献
60.
E. Alper Yıldırım 《Optimization methods & software》2017,32(6):1163-1186
Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely positive matrices on instances of completely positive optimization problems that arise from the reformulation of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation. In particular, our results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Our characterization yields, as a byproduct, an upper bound on the gap between the optimal value of an inner approximation and that of the original instance. We discuss the implications of this error bound for standard and box-constrained quadratic programs as well as general mixed binary quadratic programs with a bounded feasible region. 相似文献