全文获取类型
收费全文 | 223篇 |
免费 | 13篇 |
国内免费 | 4篇 |
专业分类
化学 | 19篇 |
力学 | 1篇 |
综合类 | 5篇 |
数学 | 171篇 |
物理学 | 44篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 3篇 |
2015年 | 5篇 |
2014年 | 11篇 |
2013年 | 20篇 |
2012年 | 11篇 |
2011年 | 7篇 |
2010年 | 21篇 |
2009年 | 13篇 |
2008年 | 9篇 |
2007年 | 7篇 |
2006年 | 17篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有240条查询结果,搜索用时 15 毫秒
21.
We derive the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of an infinitesimal customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. To this end we introduce a new method that relies on the construction of a workload overtaking process and solving a first-passage problem using an appropriate stopping time. 相似文献
22.
This paper addresses a special kind of container loading problem with shipment priority. We present a tree search method, which is based on a greedy heuristic. In the greedy heuristic, blocks made up of identical items with the same orientation are selected for packing into a container. Five evaluation functions are proposed for block selection, and the different blocks selected by each evaluation function constitute the branches of the search tree. A method of space splitting and merging is also embedded in the algorithm to facilitate efficient use of the container space. In addition, the proposed algorithm covers an important constraint called shipment priority to solve practical problems. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data. 相似文献
23.
为有效解决产品在研发过程中存在的一系列质量可靠性问题,本文提出了一种新的基于犹豫模糊偏好关系的改进FMEA方法。考虑到专家小组对不同失效模式评估时主要依据相关标准和自身经验,存在犹豫模糊不确定或自身偏好问题。本文首先对风险因子的评分标准进行犹豫模糊化,并用犹豫模糊偏好关系对失效模式的相对风险矩阵进行处理;其次,将得到的具有犹豫模糊偏好关系的综合偏好值与犹豫模糊评价信息相结合,得到改进的风险优先数,从而得出新的失效模式风险评估顺序对FMEA进行改进;最后,利用改进的FMEA模型对产品研发过程中的质量风险进行分析验证,使得风险结果更接近实际情况,进而提高研发成功率,显示该方法可行、有效。 相似文献
24.
模糊判断矩阵的特征向量排序方法 总被引:1,自引:0,他引:1
从相关性角度提出了互反判断矩阵排序的特征向量方法。利用两类一致性模糊判断矩阵与完全一致性互反判断矩阵的相互转换公式,给出了基于加性一致性指标与乘性一致性指标的模糊判断矩阵特征向量排序方法,最后利用这些方法进行了算例分析,结果表明这些新的排序方法是有效可行的。 相似文献
25.
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The
customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this
contribution, we analyze a discrete-time two-class preemptive repeat identical priority queue with infinite buffer space and
generally distributed service times. Newly arriving high-priority customers interrupt the on-going service of a low-priority
customer. After all high-priority customers have left the system, the interrupted service of the low-priority customer has
to be repeated completely. By means of a probability generating functions approach, we analyze the system content and the
delay of both types of customers. Performance measures (such as means and variances) are calculated and the impact of the
priority scheduling is discussed by means of some numerical examples. 相似文献
26.
Jens S. Frederiksen Kim S. Larsen John Noga Patchrawat Uthaisombut 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):407
When messages, which are to be sent point-to-point in a network, become available at irregular intervals, a decision must be made each time a new message becomes available as to whether it should be sent immediately or if it is better to wait for more messages and send them all together. Because of physical properties of the networks, a certain minimum amount of time must elapse in between the transmission of two packets. Thus, whereas waiting delays the transmission of the current data, sending immediately may delay the transmission of the next data to become available even more. We propose a new quality measure and derive optimal deterministic and randomized algorithms for this on-line problem. 相似文献
27.
正互反判断矩阵元素与优先权重新的逻辑关系 总被引:3,自引:1,他引:2
揭示了一种含参数的正互反判断矩阵元素与优先权重新的逻辑关系,并对参数的含义作了解释.得出了四个重要结论.通过算例与Saaty提出的层次分析法做了比较,说明了该方法的合理、科学性. 相似文献
28.
目前国内大型三甲医院最突出的问题就是资源稀缺,这些稀缺资源主要包括手术室、大型检查设备以及门诊科室等,造成患者严重的排队现象,从而导致患者等待时间过长,满意度下降。通过对哈尔滨市某大型医院进行调研,收集相关数据,研究在考虑患者回诊(即患者当天做完各项检查后又回到初次检查的门诊科室)情况下,对医生门诊科室的数量进行调度优化。利用排队论中的动态优先级对排队规则进行限定,同时引入前景理论中的价值函数,确立以最小化患者时间感知不满意度为主要目标,最小化医院运营成本为次要目标的多目标优化问题。并且分析了两个目标的权重参数变化对总体满意度的影响。建立相应的数学模型,利用模拟植物生长算法( plant growth simulation algorithm,简称PGSA)进行算法设计,通过MATLAB进行仿真,得出在有限度优先的排队规则下,能够更大程度的降低患者不满意度,同时保证较低的运营成本,证明了此研究的有效性和可行性。 相似文献
29.
This paper deals with a class of multiple objective linear programs (MOLP) called lexicographic multiple objective linear programs (LMOLP). In this paper, by providing an efficient algorithm which employs the preceding computations as well, it is shown how we can solve the LMOLP problem if the priority of the objective functions is changed. In fact, the proposed algorithm is a kind of sensitivity analysis on the priority of the objective functions in the LMOLP problems. 相似文献
30.
In this paper, we consider a discrete-time two-class discretionary priority queueing model with generally distributed service times and per slot i.i.d. structured inputs in which preemptions are allowed only when the elapsed service time of a lower-class customer being served does not exceed a certain threshold. As the preemption mode of the discretionary priority discipline, we consider the Preemptive Resume, Preemptive Repeat Different, and Preemptive Repeat Identical modes. We derive the Probability Generating Functions (PGFs) and first moments of queue lengths of each class in this model for all the three preemption modes in a unified manner. The obtained results include all the previous works on discrete-time priority queueing models with general service times and structured inputs as their special cases. A numerical example shows that, using the discretionary priority discipline, we can more subtly adjust the system performances than is possible using either the pure non-preemptive or the preemptive priority disciplines. 相似文献