全文获取类型
收费全文 | 131331篇 |
免费 | 21822篇 |
国内免费 | 14061篇 |
专业分类
电工技术 | 14634篇 |
技术理论 | 3篇 |
综合类 | 14679篇 |
化学工业 | 10199篇 |
金属工艺 | 4447篇 |
机械仪表 | 10996篇 |
建筑科学 | 4529篇 |
矿业工程 | 3589篇 |
能源动力 | 4664篇 |
轻工业 | 5090篇 |
水利工程 | 2858篇 |
石油天然气 | 3710篇 |
武器工业 | 2068篇 |
无线电 | 16850篇 |
一般工业技术 | 11003篇 |
冶金工业 | 3113篇 |
原子能技术 | 937篇 |
自动化技术 | 53845篇 |
出版年
2024年 | 1053篇 |
2023年 | 2711篇 |
2022年 | 4825篇 |
2021年 | 5267篇 |
2020年 | 5886篇 |
2019年 | 4945篇 |
2018年 | 4775篇 |
2017年 | 5672篇 |
2016年 | 6342篇 |
2015年 | 7162篇 |
2014年 | 9656篇 |
2013年 | 9593篇 |
2012年 | 11121篇 |
2011年 | 11484篇 |
2010年 | 8646篇 |
2009年 | 8946篇 |
2008年 | 8698篇 |
2007年 | 9590篇 |
2006年 | 7795篇 |
2005年 | 6435篇 |
2004年 | 5204篇 |
2003年 | 4187篇 |
2002年 | 3267篇 |
2001年 | 2670篇 |
2000年 | 2257篇 |
1999年 | 1742篇 |
1998年 | 1450篇 |
1997年 | 1180篇 |
1996年 | 945篇 |
1995年 | 749篇 |
1994年 | 617篇 |
1993年 | 473篇 |
1992年 | 426篇 |
1991年 | 263篇 |
1990年 | 283篇 |
1989年 | 215篇 |
1988年 | 139篇 |
1987年 | 65篇 |
1986年 | 62篇 |
1985年 | 60篇 |
1984年 | 48篇 |
1983年 | 48篇 |
1982年 | 51篇 |
1981年 | 23篇 |
1980年 | 38篇 |
1979年 | 35篇 |
1978年 | 15篇 |
1975年 | 15篇 |
1959年 | 20篇 |
1951年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
41.
Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed. 相似文献
42.
For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. 相似文献
43.
The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods. 相似文献
44.
Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods. 相似文献
45.
In this paper, the Thyristor-Controlled Series-Compensated (TCSC) devices are located for congestion management in the power system by considering the non-smooth fuel cost function and penalty cost of emission. For this purpose, it is considered that the objective function of the proposed optimal power flow (OPF) problem is minimizing fuel and emission penalty cost of generators. A hybrid method that is the combination of the bacterial foraging (BF) algorithm with Nelder–Mead (NM) method (BF-NM) is employed to solve the OPF problems. The optimal location of the TCSC devices are then determined for congestion management. The size of the TCSC is obtained by using of the BF-NM algorithm to minimize the cost of generation, cost of emission, and cost of TCSC. The simulation results on IEEE 30-bus, modified IEEE 30-bus and IEEE 118-bus test system confirm the efficiency of the proposed method for finding the optimal location of the TCSC with non-smooth non-convex cost function and emission for congestion management in the power system. In addition, the results clearly show that a better solution can be achieved by using the proposed OPF problem in comparison with other intelligence methods. 相似文献
46.
47.
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. 相似文献
48.
This research proposes ACARDS (Augmented-Context bAsed RecommenDation Service) framework that is able to utilize knowledge over the Linked Open Data (LOD) cloud to recommend context-based services to users. To improve the level of user satisfaction with the result of the recommendation, the ACARDS framework implements a novel recommendation algorithm that can utilize the knowledge over the LOD cloud. In addition, the noble algorithm is able to use new concepts like the enriched tags and the augmented tags that originate from the hashtags on the SNSs materials. These tags are utilized to recommend the most appropriate services in the user’s context, which can change dynamically. Last but not least, the ACARDS framework implements the context-based reshaping algorithm on the augmented tag cloud. In the reshaping process, the ACARDS framework can recommend the highly receptive services in the users’ context and their preferences. To evaluate the performance of the ACARDS framework, we conduct four kinds of experiments using the Instagram materials and the LOD cloud. As a result, we proved that the ACARDS framework contributes to increasing the query efficiency by reducing the search space and improving the user satisfaction on the recommended services. 相似文献
49.
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. 相似文献
50.
Abrasive water jet technology can be used for micro-milling using recently developed miniaturized nozzles. Abrasive water jet (AWJ) machining is often used with both the nozzle tip and workpiece submerged in water to reduce noise and contain debris. This paper compares the performance of submerged and unsubmerged abrasive water jet micro-milling of channels in 316L stainless steel and 6061-T6 aluminum at various nozzle angles and standoff distances. The effect of submergence on the diameter and effective footprint of AWJ erosion footprints was measured and compared. It was found that the centerline erosion rate decreased with channel depth due to the spreading of the jet as the effective standoff distance increased, and because of the growing effect of stagnation as the channel became deeper. The erosive jet spread over a larger effective footprint in air than in water, since particles on the jet periphery were slowed much more quickly in water due to increased drag. As a result, the width of a channel machined in air was wider than that in water. Moreover, it was observed that the instantaneous erosion rate decreased with channel depth, and that this decrease was a function only of the channel cross-sectional geometry, being independent of the type of metal, the jet angle, the standoff distance, and regardless of whether the jet was submerged or in air, in either the forward or backward directions. It is shown that submerged AWJM results in narrower features than those produced while machining in air, without a decrease in centerline etch rate. 相似文献