全文获取类型
收费全文 | 2140篇 |
免费 | 159篇 |
国内免费 | 155篇 |
专业分类
化学 | 16篇 |
力学 | 13篇 |
综合类 | 14篇 |
数学 | 633篇 |
物理学 | 146篇 |
综合类 | 1632篇 |
出版年
2024年 | 14篇 |
2023年 | 39篇 |
2022年 | 69篇 |
2021年 | 56篇 |
2020年 | 62篇 |
2019年 | 55篇 |
2018年 | 55篇 |
2017年 | 81篇 |
2016年 | 68篇 |
2015年 | 83篇 |
2014年 | 151篇 |
2013年 | 125篇 |
2012年 | 166篇 |
2011年 | 142篇 |
2010年 | 118篇 |
2009年 | 154篇 |
2008年 | 105篇 |
2007年 | 163篇 |
2006年 | 104篇 |
2005年 | 99篇 |
2004年 | 84篇 |
2003年 | 81篇 |
2002年 | 59篇 |
2001年 | 43篇 |
2000年 | 44篇 |
1999年 | 32篇 |
1998年 | 26篇 |
1997年 | 24篇 |
1996年 | 20篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 11篇 |
1992年 | 18篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1957年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有2454条查询结果,搜索用时 187 毫秒
961.
Allocation of transmit power is critical for spectrum sharing and coexistence of mutually interfering wireless systems. In this paper we present a novel approach for allocation of transmit power, which is based on a non-greedy procedure that aims at maximizing transmission rate while also controlling interference levels. The proposed approach is fully distributed and requires no central control or coordination. Numerical results obtained from simulations are presented to illustrate the performance of the proposed approach in both sparse and dense environments. In sparse wireless environments, where there are fewer mutually interfering wireless links than available frequency bands, the proposed approach yields power allocations which outperform those obtained by applying alternative power allocation strategies, while in dense environments, where there are more interfering links than available frequency bands, the proposed approach yields power allocations with performance similar to those of existing power strategies. Thus, the distributed power allocation procedure based on the proposed approach is a drop-in replacement algorithm that yields better system throughput than existing algorithms for spectrum sharing. 相似文献
962.
This paper presents an integrated approach to QoS-guided network bandwidth allocation where each traffic flow requires a sufficient bandwidth allocation to support its mean traffic rate and to meet a delay requirement. Under the assumption that the peak rate of each traffic flow is decreasing with the time interval within which the rate is measured, we derive an analytical relationship between the delay bound and the bandwidth requirement for each individual flow. Then, based on a Gaussian aggregate traffic model, we show that two key controllable parameters, the coefficient of variation and the provision for variation for the aggregate traffic flow, determine all three fundamental QoS attributes (throughput, delay, and loss). We illustrate by examples that these results can be used to design admission policies. We demonstrate also quantitatively a remarkable QoS advantage of larger channel bandwidth in a statistical multiplexing environment. The analytical contributions are expected to be generally useful in QoS-guided bandwidth management in broadband networks. 相似文献
963.
Resource allocation problems are typically formulated as mathematical programs with some special structure that facilitates the development of efficient algorithms. We consider a multiperiod problem in which excess resources in one period can be used in subsequent periods. The objective minimizes lexicographically the nonincreasingly sorted vector of weighted deviations of cumulative activity levels from cumulative demands. To this end, we first develop a new minimax algorithm that minimizes the largest weighted deviation among all cumulative activity levels. The minimax algorithm handles resource constraints, ordering constraints, and lower and upper bounds. At each iteration, it fixes certain variables at their lower bounds, and sets groups of other variables equal to each other as long as no lower bounds are violated. The algorithm takes advantage of the problem's special structure; e.g., each term in the objective is a linear decreasing function of only one variable. This algorithm solves large problems very fast, orders of magnitude faster than well known linear programming packages. (The latter are, of course, not designed to solve such minimax problems efficiently.) The lexicographic procedure repeatedly employs the minimax algorithm described above to solve problems, each of the same format but with smaller dimension. 相似文献
964.
深入讨论了在利益分配过程中的多边谈判问题.首先,为确定有效容 量设计了奖罚谈判法,对谈判各方估价相同的离散型分配问题给出了最小 误差法;然后,讨论了利益分配问题的分配原则,提出了合理的分配过程应 满足的两个必要条件;最后,对朴素分配法做了改进,使其适用于谈判各方 估价不同的情况. 相似文献
965.
试论社区经济的再发展 总被引:1,自引:0,他引:1
胡跃国 《科技情报开发与经济》2004,14(4):66-67
随着我国经济体制的转轨,社区就业成为我国再就业的主要渠道。文章论述了社区经济为我国市场经济的发展所带来的促进效应和作用,介绍了发展社区经济的主要内容,提出了发展社区经济应重点解决的几个问题。 相似文献
966.
浅谈供热系统的节能措施 总被引:2,自引:0,他引:2
就供热采暖系统节能提出一些措施办法,从供热系统的经济运行,制定合理的运行调节方式,提高热源锅炉的燃烧技术,采用新设备、新技术几方面入手,可实现供热采暖系统的节能。 相似文献
967.
Directed minimum cost spanning tree problems of a special kind are studied, namely those which show up in considering the
problem of connecting units (houses) in mountains with a purifier. For such problems an easy method is described to obtain
a minimum cost spanning tree. The related cost sharing problem is tackled by considering the corresponding cooperative cost
game with the units as players and also the related connection games, for each unit one. The cores of the connection games
have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas) and also
to a bi-monotonic allocation scheme. These pmas-es for the connection games result in pmas-es for the cost game. 相似文献
968.
蔡成滇 《暨南大学学报(自然科学与医学版)》1989,(3):30-35
本文介绍一种翻译多重赋值语句的方法,用所提出的方法对Pascal S编译程序中翻译赋值语句的assignment过程作了修改。给出了新的assignment过程代码。最后列举一两个编译实例,说明修改后的Pascal S编译程序能成功地编译多重赋值语句。 相似文献
969.
Cost allocation problems arise in many contexts in economics and management science. In a typical problem that we have in
mind, a decision maker must decide how to allocate the joint cost of production among several commodities using prices. Furthermore,
these prices must satisfy certain reasonable postulates among which is the requirement that total revenue associated with
these prices must cover total cost. In this paper, we investigate a generalization of Aumann-Shapley pricing, called Weighted
Aumann-Shapley pricing, that allows for asymmetric pricing of commodities even when those commodities affect costs in a symmetric
fashion. Weighted AS pricing is a natural extension of (symmetric) Aumann-Shapley pricing, and may be considered a non-atomic
analogue of Owen's modified diagonal formula (with respect to the multilinear extension) for the weighted TU Shapley Value.
Received December 1993/Revised version June 1998 相似文献
970.
Kamal Golabi 《European Journal of Operational Research》1985,21(3):347-357
This article reports a procedure developed to assist the U.S. Department of Energy in the selection of a portfolio of proposals addressing the design and manufacture of components of solar photovoltaic arrays, and complete photovoltaic systems. Considerations such as the relative importance of the different components in the overall effort, compatibility of the proposed designs, and budgetary and programmatic issues were complicating factors. The technical quality of each proposal was represented by multiple evaluation measures. These were combined into a single index through the use of multi attributeutility function. Indices representing the relative importance of the various components were then developed, and results in measurable value theory were applied to derive an index of technical quality of a portfolio of proposals. The problem was then formulated as an integer program. It was solved by using an interactive branch and bound code that allowed for sensitivity analysis before selecting the portfolio of proposals for funding.The procedure was successfully applied to funding a portfolio of proposals aimed at reducing the cost of producing photovoltaic arrays, and to several other government-sponsored procurements. 相似文献