全文获取类型
收费全文 | 2483篇 |
免费 | 340篇 |
国内免费 | 13篇 |
专业分类
化学 | 10篇 |
力学 | 4篇 |
综合类 | 15篇 |
数学 | 624篇 |
物理学 | 156篇 |
无线电 | 2027篇 |
出版年
2024年 | 18篇 |
2023年 | 76篇 |
2022年 | 89篇 |
2021年 | 79篇 |
2020年 | 98篇 |
2019年 | 94篇 |
2018年 | 75篇 |
2017年 | 120篇 |
2016年 | 114篇 |
2015年 | 128篇 |
2014年 | 235篇 |
2013年 | 177篇 |
2012年 | 192篇 |
2011年 | 166篇 |
2010年 | 159篇 |
2009年 | 144篇 |
2008年 | 133篇 |
2007年 | 139篇 |
2006年 | 112篇 |
2005年 | 78篇 |
2004年 | 50篇 |
2003年 | 69篇 |
2002年 | 60篇 |
2001年 | 47篇 |
2000年 | 33篇 |
1999年 | 15篇 |
1998年 | 24篇 |
1997年 | 22篇 |
1996年 | 16篇 |
1995年 | 11篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2836条查询结果,搜索用时 31 毫秒
21.
在3G(第3代移动通信系统)中,为了给不同类型的业务提供不同级别的端到端QoS,网络资源必须进行合理分配。QoS和资源分配是密不可分的,而无线资源分配显得尤为重要。文中提出了UMTS的QoS结构,分3部分对空中接口部分的QoS(即无线资源分配策略问题)进行了讨论:首先提出了一种RRA算法,接着讨论了W-CDMA和TD-CDMA系统的无线资源分配问题,最后讨论了下行链路及上行链路的呼叫允许控制(CAC)。 相似文献
22.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
23.
在CATV系统网络工程设计中,技术指标的分配产关键问题。本文介绍了石家庄市在系统设计时采用的符合实际的设计程序,并对系统前端,传输及用户网各部分技术指标的确定,计算与分配方法,指标的核算等作了较详细地阐述,以供同行参考。 相似文献
24.
We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. 相似文献
25.
This paper studies a supply chain consisting of two suppliers and one retailer in a spot market, where the retailer uses the
newsvendor solution as its purchase policy, and suppliers compete for the retailer’s purchase. Since each supplier’s bidding
strategy affects the other’s profit, a game theory approach is used to identify optimal bidding strategies. We prove the existence
and uniqueness of a Nash solution. It is also shown that the competition between the supplier leads to a lower market clearing
price, and as a result, the retailer benefits from it. Finally, we demonstrate the applicability of the obtained results by
deriving optimal bidding strategies for power generator plants in the deregulated California energy market.
Supported in part by RGC (Hong Kong) Competitive Earmarked Research Grants (CUHK4167/04E and CUHK4239/03E), a Distinguished
Young Investigator Grant from the National Natural Sciences Foundation of China, and a grant from Hundred Talents Program
of the Chinese Academy of Sciences. 相似文献
26.
In order to alleviate the energy consumption problem caused by the increasing number of Internet of things (IoT) nodes,an energy-efficient (EE) maximization based resource allocation algorithm was proposed for multi-carrier wireless-powered backscatter communication network.Firstly,a multivariable and nonlinear resource allocation model was formulated to jointly optimize transmit power,transmission time,reflection coefficient,and energy-harvesting allocation coefficient,where the maximum transmit power constraint of the power station and the minimum harvested energy constraint at the backscatter device were considered.Then,the original non-convex optimization problem was transformed into a convex one which was solved by using Dinkelbach’s method and the variable substitution approach.Furthermore,the analytical solution of the resource allocation problem was obtained based on Lagrange dual theory.Simulation results verify that the proposed algorithm has better EE by comparing it with the existing algorithm under pure backscatter mode and algorithm under the harvested-then-transmit mode. 相似文献
27.
介绍PAL制彩色全电视信号中色同步信号编码原理及恢复逐行倒相副载波的过程中,两种计算色同步信号相位角的方法。并且在实验的基础上得出:最小二乘法在PAL制电视信号的副载波相位角计算中不仅可以满足精度要求,而且简便灵活。 相似文献
28.
We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously
assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per
unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize
the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and
NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that
the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound
on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above
by the number of servers.
相似文献
29.
Paolo Battocchio Francesco Menoncin Olivier Scaillet 《Annals of Operations Research》2007,152(1):141-165
In a financial market with one riskless asset and n risky assets whose prices are lognormal, we solve in a closed form the problem of a pension fund maximizing the expected
CRRA utility of its surplus till the (stochastic) death time of a representative agent. We consider a unique asset allocation
problem for both accumulation and decumulation phases. The optimal investment in the risky assets must decrease during the
first phase and increase during the second one. We accordingly suggest it is not optimal to manage the two phases separately,
and outsourcing of allocation decisions should be avoided in both phases.
JEL: G23, G11
MSC 2000: 62P05, 91B28, 91B30, 91B70, 93E20 相似文献
30.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献