全文获取类型
收费全文 | 33147篇 |
免费 | 2133篇 |
国内免费 | 32篇 |
专业分类
电工技术 | 244篇 |
综合类 | 18篇 |
化学工业 | 6523篇 |
金属工艺 | 627篇 |
机械仪表 | 696篇 |
建筑科学 | 960篇 |
矿业工程 | 132篇 |
能源动力 | 559篇 |
轻工业 | 5443篇 |
水利工程 | 314篇 |
石油天然气 | 125篇 |
武器工业 | 6篇 |
无线电 | 1301篇 |
一般工业技术 | 5670篇 |
冶金工业 | 8009篇 |
原子能技术 | 117篇 |
自动化技术 | 4568篇 |
出版年
2024年 | 76篇 |
2023年 | 289篇 |
2022年 | 304篇 |
2021年 | 757篇 |
2020年 | 669篇 |
2019年 | 745篇 |
2018年 | 1347篇 |
2017年 | 1307篇 |
2016年 | 1360篇 |
2015年 | 1048篇 |
2014年 | 1229篇 |
2013年 | 2623篇 |
2012年 | 1945篇 |
2011年 | 1741篇 |
2010年 | 1460篇 |
2009年 | 1308篇 |
2008年 | 1280篇 |
2007年 | 1194篇 |
2006年 | 812篇 |
2005年 | 704篇 |
2004年 | 654篇 |
2003年 | 588篇 |
2002年 | 578篇 |
2001年 | 418篇 |
2000年 | 394篇 |
1999年 | 441篇 |
1998年 | 2368篇 |
1997年 | 1617篇 |
1996年 | 1025篇 |
1995年 | 618篇 |
1994年 | 474篇 |
1993年 | 565篇 |
1992年 | 209篇 |
1991年 | 209篇 |
1990年 | 155篇 |
1989年 | 156篇 |
1988年 | 162篇 |
1987年 | 140篇 |
1986年 | 120篇 |
1985年 | 143篇 |
1984年 | 129篇 |
1983年 | 98篇 |
1982年 | 129篇 |
1981年 | 147篇 |
1980年 | 157篇 |
1979年 | 79篇 |
1978年 | 81篇 |
1977年 | 278篇 |
1976年 | 621篇 |
1973年 | 65篇 |
排序方式: 共有10000条查询结果,搜索用时 21 毫秒
871.
To allow efficient and user‐friendly development of a component‐based application, component systems have to provide a rather complex development infrastructure, including a tool for component composition, component repository, and a run‐time infrastructure. In this paper, we present and evaluate benefits of using meta‐modeling during the process of defining a component system and also during creation of the development and run‐time infrastructures. Most of the presented arguments are based on a broad practical experience with designing the component systems SOFA and SOFA 2; the former designed in a classical ad hoc ‘manual’ way, whereas the latter with the help of meta‐modeling. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
872.
Khaled Elbassioni Erik Krohn Domagoj Matijević Julián Mestre Domagoj Ševerdija 《Algorithmica》2011,60(2):451-463
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point
of the terrain is seen by at least one guard. This improves on the previous best approximation factor of 5 (see King in Proceedings
of the 13th Latin American Symposium on Theoretical Informatics, pp. 629–640, 2006). Unlike most of the previous techniques, our method is based on rounding the linear programming relaxation of the corresponding
covering problem. Besides the simplicity of the analysis, which mainly relies on decomposing the constraint matrix of the
LP into totally balanced matrices, our algorithm, unlike previous work, generalizes to the weighted and partial versions of
the basic problem. 相似文献
873.
Abstract: Many real‐world visual tracking applications have a high dimensionality, i.e. the system state is defined by a large number of variables. This kind of problem can be modelled as a dynamic optimization problem, which involves dynamic variables whose values change in time. Most applied research on optimization methods have focused on static optimization problems but these static methods often lack explicit adaptive methodologies. Heuristics are specific methods for solving problems in the absence of an algorithm for formal proof. Metaheuristics are approximate optimization methods which have been applied to more general problems with significant success. However, particle filters are Monte Carlo algorithms which solve the sequential estimation problem by approximating the theoretical distributions in the state space by simulated random measures called particles. However, particle filters lack efficient search strategies. In this paper, we propose a general framework to hybridize heuristics/metaheuristics with particle filters properly. The aim of this framework is to devise effective hybrid visual tracking algorithms naturally, guided by the use of abstraction techniques. Resulting algorithms exploit the benefits of both complementary approaches. As a particular example, a memetic algorithm particle filter is derived from the proposed hybridization framework. Finally, we show the performance of the memetic algorithm particle filter when it is applied to a multiple object tracking problem. 相似文献
874.
Angel Rivas Casado Rafael Martinez‐Tomás Antonio Fernández‐Caballero 《Expert Systems》2011,28(5):488-501
This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored. 相似文献
875.
Francisco García‐Sánchez Luís Álvarez Sabucedo Rodrigo Martínez‐Béjar Luís Anido Rifón Rafael Valencia‐García Juan Miguel Gómez 《Expert Systems》2011,28(5):416-436
The increasing volume of eGovernment‐related services is demanding new approaches for service integration and interoperability in this domain. Semantic web (SW) technologies and applications can leverage the potential of eGovernment service integration and discovery, thus tackling the problems of semantic heterogeneity characterizing eGovernment information sources and the different levels of interoperability. eGovernment services will therefore be semantically described in the foreseeable future. In an environment with semantically annotated services, software agents are essential as the entities responsible for exploiting the semantic content in order to automate some tasks, and so enhance the user's experience. In this paper, we present a framework that provides a seamless integration of semantic web services and intelligent agents technologies by making use of ontologies to facilitate their interoperation. The proposed framework can assist in the development of powerful and flexible distributed systems in complex, dynamic, heterogeneous, unpredictable and open environments. Our approach is backed up by a proof‐of‐concept implementation, where the breakthrough of integrating disparate eGovernment services has been tested. 相似文献
876.
Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs with constant communication complexity we derive a characterisation in terms of a restricted type of freely rewriting restarting automaton. From this characterisation we obtain that these languages are semi-linear, and that for RPCGSs with constant communication complexity, the centralised variant has the same generative power as the non-centralised variant. 相似文献
877.
878.
Varsta Markus Heikkonen Jukka Lampinen Jouko Millán José Del R. 《Neural Processing Letters》2001,13(3):237-251
This paper compares two Self-Organizing Map (SOM) based models for temporal sequence processing (TSP) both analytically and experimentally. These models, Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM), incorporate leaky integrator memory to preserve the temporal context of the input signals. The learning and the convergence properties of the TKM and RSOM are studied and we show analytically that the RSOM is a significant improvement over the TKM, because the RSOM allows simple derivation of a consistent learning rule. The results of the analysis are demonstrated with experiments. 相似文献
879.
Nikolaj S. Bjørner Anca Browne Michael A. Colón Bernd Finkbeiner Zohar Manna Henny B. Sipma Tomás E. Uribe 《Formal Methods in System Design》2000,16(3):227-270
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions of the Bakery Mutual exclusion algorithm for mutual exclusion. We verify the classic two-process algorithm and simple variants, as well as an atomic parameterized version. The methods used include deductive verification rules, verification diagrams, automatic invariant generation, and finite-state model checking and abstraction. 相似文献
880.
Juan Francisco Gómez-Lopera José Martínez-Aroza Aureliano M. Robles-Pérez Ramón Román-Roldán 《Journal of Mathematical Imaging and Vision》2000,13(1):35-56
This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images. 相似文献