全文获取类型
收费全文 | 3717篇 |
免费 | 467篇 |
国内免费 | 349篇 |
专业分类
电工技术 | 135篇 |
综合类 | 354篇 |
化学工业 | 419篇 |
金属工艺 | 182篇 |
机械仪表 | 135篇 |
建筑科学 | 113篇 |
矿业工程 | 23篇 |
能源动力 | 17篇 |
轻工业 | 146篇 |
水利工程 | 18篇 |
石油天然气 | 14篇 |
武器工业 | 20篇 |
无线电 | 753篇 |
一般工业技术 | 473篇 |
冶金工业 | 53篇 |
原子能技术 | 11篇 |
自动化技术 | 1667篇 |
出版年
2024年 | 9篇 |
2023年 | 58篇 |
2022年 | 148篇 |
2021年 | 158篇 |
2020年 | 124篇 |
2019年 | 125篇 |
2018年 | 103篇 |
2017年 | 116篇 |
2016年 | 147篇 |
2015年 | 154篇 |
2014年 | 205篇 |
2013年 | 249篇 |
2012年 | 275篇 |
2011年 | 271篇 |
2010年 | 191篇 |
2009年 | 237篇 |
2008年 | 258篇 |
2007年 | 247篇 |
2006年 | 240篇 |
2005年 | 203篇 |
2004年 | 144篇 |
2003年 | 142篇 |
2002年 | 127篇 |
2001年 | 116篇 |
2000年 | 89篇 |
1999年 | 54篇 |
1998年 | 55篇 |
1997年 | 44篇 |
1996年 | 36篇 |
1995年 | 39篇 |
1994年 | 26篇 |
1993年 | 19篇 |
1992年 | 16篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 12篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1974年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有4533条查询结果,搜索用时 9 毫秒
81.
In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme, based on one-dimensional cellular automata where the number of secrets is not restricted by n or t. We show that our scheme can be used to solve an open problem proposed recently in Alvarez et al. (2008) [G. Alvarez, L. Hernández Encinas, A. Martín del Rey, A multisecret sharing scheme for color images based on cellular automata, Information Sciences 178 (2008) 4382-4395]. 相似文献
82.
Tony Tan 《Journal of Computer and System Sciences》2010,76(8):778-791
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is still decidable. It is also robust: alternating, non-deterministic and deterministic top view weak PA have the same recognition power; and are strong enough to accept all data languages expressible in Linear Temporal Logic with the future-time operators, augmented with one register freeze quantifier. 相似文献
83.
Z. Eslami Author Vitae S.H. Razzaghi Author Vitae Author Vitae 《Pattern recognition》2010,43(1):397-91
Recently Lin and Tsai [Secret image sharing with steganography and authentication, The Journal of Systems and Software 73 (2004) 405-414] and Yang et al. [Improvements of image sharing with steganography and authentication, The Journal of Systems and Software 80 (2007) 1070-1076] proposed secret image sharing schemes combining steganography and authentication based on Shamir's polynomials. The schemes divide a secret image into some shadows which are then embedded in cover images in order to produce stego images for distributing among participants. To achieve better authentication ability Chang et al. [Sharing secrets in stego images with authentication, Pattern Recognition 41 (2008) 3130-3137] proposed in 2008 an improved scheme which enhances the visual quality of the stego images as well and the probability of successful verification for a fake stego block is 1/16.In this paper, we employ linear cellular automata, digital signatures, and hash functions to propose a novel (t,n)-threshold image sharing scheme with steganographic properties in which a double authentication mechanism is introduced which can detect tampering with probability 255/256. Employing cellular automata instead of Shamir's polynomials not only improves computational complexity from to O(n) but obviates the need to modify pixels of cover images unnecessarily. Compared to previous methods [C. Lin, W. Tsai, Secret image sharing with steganography and authentication, The Journal of Systems and Software 73 (2004) 405-414; C. Yang, T. Chen, K. Yu, C. Wang, Improvements of image sharing with steganography and authentication, The Journal of Systems and Software 80 (2007) 1070-1076; C. Chang, Y. Hsieh, C. Lin, Sharing secrets in stego images with authentication, Pattern Recognition 41 (2008) 3130-3137], we use fewer number of bits in each pixel of cover images for embedding data so that a better visual quality is guaranteed. We further present some experimental results. 相似文献
84.
给出基于量子逻辑的下推自动机(e-VPDA)的概念,提出广义的子集构造方法,进而证明了一般的e-VPDA与状态转移为分明函数且具有量子终态的e-VPDA的等价性.利用此等价性,给出了量子上下文无关语言的代数刻画与层次刻画,并籍此证明了量子上下文无关语言关于正则运算的封闭性.最后,说明了量子下推自动机和量子上下文无关文法(e-VCFG)的等价性. 相似文献
85.
Dario Campagna 《Theoretical computer science》2010,411(20):2037-2051
Hybrid automata are a powerful formalism for the representation of systems evolving according to both discrete and continuous laws. Unfortunately, undecidability soon emerges when one tries to automatically verify hybrid automata properties. An important verification problem is the reachability one that demands to decide whether a set of points is reachable from a starting region.If we focus on semi-algebraic hybrid automata the reachability problem is semi-decidable. However, high computational costs have to be afforded to solve it. We analyse this problem by exploiting some existing tools and we show that even simple examples cannot be efficiently solved. It is necessary to introduce approximations to reduce the number of variables, since this is the main source of runtime requirements. We propose some standard approximation methods based on Taylor polynomials and ad hoc strategies. We implement our methods within the software SAHA-Tool and we show their effectiveness on two biological examples: the Repressilator and the Delta-Notch protein signaling. 相似文献
86.
We provide Stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra based on CCP, with a semantics in terms of hybrid automata. We associate with each sCCP program both a stochastic and a non-deterministic hybrid automaton. Then, we compare such automata with the standard stochastic semantics (given by a Continuous Time Markov Chain) and the one based on ordinary differential equations, obtained by a fluid-flow approximation technique. We discuss in detail two case studies: Repressilator and the Circadian Clock, with particular regard to the robustness exhibited by the different semantic models and to the effect of discreteness in dynamical evolution of such systems. 相似文献
87.
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process. 相似文献
88.
89.
I.G. GeorgoudasG.Ch. Sirakoulis E.M. ScordilisI. Andreadis 《Advances in Engineering Software》2011,42(9):623-633
A two-dimensional (2-D) cellular automata (CA) dynamic system constituted of cells-charges has been proposed for the simulation of the earthquake process. In this paper, the study is focused on the optimal parameterisation of the model introducing the use of genetic algorithm (GA). The optimisation of the CA model parameterisation, by applying a standard GA, extends its ability to study various hypotheses concerning the seismicity of the region under consideration. The GA evolves an initially random population of candidate solutions of model parameters, such that in time appropriate solutions to emerge. The quality criterion is realised by taking into account the extent that the simulation results match the Gutenberg-Richter (GR) law derived from recorded data of the area under test. The simulation results presented here regard regions of Greece with different seismic and geophysical characteristics. The results found are in good quantitative and qualitative agreement with the GR scaling relations. 相似文献
90.