首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   403篇
  免费   10篇
电工技术   1篇
化学工业   75篇
金属工艺   4篇
机械仪表   8篇
建筑科学   12篇
能源动力   5篇
轻工业   25篇
水利工程   2篇
石油天然气   2篇
无线电   28篇
一般工业技术   50篇
冶金工业   125篇
自动化技术   76篇
  2023年   7篇
  2022年   24篇
  2021年   23篇
  2020年   6篇
  2019年   10篇
  2018年   8篇
  2017年   8篇
  2016年   9篇
  2015年   8篇
  2014年   12篇
  2013年   16篇
  2012年   15篇
  2011年   22篇
  2010年   11篇
  2009年   16篇
  2008年   17篇
  2007年   11篇
  2006年   9篇
  2005年   17篇
  2004年   10篇
  2003年   3篇
  2002年   10篇
  2001年   5篇
  2000年   4篇
  1999年   14篇
  1998年   31篇
  1997年   15篇
  1996年   11篇
  1995年   13篇
  1994年   6篇
  1993年   9篇
  1992年   3篇
  1991年   7篇
  1990年   2篇
  1989年   1篇
  1988年   2篇
  1987年   1篇
  1986年   2篇
  1985年   2篇
  1983年   1篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
  1977年   1篇
  1976年   2篇
  1974年   2篇
  1962年   1篇
  1961年   1篇
  1960年   1篇
排序方式: 共有413条查询结果,搜索用时 18 毫秒
81.
82.
The authors report a case of an infant in whom orbital capillary hemangioma was diagnosed using technetium-99m-labeled red blood cell scintigraphy. The tumor was subsequently removed by transconjunctival cryoextraction.  相似文献   
83.
84.
Gene recognition is one of the most important problems in computational molecular biology. Previous attempts to solve this problem were based on statistics, and applications of combinatorial methods for gene recognition were almost unexplored. Recent advances in large-scale cDNA sequencing open a way toward a new approach to gene recognition that uses previously sequenced genes as a clue for recognition of newly sequenced genes. This paper describes a spliced alignment algorithm and software tool that explores all possible exon assemblies in polynomial time and finds the multiexon structure with the best fit to a related protein. Unlike other existing methods, the algorithm successfully recognizes genes even in the case of short exons or exons with unusual codon usage; we also report correct assemblies for genes with more than 10 exons. On a test sample of human genes with known mammalian relatives, the average correlation between the predicted and actual proteins was 99%. The algorithm correctly reconstructed 87% of genes and the rare discrepancies between the predicted and real exon-intron structures were caused either by short (less than 5 amino acids) initial/terminal exons or by alternative splicing. Moreover, the algorithm predicts human genes reasonably well when the homologous protein is nonvertebrate or even prokaryotic. The surprisingly good performance of the method was confirmed by extensive simulations: in particular, with target proteins at 160 accepted point mutations (PAM) (25% similarity), the correlation between the predicted and actual genes was still as high as 95%.  相似文献   
85.

The use of propositional logic and systems of linear inequalities over reals is a common means to model software for formal verification. Craig interpolants constitute a central building block in this setting for over-approximating reachable states, e.g. as candidates for inductive loop invariants. Interpolants for a linear system can be efficiently computed from a Simplex refutation by applying the Farkas’ lemma. However, these interpolants do not always suit the verification task—in the worst case, they can even prevent the verification algorithm from converging. This work introduces the decomposed interpolants, a fundamental extension of the Farkas interpolants, obtained by identifying and separating independent components from the interpolant structure, using methods from linear algebra. We also present an efficient polynomial algorithm to compute decomposed interpolants and analyse its properties. We experimentally show that the use of decomposed interpolants in model checking results in immediate convergence on instances where state-of-the-art approaches diverge. Moreover, since being based on the efficient Simplex method, the approach is very competitive in general.

  相似文献   
86.
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of”—without using a stronger statement such as “Ann knows that Bill is aware of \(p\) and Ann is not aware of \(p\) ”, for some particular \(p\) . In Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b) Halpern and Rêgo introduced a logic in which such statements about knowledge of unawareness can be expressed. The logic extends the traditional framework with quantification over formulae, and is thus very expressive. As a consequence, it is not decidable. In this paper we introduce a decidable logic which can be used to reason about certain types of unawareness. Our logic extends the traditional framework with an operator expressing full awareness, i.e., the fact that an agent is aware of everything, and another operator expressing relative awareness, the fact that one agent is aware of everything another agent is aware of. The logic is less expressive than Halpern’s and Rêgo’s logic. It is, however, expressive enough to express all of the motivating examples in Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b). In addition to proving that the logic is decidable and that its satisfiability problem is PSPACE-complete, we present an axiomatisation which we show is sound and complete.  相似文献   
87.
88.
Polyamidoamine prodrugs containing ferrocene derivatives and neridronate were successfully synthesized and characterized by NMR, FTIR, SEM, and EDX analyses. Appearance of characteristic peaks in 1H and 31P NMR or EDX spectra were used to confirm the presence of neridronate or ferrocene in the conjugates and co-conjugates. In vitro evaluation of the new materials revealed improved antimalarial activity, especially for conjugate 5 and corresponding co-conjugate 8, when compared with chloroquine and quinine. Hemolysis studies revealed that synthesized prodrugs had no effect on the integrity of the host red blood cell membrane; a direct effect on the intra-erythrocytic parasite was, however, noted.  相似文献   
89.
90.
Brain‐derived neurotrophic factor (BDNF) is identified as a potent neuroprotective and neuroregenerative agent for many neurological diseases. Regrettably, its delivery to the brain is hampered by poor serum stability and rapid brain clearance. Here, a novel nanoformulation is reported composed of a biocompatible polymer, poly(ethylene glycol)‐b‐poly(l ‐glutamic acid) (PEG‐PLE), that hosts the BDNF molecule in a nanoscale complex, termed here Nano‐BDNF. Upon simple mixture, Nano‐BDNF spontaneously forms uniform spherical particles with a core–shell structure. Molecular dynamics simulations suggest that binding between BDNF and PEG‐PLE is mediated through electrostatic coupling as well as transient hydrogen bonding. The formation of Nano‐BDNF complex stabilizes BDNF and protects it from nonspecific binding with common proteins in the body fluid, while allowing it to associate with its receptors. Following intranasal administration, the nanoformulation improves BDNF delivery throughout the brain and displays a more preferable regional distribution pattern than the native protein. Furthermore, intranasally delivered Nano‐BDNF results in superior neuroprotective effects in the mouse brain with lipopolysaccharides‐induced inflammation, indicating promise for further evaluation of this agent for the therapy of neurologic diseases.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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