全文获取类型
收费全文 | 303篇 |
免费 | 7篇 |
专业分类
化学 | 175篇 |
晶体学 | 4篇 |
力学 | 2篇 |
数学 | 84篇 |
物理学 | 45篇 |
出版年
2023年 | 3篇 |
2018年 | 4篇 |
2016年 | 8篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 11篇 |
2012年 | 13篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 12篇 |
2008年 | 13篇 |
2007年 | 13篇 |
2006年 | 18篇 |
2005年 | 10篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 9篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1988年 | 2篇 |
1985年 | 2篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1978年 | 2篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1968年 | 3篇 |
1966年 | 5篇 |
1944年 | 2篇 |
1942年 | 2篇 |
1937年 | 2篇 |
1930年 | 3篇 |
1929年 | 3篇 |
1927年 | 2篇 |
1926年 | 2篇 |
1915年 | 3篇 |
1910年 | 4篇 |
1909年 | 5篇 |
1908年 | 6篇 |
1893年 | 2篇 |
1887年 | 4篇 |
排序方式: 共有310条查询结果,搜索用时 46 毫秒
61.
Angelina Sarapulova Daria Mikhailova Ljubomira Ana Schmitt Steffen Oswald Natalia Bramnik Helmut Ehrenberg 《Journal of Sol-Gel Science and Technology》2012,62(1):98-110
LiCoPO4-coated disordered carbon nanofibers (CNFs/LiCoPO4) were obtained by a sol–gel method, using triethyl phosphite or triethyl phosphate as the phosphorous source. The crystal
structure of the products was analyzed by X-ray powder diffraction, while morphology was studied using scanning electron microscopy,
transmission electron microscopy, Auger electron spectroscopy and X-ray photoelectron spectroscopy. Optimal synthesis conditions
for the CNFs/LiCoPO4 in light of the best electrochemical performance are discussed. The best discharge capacity 105 mAh/g (or ca. 63% of the
theoretical capacity) shows the material with 40% CNFs/LiCoPO4 and addition coating by carbon black. This composition has a best purity of active materials and point coverage of CNFs.
The X-ray photoelectron C1s spectra of the CNFs surface without and with sputter erosion show enhancement of C–O bonds at
the fiber surface, which does not influence significantly electrochemical behavior of the composite materials. 相似文献
62.
Hisao Kameda Eitan Altman Corinne Touati Arnaud Legrand 《Mathematical Methods of Operations Research》2012,76(1):43-65
There are several approaches of sharing resources among users. There is a noncooperative approach wherein each user strives to maximize its own utility. The most common optimality notion is then the Nash equilibrium. Nash equilibria are generally Pareto inefficient. On the other hand, we consider a Nash equilibrium to be fair as it is defined in a context of fair competition without coalitions (such as cartels and syndicates). We show a general framework of systems wherein there exists a Pareto optimal allocation that is Pareto superior to an inefficient Nash equilibrium. We consider this Pareto optimum to be ??Nash equilibrium based fair.?? We further define a ??Nash proportionately fair?? Pareto optimum. We then provide conditions for the existence of a Pareto-optimal allocation that is, truly or most closely, proportional to a Nash equilibrium. As examples that fit in the above framework, we consider noncooperative flow-control problems in communication networks, for which we show the conditions on the existence of Nash-proportionately fair Pareto optimal allocations. 相似文献
63.
64.
Eitan Altman 《Mathematical Methods of Operations Research》1996,43(1):45-72
This paper is the third in a series on constrained Markov decision processes (CMDPs) with a countable state space and unbounded cost. In the previous papers we studied the expected average and the discounted cost. We analyze in this paper the total cost criterion. We study the properties of the set of occupation measures achieved by different classes of policies; we then focus on stationary policies and on mixed deterministic policies and present conditions under which optimal policies exist within these classes. We conclude by introducing an equivalent infinite Linear Program. 相似文献
65.
We introduce a new service discipline, called thesynchronized gated discipline, for polling systems. It arises when there are precedence (or synchronization) constraints between the order that jobs in different qucues should be served. These constraints are described as follows: There areN stations which are fathers of (zero or more)synchronized stations (children). Jobs that arrive at synchronized stations have to be processed only after jobs that arrived prior to them at their corresponding father station have been processed. We analyze the performance of the synchronized gated discipline and obtain expressions for the first two moments and the Laplace-Stieltjes transform (LST) of the waiting times in different stations, and expressions for the moments and LST of other quantities of interest, such as cycle duration and generalized station times. We also obtain a pscudo conservation law for the synchronized gated discipline, and determine the optimal network topology that minimizes the weighted sum of the mean waiting times, as defined in the pseudo conservation law. Numerical examples are given for illustrating the dependence of the performance of the synchronized gated discipline on different parameters of the network.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 No. 3321190. 相似文献
66.
We show that the mixed quantum-classical Liouville equation is equivalent to linearizing the forward-backward action in the influence functional. Derivations are provided in terms of either the diabatic or adiabatic basis sets. An application of the mixed quantum-classical Liouville equation for calculating the memory kernel of the generalized quantum master equation is also presented. The accuracy and computational feasibility of such an approach is demonstrated in the case of a two-level system nonlinearly coupled to an anharmonic bath. 相似文献
67.
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. 相似文献
68.
V.V. Pavlyuk G.S. Dmytriv I.I. Tarasiuk I.V. Chumak H. Pauly H. Ehrenberg 《Solid State Sciences》2010,12(2):274-280
A phase transition from the cubic CsCl-type structure (Pm-3m space group) into a tetragonal UPb-type structure (I41/amd) is observed for the LiAg binary compound at ambient conditions. The crystal structure of the tetragonal modification of the LiAg binary compound was solved by direct methods in SHELXS on the base of structure factors which were extracted from a powder diffraction pattern and refined by SHELXL and the Rietveld method (a = 3.9605(1), c = 8.2825(2) Å, Bragg R-factor = 4.81, Rf-factor = 4.87). Elevated temperatures and/or a small Li-excess versus the equimolar composition favour the cubic structure whereas ambient and lower temperatures and/or a small Li-deficiency stabilize the tetragonal structure. This reconstructive transition is reversible but proceeds slowly. 相似文献
69.
70.