全文获取类型
收费全文 | 5579篇 |
免费 | 440篇 |
国内免费 | 114篇 |
学科分类
工业技术 | 6133篇 |
出版年
2024年 | 17篇 |
2023年 | 93篇 |
2022年 | 168篇 |
2021年 | 220篇 |
2020年 | 177篇 |
2019年 | 173篇 |
2018年 | 220篇 |
2017年 | 203篇 |
2016年 | 237篇 |
2015年 | 215篇 |
2014年 | 234篇 |
2013年 | 430篇 |
2012年 | 331篇 |
2011年 | 420篇 |
2010年 | 343篇 |
2009年 | 340篇 |
2008年 | 281篇 |
2007年 | 238篇 |
2006年 | 236篇 |
2005年 | 187篇 |
2004年 | 128篇 |
2003年 | 146篇 |
2002年 | 193篇 |
2001年 | 140篇 |
2000年 | 107篇 |
1999年 | 60篇 |
1998年 | 88篇 |
1997年 | 65篇 |
1996年 | 55篇 |
1995年 | 60篇 |
1994年 | 51篇 |
1993年 | 37篇 |
1992年 | 22篇 |
1991年 | 8篇 |
1990年 | 16篇 |
1989年 | 9篇 |
1988年 | 14篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 9篇 |
1984年 | 22篇 |
1983年 | 10篇 |
1982年 | 13篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 9篇 |
1976年 | 13篇 |
1975年 | 7篇 |
排序方式: 共有6133条查询结果,搜索用时 15 毫秒
101.
Many decision-makers in industry, government and academia routinely make decisions whose outcome depends on the evolution of software technology trends. Even though the stakes of these decisions are usually very high, decision makers routinely depend on expert opinions and qualitative assessments to model the evolution of software technology; both of these sources of decision-making information are subjective, are based on opinions rather than facts, and are prone to error. In this paper, we report on our ongoing work to build quantitative models of the evolution of software technology trends. In particular, we discuss how we took specific evolutionary models and merged them into a single (general-purpose) model. The original specific models are derived empirically using statistical methods on trend data we had collected over several years, and have been validated individually; in this paper we further validate the generic (general-purpose) model. 相似文献
102.
Heterogeneous datasets arise naturally in most applications due to the use of a variety of sensors and measuring platforms. Such datasets can be heterogeneous in terms of the error characteristics and sensor models. Treating such data is most naturally accomplished using a Bayesian or model-based geostatistical approach; however, such methods generally scale rather badly with the size of dataset, and require computationally expensive Monte Carlo based inference. Recently within the machine learning and spatial statistics communities many papers have explored the potential of reduced rank representations of the covariance matrix, often referred to as projected or fixed rank approaches. In such methods the covariance function of the posterior process is represented by a reduced rank approximation which is chosen such that there is minimal information loss. In this paper a sequential Bayesian framework for inference in such projected processes is presented. The observations are considered one at a time which avoids the need for high dimensional integrals typically required in a Bayesian approach. A C++ library, gptk, which is part of the INTAMAP web service, is introduced which implements projected, sequential estimation and adds several novel features. In particular the library includes the ability to use a generic observation operator, or sensor model, to permit data fusion. It is also possible to cope with a range of observation error characteristics, including non-Gaussian observation errors. Inference for the covariance parameters is explored, including the impact of the projected process approximation on likelihood profiles. We illustrate the projected sequential method in application to synthetic and real datasets. Limitations and extensions are discussed. 相似文献
103.
Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones. 相似文献
104.
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. 相似文献
105.
106.
Solvability conditions and solutions to perfect regulation problem under measurement output feedback
The problem of perfect regulation is to design a family of control laws for a given plant such that the resulting overall closed-loop system is internally stable and its controlled output can be reduced to zero arbitrarily fast from any initial condition. Such a problem was heavily studied by many researchers in the 1970s and early 1980s. However, to the best of our knowledge, all of the earlier results deal only with the problem under full state feedback. In this paper, we solve the long-standing problem of perfect regulation via measurement output feedback for general linear time-invariant multivariable systems. In particular, we derive necessary and sufficient conditions under which the problem of perfect regulation via measurement output feedback is solvable for general systems, and, under these conditions, construct two families of feedback laws, one of full order and the other reduced order, that solve the problem. 相似文献
107.
Globally maximizing, locally minimizing: unsupervised discriminant projection with applications to face and palm biometrics 总被引:5,自引:0,他引:5
Yang J Zhang D Yang JY Niu B 《IEEE transactions on pattern analysis and machine intelligence》2007,29(4):650-664
This paper develops an unsupervised discriminant projection (UDP) technique for dimensionality reduction of high-dimensional data in small sample size cases. UDP can be seen as a linear approximation of a multimanifolds-based learning framework which takes into account both the local and nonlocal quantities. UDP characterizes the local scatter as well as the nonlocal scatter, seeking to find a projection that simultaneously maximizes the nonlocal scatter and minimizes the local scatter. This characteristic makes UDP more intuitive and more powerful than the most up-to-date method, locality preserving projection (LPP), which considers only the local scatter for clustering or classification tasks. The proposed method is applied to face and palm biometrics and is examined using the Yale, FERET, and AR face image databases and the PolyU palmprint database. The experimental results show that UDP consistently outperforms LPP and PCA and outperforms LDA when the training sample size per class is small. This demonstrates that UDP is a good choice for real-world biometrics applications 相似文献
108.
Learning to transform time series with a few examples 总被引:1,自引:0,他引:1
Rahimi A Recht B Darrell T 《IEEE transactions on pattern analysis and machine intelligence》2007,29(10):1759-1775
We describe a semi-supervised regression algorithm that learns to transform one time series into another time series given examples of the transformation. This algorithm is applied to tracking, where a time series of observations from sensors is transformed to a time series describing the pose of a target. Instead of defining and implementing such transformations for each tracking task separately, our algorithm learns a memoryless transformation of time series from a few example input-output mappings. The algorithm searches for a smooth function that fits the training examples and, when applied to the input time series, produces a time series that evolves according to assumed dynamics. The learning procedure is fast and lends itself to a closed-form solution. It is closely related to nonlinear system identification and manifold learning techniques. We demonstrate our algorithm on the tasks of tracking RFID tags from signal strength measurements, recovering the pose of rigid objects, deformable bodies, and articulated bodies from video sequences. For these tasks, this algorithm requires significantly fewer examples compared to fully-supervised regression algorithms or semi-supervised learning algorithms that do not take the dynamics of the output time series into account. 相似文献
109.
110.
Network visualization by semantic substrates 总被引:1,自引:0,他引:1
Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations 相似文献