首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   223篇
  免费   13篇
  国内免费   4篇
化学   19篇
力学   1篇
综合类   5篇
数学   171篇
物理学   44篇
  2023年   1篇
  2022年   5篇
  2021年   4篇
  2019年   5篇
  2018年   2篇
  2017年   7篇
  2016年   3篇
  2015年   5篇
  2014年   11篇
  2013年   20篇
  2012年   11篇
  2011年   7篇
  2010年   21篇
  2009年   13篇
  2008年   9篇
  2007年   7篇
  2006年   17篇
  2005年   9篇
  2004年   7篇
  2003年   7篇
  2002年   10篇
  2001年   10篇
  2000年   8篇
  1999年   3篇
  1998年   5篇
  1997年   2篇
  1996年   3篇
  1995年   5篇
  1994年   3篇
  1993年   4篇
  1992年   4篇
  1991年   2篇
  1990年   1篇
  1989年   1篇
  1988年   1篇
  1987年   2篇
  1985年   1篇
  1984年   2篇
  1982年   1篇
  1975年   1篇
排序方式: 共有240条查询结果,搜索用时 31 毫秒
211.
We propose a new design of secured packet switching generated by using nonlinear behaviors of light in a micro ring resonator. The use of chaotic signals generated by the micro ring resonator to form the filtering and packet switching characteristics is described, where the high-capacity and security switching using such form is presented. The key advantage is that the high capacity of communication data can be secured in the transmission link, where the nonlinear penalty of light traveling in the device is beneficial. For instance, the required information can be transmitted and retrieved by using the proposed packet switching scheme. In principle, the chaotic signals are generated by a Kerr effects nonlinear type of light in a micro ring resonator, where the control input power can be specified by the required output filtering signals. The ring radii used range between 10 and 20 μm, κ=0.0225, α=0.5 dB and n2=2.2×10−15 m2/W. Simulation results obtained have been described based on the practical device parameters. Three forms of the applications have been simulated, the potential of using for the tunable band pass and band stop filters, in which high-capacity packet switching data can be performed, and the fs switching time is plausible.  相似文献   
212.
迄今为止,组合拍卖竞胜标问题并不存在一个多项式时间复杂度的算法,其计算复杂性与拍卖效率之间的矛盾一直是影响组合拍卖广泛应用的主要障碍。它是一个NP难问题,也是组合拍卖机制设计中的难题之一。而有穷损害优先方法是纯粹递归论中的一个十分重要的现代方法,特别对NP难问题求解算法的设计,对研究依复杂度决定的偏序结构的构造是一个很基本的有用工具。因此,本文提出根据组合拍卖的内在特性,将各不同的拍卖商品按照拍卖机制的要求,并结合其自身的协同价值等因素,设定一个优先序,然后采用有穷损害优先法有效有序地解决。  相似文献   
213.
《Analytical letters》2012,45(21-22):2095-2101
Abstract

It was found that a commercially available aqueous standard solution of acrylonitrile (1 mg/ml) was below manufacturer specification in concentration when compared to an authentic standard prepared from the pure compound. Comparative analyses of the two solutions, commercial and laboratory prepared acrylonitrile, were conducted by gas chromatography using a flame ionization detector with analytical conditions similar to those recommended by the EPA for acrylonitrile analyses. The acrylonitrile content of the commercial solution was found to be approximately 30% lower than specified. Commercial venders have provided solutions of the 114 organic priority pollutants which are convenient for instrumental calibration. There needs to be concern for experimental results reported with regards to accuracy and estimated detection limit when using such standards.  相似文献   
214.
In this paper,we derive the strong approximations for a four-class two station multi-class queuing network(Kumar-Seidman network) under a priority service discipline.Within a group,jobs are served in the order of arrival,that is,a first-in-first-out disciple,and among groups,jobs are served under a pre-emptiveresume priority disciple.We show that if the input data(i.e.,the arrival and service processe) satisfy an approximation(such as the functional law-of-iterated logarithm approximation or the strong approximation),the output data(the departure processes) and the performance measures(such as the queue length,the work load and the sojourn time process) satisfy a similar approximation.  相似文献   
215.
研究了带启动时间有顾客优先权多重休假的M(1)+M(2)/G/1排队系统,分别给出了两类顾客的稳态队长的母函数和等待时间分布的LST及其随机分解的结果,推导出忙期、假期和启动期的LST等.  相似文献   
216.
Shakkottai  Sanjay  Srikant  R. 《Queueing Systems》2001,39(2-3):183-200
In this paper, we study discrete-time priority queueing systems fed by a large number of arrival streams. We first provide bounds on the actual delay asymptote in terms of the virtual delay asymptote. Then, under suitable assumptions on the arrival process to the queue, we show that these asymptotes are the same. As an application of this result, we then consider a priority queueing system with two queues. Using the earlier result, we derive an upper bound on the tail probability of the delay. Under certain assumptions on the rate function of the arrival process, we show that the upper bound is tight. We then consider a system with Markovian arrivals and numerically evaluate the delay tail probability and validate these results with simulations.  相似文献   
217.
A single server dispenses service to m priority classes. The arrival process of the ith class, i = 1, 2,…,m, is homogeneous Poisson. Service times of each class are independent, identical, arbitrarily-distributed random variables with a finite second moment. The smaller the index of a class, the higher its priority degree. For i < j, class i has preemptive priority over j if and only if j ? i > d (where d is a predetermined non-negative integer), and non-preemptive priority otherwise. An interrupted service is resumed when the system contains no costomers with higher priority, preemptive and non-preemptive. Within each priority class the FIFO rule is obeyed.The preemptive regimes analyzed are repeat with and without resampling. For a k-customer, k = 1, 2,…,n, steady-state Laplace-Stieltjes transforms, and expectations of the waiting time and the time in the system are calculated.  相似文献   
218.
The use of fused silica SE-54 columns in the analysis of complex environmental samples by GC/MS was examined. Column performance was evaluated for the analysis of priority pollutant acid extractables on both an “acid conditioned” column and a “base/neutral conditioned” column. The largest change in column performance was noted when a single column was used to analyze B/N extractables followed by acid extractable priority pollutants. There was evidence of peak skewing, tailing, and loss of sensitivity. Nitrophenols could not be successfully chromatographed. The analysis of phenols on an acid conditioned column was within acceptable limits (peak shapes and accuracy).  相似文献   
219.
The degradation of 4-chlorophenol (4-CP) by using gamma rays generated by a 60Co source in the presence of O3 was investigated. The radiolysis of 4-CP and the kinetics of 4-CP mineralization were analyzed based on the determination of total organic carbon (TOC). The influence of initial 4-CP concentration and the free radicals scavengers (such as NaHCO3 and t-butanol) on the 4-CP degradation was also studied. The results showed that when the radiation rate was 336 Gy·min−1, 4-chlorophenol at concentration of 10 mg·L−1 could be completely degraded at the radiation dose of 2 kGy. The degradation of 4-chlorophenol could be described by a first-order reaction model, the rate constant of 4-CP degradation by combined ozonation and radiation was 0.1016 min−1, which was 2.4 times higher than the sum of radiation (0.0294 min−1) and ozonation (0.0137 min−1). It revealed that the combination of radiation and ozonation resulted in synergistic effect, which can remarkably increase the degradation efficiency of 4-CP.  相似文献   
220.
This paper considers a reader-writer queue with alternating exhaustive priorities. The system can process an unlimited number of readers simultaneously. However, writers have to be processed one at a time. Both readers and writers arrive according to Poisson processes. Writer and reader service times are general iid random variables. There is infinite waiting room for both. The alternating exhaustive priority policy operates as follows. Assume the system is initially idle. The first arriving customer initiates service for the class (readers or writers) to which it belongs. Once processing begins for a given class of customers, this class is served exhaustively, i.e. until no members of that class are left in the system. At this point, if customers of the other class are in the queue, priority switches to this class, and it is served exhaustively. This system is analyzed to produce a stability condition and Laplace-Stieltjes transforms (LSTs) for the steady state queueing times of readers and writers. An example is also given.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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