全文获取类型
收费全文 | 5564篇 |
免费 | 397篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 109篇 |
综合类 | 9篇 |
化学工业 | 1595篇 |
金属工艺 | 79篇 |
机械仪表 | 167篇 |
建筑科学 | 214篇 |
矿业工程 | 5篇 |
能源动力 | 187篇 |
轻工业 | 552篇 |
水利工程 | 41篇 |
石油天然气 | 23篇 |
无线电 | 447篇 |
一般工业技术 | 929篇 |
冶金工业 | 263篇 |
原子能技术 | 30篇 |
自动化技术 | 1322篇 |
出版年
2024年 | 6篇 |
2023年 | 85篇 |
2022年 | 248篇 |
2021年 | 322篇 |
2020年 | 174篇 |
2019年 | 200篇 |
2018年 | 207篇 |
2017年 | 206篇 |
2016年 | 250篇 |
2015年 | 213篇 |
2014年 | 270篇 |
2013年 | 447篇 |
2012年 | 393篇 |
2011年 | 450篇 |
2010年 | 333篇 |
2009年 | 330篇 |
2008年 | 292篇 |
2007年 | 254篇 |
2006年 | 214篇 |
2005年 | 151篇 |
2004年 | 123篇 |
2003年 | 94篇 |
2002年 | 86篇 |
2001年 | 63篇 |
2000年 | 56篇 |
1999年 | 57篇 |
1998年 | 80篇 |
1997年 | 64篇 |
1996年 | 52篇 |
1995年 | 26篇 |
1994年 | 36篇 |
1993年 | 29篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 12篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 12篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 16篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 10篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1971年 | 3篇 |
排序方式: 共有5972条查询结果,搜索用时 15 毫秒
91.
Transnational activism endures as a political practice turning a mirror onto the world's powerbrokers. We analyse a variety of transnational activism best characterized as serial by virtue of an observed systematic time and border‐spanning commitment to protest communication. Following statistical disambiguation of a dataset of 2.5 million unique Twitter users, we identified a subset of exceptionally prolific communicators and interviewed 21 of them. We show that a noted prominence in networked communication of otherwise unremarkable Twitter users may be an upshot of purposive strategies intended to publicize, support or help orchestrate collective action. Accordingly, we propose the term “engagement compass” to address the relationship between activists' life‐patterns and their personal investment in protest over time. 相似文献
92.
In recent years, cubic regularization algorithms for unconstrained optimization have been defined as alternatives to trust-region and line search schemes. These regularization techniques are based on the strategy of computing an (approximate) global minimizer of a cubic overestimator of the objective function. In this work we focus on the adaptive regularization algorithm using cubics (ARC) proposed in Cartis et al. [Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results, Mathematical Programming A 127 (2011), pp. 245–295]. Our purpose is to design a modified version of ARC in order to improve the computational efficiency preserving global convergence properties. The basic idea is to suitably combine a Goldstein-type line search and a nonmonotone accepting criterion with the aim of advantageously exploiting the possible good descent properties of the trial step computed as (approximate) minimizer of the cubic model. Global convergence properties of the proposed nonmonotone ARC algorithm are proved. Numerical experiments are performed and the obtained results clearly show satisfactory performance of the new algorithm when compared to the basic ARC algorithm. 相似文献
93.
Claudio Baecchi Tiberio Uricchio Marco Bertini Alberto Del Bimbo 《Multimedia Tools and Applications》2016,75(5):2507-2525
In this paper we investigate the use of a multimodal feature learning approach, using neural network based models such as Skip-gram and Denoising Autoencoders, to address sentiment analysis of micro-blogging content, such as Twitter short messages, that are composed by a short text and, possibly, an image. The approach used in this work is motivated by the recent advances in: i) training language models based on neural networks that have proved to be extremely efficient when dealing with web-scale text corpora, and have shown very good performances when dealing with syntactic and semantic word similarities; ii) unsupervised learning, with neural networks, of robust visual features, that are recoverable from partial observations that may be due to occlusions or noisy and heavily modified images. We propose a novel architecture that incorporates these neural networks, testing it on several standard Twitter datasets, and showing that the approach is efficient and obtains good classification results. 相似文献
94.
Francesca Arcelli Fontana Mika V. Mäntylä Marco Zanoni Alessandro Marino 《Empirical Software Engineering》2016,21(3):1143-1191
Several code smell detection tools have been developed providing different results, because smells can be subjectively interpreted, and hence detected, in different ways. In this paper, we perform the largest experiment of applying machine learning algorithms to code smells to the best of our knowledge. We experiment 16 different machine-learning algorithms on four code smells (Data Class, Large Class, Feature Envy, Long Method) and 74 software systems, with 1986 manually validated code smell samples. We found that all algorithms achieved high performances in the cross-validation data set, yet the highest performances were obtained by J48 and Random Forest, while the worst performance were achieved by support vector machines. However, the lower prevalence of code smells, i.e., imbalanced data, in the entire data set caused varying performances that need to be addressed in the future studies. We conclude that the application of machine learning to the detection of these code smells can provide high accuracy (>96 %), and only a hundred training examples are needed to reach at least 95 % accuracy. 相似文献
95.
Davide Rotta Marco De Michielis Elena Ferraro Marco Fanciulli Enrico Prati 《Quantum Information Processing》2016,15(6):2253-2274
Scalability from single-qubit operations to multi-qubit circuits for quantum information processing requires architecture-specific implementations. Semiconductor hybrid qubit architecture is a suitable candidate to realize large-scale quantum information processing, as it combines a universal set of logic gates with fast and all-electrical manipulation of qubits. We propose an implementation of hybrid qubits, based on Si metal-oxide-semiconductor (MOS) quantum dots, compatible with the CMOS industrial technological standards. We discuss the realization of multi-qubit circuits capable of fault-tolerant computation and quantum error correction, by evaluating the time and space resources needed for their implementation. As a result, the maximum density of quantum information is extracted from a circuit including eight logical qubits encoded by the [[7, 1, 3]] Steane code. The corresponding surface density of logical qubits is 2.6 Mqubit/cm\(^2\). 相似文献
96.
97.
Valerio Arnaboldi Massimiliano La Gala Andrea Passarella Marco Conti 《Peer-to-Peer Networking and Applications》2016,9(6):1195-1208
Distributed Online Social Networks (DOSN) are a valid alternative to OSN based on peer-to-peer communications. Without centralised data management, DOSN must provide the users with higher level of control over their personal information and privacy. Thus, users may wish to restrict their personal network to a limited set of peers, depending on the level of trust with them. This means that the effective social network (used for information exchange) may be a subset of the complete social network, and may present different structural patterns, which could limit information diffusion. In this paper, we estimate the capability of DOSN to diffuse content based on trust between social peers. To have a realistic representation of a OSN friendship graph, we consider a large-scale Facebook network, from which we estimate the trust level between friends. Then, we consider only social links above a certain threshold of trust, and we analyse the potential capability of the resulting graph to spread information through several structural indices. We test four possible thresholds, coinciding with the definition of personal social circles derived from sociology and anthropology. The results show that limiting the network to “active social contacts” leads to a graph with high network connectivity, where the nodes are still well-connected to each other, thus information can potentially cover a large number of nodes with respect to the original graph. On the other hand, the coverage drops for more restrictive assumptions. Nevertheless the re-insertion of a single excluded friend for each user is sufficient to obtain good coverage (i.e., always higher than 40 %) even in the most restricted graphs. We also analyse the potential capability of the network to spread information (i.e., network spreadability), studying the properties of the social paths between any pairs of users in the graph, which represent the effective channels traversed by information. The value of contact frequency between pairs of users determines a decay of trust along the path (the higher the contact frequency the lower the decay), and a consequent decay in the level of trustworthiness of information traversing the path. We show that selecting the link to re-insert in the network with probability proportional to its level of trust is the best re-insertion strategy, as it leads to the best connectivity/spreadability combination. 相似文献
98.
In this paper, we introduce a two‐layered approach addressing the problem of creating believable mesh‐based skin deformation. For each frame, the skin is first deformed with a classic linear blend skinning approach, which usually leads to unsightly artefacts such as the well‐known candy‐wrapper effect and volume loss. Then we enforce some geometric constraints which displace the positions of the vertices to mimic the behaviour of the skin and achieve effects like volume preservation and jiggling. We allow the artist to control the amount of jiggling and the area of the skin affected by it. The geometric constraints are solved using a position‐based dynamics (PBDs) schema. We employ a graph colouring algorithm for parallelizing the computation of the constraints. Being based on PBDs guarantees efficiency and real‐time performances while enduring robustness and unconditional stability. We demonstrate the visual quality and the performance of our approach with a variety of skeleton‐driven soft body characters. 相似文献
99.
100.
Batch sequencing and cooperation 总被引:1,自引:0,他引:1
Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs. This paper aims to extend the game theoretical approach to the cost allocation problems arising from sequencing situations on systems that consist of batch machines. To analyze the allocation problem at hand, it focusses on the existence of core elements, convexity, and the Shapley value. 相似文献