全文获取类型
收费全文 | 3062篇 |
免费 | 182篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 40篇 |
综合类 | 6篇 |
化学工业 | 871篇 |
金属工艺 | 50篇 |
机械仪表 | 79篇 |
建筑科学 | 123篇 |
矿业工程 | 2篇 |
能源动力 | 108篇 |
轻工业 | 311篇 |
水利工程 | 21篇 |
石油天然气 | 4篇 |
无线电 | 255篇 |
一般工业技术 | 462篇 |
冶金工业 | 173篇 |
原子能技术 | 22篇 |
自动化技术 | 722篇 |
出版年
2024年 | 6篇 |
2023年 | 53篇 |
2022年 | 163篇 |
2021年 | 205篇 |
2020年 | 86篇 |
2019年 | 83篇 |
2018年 | 123篇 |
2017年 | 76篇 |
2016年 | 149篇 |
2015年 | 95篇 |
2014年 | 142篇 |
2013年 | 234篇 |
2012年 | 204篇 |
2011年 | 252篇 |
2010年 | 158篇 |
2009年 | 169篇 |
2008年 | 165篇 |
2007年 | 141篇 |
2006年 | 120篇 |
2005年 | 91篇 |
2004年 | 72篇 |
2003年 | 66篇 |
2002年 | 45篇 |
2001年 | 31篇 |
2000年 | 30篇 |
1999年 | 33篇 |
1998年 | 48篇 |
1997年 | 35篇 |
1996年 | 38篇 |
1995年 | 19篇 |
1994年 | 21篇 |
1993年 | 10篇 |
1992年 | 10篇 |
1991年 | 3篇 |
1989年 | 11篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1973年 | 3篇 |
1972年 | 2篇 |
排序方式: 共有3249条查询结果,搜索用时 15 毫秒
61.
Gianmarco de Felice Maria Antonietta Aiello Carmelo Caggegi Francesca Ceroni Stefano De Santis Enrico Garbin Natalino Gattesco Łukasz Hojdys Piotr Krajewski Arkadiusz Kwiecień Marianovella Leone Gian Piero Lignola Claudio Mazzotti Daniel Oliveira Corina Papanicolaou Carlo Poggi Thanasis Triantafillou Maria Rosa Valluzzi Alberto Viskovic 《Materials and Structures》2018,51(4):95
Textile Reinforced Mortar (TRM), also known as Fabric Reinforced Mortar or Fabric Reinforced Cementitious Matrix, composites are an emerging technology for the external repair and strengthening of existing structures. For most applications, the effectiveness of the TRM reinforcement relies on its bond performance. This recommendation identifies the best practice to characterize the bond behaviour of TRM. A shear bond test method is proposed to determine the peak axial stress (associated with the maximum load that can be transferred from the structural member to the externally bonded TRM reinforcement), the stress–slip relationship and the failure mode that controls the TRM-to-substrate load transfer capacity. Guidelines on specimen manufacturing, experimental setup, test execution, and determination of test results are provided. 相似文献
62.
Gian Luigi Angrisani Piriya Taptimthong Susanne Elisabeth Thürer Christian Klose Hans Jürgen Maier Marc Christopher Wurz Kai Möhwald 《Advanced Engineering Materials》2018,20(9)
63.
Engineered Multifunctional Albumin‐Decorated Porous Silicon Nanoparticles for FcRn Translocation of Insulin 下载免费PDF全文
João P. Martins Roberto D'Auria Dongfei Liu Flavia Fontana Mónica P. A. Ferreira Alexandra Correia Marianna Kemell Karina Moslova Ermei Mäkilä Jarno Salonen Luca Casettari Jouni Hirvonen Bruno Sarmento Hélder A. Santos 《Small (Weinheim an der Bergstrasse, Germany)》2018,14(27)
The last decade has seen remarkable advances in the development of drug delivery systems as alternative to parenteral injection‐based delivery of insulin. Neonatal Fc receptor (FcRn)‐mediated transcytosis has been recently proposed as a strategy to increase the transport of drugs across the intestinal epithelium. FcRn‐targeted nanoparticles (NPs) could hijack the FcRn transcytotic pathway and cross the epithelial cell layer. In this study, a novel nanoparticulate system for insulin delivery based on porous silicon NPs is proposed. After surface conjugation with albumin and loading with insulin, the NPs are encapsulated into a pH‐responsive polymeric particle by nanoprecipitation. The developed NP formulation shows controlled size and homogeneous size distribution. Transmission electron microscopy (TEM) images show successful encapsulation of the NPs into pH‐sensitive polymeric particles. No insulin release is detected at acidic conditions, but a controlled release profile is observed at intestinal pH. Toxicity studies show high compatibility of the NPs with intestinal cells. In vitro insulin permeation across the intestinal epithelium shows approximately fivefold increase when insulin is loaded into FcRn‐targeted NPs. Overall, these FcRn‐targeted NPs offer a toolbox in the development of targeted therapies for oral delivery of insulin. 相似文献
64.
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. 相似文献
65.
Murtas C Bruschi M Carnevali ML Petretto A Corradini E Prunotto M Candiano G degl'Innocenti ML Ghiggeri GM Allegri L 《Proteomics. Clinical applications》2011,5(1-2):90-97
Renal auto-immune diseases represent a major source of morbidity in humans. For many years the knowledge on mechanisms of auto-immunity involving the kidney has been uniquely based on animal models. However, these findings often could not be readily translated to humans owing to notably difference in antigen expression by human podocytes. One example is Heymann nephritis (HN), the experimental model of human membranous glomerulonephritis (MGN), which is obtained in rats by injecting antibodies against megalin, a protein that is not present in human glomeruli. Human studies could not be done in the past since sequencing required too much material exceeding what obtainable from tissue biopsies in vivo. Research is now on the way to identify auto-antigens and isolate specific auto-antibodies in humans. New technology developments based on tissue microdissection and proteomical analysis have facilitated the recent discoveries, allowing direct analysis of human tissue in vivo. Major advances on the pathogenesis of MGN, the prototype for the formation and glomerular deposition of auto-antibodies, are now in progress. Two independent groups have, in fact, demonstrated the existence of specific IgG(4) against phospholipase A2 receptor, aldose reductase and Mn-superoxide dismutase in glomerular eluates and in plasma of a prominent part of patients with MGN, suggesting a major role of these proteins as auto-antigens in human MGN. This review will focalize these aspects outlining the contribution of proteomics in most recent developments. 相似文献
66.
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. 相似文献
67.
Web 2.0 technologies, such as forums and wikis, are enabling an explosion of global knowledge sharing through distributed large-scale conversations, but they seem to be less successful at supporting collaborative deliberation around complex and controversial questions. In order to cope with this limitation, many scholars have proposed to adopt on-line argumentation platforms to improve information visualization, organization and reuse. However, such research has mostly focused on the design of adequate argument-based knowledge formalisms. Less attention has been paid to the empirical analysis of actual interactions mediated by argumentation technology with reasonably large user communities. In this paper, we present an in-depth analysis of the data obtained in the empirical test of an argumentation platform where a 160-member community created, in 3 weeks, what is to our knowledge the largest single online argument map ever built (around 5000 posts). Our results show that (i) users were able to quickly and comprehensively explore and map the debate on the selected discussion topic; (ii) substantial moderation was needed to ensure that the argument map was well-organized and users were confident with the argumentation formalism; (iii) considerable out-of-the map communication occurred, possibly as a way to allow for conversational flows inhibited by the argumentation formalism, (iv) formal rating of contributions favored exploration of the map, understanding the debate structure, and improving the quality of content. 相似文献
68.
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. 相似文献
69.
Vittorio Bilò Angelo Fanelli Michele Flammini Luca Moscardelli 《Theory of Computing Systems》2011,49(1):24-45
We investigate the approximation ratio of the solutions achieved after a one-round walk in linear congestion games. We consider the social functions Sum, defined as the sum of the players’ costs, and Max, defined as the maximum cost per player, as a measure of the quality of a given solution. For the social function Sum and one-round walks starting from the empty strategy profile, we close the gap between the upper bound of \(2+\sqrt{5}\approx 4.24\) given in Christodoulou et al. (Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS, vol. 3884, pp. 349–360, Springer, Berlin, 2006) and the lower bound of 4 derived in Caragiannis et al. (Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP), LNCS, vol. 4051, pp. 311–322, Springer, Berlin, 2006) by providing a matching lower bound whose construction and analysis require non-trivial arguments. For the social function Max, for which, to the best of our knowledge, no results were known prior to this work, we show an approximation ratio of \(\Theta(\sqrt[4]{n^{3}})\) (resp. \(\Theta(n\sqrt{n})\)), where n is the number of players, for one-round walks starting from the empty (resp. an arbitrary) strategy profile. 相似文献
70.
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. 相似文献