全文获取类型
收费全文 | 427篇 |
免费 | 30篇 |
国内免费 | 3篇 |
学科分类
工业技术 | 460篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 14篇 |
2020年 | 12篇 |
2019年 | 5篇 |
2018年 | 17篇 |
2017年 | 14篇 |
2016年 | 8篇 |
2015年 | 12篇 |
2014年 | 19篇 |
2013年 | 34篇 |
2012年 | 36篇 |
2011年 | 44篇 |
2010年 | 19篇 |
2009年 | 24篇 |
2008年 | 26篇 |
2007年 | 17篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2003年 | 12篇 |
2002年 | 11篇 |
2001年 | 9篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1995年 | 2篇 |
1994年 | 8篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 5篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1958年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有460条查询结果,搜索用时 15 毫秒
1.
As far as flocculation is concerned, the agglomeration of suspended particles into flocs is highly linked to the hydraulic behaviour of the agitation. The Turbomix is a special design of mixing tank; its design was developed to better control the flow during the flocculation stage. It enables a significant decrease in footprint of the process. The combination of the Turbomix and ballasted flocculation has been studied during pilot trials in terms of treatment efficiency. Its controlled hydraulic behaviour explains the efficiency of the process as proved by CFD investigation. 相似文献
2.
The UK's vast marine energy resource is mostly located in remote areas west and north of Scotland, and transmission of this energy to the mainland will be required. This may be achieved by using this ‘stranded’ power to generate hydrogen electrolytically, which may in turn be stored or transported using sponge iron technology. This paper reviews the technology and research needed to bring such a process on stream. We propose utilising techniques that have been developed for the oxygen carriers used in chemical looping, and also those used in early processes for hydrogen generation in the chemical industry. We briefly outline the design requirements for an energy efficient sponge iron plant. It is shown that the iron sponge system presents better energy efficiencies than alternative forms of bulk storage such as liquid hydrogen, magnesium hydride slurry, some at least of the metal hydrides, or methylcyclohexane–toluene–hydrogen, provided that requirements can be met for particle durability and reactivity. 相似文献
3.
YM Graus JJ Verschuuren NA Bos PJ van Breda Vriesman MH De Baets 《Canadian Metallurgical Quarterly》1993,43(1-2):113-124
The immunoglobulin heavy chain (VH) gene family usage in experimental autoimmune myasthenia gravis (EAMG) model was investigated by RNA slot blot hybridization using VH gene family specific probes. Anti-acetylcholine receptor (AChR) monoclonal antibodies (mAbs) isolated from susceptible C57BL/6 and resistant BALB/c mice were found to be encoded by VH genes from at least six different families. The Vgam3.8 family was overrepresented in alpha-bungarotoxin blocking mAbs. Expression of cross-reactive idiotypes by anti-AChR mAbs was irrespective of the VH gene family usage. Strain dependent differences in susceptibility for EAMG were not reflected in an aberrant VH gene family usage of anti-AChR mAbs. 相似文献
4.
Dominic D. J. Chandar Jayanarayanan Sitaraman Dimitri Mavriplis 《The Journal of supercomputing》2014,67(1):47-68
The application of graphics processing units (GPU) to solve partial differential equations is gaining popularity with the advent of improved computer hardware. Various lower level interfaces exist that allow the user to access GPU specific functions. One such interface is NVIDIA’s Compute Unified Device Architecture (CUDA) library. However, porting existing codes to run on the GPU requires the user to write kernels that execute on multiple cores, in the form of Single Instruction Multiple Data (SIMD). In the present work, a higher level framework, termed CU++, has been developed that uses object oriented programming techniques available in C++ such as polymorphism, operator overloading, and template meta programming. Using this approach, CUDA kernels can be generated automatically during compile time. Briefly, CU++ allows a code developer with just C/C++ knowledge to write computer programs that will execute on the GPU without any knowledge of specific programming techniques in CUDA. This approach is tremendously beneficial for Computational Fluid Dynamics (CFD) code development because it mitigates the necessity of creating hundreds of GPU kernels for various purposes. In its current form, CU++ provides a framework for parallel array arithmetic, simplified data structures to interface with the GPU, and smart array indexing. An implementation of heterogeneous parallelism, i.e., utilizing multiple GPUs to simultaneously process a partitioned grid system with communication at the interfaces using Message Passing Interface (MPI) has been developed and tested. 相似文献
5.
Retrograde densification of pelletized calcines and glasses having an approximate (Bi,Pb)2 Sr2 Ca2 Cu3 O10 starting stoichiometry and sintered at ∼850°C can be described by first-order rate equations. Retrograde densification in the calcine precursors was largely due to the development of open pores, and was approximately proportional to the concentration of the (Bi,Pb)2 Sr2 CaCu3 O10 phase. In the glasses, retrograde densification is mainly caused by porosity accompanying the growth of a needlelike Sr─Ca─Cu─O phase, together with (Bi,Pb)2 Sr2 Ca2 Cu3 O10 and (Bi,Pb)2 Sr2 CaCu2 O8 . 相似文献
6.
Analytical and numerical investigation of the stiffness matrix for edge‐cracked circular shafts 下载免费PDF全文
Y. Li S. Cao R. Dimitri N. Fantuzzi F. Tornabene 《Fatigue & Fracture of Engineering Materials & Structures》2017,40(3):391-411
This paper examines two engineering methods of evaluating the stress intensity factors for cracked beams and bars subjected to a combined loading and proposes innovative formulations, as far as the circular cross section is concerned. Based on the definition of the stress intensity factors, the compliance matrix is determined as the inverse of the stiffness matrix, modelling the cracked section of a beam through a line‐spring approximation with interactive forces computed within fracture mechanics. A comparative evaluation of numerical predictions based on the proposed methods is also performed with methods available from the literature. Results for free vibration analyses of beams with transverse non‐propagating open cracks are presented and compared in order to estimate the accuracy and efficiency of the proposed methods, where a good agreement is generally found. More specifically, two different coupling effects are herein analysed for circular beams subjected to a combined bending, axial and shear loading, first, and a combined bending, shear and torsion loading, subsequently. 相似文献
7.
High Conductivity in Molecularly p‐Doped Diketopyrrolopyrrole‐Based Polymer: The Impact of a High Dopant Strength and Good Structural Order 下载免费PDF全文
Yevhen Karpov Tim Erdmann Ivan Raguzin Mahmoud Al‐Hussein Marcus Binner Uwe Lappan Manfred Stamm Kirill L. Gerasimov Tetyana Beryozkina Vasiliy Bakulev Denis V. Anokhin Dimitri A. Ivanov Florian Günther Sibylle Gemming Gotthard Seifert Brigitte Voit Riccardo Di Pietro Anton Kiriy 《Advanced materials (Deerfield Beach, Fla.)》2016,28(28):6003-6010
8.
Surrogate modeling approximation using a mixture of experts based on EM joint estimation 总被引:1,自引:1,他引:0
Dimitri Bettebghor Nathalie Bartoli Stéphane Grihon Joseph Morlier Manuel Samuelides 《Structural and Multidisciplinary Optimization》2011,43(2):243-259
An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and
smooth approximation of discontinuous functions that are to be used in structural optimization problems. It strongly relies
on the Expectation−Maximization (EM) algorithm for Gaussian mixture models (GMM). To the end of regression, the inputs are
clustered together with their output values by means of parameter estimation of the joint distribution. A local expert is
then built (linear, quadratic, artificial neural network, moving least squares) on each cluster. Lastly, the local experts
are combined using the Gaussian mixture model parameters found by the EM algorithm to obtain a global model. This method is
tested over both mathematical test cases and an engineering optimization problem from aeronautics and is found to improve
the accuracy of the approximation. 相似文献
9.
Approximate policy iteration: a survey and some new methods 总被引:2,自引:0,他引:2
Dimitri P. BERTSEKAS 《控制理论与应用(英文版)》2011,9(3):310-335
We consider the classical policy iteration method of dynamic programming(DP),where approximations and simulation are used to deal with the curse of dimensionality.We survey a number of issues:convergence and rate of convergence of approximate policy evaluation methods,singularity and susceptibility to simulation noise of policy evaluation,exploration issues,constrained and enhanced policy iteration,policy oscillation and chattering,and optimistic and distributed policy iteration.Our discussion of policy evaluation is couched in general terms and aims to unify the available methods in the light of recent research developments and to compare the two main policy evaluation approaches:projected equations and temporal differences(TD),and aggregation.In the context of these approaches,we survey two different types of simulation-based algorithms:matrix inversion methods,such as least-squares temporal difference(LSTD),and iterative methods,such as least-squares policy evaluation(LSPE) and TD(λ),and their scaled variants.We discuss a recent method,based on regression and regularization,which recti?es the unreliability of LSTD for nearly singular projected Bellman equations.An iterative version of this method belongs to the LSPE class of methods and provides the connecting link between LSTD and LSPE.Our discussion of policy improvement focuses on the role of policy oscillation and its effect on performance guarantees.We illustrate that policy evaluation when done by the projected equation/TD approach may lead to policy oscillation,but when done by aggregation it does not.This implies better error bounds and more regular performance for aggregation,at the expense of some loss of generality in cost function representation capability.Hard aggregation provides the connecting link between projected equation/TD-based and aggregation-based policy evaluation,and is characterized by favorable error bounds. 相似文献
10.
Xiaoying Wu Dimitri Theodoratos Calisto Zuzarte 《The VLDB Journal The International Journal on Very Large Data Bases》2010,19(5):661-686
The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also
the only option for a number of important XML applications. Unfortunately, existing algorithms focus almost exclusively on
tree-pattern queries (TPQs). Requirements for flexible querying of XML data have motivated recently the introduction of query
languages that are more general and flexible than TPQs. These languages are not supported by existing algorithms. In this
paper, we consider a partial tree-pattern query (PTPQ) language which generalizes and strictly contains TPQs. PTPQs can express
a fragment of XPath which comprises reverse axes and the node identity equality (is) operator, in addition to forward axes, wildcards and predicates. They constitute an important subclass of XPath, which is
very useful in practice. Unfortunately, previous streaming algorithms for TPQs cannot be applied to PTPQs. PTPQs can be represented
as dags enhanced with constraints. We explore this representation to design an original polynomial time streaming algorithm
for PTPQs. Our algorithm aggressively filters incoming data that is irrelevant to the query and wisely avoids processing redundant
query matches (i.e., matches of the query dag that do not contribute to new solutions). Our algorithm is the first one to
support the streaming evaluation of such a broad fragment of XPath. We provide an analysis of it, and conduct an extensive
experimental evaluation of its performance and scalability. Compared to the only known streaming algorithm that supports TPQs
extended with reverse axes, our algorithm performs better by orders of magnitude while consuming a much smaller fraction of
memory space. Current streaming applications have stringent requirements on query response time and memory consumption because
of the large (possibly unbounded) size of data they handle. In order to keep memory usage and CPU consumption low for the
PTPQ streaming evaluation, we design another streaming algorithm called Eager PSX for PTPQs. Its key feature is that it applies an eager evaluation strategy to quickly determine when node matches should
be returned as solutions to the user and also to proactively detect redundant matches. We theoretically analyze Eager PSX, and experimentally test its time and space performance and scalability. We compare it with PSX. Our results show that Eager PSX not only achieves better space performance without compromising time performance, but it also greatly improves query response
time for both simple and complex queries, in many cases, by orders of magnitude. 相似文献