全文获取类型
收费全文 | 5136篇 |
免费 | 140篇 |
国内免费 | 63篇 |
专业分类
电工技术 | 166篇 |
综合类 | 286篇 |
化学工业 | 839篇 |
金属工艺 | 68篇 |
机械仪表 | 85篇 |
建筑科学 | 1298篇 |
矿业工程 | 314篇 |
能源动力 | 188篇 |
轻工业 | 168篇 |
水利工程 | 56篇 |
石油天然气 | 38篇 |
武器工业 | 7篇 |
无线电 | 437篇 |
一般工业技术 | 241篇 |
冶金工业 | 239篇 |
原子能技术 | 14篇 |
自动化技术 | 895篇 |
出版年
2024年 | 2篇 |
2023年 | 32篇 |
2022年 | 36篇 |
2021年 | 44篇 |
2020年 | 64篇 |
2019年 | 79篇 |
2018年 | 59篇 |
2017年 | 68篇 |
2016年 | 120篇 |
2015年 | 136篇 |
2014年 | 239篇 |
2013年 | 224篇 |
2012年 | 305篇 |
2011年 | 424篇 |
2010年 | 253篇 |
2009年 | 545篇 |
2008年 | 642篇 |
2007年 | 422篇 |
2006年 | 469篇 |
2005年 | 330篇 |
2004年 | 166篇 |
2003年 | 147篇 |
2002年 | 92篇 |
2001年 | 88篇 |
2000年 | 62篇 |
1999年 | 61篇 |
1998年 | 37篇 |
1997年 | 47篇 |
1996年 | 26篇 |
1995年 | 24篇 |
1994年 | 15篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1964年 | 2篇 |
排序方式: 共有5339条查询结果,搜索用时 46 毫秒
91.
Maruti Mudunuru 《先进材料力学与结构力学》2017,24(7):556-590
This article concerns mesh restrictions that are needed to satisfy several important mathematical properties—maximum principles, comparison principles, and the nonnegative constraint—for a general linear second-order elliptic partial differential equation. We critically review some recent developments in the field of discrete maximum principles, derive new results, and discuss some possible future research directions in this area. In particular, we derive restrictions for a three-node triangular (T3) element and a four-node quadrilateral (Q4) element to satisfy comparison principles, maximum principles, and the nonnegative constraint under the standard single-field Galerkin formulation. Analysis is restricted to uniformly elliptic linear differential operators in divergence form with Dirichlet boundary conditions specified on the entire boundary of the domain. Various versions of maximum principles and comparison principles are discussed in both continuous and discrete settings. In the literature, it is well-known that an acute-angled triangle is sufficient to satisfy the discrete weak maximum principle for pure isotropic diffusion. Herein, we show that this condition can be either too restrictive or not sufficient to satisfy various discrete principles when one considers anisotropic diffusivity, advection velocity field, or linear reaction coefficient. Subsequently, we derive appropriate restrictions on the mesh for simplicial (e.g., T3 element) and nonsimplicial (e.g., Q4 element) elements. Based on these conditions, an iterative algorithm is developed to construct simplicial meshes that preserve discrete maximum principles using existing open source mesh generators. Various numerical examples based on different types of triangulations are presented to show the pros and cons of placing restrictions on a computational mesh. We also quantify local and global mass conservation errors using representative numerical examples and illustrate the performance of metric. 相似文献
92.
93.
94.
Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter “number of added/deleted voters”. 相似文献
95.
In this paper we prove that, under suitable conditions, Atanassov’s Kα operators, which act on intervals, provide the same numerical results as OWA operators of dimension two. On one hand, this allows us to recover OWA operators from Kα operators. On the other hand, by analyzing the properties of Atanassov’s operators, we can generalize them. In this way, we introduce a class of aggregation functions - the generalized Atanassov operators - that, in particular, include two-dimensional OWA operators. We investigate under which conditions these generalized Atanassov operators satisfy some properties usually required for aggregation functions, such as bisymmetry, strictness, monotonicity, etc. We also show that if we apply these aggregation functions to interval-valued fuzzy sets, we obtain an ordered family of fuzzy sets. 相似文献
96.
Djamel Bouchaffra Author Vitae 《Pattern recognition》2010,43(7):2590-2607
Current extensions of hidden Markov models such as structural, hierarchical, coupled, and others have the power to classify complex and highly organized patterns. However, one of their major limitations is the inability to cope with topology: When applied to a visible observation (VO) sequence, the traditional HMM-based techniques have difficulty predicting the n-dimensional shape formed by the symbols of the VO sequence. To fulfill this need, we propose a novel paradigm named “topological hidden Markov models” (THMMs) that classifies VO sequences by embedding the nodes of an HMM state transition graph in a Euclidean space. This is achieved by modeling the noise embedded in the shape generated by the VO sequence. We cover the first and second level topological HMMs. We describe five basic problems that are assigned to a second level topological hidden Markov model: (1) sequence probability evaluation, (2) statistical decoding, (3) structural decoding, (4) topological decoding, and (5) learning. To show the significance of this research, we have applied the concept of THMMs to: (i) predict the ASCII class assigned to a handwritten numeral, and (ii) map protein primary structures to their 3D folds. The results show that the second level THMMs outperform the SHMMs and the multi-class SVM classifiers significantly. 相似文献
97.
T. Hoang Ngan Le Chia-Chen Lin Chin-Chen Chang Hoai Bac LeAuthor vitae 《Digital Signal Processing》2011,21(6):734-745
Many secret sharing schemes for digital images have been developed in recent decades. Traditional schemes typically must deal with the problem of computational complexity, and other visual secret sharing schemes come with a higher transmission cost and storage cost; that is, each shadow size is m times as big as the original secret image. The new (2,n) secret sharing scheme for grayscale images proposed in this paper is based a combination of acceptable image quality using block truncation coding (BTC), high compression ratio discrete wavelet transform (DWT) and good subjective performance of the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high quality reconstructed original image but also generates small, random-like grayscale shadows. 相似文献
98.
Takeshi Emura 《Computational statistics & data analysis》2010,54(12):3033-3043
A goodness-of-fit testing procedure for Archimedean copula (AC) models is developed based on right-censored data. The proposed approach extends an existing method, which is suitable for the Clayton model, to general AC models. Asymptotic properties of the proposed test statistics under the true model assumption are derived. Simulation analysis shows that the proposed test has reasonable performance. Finally, two real data examples are analyzed for illustrative purposes. 相似文献
99.
Marco Riani 《Computational statistics & data analysis》2010,54(12):3300-3312
The forward search provides data-driven flexible trimming of a Cp statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the Cp statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice. 相似文献
100.
基于秘密共享模数的一般性多方求逆协议 总被引:2,自引:0,他引:2
Catalano、Gennaro和Halevi提出了一个实用的基于秘密共享模数的分布式求逆协议,然而他们仅仅考虑了门限敌手结构的情况.文中考虑了一般敌手结构的情况,针对半诚实敌手和恶意敌手,利用Damgard和Thorbek提出的线性整数秘密共享方案,分别构造了一个多方模求逆协议.该协议在敌手结构是Q2(对应Q3以及强RSA假设)的条件下针对半诚实(对应恶意)敌手是安全的.该协议是Catalano等人方案的一个推广,可以用来分布式地计算RSA私钥以及构造标准模型下安全的分布式Gennaro-Halevi-Rabin、Cramer-Shoup和Mames-Joye签名方案.另外,文中的构造方法也是对环上的安全多方协议构造方法的一个有力补充. 相似文献