全文获取类型
收费全文 | 5565篇 |
免费 | 457篇 |
国内免费 | 112篇 |
专业分类
电工技术 | 244篇 |
综合类 | 202篇 |
化学工业 | 956篇 |
金属工艺 | 204篇 |
机械仪表 | 181篇 |
建筑科学 | 345篇 |
矿业工程 | 54篇 |
能源动力 | 302篇 |
轻工业 | 452篇 |
水利工程 | 96篇 |
石油天然气 | 176篇 |
武器工业 | 4篇 |
无线电 | 645篇 |
一般工业技术 | 823篇 |
冶金工业 | 369篇 |
原子能技术 | 25篇 |
自动化技术 | 1056篇 |
出版年
2024年 | 17篇 |
2023年 | 94篇 |
2022年 | 167篇 |
2021年 | 219篇 |
2020年 | 173篇 |
2019年 | 172篇 |
2018年 | 216篇 |
2017年 | 200篇 |
2016年 | 235篇 |
2015年 | 213篇 |
2014年 | 231篇 |
2013年 | 429篇 |
2012年 | 330篇 |
2011年 | 417篇 |
2010年 | 340篇 |
2009年 | 338篇 |
2008年 | 279篇 |
2007年 | 239篇 |
2006年 | 235篇 |
2005年 | 187篇 |
2004年 | 127篇 |
2003年 | 146篇 |
2002年 | 193篇 |
2001年 | 141篇 |
2000年 | 105篇 |
1999年 | 62篇 |
1998年 | 92篇 |
1997年 | 72篇 |
1996年 | 56篇 |
1995年 | 61篇 |
1994年 | 55篇 |
1993年 | 39篇 |
1992年 | 24篇 |
1991年 | 8篇 |
1990年 | 16篇 |
1989年 | 10篇 |
1988年 | 15篇 |
1987年 | 14篇 |
1986年 | 15篇 |
1985年 | 11篇 |
1984年 | 23篇 |
1983年 | 11篇 |
1982年 | 13篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 9篇 |
1976年 | 14篇 |
1975年 | 8篇 |
排序方式: 共有6134条查询结果,搜索用时 0 毫秒
121.
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. 相似文献
122.
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. 相似文献
123.
124.
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. 相似文献
125.
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 相似文献
126.
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. 相似文献
127.
128.
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 相似文献
129.
Balancing systematic and flexible exploration of social networks 总被引:1,自引:0,他引:1
Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks 相似文献
130.
Ben L. Di Vito 《International Journal on Software Tools for Technology Transfer (STTT)》2000,3(1):20-31
We describe an approach and experimental results in the application of mechanized theorem proving to software requirements
analysis. Serving as the test article was the embedded controller for SAFER, a backpack propulsion system used as a rescue
device by NASA astronauts. SAFER requirements were previously formalized using the prototype verification system (PVS) during
a NASA pilot project in formal methods, details of which appear in a NASA guidebook. This paper focuses on the formulation
and proof of properties for the SAFER requirements model. To test the prospects for deductive requirements analysis, we used
the PVS theorem prover to explore the upper limits of proof automation. A set of property classes was identified, with matching
proof schemes later devised. After developing several PVS proof strategies (essentially prover macros), we obtained fully
automatic proofs of 42 model properties. These results demonstrate how customized prover strategies can be used to automate
moderate-complexity theorem proving for state machine models. 相似文献