全文获取类型
收费全文 | 371篇 |
免费 | 4篇 |
国内免费 | 4篇 |
专业分类
化学 | 125篇 |
晶体学 | 1篇 |
力学 | 12篇 |
数学 | 198篇 |
物理学 | 43篇 |
出版年
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 8篇 |
2016年 | 9篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 17篇 |
2012年 | 9篇 |
2011年 | 20篇 |
2010年 | 10篇 |
2009年 | 16篇 |
2008年 | 10篇 |
2007年 | 19篇 |
2006年 | 24篇 |
2005年 | 11篇 |
2004年 | 13篇 |
2003年 | 13篇 |
2002年 | 8篇 |
2001年 | 13篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1989年 | 2篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有379条查询结果,搜索用时 109 毫秒
91.
Noel D. Uri 《商业与工业应用随机模型》2001,17(3):231-244
Incentive regulation has become an important regulatory tool in the telecommunications industry in the United States. The issue explored here is whether incentive regulation has resulted in an increase in productive efficiency. After providing an overview of the nature of incentive regulation, a methodology for measuring technical inefficiency and its change is introduced. This is a stochastic frontier production function approach reflecting technical inefficiency effects. The results of implementing this methodology suggest that in the production of interLATA billed access minutes for interstate calls, there was no change in technical efficiency, something that incentive regulation was specifically designed to enhance. Finally, an assessment of technical efficiency across individual LECs in the United States indicates considerable variability. Published in 2001 by John Wiley & Sons, Ltd. 相似文献
92.
We consider an infinitely repeated two-person zero-sum game with incomplete information on one side, in which the maximizer
is the (more) informed player. Such games have value v
∞ (p) for all 0≤p≤1. The informed player can guarantee that all along the game the average payoff per stage will be greater than or equal to
v
∞ (p) (and will converge from above to v
∞ (p) if the minimizer plays optimally). Thus there is a conflict of interest between the two players as to the speed of convergence
of the average payoffs-to the value v
∞ (p). In the context of such repeated games, we define a game for the speed of convergence, denoted SG
∞ (p), and a value for this game. We prove that the value exists for games with the highest error term, i.e., games in which v
n (p)− v
∞ (p) is of the order of magnitude of . In that case the value of SG
∞ (p) is of the order of magnitude of . We then show a class of games for which the value does not exist. Given any infinite martingale 𝔛∞={X
k }∞
k=1, one defines for each n : V
n (𝔛∞) ≔E∑n
k=1 |X
k+1 − X
k|. For our first result we prove that for a uniformly bounded, infinite martingale 𝔛∞, V
n (𝔛∞) can be of the order of magnitude of n
1/2−ε, for arbitrarily small ε>0.
Received January 1999/Final version April 2002 相似文献
93.
A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular. 相似文献
94.
Uri Onn 《Advances in Mathematics》2006,204(1):152-175
95.
We compare two routing-control strategies in a high-speed communication network with c parallel channels (routes), where information on service completions in down-stream servers is randomly delayed. The controller can either hold arriving messages in a common buffer, dispatching them to servers only when the delayed information becomes available (Wait option), or route jobs to the various channels, in a round-robin fashion, immediately upon their arrival. Interpreting the delays as servers's vacations and considering overall queue sizes as a measure of performance, we show that the Wait strategy is superior as long as the mean information delay is below a threshold. We calculate threshold values for various combinations of load and c and show that, for a given load, the threshold increases with c and, for fixed c, the threshold decreases with an increasing load. If information is delayed on arrival instants, rather than on service completions, we show that the system can be viewed as a tandem queue and derive a generalization of a queue-decomposition result obtained by Altman, Kofman and Yechiali. 相似文献
96.
97.
Uri Ben-Ya'acov 《Foundations of Physics》1995,25(12):1733-1740
The aging of the two brothers in the twins paradox is analyzed through the space-time evolution of the densities that correspond to their internal complex structure. Taking into account their relative motion, it is shown that the traveling brother evolves over a shorter interval of time than his twin, which makes him younger than his brother. 相似文献
98.
Lighting-up the dynamics of telomerization and DNA replication by CdSe-ZnS quantum dots 总被引:7,自引:0,他引:7
Patolsky F Gill R Weizmann Y Mokari T Banin U Willner I 《Journal of the American Chemical Society》2003,125(46):13918-13919
CdSe-ZnS core-shell quantum dots (QDs) act as photochemical centers for lighting-up the dynamics of telomerization or DNA replication. 相似文献
99.
Electronic tunneling in a complex molecular network of N(>2) donor/acceptor sites, connected by molecular bridges, is analyzed. The "deep" tunneling dynamics is formulated using a recursive perturbation expansion, yielding a McConnell-type reduced N-level model Hamiltonian. Applications to models of molecular junctions demonstrate that the donor-bridge contact parameters can be tuned in order to control the tunneling dynamics and particularly to direct the tunneling pathway to either one of the various acceptors. 相似文献
100.
We introduce, analyse and optimize the class of Bernoulli random polling systems. The server movescyclically among N channels (queues), butChange-over times between stations are composed ofwalking times required to move from one channel to another andswitch-in times that are incurredonly when the server actually enters a station to render service. The server uses aBernoulli random mechanism to decide whether to serve a queue or not: upon arrival to channeli, it switches in with probabilityp
i
, or moves on to the next queue (w.p. 1 —p
i
) without serving any customer (e.g. packet or job). The Cyclic Bernoulli Polling (CBP) scheme is independent of the service regime in any particular station, and may be applied to any service discipline. In this paper we analyse three different service disciplines under the CBP scheme: Gated, Partially Exhaustive and Fully Exhaustive. For each regime we derive expressions for (i) the generating functions and moments of the number of customers (jobs) at the various queues at polling instants, (ii) the expected number of jobs that an arbitrary departing job leaves behind it, and (iii) the LST and expectation of the waiting time of a cutomer at any given queue. The fact that these measures of performance can be explicitly obtained under the CBP is an advantage over all parameterized cyclic polling schemes (such as the k-limited discipline) that have been studied in the literature, and for which explicit measures of performance are hard to obtain. The choice of thep
i
's in the CBP allows for fine tuning and optimization of performance measures, as well as prioritization between stations (this being achieved at a low computational cost). For this purpose, we develop a Pseudo-conservation law for amixed system comprised of channels from all three service disciplines, and define a Mathematical Program to find the optimal values of the probabilities {p
i
}
i
N
=1 so as to minimize the expected amount of unfinished work in the system. Any CBP scheme for which the optimalp
i
's are not all equal to one, yields asmaller amount of the expected unfinished work in the system than that in the standard cyclic polling procedure with equivalent parameters. We conclude by showing that even in the case of a single queue, it is not always true thatp
1=1 is the best strategy, and derive conditions under which it is optimal to havep
1 < 1.Supported by a Grant from the France-Israel Scientific Cooperation (in Computer Science and Engineering) between the French Ministry of Research and Technology and the Israeli Ministry of Science and Technology, Grant Number 3321190. 相似文献