全文获取类型
收费全文 | 590篇 |
免费 | 137篇 |
国内免费 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 21篇 |
2020年 | 15篇 |
2019年 | 6篇 |
2018年 | 4篇 |
2017年 | 15篇 |
2016年 | 18篇 |
2015年 | 27篇 |
2014年 | 27篇 |
2013年 | 92篇 |
2012年 | 41篇 |
2011年 | 46篇 |
2010年 | 47篇 |
2009年 | 48篇 |
2008年 | 61篇 |
2007年 | 44篇 |
2006年 | 39篇 |
2005年 | 38篇 |
2004年 | 28篇 |
2003年 | 28篇 |
2002年 | 22篇 |
2001年 | 16篇 |
2000年 | 11篇 |
1999年 | 12篇 |
1998年 | 8篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1986年 | 2篇 |
排序方式: 共有752条查询结果,搜索用时 31 毫秒
691.
诚信对于提升整个社会道德水平,促进经济社会发展,具有重要的作用,对新疆大学生这一群体更有着重要的意义。本文对新疆大学生诚信观进行问卷调查,通过对调查数据的统计分析,发现大学生表现出新的诚信观,并提出了树立大学生正确诚信观的对策。 相似文献
692.
超细矿物微粉改善2号坦克润滑脂摩擦学性能研究 总被引:1,自引:0,他引:1
采用球盘式摩擦磨损试验机,研究了羟基硅酸盐超细矿物微粉作为2号坦克润滑脂添加剂对钢/钢摩擦副的润滑性能,利用扫描电子显微镜(Scanning Electron Microscopy,SEM)和X射线能谱仪(Energy Dispersive Spectrometry,EDS)分析了磨痕表面形貌及典型元素的面分布情况。结果表明:超细矿物微粉可显著改善2号坦克润滑脂的抗磨减摩性能,含2wt%矿物微粉的润滑脂同单一2号润滑脂相比,摩擦系数降低了约44%,钢盘磨损率降低了约70%,这与羟基硅酸盐可在摩擦表面形成一层富含O,Si,Mg,Al等元素的摩擦表面膜密切相关。 相似文献
693.
694.
695.
首先给出了一种更加简单的关于BOM问题的变增益函数的推导,新的增益形式比原先的形式更具有数字稳定性.然后考虑当模型具有不确定性时的被动制导仿真.当模型具有参数不确定时,一般的单模型滤波器已经不能满足制导的性能要求.采用交互式多模型算法,与修正增益扩展卡尔曼滤波器结合,并使用能实时估计量测噪声的Sage-Husa估值器,设计出一种新型自适应交互式多模型修正增益扩展卡尔曼滤波,将其应用到被动制导中,仿真结果表明该方法的优越性和实用性. 相似文献
696.
Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
697.
This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
698.
We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
699.
Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
700.