全文获取类型
收费全文 | 739篇 |
免费 | 37篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 778篇 |
出版年
2024年 | 1篇 |
2023年 | 15篇 |
2022年 | 43篇 |
2021年 | 48篇 |
2020年 | 28篇 |
2019年 | 24篇 |
2018年 | 33篇 |
2017年 | 21篇 |
2016年 | 34篇 |
2015年 | 25篇 |
2014年 | 33篇 |
2013年 | 54篇 |
2012年 | 68篇 |
2011年 | 69篇 |
2010年 | 46篇 |
2009年 | 54篇 |
2008年 | 39篇 |
2007年 | 34篇 |
2006年 | 16篇 |
2005年 | 21篇 |
2004年 | 12篇 |
2003年 | 9篇 |
2002年 | 14篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有778条查询结果,搜索用时 15 毫秒
11.
12.
With the continually increasing complexity of e-learning environments, there is a need for integrating concepts of cognitive load theory (CLT) with concepts of human–computer interaction (HCI). Basic concepts of both fields were reviewed and contrasted. A literature review was conducted within the literature database “The Guide to Computing Literature,” searching for “cognitive load theory” and “Sweller.” Sixty-five publications contained “cognitive load” in their titles or abstracts. Each publication was checked to see whether it contained the concepts of intrinsic, extraneous, or germane cognitive load. The review showed that CLT concepts have been adopted in HCI. However, the concept of germane cognitive load has attracted less attention up to the present time. Two conceptual models are proposed. The first model divides extraneous cognitive load into load induced by the instructional design and load caused by software usage. The model clarifies the focus of traditional usability principles and of existing instructional design principles derived from CLT. The second model fits CLT concepts into the basic components of user-centered design. The concept of germane cognitive load illustrates that an increase of cognitive load can be desirable when designing e-learning environments. Areas for future interdisciplinary research are sketched. 相似文献
13.
F. Foscarini G. Bellocchi R. Confalonieri Cristian Savini G. Van den Eede 《Environmental Modelling & Software》2010,25(10):1256-1260
This work addresses the sensitivity analysis on the settings of fuzzy inference systems where multiple, yet dissimilar inputs are aggregated and resolved into a single output. The JAVA platform-independent development environment DANA (Data Analysis aNd Assessment) includes components for computation of fuzzy-logic based rules guiding the fuzzification–aggregation–defuzzification process by alternative membership functions (of an input to belong to fuzzy sets) and weighing systems, and unlimited aggregation levels. The integration of the library for sensitivity analysis SimLab within DANA is illustrated using the Morris screening method to determine the relative importance ranking of fuzzy settings (lower and upper limits, weights) on the final defuzzified output. The assumptions about the settings of the analysis are also discussed using an illustrative example where sensitivity analysis is applied to the fuzzy inference system designed to evaluate analytical methods in the domain of genetically modified organisms. 相似文献
14.
Pablo Irarrazaval Carlos Lizama Vicente Parot Carlos Sing-Long Cristian Tejos 《Computers & Mathematics with Applications》2011,62(3):1576-1590
The fractional Fourier transform (FrFT) is revisited in the framework of strongly continuous periodic semigroups to restate known results and to explore new properties of the FrFT. We then show how the FrFT can be used to reconstruct Magnetic Resonance (MR) images acquired under the presence of quadratic field inhomogeneity. Particularly, we prove that the order of the FrFT is a measure of the distortion in the reconstructed signal. Moreover, we give a dynamic interpretation to the order as time evolution of a function. We also introduce the notion of ρ-α space as an extension of the Fourier or k-space in MR, and we use it to study the distortions introduced in two common MR acquisition strategies. We formulate the reconstruction problem in the context of the FrFT and show how the semigroup theory allows us to find new reconstruction formulas for discrete sampled signals. Finally, the results are supplemented with numerical examples that show how it performs in a standard 1D MR signal reconstruction. 相似文献
15.
16.
Huth J Buchholz M Kraus JM Mølhave K Gradinaru C v Wichert G Gress TM Neumann H Kestler HA 《Computer methods and programs in biomedicine》2011,104(2):227-234
The direct observation of cells over time using time-lapse microscopy can provide deep insights into many important biological processes. Reliable analyses of motility, proliferation, invasive potential or mortality of cells are essential to many studies involving live cell imaging and can aid in biomarker discovery and diagnostic decisions. Given the vast amount of image- and time-series data produced by modern microscopes, automated analysis is a key feature to capitalize the potential of time-lapse imaging devices. To provide fast and reproducible analyses of multiple aspects of cell behaviour, we developed TimeLapseAnalyzer. Apart from general purpose image enhancements and segmentation procedures, this extensible, self-contained, modular cross-platform package provides dedicated modalities for fast and reliable analysis of multi-target cell tracking, scratch wound healing analysis, cell counting and tube formation analysis in high throughput screening of live-cell experiments. TimeLapseAnalyzer is freely available (MATLAB, Open Source) at http://www.informatik.uni-ulm.de/ni/mitarbeiter/HKestler/tla. 相似文献
17.
About the Collatz conjecture 总被引:1,自引:0,他引:1
This paper refers to the Collatz conjecture. The origin and the formalization of the Collatz problem are presented in the
first section, named “Introduction”. In the second section, entitled “Properties of the Collatz function”, we treat mainly
the bijectivity of the Collatz function. Using the obtained results, we construct a (set of) binary tree(s) which “simulate(s)”–
in a way that will be specified – the computations of the values of the Collatz function. In the third section, we give an
“efficient” algorithm for computing the number of iterations (recursive calls) of the Collatz function. A comparison between
our algorithm and the standard one is also presented, the first being at least 2.25 “faster” (3.00 in medium). Finally, we
describe a class of natural numbers for which the conjecture is true.
Received 28 April 1997 / 10 June 1997 相似文献
18.
19.
The authors’ work on lobster fishery in Chile is summarized in this paper. The paper presents the formulation and algorithmic resolution of a two-stage stochastic nonlinear programming model with recourse. The proposed model considers a long-term planning horizon and specifically allows an optimal total allowable catch quota to be obtained for the first planning period. This model takes into account biomass dynamics, the conditions guaranteeing sustained species management and uncertain parameters such as growth rate and species carrying capacity. These parameters are explicitly incorporated via a discrete random variable (scenarios). The proposed model is solved by Lagrangian decomposition using the algebraic modeling software AMPL, in combination with the solver MINOS to solve the nonlinear models resulting from the scenario decomposition. The article also presents the results obtained with this methodology and the conclusions drawn from the work. 相似文献
20.
Improving scientific application execution on android mobile devices via code refactorings 下载免费PDF全文
The increasing number of mobile devices with ever‐growing capabilities makes them useful for running scientific applications. However, these applications have high computational demands, whereas mobile devices have limited capabilities when compared with non‐mobile devices. More importantly, mobile devices rely on batteries for their power supply. We initially measure the battery consumption of different versions of known micro‐benchmarks representing common programming primitives found in scientific applications. Then, we analyze the performance of such micro‐benchmarks in CPU‐intensive mobile applications. We apply good programming practices and code refactorings to reduce battery consumption of scientific mobile applications. Our results show the reduction in energy usage from applying these refactorings to three scientific applications, and we consequently propose guidelines for high‐performance computing applications. Our focus is on Android, the dominant mobile operating system. As a long‐term contribution, our results represent one more step in the progress towards hybrid distributed infrastructures comprising fixed and mobile nodes, that is, the so‐called mobile grids. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献