全文获取类型
收费全文 | 640篇 |
免费 | 238篇 |
国内免费 | 71篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 7篇 |
2021年 | 18篇 |
2020年 | 17篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 27篇 |
2016年 | 44篇 |
2015年 | 21篇 |
2014年 | 44篇 |
2013年 | 56篇 |
2012年 | 52篇 |
2011年 | 51篇 |
2010年 | 30篇 |
2009年 | 59篇 |
2008年 | 41篇 |
2007年 | 45篇 |
2006年 | 60篇 |
2005年 | 44篇 |
2004年 | 43篇 |
2003年 | 41篇 |
2002年 | 32篇 |
2001年 | 29篇 |
2000年 | 21篇 |
1999年 | 15篇 |
1998年 | 18篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 11篇 |
1994年 | 15篇 |
1993年 | 5篇 |
1992年 | 18篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 2篇 |
排序方式: 共有949条查询结果,搜索用时 0 毫秒
311.
312.
We investigate whether differences in terrorism risk are mirrored on terrorism risk perception across European countries for the period 2003–2007. We find that the average propensity for terrorism risk concern is affected by actual risk levels. Country and individual heterogeneity contribute substantially to the variation of observed risk perception. Singles and individuals with white collar jobs are less likely to mention terrorism as one of the most pressing issues their country faces, while political positioning towards the right makes it more likely to be concerned about terrorism. As far as competing risks are concerned, we find that the likelihood terrorism is mentioned, decreases with spending on pensions as a percentage of GDP being higher. Finally, based on the Bayesian framework, we also examined the formation of terrorism risk perceptions, and decompose the observed country-level time series of terrorism activity into a long- and a short-run component. We concluded that the observed risk perception variation is only explained by the long-term trend of terrorism activity countries face. 相似文献
313.
The UN asks governments to report key figures of their annual military budgets with the aim of creating trust among member states. This goal can only be achieved if the data reported is accurate. However, although there are many reasons for governments to falsify data, the UN does not check for manipulation. In this paper, we apply Benford’s law to the military expenditure data of 27 states taken from the UN register. Our analysis of the first digits shows that the states with the greatest deviations from the expected Benford distribution and therefore the lowest data quality are the USA and the UK. 相似文献
314.
315.
特种车辆乘栽员的生理心理状态与车辆技术状态并列成为影响车辆整体效能的重要因素。针对乘栽员的生理心理状态进行监测并适时干预,可以实时掌握并调整人员状态。既有利于车辆能力发挥,也有利于整体协调。生理监测调节系统拟采用生物传感技术,采集人员生理心理指标参数,通过车辆通信及指控系统网络,使指挥人员能够及时掌握人员的疲劳及生命体征状态.通过合理的心理干预及医疗指导。使人员保持良好的心理生理状态或合理的医疗自救互救,最大程度地保存行动能力。该系统可应用于平时训练及评估.也可应用于行动决策指挥及医疗救护部署。 相似文献
316.
现有的Link16网络同步算法,假定了询问与应答报文的传播时间相同,导致E值误差较大。提出一种改进算法,待同步JU相继向网内不同NTR发送询问报文,NTR分别发回应答报文。同时NTR间也发送往返计时报文,通过联立计算,提高时间误差的精度。改进算法的仿真分析结果,验证了新同步算法的可行性和有效性。 相似文献
317.
针对经典Harris角点检测算法对于全局像素点求取角点响应函数所带来的计算复杂度高,从而不适合实时检测的弊端,提出了一种新的快速角点检测算法。鉴于角点数量只占整个图像像素点很小一部分,首先利用四方向亮度导数来进行候选角点预判断,阈值选取为图像像素点像素值的标准差的倍数。经过预判断后,再考虑8-邻域相似点个数,根据相似点个数对应的情况对候选角点进行再判断,将剩下的候选角点进行Harris算法检测。仿真结果表明,此改进算法能够有效地提高角点检测效果并减少检测时间。 相似文献
318.
针对未来多样化军事任务对数据服务需求,在充分研究军用数据异构、分散存储、服务方式多样等现状的基础上,分析了数据应用的能力需求,提出了面向信息整合的军用数据中心技术架构与组成,阐述了该架构的特点以及关键技术,很好地解决了现有数据服务存在的问题,为未来军用数据工程建设奠定基础。 相似文献
319.
为了保证无线传感器网络中数据的完整性,针对基于LEACH路由协议的动态轮时间算法存在的问题,提出一种基于人工神经网络的数据预测算法。该动态轮时间算法中,部分簇因调整后的轮时间不足以完成数据的采集而丢失数据。数据预测算法结合传感器节点数据具有时空相关性的特点,将时空延迟算子引入神经网络模型,并通过建立的神经网络模型对数据进行预测。仿真时采用伯克利英特尔实验室的传感器数据,通过Mafl软件对模型进行测试并分析仿真结果。实验结果表明:该算法对连续多个数据的预测效果理想,预测误差始终保持在较低水平。 相似文献
320.
Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献