全文获取类型
收费全文 | 927篇 |
免费 | 88篇 |
国内免费 | 68篇 |
专业分类
电工技术 | 34篇 |
综合类 | 66篇 |
化学工业 | 11篇 |
金属工艺 | 29篇 |
机械仪表 | 54篇 |
建筑科学 | 54篇 |
矿业工程 | 13篇 |
能源动力 | 10篇 |
轻工业 | 7篇 |
水利工程 | 8篇 |
石油天然气 | 7篇 |
武器工业 | 2篇 |
无线电 | 92篇 |
一般工业技术 | 69篇 |
冶金工业 | 5篇 |
原子能技术 | 1篇 |
自动化技术 | 621篇 |
出版年
2023年 | 7篇 |
2022年 | 13篇 |
2021年 | 13篇 |
2020年 | 14篇 |
2019年 | 17篇 |
2018年 | 12篇 |
2017年 | 24篇 |
2016年 | 33篇 |
2015年 | 41篇 |
2014年 | 64篇 |
2013年 | 34篇 |
2012年 | 74篇 |
2011年 | 80篇 |
2010年 | 47篇 |
2009年 | 71篇 |
2008年 | 63篇 |
2007年 | 62篇 |
2006年 | 64篇 |
2005年 | 66篇 |
2004年 | 53篇 |
2003年 | 47篇 |
2002年 | 32篇 |
2001年 | 19篇 |
2000年 | 19篇 |
1999年 | 26篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 15篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1083条查询结果,搜索用时 125 毫秒
1.
A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed. 相似文献
2.
In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time. 相似文献
3.
This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity. 相似文献
4.
The paper presents a new approach for recommending suitable learning paths for different learners groups. Selection of the learning path is considered as recommendations to choosing and combining the sequences of learning objects (LOs) according to learners’ preferences. Learning path can be selected by applying artificial intelligence techniques, e.g. a swarm intelligence model. If we modify and/or change some LOs in the learning path, we should rearrange the alignment of new and old LOs and reallocate pheromones to achieve effective learning recommendations. To solve this problem, a new method based on the ant colony optimisation algorithm and adaptation of the solution to the changing optimum is proposed. A simulation process with a dynamic change of learning paths when new LOs are inserted was chosen to verify the method proposed. The paper contributes with the following new developments: (1) an approach of dynamic learning paths selection based on swarm intelligence, and (2) a modified ant colony optimisation algorithm for learning paths selection. The elaborated approach effectively assist learners by helping them to reach most suitable LOs according to their preferences, and tutors – by helping them to monitor, refine, and improve e-learning modules and courses according to the learners’ behaviour. 相似文献
5.
In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes. 相似文献
6.
The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm. 相似文献
7.
基于最短向量问题的格公钥密码体制是典型的抗量子计算密码体制。格的唯一最短向量问题可转化为二面体群的隐含子群问题。有效地求解二面体群的隐含子群问题可攻破基于格的唯一最短向量问题的公钥密码体制。Kuperberg提出了二面体群隐含子群问题的半指数级量子算法。通过研究Kuperberg量子算法,利用概率量子克隆,文中提出了二面体群隐含子群问题的多项式时间量子算法。 相似文献
8.
9.
Path profiling records the frequency of each path in an executed program.To accomplish profiling,probes are instrumented in the program and executed as the program runs.So,the number of probes has a significant impact on the efficiency of a profiling technique.By profiling only the interesting paths,existing techniques try to improve the profiling efficiency by reducing the number of probes and optimize path encodings for efficient storage.However,they lack accuracy,waste time on running uninteresting paths,and can mainly deal with acyclic paths.In this article,a novel technique called Profiling Selected Paths(PSP)is introduced to profile selected paths,which enables custom selection for both acyclic and cyclic paths and increases the execution efficiency by early termination on uninteresting paths.Theoretical analysis and experimental evaluation indicate that PSP performs better than existing techniques. 相似文献
10.
基于子结构的内力约束连续体拓扑优化 总被引:1,自引:0,他引:1
通过拓扑优化可以得到传力路径,不同传力路径对应不同内力载荷。如果将内力载荷作为目标或约束进行拓扑优化,可以得到满足不同需求的传力路径,为拓扑优化的发展提供新思路和新方法。为了得到不同内力载荷需求的传力路径,基于子结构法将结构分开使内力暴露出来。以结构质量最小为目标,以内力为约束建立拓扑优化模型,基于独立、连续、映射( independent, continuous, mapping, ICM)方法和单位载荷法将内力显式化,通过累加获得需要控制的传力路径上的内力,通过迭代调整2个路径上的内力使其比值达到一个稳定的值,从而获得满足内力约束的传力路径。算例表明:不同的内力约束可以得到不同的传力路径。 相似文献