全文获取类型
收费全文 | 361篇 |
免费 | 109篇 |
国内免费 | 20篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 6篇 |
2018年 | 2篇 |
2017年 | 17篇 |
2016年 | 20篇 |
2015年 | 18篇 |
2014年 | 21篇 |
2013年 | 23篇 |
2012年 | 22篇 |
2011年 | 24篇 |
2010年 | 14篇 |
2009年 | 34篇 |
2008年 | 22篇 |
2007年 | 27篇 |
2006年 | 33篇 |
2005年 | 26篇 |
2004年 | 22篇 |
2003年 | 13篇 |
2002年 | 13篇 |
2001年 | 20篇 |
2000年 | 14篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有490条查询结果,搜索用时 62 毫秒
51.
船舶动力装置监控系统CAN总线的设计 总被引:5,自引:0,他引:5
以某船动力装置监控系统CAN总线的应用设计为例 ,提出了先建立系统各部分都必须遵守的约定 ,然后根据CAN2 .0A协议、用户建立的约定和系统配置来进行设计的方法 相似文献
52.
Kurt M. Bretthauer 《海军后勤学研究》2000,47(1):1-17
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000 相似文献
53.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
54.
为提高DDR3控制器访存效率,设计了基于DDR3存储器预取访问数据长度的数据缓冲机制,将访存请求分为三种基本类型并分别排队处理,降低数据丢弃和实际动态随机访问存储器访问发生次数。针对图像和视频类应用程序的实验结果表明,相对于传统先到先服务的DDR3访存控制器,该机制取得了平均21.3%、最好51.3%的性能提升,硬件开销在可接受范围内。 相似文献
55.
结合工程需要设计了消息基器件数据低寄存器定位监视电路,满足了总线和本地CPU对数据低寄存器读写时的时序关系,给出了部分实现电路和状态转移流程图。 相似文献
56.
57.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
58.
针对通用发控单元的维护需求和共架武器系统的训练需求,设计了通用筒弹模拟系统.该系统通过1553B总线与通用发控单元通信,实现了筒弹功能模拟和筒弹故障模拟.经测试,该系统运行稳定可靠,各项功能满足设计指标. 相似文献
59.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011 相似文献
60.
我国拥有自主知识产权的工业以态网总线标准EPA在推广应用中面临缺乏足够现场设备支持的困境.针对现状,在现有HVP型智能阀门定位器的基础上,采用双CPU方案,开发符合EPA通信协议要求的智能阀门定位器.给出了EPA阀门定位器开发的总体方案、硬件设计和软件设计,开发的阀门定位器通过EPA一致性、互可操作性测试以及产品全功能... 相似文献