全文获取类型
收费全文 | 49篇 |
免费 | 8篇 |
专业分类
化学 | 3篇 |
力学 | 15篇 |
综合类 | 1篇 |
数学 | 13篇 |
物理学 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 7篇 |
2012年 | 1篇 |
2011年 | 3篇 |
2010年 | 1篇 |
2009年 | 4篇 |
2008年 | 1篇 |
2007年 | 10篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 1篇 |
2001年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有57条查询结果,搜索用时 31 毫秒
1.
2.
3.
Parametric study of ship maneuverability in laterally restricted waters: Stochastic control approach
A stochastic control approach is used in a parametric study of ship maneuverability in a restricted channel of prescribed geometry. A realistic method, based on some empirical data, is used for the mathematical modelling of the ship motion in deep water.The authors are grateful to Mr. Lodewyk Wessels, Department of Electrical and Electronic Engineering, University of Pretoria, for generating the plots in this article. 相似文献
4.
This paper formulates a model for finding a minimum cost routing in a network for a heterogeneous fleet of ships engaged in pickup and delivery of several liquid bulk products. The problem is frequently encountered by maritime chemical transport companies, including oil companies serving an archipelago of islands. The products are assumed to require dedicated compartments in the ship. The problem is to decide how much of each product should be carried by each ship from supply ports to demand ports, subject to the inventory level of each product in each port being maintained between certain levels that are set by the production rates, the consumption rates, and the storage capacities of the various products in each port. This important and challenging inventory constrained multi-ship pickup–delivery problem is formulated as a mixed-integer nonlinear program. We show that the model can be reformulated as an equivalent mixed-integer linear program with special structure. Over 100 test problems are randomly generated and solved using CPLEX 7.5. The results of our numerical experiments illuminate where problem structure can be exploited in order to solve larger instances of the model. Part II of the sequel will deal with new algorithms that take advantage of model properties. 相似文献
5.
This paper addresses the problem of determining stowage plans for containers in a ship, that is the so-called master bay plan problem (MBPP). 相似文献
6.
7.
蔡泽伟 《宁波大学学报(理工版)》1989,(1)
作者设计并制作了伪随机二进制(PRBS)信号发生器。井以PRBS信号操舵,辨识了船舶操纵运动方程的系数。用离散时间测量决定线性连续时间模型参数。给出了Mariner标准模型和一艘渔轮的辨识结果,井与标准的Nomoto及,T计算结果进行了比较,结果令人满意。 相似文献
8.
Ship maneuvering in the confined inland waterway is investigated using the system-based method, where a nonlinear transient hydrodynamic model is adopted and confinement models are implemented to account for the influence of the channel bank and bottom. The maneuvering model is validated using the turning circle test, and the confinement model is validated using the experimental data. The separation distance, ship speed, and channel width are then varied to investigate their influences on ship maneuverability. With smaller separation distances and higher speeds near the bank, the ship's trajectory deviates more from the original course and the bow is repelled with a larger yaw angle, which increase the difficulty of maneuvering. Smaller channel widths induce higher advancing resistances on the ship. The minimum distance to the bank are extracted and studied. It is suggested to navigate the ship in the middle of the channel and with a reasonable speed in the restricted waterway. 相似文献
9.
特征线谱提取是舰船目标识别的一个重要研究环节,常采用传统的DEMON谱分析方法,处理过程中,一般对舰船噪声时域信号未予抑噪,低信噪比情况下,传统DEMON谱分析性能差。对此,提出一种采用遗传算法优化变分模态分解方法,用于分解舰船噪声原时域信号,获得抑制噪声后的舰船噪声重构信号,进而有效提取了舰船目标噪声幅度调制特征线谱。该方法首先采用遗传算法优化变分模态分解的两个关键输入参数(分解所取模态个数和惩罚因子),对变分模态分解得到的各阶固有模态分量加以判别,去除噪声主导分量,保留信号主导分量,使重构舰船噪声信号显著抑制了干扰噪声,然后对降噪后的重构信号进行频谱分析,获得目标噪声调制特征线谱。理论分析、仿真和实验数据处理结果表明,相比传统DEMON谱分析法,基于遗传算法优化变分模态分解的舰船噪声特征线谱提取方法具有更好的噪声抑制能力,所获取的舰船噪声幅度调制特征线谱信噪比明显高于传统DEMON方法,具有一定优势,前景良好。 相似文献
10.
Ibrahim Ari Vural Aksakalli Volkan Aydogˇdu Serdar Kum 《European Journal of Operational Research》2013
We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships, or even an entire coastline. We present a graph-theoretic solution on an appropriately-weighted directed graph representation of the navigation area obtained via 8-adjacency integer lattice discretization and utilization of the A∗ algorithm. We explicitly account for the following three conditions as part of the turn-radius constraints: (1) the ship’s left and right turn radii are different, (2) ship’s speed reduces while turning, and (3) the ship needs to navigate a certain minimum number of lattice edges along a straight line before making any turns. The last constraint ensures that the navigation area can be discretized at any desired resolution. Once the optimal (discrete) path is determined, we smoothen it to emulate the actual navigation of the ship. We illustrate our methodology on an ice navigation example involving a 100,000 DWT merchant ship and present a proof-of-concept by simulating the ship’s path in a full-mission ship handling simulator. 相似文献