全文获取类型
收费全文 | 3832篇 |
免费 | 286篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 79篇 |
综合类 | 19篇 |
化学工业 | 995篇 |
金属工艺 | 85篇 |
机械仪表 | 63篇 |
建筑科学 | 309篇 |
矿业工程 | 18篇 |
能源动力 | 103篇 |
轻工业 | 264篇 |
水利工程 | 27篇 |
石油天然气 | 2篇 |
无线电 | 320篇 |
一般工业技术 | 805篇 |
冶金工业 | 270篇 |
原子能技术 | 14篇 |
自动化技术 | 749篇 |
出版年
2024年 | 6篇 |
2023年 | 58篇 |
2022年 | 133篇 |
2021年 | 148篇 |
2020年 | 118篇 |
2019年 | 98篇 |
2018年 | 126篇 |
2017年 | 108篇 |
2016年 | 159篇 |
2015年 | 168篇 |
2014年 | 189篇 |
2013年 | 270篇 |
2012年 | 258篇 |
2011年 | 313篇 |
2010年 | 263篇 |
2009年 | 210篇 |
2008年 | 212篇 |
2007年 | 208篇 |
2006年 | 162篇 |
2005年 | 154篇 |
2004年 | 102篇 |
2003年 | 87篇 |
2002年 | 80篇 |
2001年 | 50篇 |
2000年 | 47篇 |
1999年 | 53篇 |
1998年 | 62篇 |
1997年 | 39篇 |
1996年 | 52篇 |
1995年 | 30篇 |
1994年 | 19篇 |
1993年 | 20篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 11篇 |
1989年 | 14篇 |
1988年 | 6篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1979年 | 8篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1970年 | 3篇 |
1969年 | 2篇 |
排序方式: 共有4122条查询结果,搜索用时 31 毫秒
81.
We investigate the decidability of the operation problem for T0L languages and subclasses. Fix an operation on formal languages. Given languages from the family considered (0L languages, T0L languages, or their propagating variants), is the application of this operation to the given languages still a language that belongs to the same language family? Observe, that all the Lindenmayer language families in question are anti-AFLs, that is, they are not closed under homomorphisms, inverse homomorphisms, intersection with regular languages, union, concatenation, and Kleene closure. Besides these classical operations we also consider intersection and substitution, since the language families under consideration are not closed under these operations, too. We show that for all of the above mentioned language operations, except for the Kleene closure, the corresponding operation problems of 0L and T0L languages and their propagating variants are not even semidecidable. The situation changes for unary 0L languages. In this case we prove that the operation problems with respect to Kleene star, complementation, and intersection with regular sets are decidable. 相似文献
82.
Markus Haas Stefan Mittnik Marc S. Paolella 《Computational statistics & data analysis》2009,53(6):2129-2154
An asymmetric multivariate generalization of the recently proposed class of normal mixture GARCH models is developed. Issues of parametrization and estimation are discussed. Conditions for covariance stationarity and the existence of the fourth moment are derived, and expressions for the dynamic correlation structure of the process are provided. In an application to stock market returns, it is shown that the disaggregation of the conditional (co)variance process generated by the model provides substantial intuition. Moreover, the model exhibits a strong performance in calculating out-of-sample Value-at-Risk measures. 相似文献
83.
Rule cubes for causal investigations 总被引:1,自引:1,他引:0
Axel Blumenstock Franz Schweiggert Markus Müller Carsten Lanquillon 《Knowledge and Information Systems》2009,18(1):109-132
With the complexity of modern vehicles tremendously increasing, quality engineers play a key role within today’s automotive
industry. Field data analysis supports corrective actions in development, production and after sales support. We decompose
the requirements and show that association rules, being a popular approach to generating explanative models, still exhibit
shortcomings. Interactive rule cubes, which have been proposed recently, are a promising alternative. We extend this work
by introducing a way of intuitively visualizing and meaningfully ranking them. Moreover, we present methods to interactively
factorize a problem and validate hypotheses by ranking patterns based on expectations, and by browsing a cube-based network
of related influences. All this is currently in use as an interactive tool for warranty data analysis in the automotive industry.
A real-world case study shows how engineers successfully use it in identifying root causes of quality issues.
相似文献
Axel BlumenstockEmail: |
84.
85.
A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are called algebras of minimal rank. After 25 years of research, these algebras are now well understood. Here we start the investigation of the algebras for which the Alder–Strassen bound is off by one. As a first result, we completely characterize the semisimple algebras over R whose bilinear complexity is by one larger than the Alder–Strassen bound. Furthermore, we characterize all algebras A (with radical) of minimal rank plus one over R for which A/radA has minimal rank plus one. The other possibility is that A/radA has minimal rank. For this case, we only present a partial result. 相似文献
86.
To explore virtual environments that are larger than the available physical tracking space by real walking, it is necessary to use so-called redirected walking. Redirection techniques allow the user to explore an unlimited virtual environment in a limited tracking space by introducing a small mismatch between a user’s real and virtual movement, thus preventing the user from colliding with the physical walls of the tracking space. Steering algorithms are used to select the most suitable redirection technique at any given time, depending on the geometry of the real and virtual environment. Together with prediction of a user’s future walking path, these algorithms select the best redirection strategy by an optimal control scheme. In this paper, a new approach for the prediction of a person’s locomotion target is presented. We use various models of human locomotion together with a set of possible targets to create a set of expected paths. These paths are then compared to the real path the user already traveled to calculate the probability of a certain target being the one the user is heading for. A new approach for comparing paths with each other is introduced and is compared to three others. For describing the human’s path to a given target, four different models are used and compared. To gather data for the comparison of the models against the real path, a user study was conducted. Based on the results of the user study, the paper concludes with a discussion on the prediction performance of the different approaches. 相似文献
87.
88.
How the Kano model contributes to Kansei engineering in services 总被引:1,自引:0,他引:1
Recent studies show that products and services hold great appeal if they are attractively designed to elicit emotional feelings from customers. Kansei engineering (KE) has good potential to provide a competitive advantage to those able to read and translate customer affect and emotion in actual product and services. This study introduces an integrative framework of the Kano model and KE, applied to services. The Kano model was used and inserted into KE to exhibit the relationship between service attribute performance and customer emotional response. Essentially, the Kano model categorises service attribute quality into three major groups (must-be [M], one-dimensional [O] and attractive [A]). The findings of a case study that involved 100 tourists who stayed in luxury 4- and 5-star hotels are presented. As a practical matter, this research provides insight on which service attributes deserve more attention with regard to their significant impact on customer emotional needs. STATEMENT OF RELEVANCE: Apart from cognitive evaluation, emotions and hedonism play a big role in service encounters. Through a focus on delighting qualities of service attributes, this research enables service providers and managers to establish the extent to which they prioritise their improvement efforts and to always satisfy their customer emotions beyond expectation. 相似文献
89.
We investigate the use of two‐level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort‐based construction algorithm and show that the two‐level grid is one of the structures that is fastest to construct on modern graphics processors. The structure handles non‐uniform primitive distributions more robustly than the uniform grid and its traversal performance is comparable to those of other high quality acceleration structures used for dynamic scenes. We propose a cost model to determine the grid resolution and improve SIMD utilization during ray‐triangle intersection by employing a hybrid packetization strategy. The build times and ray traversal acceleration provide overall rendering performance superior to previous approaches for real time rendering of animated scenes on GPUs. 相似文献
90.