全文获取类型
收费全文 | 219篇 |
免费 | 124篇 |
国内免费 | 17篇 |
出版年
2024年 | 4篇 |
2023年 | 5篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 19篇 |
2013年 | 8篇 |
2012年 | 17篇 |
2011年 | 17篇 |
2010年 | 15篇 |
2009年 | 8篇 |
2008年 | 16篇 |
2007年 | 9篇 |
2006年 | 17篇 |
2005年 | 10篇 |
2004年 | 18篇 |
2003年 | 9篇 |
2002年 | 11篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 18篇 |
1998年 | 17篇 |
1997年 | 12篇 |
1996年 | 12篇 |
1995年 | 3篇 |
1994年 | 10篇 |
1993年 | 7篇 |
1992年 | 14篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有360条查询结果,搜索用时 19 毫秒
121.
姬凤霞 《兵团教育学院学报》2002,12(3):57-59
教师职业口语是研究教师口语运用规律的一门应用语言学科,它包括教学口语和教育口语.教师工作主要依靠言语活动对学生传授知识,培养能力,进行教育.了解其行业口语风格的成因以及它所表现出的多方面、多层次的特征,目的是树立一个规范的标尺,更好地实现教育过程,达到教育目标. 相似文献
122.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
123.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
124.
125.
引入自挤压工艺辅助超重力下燃烧合成制备Al2O3-ZrO2(4Y)共晶复合陶瓷,可有效地消除陶瓷制品的缩孔、缩松组织等缺陷,陶瓷致密性得到明显提高,同时又有效地抑制陶瓷裂纹萌生。XRD分析显示共晶陶瓷由α-Al2O3,t-ZrO2及少量的m-ZrO2三相组成,且随自挤压力增大,陶瓷中可相变的t-ZrO2的体积分数增加。SEM观察发现陶瓷的显微组织中的棒状共晶团随自挤压力的增大而细化,体积分数增加,且分布其上的t-ZrO2纤维直径变小,共晶团组织边缘处的ZrO2枝晶逐渐转变为细小的球晶,共晶团边界组织厚度逐渐减小,从而使陶瓷力学性能得以提升。 相似文献
126.
设计了一种利用单孔径双极化天线进行GPS自适应抗干扰的方法,并对算法的性能进行了详细的分析.新方法在不降低卫星信号质量的前提下,仅占用单个天线位置,就可以对付窄带或宽带干扰,为增强安装受限装备的导航抗干扰能力提供了一种新的解决方案.仿真结果表明,新方法可行、有效. 相似文献
127.
多发多收(MIMO)体制雷达综合采用多通道、多频技术,为解决星载GMTI面临的探测慢速运动目标和消除盲速估计等问题提供了有效途径。MIMO雷达工作的基础是有效的波形设计。因此,在分析正交波形性能的基础上,结合GMTI应用需求,建立了星载MIMO雷达步进频率正交信号的基本参数确定准则,研究了步进频率MIMO雷达空时频联合自适应处理的基本原理,通过仿真验证了MIMO雷达在杂波抑制和GMTI性能上的优势。 相似文献
128.
方奕 《兵团教育学院学报》2010,20(3):1-3
东西的长篇小说《后悔录》立意奇崛,个性彰显,以历史为透视镜,将日常生活中的悲剧与喜剧合而为一并作极端化呈现,突现了荒诞的魅力以及人在面对荒诞时人性深处无处逃遁的灵魂的疼痛。 相似文献
129.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
130.
建立了能利用系数层间和层内相互依赖的关系模型,推导了应用最小均方误差原理去除图像中噪声的算法,而且运用隐参变量描述方式,使得小波系数那种反映图像边缘强度特征的空间变属性表现了出来,使算法具有空间自适应能力,实验结果显示该方法比目前存在的一些方法更具优越性。 相似文献