全文获取类型
收费全文 | 1570篇 |
免费 | 172篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 16篇 |
综合类 | 2篇 |
化学工业 | 470篇 |
金属工艺 | 17篇 |
机械仪表 | 40篇 |
建筑科学 | 59篇 |
矿业工程 | 2篇 |
能源动力 | 69篇 |
轻工业 | 280篇 |
水利工程 | 22篇 |
石油天然气 | 6篇 |
无线电 | 106篇 |
一般工业技术 | 214篇 |
冶金工业 | 78篇 |
原子能技术 | 4篇 |
自动化技术 | 361篇 |
出版年
2024年 | 10篇 |
2023年 | 27篇 |
2022年 | 80篇 |
2021年 | 107篇 |
2020年 | 62篇 |
2019年 | 78篇 |
2018年 | 87篇 |
2017年 | 87篇 |
2016年 | 108篇 |
2015年 | 64篇 |
2014年 | 88篇 |
2013年 | 138篇 |
2012年 | 108篇 |
2011年 | 145篇 |
2010年 | 73篇 |
2009年 | 71篇 |
2008年 | 77篇 |
2007年 | 63篇 |
2006年 | 57篇 |
2005年 | 40篇 |
2004年 | 28篇 |
2003年 | 21篇 |
2002年 | 32篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1990年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1981年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1746条查询结果,搜索用时 46 毫秒
21.
22.
Josiele S. Teixeira Diego C. Knupp Antônio J. Silva Neto 《Inverse Problems in Science & Engineering》2017,25(6):909-935
The present work addresses the problem of structural damage identification built on the statistical inversion approach. Here, the damage state of the structure is continuously described by a cohesion parameter, which is spatially discretized by the finite element method. The inverse problem of damage identification is then posed as the determination of the posterior probability densities of the nodal cohesion parameters. The Markov Chain Monte Carlo method, implemented with the Metropolis–Hastings algorithm, is considered in order to approximate the posterior probabilities by drawing samples from the desired joint posterior probability density function. With this approach, prior information on the sought parameters can be used and the uncertainty concerning the known values of the material properties can be quantified in the estimation of the cohesion parameters. The assessment of the proposed approach has been performed by means of numerical simulations on a simply supported Euler–Bernoulli beam. The damage identification and assessment are performed considering time domain response data. Different damage scenarios and noise levels were addressed, demonstrating the feasibility of the proposed approach. 相似文献
23.
Aitor Almeida Pablo Orduña Eduardo Castillejo Diego López-de-Ipiña Marcos Sacristán 《Personal and Ubiquitous Computing》2011,15(4):419-429
As the dependence on mobile devices increases, the need for supporting a wider range of users and devices becomes crucial.
Elders and people with disabilities adopt new technologies reluctantly, a tendency caused by the lack of adaptation of these
technologies to their needs. To address this challenge, this paper describes a framework, Imhotep, whose aim is to aid developers
in the accessible application creation process, making the creation of user-centered applications easier and faster. Our framework
allows to easily adapt the applications to the constraints imposed by the user capabilities (sensorial, cognitive, and physical
capabilities) and device capabilities by providing a repository that will manage the compilation and deployment of applications
that include a set of preprocessor directives in the source code. These directives are enhanced with concepts that are automatically
adjusted to the current trends of mobile devices by using a Fuzzy Knowledge-Eliciting Reasoner. Our final goal is to increase
the number of applications targeted to elders and people with disabilities providing tools that facilitate their development.
The paper also describes the evaluation of both the accuracy of the fuzzy terms generated for mobile devices and the usability
of the proposed platform. 相似文献
24.
This paper examines the role played by feedforward in model predictive control (MPC). We contrast feedforward with preview action. The latter is standard in model predictive control, whereas feedforward has been rarely, if ever, used in contemporary formulations of MPC. We argue that feedforward can significantly improve performance in the presence of measurement noise and certain types of model uncertainty. 相似文献
25.
26.
Diego Castaño José Patricio Díaz Varela Antoni Torrens 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(7):1449-1455
In this paper, we show that free algebras in the variety of residuated lattices and some of its subvarieties are directly
indecomposable and show, as a consequence, the direct indecomposability of free algebras for some classes of their bounded
implicative subreducts. 相似文献
27.
Gonzalez Hector Han Jiawei Cheng Hong Li Xiaolei Klabjan Diego Wu Tianyi 《Knowledge and Data Engineering, IEEE Transactions on》2010,22(1):90-104
Massive Radio Frequency Identification (RFID) data sets are expected to become commonplace in supply chain management systems. Warehousing and mining this data is an essential problem with great potential benefits for inventory management, object tracking, and product procurement processes. Since RFID tags can be used to identify each individual item, enormous amounts of location-tracking data are generated. With such data, object movements can be modeled by movement graphs, where nodes correspond to locations and edges record the history of item transitions between locations. In this study, we develop a movement graph model as a compact representation of RFID data sets. Since spatiotemporal as well as item information can be associated with the objects in such a model, the movement graph can be huge, complex, and multidimensional in nature. We show that such a graph can be better organized around gateway nodes, which serve as bridges connecting different regions of the movement graph. A graph-based object movement cube can be constructed by merging and collapsing nodes and edges according to an application-oriented topological structure. Moreover, we propose an efficient cubing algorithm that performs simultaneous aggregation of both spatiotemporal and item dimensions on a partitioned movement graph, guided by such a topological structure. 相似文献
28.
Mitsuo Takaki Diego Cavalcanti Rohit Gheyi Juliano Iyoda Marcelo d’Amorim Ricardo B. C. Prudêncio 《Innovations in Systems and Software Engineering》2010,6(3):243-253
The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver. 相似文献
29.
30.
Diego Salas-Gonzalez Ercan E. Kuruoglu 《Computational statistics & data analysis》2009,53(5):1535-1546
DNA microarray has been recognized as being an important tool for studying the expression of thousands of genes simultaneously. These experiments allow us to compare two different samples of cDNA obtained under different conditions. A novel method for the analysis of replicated microarray experiments based upon the modelling of gene expression distribution as a mixture of α-stable distributions is presented. Some features of the distribution of gene expression, such as Pareto tails and the fact that the variance of any given array increases concomitantly with an increase in the number of genes studied, suggest the possibility of modelling gene expression distribution on the basis of α-stable density. The proposed methodology uses very well known properties of α-stable distribution, such as the scale mixture of normals. A Bayesian log-posterior odds is calculated, which allows us to decide whether a gene is expressed differentially or not. The proposed methodology is illustrated using simulated and experimental data and the results are compared with other existing statistical approaches. The proposed heavy-tail model improves the performance of other distributions and is easily applicable to microarray gene data, specially if the dataset contains outliers or presents high variance between replicates. 相似文献