全文获取类型
收费全文 | 7295篇 |
免费 | 207篇 |
国内免费 | 126篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 215篇 |
综合类 | 66篇 |
数学 | 6988篇 |
物理学 | 189篇 |
出版年
2023年 | 25篇 |
2022年 | 65篇 |
2021年 | 74篇 |
2020年 | 74篇 |
2019年 | 88篇 |
2018年 | 93篇 |
2017年 | 124篇 |
2016年 | 115篇 |
2015年 | 95篇 |
2014年 | 300篇 |
2013年 | 327篇 |
2012年 | 397篇 |
2011年 | 285篇 |
2010年 | 302篇 |
2009年 | 452篇 |
2008年 | 466篇 |
2007年 | 501篇 |
2006年 | 323篇 |
2005年 | 294篇 |
2004年 | 223篇 |
2003年 | 218篇 |
2002年 | 223篇 |
2001年 | 198篇 |
2000年 | 216篇 |
1999年 | 173篇 |
1998年 | 148篇 |
1997年 | 139篇 |
1996年 | 174篇 |
1995年 | 163篇 |
1994年 | 114篇 |
1993年 | 125篇 |
1992年 | 124篇 |
1991年 | 115篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 107篇 |
1984年 | 75篇 |
1983年 | 21篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有7628条查询结果,搜索用时 15 毫秒
991.
992.
Rikard Althin Lars Behrenz Rolf Färe Shawna Grosskopf Erik Mellander 《European Journal of Operational Research》2010
We measure how well Swedish employment offices perform in delivering the services required of them by the Swedish government. In contrast to earlier studies we use a dynamic efficiency framework, which allows us to better model the intertemporal nature of these services, explicitly allowing for placements of intermediate nature across periods. Rather than using second stage analysis to assess the effects of varying local labor market conditions and differences in client characteristics on performance, we include a measure of the office’s expected work load directly in the model. This measure, derived from duration analysis, is designed to capture the variation across offices in resources needed before an average individual can obtain employment. It is estimated from the characteristics of all unemployed individual and local labor market conditions. 相似文献
993.
We propose both robust and data-driven approaches to a fluid model of call centers that incorporates random arrival rates with abandonment to determine staff levels and dynamic routing policies. We test the resulting models with real data obtained from the call center of a US bank. Computational results show that the robust fluid model is significantly more tractable as compared to the data-driven one and produces overall better solutions to call centers in most experiments. 相似文献
994.
The one-dimensional cutting stock problem is the problem of cutting stock material into shorter lengths, in order to meet demand for these shorter lengths while minimizing waste. In industrial cutting operations, it may also be necessary to fill the orders for these shorter lengths before a given due date. We propose new optimization models and solution procedures which solve the cutting stock problem when orders have due dates. We evaluate our approach using data from a large manufacturer of reinforcement steel and show that we are able to solve industrial-size problems, while also addressing common cutting considerations such as aggregation of orders, multiple stock lengths and cutting different types of material on the same machine. In addition, we evaluate operational performance in terms of resulting waste and tardiness of orders using our model in a rolling horizon framework. 相似文献
995.
We analyze the problem of pricing and hedging contingent claims in the multi-period, discrete time, discrete state case using the concept of a “λ gain–loss ratio opportunity”. Pricing results somewhat different from, but reminiscent of, the arbitrage pricing theorems of mathematical finance are obtained. Our analysis provides tighter price bounds on the contingent claim in an incomplete market, which may converge to a unique price for a specific value of a gain–loss preference parameter imposed by the market while the hedging policies may be different for different sides of the same trade. The results are obtained in the simpler framework of stochastic linear programming in a multi-period setting, and have the appealing feature of being very simple to derive and to articulate even for the non-specialist. They also extend to markets with transaction costs. 相似文献
996.
We consider a type of covering problem in cellular networks. Given the locations of base stations, the problem amounts to determining cell coverage at minimum cost in terms of the power usage. Overlap between adjacent cells is required in order to support handover. The problem we consider is NP-hard. We present integer linear models and study the strengths of their continuous relaxations. Preprocessing is used to reduce problem size and tighten the models. Moreover, we design a tabu search algorithm for finding near-optimal solutions effectively and time-efficiently. We report computational results for both synthesized instances and networks originating from real planning scenarios. The results show that one of the integer models leads to tight bounds, and the tabu search algorithm generates high-quality solutions for large instances in short computing time. 相似文献
997.
In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515–522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to. 相似文献
998.
Airborne radars are widely used to perform a large variety of tasks in an aircraft (searching, tracking, identifying targets, etc.) Such tasks play a crucial role for the aircraft and they are repeated in a “more or less” cyclic fashion. This defines a scheduling problem that impacts a lot on the quality of the radar output and on the overall safety of the aircraft. 相似文献
999.
Shaoxiang Chen Guillermo Gallego Michael Z.F. Li Bing Lin 《European Journal of Operational Research》2010
In this paper, we study a two-flight model where there are two flights between two cities in a day (e.g., one departs at 9:00 am and another at 11:00 am) and booking requests in each fare class arrive according to a random process. There are three types of booking requests: the first and second types are respectively for the first and the second flight only; whereas the third type is flexible and willing to take either flight. Upon receiving a booking request, the airline has to decide whether to accept it, and in case a third type is accepted, which flight to accommodate it. This paper uncovers the structure of optimal booking policies through four monotone switching curves. We also present an extension of the basic model to multiple-flight case. Finally, a numerical example is used to illustrate the derivation and the dynamics of the optimal booking policies. 相似文献
1000.
支持向量机在近十年成为机器学习的主要学习技术,而且已经成功应用到有监督学习问题中。Fung和Mangasarian利用支持向量机对于既有已标类别样本又有未知类别样本的训练集进行训练,方法主要是利用少量已标明类别的样本进行训练得到一个分类器的同时对于未标明类别的样本进行分类,使得间隔最大化。此优化问题中假定样本是精确的,而在现实生活中,样本通常带有统计误差。因此,考虑样本带有扰动信息的半监督两类分类问题,给出鲁棒半监督v-支持向量分类算法。该算法的参数v易于选择,而数值试验也表明该算法具有良好的稳定性和较好的分类结果。 相似文献