首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3264篇
  免费   213篇
  国内免费   1篇
电工技术   66篇
综合类   1篇
化学工业   1037篇
金属工艺   33篇
机械仪表   91篇
建筑科学   108篇
矿业工程   2篇
能源动力   99篇
轻工业   443篇
水利工程   28篇
石油天然气   6篇
无线电   263篇
一般工业技术   506篇
冶金工业   195篇
原子能技术   15篇
自动化技术   585篇
  2023年   28篇
  2022年   175篇
  2021年   195篇
  2020年   92篇
  2019年   91篇
  2018年   123篇
  2017年   89篇
  2016年   140篇
  2015年   99篇
  2014年   129篇
  2013年   227篇
  2012年   185篇
  2011年   244篇
  2010年   163篇
  2009年   201篇
  2008年   152篇
  2007年   143篇
  2006年   116篇
  2005年   98篇
  2004年   79篇
  2003年   75篇
  2002年   71篇
  2001年   44篇
  2000年   41篇
  1999年   34篇
  1998年   71篇
  1997年   52篇
  1996年   48篇
  1995年   30篇
  1994年   30篇
  1993年   14篇
  1992年   17篇
  1991年   9篇
  1990年   20篇
  1989年   12篇
  1988年   11篇
  1987年   7篇
  1986年   5篇
  1985年   7篇
  1984年   14篇
  1983年   13篇
  1982年   11篇
  1981年   14篇
  1980年   12篇
  1979年   4篇
  1978年   5篇
  1977年   6篇
  1976年   8篇
  1971年   3篇
  1966年   3篇
排序方式: 共有3478条查询结果,搜索用时 46 毫秒
71.
72.
Calculations are presented, based on a Density Functional approach, of the first excited states (l=1) of alkali metal atoms (Cs and Na) in liquid 4He. We find large departures from the spherical bubble in the liquid4He structure when the alkali atom is excited. The shifts from the free atom values of the excitation and emission transition lines are calculated and compared with the experimental results. According to our calculations, the so far unseen radiative deexcitation transition for light alkalis in4He may lie in an unexplored infrared region of the spectrum.  相似文献   
73.
74.
Multi-objective evolutionary algorithms (MOEAs) have received increasing interest in industry because they have proved to be powerful optimizers. Despite the great success achieved, however, MOEAs have also encountered many challenges in real-world applications. One of the main difficulties in applying MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before an acceptable solution can be found. There are, in fact, several industrial situations in which fitness evaluations are computationally expensive and the time available is very short. In these applications efficient strategies to approximate the fitness function have to be adopted, looking for a trade-off between optimization performance and efficiency. This is the case in designing a complex embedded system, where it is necessary to define an optimal architecture in relation to certain performance indexes while respecting strict time-to-market constraints. This activity, known as design space exploration (DSE), is still a great challenge for the EDA (electronic design automation) community. One of the most important bottlenecks in the overall design flow of an embedded system is due to simulation. Simulation occurs at every phase of the design flow and is used to evaluate a system which is a candidate for implementation. In this paper we focus on system level design, proposing an extensive comparison of the state-of-the-art of MOEA approaches with an approach based on fuzzy approximation to speed up the evaluation of a candidate system configuration. The comparison is performed in a real case study: optimization of the performance and power dissipation of embedded architectures based on a Very Long Instruction Word (VLIW) microprocessor in a mobile multimedia application domain. The results of the comparison demonstrate that the fuzzy approach outperforms in terms of both performance and efficiency the state of the art in MOEA strategies applied to DSE of a parameterized embedded system.  相似文献   
75.
Nature is a great source of inspiration for scientists, because natural systems seem to be able to find the best way to solve a given problem by using simple and robust mechanisms. Studying complex natural systems, scientists usually find that simple local dynamics lead to sophisticated macroscopic structures and behaviour. It seems that some kind of local interaction rules naturally allow the system to auto-organize itself as an efficient and robust structure, which can easily solve different tasks. Examples of such complex systems are social networks, where a small set of basic interaction rules leads to a relatively robust and efficient communication structure. In this paper, we present PROSA, a semantic peer-to-peer (P2P) overlay network inspired by social dynamics. The way queries are forwarded and links among peers are established in PROSA resemble the way people ask other people for collaboration, help or information. Behaving as a social network of peers, PROSA naturally evolves to a small world, where all peers can be reached in a fast and efficient way. The underlying algorithm used for query forwarding, based only on local choices, is both reliable and effective: peers sharing similar resources are eventually connected with each other, allowing queries to be successfully answered in a really small amount of time. The resulting emergent structure can guarantee fast responses and good query recall.  相似文献   
76.
In this paper we present a graphical software system that provides an automatic support to the extraction of information from web pages. The underlying extraction technique exploits the visual appearance of the information in the document, and is driven by the spatial relations occurring among the elements in the page. However, the usual information extraction modalities based on the web page structure can be used in our framework, too. The technique has been integrated within the Spatial Relation Query (SRQ) tool. The tool is provided with a graphical front-end which allows one to define and manage a library of spatial relations, and to use a SQL-like language for composing queries driven by these relations and by further semantic and graphical attributes.  相似文献   
77.
78.
We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies.  相似文献   
79.
80.
This paper presents two new higher order diffusion models for removing noise from images. The models employ fractional derivatives and are modifications of an existing fourth order partial differential equation (PDE) model which was developed by You and Kaveh as a generalization of the well-known second order Perona-Malik equation. The modifications serve to cure the ill-posedness of the You-Kaveh model without sacrificing performance. Also proposed in this paper is a simple smoothing technique which can be used in numerical experiments to improve denoising and reduce processing time. Numerical experiments are shown for comparison.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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