全文获取类型
收费全文 | 334篇 |
免费 | 18篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 6篇 |
综合类 | 10篇 |
化学工业 | 7篇 |
金属工艺 | 11篇 |
机械仪表 | 25篇 |
建筑科学 | 2篇 |
矿业工程 | 11篇 |
能源动力 | 1篇 |
轻工业 | 21篇 |
水利工程 | 5篇 |
石油天然气 | 1篇 |
无线电 | 27篇 |
一般工业技术 | 10篇 |
冶金工业 | 9篇 |
自动化技术 | 216篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 12篇 |
2019年 | 6篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 6篇 |
2015年 | 7篇 |
2014年 | 20篇 |
2013年 | 11篇 |
2012年 | 18篇 |
2011年 | 25篇 |
2010年 | 11篇 |
2009年 | 24篇 |
2008年 | 21篇 |
2007年 | 15篇 |
2006年 | 25篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 16篇 |
2002年 | 4篇 |
2001年 | 8篇 |
2000年 | 11篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1965年 | 1篇 |
1962年 | 1篇 |
排序方式: 共有362条查询结果,搜索用时 15 毫秒
1.
On sorting triangles in a delaunay tessellation 总被引:1,自引:0,他引:1
In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.This work was partially supported by the National Science Foundation's US-Italy Collaborative Research Program under Grant INT-8714578 and Information, Robotics, and Intelligent Research Grant IRI-8704781. 相似文献
2.
周慧兰 《中国制造业信息化》2006,35(9):65-68
利用零件的相似性原理对零件分组是派生式CAPP系统的重要内容,对零件的分组是否合理,直接影响到派生式CAPP系统能否正常运行。阐述了排序聚类分析算法在生产流程分析法中的工作原理,分析了利用该算法实现零件分组的实现过程,并用示例验证了该算法。 相似文献
3.
Joel 《Journal of Parallel and Distributed Computing》2005,65(12):1601-1606
Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results. 相似文献
4.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(1-2):113-129
Abstract The primary objective in the sorting approach is to assign a set of alternatives into predefined classes. This type of problem is often encountered in many real world decision problems. During the last two decades several new approaches have been proposed to overcome the shortcomings of traditional statistical and econometric techniques. This paper focuses on the multicriteria decision aid (MCDA) approach; it briefly reviews the main MCDA sorting techniques, and presents the multigroup hierarchical discrimination method. This new MCDA sorting technique is applied to the portfolio selection problem. A comparison with discriminant analysis is also performed. Furthermore, the efficiency of the proposal approach can be easily improved for solving large-scale problems in a multiprocessing environment. 相似文献
5.
Travis Gagie 《Information Processing Letters》2008,108(6):418-421
Sorting is a classic problem and one to which many others reduce easily. In the streaming model, however, we are allowed only one pass over the input and sublinear memory, so in general we cannot sort. In this paper we show that, to determine the sorted order of a multiset s of size n containing σ?2 distinct elements using one pass and o(nlogσ) bits of memory, it is generally necessary and sufficient that its entropy H=o(logσ). Specifically, if s={s1,…,sn} and si1,…,sin is the stable sort of s, then we can compute i1,…,in in one pass using O((H+1)n) time and O(Hn) bits of memory, with a simple combination of classic techniques. On the other hand, in the worst case it takes that much memory to compute any sorted ordering of s in one pass. 相似文献
6.
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelihood training of stochastic grammars. The approach is exemplified by an analysis of the expected size of binary tries as well as by three sorting algorithms and it is compared to the known results that were obtained by traditional techniques. Investigating traditional settings like the random permutation model, we rediscover well-known results formerly derived by pure analytic methods; changing to biased data yields original results. All but one step of our analysis can be automated on top of a computer-algebra system. Thus our new approach can reduce the effort required for an average-case analysis, allowing for the consideration of realistic input distributions with unknown distribution functions at the same time. As a by-product, our approach yields an easy way to generate random combinatorial objects according to various probability distributions. 相似文献
7.
8.
Tolerance specification is an important part of mechanical design. Design tolerances strongly influence the functional performance and manufacturing cost of a mechanical product. Tighter tolerances normally produce superior components, better performing mechanical systems and good assemblability with assured exchangeability at the assembly line. However, unnecessarily tight tolerances lead to excessive manufacturing costs for a given application. The balancing of performance and manufacturing cost through identification of optimal design tolerances is a major concern in modern design. Traditionally, design tolerances are specified based on the designer’s experience. Computer-aided (or software-based) tolerance synthesis and alternative manufacturing process selection programs allow a designer to verify the relations between all design tolerances to produce a consistent and feasible design. In this paper, a general new methodology using intelligent algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection is presented. The problem has a multi-criterion character in which 3 objective functions, 3 constraints and 5 variables are considered. The average fitness factor method and normalized weighted objective functions method are separately used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed. 相似文献
10.