全文获取类型
收费全文 | 61831篇 |
免费 | 7904篇 |
国内免费 | 6456篇 |
专业分类
电工技术 | 5168篇 |
技术理论 | 9篇 |
综合类 | 6745篇 |
化学工业 | 1381篇 |
金属工艺 | 696篇 |
机械仪表 | 3627篇 |
建筑科学 | 2265篇 |
矿业工程 | 1558篇 |
能源动力 | 779篇 |
轻工业 | 735篇 |
水利工程 | 1368篇 |
石油天然气 | 2904篇 |
武器工业 | 805篇 |
无线电 | 10085篇 |
一般工业技术 | 2960篇 |
冶金工业 | 1094篇 |
原子能技术 | 736篇 |
自动化技术 | 33276篇 |
出版年
2024年 | 357篇 |
2023年 | 974篇 |
2022年 | 1874篇 |
2021年 | 2288篇 |
2020年 | 2450篇 |
2019年 | 1915篇 |
2018年 | 1744篇 |
2017年 | 2137篇 |
2016年 | 2340篇 |
2015年 | 2682篇 |
2014年 | 4308篇 |
2013年 | 3824篇 |
2012年 | 4603篇 |
2011年 | 4910篇 |
2010年 | 3779篇 |
2009年 | 3803篇 |
2008年 | 4267篇 |
2007年 | 4772篇 |
2006年 | 4025篇 |
2005年 | 3627篇 |
2004年 | 3081篇 |
2003年 | 2626篇 |
2002年 | 1965篇 |
2001年 | 1489篇 |
2000年 | 1276篇 |
1999年 | 931篇 |
1998年 | 714篇 |
1997年 | 593篇 |
1996年 | 497篇 |
1995年 | 436篇 |
1994年 | 347篇 |
1993年 | 252篇 |
1992年 | 177篇 |
1991年 | 180篇 |
1990年 | 136篇 |
1989年 | 106篇 |
1988年 | 87篇 |
1987年 | 68篇 |
1986年 | 60篇 |
1985年 | 88篇 |
1984年 | 61篇 |
1983年 | 73篇 |
1982年 | 64篇 |
1981年 | 39篇 |
1980年 | 20篇 |
1979年 | 34篇 |
1978年 | 12篇 |
1977年 | 20篇 |
1976年 | 13篇 |
1959年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Cathy Lawson Douglas C. Montgomery 《Quality and Reliability Engineering International》2006,22(8):971-984
Variation exists in all processes. Significant work has been done to identify and remove sources of variation in manufacturing processes resulting in large returns for companies. However, business process optimization is an area that has a large potential return for a company. Business processes can be difficult to optimize due to the nature of the output variables associated with them. Business processes tend to have output variables that are binary, nominal or ordinal. Examples of these types of output include whether a particular event occurred, a customer's color preference for a new product and survey questions that assess the extent of the survey respondent's agreement with a particular statement. Output variables that are binary, nominal or ordinal cannot be modeled using ordinary least‐squares regression. Logistic regression is a method used to model data where the output is binary, nominal or ordinal. This article provides a review of logistic regression and demonstrates its use in modeling data from a business process involving customer feedback. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
12.
Qing Li 《Computer Standards & Interfaces》1991,13(1-3):99-103
The term ‘object-oriented database’ has been used to refer to different characteristics and mechanisms supported by semantic databases and (behaviorally) object-oriented ones. While this indicates the current confusion due to the lack of a common model, it also suggests the potential desirability of combining these two kinds of modeling facilities into the same nutshell. This paper summarizes from these two paradigms the features common to both, the features influenced/adopted by each other, and the features which are presented in one paradigm but missing from the other. After a brief analysis and discussion of these features, we conclude this paper by proposing our major theme: a complete object data model should take the union of the facilities offered by these two kinds of models. 相似文献
13.
通用串行总线(USB)数据传输模型 总被引:1,自引:1,他引:0
USB作为一种数据传输接口,了解它的通信传输机制是正确利用USB利用数据传输的基础,分层次结构对USB数据传输模型加以分析,可以使读者建立起USB体系结构、通信模型和总线事务的框架和概念,并最终对USB传输工作流程有一个清晰的认识。 相似文献
14.
Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following
two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion
time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b . 相似文献
15.
This paper presents an algorithm that permits the search for dependencies among sets of data (univariate or multivariate time-series, or cross-sectional observations). The procedure is modeled after genetic theories and Darwinian concepts, such as natural selection and survival of the fittest. It permits the discovery of equations of the data-generating process in symbolic form. The genetic algorithm that is described here uses parts of equations as building blocks to breed ever better formulas. Apart from furnishing a deeper understanding of the dynamics of a process, the method also permits global predictions and forecasts. The algorithm is successfully tested with artificial and with economic time-series and also with cross-sectional data on the performance and salaries of NBA players during the 94–95 season. 相似文献
16.
Osama Y. Abudayyeh 《Advances in Engineering Software》1993,16(3):187-193
Effective management of construction projects depends on good access to and control of data, especially data pertaining to cost and schedule control functions. However, the proper design and development of automated mechanisms have not had the facility to acquire and store quality data in a timely manner. The purpose of this paper, then, is to discuss a prototype, automated data acquisition system that was developed to support an integrated project management system. The data acquisition system is composed of an integrated set of electronic forms used in conjunction with a bar coding data-entry tool. 相似文献
17.
18.
从数据结构角度为旅游胜地设计导游系统。向游人提供景点的信息查询服务,根据指定的景点提供相关的景点信息。任意给定起点和终点,查询两点之间的最短路径。 相似文献
19.
Non-redundant data clustering 总被引:6,自引:6,他引:0
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this
discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel,
previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck
framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to
constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different
types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification
and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and
computer vision. 相似文献
20.
金永杰 《核电子学与探测技术》1989,9(1):10-17
本文所提出的投影域重建——再投影迭代算法可以恢复不完整的扇形束投影数据,从而实现从有限的投影数据重建图象。这种算法把滤波——反投影图象重建过程和再投影的过程纳入一个公式,仅在投影域上估算未知的投影数据,因此避免了重建过程和反投影过程中的插值运算,改善了收敛性,提高了计算精度,缩短了运算时间。模拟实验表明:即使有70%的投影数据丢失,经过两次迭代就能以令人满意的精度恢复丢失的投影数据。 相似文献