全文获取类型
收费全文 | 593篇 |
免费 | 114篇 |
国内免费 | 126篇 |
专业分类
833篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 11篇 |
2020年 | 11篇 |
2019年 | 6篇 |
2018年 | 9篇 |
2017年 | 32篇 |
2016年 | 45篇 |
2015年 | 14篇 |
2014年 | 57篇 |
2013年 | 37篇 |
2012年 | 52篇 |
2011年 | 59篇 |
2010年 | 40篇 |
2009年 | 56篇 |
2008年 | 56篇 |
2007年 | 51篇 |
2006年 | 52篇 |
2005年 | 65篇 |
2004年 | 41篇 |
2003年 | 29篇 |
2002年 | 22篇 |
2001年 | 21篇 |
2000年 | 14篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有833条查询结果,搜索用时 15 毫秒
381.
针对我军装备维修经费综合预算管理的内容和特点,提出了以综合预算数据库为基础、以预算分析数据仓库为中心、以操作数据存储为支撑、以联机分析处理和数据挖掘为手段的装备维修经费综合预算管理信息系统的结构模型,阐述了综合预算数据库和预算分析数据仓库设计、预算数据分析与数据挖掘模型构建的基本内容,为装备维修经费综合预算管理信息系统开发提供了新的体系框架。 相似文献
382.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
383.
384.
Impacts of sequential acquisition,market competition mode,and confidentiality on information flow 下载免费PDF全文
We investigate information flow in a setting in which 2 retailers order from a supplier and sell to a market with uncertain demand. Each retailer has access to a signal. The retailers can disclose signals to each other (horizontal information sharing), while the supplier can solicit signals by offering retailers differential payments as incentives for signal disclosure (vertical information acquisition). In the base setting, market competition is in quantity, and a retailer can fully infer the signal that the other retailer discloses to the supplier. We show that the supplier prefers to sequentialize the procedure for information acquisition. Moreover, vertical information acquisition by the supplier is a strategic complement to horizontal information sharing between the retailers to establish information flow. In the equilibrium, the retailers have no incentive to exchange signals, but system wide information transparency can be realized through a combination of information acquisition and inference. We further study the signaling effect, whereby the supplier utilizes wholesale pricing as an instrument to affect the retailers' inference of the shared signals, and price competition to explore their impacts on the supplier's preference for sequential acquisition and the sustainability of information flow. 相似文献
385.
贾林川 《中国人民武装警察部队学院学报》2007,23(7):94-96
搜索引擎是互联网信息检索技术的核心,中文搜索引擎与国外相比存在着搜索引擎覆盖率低、查准率不高、检索精度差、更新速度慢、无法控制网络信息的动态变化、对信息内容难于控制和管理等问题。对此,提出了中文搜索引擎从单一查询工具向综合化、全功能服务发展;分类主题一体化,检索语言向自然语言发展;查询智能化,向多国化和多语种化发展;搜索引擎集成化、网络资源著录标准化及利用智能代理技术的信息检索等对策。 相似文献
386.
The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold. 相似文献
387.
We study the classical ranking and selection problem, where the ultimate goal is to find the unknown best alternative in terms of the probability of correct selection or expected opportunity cost. However, this paper adopts an alternative sampling approach to achieve this goal, where sampling decisions are made with the objective of maximizing information about the unknown best alternative, or equivalently, minimizing its Shannon entropy. This adaptive learning is formulated via a Bayesian stochastic dynamic programming problem, by which several properties of the learning problem are presented, including the monotonicity of the optimal value function in an information-seeking setting. Since the state space of the stochastic dynamic program is unbounded in the Gaussian setting, a one-step look-ahead approach is used to develop a policy. The proposed policy seeks to maximize the one-step information gain about the unknown best alternative, and therefore, it is called information gradient (IG). It is also proved that the IG policy is consistent, that is, as the sampling budget grows to infinity, the IG policy finds the true best alternative almost surely. Later, a computationally efficient estimate of the proposed policy, called approximated information gradient (AIG), is introduced and in the numerical experiments its performance is tested against recent benchmarks alongside several sensitivity analyses. Results show that AIG performs competitively against other algorithms from the literature. 相似文献
388.
389.
390.