全文获取类型
收费全文 | 319篇 |
免费 | 1篇 |
专业分类
320篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 57篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有320条查询结果,搜索用时 15 毫秒
251.
252.
The Akko 1 shipwreck is the remains of a 26-metre-long Egyptian armed vessel or auxiliary naval brig built at the beginning of the 19th century. Remains of six flintlock muskets were retrieved from the shipwreck, and characterised by various metallurgical methods. The research aimed to study the composition and microstructure of the musket fittings and their manufacturing processes, and if possible, to determine the date and origin of the raw materials. The lead isotope analysis of the fittings suggests that their raw material originated in Great Britain. Based on their typology and composition, the fittings were made in Great Britain of brass alloy and manufactured by casting, probably at the same workshop; and the staple was manufactured by casting and drawing. Considering the zinc content, combined with the manufacturing techniques, the fittings were manufactured between the latter part of the 18th and the early 19th centuries, which might indicate that they were purchased in the course of 19th century weapons trade to be used on board the Egyptian ship. 相似文献
253.
This paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed. 相似文献
254.
A system deteriorates due to shocks received at random times, each shock causing a random amount of damage which accumulates over time and may result in a system failure. Replacement of a failed system is mandatory, while an operable one may also be replaced. In addition, the shock process causing system deterioration may be controlled by continuous preventive maintenance expenditures. The joint problem of optimal maintenance and replacement is analyzed and it is shown that, under reasonable conditions, optimal maintenance rate is decreasing in the cumulative damage level and that beyond a certain critical level the system should be replaced. Meaningful bounds are established on the optimal policies and an illustrative example is provided. 相似文献
255.
256.
We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve‐valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero‐risk path, and we introduce a practically computable additive‐constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
257.
There have been growing claims in media circles and law-enforcement settings that street gangs and criminal groups are turning to Internet-based social networking sites for various reasons ranging from the showcasing of their images and exploits to the suspected recruitment of members. The present study investigates whether such a trend is, in fact, in place. The presence of street gangs on these Internet sites is referred to as cyberbanging. While there is some anecdotal evidence suggesting that gangs are turning to social networking sites, there is little available research on exactly how street gangs and criminal groups use the Internet. Our main argument is that gang culture is in many ways an individualized phenomenon and this feature ties in directly with recent assessments of the Internet as a setting that is governed by a process of networked individualism. This theoretical link between the individualized gang setting and the presence of gang members on social networking sites helps us understand why recruitment is improbable even in a context where people are openly diffusing their image and exploits to a growing number of Internet users. The empirical segment of this research adds to this general outlook. Based on a keyword search of over 50 street gang names, the three main social networking sites (Twitter, Facebook, and MySpace) were monitored for street gang presence. Results illustrate that gang presence on social networking sites is linked primarily to promoting a general gang or street culture through individual displays. In regard to the visitors to such sites, there is no evidence that they are being tricked or manipulated in any way. They are, however, showing their curiosity in regard to such groups and, for those who share their comments and opinions, signs of support are evident. Thus, whereas criminal gangs are not proactively using the Internet to convert anyone into being gang members, social networking sites are creating a new venue for people who share or are sensitive to the values underlying street gang lifestyle to come together. These sites essentially create a new convergence setting for gang members to interact with a wider number of people who would probably never have been exposed to their lifestyles and exploits through physical interactions. The study's conclusion extends these findings toward further research in this area, as well as outlining the more relevant implications for law-enforcement monitoring of this growing phenomenon. 相似文献
258.
259.
针对真实物联网环境中的缺失多元时间序列异常检测难题,提出一种融合缺失信息图嵌入的多元时间序列异常检测算法;基于预插值与异常检测任务融合的联合学习框架,设计一个基于时序高斯核函数的图神经网络(graph neural network, GNN)预插值模块,实现了预插值与异常检测任务的共同优化;提出一种时间序列数据缺失信息嵌入的图结构学习方法,采用图注意力机制融合缺失信息掩蔽矩阵和时空特征向量,有效建模多元时间序列缺失数据分布的潜在联系。在真实物联网传感器数据集上验证了提出算法的性能,实验结果表明,该方法在缺失多元时间序列异常检测任务上显著优于主流两阶段方法,预插值模块对比实验部分充分证明了基于高斯核函数的GNN预插值层的有效性。 相似文献
260.