全文获取类型
收费全文 | 1173篇 |
免费 | 71篇 |
国内免费 | 49篇 |
专业分类
电工技术 | 10篇 |
综合类 | 132篇 |
化学工业 | 8篇 |
金属工艺 | 14篇 |
机械仪表 | 36篇 |
建筑科学 | 5篇 |
矿业工程 | 2篇 |
能源动力 | 7篇 |
轻工业 | 17篇 |
水利工程 | 1篇 |
石油天然气 | 3篇 |
武器工业 | 5篇 |
无线电 | 74篇 |
一般工业技术 | 70篇 |
冶金工业 | 12篇 |
自动化技术 | 897篇 |
出版年
2024年 | 5篇 |
2023年 | 24篇 |
2022年 | 21篇 |
2021年 | 16篇 |
2020年 | 11篇 |
2019年 | 19篇 |
2018年 | 15篇 |
2017年 | 32篇 |
2016年 | 29篇 |
2015年 | 41篇 |
2014年 | 40篇 |
2013年 | 66篇 |
2012年 | 69篇 |
2011年 | 77篇 |
2010年 | 48篇 |
2009年 | 82篇 |
2008年 | 72篇 |
2007年 | 57篇 |
2006年 | 67篇 |
2005年 | 43篇 |
2004年 | 51篇 |
2003年 | 61篇 |
2002年 | 45篇 |
2001年 | 28篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 21篇 |
1997年 | 23篇 |
1996年 | 20篇 |
1995年 | 21篇 |
1994年 | 17篇 |
1993年 | 29篇 |
1992年 | 14篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有1293条查询结果,搜索用时 31 毫秒
81.
Jason J. Jung 《Expert systems with applications》2012,39(3):3169-3173
There have been many kinds of association rule mining (ARM) algorithms, e.g., Apriori and FP-tree, to discover meaningful frequent patterns from a large dataset. Particularly, it is more difficult for such ARM algorithms to be applied for temporal databases which are continuously changing over time. Such algorithms are generally based on repeating time-consuming tasks, e.g., scanning databases. To deal with this problem, in this paper, we propose a constraint graph-based method for maintaining frequent patterns (FP) discovered from the temporal databases. Particularly, the constraint graph, which is represented as a set of constraint between two items, can be established by temporal persistency of the patterns. It means that some patterns can be used to build the constraint graph, when the patterns have been shown in a set of the FP. Two types of constraints can be generated by users and adaptation. Based on our scheme, we find that a large number of dataset has been efficiently reduced during mining process and the gathering information while updating. 相似文献
82.
Olivier Serre 《Information Processing Letters》2003,85(6):285-291
We consider infinite two-player games on pushdown graphs. For parity winning conditions, we show that the set of winning positions of each player is regular and we give an effective construction of an alternating automaton recognizing it. This provides a DEXPTIME procedure to decide whether a position is winning for a given player. Finally, using the same methods, we show, for any ω-regular winning condition, that the set of winning positions for a given player is regular and effective. 相似文献
83.
84.
A database system of mechanical components based on geometric and topological similarity. Part I: representation 总被引:3,自引:0,他引:3
A database of mechanical components is an important issue for some manufacturing activities such as cost estimation, process planning, and design by case-based reasoning. In this paper, we give the representation scheme of the CAD model in such a database. Components are represented using attributed graphs in which the nodes correspond to the surfaces of the component and the links correspond to the edges of the component. The graph is based on the standard for the exchange of product information (STEP) physical file of the component. STEP file should be unique for a single component regardless of the underlying CAD system. The process of creating the graph of a component constitutes two sub-tasks: (i) importing the CAD model from the CAD system in STEP format and (ii) transforming the STEP data into attributed graph-based representation. The graph and its attributes describe the topology of the component completely together with some geometric data that are not dependent on any coordinate system such as surface type and curve type. These geometric data are helpful in the retrieval and matching processes in the database. 相似文献
85.
86.
S.C. Nandy G.N. Nandakumar B.B. Bhattacharya 《Computers & Mathematics with Applications》1997,34(12):121-135
This paper outlines an algorithm for optimum linear ordering (OLO) of a weighted parallel graph with O(n log k) worst-case time complexity, and O(n + k log(n/k) log k) expected-case time complexity, where n is the total number of nodes and k is the number of chains in the parallel graph. Next, the two-layer OLO problem is considered, where the goal is to place the nodes linearly in two routing layers minimizing the total wire length. The two-layer problem is shown to subsume the maxcut problem and a befitting heuristic algorithm is proposed. Experimental results on randomly generated samples show that the heuristic algorithm runs very fast and outputs optimum solutions in more than 90% instances. 相似文献
87.
基于知识图的汉语基本名词短语分析模型 总被引:2,自引:0,他引:2
本文提出了一种基于知识图的汉语baseNP分析模型。它以知识图为知识表示方法,利用《知网》为语义知识资源,采用以语义为主、语法为辅的策略,先为短语中的每一个实词构造“词图”,然后合并“词图”而组成“短语图”,最后得到一个关于汉语baseNP结构信息和语义信息的知识图。因此它不仅分析了汉语baseNP结构的内部句法关系,而且分析了汉语baseNP结构成分间的语义关系并以知识图的形式表示出了这种语义关系。实验结果表明这个模型对于汉语baseNP的分析是有效的。 相似文献
88.
A technique for scheduling and processor allocation leading to the synthesis of integrated heterogeneous pipelined processing elements, implementing digital signal processing applications, is proposed. The proposed technique achieves efficient hardware implementations at the logic-level by minimizing the number of processing units used, without compromising the rate and delay optimality criteria.
The proposed algorithm is found to outperform algorithms resulting in homogeneous implementations, as it gives schedules with lower iteration periods, requires less hardware resources, and has lower time complexity at design time. In comparison with the already existing heterogeneous algorithms, the proposed algorithm produces schedules of lower time complexity and lower iteration period for some applications. The optimal performance of the proposed algorithm has been verified on several benchmarks. 相似文献
89.
《Theoretical computer science》2004,310(1-3):287-307
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied interval graph G) in which our goal is to discover an (unknown) independent set X by making the fewest queries of the form “Is point p covered by an interval in X?” Our interest in this problem stems from two applications: experimental gene discovery with PCR technology and the game of Battleship (in a 1-dimensional setting). We provide adaptive algorithms for both the verification scenario (given an independent set, is it X?) and the discovery scenario (find X without any information). Under some assumptions, these algorithms use an asymptotically optimal number of queries in every instance. 相似文献
90.
二分图中含大圈的 2―因子(英文) 总被引:2,自引:0,他引:2
本文给出了均衡二分图有一个2-因子恰含 k 个大圈的度条件。设 G = (V1,V2;E) 是一个二分图,满足 |V1| = |V2| = n ≥ sk,其中 s ≥ 3 和 k ≥ 1 是两个整数。如果图 G 的最小度至少为 (1 ? 1/s)n + 1,那么 G 有一个2-因子恰含 k 个圈使得每个圈长至少为 2s。 相似文献