全文获取类型
收费全文 | 16342篇 |
免费 | 2185篇 |
国内免费 | 2198篇 |
专业分类
电工技术 | 1609篇 |
综合类 | 1662篇 |
化学工业 | 458篇 |
金属工艺 | 166篇 |
机械仪表 | 1331篇 |
建筑科学 | 458篇 |
矿业工程 | 170篇 |
能源动力 | 319篇 |
轻工业 | 141篇 |
水利工程 | 495篇 |
石油天然气 | 231篇 |
武器工业 | 126篇 |
无线电 | 1817篇 |
一般工业技术 | 2195篇 |
冶金工业 | 228篇 |
原子能技术 | 33篇 |
自动化技术 | 9286篇 |
出版年
2024年 | 115篇 |
2023年 | 315篇 |
2022年 | 451篇 |
2021年 | 485篇 |
2020年 | 672篇 |
2019年 | 635篇 |
2018年 | 599篇 |
2017年 | 739篇 |
2016年 | 813篇 |
2015年 | 789篇 |
2014年 | 1106篇 |
2013年 | 1750篇 |
2012年 | 1242篇 |
2011年 | 1175篇 |
2010年 | 898篇 |
2009年 | 1091篇 |
2008年 | 1087篇 |
2007年 | 1099篇 |
2006年 | 981篇 |
2005年 | 845篇 |
2004年 | 700篇 |
2003年 | 504篇 |
2002年 | 451篇 |
2001年 | 339篇 |
2000年 | 269篇 |
1999年 | 258篇 |
1998年 | 186篇 |
1997年 | 178篇 |
1996年 | 149篇 |
1995年 | 141篇 |
1994年 | 117篇 |
1993年 | 77篇 |
1992年 | 79篇 |
1991年 | 65篇 |
1990年 | 54篇 |
1989年 | 36篇 |
1988年 | 23篇 |
1987年 | 17篇 |
1986年 | 25篇 |
1985年 | 18篇 |
1984年 | 28篇 |
1983年 | 18篇 |
1982年 | 23篇 |
1981年 | 18篇 |
1980年 | 15篇 |
1979年 | 16篇 |
1978年 | 14篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies. 相似文献
22.
本文在分析局域网服务器信息缓冲区、数据包接受和发送缓冲区的相互关系基础上提出一种新的局域网服务器缓冲区设计方法─—广义随机Petri网方法,并给出了局域网服务器信息缓冲区的广义随机Petri网模型。该设计方法理论完备、严谨实用,且不再局限于追求某一边界值(上限或下限),并且避免了排队理论处理多级服务的繁琐公式。最后本文用一例题说明了这种方法的应用。 相似文献
23.
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. 相似文献
24.
Maciej W. Rogoziski 《Systems & Control Letters》1989,12(5):449-453
An optimal predictor is developed for a singular random process generated by a known system driven by a white noise sequence. The properties of the predictor are compared with those of the optimal predictor for a nonsingular random process. 相似文献
25.
Abel Cadenillas 《Systems & Control Letters》2002,47(5):433-444
We consider a stochastic control problem with linear dynamics with jumps, convex cost criterion, and convex state constraint, in which the control enters the drift, the diffusion, and the jump coefficients. We allow these coefficients to be random, and do not impose any Lp-bounds on the control.
We obtain a stochastic maximum principle for this model that provides both necessary and sufficient conditions of optimality. This is the first version of the stochastic maximum principle that covers the consumption–investment problem in which there are jumps in the price system. 相似文献
26.
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. 相似文献
27.
28.
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… 相似文献
29.
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. 相似文献
30.
The inherently nonlinear phenomenon of fatigue crack propagation is modeled as a linear random process. To a first approximation, simple, nonstationary time series models are introduced and standard techniques for determining the parameters of autoregressive integrated moving-average processes are applied. Multiplicative time series models are next utilised for the representation of a group of crack history curves. Implementation of the models on the Virkler experimental data set yields satisfactory results. Reliable Gaussian approximations to the distribution of the time required by a crack to reach a specified critical length are obtained, and the usefulness of the approach is demonstrated when updating lifetime predictions after periodic inspections. 相似文献