全文获取类型
收费全文 | 1959篇 |
免费 | 136篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 17篇 |
综合类 | 1篇 |
化学工业 | 428篇 |
金属工艺 | 29篇 |
机械仪表 | 39篇 |
建筑科学 | 147篇 |
矿业工程 | 3篇 |
能源动力 | 91篇 |
轻工业 | 150篇 |
水利工程 | 15篇 |
石油天然气 | 8篇 |
无线电 | 160篇 |
一般工业技术 | 371篇 |
冶金工业 | 199篇 |
原子能技术 | 12篇 |
自动化技术 | 433篇 |
出版年
2023年 | 23篇 |
2022年 | 23篇 |
2021年 | 92篇 |
2020年 | 54篇 |
2019年 | 64篇 |
2018年 | 67篇 |
2017年 | 59篇 |
2016年 | 75篇 |
2015年 | 75篇 |
2014年 | 76篇 |
2013年 | 144篇 |
2012年 | 101篇 |
2011年 | 149篇 |
2010年 | 90篇 |
2009年 | 87篇 |
2008年 | 97篇 |
2007年 | 97篇 |
2006年 | 94篇 |
2005年 | 82篇 |
2004年 | 47篇 |
2003年 | 65篇 |
2002年 | 51篇 |
2001年 | 23篇 |
2000年 | 21篇 |
1999年 | 27篇 |
1998年 | 41篇 |
1997年 | 21篇 |
1996年 | 25篇 |
1995年 | 21篇 |
1994年 | 33篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 15篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 10篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1969年 | 5篇 |
排序方式: 共有2103条查询结果,搜索用时 390 毫秒
61.
Adrian Fernandez Emilio Insfran Silvia Abrahão 《Information and Software Technology》2011,53(8):789-817
Context
In recent years, many usability evaluation methods (UEMs) have been employed to evaluate Web applications. However, many of these applications still do not meet most customers’ usability expectations and many companies have folded as a result of not considering Web usability issues. No studies currently exist with regard to either the use of usability evaluation methods for the Web or the benefits they bring.Objective
The objective of this paper is to summarize the current knowledge that is available as regards the usability evaluation methods (UEMs) that have been employed to evaluate Web applications over the last 14 years.Method
A systematic mapping study was performed to assess the UEMs that have been used by researchers to evaluate Web applications and their relation to the Web development process. Systematic mapping studies are useful for categorizing and summarizing the existing information concerning a research question in an unbiased manner.Results
The results show that around 39% of the papers reviewed reported the use of evaluation methods that had been specifically crafted for the Web. The results also show that the type of method most widely used was that of User Testing. The results identify several research gaps, such as the fact that around 90% of the studies applied evaluations during the implementation phase of the Web application development, which is the most costly phase in which to perform changes. A list of the UEMs that were found is also provided in order to guide novice usability practitioners.Conclusions
From an initial set of 2703 papers, a total of 206 research papers were selected for the mapping study. The results obtained allowed us to reach conclusions concerning the state-of-the-art of UEMs for evaluating Web applications. This allowed us to identify several research gaps, which subsequently provided us with a framework in which new research activities can be more appropriately positioned, and from which useful information for novice usability practitioners can be extracted. 相似文献62.
Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In
case the constraint multipliers are either 0 or
, such cuts are known as
-cuts. It has been proven by Caprara and Fischetti (Math. Program. 74:221–235, 1996) that separation of
-cuts is
-hard.
In this paper, we study ways to separate
-cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The
core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated
-cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the
algorithmic framework.
Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation
is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation
times of state-of-the-art ILP-solvers. 相似文献
63.
Guy Redding Marlon Dumas Arthur H. M. ter Hofstede Adrian Iordachescu 《Service Oriented Computing and Applications》2010,4(3):191-201
Mainstream business process modelling techniques often promote a design paradigm wherein the activities that may be performed
within a case, together with their usual execution order, form the backbone on top of which other aspects are anchored. This
Fordist paradigm, while effective in standardised and production-oriented domains, breaks when confronted with processes in
which case-by-case variations and exceptions are the norm. We contend that the effective design of flexible processes calls
for a substantially different modelling paradigm. Motivated by requirements from the human services domain, we explore the
hypothesis that a framework consisting of a small set of coordination concepts, combined with established object-oriented
modelling principles, provides a suitable foundation for designing highly flexible processes. Several human service delivery
processes have been designed using this framework, and the resulting models have been used to realise a system to support
these processes in a pilot environment. 相似文献
64.
This paper constructs multirate linear multistep time discretizations based on Adams-Bashforth methods. These methods are
aimed at solving conservation laws and allow different timesteps to be used in different parts of the spatial domain. The
proposed family of discretizations is second order accurate in time and has conservation and linear and nonlinear stability
properties under local CFL conditions. Multirate timestepping avoids the necessity to take small global timesteps—restricted
by the largest value of the Courant number on the grid—and therefore results in more efficient computations. Numerical results
obtained for the advection and Burgers’ equations confirm the theoretical findings.
This work was supported by the National Science Foundation through award NSF CCF-0515170. 相似文献
65.
Adrian Blumer Jan Novák Ralf Habel Derek Nowrouzezahrai Wojciech Jarosz 《Computer Graphics Forum》2016,35(7):461-473
Aggregate scattering operators (ASOs) describe the overall scattering behavior of an asset (i.e., an object or volume, or collection thereof) accounting for all orders of its internal scattering. We propose a practical way to precompute and compactly store ASOs and demonstrate their ability to accelerate path tracing. Our approach is modular avoiding costly and inflexible scene‐dependent precomputation. This is achieved by decoupling light transport within and outside of each asset, and precomputing on a per‐asset level. We store the internal transport in a reduced‐dimensional subspace tailored to the structure of the asset geometry, its scattering behavior, and typical illumination conditions, allowing the ASOs to maintain good accuracy with modest memory requirements. The precomputed ASO can be reused across all instances of the asset and across multiple scenes. We augment ASOs with functionality enabling multi‐bounce importance sampling, fast short‐circuiting of complex light paths, and compact caching, while retaining rapid progressive preview rendering. We demonstrate the benefits of our ASOs by efficiently path tracing scenes containing many instances of objects with complex inter‐reflections or multiple scattering. 相似文献
66.
Expedited simulation‐driven design optimization of UWB antennas by means of response features 下载免费PDF全文
In this work, a method for fast design optimization of broadband antennas is considered. The approach is based on a feature‐based optimization (FBO) concept where reflection characteristics of the structure at hand are formulated in terms of suitably defined feature points. Redefinition of the design problem allows for reducing the design optimization cost, because the dependence of feature point coordinates on antenna dimensions is less nonlinear than for the original frequency characteristics (here, S‐parameters). This results in faster convergence of the optimization algorithm. The cost of the design process is further reduced using variable‐fidelity electromagnetic (EM) simulation models. In case of UWB antennas, the feature points are defined, among others, as the levels of the reflection characteristic at its local in‐band maxima, as well as location of the frequency point which corresponds to acceptable reflection around the lower corner frequency within the UWB band. Also, the number of characteristic points depends on antenna topology and its dimensions. Performance of FBO‐based design optimization is demonstrated using two examples of planar UWB antennas. Moreover, the computational cost of the approach is compared with conventional optimization driven by a pattern search algorithm. Experimental validation of the numerical results is also provided. 相似文献
67.
Ayse Tosun Oscar Dieste Davide Fucci Sira Vegas Burak Turhan Hakan Erdogmus Adrian Santos Markku Oivo Kimmo Toro Janne Jarvinen Natalia Juristo 《Empirical Software Engineering》2017,22(6):2763-2805
Existing empirical studies on test-driven development (TDD) report different conclusions about its effects on quality and productivity. Very few of those studies are experiments conducted with software professionals in industry. We aim to analyse the effects of TDD on the external quality of the work done and the productivity of developers in an industrial setting. We conducted an experiment with 24 professionals from three different sites of a software organization. We chose a repeated-measures design, and asked subjects to implement TDD and incremental test last development (ITLD) in two simple tasks and a realistic application close to real-life complexity. To analyse our findings, we applied a repeated-measures general linear model procedure and a linear mixed effects procedure. We did not observe a statistical difference between the quality of the work done by subjects in both treatments. We observed that the subjects are more productive when they implement TDD on a simple task compared to ITLD, but the productivity drops significantly when applying TDD to a complex brownfield task. So, the task complexity significantly obscured the effect of TDD. Further evidence is necessary to conclude whether TDD is better or worse than ITLD in terms of external quality and productivity in an industrial setting. We found that experimental factors such as selection of tasks could dominate the findings in TDD studies. 相似文献
68.
Xiaohui Wang Dion Hoe-Lian Goh Ee-Peng Lim Adrian Wei Liang Vu Alton Yeow Kuan Chua 《International journal of human-computer interaction》2017,33(10):813-821
Within the human computation paradigm, gamification is increasingly gaining interest. This is because an enjoyable experience generated by game features can be a powerful approach to attract participants. Although potentially useful, little research has been conducted into understanding the effectiveness of gamification in human computation. In this experimental study, we operationalized effectiveness as perceived engagement and user acceptance and examined it by comparing the performance of a gamified human computation system against a non-gamified version. We also investigate the determinants of acceptance and how their effects differ between these two systems. Analysis of our data found that participants experienced more engagement and showed higher behavioral intentions toward the gamified system. Moreover, perceived output quality and perceived engagement were significant determinants of acceptance of the gamified system. In contrast, determinants for acceptance of the non-gamified system were perceived output quality and perceived usability. 相似文献
69.
The null controllable set of a system is the largest set of states that can be controlled to the origin. Control systems that have a region of attraction equal to the null controllable set are said to be maximally controllable closed-loop systems. In the case of open-loop unstable plants with amplitude constrained control it is well known that the null controllable set does not cover the entire state-space. Further the combination of input constraints and unstable system dynamics results in a set of state constraints which we call implicit constraints. It is shown that the simple inclusion of implicit constraints in a controller formulation results in a controller that achieves maximal controllability for a class of open-loop unstable systems. 相似文献
70.
Justin Solomon Mirela Ben‐Chen Adrian Butscher Leonidas Guibas 《Computer Graphics Forum》2011,30(2):365-374
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost‐isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently‐developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state‐of‐the‐art methods using the Princeton Segmentation Benchmark. 相似文献