全文获取类型
收费全文 | 5658篇 |
免费 | 392篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 72篇 |
综合类 | 7篇 |
化学工业 | 1703篇 |
金属工艺 | 65篇 |
机械仪表 | 108篇 |
建筑科学 | 220篇 |
矿业工程 | 12篇 |
能源动力 | 222篇 |
轻工业 | 711篇 |
水利工程 | 45篇 |
石油天然气 | 7篇 |
无线电 | 391篇 |
一般工业技术 | 1077篇 |
冶金工业 | 430篇 |
原子能技术 | 30篇 |
自动化技术 | 955篇 |
出版年
2024年 | 16篇 |
2023年 | 104篇 |
2022年 | 333篇 |
2021年 | 408篇 |
2020年 | 190篇 |
2019年 | 193篇 |
2018年 | 222篇 |
2017年 | 195篇 |
2016年 | 271篇 |
2015年 | 199篇 |
2014年 | 297篇 |
2013年 | 372篇 |
2012年 | 368篇 |
2011年 | 476篇 |
2010年 | 311篇 |
2009年 | 270篇 |
2008年 | 317篇 |
2007年 | 251篇 |
2006年 | 179篇 |
2005年 | 154篇 |
2004年 | 136篇 |
2003年 | 127篇 |
2002年 | 90篇 |
2001年 | 63篇 |
2000年 | 52篇 |
1999年 | 56篇 |
1998年 | 58篇 |
1997年 | 50篇 |
1996年 | 46篇 |
1995年 | 26篇 |
1994年 | 29篇 |
1993年 | 26篇 |
1992年 | 27篇 |
1991年 | 15篇 |
1990年 | 7篇 |
1989年 | 14篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 7篇 |
1985年 | 8篇 |
1984年 | 11篇 |
1983年 | 11篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1977年 | 5篇 |
1976年 | 3篇 |
1973年 | 3篇 |
1967年 | 2篇 |
排序方式: 共有6055条查询结果,搜索用时 15 毫秒
81.
Combinatorial testing is as an effective testing technique to reveal failures in a given system, based on input combinations
coverage and combinatorial optimization. Combinatorial testing of strength
t (t ≥ 2) requires that each t-wise tuple of values of the different system input parameters is covered by at least one test case. Combinatorial test suite generation
algorithms aim at producing a test suite covering all the required tuples in a small (possibly minimal) number of test cases,
in order to reduce the cost of testing. The most used combinatorial technique is the pairwise testing (t = 2) which requires coverage of all pairs of input values. Constrained combinatorial testing takes also into account constraints
over the system parameters, for instance forbidden tuples of inputs, modeling invalid or not realizable input values combinations. In this paper a new approach to combinatorial
testing, tightly integrated with formal logic, is presented. In this approach, test predicates are used to formalize combinatorial
testing as a logical problem, and an external formal logic tool is applied to solve it. Constraints over the input domain
are expressed as logical predicates too, and effectively handled by the same tool. Moreover, inclusion or exclusion of select
tuples is supported, allowing the user to customize the test suite layout. The proposed approach is supported by a prototype
tool implementation and results of experimental assessment are also presented. 相似文献
82.
83.
Electronic documents used in the framework of the goods delivery industry—i.e. electronic bills of lading (e-BOLs)—are the enablers of any payment, and therefore exposed to frauds. As of today, e-BOLs are handled by special private companies, which provide paperless trading services through their trade chains. This paper contributes a zero-knowledge open solution to the problem of designing secure electronic bills of lading, in the framework of a shipper-carrier-buyer transmission model. The suggested solution is a cryptographic protocol based on digital signatures and blind merchandise counts—that is, counts that do not reveal any information about actually counted quantities. The model is designed to mitigate a number of security threats and assumes the existence of both a trusted third party and a bank in charge of payment procedures. The paper discusses the drawbacks of the existing proprietary solutions and shows how the suggested open protocol addresses them. 相似文献
84.
85.
In this paper we propose a heuristic approach for the problem of packing equal rectangles within a convex region. The approach is based on an Iterated Local Search scheme, in which the key step is the perturbation move. Different perturbation moves, both combinatorial and continuous ones, are proposed and compared through extensive computational experiments on a set of test instances. The overall results are quite encouraging. 相似文献
86.
Alessandro Agnetis Enrico Grande Pitu B. Mirchandani Andrea Pacifici 《Computers & Operations Research》2009
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing. 相似文献
87.
88.
89.
90.
This paper provides an overview of the current state-of-the-art on using constraints in knowledge discovery and data mining. The use of constraints in a data mining task requires specific definition and satisfaction tools during knowledge extraction. This survey proposes three groups of studies based on classification, clustering and pattern mining, whether the constraints are on the data, the models or the measures, respectively. We consider the distinctions between hard and soft constraint satisfaction, and between the knowledge extraction phases where constraints are considered. In addition to discussing how constraints can be used in data mining, we show how constraint-based languages can be used throughout the data mining process. 相似文献