全文获取类型
收费全文 | 31226篇 |
免费 | 3353篇 |
国内免费 | 2030篇 |
专业分类
电工技术 | 2097篇 |
综合类 | 2404篇 |
化学工业 | 4554篇 |
金属工艺 | 1369篇 |
机械仪表 | 3444篇 |
建筑科学 | 1338篇 |
矿业工程 | 718篇 |
能源动力 | 1480篇 |
轻工业 | 775篇 |
水利工程 | 561篇 |
石油天然气 | 1524篇 |
武器工业 | 369篇 |
无线电 | 2170篇 |
一般工业技术 | 2723篇 |
冶金工业 | 878篇 |
原子能技术 | 135篇 |
自动化技术 | 10070篇 |
出版年
2024年 | 111篇 |
2023年 | 442篇 |
2022年 | 719篇 |
2021年 | 961篇 |
2020年 | 961篇 |
2019年 | 859篇 |
2018年 | 864篇 |
2017年 | 1059篇 |
2016年 | 1238篇 |
2015年 | 1365篇 |
2014年 | 1929篇 |
2013年 | 1961篇 |
2012年 | 1973篇 |
2011年 | 2629篇 |
2010年 | 1846篇 |
2009年 | 2142篇 |
2008年 | 2067篇 |
2007年 | 2416篇 |
2006年 | 2049篇 |
2005年 | 1775篇 |
2004年 | 1479篇 |
2003年 | 1324篇 |
2002年 | 1003篇 |
2001年 | 763篇 |
2000年 | 630篇 |
1999年 | 434篇 |
1998年 | 330篇 |
1997年 | 247篇 |
1996年 | 188篇 |
1995年 | 162篇 |
1994年 | 133篇 |
1993年 | 119篇 |
1992年 | 102篇 |
1991年 | 82篇 |
1990年 | 59篇 |
1989年 | 55篇 |
1988年 | 24篇 |
1987年 | 17篇 |
1986年 | 21篇 |
1985年 | 16篇 |
1984年 | 14篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1975年 | 3篇 |
1951年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
对于MDA横切于核心业务逻辑的关注点对封装的破坏的问题,本文给出把AOP引入到MDA的扩展策略和主要方法,并对不同的扩展策略进行了比较。 相似文献
82.
形状特征局部操作在实体造型中的实现 总被引:1,自引:0,他引:1
李茹 《计算机工程与应用》2000,36(2):75-77
文章介绍了实体造型中形状特征的局部操作,研究了包含形状特征描述的数据结构,分析了形状特征的分类、框架、特征间的联系及有关操作,分析了欧拉运算及实现思路,在此基础上对实体造型进行局部操作,提高了造型中的运算效率,也对特征造型作了相应的探讨。 相似文献
83.
计算机绘制曲面型房屋建筑 总被引:6,自引:0,他引:6
文中提出了一个主要解决房屋建筑中直纹曲面的计算机造型方法,为此,对这些曲面的几何性质作了分析,并结合流行的三种绘图软件进行试验;然后介绍每一种软件的造型方法,并作分析比较。 相似文献
84.
JI Fei 《数字社区&智能家居》2008,(34)
面向对象分析与设计,涉及的内容新、实践性强。文章着眼于高等职业院校,分析了课程体系、教学目标,以类模型图为例,阐述了抽象-实现-建模的三步教学法。 相似文献
85.
86.
非均匀抽样网格简化 总被引:2,自引:0,他引:2
提出了一种考虑视点空间中某些重要视点的非均匀抽样网格简化的新方法,是在借鉴了Garland-Heckbert方法的基础上提出的,是一种考虑外观相似性的简化算法。给出并证明了两个判定边界的定理,为抽样提供了理论依据。在简化过程中,该算法通过采用视点空间中某些重要视点对模型进行抽样,使抽中的顶点对(轮廓附近的顶点对)得到适当保护。该算法除具有Garland-Heckbert方法的长处外,还可以在三角面片数较少的情况下(50多个三角面片),尽可能保持模型的重要外观特征,给出了计算0-1图像的外观相似性误差的公式,通过该公式对简化结果进行比较,证明提出的简化算法对保持模型的外观特征是行之有效的。最后对该算法的时间和空间复杂性进行了分析。 相似文献
87.
The MultiDimER model is a conceptual model used for representing a multidimensional view of data for Data Warehouse (DW) and
On-Line Analytical Processing (OLAP) applications. This model includes a spatial extension allowing spatiality in levels,
hierarchies, fact relationships, and measures. In this way decision-making users can represent in an abstract manner their
analysis needs without considering complex implementation issues and spatial OLAP tools developers can have a common vision
for representing spatial data in a multidimensional model. In this paper we propose the transformation of a conceptual schema
based on the MultiDimER constructs to an object-relational schema. We based our mapping on the SQL:2003 and SQL/MM standards
giving examples of commercial implementation using Oracle 10g with its spatial extension. Further we use spatial integrity
constraints to ensure the semantic equivalence of the conceptual and logical schemas. We also show some examples of Oracle
spatial functions, including aggregation functions required for the manipulation of spatial data. The described mappings to
the object-relational model along with the examples using a commercial system show the feasibility of implementing spatial
DWs in current commercial DBMSs. Further, using integrated architectures, where spatial and thematic data is defined within
the same DBMS, facilitates the system management simplifying data definition and manipulation.
相似文献
Esteban ZimányiEmail: |
88.
Direct manipulation of FFD: efficient explicit solutions and decomposible multiple point constraints 总被引:8,自引:0,他引:8
Published online: 25 July 2001 相似文献
89.
Optimizing multiple dimensional queries simultaneously in multidimensional databases 总被引:1,自引:0,他引:1
Weifa Liang Maria E. Orlowska Jeffrey X. Yu 《The VLDB Journal The International Journal on Very Large Data Bases》2000,8(3-4):319-338
Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the
design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient
storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization
issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously
is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms.
In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins
or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which
delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based
star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider
a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a
possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic
and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental
results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which
confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates.
To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able
to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous
approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide
any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one.
Received: July 21, 1998 / Accepted: August 26, 1999 相似文献
90.
I‐Ching Hsu 《Software》2012,42(10):1211-1227
Web 2.0 Mashups offer entirely new opportunities for context‐aware application (CAA) developers by integrating Web 2.0 technologies to facilitate interoperability among heterogeneous context‐aware systems. From a software engineering perspective, a visualized approach for Web 2.0‐based CAA modeling is crucial. Current CAA development, however, cannot provide a conceptual model for Web 2.0‐based CAA. Therefore, the development efficiency and potential for reuse are decreased. The UML is a general purpose modeling language with potential for use in many application domains. However, UML often lacks elements needed to model concepts in specific domains, such as Web 2.0‐based CAA modeling. To address the above issues, this study presents the Web 2.0‐based CAA UML profile, a UML profile for modeling Web 2.0‐based CAA. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献