全文获取类型
收费全文 | 2293篇 |
免费 | 103篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 23篇 |
综合类 | 3篇 |
化学工业 | 588篇 |
金属工艺 | 33篇 |
机械仪表 | 47篇 |
建筑科学 | 80篇 |
矿业工程 | 5篇 |
能源动力 | 95篇 |
轻工业 | 251篇 |
水利工程 | 37篇 |
石油天然气 | 10篇 |
无线电 | 173篇 |
一般工业技术 | 327篇 |
冶金工业 | 234篇 |
原子能技术 | 14篇 |
自动化技术 | 484篇 |
出版年
2024年 | 5篇 |
2023年 | 33篇 |
2022年 | 93篇 |
2021年 | 116篇 |
2020年 | 78篇 |
2019年 | 66篇 |
2018年 | 69篇 |
2017年 | 75篇 |
2016年 | 79篇 |
2015年 | 79篇 |
2014年 | 67篇 |
2013年 | 153篇 |
2012年 | 156篇 |
2011年 | 158篇 |
2010年 | 107篇 |
2009年 | 113篇 |
2008年 | 99篇 |
2007年 | 101篇 |
2006年 | 94篇 |
2005年 | 77篇 |
2004年 | 65篇 |
2003年 | 43篇 |
2002年 | 52篇 |
2001年 | 28篇 |
2000年 | 16篇 |
1999年 | 27篇 |
1998年 | 57篇 |
1997年 | 39篇 |
1996年 | 23篇 |
1995年 | 18篇 |
1994年 | 16篇 |
1993年 | 18篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 18篇 |
1988年 | 8篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 4篇 |
1981年 | 7篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1976年 | 9篇 |
1975年 | 4篇 |
1974年 | 7篇 |
1972年 | 4篇 |
排序方式: 共有2404条查询结果,搜索用时 15 毫秒
31.
32.
33.
34.
Sparse Modeling of Textures 总被引:3,自引:0,他引:3
Gabriel Peyré 《Journal of Mathematical Imaging and Vision》2009,34(1):17-31
35.
Juan Gabriel Brida David Matesanz Gómez Wiston Adrián Risso 《Expert systems with applications》2009,36(4):7721-7728
In this paper we introduce a new method to describe dynamical patterns of the real exchange rate co-movements time series and to analyze contagion in currency crisis. The method combines the tools of symbolic time series analysis with the nearest neighbor single linkage clustering algorithm. Data symbolization allows us obtaining a metric distance between two different time series that is used to construct an ultrametric distance. By analyzing the data of various countries, we derive a hierarchical organization, constructing minimal-spanning and hierarchical trees. From these trees we detect different clusters of countries according to their proximity. We show that this methodology permits us to construct a structural and dynamic topology that is useful to study interdependence and contagion effects among financial time series. 相似文献
36.
Flavio J. Reyes-Díaz Gabriel Hernández-Sierra José R. Calvo de Lara 《International Journal of Speech Technology》2017,20(3):475-485
The performance of state-of-the-art speaker verification in uncontrolled environment is affected by different variabilities. Short duration variability is very common in these scenarios and causes the speaker verification performance to decrease quickly while the duration of verification utterances decreases. Linear discriminant analysis (LDA) is the most common session variability compensation algorithm, nevertheless it presents some shortcomings when trained with insufficient data. In this paper we introduce two methods for session variability compensation to deal with short-length utterances on i-vector space. The first method proposes to incorporate the short duration variability information in the within-class variance estimation process. The second proposes to compensate the session and short duration variabilities in two different spaces with LDA algorithms (2S-LDA). First, we analyzed the behavior of the within and between class scatters in the first proposed method. Then, both proposed methods are evaluated on telephone session from NIST SRE-08 for different duration of the evaluation utterances: full (average 2.5 min), 20, 15, 10 and 5 s. The 2S-LDA method obtains good results on different short-length utterances conditions in the evaluations, with a EER relative average improvement of 1.58%, compared to the best baseline (WCCN[LDA]). Finally, we applied the 2S-LDA method in speaker verification under reverberant environment, using different reverberant conditions from Reverb challenge 2013, obtaining an improvement of 8.96 and 23% under matched and mismatched reverberant conditions, respectively. 相似文献
37.
In this paper, we investigate control strategies for a scalar, one-step delay system in discrete-time, i.e., the state of the system is the input delayed by one time unit. In contrast with classical approaches, here the control action must be a memoryless function of the output of the plant, which comprises the current state corrupted by measurement noise. We adopt a first order state-space representation for the delay system, where the initial state is a Gaussian random variable. In addition, we assume that the measurement noise is drawn from a white and Gaussian process with zero mean and constant variance. Performance evaluation is carried out via a finite-time quadratic cost that combines the second moment of the control signal, and the second moment of the difference between the initial state and the state at the final time. We show that if the time-horizon is one or two then the optimal control is a linear function of the plant’s output, while for a sufficiently large horizon a control taking on only two values will outperform the optimal affine solution. This paper complements the well-known counterexample by Hans Witsenhausen, which showed that the solution to a linear, quadratic and Gaussian optimal control paradigm might be nonlinear. Witsenhausen’s counterexample considered an optimization horizon with two time-steps (two stage control). In contrast with Witsenhausen’s work, the solution to our counterexample is linear for one and two stages but it becomes nonlinear as the number of stages is increased. The fact that our paradigm leads to nonlinear solutions, in the multi-stage case, could not be predicted from prior results. In contrast to prior work, the validity of our counterexample is based on analytical proof methods. Our proof technique rests on a simple nonlinear strategy that is useful in its own right, since it outperforms any affine solution. 相似文献
38.
Transforming smoothers are known as a successful approach to the multigrid treatment of saddlepoint problems resulting from variational problems. In this paper we analyze similar multigrid methods in the context of the practically important class of optimization problems with partial differential equation constraint, which lead to a different kind of saddle point problems. We prove level independent convergence properties for the resulting multigrid methods and demonstrate this also in numerical investigations for a relevant model problem. 相似文献
39.
Roman Krepki Benjamin Blankertz Gabriel Curio Klaus-Robert Müller 《Multimedia Tools and Applications》2007,33(1):73-90
The investigation of innovative Human-Computer Interfaces (HCI) provides a challenge for future multimedia research and development.
Brain-Computer Interfaces (BCI) exploit the ability of human communication and control bypassing the classical neuromuscular
communication channels. In general, BCIs offer a possibility of communication for people with severe neuromuscular disorders,
such as Amyotrophic Lateral Sclerosis (ALS) or spinal cord injury. Beyond medical applications, a BCI conjunction with exciting
multimedia applications, e.g., a dexterity game, could define a new level of control possibilities also for healthy customers
decoding information directly from the user’s brain, as reflected in electroencephalographic (EEG) signals which are recorded
non-invasively from user’s scalp. This contribution introduces the Berlin Brain–Computer Interface (BBCI) and presents setups
where the user is provided with intuitive control strategies in plausible gaming applications that use biofeedback. Yet at
its beginning, BBCI thus adds a new dimension in multimedia research by offering the user an additional and independent communication
channel based on brain activity only. First successful experiments already yielded inspiring proofs-of-concept. A diversity
of multimedia application models, say computer games, and their specific intuitive control strategies, as well as various
Virtual Reality (VR) scenarios are now open for BCI research aiming at a further speed up of user adaptation and increase
of learning success and transfer bit rates.
相似文献
Klaus-Robert MüllerEmail: |
40.
Starting from the idea of determinism in membrane systems, we introduce a language generating device consisting of morphisms
placed in the nodes of a tree. Initial strings are given in the leaves; by iteratively applying the morphisms to them, we
produce new strings, which are collected in the root of the tree. Such a device is called a tree-system of morphisms (in short, a T system). We investigate here the power of T systems, both in the extended (a terminal alphabet is considered
and only strings over it are accepted) and non-extended case, mainly in comparison with classes of languages in Lindenmayer
hierarchy.
Received: 8 February 2001 / 18 September 2001 相似文献