全文获取类型
收费全文 | 4070篇 |
免费 | 535篇 |
国内免费 | 147篇 |
专业分类
化学 | 533篇 |
晶体学 | 6篇 |
力学 | 143篇 |
综合类 | 89篇 |
数学 | 586篇 |
物理学 | 788篇 |
无线电 | 2607篇 |
出版年
2024年 | 19篇 |
2023年 | 101篇 |
2022年 | 197篇 |
2021年 | 323篇 |
2020年 | 224篇 |
2019年 | 154篇 |
2018年 | 108篇 |
2017年 | 168篇 |
2016年 | 241篇 |
2015年 | 202篇 |
2014年 | 352篇 |
2013年 | 254篇 |
2012年 | 285篇 |
2011年 | 291篇 |
2010年 | 224篇 |
2009年 | 212篇 |
2008年 | 241篇 |
2007年 | 218篇 |
2006年 | 199篇 |
2005年 | 162篇 |
2004年 | 112篇 |
2003年 | 99篇 |
2002年 | 50篇 |
2001年 | 59篇 |
2000年 | 51篇 |
1999年 | 28篇 |
1998年 | 24篇 |
1997年 | 26篇 |
1996年 | 30篇 |
1995年 | 22篇 |
1994年 | 9篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 6篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1982年 | 1篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1967年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有4752条查询结果,搜索用时 328 毫秒
991.
A. Boni G. Chiorboli G. Franco M. Ostacoli S. Mazzoleni 《Journal of Electronic Testing》1995,7(3):145-155
A reduced physical model of the integral non-linearity error in high resolution R-2R D/A converters is obtained by circuit analysis and application of the ambiguity algorithm. Its relationships with the well establisheda priori model based on Rademacher functions is discussed. Experiments, carried out on a sample of commercial 12 bit converters, demonstrate that functional test programs based on this model achieve shorter test times and lower prediction errors than those based on larger models obtained by straight QR factorization. 相似文献
992.
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time 总被引:1,自引:0,他引:1
C. T. Ng T. C. Edwin Cheng Adam Janiak Mikhail Y. Kovalyov 《Annals of Operations Research》2005,133(1-4):163-174
The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence
independent setup time preceding the processing of each group. The setup times and the job processing times are controllable
through the allocation of a continuously divisible or discrete resource to them. Each job uses the same amount of the resource.
Each setup also uses the same amount of resource, which may be different from that for the jobs. Polynomial-time algorithms
are constructed for variants of the problem of finding an optimal job sequence and resource values so as to minimize the total
weighted job completion time, subject to given restrictions on resource consumption. The algorithms are based on a polynomial
enumeration of the candidates for an optimal job sequence and solving the problem with a fixed job sequence by linear programming.
This research was supported in part by The Hong Kong Polytechnic University under grant number G-T246 and the Research Grants
Council of Hong Kong under grant number PolyU 5191/01E. In addition, the research of M.Y. Kovalyov was supported by INTAS
under grant number 00-217. 相似文献
993.
本文介绍了用阿特伍德机测量重力加速度的原理和测量方法。用该测量方法测量重力加速度的精度较高,而且测量的自动化程度也较高。 相似文献
994.
Wojtek Michalowski Marta Kersten Szymon Wilk Roman Słowiński 《European Journal of Operational Research》2007
The Mobile Emergency Triage (MET) system is a clinical triage support system that aids physicians in making triage decisions as to whether a child presenting in the Emergency Department of a hospital with a specific pain complaint should be discharged to a family physician, needs to be admitted for further investigation/observation, or requires an urgent specialist consult. The system’s mobile component is designed to work on handheld computers. This paper presents our experience and discusses our original solutions with regard to designing man–machine interactions for mobile clinical support systems. The specific interactions adopted in the MET design that are discussed in the paper were created in consultation with potential end-users and tested at the Children’s Hospital of Eastern Ontario in Ottawa. 相似文献
995.
We show that the O(n log n) (where n is the number of jobs) shortest processing time (SPT) sequence is optimal for the single-machine makespan and total completion time minimization problems when learning is expressed as a function of the sum of the processing times of the already processed jobs. We then show that the two-machine flowshop makespan and total completion time minimization problems are solvable by the SPT sequencing rule when the job processing times are ordered and job-position-based learning is in effect. Finally, we show that when the more specialized proportional job processing times are in place, then our flowshop results apply also in the more general sum-of-job-processing-times-based learning environment. 相似文献
996.
在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小.当一个新的工件集到来时就会产生一些错位,决策者需要插入新工件到原来排序中而还不能过分打乱它们的顺序.该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;也研究了当工件加工时间相同或工件工期相同时,在错位量限制的条件下最小化误工和问题.对这些问题,给出了好的算法. 相似文献
997.
本文对复杂的机床传动系统的动力特性和疲劳载荷进行统计分析,对传动件的疲劳寿命也视为概率分布状态,在探讨载荷与疲劳寿命的分布规律基础上,提出了机床传动件概率设计的理论公式,用这种新的设计方法可以预测传动件的可靠度或疲劳寿命。 相似文献
998.
999.
关于机器随机故障完工时间方差最小化单机调度问题 总被引:2,自引:0,他引:2
讨论了机器随机故障时,工件完工时间方差的期望最小化单机调度问题,其中描述机器故障的计数过程为广义泊松过程.推导出了目标函数等价的确定形式,而后进一步给出了工件加工时间相同时问题的最优解. 相似文献
1000.
本文从实用的角度介绍了变频器在工业洗衣机上的应用,介绍了工业洗衣机的动力要求,变频器的输出特性,变频器在工业洗衣机上的使用方法,以及常见问题和解决办法等. 相似文献