首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   665篇
  免费   92篇
  国内免费   77篇
电工技术   36篇
综合类   66篇
化学工业   3篇
金属工艺   3篇
机械仪表   56篇
建筑科学   27篇
矿业工程   5篇
能源动力   10篇
轻工业   2篇
水利工程   13篇
石油天然气   5篇
武器工业   1篇
无线电   48篇
一般工业技术   32篇
冶金工业   64篇
自动化技术   463篇
  2024年   4篇
  2023年   7篇
  2022年   7篇
  2021年   10篇
  2020年   8篇
  2019年   8篇
  2018年   10篇
  2017年   8篇
  2016年   11篇
  2015年   16篇
  2014年   32篇
  2013年   34篇
  2012年   51篇
  2011年   56篇
  2010年   48篇
  2009年   75篇
  2008年   71篇
  2007年   76篇
  2006年   53篇
  2005年   65篇
  2004年   41篇
  2003年   38篇
  2002年   28篇
  2001年   24篇
  2000年   13篇
  1999年   11篇
  1998年   8篇
  1996年   5篇
  1995年   6篇
  1994年   1篇
  1993年   2篇
  1992年   2篇
  1991年   2篇
  1989年   2篇
  1959年   1篇
排序方式: 共有834条查询结果,搜索用时 31 毫秒
121.
针对制造执行系统递阶式的控制结构以及Stigmergy机制在Holonic控制架构中应用的局限性,通过在Holonic制造系统PROSA参考架构基础上为基本holon以及参谋holon分别设计对应的蚂蚁holon,构建了基于Stigmergy的Holonic控制架构,给出了该架构下各类holon单元的4种内部holon(数据holon、决策holon、通讯holon和结构holon),并定义了应用于基本holon和参谋holon之间传递具体信息以及订单holon与资源holon之间协商加工方案的两种信息素。给出了作业车间调度问题的数学描述,以最长完成时间最短为调度目标,提出了在基于Stigmergy的Holonic控制架构下各类holon单元以两种信息素为媒介协商实现作业车间调度的基本策略,并通过算例验证了该策略的有效性。  相似文献   
122.
分析了已有基于贝叶斯学习规则的索赔谈判多agent系统,针对该系统的一些不足,提出基于遗传算法的多agent(以下称为GA-Agents)工程索赔谈判模型。模型采用“谈判门限序列”的概念给出索赔双方的谈判策略,设计了基于承包商Agent,业主Agent和运算Agent的操作流程,并利用遗传算法来不断优化索赔双方的谈判门限序列,使得索赔谈判能够在短时间内达成协议,为解决索赔谈判中存在的低效率、费时费力等问题提出了一个新思路。  相似文献   
123.
王黎明  沈扬 《计算机应用》2010,30(6):1519-1522
针对多议题协商中的僵局问题,提出了一个基于议题权值的优化策略。利用学习机制预测对手议题权值,并考虑多议题协商中各议题之间的相关性,在保证协商参与者利益的前提下,根据议题的权值,有针对性地调整议题预保留值的取值,从而能够打破僵局,并快速消解协商僵局,促使协商双方得到合理协商解,使得协商效率大大提高。  相似文献   
124.
无线传感器网络通常具有分布式数据采集与网内数据处理的特点,因此基于传统数字水印的安全技术难以直接用于传感器网络;针对传感器网络聚类分层的体系结构,通过在簇内建立分组协商机制来生成待嵌入水印,在此基础上实现了一种新的分布式数字水印算法。传感器节点以分组的形式嵌入水印,计算复杂度低,水印具有良好的抗攻击性和对有损压缩的鲁棒性。实验结果表明用该算法嵌入的水印可检测性强,能够成功地鉴别数据是否被非法篡改,保护传感器网络数据安全。  相似文献   
125.
This study used a within-family observational design to examine conflict strategies (planning, opposition) and resolutions (standoff, win-loss, compromise) across family subsystems, with an emphasis on power differences between parents and children during relatively symmetrical within-generation (spousal, sibling) and relatively asymmetrical between-generation (parent–child) dyadic interactions. Up to six dyads in 67 families (children's ages ranging from 3 to 12 years) discussed an unresolved conflict. Results revealed that within-generation discussions ended more in standoff, whereas between-generation discussions ended with more win-loss resolutions. Multilevel analyses indicated that parents engaged in more planning and opposition than children; however, they opposed more and planned less with their spouses than their children. In general, more planning and less opposition were associated with achieving resolutions rather than failing to resolve differences. Some effects were qualified by within-family differences between mothers versus fathers and older versus younger siblings, as well as between-family differences in younger siblings' age. Implications for theories of power and family relationship dynamics are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
126.
汪秋云  蒋文保  王鸿 《电信科学》2013,29(10):103-107
针对移动环境下使用传统信任协商方案存在的通信开销、存储开销及计算开销大的问题,提出一种基于属性披露的移动信任协商方案,协商时双方首先交换包含加密属性的信任证,并根据对对方的信任度评估,预先选择性地显露证书中的某些敏感属性,之后再根据协商策略多次交换属性加密密钥,逐步向对方显示自己的属性,从而完成协商过程。通过具体的应用实例说明方案的实现过程,方案性能分析表明该方案高效可行。  相似文献   
127.
针对分簇无线传感网中的节点认证问题,使用轻量级的哈希函数和异或运算,设计了一种节点认证及密钥协商方案,将匿名机制引入节点认证过程中,保护了节点隐私安全,提高了网络抵御流量分析攻击的能力.对认证方案抗攻击性能和资源开销的对比分析结果表明,提出的方案可以提供良好的安全认证,并具有较低的计算、存储和通信开销.  相似文献   
128.
陈希祥 《铜业工程》2012,(3):53-55,63
通过系统分析加工企业的成本构成要素,从理论上推导出八点主要成本控制要素;在进一步结合实际采购实例(铜管二期料架竞争性谈判)对以上理论进行运用;最终得出,在机加工产品的商务谈判实务中,该理论具有一定的可行性。  相似文献   
129.
Within a supply chain network, it is common for companies to engage in negotiations to resolve conflicts in task allocation and order fulfilment problems. This kind of supply chain negotiation is usually regarded as buyer–seller negotiation. In recent years, multi-agent systems have been established to automate buyer–seller negotiations. However, most have limitations in handling complex negotiation scenarios such as multilateral negotiations and multi-issue negotiations. This paper presents ECNPro (the Extended Contract-Net-like multilateral Protocol), which is a new multi-agent protocol for handling buyer–seller negotiations in supply chain management. ECNPro is designed to handle agent bargaining and interactions in complex multilateral and multi-issue negotiations in which the buyer has to negotiate with many suppliers. The multi-attribute utility theory (MAUT) approach is adopted to establish the utility functions for a set of negotiation issues in the bargaining process. It adopts a multi-threaded approach to allow the buyer to bargain concurrently with multiple suppliers. ECNPro is able to split an order to more than one supplier to achieve a better negotiation payoff. In addition, mobile agents are employed in ECNPro, the buyer sends mobile agents to sites of the sellers to conduct bargaining locally. This approach improves the negotiation efficiency significantly.  相似文献   
130.
One of the main critique on cellular manufacturing and its algorithms is their inability to handle dynamics events, especially dynamic changes in part spectrum. Unfortunately, there are not many efforts in the literature to overcome this problem. Agent oriented computing provides a marvellous opportunity to handle dynamic problems and to provide effective solutions, if carefully and intelligently implemented. In this paper, we have proposed a novel agent-based clustering algorithm for part family formation in cellular manufacturing by considering dynamic demand changes. However, it is not easy to directly compare the performance of the proposed algorithm with the literature results as there is no benchmark for dynamic cell formation problems. We attempt to compare the performance of the present algorithm on static test problems by dynamically introducing parts in these data-sets to our algorithm. Many results have been presented on these static data-sets by utilising several heuristics, meta-heuristics and optimisation-based algorithms. Although the proposed algorithm is not an optimisation-based algorithm and its operation is directed to handle dynamic changes in the problem domain through negotiation, we have shown that it has ability to provide very good results which are comparable to the best known solutions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号