首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   96篇
  免费   2篇
化学   54篇
力学   5篇
数学   23篇
物理学   16篇
  2022年   1篇
  2017年   1篇
  2015年   1篇
  2013年   3篇
  2012年   5篇
  2011年   2篇
  2010年   4篇
  2009年   3篇
  2008年   5篇
  2007年   5篇
  2006年   3篇
  2004年   1篇
  2003年   3篇
  2001年   4篇
  2000年   1篇
  1999年   4篇
  1998年   3篇
  1996年   1篇
  1995年   1篇
  1994年   2篇
  1993年   4篇
  1992年   1篇
  1991年   1篇
  1990年   4篇
  1989年   4篇
  1987年   5篇
  1986年   1篇
  1985年   7篇
  1984年   4篇
  1982年   1篇
  1981年   2篇
  1980年   3篇
  1979年   2篇
  1976年   1篇
  1975年   1篇
  1969年   3篇
  1966年   1篇
排序方式: 共有98条查询结果,搜索用时 78 毫秒
1.
New, rapid, and inexpensive methods that monitor the chemical composition of corn stover and corn stover-derived samples are a key element to enabling the commercialization of processes that convert stover to fuels and chemicals. These new techniques combine near infrared (NIR) spectroscopy and projection to latent structures (PLS) multivariate analysis to allow the compositional analysis of hundreds of samples in 1 d at a cost of about $10 each. The new NIR/PLS rapid analysis methods can also be used to support a variety of research projects that would have been too costly to pursue by traditional methods.  相似文献   
2.
3.
We consider a priority queue in steady state with N servers, two classes of customers, and a cutoff service discipline. Low priority arrivals are "cut off" (refused immediate service) and placed in a queue whenever N1 or more servers are busy, in order to keep N-N1 servers free for high priority arrivals. A Poisson arrival process for each class, and a common exponential service rate, are assumed. Two models are considered: one where high priority customers queue for service and one where they are lost if all servers are busy at an arrival epoch. Results are obtained for the probability of n servers busy, the expected low priority waiting time, and (in the case where high priority customers do not queue) the complete low priority waiting time distribution. The results are applied to determine the number of ambulances required in an urban fleet which serves both emergency calls and low priority patients transfers.  相似文献   
4.
5.
The clustered regularly interspaced short palindromic repeat (CRISPR)/Cas system is best known for its role in genomic editing. It has also demonstrated great potential in nucleic acid biosensing. However, the specificity limitation in CRISPR/Cas has created a hurdle for its advancement. More recently, nucleic acid aptamers known for their high affinity and specificity properties for their targets have been integrated into CRISPR/Cas systems. This review article gives a brief overview of the aptamer and CRISPR/Cas technology and provides an updated summary and discussion on how the two distinctive nucleic acid technologies are being integrated into modern diagnostic and therapeutic applications  相似文献   
6.
Hydride addition to either an 80:20 or a 93:7 E/Z isomer ratio of coordinated imine complex 2a occurs with high diastereoselectivity. The high diastereoselectivity regardless of the reagent E/Z ratio is explained by a difference between the relative kinetic acidities of the E and Z isomers of the imine complex. The kinetic acidities of related isopropylimine and 3-pentylimine complexes were used in explaining these results.  相似文献   
7.
An infinite server queue is considered where customers have a choice of individual service or batch service. Transient results have been obtained for the first two moments of the system size distribution. Waiting time distribution is important in system evaluation and steady state results are obtained.  相似文献   
8.
Queueing theorists have presented, as solutions to many queueing models, probability generating functions in which state probabilities are expressed as functions of the roots of characteristic equations, evaluation of the roots in particular cases being left to the reader. Many users have complained that such solutions are inadequate. Some queueing theorists, in particular Neuts [6], rather than use Rouché's theorem to count roots and an equation-solver to find them, have developed new algorithms to solve queueing problems numerically, without explicit calculation of roots. Powell [7] has shown that in many bulk service queues arising in transportation models, characteristic equations can be solved and state probabilities can be found without serious difficulty, even when the number of roots to be found is large. We have slightly modified Powell's method, and have extended his work to cover a number of bulk-service queues discussed by Chaudhry et al. [1] and a number of bulk-arrival queues discussed in the present paper.  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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