首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   531篇
  免费   13篇
  国内免费   9篇
工业技术   553篇
  2023年   1篇
  2022年   2篇
  2021年   6篇
  2020年   5篇
  2019年   2篇
  2018年   1篇
  2017年   3篇
  2016年   11篇
  2015年   9篇
  2014年   26篇
  2013年   24篇
  2012年   70篇
  2011年   57篇
  2010年   39篇
  2009年   37篇
  2008年   21篇
  2007年   35篇
  2006年   26篇
  2005年   23篇
  2004年   28篇
  2003年   26篇
  2002年   19篇
  2001年   20篇
  2000年   10篇
  1999年   14篇
  1998年   8篇
  1997年   8篇
  1996年   6篇
  1995年   2篇
  1994年   2篇
  1993年   3篇
  1992年   1篇
  1991年   2篇
  1990年   1篇
  1986年   1篇
  1983年   1篇
  1981年   1篇
  1969年   1篇
  1954年   1篇
排序方式: 共有553条查询结果,搜索用时 31 毫秒
61.
云南少数民族地区计算机高等教育的现状与思考   总被引:1,自引:0,他引:1  
本文从云南少数民族计算机高等教育的概念出发,分析了当前云南省民族地区计算机高等教育的现状以及存在的问题,并在此基础上提出了民族地区少数民族高等教育的对策。  相似文献   
62.
This paper studies the use of multicast together with proxy nodes for reliably disseminating data from a single source to a large number of receivers. In order to achieve reliability, data must be retransmitted in case of loss either by the source or by special network nodes, called proxies. Each proxy is responsible for reliably delivering the data to a subgroup it is assigned. The multicast tree is partitioned into subgroups that form a hierarchy rooted at the source, hence the term hierarchical reliable multicast. The performance of this approach strongly depends on the topology and the loss characteristics of the underlying tree and the location of proxies. In the first part of the paper, we study the processing and bandwidth performance of such a reliable multicast dissemination given the tree and the placement of proxies. In the second part of the paper, we develop dynamic programming algorithms that give a placement of a fixed number of proxies on an arbitrary tree that minimizes the bandwidth used for reliable transfer. The first algorithm provides an optimal solution to the multicast proxies location problem in polynomial time, in the number of nodes and proxies. The second is an approximation algorithm that gives a solution with cost within a chosen precision from the optimal, in an improved running time. An optimal and an approximate solution are also provided for the proxies location problem if unicast is used for transmissions. Applications of this dynamic programming approach to related problems are discussed.  相似文献   
63.
随着国家经济文化的快速发展,新形势下品牌形象在设计推广中面临前所未有的竞争和挑战。通过对新时期品牌设计与经济民生的作用,品牌推广对智能科技与文化价值输出的影响,以及品牌设计对人才培养及企业发展与社会责任等多方面问题分析,从品牌视觉传达设计管理角度,根据多年实践经验总结、梳理出影响品牌推广的宏观和微观的关键内容。通过对新时期下社会发展人才需求的分析,找到专业的学科新架构和学科人才培养方向,为解决国家、城市、企业品牌建设和社会经济发展服务找到更好的方式和方法。  相似文献   
64.
栾川钼矿田的开发和利用   总被引:2,自引:0,他引:2  
介绍了栾川钼矿资源概况及开发现状,分析了栾川钼资源在开发利用过程中存在的问题,提出了今后对栾川钼矿资源综合开发利用的建议与对策。  相似文献   
65.
Parallel programming environments provide a way for programmers to reap the benefits of parallelism, while reducing the effort required to create parallel applications. The CO2P3S parallel programming system is one such tool that uses a pattern-based approach to express concurrency. Using the Cowichan Problems, we demonstrate that CO2P3S contains a rich set of parallel patterns for implementing a wide variety of applications running on shared-memory or distributed-memory hardware. An example of these parallel patterns, the Search-Tree pattern, is described and it is shown how the pattern was used to solve the Fifteen Puzzle problem. Code metrics and performance results are presented for the Cowichan applications to show the usability of the CO2P3S system and its ability to reduce programming effort, while producing programs with reasonable performance.  相似文献   
66.
低压欠平衡钻井--勘探钻井中技术发展新动向(续)   总被引:6,自引:1,他引:5  
介绍了国外欠平衡钻井的发展与应用,以及目前存在的主要问题。在此基础上提出了低压欠平衡钻井技术系列,它是一套特殊工作液(气体、充气液、特殊泡沫、低密度液体)、特殊压力控制(平衡、欠平衡、过平衡)、低液柱压力与特殊屏蔽暂堵相结合的技术。  相似文献   
67.
财务管理本科专业始建于1998年的财经类高校,随着社会经济发展和企业管理的需要,综合性大学和工科院校也先后设置了财务管理本科专业。针对财务管理本科专业的人才培养,不同类型高校都进行了有益的探索,由于办学背景的不同,各个高校制订的财务管理本科专业人才培养方案应具有明显差异。如何体现工科院校办学背景,彰显财务管理本科专业建设的特色,是值得工科院校财务教育专家深入研究的。本文在分析工科院校办学特色的基础上,提出了工科院校财务管理本科专业建设思路与相关措施。  相似文献   
68.
煤炭是我国的主要能源,是国民经济和社会发展不可缺少的物资基础。随着日本核事故的发生,核电发展"被"放缓,而全球煤炭需求将增长。本文主要介绍了煤炭资源在我国国民经济中的需求状况,分析了煤炭产业在我国发展中所面临的一些问题,并提出了煤炭产业发展的一些建议。  相似文献   
69.
在油田进一步推进学习型党组织建设的进程中,要通过明确学习目标,采取正确的学习方式方法,并与实践工作紧密结合,从而解决生产一线单位学习动力不足、工学矛盾突出、学以致用不够等问题。  相似文献   
70.

Efficient Resource management has a direct influence on business performance and profitability. Vehicle Routing Problems (VRPs) considered in this paper are resource management problems where the aim is to use the limited number of resources to a large number of jobs so that the maximum number of jobs can be completed with minimum cost. A VRP consists of a workforce of maintenance engineers and a set of geographically distributed customers requiring certain services. The problem is complicated by incorporating certain technological and temporal constraints. The objective is to maximize the amount of work done measured in terms of total number of jobs completed and to minimize the total distance travelled by all the engineers. The solution to a VRP is a list of engineers and for each engineer a tour consisting of an ordered list of services to be completed by him under the given constraints. These Problems belong to the class of NP-Complete problems. The stochastic techniques such as Hill-Climbing (HC), Tabu Search (TS), Genetic Algorithms (GA) and Simulated Annealing (SA) are found to be suitable for solving these problems efficiently. It is found empirically that out of these SA gives good results for VRPs. But in some cases it also gives poor quality results. This happens due to not allocating intelligently the unallocated jobs in SA in subsequent iterations. A new algorithm is proposed to solve VRPs in this paper. This is achieved by allocating unallocated jobs intelligently in SA. The proposed algorithm is tested empirically on a number of randomly generated VRPs. Three types of VRPs considered are over resourced, under resourced and critically resourced VRPs. In almost all cases, the proposed algorithm completes a large number of jobs with minimum cost in comparison with SA.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号