首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2983篇
  免费   220篇
  国内免费   185篇
电工技术   173篇
综合类   354篇
化学工业   43篇
金属工艺   36篇
机械仪表   168篇
建筑科学   59篇
矿业工程   36篇
能源动力   19篇
轻工业   31篇
水利工程   35篇
石油天然气   22篇
武器工业   12篇
无线电   145篇
一般工业技术   96篇
冶金工业   15篇
原子能技术   6篇
自动化技术   2138篇
  2024年   1篇
  2023年   3篇
  2022年   15篇
  2021年   21篇
  2020年   25篇
  2019年   22篇
  2018年   22篇
  2017年   22篇
  2016年   32篇
  2015年   41篇
  2014年   80篇
  2013年   89篇
  2012年   114篇
  2011年   132篇
  2010年   134篇
  2009年   152篇
  2008年   188篇
  2007年   217篇
  2006年   222篇
  2005年   210篇
  2004年   228篇
  2003年   167篇
  2002年   164篇
  2001年   177篇
  2000年   136篇
  1999年   102篇
  1998年   109篇
  1997年   99篇
  1996年   85篇
  1995年   85篇
  1994年   59篇
  1993年   53篇
  1992年   50篇
  1991年   42篇
  1990年   22篇
  1989年   17篇
  1988年   5篇
  1987年   6篇
  1986年   7篇
  1985年   12篇
  1984年   3篇
  1983年   4篇
  1982年   5篇
  1980年   3篇
  1979年   2篇
  1978年   1篇
  1977年   1篇
  1976年   2篇
排序方式: 共有3388条查询结果,搜索用时 15 毫秒
1.
软件集成测试技术研究   总被引:1,自引:0,他引:1  
兰景英 《信息技术》2006,30(8):100-103
首先分析了集成测试的原理和特点,并指出了集成测试的重要性。然后结合传统软件与面向对象软件开发的方法和技术,详细介绍了传统软件的集成测试方法和策略,并深入分析了面向对象软件集成测试的原理和方法。  相似文献   
2.
A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding. Recommended by: Ashfaq Khokhar  相似文献   
3.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez  相似文献   
4.
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.  相似文献   
5.
The requirements on an object-oriented DBMS for management of information in a large, complex enterprise are presented. These requirements aid in the achievement of an environment characterized by data sharing, open architectures, application and data portability, and assurance of data integrity. They were defined from the point of view of a user of the DBMS; therefore they describe the expected functionality of the DBMS and do not specify the method of implementation to achieve this functionality. They encompass requirements on the data model, query and data manipulation languages, the system architecure, interfaces to the system, change management, and transaction management.  相似文献   
6.
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.  相似文献   
7.
8.
The paper describes a prototype system called HiSQL (Historical SQL) which extends the functionality of SQL in manipulating historical data, by providing functions for spatial and temporal processing. Conceptually the paper is divided into three parts: the first part deals with the design and architecture of the system; the second part introduces a case study (the defters); and the third part describes specific functions for spatial and temporal processing of serial documents. The paper concludes with a comparison between HiSQL and SQL and suggestions for further work. This revised version was published online in August 2006 with corrections to the Cover Date.  相似文献   
9.
窗口系统是人机交互的基本环境,与目前DOS上的窗口系统相比,本文力求突出高效,低开销,具有多任务模拟能力,满足可移植性,实用性和开放性目标,本文首先提出一个基于DOS的多窗口系统WIND的总体设计,采用面向对象技术,讨论了其多窗口管理机制的特征和方法,并设计和实现了该系统相关的基本工具,最后通过编程环境、界面风格和应用实例等进一步介绍该窗口系统的应用接口。  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号