全文获取类型
收费全文 | 4640篇 |
免费 | 281篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 59篇 |
综合类 | 5篇 |
化学工业 | 1154篇 |
金属工艺 | 80篇 |
机械仪表 | 171篇 |
建筑科学 | 220篇 |
矿业工程 | 21篇 |
能源动力 | 182篇 |
轻工业 | 832篇 |
水利工程 | 40篇 |
石油天然气 | 25篇 |
无线电 | 280篇 |
一般工业技术 | 662篇 |
冶金工业 | 334篇 |
原子能技术 | 39篇 |
自动化技术 | 827篇 |
出版年
2024年 | 7篇 |
2023年 | 49篇 |
2022年 | 137篇 |
2021年 | 182篇 |
2020年 | 141篇 |
2019年 | 159篇 |
2018年 | 186篇 |
2017年 | 177篇 |
2016年 | 204篇 |
2015年 | 151篇 |
2014年 | 206篇 |
2013年 | 370篇 |
2012年 | 297篇 |
2011年 | 337篇 |
2010年 | 265篇 |
2009年 | 279篇 |
2008年 | 211篇 |
2007年 | 192篇 |
2006年 | 173篇 |
2005年 | 149篇 |
2004年 | 131篇 |
2003年 | 95篇 |
2002年 | 95篇 |
2001年 | 61篇 |
2000年 | 56篇 |
1999年 | 48篇 |
1998年 | 109篇 |
1997年 | 68篇 |
1996年 | 59篇 |
1995年 | 46篇 |
1994年 | 27篇 |
1993年 | 36篇 |
1992年 | 30篇 |
1991年 | 22篇 |
1990年 | 17篇 |
1989年 | 18篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 16篇 |
1985年 | 15篇 |
1984年 | 10篇 |
1983年 | 13篇 |
1982年 | 11篇 |
1981年 | 14篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1973年 | 2篇 |
排序方式: 共有4931条查询结果,搜索用时 15 毫秒
71.
An extension of the Cauer ladder development for synthesizing singly terminated filters with symmetric and asymmetric responses is presented. Basically, a driving‐point immittance including reactive constant elements is carried out in such a way that provides the transmission zeros. The reactive constant elements are introduced into the synthesis for two reasons. The first is to consider the possibility of the asymmetric position of transmission zeros in the real frequency axis. The second one is to obtain canonical forms, i.e. networks with the minimum number of elements in the case of symmetrical responses. To validate the proposed method, a filter with asymmetrical response has been synthesized, comparing different topologies for its use in multiplexers. This fact is illustrated with a Ku‐band elliptic response diplexer designed in H‐plane rectangular waveguide. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009. 相似文献
72.
In this paper we study the unconfined potential steady flow through a porous media with semipermeable bottom. We propose a
model that leads to a free boundary-value-problem with complementarities conditions on the bottom. The shape of a part of
the domain boundary, called free boundary, is one of the unknown of the problem. The pressure of the flow as well as the flow
velocity on the another part of the boundary, that is a one way permeable bottom, are also unknowns and satisfy a complementarity
condition. We present the numerical implementation of the model based on an optimization approach. Performing a boundary-element
discretization we get a nonlinear mathematical programming problem with complementarities conditions. To solve it we use Herskovits’s
interior point algorithm. Numerical examples are presented. 相似文献
73.
Many time-critical applications require predictable performance in the presence of failures. This paper considers a distributed system with independent periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptively scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task can start. Efficient scheduling algorithms are proposed which yield sub-optimal schedules when there is provision for fault-tolerance. The performance of the solutions proposed is evaluated in terms of the number of processors and the cost of the checkpoints needed. Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms.This work has been supported by grants from the Italian Ministero dell'Università e della Ricerca Scientifica e Tecnologica and the Consiglio Nazionale delle Ricerche-Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo. 相似文献
74.
Ortega-Cabezas Pedro Miguel Colmenar-Santos Antonio Borge-Diez David Blanes-Peiró Jorge Juan Higuera-Pérez Jorge Alcaide Eric 《Software Quality Journal》2022,30(3):687-728
Software Quality Journal - The number of electronic control units (ECU) installed in vehicles is increasingly high. Manufacturers must improve the software quality and reduce cost by proposing... 相似文献
75.
Andrielli Morais de Oliveira Flávio de Andrade Silva Eduardo de Moraes Rego Fairbairn Romildo Dias Toledo Filho 《Materials and Structures》2018,51(3):65
This paper reports the experimental findings on the tensile behavior of strain-hardening cement-based composites (SHCC). The composites were subjected to the combined effects of elevated temperatures and internal moisture condition. Uniaxial tensile tests on dumbbell-shaped SHCC specimens with in situ temperature control were performed at 22, 60 and 100 °C. In addition, the effect of the internal humidity of SHCC (95, 50, 20 and 0%) coupled to the elevated temperatures was investigated. It was shown that the tensile strength decreases and the strain capacity increases with an increase in temperature. The influence of the internal moisture conditions was more significant in high temperatures. The strain capacity reduced significantly with a decrease in the humidity level. The crack pattern of the SHCC specimens was determined. Furthermore, single fiber pullout tests were performed under the considered high temperatures condition. Finally, the results are discussed based on the thermogravimetry analysis of the PVA fiber, alterations on its microstructure and surface coating. 相似文献
76.
This paper presents a syntactic approach based on Adjacency Grammars (AG) for sketch diagram modeling and understanding. Diagrams are a combination of graphical symbols arranged according to a set of spatial rules defined by a visual language. AG describe visual shapes by productions defined in terms of terminal and non-terminal symbols (graphical primitives and subshapes), and a set functions describing the spatial arrangements between symbols. Our approach to sketch diagram understanding provides three main contributions. First, since AG are linear grammars, there is a need to define shapes and relations inherently bidimensional using a sequential formalism. Second, our parsing approach uses an indexing structure based on a spatial tessellation. This serves to reduce the search space when finding candidates to produce a valid reduction. This allows order-free parsing of 2D visual sentences while keeping combinatorial explosion in check. Third, working with sketches requires a distortion model to cope with the natural variations of hand drawn strokes. To this end we extended the basic grammar with a distortion measure modeled on the allowable variation on spatial constraints associated with grammar productions. Finally, the paper reports on an experimental framework an interactive system for sketch analysis. User tests performed on two real scenarios show that our approach is usable in interactive settings. 相似文献
77.
This paper proposes a new approach for the segmentation of both near-end and far-end intima-media regions of the common carotid artery in ultrasound images. The method requires minimal user interaction and is able to segment the near-end wall in arteries with large, hypoechogenic and irregular plaques, issues usually not considered previously due to the increased segmentation difficulty. 相似文献
78.
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco 《Computers & Operations Research》2010,37(11):1886-1898
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP. 相似文献
79.
Cândida M. Pereira Jorge A. Ambrósio Amílcar L. Ramalho 《Multibody System Dynamics》2010,24(3):303-324
To overcome the difficulty on building manually complex models of chain drives, this work proposes a comprehensive methodology to build multibody models of any general chain drive automatically from a minimal set of data. The proposed procedure also evaluates the initial positions and velocities of all components of the drive that are consistent with the kinematic joints or with the contact pairs used in the model. In this methodology, all links and sprockets are represented by rigid bodies connected to each other either by ideal or by clearance revolute joints. The clearance revolute joint contact is further extended to handle the contact between the chain rollers and the sprocket teeth exact profiles. A suitable cylindrical continuous contact law is applied to describe the interaction on all contact pairs. One of the complexities of the computational study of roller chain drives is the large number of bodies in the system and the dynamics of the successive engagement and disengagement of the rollers with the sprockets. Each time a roller engages or disengages with a sprocket tooth, the number of rigid bodies in contact changes. The search for the contact pairs is recognized as one of the most time consuming task in contact analysis. This work proposes a procedure to specify the contact pairs and their update during the dynamic analysis optimizing the computational efficiency of the contact search. The methodologies adopted result in a general computer program that is applied and demonstrated in a generic chain drive that can be used in industrial machines, vehicle engines or any other type of mechanical system. 相似文献
80.
Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|). 相似文献