全文获取类型
收费全文 | 2740篇 |
免费 | 163篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 39篇 |
综合类 | 2篇 |
化学工业 | 752篇 |
金属工艺 | 45篇 |
机械仪表 | 68篇 |
建筑科学 | 109篇 |
矿业工程 | 1篇 |
能源动力 | 91篇 |
轻工业 | 276篇 |
水利工程 | 19篇 |
石油天然气 | 3篇 |
无线电 | 232篇 |
一般工业技术 | 410篇 |
冶金工业 | 160篇 |
原子能技术 | 20篇 |
自动化技术 | 680篇 |
出版年
2024年 | 6篇 |
2023年 | 48篇 |
2022年 | 147篇 |
2021年 | 179篇 |
2020年 | 80篇 |
2019年 | 76篇 |
2018年 | 118篇 |
2017年 | 69篇 |
2016年 | 135篇 |
2015年 | 88篇 |
2014年 | 129篇 |
2013年 | 206篇 |
2012年 | 180篇 |
2011年 | 236篇 |
2010年 | 145篇 |
2009年 | 150篇 |
2008年 | 150篇 |
2007年 | 127篇 |
2006年 | 106篇 |
2005年 | 84篇 |
2004年 | 64篇 |
2003年 | 56篇 |
2002年 | 41篇 |
2001年 | 23篇 |
2000年 | 27篇 |
1999年 | 29篇 |
1998年 | 44篇 |
1997年 | 34篇 |
1996年 | 37篇 |
1995年 | 16篇 |
1994年 | 18篇 |
1993年 | 9篇 |
1992年 | 9篇 |
1990年 | 1篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1969年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有2907条查询结果,搜索用时 12 毫秒
71.
Gabriele Dono Raffaele Cortignani Luca Doro Luca Giraldo Luigi Ledda Massimiliano Pasqui Pier Paolo Roggero 《Water Resources Management》2013,27(10):3607-3622
Climate change is likely to have a profound effect on many agricultural variables, although the extent of its influence will vary over the course of the annual farm management cycle. Consequently, the effect of different and interconnected physical, technical and economic factors must be modeled in order to estimate the effects of climate change on agricultural productivity. Such modeling commonly makes use of indicators that summarize the among environmental factors that are considered when farmers plan their activities. This study uses net evapotranspiration (ETN), estimated using EPIC, as a proxy index for the physical factors considered by farmers when managing irrigation. Recent trends suggest that the probability distribution function of ETN may continue to change in the near future due to changes in the irrigation needs of crops. Also, water availability may continue to vary due to changes in the rainfall regime. The impacts of the uncertainties related to these changes on costs are evaluated using a Discrete Stochastic Programming model representing an irrigable Mediterranean area where limited water is supplied from a reservoir. In this context, adaptation to climate change can be best supported by improvements to the collective irrigation systems, rather than by measures aimed at individual farms such as those contained within the rural development policy. 相似文献
72.
73.
The problem of line breaking consists of finding the best way to split paragraphs into lines. It has been cleverly addressed by the total‐fit algorithm exposed by Knuth and Plass in a well‐known paper. Similarly, page‐breaking algorithms break the content flow of a document into page units. Formatting languages—such as the World Wide Web Consortium standard Extensible Stylesheet Language Formatting Objects (XSL‐FO)—allow users to set which content should be kept in the same page and how many isolated lines are acceptable at the beginning/end of each page. The strategies most formatters adopt to meet these requirements, however, are not satisfactory for many publishing contexts as they very often generate unpleasant empty areas. In that case, typographers are required to manually craft the results in order to completely fill pages. This paper presents a page‐breaking algorithm that extends the original Knuth and Plass line‐breaking approach and produces high‐quality documents without unwanted empty areas. The basic idea consists of delaying the definitive choice of breaks in the line‐breaking process in order to provide a larger set of alternatives to the actual pagination step. The algorithm also allows users to decide the set of properties to be adjusted for pagination and their variation ranges. An application of the algorithm to XSL‐FO is also presented, with an extension of the language that allows users to drive the pagination process. The tool, named FOP+, is a customized version of the open‐source Apache Formatting Objects Processor formatter. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
74.
In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider planar triangulations, planar graphs and k-page graphs) to support various label queries efficiently. The additional space cost to store the labels is essentially the information-theoretic minimum. As far as we know, our representations are the first succinct representations of labeled graphs. We also have two preliminary results to achieve the main contribution. First, we design a succinct representation of unlabeled planar triangulations to support the rank/select of edges in ccw (counter clockwise) order in addition to the other operations supported in previous work. Second, we design a succinct representation for a k-page graph when k is large to support various navigational operations more efficiently. In particular, we can test the adjacency of two vertices in O(lg?k) time, while previous work uses O(k) time. 相似文献
75.
C.C. Pavel D. Vuono P. De Luca N. Bilba J. B.Nagy A. Nastro 《Microporous and mesoporous materials》2005,80(1-3):263-268
Phosphorus containing ET(P)S-4 and ET(P)S-10 were synthesized from gels of composition xNa2O–0.6KF–0.2TiO2–(1.28 − 4y)xHCl–yP2O5–1.49SiO2–39.5H2O at 190 °C for 3 days. The XRD patterns are almost identical to the corresponding ETS samples. The presence of phosphorus in the initial gel influences the kinetic parameters of the crystallization process, the morphology and the size of the crystals. The 31P-NMR of the samples show that part of the phosphorus is attached at the siliceous surface as dihydrogenophosphate SiOPO(OH)2 groups and cannot be introduced in a tetrahedral or octahedral framework position. 相似文献
76.
We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central aim of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties. 相似文献
77.
Algorithms for Moving Objects Databases 总被引:8,自引:0,他引:8
78.
Although Tau and MAP2 readily assemble into straight filaments (SFs), Tau's unique ability to form paired-helical filaments (PHFs) may offer clues as to why Tau's microtubule-binding region (MTBR) is the exclusive building block of the neurofibrillary tangles that accumulate during Alzheimer's disease. To learn more about the factors permitting Tau to form both SFs and PHFs, we investigated the microtubule binding, thiol oxidation, and polymerization reactions of the monomer and dimer forms of Tau and MAP2 MTBRs. This review focuses on electron microscopic evidence (1) that facilitated the identification of amino acid residues within 3-repeat Tau that promote PHF formation; and (2) provided experimental evidence for the polymerization of S-glutathionylated three-repeat Tau, a reaction that unambiguously demonstrates that disulfide-linked Tau-S-S-Tau dimer formation is not a compulsory step in filament assembly. We also consider these findings within the context of current views on the genetic and biochemical basis of Tau fibrillogenesis. 相似文献
79.
Luca Dall’Asta Ignacio Alvarez-Hamelin Alain Barrat Alexei Vázquez Alessandro Vespignani 《Theoretical computer science》2006
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. In this paper, we explore these biases and provide a statistical analysis of their origin. We derive an analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular, we find that the edge and vertex detection probability depends on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with broad distributions of connectivity. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in network models with different topologies. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. Moreover, we characterize the level of redundancy and completeness of the exploration process as a function of the topological properties of the network. Finally, we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployements of probing sources. The results might hint the steps toward more efficient mapping strategies. 相似文献
80.
The generation of realistic spatio-temporal trajectories of human mobility is of fundamental importance in a wide range of applications, such as the developing of protocols for mobile ad-hoc networks or what-if analysis in urban ecosystems. Current generative algorithms fail in accurately reproducing the individuals’ recurrent schedules and at the same time in accounting for the possibility that individuals may break the routine during periods of variable duration. In this article we present Ditras (DIary-based TRAjectory Simulator), a framework to simulate the spatio-temporal patterns of human mobility. Ditras operates in two steps: the generation of a mobility diary and the translation of the mobility diary into a mobility trajectory. We propose a data-driven algorithm which constructs a diary generator from real data, capturing the tendency of individuals to follow or break their routine. We also propose a trajectory generator based on the concept of preferential exploration and preferential return. We instantiate Ditras with the proposed diary and trajectory generators and compare the resulting algorithm with real data and synthetic data produced by other generative algorithms, built by instantiating Ditras with several combinations of diary and trajectory generators. We show that the proposed algorithm reproduces the statistical properties of real trajectories in the most accurate way, making a step forward the understanding of the origin of the spatio-temporal patterns of human mobility. 相似文献