全文获取类型
收费全文 | 1027篇 |
免费 | 115篇 |
国内免费 | 62篇 |
专业分类
电工技术 | 66篇 |
综合类 | 95篇 |
化学工业 | 38篇 |
金属工艺 | 19篇 |
机械仪表 | 102篇 |
建筑科学 | 72篇 |
矿业工程 | 91篇 |
能源动力 | 44篇 |
轻工业 | 23篇 |
水利工程 | 177篇 |
石油天然气 | 38篇 |
无线电 | 126篇 |
一般工业技术 | 34篇 |
冶金工业 | 42篇 |
自动化技术 | 237篇 |
出版年
2024年 | 4篇 |
2023年 | 16篇 |
2022年 | 27篇 |
2021年 | 24篇 |
2020年 | 22篇 |
2019年 | 16篇 |
2018年 | 12篇 |
2017年 | 29篇 |
2016年 | 29篇 |
2015年 | 29篇 |
2014年 | 55篇 |
2013年 | 39篇 |
2012年 | 82篇 |
2011年 | 65篇 |
2010年 | 63篇 |
2009年 | 56篇 |
2008年 | 56篇 |
2007年 | 82篇 |
2006年 | 68篇 |
2005年 | 60篇 |
2004年 | 56篇 |
2003年 | 45篇 |
2002年 | 38篇 |
2001年 | 45篇 |
2000年 | 31篇 |
1999年 | 27篇 |
1998年 | 12篇 |
1997年 | 29篇 |
1996年 | 21篇 |
1995年 | 19篇 |
1994年 | 15篇 |
1993年 | 11篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1984年 | 2篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有1204条查询结果,搜索用时 0 毫秒
11.
面向Web对象的细粒度聚类已经成为学术界研究的热点.然而现有大多数聚类模型只关注如何对文本内容或文章主题进行聚类,聚类结果粒度较粗,无法满足大规模网络信息检索的质量要求.针对上述挑战,充分挖掘Web文档中词汇间的树状概率层次关系,提出一种以词汇信息分布作为特征标志的聚类算法InfoSigs,实现对Web对象的细粒度聚类.算法构建一个信息传递有向无环图,根据词汇在图中信息分布的集中度赋予其合理的权重,产生更具代表性的特征向量;同时算法提出了一个自适应的记录合并模型,有效提高记录簇中记录间的相似度,减少噪音对合并过程的影响.实验结果表明,InfoSigs算法比传统聚类算法—I-Match和Shingling—在F-Measure值上平均约有21.3%的提高,可以有效地运用到多领域Web对象的聚类问题. 相似文献
12.
不完全标记的多个并行事务踪迹的“剥离” 总被引:1,自引:0,他引:1
新型分布式软件的多个并行处理事务导致每个事务产生的事件按随机排序,如果这些事件的标记不完全或不可用,将无法区分这些事件到底属于哪个事务.将不完全标记事件的“剥离”问题转化成偶图最大权重完全匹配问题.对于事件间的转换时间是独立等同分布的情况,将所有可能状态(事件)划分为若干个割集,每个割集构成一个偶图.在这些偶图系统中,采用所提出的偶图最大权重完全匹配的改进算法进行分散匹配,通过拼接匹配结果得到各事务产生的最可能踪迹序列.仿真实验证实:该方法可以有效实现不完全标记的事务踪迹的“剥离”;与传统的偶图匹配方法相比,改进算法具有更高的匹配效率. 相似文献
13.
The problem of channel sharing by rate adaptive streams belonging to various classes is considered. Rate adaptation provides
the opportunity for accepting more connections by adapting the bandwidth of connections that are already in the system. However,
bandwidth adaptation must be employed in a careful manner in order to ensure that (a) bandwidth is allocated to various classes
in a fair manner (system perspective) and (b) bandwidth adaptation does not affect adversely the perceived user quality of
the connection (user quality). The system perspective aspect has been studied earlier. This paper focuses on the equally important
user perspective. It is proposed to quantify user Quality of Service (QoS) through measures capturing short and long-term
bandwidth fluctuations that can be implemented with the mechanisms of traffic regulators, widely used in networking for the
purpose of controlling the traffic entering or exiting a network node. Furthermore, it is indicated how to integrate the user
perspective metrics with the optimal algorithms for system performance metrics developed earlier by the authors. Simulation
results illustrate the effectiveness of the proposed framework.
Nikos G. Argiriou received the Diploma degree in Electrical Engineering from the Department of Electrical Engineering, Telecommunication Division, Aristotle University of Thessaloniki, Greece, in 1996. He worked as a researcher, on secure medical image transmission over networks, at the Image Processing Lab at the same university during 1996–1997. During 1998–2000 he was a researcher for the European Project Esprit Catserver concerning the use of advanced Quality of Service techniques in CATV networks. He received his Ph.D. degree at Aristotle University of Thessaloniki in 2007. His current research interests are in the development and implementation of QoS techniques for wired and wireless networks. Leonidas Georgiadis received the Diploma degree in Electrical Engineering from Aristotle University, Thessaloniki, Greece, in 1979, and his M.S. and Ph.D degrees both in Electrical Engineering from the University of Connecticut, in 1981 and 1986, respectively. From 1986 to 1987 he was Research Assistant Professor at the University of Virginia, Charlottesville. In 1987 he joined IBM T. J. Watson Research Center, Yorktown Heights as a Research Staff Member. Since October 1995, he has been with the Telecommunications Department of Aristotle University, Thessaloniki, Greece. His interests are in the area of wireless networks, high speed networks, routing, scheduling, congestion control, modeling and performance analysis. 相似文献
Leonidas GeorgiadisEmail: |
Nikos G. Argiriou received the Diploma degree in Electrical Engineering from the Department of Electrical Engineering, Telecommunication Division, Aristotle University of Thessaloniki, Greece, in 1996. He worked as a researcher, on secure medical image transmission over networks, at the Image Processing Lab at the same university during 1996–1997. During 1998–2000 he was a researcher for the European Project Esprit Catserver concerning the use of advanced Quality of Service techniques in CATV networks. He received his Ph.D. degree at Aristotle University of Thessaloniki in 2007. His current research interests are in the development and implementation of QoS techniques for wired and wireless networks. Leonidas Georgiadis received the Diploma degree in Electrical Engineering from Aristotle University, Thessaloniki, Greece, in 1979, and his M.S. and Ph.D degrees both in Electrical Engineering from the University of Connecticut, in 1981 and 1986, respectively. From 1986 to 1987 he was Research Assistant Professor at the University of Virginia, Charlottesville. In 1987 he joined IBM T. J. Watson Research Center, Yorktown Heights as a Research Staff Member. Since October 1995, he has been with the Telecommunications Department of Aristotle University, Thessaloniki, Greece. His interests are in the area of wireless networks, high speed networks, routing, scheduling, congestion control, modeling and performance analysis. 相似文献
14.
针对单点登录中的跨域身份认证问题,提出了一种基于可变Cookie的方案解决跨域单点登录,使用随机数字生成票据,并作为传统加密算法的会话密钥对客户端的Cookie进行加密,采用现代加密算法在异域系统之间安全传递票据,每次认证产生新的票据并更新异域应用系统的Cookie。通过对票据产生和传输以及Cookie加密和常见攻击的安全性分析,可以实现跨域单点登录的功能并保证身份认证安全可信。 相似文献
15.
加密设备接口标准研究及实现分析 总被引:2,自引:0,他引:2
加密设备的接口规范是网络安全能统一实施的关键。Cryptoki是基于PKCS#11加密设备接口标准的编程接口,可用于各种可移植的密码设备。本文在阐述Cryptoki通用模型特点的基础上,具体分析了作为Unix类平台工业标准的OpenCryptoki的实现过程,为基于相关标准的编程接口的开发提供了参考。 相似文献
16.
There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size.In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. The parameter k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming. 相似文献
17.
对干熄焦旋转焦罐车的开门机构、传动机构、定位机构、材料等设计问题进行了分析 ,探讨了解决的方法 ,提出了设计思路 相似文献
18.
基于PDES乐观时间管理的周期时间桶算法研究 总被引:1,自引:0,他引:1
时间管理是影响并行离散事件仿真PDES系统高效运行的重要因素之一。文章首先分析了离散事件仿真的原理,以及PDES所面临的时间管理方面的挑战;然后阐述了乐观时间管理机制,重点提出了周期时间桶算法的设计与实现,并对其性能作了大体上的评估。 相似文献
19.
针对海洋深水环境,设计适应70 m水深的四桶导管架结构形式,并在此基础上设计相同高度和主腿斜度的三桶导管架基础。采用Abaqus有限元软件建立导管架结构-吸力桶-土体整体有限元模型,通过对比分析探究海上风电深水吸力桶导管架基础的承载力特性。研究发现:吸力桶与土体的位移一致性程度可反映基础水平极限承载力大小,四桶导管架基础的综合承载特性优于三桶导管架基础;加载高度对四桶导管架基础的水平承载力特性有重要影响,基础水平承载力随着加载高度增加逐渐减小;加载方向对四桶导管架基础水平承载力影响较小。 相似文献
20.