全文获取类型
收费全文 | 1226篇 |
免费 | 109篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 18篇 |
化学工业 | 349篇 |
金属工艺 | 25篇 |
机械仪表 | 39篇 |
建筑科学 | 29篇 |
矿业工程 | 1篇 |
能源动力 | 64篇 |
轻工业 | 143篇 |
水利工程 | 8篇 |
石油天然气 | 3篇 |
无线电 | 99篇 |
一般工业技术 | 225篇 |
冶金工业 | 52篇 |
原子能技术 | 4篇 |
自动化技术 | 278篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 79篇 |
2021年 | 78篇 |
2020年 | 38篇 |
2019年 | 66篇 |
2018年 | 55篇 |
2017年 | 61篇 |
2016年 | 64篇 |
2015年 | 48篇 |
2014年 | 47篇 |
2013年 | 84篇 |
2012年 | 93篇 |
2011年 | 103篇 |
2010年 | 77篇 |
2009年 | 77篇 |
2008年 | 66篇 |
2007年 | 65篇 |
2006年 | 32篇 |
2005年 | 29篇 |
2004年 | 28篇 |
2003年 | 16篇 |
2002年 | 14篇 |
2001年 | 11篇 |
2000年 | 3篇 |
1999年 | 10篇 |
1998年 | 13篇 |
1997年 | 5篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1337条查询结果,搜索用时 15 毫秒
31.
Insight into In Situ Amphiphilic Functionalization of Few‐Layered Transition Metal Dichalcogenide Nanosheets
下载免费PDF全文
![点击此处可从《Advanced materials (Deerfield Beach, Fla.)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
32.
33.
We provide a discussion of bounded rationality learning behind traditional learning mechanisms, i.e., Recursive Ordinary Least Squares and Bayesian Learning . These mechanisms lack for many reasons a behavioral interpretation and, following the Simon criticism, they appear to be substantively rational. In this paper, analyzing the Cagan model, we explore two learning mechanisms which appear to be more plausible from a behavioral point of view and somehow procedurally rational: Least Mean Squares learning for linear models and Back Propagation for Artificial Neural Networks . The two algorithms look for a minimum of the variance of the error forecasting by means of a steepest descent gradient procedure. The analysis of the Cagan model shows an interesting result: non-convergence of learning to the Rational Expectations Equilibrium is not due to the restriction to linear learning devices; also Back Propagation learning for Artificial Neural Networks may fail to converge to the Rational Expectations Equilibrium of the model. 相似文献
34.
Leonardo Trujillo 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(8):1551-1567
Genetic programming (GP) is one of the most widely used paradigms of evolutionary computation due to its ability to automatically
synthesize computer programs and mathematical expressions. However, because GP uses a variable length representation, the
individuals within the evolving population tend to grow rapidly without a corresponding return in fitness improvement, a phenomenon
known as bloat. In this paper, we present a simple bloat control strategy for standard tree-based GP that achieves a one order
of magnitude reduction in bloat when compared with standard GP on benchmark tests, and practically eliminates bloat on two
real-world problems. Our proposal is to substitute standard subtree crossover with the one-point crossover (OPX) developed
by Poli and Langdon (Second online world conference on soft computing in engineering design and manufacturing, Springer, Berlin
(1997)), while maintaining all other GP aspects standard, particularly subtree mutation. OPX was proposed for theoretical purposes
related to GP schema theorems, however since it curtails exploration during the search it has never achieved widespread use.
In our results, on the other hand, we are able to show that OPX can indeed perform an effective search if it is coupled with
subtree mutation, thus combining the bloat control capabilities of OPX with the exploration provided by standard mutation. 相似文献
35.
Context
It is important for Product Line Architectures (PLA) to remain stable accommodating evolutionary changes of stakeholder’s requirements. Otherwise, architectural modifications may have to be propagated to products of a product line, thereby increasing maintenance costs. A key challenge is that several features are likely to exert a crosscutting impact on the PLA decomposition, thereby making it more difficult to preserve its stability in the presence of changes. Some researchers claim that the use of aspects can ameliorate instabilities caused by changes in crosscutting features. Hence, it is important to understand which aspect-oriented (AO) and non-aspect-oriented techniques better cope with PLA stability through evolution.Objective
This paper evaluates the positive and negative change impact of component and aspect based design on PLAs. The objective of the evaluation is to assess how aspects and components promote PLA stability in the presence of various types of evolutionary change. To support a broader analysis, we also evaluate the PLA stability of a hybrid approach (i.e. combined use of aspects and components) against the isolated use of component-based, OO, and AO approaches.Method
An quantitative and qualitative analysis of PLA stability which involved four different implementations of a PLA: (i) an OO implementation, (ii) an AO implementation, (iii) a component-based implementation, and (iv) a hybrid implementation where both components and aspects are employed. Each implementation has eight releases and they are functionally equivalent. We used conventional metrics suites for change impact and modularity to measure the architecture stability evaluation of the 4 implementations.Results
The combination of aspects and components promotes superior PLA resilience than the other PLAs in most of the circumstances.Conclusion
It is concluded that the combination of aspects and components supports the design of high cohesive and loosely coupled PLAs. It also contributes to improve modularity by untangling feature implementation. 相似文献36.
This paper presents a systematic approach for decreasing conservativeness in stability analysis and control design for Takagi-Sugeno (TS) systems. This approach is based on the idea of multiple Lyapunov functions together with simple techniques for introducing slack matrices. Unlike some previous approaches based on multiple Lyapunov functions, both the stability and the stabilization conditions are written as linear matrix inequality (LMI) problems. The proposed approach reduces the number of inequalities and guarantees extra degrees of freedom to the LMI problems. Numeric examples illustrate the effectiveness of this method. 相似文献
37.
The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high‐resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well‐suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high‐quality soft shadows and dynamic lights moving on fixed‐trajectories. 相似文献
38.
Rodrigo Queiroz Leonardo Passos Marco Tulio Valente Claus Hunsen Sven Apel Krzysztof Czarnecki 《Software and Systems Modeling》2017,16(1):77-96
Feature annotations (e.g., code fragments guarded by #ifdef C-preprocessor directives) control code extensions related to features. Feature annotations have long been said to be undesirable. When maintaining features that control many annotations, there is a high risk of ripple effects. Also, excessive use of feature annotations leads to code clutter, hinder program comprehension and harden maintenance. To prevent such problems, developers should monitor the use of feature annotations, for example, by setting acceptable thresholds. Interestingly, little is known about how to extract thresholds in practice, and which values are representative for feature-related metrics. To address this issue, we analyze the statistical distribution of three feature-related metrics collected from a corpus of 20 well-known and long-lived C-preprocessor-based systems from different domains. We consider three metrics: scattering degree of feature constants, tangling degree of feature expressions, and nesting depth of preprocessor annotations. Our findings show that feature scattering is highly skewed; in 14 systems (70 %), the scattering distributions match a power law, making averages and standard deviations unreliable limits. Regarding tangling and nesting, the values tend to follow a uniform distribution; although outliers exist, they have little impact on the mean, suggesting that central statistics measures are reliable thresholds for tangling and nesting. Following our findings, we then propose thresholds from our benchmark data, as a basis for further investigations. 相似文献
39.
J.M. Badia J.L. Movilla J.I. Climente M. Castillo M. Marqués R. Mayo E.S. Quintana-Ortí J. Planelles 《Computer Physics Communications》2011,182(2):533-539
We present a Fortran library which can be used to solve large-scale dense linear systems, Ax=b. The library is based on the LU decomposition included in the parallel linear algebra library PLAPACK and on its out-of-core extension POOCLAPACK. The library is complemented with a code which calculates the self-polarization charges and self-energy potential of axially symmetric nanostructures, following an induced charge computation method. Illustrative calculations are provided for hybrid semiconductor–quasi-metal zero-dimensional nanostructures. In these systems, the numerical integration of the self-polarization equations requires using a very fine mesh. This translates into very large and dense linear systems, which we solve for ranks up to 3×105. It is shown that the self-energy potential on the semiconductor–metal interface has important effects on the electronic wavefunction.
Program summary
Program title: HDSS (Huge Dense System Solver)Catalogue identifier: AEHU_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHU_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 98 889No. of bytes in distributed program, including test data, etc.: 1 009 622Distribution format: tar.gzProgramming language: Fortran 90, CComputer: Parallel architectures: multiprocessors, computer clustersOperating system: Linux/UnixHas the code been vectorized or parallelized?: Yes. 4 processors used in the sample tests; tested from 1 to 288 processorsRAM: 2 GB for the sample tests; tested for up to 80 GBClassification: 7.3External routines: MPI, BLAS, PLAPACK, POOCLAPACK. PLAPACK and POOCLAPACK are included in the distribution file.Nature of problem: Huge scale dense systems of linear equations, Ax=B, beyond standard LAPACK capabilities. Application to calculations of self-energy potential in dielectrically mismatched semiconductor quantum dots.Solution method: The linear systems are solved by means of parallelized routines based on the LU factorization, using efficient secondary storage algorithms when the available main memory is insufficient. The self-energy solver relies on an induced charge computation method. The differential equation is discretized to yield linear systems of equations, which we then solve by calling the HDSS library.Restrictions: Simple precision. For the self-energy solver, axially symmetric systems must be considered.Running time: About 32 minutes to solve a system with approximately 100 000 equations and more than 6000 right-hand side vectors using a four-node commodity cluster with a total of 32 Intel cores. 相似文献40.
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks 总被引:2,自引:0,他引:2
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience and storage. Further, even though conventional public key and elliptic curve cryptosystems are computationally feasible on sensor nodes, protocols based on them are not, as they require the exchange and storage of large keys and certificates, which is expensive.Using Pairing-Based Cryptography (PBC) protocols parties can agree on keys without any interaction. In this work, we (i) show how security in WSNs can be bootstrapped using an authenticated identity-based non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for 8, 16 and 32-bit processors commonly found in sensor nodes. TinyPBC is able to compute pairings, the most expensive primitive of PBC, in 1.90 s on ATmega128L, 1.27 s on MSP430 and 0.14 s on PXA27x. 相似文献