全文获取类型
收费全文 | 695篇 |
免费 | 74篇 |
国内免费 | 19篇 |
专业分类
化学 | 16篇 |
力学 | 1篇 |
综合类 | 13篇 |
数学 | 712篇 |
物理学 | 46篇 |
出版年
2023年 | 5篇 |
2022年 | 18篇 |
2021年 | 25篇 |
2020年 | 16篇 |
2019年 | 27篇 |
2018年 | 16篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 18篇 |
2014年 | 35篇 |
2013年 | 53篇 |
2012年 | 39篇 |
2011年 | 53篇 |
2010年 | 44篇 |
2009年 | 40篇 |
2008年 | 50篇 |
2007年 | 65篇 |
2006年 | 33篇 |
2005年 | 19篇 |
2004年 | 15篇 |
2003年 | 21篇 |
2002年 | 11篇 |
2001年 | 15篇 |
2000年 | 17篇 |
1999年 | 14篇 |
1998年 | 12篇 |
1997年 | 15篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 13篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有788条查询结果,搜索用时 78 毫秒
781.
Optimal (r,N)‐policy for discrete‐time Geo ∕ G ∕ 1 queue with different input rate and setup time 下载免费PDF全文
This paper presents a queue‐length analysis of Geo ∕ G ∕ 1 queue with ( r , N )‐policy and different input rate. Using a different method, the recursive expressions of queue‐length distribution at different epochs are obtained. Furthermore, some performance measures are also investigated. Finally, the Tabu search algorithm is used to search the joint optimum value of ( r , N ), which minimizes the state‐dependent operating cost. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
782.
In this paper we consider a production process at operative level on m identical parallel machines, which are subject to stochastic machine failures. To avoid long downtime of the machines, caused by unexpected failures, preventive maintenance activities are planned and conducted, but if a failure could not be averted a corrective maintenance has to be performed. Both maintenance activities are assumed to restore the machine to be “as good as new”. The maintenance activities, the number of jobs and their allocation to machines as well as their sequence have a large impact on the performance of the production process and the delivery dates. 相似文献
783.
We study infinite-horizon asymptotic average optimality for parallel server networks with multiple classes of jobs and multiple server pools in the Halfin–Whitt regime. Three control formulations are considered: (1) minimizing the queueing and idleness cost, (2) minimizing the queueing cost under constraints on idleness at each server pool, and (3) fairly allocating the idle servers among different server pools. For the third problem, we consider a class of bounded-queue, bounded-state (BQBS) stable networks, in which any moment of the state is bounded by that of the queue only (for both the limiting diffusion and diffusion-scaled state processes). We show that the optimal values for the diffusion-scaled state processes converge to the corresponding values of the ergodic control problems for the limiting diffusion. We present a family of state-dependent Markov balanced saturation policies (BSPs) that stabilize the controlled diffusion-scaled state processes. It is shown that under these policies, the diffusion-scaled state process is exponentially ergodic, provided that at least one class of jobs has a positive abandonment rate. We also establish useful moment bounds, and study the ergodic properties of the diffusion-scaled state processes, which play a crucial role in proving the asymptotic optimality. 相似文献
784.
Benjamin Legros 《European Journal of Operational Research》2019,272(2):740-753
Bike-sharing systems are becoming increasingly popular in large cities. The natural imbalance and the stochasticity of bike’s arrivals and departures lead operators to develop redistribution strategies in order to ensure a sufficiently high quality of service for users. Using a Markov decision process approach, we develop an implementable decision-support tool which may help the operator to decide at any point of time (i) which station should be prioritized, and (ii) which number of bikes should be added or removed at each station. Our objective is to minimize the rate of arrival of unsatisfied users who find their station empty or full. The existence of an optimal inventory level at each station is proven. It may vary over time but does not depend on the capacity of the truck which operates the repositioning. Next, we compute the relative value function of the system, together with the average cost and the optimal state. These results are used to derive a policy for station’s prioritization using a one-step policy improvement method. We evaluate our policy in comparison with the optimal one and with other intuitive ones in an extended version of our model. From our numerical experiments, we show that only a little intervention of the operator can significantly enhance the quality of service, and that the rule of thumb for bike repositioning is to prioritize the closer, the more active, the closer to be full or empty, and the more imbalanced stations if no reversing in the imbalance is anticipated. 相似文献
785.
We analyze the changes in the financial network built using the Dow Jones Industrial Average components following monetary policy shocks. Monetary policy shocks are measured through unexpected changes in the federal funds rate in the United States. We determine the changes in the financial networks using singular value decomposition entropy and von Neumann entropy. The results indicate that unexpected positive shocks in monetary policy shocks lead to lower entropy. The results are robust to varying the window size used to construct financial networks, though they also depend on the type of entropy used. 相似文献
786.
Rafa Olszowski Piotr Pita Sebastian Baran Marcin Chmielowski 《Entropy (Basel, Switzerland)》2021,23(11)
The domain of policymaking, which used to be limited to small groups of specialists, is now increasingly opening up to the participation of wide collectives, which are not only influencing government decisions, but also enhancing citizen engagement and transparency, improving service delivery and gathering the distributed wisdom of diverse participants. Although collective intelligence has become a more common approach to policymaking, the studies on this subject have not been conducted in a systematic way. Nevertheless, we hypothesized that methods and strategies specific to different types of studies in this field could be identified and analyzed. Based on a systematic literature review, as well as qualitative and statistical analyses, we identified 15 methods and revealed the dependencies between them. The review indicated the most popular approaches, and the underrepresented ones that can inspire future research. 相似文献
787.
The transient behavior of the finite-buffer queueing model with batch arrivals and generally distributed repeated vacations is analyzed. Such a system has potential applications in modeling the functioning of production systems, computer and telecommunication networks with energy saving mechanism based on cyclic monitoring the queue state (Internet of Things, wireless sensors networks, etc.). Identifying renewal moments in the evolution of the system and applying continuous total probability law, a system of Volterra-type integral equations for the time-dependent queue-size distribution, conditioned by the initial buffer state, is derived. A compact-form solution for the corresponding system written for Laplace transforms is obtained using an algebraic approach based on Korolyuk’s potential method. An illustrative numerical example presenting the impact of the service rate, arrival rate, initial buffer state and single vacation duration on the queue-size distribution is attached as well. 相似文献
788.
Active object recognition (AOR) aims at collecting additional information to improve recognition performance by purposefully adjusting the viewpoint of an agent. How to determine the next best viewpoint of the agent, i.e., viewpoint planning (VP), is a research focus. Most existing VP methods perform viewpoint exploration in the discrete viewpoint space, which have to sample viewpoint space and may bring in significant quantization error. To address this challenge, a continuous VP approach for AOR based on reinforcement learning is proposed. Specifically, we use two separate neural networks to model the VP policy as a parameterized Gaussian distribution and resort the proximal policy optimization framework to learn the policy. Furthermore, an adaptive entropy regularization based dynamic exploration scheme is presented to automatically adjust the viewpoint exploration ability in the learning process. To the end, experimental results on the public dataset GERMS well demonstrate the superiority of our proposed VP method. 相似文献