全文获取类型
收费全文 | 11626篇 |
免费 | 803篇 |
国内免费 | 33篇 |
专业分类
电工技术 | 135篇 |
综合类 | 5篇 |
化学工业 | 3025篇 |
金属工艺 | 357篇 |
机械仪表 | 402篇 |
建筑科学 | 365篇 |
矿业工程 | 24篇 |
能源动力 | 485篇 |
轻工业 | 1403篇 |
水利工程 | 76篇 |
石油天然气 | 70篇 |
无线电 | 1439篇 |
一般工业技术 | 2419篇 |
冶金工业 | 538篇 |
原子能技术 | 76篇 |
自动化技术 | 1643篇 |
出版年
2024年 | 44篇 |
2023年 | 111篇 |
2022年 | 203篇 |
2021年 | 412篇 |
2020年 | 355篇 |
2019年 | 315篇 |
2018年 | 530篇 |
2017年 | 551篇 |
2016年 | 615篇 |
2015年 | 415篇 |
2014年 | 553篇 |
2013年 | 1099篇 |
2012年 | 684篇 |
2011年 | 772篇 |
2010年 | 613篇 |
2009年 | 625篇 |
2008年 | 562篇 |
2007年 | 492篇 |
2006年 | 393篇 |
2005年 | 270篇 |
2004年 | 275篇 |
2003年 | 239篇 |
2002年 | 214篇 |
2001年 | 180篇 |
2000年 | 166篇 |
1999年 | 134篇 |
1998年 | 238篇 |
1997年 | 191篇 |
1996年 | 151篇 |
1995年 | 115篇 |
1994年 | 100篇 |
1993年 | 88篇 |
1992年 | 70篇 |
1991年 | 73篇 |
1990年 | 39篇 |
1989年 | 51篇 |
1988年 | 44篇 |
1987年 | 25篇 |
1986年 | 29篇 |
1985年 | 45篇 |
1984年 | 33篇 |
1983年 | 36篇 |
1982年 | 35篇 |
1981年 | 32篇 |
1980年 | 36篇 |
1979年 | 26篇 |
1977年 | 20篇 |
1976年 | 33篇 |
1974年 | 17篇 |
1973年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
In this paper, a new class of additive codes which is referred to as ?2 ?2[u]-additive codes is introduced. This is a generalization towards another direction of recently introduced ?2 ?4-additive codes [J. Borges, C. Fernández-Córdoba, J. Pujol, J. Rif´a, and M. Villanueva, ?2 ?4-linear codes: Generator matrices and duality, Designs Codes Cryptogr. 54(2) (2010), pp. 167–179]. ?2 ?4-additive codes have shown to provide a promising class of codes with their algebraic structure and applications such as steganography. The standard generator matrices are established and by introducing orthogonality the parity-check matrices are also obtained. A MacWilliams-type identity that relates the weight enumerator of a code with its dual is proved. Furthermore, a Gray map that maps these codes to binary codes is defined and some examples of optimal codes which are the binary Gray images of ?2 ?2[u]-additive codes are presented. 相似文献
63.
Cloud computing is an emerging technology in which information technology resources are virtualized to users in a set of computing resources on a pay‐per‐use basis. It is seen as an effective infrastructure for high performance applications. Divisible load applications occur in many scientific and engineering applications. However, dividing an application and deploying it in a cloud computing environment face challenges to obtain an optimal performance due to the overheads introduced by the cloud virtualization and the supporting cloud middleware. Therefore, we provide results of series of extensive experiments in scheduling divisible load application in a Cloud environment to decrease the overall application execution time considering the cloud networking and computing capacities presented to the application's user. We experiment with real applications within the Amazon cloud computing environment. Our extensive experiments analyze the reasons of the discrepancies between a theoretical model and the reality and propose adequate solutions. These discrepancies are due to three factors: the network behavior, the application behavior and the cloud computing virtualization. Our results show that applying the algorithm result in a maximum ratio of 1.41 of the measured normalized makespan versus the ideal makespan for application in which the communication to computation ratio is big. They show that the algorithm is effective for those applications in a heterogeneous setting reaching a ratio of 1.28 for large data sets. For application following the ensemble clustering model in which the computation to communication ratio is big and variable, we obtained a maximum ratio of 4.7 for large data set and a ratio of 2.11 for small data set. Applying the algorithm also results in an important speedup. These results are revealing for the type of applications we consider under experiments. The experiments also reveal the impact of the choice of the platforms provided by Amazon on the performance of the applications under study. Considering the emergence of cloud computing for high performance applications, the results in this paper can be widely adopted by cloud computing developers. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
64.
Lourenço André Rota Bulò Samuel Rebagliati Nicola Fred Ana L. N. Figueiredo Mário A. T. Pelillo Marcello 《Machine Learning》2015,98(1-2):331-357
Machine Learning - Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence... 相似文献
65.
GaN‐based emissive microdisplays: A very promising technology for compact,ultra‐high brightness display systems 下载免费PDF全文
François Templier 《Journal of the Society for Information Display》2016,24(11):669-675
High‐brightness GaN‐based emissive microdisplays can be fabricated with different approaches that are listed and described. They consist either of hybridizing a GaN LED array on a CMOS circuit or building a monolithic component on a single substrate. Using the hybridization approach, two types of 10‐μm pixel pitch GaN microdisplay prototypes were developed: (1) directly driven, 300 × 252 pixels and (2) active‐matrix, 873 × 500 pixels. Brightness as high as 1 × 106 and 1 × 107 cd/m2 for blue and green arrays, respectively, were reached. GaN‐based emissive microdisplays are suitable for augmented reality systems or head‐up displays, but some challenges remain before they can be put in production. 相似文献
66.
An ensemble of quantum states can be described by a Hermitian, positive semidefinite and unit trace matrix called density matrix. Thus, the study of methods for optimizing a certain function (energy, entropy) over the set of density matrices has a direct application to important problems in quantum information and computation. We propose a projected gradient method for solving such problems. By exploiting the geometry of the feasible set, which is the intersection of the cone of Hermitian positive semidefinite matrices with the hyperplane defined by the unit trace constraint, we describe an efficient procedure to compute the projection onto this set using the Frobenius norm. Some important applications, such as quantum state tomography, are described and numerical experiments illustrate the effectiveness of the method when compared to previous methods based on fixed-point iterations or semidefinite programming. 相似文献
67.
Da-Jung Cho Yo-Sub Han Shin-Dong Kang Hwee Kim Sang-Ki Ko Kai Salomaa 《Natural computing》2016,15(1):31-39
We consider a pseudo-inversion operation inspired by biological events, such as DNA sequence transformations, where only parts of a string are reversed. We define the pseudo-inversion of a string \(w = uxv\) to be the set of all strings \(v^Rxu^R\), where \(uv \ne \lambda \) and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudo-inversion operation whereas context-free languages are not. Furthermore, we study the iterated pseudo-inversion operation and show that the iterated pseudo-inversion of a context-free language is recognized by a nondeterministic reversal-bounded multicounter machine. Finally, we introduce the notion of pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We demonstrate that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages. 相似文献
68.
Bassam?HammoEmail authorView authors OrcID profile Sane?Yagi Omaima?Ismail Mohammad?AbuShariah 《Language Resources and Evaluation》2016,50(4):839-861
This paper presents a historical Arabic corpus named HAC. At this early embryonic stage of the project, we report about the design, the architecture and some of the experiments which we have conducted on HAC. The corpus, and accordingly the search results, will be represented using a primary XML exchange format. This will serve as an intermediate exchange tool within the project and will allow the user to process the results offline using some external tools. HAC is made up of Classical Arabic texts that cover 1600 years of language use; the Quranic text, Modern Standard Arabic texts, as well as a variety of monolingual Arabic dictionaries. The development of this historical corpus assists linguists and Arabic language learners to effectively explore, understand, and discover interesting knowledge hidden in millions of instances of language use. We used techniques from the field of natural language processing to process the data and a graph-based representation for the corpus. We provided researchers with an export facility to render further linguistic analysis possible. 相似文献
69.
This article presents an in-depth qualitative study using a phenomenological approach to understand loneliness among elderly individuals in Malaysia. The objective of the study was to understand how the Malaysian elderly perceive and understand social isolation as well as loneliness, with the aim of identifying the factors that cause emotional loneliness among the elderly in nursing homes. In addition, this study also explored their coping strategies when dealing with loneliness. Semi-structured interviews were conducted with ten elderly participants from two different nursing homes in Kuala Lumpur and Selangor with representatives from the three major ethnic groups of Malaysia. Based on the results, there are several factors that cause the elderly to feel lonely – health factors, lack of family ties, and the lack of communication and cognitive factors, such as memory and perception. It was also found that internal (expectations and optimism) and external (work and activities) coping strategies play major roles in overcoming loneliness. In conclusion, some recommendations are made to respective party families and the government to consider when developing plans to help the elderly overcome loneliness, which could strengthen the family and social support system in Malaysia. 相似文献
70.