全文获取类型
收费全文 | 433篇 |
免费 | 238篇 |
国内免费 | 52篇 |
专业分类
723篇 |
出版年
2024年 | 6篇 |
2023年 | 12篇 |
2022年 | 13篇 |
2021年 | 10篇 |
2020年 | 19篇 |
2019年 | 18篇 |
2018年 | 12篇 |
2017年 | 44篇 |
2016年 | 50篇 |
2015年 | 27篇 |
2014年 | 55篇 |
2013年 | 33篇 |
2012年 | 52篇 |
2011年 | 43篇 |
2010年 | 30篇 |
2009年 | 46篇 |
2008年 | 28篇 |
2007年 | 29篇 |
2006年 | 50篇 |
2005年 | 30篇 |
2004年 | 20篇 |
2003年 | 14篇 |
2002年 | 14篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 10篇 |
1998年 | 8篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 5篇 |
排序方式: 共有723条查询结果,搜索用时 0 毫秒
651.
During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
652.
师资队伍建设是高校整体建设的永恒主题。如何使师资队伍能适应社会主义市场经济发展的需要,如何使师资队伍具有最佳结构,这是我们亟待研究和解决的问题。本文分析了新疆高校师资结构现状和存在的问题及其主要原因,提出了优化新疆高校师资队伍结构的思路。 相似文献
653.
A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003 相似文献
654.
对符合线性唯象传热规律(q∝Δ(T-1))的热机内可逆热经济学做了进一步研究,导出了在给定条件下Novikov热机的最优利润解析式,并得到了最优利润和相应的效率同其它参数间的关系. 相似文献
655.
介绍了用于舰船蒸汽动力装置热线图优化的可视化程序设计与研究.阐述了软件的主要功能、开发环境、数据库设计以及关键技术问题的解决途径.程序能通过调整各种设计参数来得到良好的热线图. 相似文献
656.
系统阐述了攻击机靶场攻击、靶场效能以及靶场效能优化等基本概念,在此基础上,分析了攻击机靶场效能优化的基本任务和基本问题,并给出了形式化描述。 相似文献
657.
基于马尔柯夫决策过程动态WTA最优化模型分析 总被引:2,自引:0,他引:2
在作战过程中,通过把目标群的威胁程度作为目标函数制定决策,可将目标分配决策过程变成马尔柯夫决策过程.即首先对攻防作战态势进行抽象性描述,建立基于马尔柯夫决策过程动态WTA最优化模型,然后提出了有限次迭代求解最优策略的新方法,并进行了算例验证和分析.结果表明该方法可使武器系统获得最大的射击效率,并能有效地减少重点目标突防的概率. 相似文献
658.
659.
VRML三维模型文件的优化技术 总被引:9,自引:0,他引:9
目前在Web3D领域,VRML是主流的开发平台。但在建模过程中,通常使用第三方三维建模软件。这样极大地减轻了制作模型的难度,节约了时间;但由于建模平台本身的原因,转换后的VRML文件的体积比较大,不利于网络传输与浏览。因此,对模型的空间位置进行调整,尽可能地优化模型的视觉效果,缩减其文件体积,是建立虚拟环境非常重要的环节。主要针对这个问题提出了一些具体的优化技术与算法以及新的数据结构。 相似文献
660.
Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献