全文获取类型
收费全文 | 700篇 |
免费 | 10篇 |
国内免费 | 9篇 |
专业分类
化学 | 213篇 |
晶体学 | 2篇 |
力学 | 18篇 |
数学 | 298篇 |
物理学 | 188篇 |
出版年
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 12篇 |
2017年 | 10篇 |
2016年 | 15篇 |
2015年 | 6篇 |
2014年 | 13篇 |
2013年 | 33篇 |
2012年 | 29篇 |
2011年 | 28篇 |
2010年 | 14篇 |
2009年 | 13篇 |
2008年 | 24篇 |
2007年 | 34篇 |
2006年 | 38篇 |
2005年 | 36篇 |
2004年 | 24篇 |
2003年 | 21篇 |
2002年 | 21篇 |
2001年 | 8篇 |
2000年 | 13篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 15篇 |
1995年 | 11篇 |
1994年 | 16篇 |
1993年 | 16篇 |
1992年 | 22篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 16篇 |
1984年 | 17篇 |
1983年 | 12篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 12篇 |
1974年 | 9篇 |
1973年 | 3篇 |
1971年 | 2篇 |
1967年 | 3篇 |
排序方式: 共有719条查询结果,搜索用时 31 毫秒
661.
662.
Marisa G. Kantor Moshe B. Rosenwein 《The Journal of the Operational Research Society》1992,43(6):629-635
The orienteering problem with time windows, denoted by OPTW, belongs to a class of routeing and scheduling problems that arise in physical distribution. It may be modelled as a problem on a graph. It considers a set of nodes (customers), each with an associated profit and service duration (time window), and a set of arcs, each with an associated travel time. The objective of the problem is to construct an acyclic path beginning at a specified origin and ending at a specified destination that maximizes the total profit while observing time window constraints on all nodes and not exceeding a designated time limit. The problem is classified as NP-hard and, thus, an exact algorithm that executes in reasonable computational time is unlikely to exist. Since the problem is highly-constrained, we were able to develop a heuristic (referred to as the ‘tree’ heuristic) based upon an exhaustive search of the feasible solution space. The tree heuristic systematically generates a list of feasible paths and then selects the most profitable path from the list. In comparison with an insertion heuristic, the tree heuristic was found to produce improved values of total profit for heavily-constrained, modest-sized problems with reasonable computational effort. 相似文献
663.
A queueingnetwork that is served by asingle server in a cyclic order is analyzed in this paper. Customers arrive at the queues from outside the network according to independent Poisson processes. Upon completion of his service, a customer mayleave the network, berouted to another queue in the network orrejoin the same queue for another portion of service. The single server moves through the different queues of the network in a cyclic manner. Whenever the server arrives at a queue (polls the queue), he serves the waiting customers in that queue according to some service discipline. Both the gated and the exhaustive disciplines are considered. When moving from one queue to the next queue, the server incurs a switch-over period. This queueing network model has many applications in communication, computer, robotics and manufacturing systems. Examples include token rings, single-processor multi-task systems and others. For this model, we derive the generating function and the expected number of customers present in the network queues at arbitrary epochs, and compute the expected values of the delays observed by the customers. In addition, we derive the expected delay of customers that follow a specific route in the network, and we introduce pseudo-conservation laws for this network of queues.Summary of notation Bi, B
i
*
(s)
service time of a customer at queue i and its LST
- bi, bi
(2)
mean and second moment of Bi
- Ri, R
i
*
(s)
duration of switch-over period from queue i and its LST
- ri, ri
mean and second moment of Ri
- r, r(2)
mean and second moment of
i
N
=1Ri
- i
external arrival rate of type-i customers
- i
total arrival rate into queue i
- i
utilization of queue i; i=i
-
system utilization
i
N
=1i
- c=E[C]
the expected cycle length
- X
i
j
number of customers in queue j when queue i is polled
- Xi=X
i
i
number of customers residing in queue i when it is polled
- fi(j)
- X
i
*
number of customers residing in queue i at an arbitrary moment
- Yi
the duration of a service period of queue i
- Wi,Ti
the waiting time and sojourn time of an arbitary customer at queue i
- F*(z1, z2,..., zN)
GF of number of customers present at the queues at arbitrary moments
- Fi(z1, z2,..., zN)
GF of number of customers present at the queues at polling instants of queue i
- ¯Fi(z1, z2,...,zN)
GF of number of customers present at the queues at switching instants of queue i
- Vi(z1, z2,..., zN)
GF of number of customers present at the queues at service initiation instants at queue i
- ¯Vi(z1,z2,...,zN)
GF of number of customers present at the queues at service completion instants at queue i
The work of this author was supported by the Bernstein Fund for the Promotion of Research and by the Fund for the Promotion of Research at the Technion.Part of this work was done while H. Levy was with AT&T Bell Laboratories. 相似文献
664.
Yaniv Gelbstein Ohad Ben-YehudaZinovy Dashevsky Moshe P. Dariel 《Journal of Crystal Growth》2009,311(18):4289-4292
p-type (Pb,Sn,Ge)Te-based alloys for thermoelectric applications were prepared using Bridgman technique. Second-order, rhombohedral to cubic phase transitions are involved, as evaluated from anomalies in the temperature dependence values of Seebeck coefficient, electrical conductivity, heat flow and the elongation, in the vicinity of the phase transition temperature, Tc. The correlation between these anomalies in both the electronic and thermodynamic properties was interpreted by means of the relationship of Fermi energy to the chemical potential (or to the molar Gibbs free energy). 相似文献
665.
Ioseph Gurwich Moshe Kleiman Nir Shiloah 《Journal of Quantitative Spectroscopy & Radiative Transfer》2008,109(8):1392-1403
We consider here the electromagnetic scattering by a long helical particle made from a thin (in comparison to the wavelength) wire. In contrast to several previous theoretical works, we adopt here the algorithm developed for scattering by a multi-layered fiber. In the present work, the helical particle is considered as a hollow cylinder with a thin non-homogeneous membrane for which periodical boundary conditions are imposed. 相似文献
666.
Ehud Moshe Baruch 《Transactions of the American Mathematical Society》2001,353(7):2601-2614
We show that the Bessel distribution attached by Gelfand and Kazhdan and by Shalika to a generic representation of a quasi-split reductive group over a local field is given by a function when it is restricted to the open Bruhat cell. As in the case of the character distribution, this function is real analytic for archimedean fields and locally constant for non-archimidean fields.
667.
Amihood Amir Dmitry Keselman Gad M. Landau Moshe Lewenstein Noa Lewenstein Michael Rodeh 《Journal of Algorithms in Cognition, Informatics and Logic》2000,37(2)
The indexing problem is where a text is preprocessed and subsequent queries of the form “Find all occurrences of pattern P in the text” are answered in time proportional to the length of the query and the number of occurrences. In the dictionary matching problem a set of patterns is preprocessed and subsequent queries of the form “Find all occurrences of dictionary patterns in text T” are answered in time proportional to the length of the text and the number of occurrences.There exist efficient worst-case solutions for the indexing problem and the dictionary matching problem, but none that find approximate occurrences of the patterns, i.e., where the pattern is within a bound edit (or Hamming) distance from the appropriate text location.In this paper we present a uniform deterministic solution to both the indexing and the general dictionary matching problem with one error. We preprocess the data in time O(n log2 n), where n is the text size in the indexing problem and the dictionary size in the dictionary matching problem. Our query time for the indexing problem is O(m log n log log n + tocc), where m is the query string size and tocc is the number of occurrences. Our query time for the dictionary matching problem is O(n log3 d log log d + tocc), where n is the text size and d the dictionary size. The time bounds above apply to both bounded and unbounded alphabets. 相似文献
668.
We propose a new methodology for modeling and analyzing power-tail distributions, such as the Pareto distribution, in communication
networks. The basis of our approach is a fitting algorithm which approximates a power-tail distribution by a hyperexponential
distribution. This algorithm possesses several key properties. First, the approximation can be achieved within any desired
degree of accuracy. Second, the fitted hyperexponential distribution depends only on a few parameters. Third, only a small
number of exponentials are required in order to obtain an accurate approximation over many time scales. Once equipped with
a fitted hyperexponential distribution, we have an integrated framework for analyzing queueing systems with power-tail distributions.
We consider the GI/G/1 queue with Pareto distributed service time and show how our approach allows to derive both quantitative
numerical results and asymptotic closed-form results. This derivation shows that classical teletraffic methods can be employed
for the analysis of power-tail distributions.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
669.
An amine mono(phenolate) ligand bearing two side-arm donors led to octahedral trialkoxo and trialkyl group IV metal complexes, in which one of the donors was unbound, and to exceptionally stable cationic complexes in which the two side-arm donors were tightly bound. 相似文献
670.
William Heinzer Moshe Roitman 《Proceedings of the American Mathematical Society》2002,130(6):1573-1580
Suppose is a torsion-free cancellative commutative monoid for which the group of quotients is finitely generated. We prove that the spectrum of a -graded commutative ring is Noetherian if its homogeneous spectrum is Noetherian, thus answering a question of David Rush. Suppose is a commutative ring having Noetherian spectrum. We determine conditions in order that the monoid ring have Noetherian spectrum. If , we show that has Noetherian spectrum, while for each we establish existence of an example where the homogeneous spectrum of is not Noetherian.