全文获取类型
收费全文 | 2722篇 |
免费 | 157篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 38篇 |
综合类 | 2篇 |
化学工业 | 750篇 |
金属工艺 | 45篇 |
机械仪表 | 67篇 |
建筑科学 | 110篇 |
矿业工程 | 1篇 |
能源动力 | 91篇 |
轻工业 | 272篇 |
水利工程 | 19篇 |
石油天然气 | 3篇 |
无线电 | 232篇 |
一般工业技术 | 407篇 |
冶金工业 | 150篇 |
原子能技术 | 20篇 |
自动化技术 | 676篇 |
出版年
2024年 | 6篇 |
2023年 | 48篇 |
2022年 | 148篇 |
2021年 | 179篇 |
2020年 | 80篇 |
2019年 | 76篇 |
2018年 | 117篇 |
2017年 | 70篇 |
2016年 | 134篇 |
2015年 | 88篇 |
2014年 | 129篇 |
2013年 | 205篇 |
2012年 | 181篇 |
2011年 | 234篇 |
2010年 | 144篇 |
2009年 | 150篇 |
2008年 | 150篇 |
2007年 | 125篇 |
2006年 | 106篇 |
2005年 | 81篇 |
2004年 | 62篇 |
2003年 | 55篇 |
2002年 | 41篇 |
2001年 | 23篇 |
2000年 | 26篇 |
1999年 | 29篇 |
1998年 | 41篇 |
1997年 | 33篇 |
1996年 | 32篇 |
1995年 | 15篇 |
1994年 | 18篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1990年 | 1篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1969年 | 1篇 |
1965年 | 1篇 |
1964年 | 1篇 |
排序方式: 共有2883条查询结果,搜索用时 15 毫秒
21.
22.
Luca Aceto 《Formal Aspects of Computing》1994,6(2):201-222
This paper proposes alternative, effective characterizations for nets of automata of the location equivalence and preorder presented by Boudol et al. in the companion paper [BCHK]. Contrary to the technical development in the above given reference, where locations are dynamically associated to the subparts of a process in the operational semantics, the equivalence and preorder we propose are based on a static association of locations to the parallel components of a net. Following this static approach, it is possible to give these distributed nets a standard operational semantics which associates with each net a finite labelled transition system. Using this operational semantics for distributed nets, we introduce effective notions of equivalence and preorder which are shown to coincide with those proposed in [BCHK]. 相似文献
23.
Virtual Reality - The intersection between sound and music computing and Virtual Reality (VR) has grown significantly over the past decades, amounting to an established area of research today.... 相似文献
24.
Paolini Emilio De Marinis Lorenzo Cococcioni Marco Valcarenghi Luca Maggiani Luca Andriolli Nicola 《Neural computing & applications》2022,34(18):15589-15601
Neural Computing and Applications - Photonics-based neural networks promise to outperform electronic counterparts, accelerating neural network computations while reducing power consumption and... 相似文献
25.
Daniele Di Gioacchino Nicola Poccia Martijn Lankhorst Claudio Gatti Bruno Buonomo Luca Foggetta Augusto Marcelli Hans Hilgenkamp 《Journal of Superconductivity and Novel Magnetism》2017,30(2):359-363
The current frontiers in the investigation of high-energy particles demand for new detection methods. Higher sensitivity to low-energy deposition, high-energy resolution to identify events and improve the background rejection, and large detector masses have to be developed to detect even an individual particle that weakly interacts with ordinary matter. Here, we will describe the concept and the layout of a novel superconducting proximity array which show dynamic vortex Mott insulator to metal transitions, as an ultra-sensitive compact radiation-particle detector. 相似文献
26.
Unsupervised tissue classification of brain MR images for voxel‐based morphometry analysis 下载免费PDF全文
Luca Agnello Albert Comelli Edoardo Ardizzone Salvatore Vitabile 《International journal of imaging systems and technology》2016,26(2):136-150
In this article, a fully unsupervised method for brain tissue segmentation of T1‐weighted MRI 3D volumes is proposed. The method uses the Fuzzy C‐Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro‐radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial‐and‐error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro‐Spinal Fluid in an unsupervised way. The method has been tested on the IBSR dataset, on the BrainWeb Phantom, on the BrainWeb SBD dataset, and on the real dataset “University of Palermo Policlinico Hospital” (UPPH), Italy. Sensitivity, Specificity, Dice and F‐Factor scores have been calculated on the IBSR and BrainWeb datasets segmented using the proposed method, the FCM algorithm, and two state‐of‐the‐art brain segmentation software packages (FSL and SPM) to prove the effectiveness of the proposed approach. A qualitative evaluation involving a group of five expert radiologists has been performed segmenting the real dataset using the proposed approach and the comparison algorithms. Finally, a usability analysis on the proposed method and reference methods has been carried out from the same group of expert radiologists. The achieved results show that the segmentations of the proposed method are comparable or better than the reference methods with a better usability and degree of acceptance. 相似文献
27.
Susanna Monti Giovanni Barcaro Luca Sementa Vincenzo Carravetta Hans Ågren 《Nano Research》2018,11(4):1757-1767
The self-assembling properties, stability, and dynamics of hybrid nanocarriers (gold nanoparticles (AuNPs) functionalized with cysteine-based peptides) in solution are studied through a series of classical molecular dynamics simulations based on a recently parametrized reactive force field. The results reveal, at the atomic level, all the details regarding the peptide adsorption mechanisms, nanoparticle stabilization, aggregation, and sintering. The data confirm and explain the experimental findings and disclose aspects that cannot be scrutinized by experiments. The biomolecules are both chemisorbed and physisorbed; self-interactions of the adsorbates and formation of stable networks of interconnected molecules on the AuNP surfaces limit substrate reconstructions, protect the AuNPs from the action of the solvent, and prevent direct interactions of the gold surfaces. The possibility of agglomeration of the functionalized nanoparticles, compared with the sintering of the bare supports in a water solution, is demonstrated through relatively long simulations and fast steered dynamics. The analysis of the trajectories reveals that the AuNPs were well stabilized by the peptides. This prevented particle sintering and kept the particles far apart; however, part of their chains could form interconnections (crosslinks) between neighboring gold vehicles. The excellent agreement of these results with the literature confirm the reliability of the method and its potential application to the modeling of more complex materials relevant to the biomedical sector. 相似文献
28.
Michele Barletta Silvio Ranise Luca Vigan�� 《Service Oriented Computing and Applications》2011,5(2):105-137
The specification of distributed service-oriented applications spans several levels of abstraction, e.g., the protocol for
exchanging messages, the set of interface functionalities, the types of the manipulated data, the workflow, the access policy,
etc. Many (even executable) specification languages are available to describe each level in separation. However, these levels
may interact in subtle ways (for example, the control flow may depend on the values of some data variables) so that a precise
abstraction of the application amounts to more than the sum of its per level components. This problem is even more acute in
the design phase when automated analysis techniques may greatly help the difficult task of building “correct” applications
faced by designers. To alleviate this kind of problems, this paper introduces a framework for the formal specification and
automated analysis of distributed service-oriented applications in two levels: one for the workflow and one for the authorization
policies. The former allows one to precisely describe the control and data parts of an application with their mutual dependencies.
The latter focuses on the specification of the criteria for granting or denying third-party applications the possibility to
access shared resources or to execute certain interface functionalities. These levels can be seen as abstractions of one or
of several levels of specification mentioned above. The novelty of our proposal is the possibility to unambiguously specify
the—often subtle—interplay between the workflow and policy levels uniformly in the same framework. Additionally, our framework
allows us to define and investigate verification problems for service-oriented applications (such as executability and invariant
checking) and give sufficient conditions for their decidability. These results are non-trivial because their scope of applicability
goes well beyond the case of finite state spaces allowing for applications manipulating variables ranging over infinite domains.
As proof of concept, we show the suitability and flexibility of our approach on two quite different examples inspired by industrial
case studies. 相似文献
29.
Nordahl R Turchet L Serafin S 《IEEE transactions on visualization and computer graphics》2011,17(9):1234-1244
We propose a system that affords real-time sound synthesis of footsteps on different materials. The system is based on microphones, which detect real footstep sounds from subjects, from which the ground reaction force (GRF) is estimated. Such GRF is used to control a sound synthesis engine based on physical models. Two experiments were conducted. In the first experiment, the ability of subjects to recognize the surface they were exposed to was assessed. In the second experiment, the sound synthesis engine was enhanced with environmental sounds. Results show that, in some conditions, adding a soundscape significantly improves the recognition of the simulated environment. 相似文献
30.
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication network is directed. Namely, a subset of nodes of the network are interested in receiving the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods. At each step, a single receiver is allowed to modify its communication strategy, that is to select a communication path from the source, and assuming a selfish or rational behavior, it will make a best response move, that is it will select a solution yielding the minimum possible payment or shared cost. We determine lower and upper bounds on the price of anarchy, that is the highest possible ratio among the overall cost of the links used by the receivers and the minimum possible cost realizing the required communications, after a limited number of moves under the fundamental Shapley cost sharing method. In particular, assuming that the initial set of connecting paths can be arbitrary, we show an $O(r\sqrt{r})We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication
game when the underlying communication network is directed. Namely, a subset of nodes of the network are interested in receiving
the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods.
At each step, a single receiver is allowed to modify its communication strategy, that is to select a communication path from
the source, and assuming a selfish or rational behavior, it will make a best response move, that is it will select a solution
yielding the minimum possible payment or shared cost. We determine lower and upper bounds on the price of anarchy, that is
the highest possible ratio among the overall cost of the links used by the receivers and the minimum possible cost realizing
the required communications, after a limited number of moves under the fundamental Shapley cost sharing method. In particular,
assuming that the initial set of connecting paths can be arbitrary, we show an
O(r?r)O(r\sqrt{r})
upper bound on the price of anarchy after 2 rounds, during each of which all the receivers move exactly once, and a matching
lower bound, that we also extend to
W(rk?{r})\Omega(r\sqrt[k]{r})
for any number k≥2 rounds, where r is the number of receivers. Similarly, exactly matching upper and lower bounds equal to r are determined for any number of rounds when starting from the empty state in which no path has been selected. Analogous
results are obtained also with respect to other three natural cost sharing methods considered in the literature, that is the
egalitarian, path-proportional and egalitarian-path proportional ones. Most results are also extended to the undirected case
in which the communication links are bidirectional. 相似文献