首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13587篇
  免费   2165篇
  国内免费   1576篇
电工技术   984篇
技术理论   4篇
综合类   1568篇
化学工业   452篇
金属工艺   221篇
机械仪表   762篇
建筑科学   657篇
矿业工程   428篇
能源动力   336篇
轻工业   357篇
水利工程   319篇
石油天然气   375篇
武器工业   198篇
无线电   1353篇
一般工业技术   903篇
冶金工业   160篇
原子能技术   140篇
自动化技术   8111篇
  2024年   62篇
  2023年   256篇
  2022年   369篇
  2021年   422篇
  2020年   559篇
  2019年   446篇
  2018年   418篇
  2017年   459篇
  2016年   539篇
  2015年   587篇
  2014年   918篇
  2013年   838篇
  2012年   1093篇
  2011年   1113篇
  2010年   897篇
  2009年   954篇
  2008年   1033篇
  2007年   1146篇
  2006年   840篇
  2005年   841篇
  2004年   663篇
  2003年   588篇
  2002年   421篇
  2001年   341篇
  2000年   285篇
  1999年   221篇
  1998年   165篇
  1997年   150篇
  1996年   128篇
  1995年   93篇
  1994年   77篇
  1993年   80篇
  1992年   67篇
  1991年   33篇
  1990年   35篇
  1989年   30篇
  1988年   18篇
  1987年   20篇
  1986年   6篇
  1985年   13篇
  1984年   17篇
  1983年   14篇
  1982年   11篇
  1981年   8篇
  1980年   11篇
  1979年   8篇
  1978年   6篇
  1977年   7篇
  1976年   6篇
  1975年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
可拓检测的方案生成   总被引:5,自引:0,他引:5  
以可拓学理论为基础,论述了可拓检测的有关定义和概念,提出了可拓检测的方案生成方法及过程,同时探讨了检测方法的优化和评价方法。  相似文献   
3.
Education-driven research in CAD   总被引:1,自引:0,他引:1  
Jarek   《Computer aided design》2004,36(14):1461-1469
We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.  相似文献   
4.
Local Exact Particle Tracing on Unstructured Grids   总被引:1,自引:0,他引:1  
For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation  相似文献   
5.
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。  相似文献   
6.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n 2 log n) toO(n log2 n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.  相似文献   
7.
Open window buses without air-conditioning are a major mode of urban and inter-city transport in most countries. High occupancy combined with hot and humid conditions makes travel in these buses quite uncomfortable. In this study air flow through a bus has been studied that could be the basis for low cost and eco-friendly methods of increasing passenger comfort and possibly reduce drag. The aerodynamics of such a road vehicle has not been studied as previous investigations have been confined to vehicles with closed windows that present a smooth exterior to air flow. Using a 1:25 scaled Perspex model of an urban bus in Delhi, flow visualization was performed in a water channel. The Reynolds numbers were one-tenth of a real bus moving at 10 m/s. Smoke and tuft visualizations were also performed on an urban bus at 40 km/h. Numerical simulations were performed at the actual Reynolds number. Even though there were Reynolds number differences, the broad features were similar. Air enters the bus from the rear windows, moves to the front (relative to the bus) and exits from the front windows. Inside air velocity relative to the bus is about one-tenth of the free-stream velocity. The flow is highly three-dimensional and unsteady.  相似文献   
8.
In recent years, the Asia-Pacific region has experienced several financial setbacks, including speculative attacks in 1998 and the SARS outbreak in 2003. Financial stresses of this nature are unanticipated, and not all of the dangers can be predicted by the examination of market information and macroeconomic indicators. The Early Warning System (EWS) that has been adopted by the International Monetary Fund may not be able to predict future financial crises for all possible scenarios, because shocks come in many different forms. To supplement the EWS, this paper proposes a data mining framework to measure the resilience of an economy. The resilience framework does not predict a crisis, but rather assesses the current state of health of an economy and its ability to withstand a financial shock should one occur. The framework is based on a feedback system consisting of two stages. The first stage assigns a resilience score to each economy based on a fuzzy logic scoring scheme that is built on the ambiguous reasoning of experts. The second stage uses the classification tree approach to estimate thresholds for each economic indicator, and examines the quality of the fuzzy score. The result from the second stage is then passed back to the first stage as feedback. The final result is obtained when the feedback system reaches its equilibrium state. The proposed resilience framework is applied to the external-sector and the public-sector economies of several countries to illustrate its applicability.  相似文献   
9.
The degree to which real and hypothetical rewards were discounted across delays ranging from 6 hr to 1 year was explored in a within-subjects design. An adjusting-amounts procedure was used to estimate the subjective value of real and hypothetical rewards at each delay. A hyperbolic discounting function provided a significantly better fit to individual participants' preferences than did an exponential function. No significant effect of reward type on degree of hyperbolic discounting or area under the discounting curves was detected. These findings offer some support for the validity of using hypothetical rewards to estimate discounting rates in substance-abusing and other populations, but caution is suggested because this support is gleaned from a failure to detect an effect of reward type. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
10.
在视频会议等多播应用中,降低多播树网络费用非常重要。本文提出了基于关键节点和目的节点的多播路由KDDMC算法。由于在算法中优先考虑采用关键节点,实现更多链路的共享,从而降低网络费用。在随机网络上的仿真结果表明,KDDMC算法的多播树网络费用优于SPH算法。同时证明了KDDMC算法的复杂度为O(n^3),且利用所提出的路由表算法易于分布式实现。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号