全文获取类型
收费全文 | 4224篇 |
免费 | 156篇 |
国内免费 | 16篇 |
专业分类
电工技术 | 38篇 |
综合类 | 8篇 |
化学工业 | 1037篇 |
金属工艺 | 150篇 |
机械仪表 | 114篇 |
建筑科学 | 91篇 |
矿业工程 | 6篇 |
能源动力 | 346篇 |
轻工业 | 305篇 |
水利工程 | 27篇 |
石油天然气 | 12篇 |
无线电 | 375篇 |
一般工业技术 | 1033篇 |
冶金工业 | 316篇 |
原子能技术 | 18篇 |
自动化技术 | 520篇 |
出版年
2024年 | 15篇 |
2023年 | 49篇 |
2022年 | 132篇 |
2021年 | 199篇 |
2020年 | 133篇 |
2019年 | 126篇 |
2018年 | 190篇 |
2017年 | 153篇 |
2016年 | 147篇 |
2015年 | 104篇 |
2014年 | 161篇 |
2013年 | 340篇 |
2012年 | 210篇 |
2011年 | 269篇 |
2010年 | 188篇 |
2009年 | 188篇 |
2008年 | 174篇 |
2007年 | 166篇 |
2006年 | 111篇 |
2005年 | 119篇 |
2004年 | 86篇 |
2003年 | 83篇 |
2002年 | 74篇 |
2001年 | 53篇 |
2000年 | 45篇 |
1999年 | 65篇 |
1998年 | 55篇 |
1997年 | 50篇 |
1996年 | 60篇 |
1995年 | 60篇 |
1994年 | 58篇 |
1993年 | 50篇 |
1992年 | 51篇 |
1991年 | 35篇 |
1990年 | 28篇 |
1989年 | 29篇 |
1988年 | 27篇 |
1987年 | 33篇 |
1986年 | 23篇 |
1985年 | 26篇 |
1984年 | 28篇 |
1983年 | 35篇 |
1982年 | 37篇 |
1981年 | 30篇 |
1980年 | 24篇 |
1979年 | 13篇 |
1978年 | 13篇 |
1977年 | 7篇 |
1976年 | 21篇 |
1975年 | 5篇 |
排序方式: 共有4396条查询结果,搜索用时 0 毫秒
41.
Solving shortest path problem using particle swarm optimization 总被引:6,自引:0,他引:6
This paper presents the investigations on the application of particle swarm optimization (PSO) to solve shortest path (SP) routing problems. A modified priority-based encoding incorporating a heuristic operator for reducing the possibility of loop-formation in the path construction process is proposed for particle representation in PSO. Simulation experiments have been carried out on different network topologies for networks consisting of 15–70 nodes. It is noted that the proposed PSO-based approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high certainty for all the tested networks. It is observed that the performance of the proposed algorithm surpasses those of recently reported genetic algorithm based approaches for this problem. 相似文献
42.
Visual media data such as an image is the raw data representation for many important applications. Reducing the dimensionality of raw visual media data is desirable since high dimensionality degrades not only the effectiveness but also the efficiency of visual recognition algorithms. We present a comparative study on spatial interest pixels (SIPs), including eight-way (a novel SIP detector), Harris, and Lucas‐Kanade, whose extraction is considered as an important step in reducing the dimensionality of visual media data. With extensive case studies, we have shown the usefulness of SIPs as low-level features of visual media data. A class-preserving dimension reduction algorithm (using GSVD) is applied to further reduce the dimension of feature vectors based on SIPs. The experiments showed its superiority over PCA.
相似文献
Chandra KambhamettuEmail: |
43.
Summary The amount of nondeterminism in a nondeterministic finite automaton (NFA) is measured by counting the minimal number of guessing points a string w has to pass through on its way to an accepting state. NFA's with more nondeterminism can achieve greater savings in the number of states over their deterministic counterparts than NFA's with less nondeterminism. On the other hand, for some nontrivial infinite regular languages a deterministic finite automaton (DFA) can already be quite succinct in the sense that NFA's need as many states (and even context-free grammars need as many nonterminals) as the minimal DFA has states.This research was supported in part by the National Science Foundation under Grant No. MCS 76-10076 相似文献
44.
Three results are established. The first is that every nondeterministic strict interpretation of a deterministic pushdown acceptor (dpda) has an equivalent, deterministic, strict interpretation. The second is that ifM
1 andM
2 are two compatible strict interpretations of the dpdaM, then there exist deterministic strict interpretationsM
andM
such thatL(M
) =L(M
1)L(M
2) andL(M
) =L(M
1)L(M
2). The third states that there is no dpda whose strict interpretations yield all the deterministic context-free languages.This author was supported in part by the National Science Foundation under Grant MCS-77-22323. 相似文献
45.
Given an undirected graph G with edge costs and a specified set of terminals, let the density of any subgraph be the ratio of its cost to the number of terminals it contains. If G is 2-connected, does it contain smaller 2-connected subgraphs of density comparable to that of?G? We answer this question in the affirmative by giving an algorithm to pruneG and find such subgraphs of any desired size, incurring only a logarithmic factor increase in density (plus a small additive term). We apply our pruning techniques to give algorithms for two NP-Hard problems on finding large 2-vertex-connected subgraphs of low cost; no previous approximation algorithm was known for either problem. In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. In the Budget-2VC problem, we are given a graph G with edge costs, and a budget B; the goal is to find a 2-vertex-connected subgraph H of G with total edge cost at most B that maximizes the number of vertices in H. We describe an O(log?nlog?k) approximation for the k-2VC problem, and a bicriteria approximation for the Budget-2VC problem that gives an $O(\frac{1}{\epsilon}\log^{2} n)$ approximation, while violating the budget by a factor of at most 2+ε. 相似文献
46.
Facility location decisions are usually determined by cost and coverage related factors although empirical studies show that such factors as infrastructure, labor conditions and competition also play an important role in practice. The objective of this paper is to develop a multi-objective facility location model accounting for a wide range of factors affecting decision-making. The proposed model selects potential facilities from a set of pre-defined alternative locations according to the number of customers, the number of competitors and real-estate cost criteria. However, that requires large amount of both spatial and non-spatial input data, which could be acquired from distributed data sources over the Internet. Therefore, a computational approach for processing input data and representation of modeling results is elaborated. It is capable of accessing and processing data from heterogeneous spatial and non-spatial data sources. Application of the elaborated data gathering approach and facility location model is demonstrated using an example of fast food restaurants location problem. 相似文献
47.
Business processes leave trails in a variety of data sources (e.g., audit trails, databases, and transaction logs). Hence, every process instance can be described by a trace, i.e., a sequence of events. Process mining techniques are able to extract knowledge from such traces and provide a welcome extension to the repertoire of business process analysis techniques. Recently, process mining techniques have been adopted in various commercial BPM systems (e.g., BPM|one, Futura Reflect, ARIS PPM, Fujitsu Interstage, Businesscape, Iontas PDF, and QPR PA). Unfortunately, traditional process discovery algorithms have problems dealing with less structured processes. The resulting models are difficult to comprehend or even misleading. Therefore, we propose a new approach based on trace alignment. The goal is to align traces in such a way that event logs can be explored easily. Trace alignment can be used to explore the process in the early stages of analysis and to answer specific questions in later stages of analysis. Hence, it complements existing process mining techniques focusing on discovery and conformance checking. The proposed techniques have been implemented as plugins in the ProM framework. We report the results of trace alignment on one synthetic and two real-life event logs, and show that trace alignment has significant promise in process diagnostic efforts. 相似文献
48.
An inertia-adaptive particle swarm system with particle mobility factor for improved global optimization 总被引:2,自引:2,他引:0
Sayan Ghosh Swagatam Das Debarati Kundu Kaushik Suresh B. K. Panigrahi Zhihua Cui 《Neural computing & applications》2012,21(2):237-250
Particle Swarm Optimization (PSO) has recently emerged as a nature-inspired algorithm for real parameter optimization. This
article describes a method for improving the final accuracy and the convergence speed of PSO by firstly adding a new coefficient
(called mobility factor) to the position updating equation and secondly modulating the inertia weight according to the distance
between a particle and the globally best position found so far. The two-fold modification tries to balance between the explorative
and exploitative tendencies of the swarm with an objective of achieving better search performance. We also mathematically
analyze the effect of the modifications on the dynamics of the PSO algorithm. The new algorithm has been shown to be statistically
significantly better than the basic PSO and four of its state-of-the-art variants on a twelve-function test-suite in terms
of speed, accuracy, and robustness. 相似文献
49.
The right eye of a 9-year-old white boy with Best's vitelliform macular dystrophy had an intact egg-yolk lesion and a retinal pigment epithelial defect superiorly, suggesting an early pseudohypopyon stage. The disruptive phase of the left eye showed subretinal hemorrhages, a "signet ring," and a subretinal neovascular membrane. 相似文献
50.
Bruns G. Chandra S. 《IEEE transactions on pattern analysis and machine intelligence》2003,29(10):883-897
The points-to analysis problem is to find the pointer relationships that could arise during program execution. Many points-to analysis algorithms exist, each making a particular trade off between cost of the analysis and precision of the results. In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. We present a set of program transformations over a general program model and use them to define some existing points-to analysis algorithms. Doing so makes explicit the approximations involved in these algorithms. We also show how the transformations can be used to define new points-to analysis algorithms. Our transformations are generic and may be useful in the design of other program analysis algorithms. 相似文献