首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5501篇
  免费   395篇
  国内免费   5篇
电工技术   57篇
综合类   5篇
化学工业   1426篇
金属工艺   77篇
机械仪表   159篇
建筑科学   219篇
矿业工程   13篇
能源动力   199篇
轻工业   1065篇
水利工程   64篇
石油天然气   27篇
无线电   375篇
一般工业技术   739篇
冶金工业   276篇
原子能技术   24篇
自动化技术   1176篇
  2024年   12篇
  2023年   58篇
  2022年   155篇
  2021年   276篇
  2020年   188篇
  2019年   205篇
  2018年   234篇
  2017年   201篇
  2016年   248篇
  2015年   201篇
  2014年   249篇
  2013年   579篇
  2012年   385篇
  2011年   509篇
  2010年   340篇
  2009年   308篇
  2008年   285篇
  2007年   226篇
  2006年   184篇
  2005年   123篇
  2004年   132篇
  2003年   104篇
  2002年   105篇
  2001年   52篇
  2000年   54篇
  1999年   60篇
  1998年   83篇
  1997年   57篇
  1996年   45篇
  1995年   40篇
  1994年   28篇
  1993年   22篇
  1992年   11篇
  1991年   14篇
  1990年   15篇
  1989年   9篇
  1988年   5篇
  1987年   11篇
  1986年   7篇
  1985年   13篇
  1984年   3篇
  1983年   5篇
  1982年   8篇
  1981年   5篇
  1980年   6篇
  1978年   4篇
  1977年   5篇
  1976年   9篇
  1975年   3篇
  1967年   3篇
排序方式: 共有5901条查询结果,搜索用时 31 毫秒
101.
In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP-hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We compare our method with the only published metaheuristic algorithm for this problem on a set of 420 instances. The comparison favors the method developed in this work, showing that is able to find high quality solutions in very short computational times.  相似文献   
102.
Nowadays, the most promising technology for designing optical networks is the wavelength division multiplexing. This technique divides the huge bandwidth of an optical fiber link into different wavelengths, providing different available channels per link. However, a problem comes up when it is necessary to interconnect a set of traffic demands. This problem is known as routing and wavelength assignment problem, and due to its complexity (NP-hard problem) it is very suitable for being solved using evolutionary computation. The selected heuristics is the artificial bee colony algorithm, an heuristics based on the behavior of honeybee foraging for nectar. Therefore, we have applied multiobjective optimization to solve the static routing and wavelength assignment problem, and adapted this algorithm to the multiobjective context. New results have been obtained that significantly improve those published in previous researches.  相似文献   
103.
104.
105.
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with a very large bound. In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation. Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred by the allocators has been also included in order to provide a global view of the behaviour of the allocators. The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused by the best existing allocators.
Alfons Crespo (Corresponding author)Email:
  相似文献   
106.
So far, most of the applications of robotic technology to education have mainly focused on supporting the teaching of subjects that are closely related to the Robotics field, such as robot programming, robot construction, or mechatronics. Moreover, most of the applications have used the robot as an end or a passive tool of the learning activity, where the robot has been constructed or programmed. In this paper, we present a novel application of robotic technologies to education, where we use the real world situatedness of a robot to teach non-robotic related subjects, such as math and physics. Furthermore, we also provide the robot with a suitable degree of autonomy to actively guide and mediate in the development of the educational activity. We present our approach as an educational framework based on a collaborative and constructivist learning environment, where the robot is able to act as an interaction mediator capable of managing the interactions occurring among the working students. We illustrate the use of this framework by a 4-step methodology that is used to implement two educational activities. These activities were tested at local schools with encouraging results. Accordingly, the main contributions of this work are: i) A novel use of a mobile robot to illustrate and teach relevant concepts and properties of the real world; ii) A novel use of robots as mediators that autonomously guide an educational activity using a collaborative and constructivist learning approach; iii) The implementation and testing of these ideas in a real scenario, working with students at local schools.
Alvaro Soto (Corresponding author)Email:
  相似文献   
107.
Variable symmetries in a constraint satisfaction problem can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can require a huge number of constraints. This adds an unacceptable overhead to the solving process. Methods exist by which this large set of ordering constraints can be reduced to a much smaller set automatically, but their application is also prohibitively costly. In contrast, this paper takes a bottom-up approach. It examines some commonly-occurring families of groups and derives a minimal set of ordering constraints sufficient to break the symmetry each group describes. These minimal sets are then used as building blocks to generate minimal sets of ordering constraints for groups constructed via direct and imprimitive wreath products. Experimental results confirm the value of minimal sets of ordering constraints, which can now be generated much more cheaply than with previous methods.  相似文献   
108.
One of the applications of workflow systems is the management of administrative processes characterized by the transmission of information elements among users of an organization. Tasks contained in these processes are carried out by users responsible for confirming, modifying or adding information throughout. These processes need to be defined in workflow management systems in which all the elements are perfectly identified and are easily adaptable to changes that may arise in the sequences of tasks, in the users involved or in the data transmitted from one task to another. For this kind of processes is easier to reuse those represented in ontologies. On one hand, existing ontologies for representing some domain elements can be reused. At the same time, ontologies have an excellent expressive capacity to define tasks, their relationships and the flow control among them with precision. This paper proposes a complete model, together with the necessary software tools, for tackling this issue.
álvaro E. PrietoEmail:

álvaro E. Prieto   is a teaching/research assistant professor of Computer Science at the University of Extremadura, Spain. He has an MSc in Computer Science from the University of Extremadura (2000). His Ph.D. research addresses the use of ontologies in workflows. He is currently involved in various national and regional R&D&I projects. Adolfo Lozano-Tello   is teaching/research assistant professor of Computer Science Department at University of Extremadura, Spain. He is a Ph.D. (2002) with a special prize of extraordinary thesis about selection of ontologies for software applications. He has published more than 50 papers on the above issues on Software Engineering and Knowledge Engineering.  相似文献   
109.
PURPOSE: To assess the "in vivo" effect of 13-cis-retinoic acid and low dose Ara-C in MDS as well as to establish "in vitro" advantage of retinoid dose-related growth pattern on bone marrow cultures as defined by culture timing and CFU-GM proliferative response. PATIENTS AND METHODS: We evaluated 28 patients diagnosed of MDS according to FAB classification, of whom 4 cases had RA, 8 cases SRA, 14 cases RAEB and 2 cases RAEB-T. Patients who had RA and SRA were treated with oral 13-cis-retinoic acid at doses of 20-40 mg daily for 4 months and those cases with RAEB and RAEB-T had subcutaneous Ara-C at doses of 3 mg/m2 twice a day for 21 days. The "in vivo" and "in vitro" effect of retinoic acid on the haemopoietic differentiation was evaluated by the growth CFU-GM in semisolid cell culture methods. RESULTS: Increasing in vitro concentrations of 13-cis retinoic acid did not enhance the growth of myelodysplastic progenitors. Nevertheless, our study did not find any beneficial therapeutic effect of retinoic compounds in MDS patients. In this study, low-dose Ara-C (3 mg/m2) showed similar effects when compared with higher doses reported by others. Furthermore, in terms of CFU-GM proliferation the concentration of colonies before and after treatment were fairly similar in all but two patients. CONCLUSIONS: The results drawn from our study demonstrated that there is no beneficial advantage of 13-cis-retinoic acid as a differentiation inducing agent on myelodysplastic patients. In contrast, lower doses of Ara-C showed similar effects on haemopoiesis of MDS patients than standard doses of 10-20 mg/m2 but with less side effects.  相似文献   
110.
Magnetic Resonance Materials in Physics, Biology and Medicine - Histogram-based metrics extracted from diffusion-tensor imaging (DTI) have been suggested as potential biomarkers for cerebral small...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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