全文获取类型
收费全文 | 158篇 |
免费 | 9篇 |
专业分类
167篇 |
出版年
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 4篇 |
2015年 | 4篇 |
2014年 | 9篇 |
2013年 | 6篇 |
2012年 | 4篇 |
2011年 | 2篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2003年 | 1篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 12篇 |
1998年 | 16篇 |
1997年 | 18篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 2篇 |
排序方式: 共有167条查询结果,搜索用时 15 毫秒
141.
报道了采用亲和树脂法对相思子毒素蛋白进行反复的SELEX筛选,获得与靶物质结合率这32.5%的富集文库,并克隆得到了单克隆适配子序列,软件模拟了这些序列的二级结构,选择部分序列选择性剪切后利用荧光偏振方法进行检测,对靶蛋白的检测限达到亚nmol量。 相似文献
142.
Qiang Zhou Hu-guang He San-feng Liu Xiao-shuo Chen Ze-xun Tang Yang Liu Zhen-yu Qiu Sen-sen Li He Wang Yin-zhi Zhou Jian-nan Zhou Hua-lin Fan Feng-nian Jin 《防务技术》2021,17(2):512-530
To improve corrosion-resistance of shallow-buried concrete urban utility tunnels(UUTs),basalt fiber reinforced polymer(BFRP)bars are applied to reinforce UUTs.As the UUT must have excellent survival capability under accidental explosions,a shallow-buried BFRP bars reinforced UUT(BBRU)was designed and constructed.Repetitive blast experiments were carried out on this BBRU.Dynamic responses,damage evolutions and failure styles of the BBRU under repetitive explosions were revealed.The tunnel roof is the most vulnerable component and longitudinal cracks develop along the tunnel.When the scaled distance is larger than 1.10 m/kg1/3,no cracks are observed in the experiments.When the BBRU is severely damaged,there are five cracks forming and developing along the roof.The roof is simplified as a clamped-supported one-way slab,proved by the observation that the maximum strain of the transverse bar is much larger than that of the longitudinal bar.Dynamic responses of the roof slab are predicted by dynamic Euler beam theory,which can consistently predict the roof displacement under large-scaled-distance explosion.Compared with the UUT reinforced with steel bars,the BBRU has advantages in blast resistance with smaller deflections and more evenly-distributed cracks when the scaled distance is smaller than 1.260 m/kg1/3 and the steel bars enter plastic state.Longer elastic defamation of the BFRP bars endows the UUT more excellent blast resistance under small-scaled-distance explosions. 相似文献
143.
Accelerated life testing (ALT) is commonly used to obtain reliability information about a product in a timely manner. Several stress loading designs have been proposed and recent research interests have emerged concerning the development of equivalent ALT plans. Step‐stress ALT (SSALT) is one of the most commonly used stress loadings because it usually shortens the test duration and reduces the number of required test units. This article considers two fundamental questions when designing a SSALT and provides formal proofs in answer to each. Namely: (1) can a simple SSALT be designed so that it is equivalent to other stress loading designs? (2) when optimizing a multilevel SSALT, does it degenerate to a simple SSALT plan? The answers to both queries, under certain reasonable model assumptions, are shown to be a qualified YES. In addition, we provide an argument to support the rationale of a common practice in designing a SSALT, that is, setting the higher stress level as high as possible in a SSALT plan. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
144.
20世纪20年代中国的留苏教育不仅为中国培养了革命干部,而且为中国共产党造就了一批军事人才。以往人们对前者关注较多,而对后者注意甚少。本文试图探讨20世纪20年代留苏军事教育的发展过程及其与中国国内革命形势的关系和对后来中国革命的影响。 相似文献
145.
研究利用神经网络实现超分辨雷达成像。该方法首先根据Tuff的前后向线性预测(FBLP)方程用神经网络得到样本序列的AR模型参数,然后利用神经网络作线性预测外推,再用神经网络对外推后的数据作离散哈特来变换(DHT)。从哈特来变换可以方便地得到外推数据的离散傅里叶变换,从而得到距离-多普勒超分辨雷达像。利用微波暗室数据对这一方法进行了数字仿真,结果表明这种方法是可行的,即使在低信噪比下也有较好的性能。 相似文献
146.
构件和运动副的工作能力的定量描述 总被引:1,自引:0,他引:1
继建立起机构工作能力的计算模型之后,讨论如何将构件和运动副的工作能力定量化,并给出了计算示例,从而使机构工作能力的定量分析更为明了. 相似文献
147.
用5种不同底质(淤泥、岩石、卵石、沙和沙砾)的湖底混响数据探讨了高频混响具有混沌特性.该结论将有助于提高混响背景下信号检测性能. 相似文献
148.
In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches. 相似文献
149.
Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015 相似文献
150.
In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献