全文获取类型
收费全文 | 1450篇 |
免费 | 49篇 |
国内免费 | 4篇 |
专业分类
化学 | 24篇 |
力学 | 6篇 |
综合类 | 6篇 |
数学 | 375篇 |
物理学 | 52篇 |
无线电 | 1040篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 12篇 |
2021年 | 18篇 |
2020年 | 24篇 |
2019年 | 30篇 |
2018年 | 18篇 |
2017年 | 28篇 |
2016年 | 33篇 |
2015年 | 35篇 |
2014年 | 96篇 |
2013年 | 85篇 |
2012年 | 102篇 |
2011年 | 66篇 |
2010年 | 90篇 |
2009年 | 96篇 |
2008年 | 105篇 |
2007年 | 109篇 |
2006年 | 85篇 |
2005年 | 75篇 |
2004年 | 55篇 |
2003年 | 56篇 |
2002年 | 51篇 |
2001年 | 31篇 |
2000年 | 42篇 |
1999年 | 16篇 |
1998年 | 17篇 |
1997年 | 21篇 |
1996年 | 18篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 12篇 |
1984年 | 6篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1503条查询结果,搜索用时 15 毫秒
71.
Emilio Carrizosa Horst W. Hamacher Rolf Klein Stefan Nickel 《Journal of Global Optimization》2000,18(2):195-210
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by finding a finite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location.In this paper it is first established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems.Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal objective value. For the approximation problem two different approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed - to polynomial approximation algorithms with accuracy for solving the general model considered in this paper. 相似文献
72.
Jyrki Ari Timo Mika 《AEUE-International Journal of Electronics and Communications》2007,61(2):118-126
In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections’ statistical behavior. The features of the algorithm are simulated and analyzed with and without a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes. 相似文献
73.
卫星导航多系统组合定位技术可以充分发挥各个卫星导航系统的优势,能够大大提高系统的可用性、连续性、可靠性和精度。本文主要对组合定位方式下的几何精度因子进行详细分析,这对多系统组合定位技术的研究具有一定的实际意义和参考价值。 相似文献
74.
随着IPTV技术的成熟和商用试验规模的扩大,IPTV网络系统的整体部署问题逐渐成为运营商面临的紧要问题。作为IPTV的核心系统之一,EPG的规划与设计直接影响着整个系统的效率和用户的体验。本文在介绍了EPG系统功能结构的基础上,分析了目前EPG系统部署存在的问题,提出了分布式部署网络模型,并对两种方案进行了比较,最后给出了进一步发展的建议。 相似文献
75.
全业务运营的重要窗口——融合终端 总被引:1,自引:0,他引:1
介绍融合终端的发展现状和发展趋势,分析融合终端上开展的典型业务,并着重阐述发展融合终端的几个关键问题,包括融合终端的商业模式、融合终端技术以及融合业务。 相似文献
76.
This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic
algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective
single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility
of a facility being open, closed and reopen more than once during the planning horizon. It is possible to distinguish the
opening and reopening periods, assigning them different coefficient values in the objective functions. The algorithm is part
of an interactive procedure that asks the decision maker to define interesting search areas by establishing limits to the
objective function values or by indicating reference points. The procedure will be applied to some illustrative location problems. 相似文献
77.
A simple characterization of weighted Sobolev spaces with bounded multiplication operator 总被引:1,自引:0,他引:1
In this paper we give a simple characterization of weighted Sobolev spaces (with piecewise monotone weights) such that the multiplication operator is bounded: it is bounded if and only if the support of μ0 is large enough. We also prove some basic properties of the appropriate weighted Sobolev spaces. To have bounded multiplication operator has important consequences in Approximation Theory: it implies the uniform bound of the zeros of the corresponding Sobolev orthogonal polynomials, and this fact allows to obtain the asymptotic behavior of Sobolev orthogonal polynomials. 相似文献
78.
We study a two-period intertemporal pricing game in a single-server service system with forward-looking strategic customers who make their purchase decision based on current information and anticipated future gains. Subgame perfect Nash equilibrium (SPNE) prices are derived. A comparison between revenue-maximizing equilibrium prices and welfare-maximizing equilibrium prices is conducted and the impact on the system’s performance of misunderstanding customers’ type is evaluated. 相似文献
79.
This article develops principles for an evaluation of the efficiency of a savings bank. It starts out from the observation that such a bank is less profit oriented than a commercial bank. The customer is a vital stakeholder to the savings bank implying a greater emphasis on customer service provision. We are using data envelopment analysis (DEA) as a method to consider the service orientation of savings banks. We thereby demonstrate how an evaluation of the performance of savings banks according to “service efficiency” differs from an evaluation based on the traditional “profit” or shareholder concept. We determine the number of Swedish savings banks being “service efficient” as well as the average degree of service efficiency in this industry. 相似文献
80.
Erhan Erkut Avraam Karagiannidis George Perkoulidis Stevanus A. Tjandra 《European Journal of Operational Research》2008
Up to 2002, Hellenic Solid Waste Management (SWM) policy specified that each of the country’s 54 prefectural governments plan its own SWM system. After 2002, this authority was shifted to the country’s 13 regions entirely. In this paper, we compare and contrast regional and prefectural SWM planning in Central Macedonia. To design the prefectural plan, we assume that each prefecture must be self-sufficient, and we locate waste facilities in each prefecture. In contrast, in the regional plan, we assume cooperation between prefectures and locate waste facilities to serve the entire region. We present a new multicriteria mixed-integer linear programming model to solve the location–allocation problem for municipal SWM at the regional level. We apply the lexicographic minimax approach to obtain a “fair” nondominated solution, a solution with all normalized objectives as equal to one another as possible. A solution to the model consists of locations and technologies for transfer stations, material recovery facilities, incinerators and sanitary landfills, as well as the waste flow between these locations. 相似文献