首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3135篇
  免费   579篇
  国内免费   609篇
电工技术   96篇
综合类   339篇
化学工业   19篇
金属工艺   17篇
机械仪表   70篇
建筑科学   73篇
矿业工程   33篇
能源动力   13篇
轻工业   20篇
水利工程   36篇
石油天然气   18篇
武器工业   11篇
无线电   349篇
一般工业技术   87篇
冶金工业   12篇
原子能技术   12篇
自动化技术   3118篇
  2024年   21篇
  2023年   54篇
  2022年   95篇
  2021年   84篇
  2020年   102篇
  2019年   75篇
  2018年   82篇
  2017年   115篇
  2016年   119篇
  2015年   162篇
  2014年   234篇
  2013年   185篇
  2012年   262篇
  2011年   316篇
  2010年   272篇
  2009年   251篇
  2008年   295篇
  2007年   265篇
  2006年   202篇
  2005年   185篇
  2004年   189篇
  2003年   129篇
  2002年   119篇
  2001年   99篇
  2000年   72篇
  1999年   47篇
  1998年   58篇
  1997年   50篇
  1996年   25篇
  1995年   30篇
  1994年   30篇
  1993年   25篇
  1992年   13篇
  1991年   11篇
  1990年   6篇
  1989年   7篇
  1988年   3篇
  1987年   6篇
  1986年   7篇
  1985年   8篇
  1984年   3篇
  1982年   3篇
  1981年   3篇
  1980年   1篇
  1978年   1篇
  1977年   1篇
  1975年   1篇
排序方式: 共有4323条查询结果,搜索用时 15 毫秒
1.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。  相似文献   
2.
The Two-Dimensional Clifford-Fourier Transform   总被引:1,自引:0,他引:1  
Recently several generalizations to higher dimension of the Fourier transform using Clifford algebra have been introduced, including the Clifford-Fourier transform by the authors, defined as an operator exponential with a Clifford algebra-valued kernel. In this paper an overview is given of all these generalizations and an in depth study of the two-dimensional Clifford-Fourier transform of the authors is presented. In this special two-dimensional case a closed form for the integral kernel may be obtained, leading to further properties, both in the L 1 and in the L 2 context. Furthermore, based on this Clifford-Fourier transform Clifford-Gabor filters are introduced. AMS subject classification numbers: 42B10, 30G35 Fred Brackx received a diploma degree in mathematics from Ghent University, Belgium, in 1970 and a Ph.D. degree in mathematics from the same university in 1973. Since 1984 he is professor for mathematical analysis at Ghent University and currently he is leading the Clifford Research Group. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets. Nele De Schepper received a diploma degree in mathematics from Ghent University, Belgium, in 2001. Since then she holds an assistantship at the Department of Mathematical Analysis of Ghent University and is a member of the Clifford Research Group. Her main interests are function theory and functional analysis for functions with values in Clifford algebras. The research covers generalized Fourier transforms, orthogonal polynomials and multi-dimensional wavelets. Frank Sommen received a diploma degree in mathematics from Ghent University, Belgium, in 1978, a Ph.D. degree in mathematics from the same university in 1980, and a habilitation degree in mathematical analysis in 1984. From 1978 until 1999 he was at the National Fund for Scientific Research (Flanders). Since 2000 he holds a Research professorship at Ghent University. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets, algebraic analysis, hyperfunctions and radial algebra.  相似文献   
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.
LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity.  相似文献   
6.
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.  相似文献   

7.
利用VB6.0Data控件实现了多表任选字段的综合查询,并给出了关键部分的编码,经应用和测试,该方法不仅实用,而且操作方便、反应快捷,较数据库编程简单、灵活。  相似文献   
8.
The challenge of saturating all phases of pervasive service provision with context-aware functionality lies in coping with the complexity of maintaining, retrieving and distributing context information. To efficiently represent and query context information a sophisticated modelling scheme should exist. To distribute and synchronise context knowledge in various context repositories across a multitude of administrative domains, streamlined mechanisms are needed. This paper elaborates on an innovative context management framework that has been designed to cope with free-text and location based context retrieval and efficient context consistency control. The proposed framework has been incorporated in a multi-functional pervasive services platform, while most of the mechanisms it employs have been empirically evaluated.  相似文献   
9.
Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.  相似文献   
10.
不确定移动对象概率Skyline集的查询更新   总被引:1,自引:0,他引:1  
Skyline查询的研究已从传统的静态Skyline操作延伸到动态的、不确定数据集上的Skyline查询和计算上。研究了移动环境下,查询点位置固定、目标点处于运动状态并且位置不确定情况下的连续概率Skyline计算问题。这个过程中,移动对象与查询对象之间的距离随时间不断变化。移动对象由于其运动状态导致位置无法精确定位,因此移动对象之间的支配关系只能采用概率形式表示,且随时间不断变化。给出了移动对象间的支配概率的定义,以及移动对象Skyline概率的定义,并定义了触发事件来记录对象支配概率发生变化的时刻,实现概率Skyline计算的连续跟踪和动态更新。提出了基于事件触发的连续概率Skyline查询算法(event triggered continuous probabilistic Skyline query for uncertain moving object,U-ECPS),对移动环境下的Skyline集进行连续查询和更新。大量的实验结果验证了U-ECPS算法的有效性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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