全文获取类型
收费全文 | 19553篇 |
免费 | 2918篇 |
国内免费 | 1924篇 |
专业分类
电工技术 | 2030篇 |
技术理论 | 1篇 |
综合类 | 1742篇 |
化学工业 | 779篇 |
金属工艺 | 386篇 |
机械仪表 | 2218篇 |
建筑科学 | 746篇 |
矿业工程 | 316篇 |
能源动力 | 323篇 |
轻工业 | 306篇 |
水利工程 | 380篇 |
石油天然气 | 280篇 |
武器工业 | 162篇 |
无线电 | 2470篇 |
一般工业技术 | 3025篇 |
冶金工业 | 885篇 |
原子能技术 | 24篇 |
自动化技术 | 8322篇 |
出版年
2024年 | 148篇 |
2023年 | 475篇 |
2022年 | 588篇 |
2021年 | 734篇 |
2020年 | 902篇 |
2019年 | 782篇 |
2018年 | 784篇 |
2017年 | 863篇 |
2016年 | 936篇 |
2015年 | 985篇 |
2014年 | 1340篇 |
2013年 | 1766篇 |
2012年 | 1451篇 |
2011年 | 1406篇 |
2010年 | 1094篇 |
2009年 | 1241篇 |
2008年 | 1230篇 |
2007年 | 1294篇 |
2006年 | 1131篇 |
2005年 | 1003篇 |
2004年 | 809篇 |
2003年 | 618篇 |
2002年 | 510篇 |
2001年 | 440篇 |
2000年 | 309篇 |
1999年 | 281篇 |
1998年 | 214篇 |
1997年 | 187篇 |
1996年 | 132篇 |
1995年 | 125篇 |
1994年 | 97篇 |
1993年 | 68篇 |
1992年 | 71篇 |
1991年 | 50篇 |
1990年 | 30篇 |
1989年 | 33篇 |
1988年 | 14篇 |
1986年 | 19篇 |
1985年 | 11篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1981年 | 9篇 |
1966年 | 15篇 |
1965年 | 9篇 |
1964年 | 13篇 |
1963年 | 13篇 |
1961年 | 9篇 |
1959年 | 12篇 |
1958年 | 9篇 |
1957年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
61.
柔性植物阻流特性研究 总被引:3,自引:1,他引:2
河流中的植物不仅影响河流的泄洪能力而且在生态的修复中起重要作用,因此对含植物明渠水流的阻力特性及紊流特性的研究显得非常重要。将河道中含柔性植物的水流视为充分发展了的紊流,在实验室中用特定材料模拟柔性植物,通过水槽试验用三维ADV对淹没柔性植物段紊流特性进行了测量研究,分析了含淹没柔性植物明渠水流的水力学特性及阻力特性并得出其曼宁糙率n的变化规律。对试验结果分析表明,含淹没柔性植物的垂向流速分布不再符合指数分布;其紊流具有明显的各向异性特性;植物冠层交界处,水流紊动交换强烈,该处紊流强度及雷诺应力出现最大值。 相似文献
62.
Traditionally, companies used to view themselves as separate entities and did not devote efforts to collaborate with other echelons of the extended enterprise. This even happened at multi-site companies owning different plants that belonged to the same supply chain. However, manufacturing facilities of the same supply chain should intensively share information and coordinate planning and scheduling tasks in order to get a globally optimized solution. This paper discusses some specific characteristics of the planning and scheduling problem in the extended enterprise including an analysis of a case study, and reviews the available state-of-the-art research studies in this field. Most studies suggest that integrated approaches can have a significant impact on the system performance, in terms of lower production costs, and less inventory levels. The paper provides some conclusions and suggestions of future works. 相似文献
63.
Scheduling emergency medicine residents (EMRs) is a complex task, which considers a large number of rules (often conflicting) related to various aspects such as limits on the number of consecutive work hours, number of day and night shifts that should be worked by each resident, resident staffing requirements according to seniority levels for the day and night shifts, restrictions on the number of consecutive day and night shifts assigned, vacation periods, weekend off requests, and fair distribution of responsibilities among the residents. Emergency rooms (ERs) are stressful workplaces, and in addition shift work is well-known to be more demanding than regular daytime work. For this reason, preparing schedules that suit the working rules for EMRs is especially important for reducing the negative impact on shift workers physiologically, psychologically, and socially. In this paper, we present a goal programming (GP) model that accommodates both hard and soft constraints for a monthly planning horizon. The hard constraints should be adhered to strictly, whereas the soft constraints can be violated when necessary. The relative importance values of the soft constraints have been computed by the analytical hierarchy process (AHP), which are used as coefficients of the deviations from the soft constraints in the objective function. The model has been tested in the ER of a major local university hospital. The main conclusions of the study are that problems of realistic size can be solved quickly and the generated schedules have very high qualities compared to the manually prepared schedules, which require a lot of effort and time from the chief resident who is responsible for this duty. 相似文献
64.
65.
柔性制造系统的托盘优化 总被引:1,自引:0,他引:1
本文讨论Job-shop型柔性制造系统的托盘优化问题,给出了求最小托盘数的算法,把托
盘优化问题化成了求解线性整数规划问题. 相似文献
66.
George Chryssolouris James E. Pierce Kristian Dicke 《International Journal of Flexible Manufacturing Systems》1992,4(3-4):309-330
This paper introduces a generic decision-making framework for assigning resources of a manufacturing system to production tasks. Resources are broadly defined production units, such as machines, human operators, or material handling vehicles; and tasks are activities performed by resources. In the specific context of FMS, resources correspond to individual machines; tasks correspond to operations to be performed on parts. The framework assumes a hierarchical structure of the system and calls for the execution of four consecutive steps to make a decision for the assignment of a resource to a task. These steps are 1) establishment of decision-making criteria, 2) formation of alternative assignments, 3) estimation of the consequences of the assignments, and 4) selection of the best alternative assignment. This framework has been applied to an existing FMS as an operational policy that decides what task will be executed on which resource of this FMS. Simulation runs provide some initial results of the application of this policy. It is shown that the policy provides flexibility in terms of system performance and computational effort. 相似文献
67.
68.
The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm 总被引:1,自引:0,他引:1
1 IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1~ 2 ] ,andtheotherisforthequalityofservice[3~6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo… 相似文献
69.
70.
Claudio Arbib Fabrizio Marinelli 《International Journal of Flexible Manufacturing Systems》2003,15(4):333-354
A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a
i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q
* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above. 相似文献