全文获取类型
收费全文 | 38240篇 |
免费 | 4207篇 |
国内免费 | 2789篇 |
专业分类
电工技术 | 2751篇 |
技术理论 | 8篇 |
综合类 | 5678篇 |
化学工业 | 2900篇 |
金属工艺 | 1202篇 |
机械仪表 | 2496篇 |
建筑科学 | 3606篇 |
矿业工程 | 1423篇 |
能源动力 | 1339篇 |
轻工业 | 632篇 |
水利工程 | 1155篇 |
石油天然气 | 958篇 |
武器工业 | 653篇 |
无线电 | 3594篇 |
一般工业技术 | 4456篇 |
冶金工业 | 2270篇 |
原子能技术 | 337篇 |
自动化技术 | 9778篇 |
出版年
2024年 | 156篇 |
2023年 | 612篇 |
2022年 | 820篇 |
2021年 | 1034篇 |
2020年 | 1195篇 |
2019年 | 1092篇 |
2018年 | 1156篇 |
2017年 | 1306篇 |
2016年 | 1410篇 |
2015年 | 1464篇 |
2014年 | 2244篇 |
2013年 | 2684篇 |
2012年 | 2504篇 |
2011年 | 2817篇 |
2010年 | 2267篇 |
2009年 | 2336篇 |
2008年 | 2377篇 |
2007年 | 2564篇 |
2006年 | 2367篇 |
2005年 | 2030篇 |
2004年 | 1653篇 |
2003年 | 1362篇 |
2002年 | 1179篇 |
2001年 | 955篇 |
2000年 | 821篇 |
1999年 | 708篇 |
1998年 | 552篇 |
1997年 | 486篇 |
1996年 | 408篇 |
1995年 | 391篇 |
1994年 | 325篇 |
1993年 | 277篇 |
1992年 | 260篇 |
1991年 | 184篇 |
1990年 | 150篇 |
1989年 | 172篇 |
1988年 | 129篇 |
1987年 | 66篇 |
1986年 | 92篇 |
1985年 | 67篇 |
1984年 | 67篇 |
1983年 | 47篇 |
1982年 | 53篇 |
1981年 | 41篇 |
1980年 | 31篇 |
1979年 | 31篇 |
1978年 | 29篇 |
1977年 | 27篇 |
1964年 | 26篇 |
1955年 | 35篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
In this paper, we consider Kalman filtering over a packet-delaying network. Given the probability distribution of the delay, we can characterize the filter performance via a probabilistic approach. We assume that the estimator maintains a buffer of length D so that at each time k, the estimator is able to retrieve all available data packets up to time k−D+1. Both the cases of sensor with and without necessary computation capability for filter updates are considered. When the sensor has no computation capability, for a given D, we give lower and upper bounds on the probability for which the estimation error covariance is within a prescribed bound. When the sensor has computation capability, we show that the previously derived lower and upper bounds are equal to each other. An approach for determining the minimum buffer length for a required performance in probability is given and an evaluation on the number of expected filter updates is provided. Examples are provided to demonstrate the theory developed in the paper. 相似文献
992.
993.
Triangle algebras are equationally defined structures that are equivalent with certain residuated lattices on a set of intervals, which are called interval-valued residuated lattices (IVRLs). Triangle algebras have been used to construct triangle logic (TL), a formal fuzzy logic that is sound and complete w.r.t. the class of IVRLs.In this paper, we prove that the so-called pseudo-prelinear triangle algebras are subdirect products of pseudo-linear triangle algebras. This can be compared with MTL-algebras (prelinear residuated lattices) being subdirect products of linear residuated lattices.As a consequence, we are able to prove the pseudo-chain completeness of pseudo-linear triangle logic (PTL), an axiomatic extension of TL introduced in this paper. This kind of completeness is the analogue of the chain completeness of monoidal T-norm based logic (MTL).This result also provides a better insight in the structure of triangle algebras; it enables us, amongst others, to prove properties of pseudo-prelinear triangle algebras more easily. It is known that there is a one-to-one correspondence between triangle algebras and couples (L,α), in which L is a residuated lattice and α an element in that residuated lattice. We give a schematic overview of some properties of pseudo-prelinear triangle algebras (and a number of others that can be imposed on a triangle algebra), and the according necessary and sufficient conditions on L and α. 相似文献
994.
995.
Geometrically non-linear behavior of structural systems with random material property: An asymptotic spectral stochastic approach 总被引:1,自引:0,他引:1
M. Tootkaboni L. Graham-Brady B.W. Schafer 《Computer Methods in Applied Mechanics and Engineering》2009,198(37-40):3173-3185
An asymptotic spectral stochastic approach is presented for computing the statistics of the equilibrium path in the post-bifurcation regime for structural systems with random material properties. The approach combines numerical implementation of Koiter’s asymptotic theory with a stochastic Galerkin scheme and collocation in stochastic space to quantify uncertainties in the parametric representation of the load–displacement relationship, specifically in the form of uncertain post-buckling slope, post-buckling curvature, and a family of stochastic displacement fields. Using the proposed method, post-buckling response statistics for two plane frames are obtained and shown to be in close agreement with those obtained from Monte Carlo simulation, provided a fine enough spectral representation is used to model the variability in the random dimension. 相似文献
996.
Vipul Mathur Author Vitae Varsha Apte Author Vitae 《Journal of Systems and Software》2009,82(1):39-55
A Web server, when overloaded, shows a severe degradation of goodput initially, with the eventual settling of goodput as load increases further. Traditional performance models have failed to capture this behavior. In this paper, we propose an analytical model, which is a two-stage and layered queuing model of the Web server, which is able to reproduce this behavior. We do this by explicitly modelling the overhead processing, the user abandonment and retry behavior, and the contention for resources, for the FIFO and LIFO queuing disciplines. We show that LIFO provides better goodput in most overload situations. We compare our model predictions with experimental results from a test bed and find that our results match well with measurements. 相似文献
997.
Partial 3D Shape Retrieval by Reeb Pattern Unfolding 总被引:2,自引:0,他引:2
This paper presents a novel approach for fast and efficient partial shape retrieval on a collection of 3D shapes. Each shape is represented by a Reeb graph associated with geometrical signatures. Partial similarity between two shapes is evaluated by computing a variant of their maximum common sub-graph.
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献
998.
Anna Wong Nadine Marcus Paul Ayres Lee Smith Graham A. Cooper Fred Paas John Sweller 《Computers in human behavior》2009
Based on the assumption of a working memory processor devoted to human movement, cognitive load theory is used to explore some conditions under which animated instructions are hypothesised to be more effective for learning than equivalent static graphics. Using paper-folding tasks dealing with human movement, results from three experiments confirmed our hypothesis, indicating a superiority of animation over static graphics. These results are discussed in terms of a working memory processor that may be facilitated by our mirror-neuron system and may explain why animated instructional animations are superior to static graphics for cognitively based tasks that involve human movement. 相似文献
999.
We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred). 相似文献
1000.
This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which
either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical
analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions. 相似文献