全文获取类型
收费全文 | 227933篇 |
免费 | 20358篇 |
国内免费 | 10603篇 |
专业分类
电工技术 | 14572篇 |
技术理论 | 30篇 |
综合类 | 23251篇 |
化学工业 | 27169篇 |
金属工艺 | 9527篇 |
机械仪表 | 11480篇 |
建筑科学 | 32037篇 |
矿业工程 | 13067篇 |
能源动力 | 8841篇 |
轻工业 | 16366篇 |
水利工程 | 16742篇 |
石油天然气 | 11931篇 |
武器工业 | 3212篇 |
无线电 | 14136篇 |
一般工业技术 | 16544篇 |
冶金工业 | 11587篇 |
原子能技术 | 1665篇 |
自动化技术 | 26737篇 |
出版年
2024年 | 1059篇 |
2023年 | 3025篇 |
2022年 | 5751篇 |
2021年 | 7526篇 |
2020年 | 7339篇 |
2019年 | 5624篇 |
2018年 | 5245篇 |
2017年 | 6653篇 |
2016年 | 8043篇 |
2015年 | 8667篇 |
2014年 | 15552篇 |
2013年 | 13613篇 |
2012年 | 16345篇 |
2011年 | 18088篇 |
2010年 | 13264篇 |
2009年 | 13603篇 |
2008年 | 12482篇 |
2007年 | 15082篇 |
2006年 | 13736篇 |
2005年 | 12057篇 |
2004年 | 10074篇 |
2003年 | 8788篇 |
2002年 | 7142篇 |
2001年 | 5872篇 |
2000年 | 5055篇 |
1999年 | 3955篇 |
1998年 | 2822篇 |
1997年 | 2460篇 |
1996年 | 2033篇 |
1995年 | 1690篇 |
1994年 | 1434篇 |
1993年 | 1012篇 |
1992年 | 809篇 |
1991年 | 560篇 |
1990年 | 475篇 |
1989年 | 449篇 |
1988年 | 247篇 |
1987年 | 198篇 |
1986年 | 166篇 |
1985年 | 185篇 |
1984年 | 133篇 |
1983年 | 113篇 |
1982年 | 60篇 |
1981年 | 75篇 |
1980年 | 81篇 |
1979年 | 39篇 |
1978年 | 21篇 |
1977年 | 22篇 |
1975年 | 16篇 |
1959年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
211.
E-commerce present opportunities and challenges for businesses, especially for micro-enterprises. This paper proposed a theoretical framework that in line with the unique characteristics of E-commerce acceptance in micro-enterprises in Chengdu, which is based on the unified theory of acceptance and use of technology (UTAUT) model. The extending UTAUT model includes key constructs of performance expectation, perceived behavioral control and the characteristics of owner-managers. 相似文献
212.
到报监测是气象水文数据传输、处理等的重要环节,其实时性是关键设计目标.通过分析文件目录扫描方法和消息通知机制的应用特点,结合气象水文资料传输、处理规程及应用模式,重点阐述了结合实时性和可靠性要求的到报监测方法,并给出一种重构性强、应用灵活的到报监测模块的设计方案. 相似文献
213.
We extend the traditional notion of passivity to a forced system whose equilibrium is dependent on the control input by defining equilibrium-independent passivity, a system property characterized by a dissipation inequality centered at an arbitrary equilibrium point. We provide a necessary input/output condition which can be tested for systems of arbitrary dimension and sufficient conditions to certify this property for scalar systems. An example from network stability analysis is presented which demonstrates the utility of this new definition. We then proceed to numerical certification of equilibrium-independent passivity using sum-of-squares programming. Finally, through numerical examples we show that equilibrium-independent passivity is less restrictive than incremental passivity. 相似文献
214.
Impact of the discrete dopants on device performance is crucial in determining the behavior of nanoscale semiconductor devices. Atomistic quantum mechanical device simulation for studying the effect of discrete dopants on device's physical quantities is urgent. This work explores the physics of discrete-dopant-induced characteristic fluctuations in 16-nm fin-typed field effect transistor (FinFET) devices. Discrete dopants are statistically positioned in the three-dimensional channel region to examine associated carrier's characteristic, concurrently capturing “dopant concentration variation” and “dopant position fluctuation”. An experimentally validated quantum hydrodynamic device simulation was conducted to investigate the potential profile and threshold voltage fluctuations of the 16-nm FinFET. Results of this study provide further insight into the problem of fluctuation and the mechanism of immunity against fluctuation in 16-nm devices. 相似文献
215.
Users expect applications to successfully cope with the expansion of information as necessitated by the continuous inclusion of novel types of content. Given that such content may originate from ‘not‐seen thus far’ data collections and/or data sources, the challenging issue is to achieve the return of investment on existing services, adapting to new information without changing existing business‐logic implementation. To address this need, we introduce DOLAR (Data Object Language And Runtime), a service‐neutral framework which virtualizes the information space to avoid invasive, time‐consuming, and expensive source‐code extensions that frequently break applications. Specifically, DOLAR automates the introduction of new business‐logic objects in terms of the proposed virtual ‘content objects’. Such user‐specified virtual objects align to storage artifacts and help realize uniform ‘store‐to‐user’ data flows atop heterogeneous sources, while offering the reverse ‘user‐to‐store’ flows with identical effectiveness and ease of use. In addition, the suggested virtual object composition schemes help decouple business logic from any content origin, storage and/or structural details, allowing applications to support novel types of items without modifying their service provisions. We expect that content‐rich applications will benefit from our approach and demonstrate how DOLAR has assisted in the cost‐effective development and gradual expansion of a production‐quality digital library. Experimentation shows that our approach imposes minimal overheads and DOLAR‐based applications scale as well as any underlying datastore(s). Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
216.
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. 相似文献
217.
Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the straight skeleton of a polygon, the straight skeleton of polyhedra has been paid much less attention. We require to compute the skeleton of very large datasets storing orthogonal polyhedra. Furthermore, we need to treat geometric degeneracies that usually arise when dealing with orthogonal polyhedra. We present a new approach so as to robustly compute the straight skeleton of orthogonal polyhedra. We follow a geometric technique that works directly with the boundary of an orthogonal polyhedron. Our approach is output sensitive with respect to the number of vertices of the skeleton and solves geometric degeneracies. Unlike the existing straight skeleton algorithms that shrink the object boundary to obtain the skeleton, our algorithm relies on the plane sweep paradigm. The resulting skeleton is only composed of axis‐aligned and 45° rotated planar faces and edges. 相似文献
218.
219.
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a standard timed automaton. In both cases, we show that simulation checking is Exptime-hard, and for the case of a non-flat implementation, the result holds even if there is no synchronization between the parallel components and their alphabets of actions are pairwise disjoint. Moreover, we show that the considered problems become Pspace-complete when the specification is assumed to be deterministic. Additionally, we establish that comparing a synchronous non-flat system with no hiding and a flat system is Pspace-hard for any relation between trace containment and bisimulation equivalence, even if the flat system is assumed to be fixed. 相似文献
220.