全文获取类型
收费全文 | 467篇 |
免费 | 11篇 |
国内免费 | 5篇 |
专业分类
483篇 |
出版年
2025年 | 1篇 |
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 6篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 15篇 |
2018年 | 12篇 |
2017年 | 19篇 |
2016年 | 26篇 |
2015年 | 17篇 |
2014年 | 19篇 |
2013年 | 36篇 |
2012年 | 24篇 |
2011年 | 29篇 |
2010年 | 24篇 |
2009年 | 34篇 |
2008年 | 26篇 |
2007年 | 20篇 |
2006年 | 19篇 |
2005年 | 18篇 |
2004年 | 19篇 |
2003年 | 15篇 |
2002年 | 12篇 |
2001年 | 13篇 |
2000年 | 7篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 8篇 |
1995年 | 1篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 4篇 |
排序方式: 共有483条查询结果,搜索用时 15 毫秒
71.
提出了一种基于三对Bell态纠缠交换的量子确定性密钥分发方案(Quantum Deterministic Key Distribution,QDKD),该方案充分利用量子纠缠交换的原理,通过对三对Bell态进行纠缠、测量操作,并辅以经典信息实现确定性密钥的分发,方案中任何窃听行为都会被及时发现。同基于两对Bell态纠缠交换的QDKD方案相比,协议利用三对Bell态并使用两种方法实现确定性密钥信息的分发。分析结果表明,方案仅用到两粒子纠缠态,没有涉及任何幺正操作,操作性强,密钥分发效率高。 相似文献
72.
73.
74.
75.
基于fMRI的静息状态脑功能复杂网络分析 总被引:3,自引:0,他引:3
分析静息状态下人脑中不同区域之间的功能连接模式对研究静息状态下人脑正常功能活动具有重要意义。基于复杂网络理论对脑功能网络进行建模,考察静息状态脑功能网络的结构和拓扑特性。结果显示,网络具有小世界性质和无标度特性。进一步引入一种概率混合模型分析网络社团结构,得到的10个子网络中包含视觉系统、听觉系统、运动系统、默认网络以及与执行和工作记忆相关的脑区。推测出静息状态脑功能网络是由这些相对独立又彼此关联的子网络组成,其中楔前叶和扣带回作为网络的关键节点,在信息调度和传递中占据重要地位。 相似文献
76.
针对组网雷达系统在跟踪目标发生机动时采用自适应滤波来估计目标状态的特点,在点迹融合数据处理结构的组网雷达基础上提出了一种欺骗干扰优化策略.根据状态和量测方程描述了组网雷达跟踪目标的模型,同时建立了跟踪机动目标的自适应滤波模型.在此基础上,建立了欺骗干扰模型,并在目标机动检测约束下,推导了虚假目标欺骗干扰对于组网雷达融合... 相似文献
77.
Philippe Droz-Vincent 《Small Wars & Insurgencies》2018,29(3):434-455
AbstractLibya in 2011 witnessed a real process of political change, though different from all the policy-oriented jargon equating transition with a teleological transition to democracy. Due to the resilience of the Qadhafi regime in power and with the essential role of NATO intervention, the process was eased out by a eight-month civil war. Governance in post-Qadhafi Libya was not done through the rebuilding of centralized authorities. But it took the specific form of the emergence of multiple non-state actors embedded in local dynamics and then connected with weakened central authorities that had access to the huge Libyan resources. That raised complex questions about the quality of this mode of governance, especially at a time of pressing problems for Libya and its neighbors, whether direct ones (Tunisia, Egypt, Mali) or farther countries across the Mediterranean sea: terrorism with the expansion of Da’esh into the country and flows of refugees crossing Libya’s uncontrolled borders and flowing into Italy and then Europe by thousands. 相似文献
78.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
79.
The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
80.
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 相似文献