全文获取类型
收费全文 | 2865篇 |
免费 | 527篇 |
国内免费 | 565篇 |
专业分类
电工技术 | 62篇 |
综合类 | 288篇 |
化学工业 | 12篇 |
金属工艺 | 10篇 |
机械仪表 | 56篇 |
建筑科学 | 25篇 |
矿业工程 | 31篇 |
能源动力 | 3篇 |
轻工业 | 11篇 |
水利工程 | 15篇 |
石油天然气 | 13篇 |
武器工业 | 8篇 |
无线电 | 298篇 |
一般工业技术 | 46篇 |
冶金工业 | 11篇 |
原子能技术 | 4篇 |
自动化技术 | 3064篇 |
出版年
2024年 | 12篇 |
2023年 | 32篇 |
2022年 | 64篇 |
2021年 | 55篇 |
2020年 | 71篇 |
2019年 | 46篇 |
2018年 | 74篇 |
2017年 | 100篇 |
2016年 | 101篇 |
2015年 | 146篇 |
2014年 | 216篇 |
2013年 | 160篇 |
2012年 | 237篇 |
2011年 | 274篇 |
2010年 | 239篇 |
2009年 | 230篇 |
2008年 | 281篇 |
2007年 | 257篇 |
2006年 | 196篇 |
2005年 | 181篇 |
2004年 | 199篇 |
2003年 | 120篇 |
2002年 | 119篇 |
2001年 | 107篇 |
2000年 | 75篇 |
1999年 | 48篇 |
1998年 | 58篇 |
1997年 | 51篇 |
1996年 | 26篇 |
1995年 | 34篇 |
1994年 | 33篇 |
1993年 | 30篇 |
1992年 | 18篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1975年 | 3篇 |
排序方式: 共有3957条查询结果,搜索用时 31 毫秒
1.
Shouguang Wang Mengdi Gan Mengchu Zhou Dan You 《IEEE/CAA Journal of Automatica Sinica》2015,2(4):345-352
As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. 相似文献
2.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
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.
Dimitris Papadias M.Sc. Ph.D. candidate Timos Sellis Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):479-516
Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations. 相似文献
5.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
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. 相似文献
6.
模糊Petri网及知识表示 总被引:6,自引:0,他引:6
蔡之华 《计算机应用与软件》1994,11(3):30-36
在建造专家系统中虽然有很多种知识表示方法,但都有不尽人意的地方,本文试图用一种新的方法-Petri网模型来表示知识。本文给出了Fuzzzy Petri网和广义Fuzzy Petri网两种模型,并给出了相应的推理算法,一旦专家知识用Petri网表示后,根据Petri网固有的特性,我们就能处理专家系统中并行推理、无回溯推理,反向推理等问题。 相似文献
7.
8.
This research investigates and approach to query processing in a multidatabase system that uses an objectoriented model to capture the semantics of other data models. The object-oriented model is used to construct a global schema, defining an integrated view of the different schemas in the environment. The model is also used as a self-describing model to build a meta-database for storing information about the global schema. A unique aspect of this work is that the object-oriented model is used to describe the different data models of the multidatabase environment, thereby extending the meta database with semantic information about the local schemas. With the global and local schemas all represented in an object-oriented form, structural mappings between the global schema and each local schema are then easily supported. An object algebra then provides a query language for expressing global queries, using the structural mappings to translate object algebra queries into SQL queries over local relational schema. The advantage of using an object algebra is that the object-oriented database can be viewed as a blackboard for temporary storage of local data and for establishing relationships between different databases. The object algebra can be used to directly retrieve temporarily-stored data from the object-oriented database or to transparently retrieve data from local sources using the translation process described in this paper. 相似文献
9.
The communicating finite state machines can exchange messages over bounded FIFO channels. In this paper, a new technique, called reverse reachability analysis, is proposed to detect deadlocks on the communication between the communicating finite state machines. The technique is based on finding reverse reachable paths starting from possible deadlock states. If a reverse reachable path can reach the initial global state, then deadlock occurs. Otherwise the communication is deadlock-free. The effectiveness of the technique has been verified by some real protocols such as a specification of X.25 call establishment/clear protocol and Bartlet's alternating bit protocol. 相似文献
10.
We consider a system defined as the product of a finite set of periodic systems on cyclic groups. It is of interest to determine if certain subgroups and unions of subgroups of the state set are reachable from a specified initial state, and in particular to determine the computational complexity of verifying such reachability. These questions are motivated by certain problems that arise in the modelling and control of discrete event systems and certain forms of periodic scheduling. Our main result is that deciding whether or not the union of a certain set of subgroups is reachable or not is NP-complete. 相似文献