全文获取类型
收费全文 | 24149篇 |
免费 | 4053篇 |
国内免费 | 3611篇 |
专业分类
电工技术 | 1847篇 |
技术理论 | 3篇 |
综合类 | 2730篇 |
化学工业 | 514篇 |
金属工艺 | 267篇 |
机械仪表 | 1027篇 |
建筑科学 | 790篇 |
矿业工程 | 423篇 |
能源动力 | 302篇 |
轻工业 | 477篇 |
水利工程 | 344篇 |
石油天然气 | 406篇 |
武器工业 | 222篇 |
无线电 | 2956篇 |
一般工业技术 | 1358篇 |
冶金工业 | 625篇 |
原子能技术 | 46篇 |
自动化技术 | 17476篇 |
出版年
2024年 | 200篇 |
2023年 | 477篇 |
2022年 | 787篇 |
2021年 | 863篇 |
2020年 | 1004篇 |
2019年 | 887篇 |
2018年 | 892篇 |
2017年 | 1109篇 |
2016年 | 1170篇 |
2015年 | 1334篇 |
2014年 | 1700篇 |
2013年 | 1762篇 |
2012年 | 2113篇 |
2011年 | 2192篇 |
2010年 | 1838篇 |
2009年 | 1905篇 |
2008年 | 2050篇 |
2007年 | 2068篇 |
2006年 | 1536篇 |
2005年 | 1296篇 |
2004年 | 1007篇 |
2003年 | 777篇 |
2002年 | 653篇 |
2001年 | 489篇 |
2000年 | 387篇 |
1999年 | 272篇 |
1998年 | 179篇 |
1997年 | 146篇 |
1996年 | 125篇 |
1995年 | 99篇 |
1994年 | 79篇 |
1993年 | 65篇 |
1992年 | 43篇 |
1991年 | 41篇 |
1990年 | 30篇 |
1989年 | 41篇 |
1988年 | 19篇 |
1987年 | 15篇 |
1986年 | 13篇 |
1985年 | 17篇 |
1984年 | 15篇 |
1983年 | 17篇 |
1982年 | 18篇 |
1981年 | 14篇 |
1980年 | 15篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
41.
Two experiments examined the disruption of feature-based selection in triple-conjunction search at multiple target transfers. In Experiment 1, after 10 training sessions, a new target possessing previous distractor features was introduced. This produced disruption in RT and fixation number, but no disruption in feature-based selection. Specifically, there was a tendency to fixate objects sharing the target's contrast polarity and shape and this did not change even upon transfer to the new target. In Experiment 2, 30 training sessions were provided with three target transfers. At the first transfer, the results replicated Experiment 1. Subsequent transfers did not produce disruption on any measure. These findings are discussed in terms of strength theory, Guided Search, rule-based approaches to perceptual learning, and the area activation model. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
42.
This paper presents the Navigation Maps Modeling approach (NMM), which provides platform independent models for characterizing navigation maps of web applications. The NMM approach is conceived to obtain a trade off between high and low-level design notations. As high-level design notations, NMM models permit architectural details that may hinder the overall understanding of the web application to be left out. As low-level design notations, NMM models can easily be transformed into detailed architectural designs, which are very valuable at coding and maintenance stages. 相似文献
43.
Xianpeng Wang Lixin Tang 《The International Journal of Advanced Manufacturing Technology》2008,36(5-6):431-441
This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer
programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using
this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable
of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain
near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure
of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic
has been developed and tested on instances collected from practical production data. The experimental results show that the
proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional
serial method. 相似文献
44.
45.
杜昱 《数字社区&智能家居》2006,(8):15-15,57
文章首先概述了当前大多数的搜索引擎的主要的弊端;然后着重介绍了智能检索系统的运行基本思路和售用算法,以及该算法在检索领域中运用的优点;最后指出,神经网络运用在检索领域,可解决网络管理中的诸多难题。 相似文献
46.
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times 总被引:3,自引:0,他引:3
In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems. 相似文献
47.
Markovian and semi-Markovian random processes are used to analyze the problem of optimal search for signals in a multichannel
communication system with arbitrarily distributed random outputs. The search efficiency factor is found in explicit form based
on state space merging, and a mathematical programming problem is set up to find a numerical suboptimal solution.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 144–150, May–June 2007. 相似文献
48.
In this paper we present an efficient technique for piecewise cubic Bézier approximation of digitized curve. An adaptive breakpoint detection method divides a digital curve into a number of segments and each segment is approximated by a cubic Bézier curve so that the approximation error is minimized. Initial approximated Bézier control points for each of the segments are obtained by interpolation technique i.e. by the reverse recursion of De Castaljau's algorithm. Two methods, two-dimensional logarithmic search algorithm (TDLSA) and an evolutionary search algorithm (ESA), are introduced to find the best-fit Bézier control points from the approximate interpolated control points. ESA based refinement is proved to be better experimentally. Experimental results show that Bézier approximation of a digitized curve is much more accurate and uses less number of points compared to other approximation techniques. 相似文献
49.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献
50.