首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2540篇
  免费   195篇
  国内免费   5篇
电工技术   36篇
综合类   1篇
化学工业   655篇
金属工艺   51篇
机械仪表   46篇
建筑科学   68篇
矿业工程   4篇
能源动力   90篇
轻工业   245篇
水利工程   21篇
石油天然气   2篇
无线电   230篇
一般工业技术   540篇
冶金工业   143篇
原子能技术   18篇
自动化技术   590篇
  2024年   4篇
  2023年   39篇
  2022年   64篇
  2021年   112篇
  2020年   85篇
  2019年   77篇
  2018年   80篇
  2017年   84篇
  2016年   108篇
  2015年   94篇
  2014年   123篇
  2013年   170篇
  2012年   204篇
  2011年   229篇
  2010年   171篇
  2009年   149篇
  2008年   153篇
  2007年   127篇
  2006年   127篇
  2005年   79篇
  2004年   72篇
  2003年   60篇
  2002年   42篇
  2001年   25篇
  2000年   20篇
  1999年   24篇
  1998年   44篇
  1997年   31篇
  1996年   16篇
  1995年   14篇
  1994年   15篇
  1993年   18篇
  1992年   5篇
  1991年   15篇
  1990年   4篇
  1989年   3篇
  1988年   3篇
  1987年   6篇
  1986年   4篇
  1985年   5篇
  1984年   4篇
  1983年   5篇
  1982年   5篇
  1981年   5篇
  1979年   6篇
  1975年   3篇
  1972年   1篇
  1971年   1篇
  1967年   1篇
  1931年   1篇
排序方式: 共有2740条查询结果,搜索用时 234 毫秒
91.
This paper is devoted to estimation and numerical approximation of basins of attraction for a class of uncertain systems. We consider systems described by a differential equation depending of a disturbance known by its bounds. By using viability theory tools, we derive basins of attraction lower and upper estimates. We present numerical simulation results of the viability kernel algorithm to basin of attraction approximation problems.  相似文献   
92.
Basic algorithms have been proposed in the field of low-power (Yao, F., et al. in Proceedings of lEEE annual foundations of computer science, pp. 374–382, 1995) which compute the minimum energy-schedule for a set of non-recurrent tasks (or jobs) scheduled under EDF on a dynamically variable voltage processor. In this study, we propose improvements upon existing algorithms with lower average and worst-case complexities. They are based on a new EDF feasibility test that helps to identify the “critical intervals”. The complexity of this feasibility test depends on structural characteristics of the set of jobs. More precisely, it depends on how tasks are included one in the other. The first step of the algorithm is to construct the Hasse diagram of the set of tasks where the partial order is defined by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a geometrical representation at each level of the Hasse diagram. The optimal processor speed is chosen according to the maximal slope of each path.
Nicolas NavetEmail:
  相似文献   
93.
Hepatocellular carcinoma (HCC) is a major cause of cancer worldwide. Proteomic studies provide opportunities to uncover targets for the diagnosis and treatment of this disease. However, in HCC developing in a setting of cirrhosis, the detection of proteome alterations may be hampered by the increased cellular heterogeneity of tissue when analysing global liver homogenates. The aim of this study was to evaluate whether the identification of proteome alterations in these HCC cases was improved when the differential protein profile between tumour and non-tumour areas of liver was determined using hepatocytes isolated by laser microdissection (LM). Differential profiles established with LM-hepatocytes and liver section homogenates using 2-DE and MS exhibited noticeable differences: 30% of the protein spots with deregulated expression in tumorous LM-samples did not display any modification in homogenates; conversely 15% of proteins altered in tumorous homogenates were not impaired in LM-hepatocytes. These alterations resulted from the presence in cirrhotic liver of fibrotic stroma which displayed a protein pattern different from that determined in LM-hepatocytes. In conclusion, our data demonstrate the interest of LM in distinguishing between fibrotic and hepatocyte proteome alterations and thus the benefit of LM to proteome studies of HCC developing in a context of cirrhosis.  相似文献   
94.
95.
96.
Analyzing the way computer technologies are used is crucial for their development. Such analyses make it possible to evaluate these technologies and enhance their evolution. The present article presents some ideas drawn from the development of a cooperation platform for elementary school children (10–11 years old). On the basis of an obvious ergonomic requirement, we worked on two other dimensions: cultural aspects and the teaching scenario. The goal was to set up observation situations and analyze the conversations produced during those situations, in order to understand what using the platform meant to both the pupils and their teachers.
Claude GodartEmail:
  相似文献   
97.
The purpose of this study was to establish the incidence of pre-operative digitalization by intravenous digoxin on cardiac arrhythmias in 24 patients with ischemic heart disease who underwent abdominal surgery. Ambulatory electrocardiographic monitoring was performed for 12 hours before digitalization, for 12 hours during digitalization (before surgery), for the whole period of anesthesia. General anesthesia used thiopentone, phenoperidine, pancuronium and suxamethonium for endotracheal intubation. No more premature ventricular (PVC) and auricular contractions were detected after digitalization and during anesthesia and surgery. But PVC with begeminism or severe bradycardia were recorded in two patients and episodes of "torsades de pointes" occurred in two other patients during endotracheal intubation. "Torsades de pointes" have never been reported after suxamethonium and endotracheal intubation in digitalized patients. Digitalization, ischemic heart disease, cardiac effects of suxamethonium might be factors of the onset of these first reported "torsades de pointes". In conclusion, after a pre-operative digitalization in the coronary patients the frequency of arrhythmias is not exaggerated during the pre- or per-operative period except during induction and intubation. As the role of suxamethonium seems to be important as a trigger for severe arrhythmias endotracheal intubation in digitalized coronary patients should be performed without suxamethonium.  相似文献   
98.
We propose a new and simple method for the measurement of microbial concentrations in highly diluted cultures. This method is based on an analysis of the intensity fluctuations of light scattered by microbial cells under laser illumination. Two possible measurement strategies are identified and compared using simulations and measurements of the concentration of gold nanoparticles. Based on this comparison, we show that the concentration of Escherichia coli and Saccharomyces cerevisiae cultures can be easily measured in situ across a concentration range that spans five orders of magnitude. The lowest measurable concentration is three orders of magnitude (1000×) smaller than in current optical density measurements. We show further that this method can also be used to measure the concentration of fluorescent microbial cells. In practice, this new method is well suited to monitor the dynamics of population growth at early colonization of a liquid culture medium. The dynamic data thus obtained are particularly relevant for microbial ecology studies.  相似文献   
99.
Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational biology, and clustering. In this letter, we consider two well-known algorithms designed to solve NMF problems: the multiplicative updates of Lee and Seung and the hierarchical alternating least squares of Cichocki et al. We propose a simple way to significantly accelerate these schemes, based on a careful analysis of the computational cost needed at each iteration, while preserving their convergence properties. This acceleration technique can also be applied to other algorithms, which we illustrate on the projected gradient method of Lin. The efficiency of the accelerated algorithms is empirically demonstrated on image and text data sets and compares favorably with a state-of-the-art alternating nonnegative least squares algorithm.  相似文献   
100.
State-of-the-art theory solvers generally rely on an instantiation of the axioms of the theory, and depending on the solvers, this instantiation is more or less explicit. This paper introduces a generic instantiation scheme for solving SMT problems, along with syntactic criteria to identify the classes of clauses for which it is complete. The instantiation scheme itself is simple to implement, and we have produced an implementation of the syntactic criteria that guarantee a given set of clauses can be safely instantiated. We used our implementation to test the completeness of our scheme for several theories of interest in the SMT community, some of which are listed in the last section of this paper.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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