全文获取类型
收费全文 | 699篇 |
免费 | 78篇 |
国内免费 | 8篇 |
专业分类
化学 | 6篇 |
力学 | 4篇 |
综合类 | 14篇 |
数学 | 626篇 |
物理学 | 135篇 |
出版年
2023年 | 14篇 |
2022年 | 33篇 |
2021年 | 21篇 |
2020年 | 18篇 |
2019年 | 22篇 |
2018年 | 19篇 |
2017年 | 40篇 |
2016年 | 26篇 |
2015年 | 20篇 |
2014年 | 67篇 |
2013年 | 52篇 |
2012年 | 49篇 |
2011年 | 31篇 |
2010年 | 42篇 |
2009年 | 49篇 |
2008年 | 38篇 |
2007年 | 46篇 |
2006年 | 24篇 |
2005年 | 22篇 |
2004年 | 13篇 |
2003年 | 11篇 |
2002年 | 22篇 |
2001年 | 13篇 |
2000年 | 15篇 |
1999年 | 2篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有785条查询结果,搜索用时 31 毫秒
101.
102.
This paper addresses a single machine scheduling problem in which the actual job processing times are determined by resource allocation function, its position in a sequence and a rate-modifying activity simultaneously. We discuss two objective functions with two resource allocation functions under the consideration of a rate-modifying activity. We show that the problems are solvable in O(n4) time for a linear resource allocation function and are solvable in O(n2logn) time for a convex resource allocation function. 相似文献
103.
We address the concept of an integrated inventory allocation and shipping model for a manufacturer with limited production capacity and multiple types of retailers with different backorder/waiting and delivery costs. The problem is to decide how to allocate and deliver produced items when the total retailer demand exceeds the production capacity, so that total retailer backorder and delivery costs are minimized. Our analytical model provides optimal allocation and shipping policies from the manufacturer’s viewpoint. We also investigate the allocation strategy of a manufacturer competing with other retailers to directly sell to end consumers. 相似文献
104.
Many models have been developed to study homeland security games between governments (defender) and terrorists (attacker, adversary, enemy), with the limiting assumption of the terrorists being rational or strategic. In this paper, we develop a novel hybrid model in which a centralized government allocates defensive resources among multiple potential targets to minimize total expected loss, in the face of a terrorist being either strategic or non-strategic. The attack probabilities of a strategic terrorist are endogenously determined in the model, while the attack probabilities of a non-strategic terrorist are exogenously provided. We study the robustness of defensive resource allocations by comparing the government’s total expected losses when: (a) the government knows the probability that the terrorist is strategic; (b) the government falsely believes that the terrorist is fully strategic, when the terrorist could be non-strategic; and (c) the government falsely believes that the terrorist is fully non-strategic, when the terrorist could be strategic. Besides providing six theorems to highlight the general results, we find that game models are generally preferred to non-game model even when the probability of a non-strategic terrorist is significantly greater than 50%. We conclude that defensive resource allocations based on game-theoretic models would not incur too much additional expected loss and thus more preferred, as compared to non-game-theoretic models. 相似文献
105.
《Operations Research Letters》2020,48(5):630-634
We propose a simple approach to bridge between portfolio theory and machine learning. The outcome is an out-of-sample machine learning efficient frontier based on two assets, high risk and low risk. By rotating between the two assets, we show that the proposed frontier dominates the mean–variance efficient frontier out-of-sample. Our results, therefore, shed important light on the appeal of machine learning into portfolio selection under estimation risk. 相似文献
106.
《Optik》2014,125(16):4446-4451
With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes. 相似文献
107.
G. I. Ivchenko 《Mathematical Notes》1998,64(1):49-54
Let an urn containN balls, numbered from 1 toN. A random number of balls are drawn without replacements from the urn, their numbers are noted and the balls are then returned to the urn. This is done repeatedly, the sample sizes being independent identically distributed. Letv be the number of samples needed to see all the balls. A simple approximation forEv and the asymptotic distribution ofv asN are obtained.Translated fromMatematicheskie Zametki, Vol. 64, No. 1, pp. 58–63, July, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 97-01-00387. 相似文献
108.
We propose subject matter expert refined topic (SMERT) allocation, a generative probabilistic model applicable to clustering freestyle text. SMERT models are three‐level hierarchical Bayesian models in which each item is modeled as a finite mixture over a set of topics. In addition to discrete data inputs, we introduce binomial inputs. These ‘high‐level’ data inputs permit the ‘boosting’ or affirming of terms in the topic definitions and the ‘zapping’ of other terms. We also present a collapsed Gibbs sampler for efficient estimation. The methods are illustrated using real world data from a call center. Also, we compare SMERT with three alternative approaches and two criteria. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
109.
王雅娟 《数学的实践与认识》2016,(1):62-69
为满足次级用户随时接入频谱的需求,避免次级用户谎报边际估值、到达时间和离开时间的行为,将认知无线电网络中一个频谱经纪人和多个次级用户之间的动态频谱分配问题建模为一个多单位在线拍卖,并提出了一种在线频谱拍卖机制.结果表明,机制不仅能在完全未知将来投标序列的情况下,立即对当前投标做出是否分配频谱的决策,而且满足激励相容性和个体理性,同时,在无干扰的用户之间支持频谱的空间复用性,实现了公平有效的频谱分配.最后,通过实例验证了该机制的实用性和可行性. 相似文献
110.
Julián Costa 《Optimization》2016,65(4):797-809
The class of maintenance cost games was introduced in 2000 to deal with a cost allocation problem arising in the reorganization of the railway system in Europe. The main application of maintenance cost games regards the allocation of the maintenance costs of a facility among the agents using it. To that aim it was first proposed to utilize the Shapley value, whose computation for maintenance cost games can be made in polynomial time. In this paper, we propose to model this cost allocation problem as a maintenance cost game with a priori unions and to use the Owen value as a cost allocation rule. Although the computation of the Owen value has exponential complexity in general, we provide an expression for the Owen value of a maintenance cost game with cubic polynomial complexity. We finish the paper with an illustrative example using data taken from the literature of railways management. 相似文献