全文获取类型
收费全文 | 125篇 |
免费 | 8篇 |
专业分类
公路运输 | 25篇 |
综合类 | 54篇 |
水路运输 | 25篇 |
铁路运输 | 25篇 |
综合运输 | 4篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 11篇 |
2013年 | 13篇 |
2012年 | 9篇 |
2011年 | 7篇 |
2010年 | 9篇 |
2009年 | 9篇 |
2008年 | 14篇 |
2007年 | 10篇 |
2006年 | 5篇 |
2005年 | 4篇 |
2004年 | 8篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1997年 | 1篇 |
1994年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有133条查询结果,搜索用时 15 毫秒
31.
This paper presented a concatenated maximum-likelihood (ML) decoder for space-time/space-frequency block coded orthogonal frequency diversion multiplexing (ST/SFBC-OFDM) systems in double selective fading channels. The proposed decoder first detects space-time or space-frequency codeword elements separately. Then,according to the coarsely estimated codeword elements, the ML decoding is performed in a smaller constellation element set to searching final codeword. It is proved that the proposed decoder has optimal performances if and only if subchannels are constant during a codeword interval. The simulation results show that the performances of proposed decoder is close to that of the optimal ML decoder in severe Doppler and delay spread channels. However,the complexity of proposed decoder is much lower than that of the optimal ML decoder. 相似文献
32.
回收物流设施多层选址模型及其算法 总被引:7,自引:0,他引:7
针对废弃物品的收集、预处理和再制造问题,建立了回收物流设施选址混合整数规划(MILP)模型,用分枝定界法求解,为提高分枝定界法的收敛速度、减少运算量,先用遗传算法为MILP找到较好的可行解,以其对应的目标函数值为分枝界定法上界,从而可以在分枝界定法的搜索中剪去大量分枝.用算例证明了算法的有效性和可行性. 相似文献
33.
According to the researches on theoretic basis in part I of the paper,the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part,part Ⅱ of the paper.The algorithms trans form first the general network into the pair sets network,and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network.As for the even network,the algorithm requires only one time of trans formation and decomposition,the maximum independent set can be gained without any iteration processes,and the time complexity of the algorithm is within the bound of O(|V|^3).However,as for the odd network,the algorithm consists of two stages.In the first stage,the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first;then the algorithm turns to the second stage,searching for the negative envelope graphs within the pseudo-negative envelope graphs only.Each time as a negative envelope graphhas been found.renew the pair sets network by iteration at once.and then tum back to the first stage.So both stages form a circulation process up to the optimum.Two available methods,the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network.Both of them link up with each other harmoniously and are embedded together in the algorithm.Analysis and study indicate that the time complexity of this algorithm is within the bound of O(|V|^5). 相似文献
34.
Applications on iterative control and multiple input multiple output (MIMO) system were developed. Two new charts derived from extrinsic information transfer (EXIT) chart were employed as the designing tools, which are called as output mutual information chart with defined iterative degree (DID) chart and near optimum output mutual information (NOMI) chart respectively. Different from the EXIT chart, they can show the iterative performance on the whole signal-to-noise ratio range with one single curve, whereas computation complexity is greatly reduced compared with conventional bit error ratio (BER) performance curve. The iterative control was implemented according to a near-optimum iterative degree vector determined by NOMI chart, the reasonability of uncertain parameters was analyzed in one MIMO system. The concepts were illustrated based on bit-interleaved coded modulation with iterative decoding (BICM-ID). 相似文献
35.
介绍了极限分析上限法的基本原理和求解步骤,通过极限分上限法推导出求解小净距隧道支护反力的基本公式,采用M atlab数值软件对小净距隧道的支护反力进行了计算分析,并与前人计算结果进行比较。比较分析表明本文结果是完全正确可行的。研究解破裂角与净距之间的关系,结果表明双洞隧道支护反力的净距范围为在0.96D-2.73D之间。 相似文献
36.
基于联合迭代译码的LDPC编码协作系统 总被引:3,自引:0,他引:3
为提高系统性能,提出了分别采用正规LDPC(low-density parity-check code)和非正规系统LDPC码的编码协作通信系统,并给出了用于源节点和中继点的双LDPC码的构造方法.导出了基于双LDPC码的总体校验矩阵,据此校验矩阵给出了相应的双层结构Tanner图,目的点采用基于该双层结构Tanner图的联合迭代译码新算法译码.理论分析和数值模拟表明,在相同条件下,理想LDPC编码协作系统的性能明显优于编码非协作系统的性能,当误比特率为10-5、译码迭代10次时,理想正规LDPC码和非正规系统LDPC码编码协作系统较相应的编码非协作系统分别具有1.0和0.6 dB增益. 相似文献
37.
黄伟 《西南交通大学学报(英文版)》2007,15(4):331-337
Introduction Arbitrage opportunities attract considerable atten-tion of scholars in economics and finance. Modiglianiand Miller first performed no-arbitrage equilibriumanalysis in 1958[1]. Following their work, Black andScholes[2]deduced the option pricing model. Ross[3]and Cox[4]put forward arbitrage theory and risk neu-tral pricing method. Harrison and Kreps[5], and Har-rison and Pliska[6]proved that the no-arbitrage equi-librium system can be constructed by equivalent mar-tingale measur… 相似文献
38.
文章介绍了一种基于梯度算法的Turbo乘积码(以RS码作为分量码)的译码算法。该算法以迭代Chase-Ⅱ算法为基础,利用该算法译码得到的每行(或列)最优判决码D(m-1)来代替竞争码字C,节省了寻找C的过程,从而简化了外信息和软输出的计算。文章以RS(15,11)码为分量码进行了matlab仿真,仿真结果表明:该算法能在基本保持turbo乘积码和Chase算法译码性能基础上,提高译码速度,降低译码复杂度。 相似文献
39.
40.
Julián Martínez Moya 《运输评论》2017,37(3):300-321
As a result of the intense changes occurring in port environment over the last decades, new models of competitiveness have been developed, where port authorities try to increase their attractiveness. In this context, one of the most debated issues in this area of research is still the role played by port authorities in defining port competitiveness. The aim of this paper is to provide a review of port choice literature enabling to identify the main port choice’s criteria in order to define the role played by Port Authorities and to point out future lines of research that should be undertaken to fully incorporate current ports’ environment and performance. The results show that although some studies point out the importance of geographical factors in port choice, a larger number of studies defend the increasing role played by port authorities in determining the competitiveness through investing in port infrastructure, improving port efficiency or hinterland accessibility. Despite the existing models contributing on this topic, there are still some gaps in terms of measuring the port performance, including port strategies and studying the port choice for specific industries. 相似文献