全文获取类型
收费全文 | 44185篇 |
免费 | 4089篇 |
国内免费 | 2003篇 |
专业分类
电工技术 | 2512篇 |
技术理论 | 2篇 |
综合类 | 2522篇 |
化学工业 | 7722篇 |
金属工艺 | 2621篇 |
机械仪表 | 2988篇 |
建筑科学 | 3070篇 |
矿业工程 | 1302篇 |
能源动力 | 1331篇 |
轻工业 | 2859篇 |
水利工程 | 650篇 |
石油天然气 | 2492篇 |
武器工业 | 339篇 |
无线电 | 5362篇 |
一般工业技术 | 5935篇 |
冶金工业 | 2429篇 |
原子能技术 | 533篇 |
自动化技术 | 5608篇 |
出版年
2024年 | 193篇 |
2023年 | 837篇 |
2022年 | 1492篇 |
2021年 | 2173篇 |
2020年 | 1549篇 |
2019年 | 1438篇 |
2018年 | 1509篇 |
2017年 | 1535篇 |
2016年 | 1450篇 |
2015年 | 1916篇 |
2014年 | 2267篇 |
2013年 | 2725篇 |
2012年 | 2821篇 |
2011年 | 3205篇 |
2010年 | 2530篇 |
2009年 | 2472篇 |
2008年 | 2471篇 |
2007年 | 2209篇 |
2006年 | 2318篇 |
2005年 | 1845篇 |
2004年 | 1343篇 |
2003年 | 1210篇 |
2002年 | 1132篇 |
2001年 | 991篇 |
2000年 | 958篇 |
1999年 | 1000篇 |
1998年 | 835篇 |
1997年 | 714篇 |
1996年 | 633篇 |
1995年 | 522篇 |
1994年 | 409篇 |
1993年 | 275篇 |
1992年 | 229篇 |
1991年 | 202篇 |
1990年 | 169篇 |
1989年 | 153篇 |
1988年 | 99篇 |
1987年 | 85篇 |
1986年 | 55篇 |
1985年 | 49篇 |
1984年 | 34篇 |
1983年 | 37篇 |
1982年 | 29篇 |
1981年 | 23篇 |
1980年 | 26篇 |
1979年 | 17篇 |
1978年 | 15篇 |
1976年 | 18篇 |
1975年 | 10篇 |
1973年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
The wavelet scaling functions of spline wavelets are used to construct the displacement interpolation functions of triangular
and rectangular thin plate elements. The displacement shape functions are then expressed by spline wavelet functions. A spline
wavelet finite element formulation of thin plate bending is developed by using the virtual work principle. Two numerical examples
have shown that the bending deflections and moments of thin plates agree well with those obtained by the differential equations
and conventional elements. It is demonstrated that the current spline wavelet finite element method (FEM) can achieve a high
numerical accuracy and converges fast. The proposed spline wavelet finite element formulation has a wide range of applicability
since it is developed in the same way like conventional displacement-based FEM. 相似文献
992.
Chen Chen Xifeng Yan Feida Zhu Jiawei Han Philip S. Yu 《Knowledge and Information Systems》2009,21(1):41-63
Databases and data warehouse systems have been evolving from handling normalized spreadsheets stored in relational databases, to managing and analyzing diverse application-oriented data with complex interconnecting structures. Responding to this emerging trend, graphs have been growing rapidly and showing their critical importance in many applications, such as the analysis of XML, social networks, Web, biological data, multimedia data and spatiotemporal data. Can we extend useful functions of databases and data warehouse systems to handle graph structured data? In particular, OLAP (On-Line Analytical Processing) has been a popular tool for fast and user-friendly multi-dimensional analysis of data warehouses. Can we OLAP graphs? Unfortunately, to our best knowledge, there are no OLAP tools available that can interactively view and analyze graph data from different perspectives and with multiple granularities. In this paper, we argue that it is critically important to OLAP graph structured data and propose a novel Graph OLAP framework. According to this framework, given a graph dataset with its nodes and edges associated with respective attributes, a multi-dimensional model can be built to enable efficient on-line analytical processing so that any portions of the graphs can be generalized/specialized dynamically, offering multiple, versatile views of the data. The contributions of this work are three-fold. First, starting from basic definitions, i.e., what are dimensions and measures in the Graph OLAP scenario, we develop a conceptual framework for data cubes on graphs. We also look into different semantics of OLAP operations, and classify the framework into two major subcases: informational OLAP and topological OLAP. Second, we show how a graph cube can be materialized by calculating a special kind of measure called aggregated graph and how to implement it efficiently. This includes both full materialization and partial materialization where constraints are enforced to obtain an iceberg cube. As we can see, due to the increased structural complexity of data, aggregated graphs that depend on the underlying “network” properties of the graph dataset are much harder to compute than their traditional OLAP counterparts. Third, to provide more flexible, interesting and informative OLAP of graphs, we further propose a discovery-driven multi-dimensional analysis model to ensure that OLAP is performed in an intelligent manner, guided by expert rules and knowledge discovery processes. We outline such a framework and discuss some challenging research issues for discovery-driven Graph OLAP. 相似文献
993.
994.
995.
We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages. 相似文献
996.
While equilibrium analysis has been commonly used for network pricing under the assumption that user utility functions are precisely known, many researchers have criticized the validity of the assumption. In this paper, we propose a solution for bridging the gap between the existing theoretical work on optimal pricing and the unavailability of precise user utility information in real networks. In the proposed method, the service provider obtains increasingly more accurate estimates of user utility functions by iteratively changing the prices of service levels and observing the users’ service-level choices under various prices. Our study’s contribution is twofold. First, we have developed a general principle for estimating user utility functions. Especially, we present the utility estimation for dynamic user population. Second, we have developed a method for setting prices that can optimize the extraction of information about user utility functions. The extensive simulation results demonstrate the effectiveness of our method. 相似文献
997.
The stabilization problem of polytopic differential inclusion (PDI) systems is investigated by using sliding mode control. Sliding surface is designed and sufficient conditions for asymptotic stability of sliding mode dynamics are derived. A novel feedback law is established to make the state of system reach the sliding surface in a finite time. Finally, an example is given to illustrate the validity of the proposed design. 相似文献
998.
999.
In this paper, we study an on-line broadcast scheduling problem with deadlines, in which the requests asking for the same page can be satisfied simultaneously by broadcasting this page, and every request is associated with a release time, deadline and a required page with a unit size. The objective is to maximize the number of requests satisfied by the schedule. In this paper, we focus on an important special case where all the requests have their spans (the difference between release time and deadline) less than 2. We give an optimal online algorithm, i.e., its competitive ratio matches the lower bound of the problem. 相似文献
1000.
TCP is a reliable transport protocol tuned to perform well over traditional wired networks. Although it performs well for wired networks, TCP’s implicit assumption that any packet loss is due to congestion is not valid any longer in mobile ad hoc networks. It is observed that TCP induces the over-action of routing protocol and reduces the performance of the connection. Fraction window increment (FeW) scheme for TCP improves the connection performance by limiting TCP’s aggressiveness. But to some extent, this limitation is too strict in that it eliminates the possibility to deliver more bytes under the same congestion window. To solve this problem, we propose an adaptive packet size (APS) scheme to work on top of FeW for TCP. The proposed scheme utilizes the advantages of both legacy TCP and FeW to achieve high performance over multihop 802.11 networks. Extensive simulation results demonstrate that APS over FeW outperforms FeW alone by 10–25% according to different scenarios, e.g., chain-topology, grid-topology, and random-topology with mobility. 相似文献