首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4544篇
  免费   449篇
  国内免费   10篇
电工技术   47篇
综合类   6篇
化学工业   1357篇
金属工艺   71篇
机械仪表   104篇
建筑科学   200篇
矿业工程   13篇
能源动力   115篇
轻工业   517篇
水利工程   33篇
石油天然气   12篇
无线电   491篇
一般工业技术   796篇
冶金工业   572篇
原子能技术   47篇
自动化技术   622篇
  2022年   42篇
  2021年   49篇
  2020年   63篇
  2019年   103篇
  2018年   121篇
  2017年   130篇
  2016年   161篇
  2015年   140篇
  2014年   201篇
  2013年   311篇
  2012年   220篇
  2011年   248篇
  2010年   223篇
  2009年   216篇
  2008年   232篇
  2007年   177篇
  2006年   187篇
  2005年   152篇
  2004年   145篇
  2003年   134篇
  2002年   126篇
  2001年   95篇
  2000年   106篇
  1999年   73篇
  1998年   91篇
  1997年   73篇
  1996年   83篇
  1995年   64篇
  1994年   75篇
  1993年   61篇
  1992年   52篇
  1991年   35篇
  1990年   55篇
  1989年   50篇
  1988年   31篇
  1987年   36篇
  1986年   33篇
  1985年   44篇
  1984年   48篇
  1983年   41篇
  1982年   39篇
  1981年   37篇
  1980年   34篇
  1979年   45篇
  1978年   17篇
  1977年   42篇
  1976年   30篇
  1975年   23篇
  1974年   23篇
  1973年   24篇
排序方式: 共有5003条查询结果,搜索用时 15 毫秒
131.
This paper deals with task scheduling, where each task is one particular iteration of a DO loop with partial loop-carried dependencies. Independent iterations of such loops can be scheduled in an order different from the one of classical serial execution, so as to increase program performance.The approach that we present is based both on the use of a directive added to the High Performance Fortran (HPF2) language, which specifies the dependencies between iterations, and on inspector/executor support, implemented in the CoLUMBO library, which builds the task graph and schedules tasks associated with iterations. We validate our approach by showing results achieved on an IBM SP2 for a sparse Cholesky factorization algorithm applied to real problems.  相似文献   
132.
Abstract— TFT‐LCD panels for notebook‐PC applications requires a thin and light form factor, low power consumption, and good display quality, whereas the desktop monitor has different requirements such as large panel size, wide viewing angle, high resolution, brightness, etc. However, for the fifth‐generation of mass production, current panel technologies have to improve in order to cope with these requirements. In this article, various approaches to the manufacturing technologies of next‐generation TFT‐LCDs are discussed.  相似文献   
133.
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mesh with a user defined vertex budget. Our approach can deal with a wide range of applications, from high quality mesh generation to shape approximation. By using appropriate metric constraints the method generates isotropic or anisotropic elements. Based on point-sampling, our algorithm combines the robustness and theoretical strength of Delaunay criteria with the efficiency of entirely discrete geometry processing . Besides the general described framework, we show experimental results using isotropic, quadric-enhanced isotropic and anisotropic metrics which prove the efficiency of our method on large meshes, for a low computational cost.  相似文献   
134.
Several studies have stressed that even expert operators who are aware of a machine's limits could adopt its proposals without questioning them (i.e., the complacency phenomenon). In production scheduling for manufacturing, this is a significant problem, as it is often suggested that the machine be allowed to build the production schedule, confining the human role to that of rescheduling. This article evaluates the characteristics of scheduling algorithms on human rescheduling performance, the quality of which was related to complacency. It is suggested that scheduling algorithms be characterized as having result comprehensibility (the result respects the scheduler's expectations in terms of the discourse rules of the information display) or algorithm comprehensibility (the complexity of the algorithm hides some important constraints). The findings stress, on the one hand, that result comprehensibility is necessary to achieve good production performance and to limit complacency. On the other hand, algorithm comprehensibility leads to poor performance due to the very high cost of understanding the algorithm. © 2008 Wiley Periodicals, Inc.  相似文献   
135.
The front-line antituberculosis drug isoniazid (INH) inhibits InhA, the NADH-dependent fatty acid biosynthesis enoyl ACP-reductase from Mycobacterium tuberculosis, via formation of covalent adducts with NAD (INH-NAD adducts). While ring tautomers were found the main species formed in solution, only the 4S chain INH-NAD tautomer was evidenced in the crystallized InhA:INH-NAD complex. In this study we attempted to explore the modes of interaction and energy binding of the different isomers placed in the active site of InhA with the help of various molecular modelling techniques. Ligand and enzyme models were generated with the help of the Vega ZZ program package. Resulting ligands were then docked into the InhA active site individually using computational automated docking package AUTODOCK 3.0.5. The more relevant docked conformations were then used to compute the interaction energy between the ligands and the InhA cavity. The AM1 Hamiltonian and the QM/MM ONIOM methodologies were used and the results compared. The various tautomers were found docked in almost the same place where INH-NAD was present as predicted by earlier X-ray crystallographic studies. However, some changes of ligand conformation and of the interactions ligand-protein were evidenced. The lower binding energy was observed for the 4S chain adduct that probably represents the effective active form of the INH-NAD adducts, as compared to the 4R epimer. The two 4S,7R and 4R,7S ring tautomers show intermediate and similar binding energies contrasting with their different experimental inhibitory potency on InhA. As a possible explanation based on calculated conformations, we formulated the hypothesis of an initial binding of the two ring tautomers to InhA followed by opening of only the ring hemiamidal 4S,7R tautomer (possibly catalyzed by Tyr158 phenolate basic group) to give the 4S chain INH-NAD tight-binding inhibitor. The predictions of ligand-protein interactions at the molecular level can be of primary importance in elucidating the mechanisms of action of isoniazid and InhA-related resistances, in identifying the effective mycobactericidal entities and, in further step, in the design of a new generation of antitubercular drugs.  相似文献   
136.
The purpose of this study was to describe the traumatology of teaching physical education (PE) and to document the causes and mechanisms of injuries in this occupation. Our sample was composed of 314 physical educators (PEs) teaching at three school levels (primary school, secondary school and college) who responded to a questionnaire survey. The results showed a 0.55 rate of recent lesion per teacher per year (0.65 for women and 0.51 for men). A total of 37.6% of subjects were affected by a lesion during the last year at work. Subjects with a higher weekly frequency of leisure physical activities or endurance activities (five times and more) were less affected by chronic lesions as well as those who frequently practiced aerobic physical activities. Prevalence of chronic injuries was higher in older teachers. Our results confirm that the rate of lesions in this group of workers is high, and that school level and respondent age may influence the rate of lesion and the characteristics of risk factors. In particular, the effect of ageing and teaching specialization on the incidence of occupational problems in PEs warrants further research. Given the relatively high rate of injuries among PE teachers, we suggest that it is necessary to further explore preventive strategies to reduce occupational risk in these workers. In particular, prophylactic physical activity outside of work may represent such a strategy since PEs more active outside their work have lower chronic injury prevalence. PEs gave long periods of standing the highest rating for movements or positions most likely to cause them occupational injuries. It can thus be suggested to find ways to reduce standing position sustained for long periods.  相似文献   
137.
138.
给出了一种电机驱动机器手中非线性机电模型的模糊鲁棒闭环控制系统,此控制系统可处理非结构环境下的三个主要的智能机器人导航问题:自动化规划、快速连续导航中的避障、处理结构和(或)非结构不确定性。  相似文献   
139.
This paper describes a set of visual cues of contact designed to improve the interactive manipulation of virtual objects in industrial assembly/maintenance simulations. These visual cues display information of proximity, contact and effort between virtual objects when the user manipulates a part inside a digital mock-up. The set of visual cues encloses the apparition of glyphs (arrow, disk, or sphere) when the manipulated object is close or in contact with another part of the virtual environment. Light sources can also be added at the level of contact points. A filtering technique is proposed to decrease the number of glyphs displayed at the same time. Various effects--such as change in color, change in size, and deformation of shape- can be applied to the glyphs as a function of proximity with other objects or amplitude of the contact forces. A preliminary evaluation was conducted to gather the subjective preference of a group of participants during the simulation of an automotive assembly operation. The collected questionnaires showed that participants globally appreciated our visual cues of contact. The changes in color appeared to be preferred concerning the display of distances and proximity information. Size changes and deformation effects appeared to be preferred in terms of perception of contact forces between the parts. Last, light sources were selected to focus the attention of the user on the contact areas.  相似文献   
140.
Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite set ofn points in any dimension. In this paper we prove that a randomized construction of thek-Delaunay tree, and thus of all the orderk Voronoi diagrams, can be done inO(n logn+k 3n) expected time and O(k2n) expected storage in the plane, which is asymptotically optimal for fixedk. Our algorithm extends tod-dimensional space with expected time complexityO(k (d+1)/2+1 n (d+1)/2) and space complexityO(k (d+1)/2 n (d+1)/2). The algorithm is simple and experimental results are given.This work has been supported in part by the ESPRIT Basic Research Action No. 3075 (ALCOM).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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