机械多体系统碰撞动力学的对称性和守恒量研究

为给复杂机械多体系统碰撞动力学问题的定量和定性分析提供一个强有力新工具,该文将现代分析力学中的对称性理论引入到机械多体外碰撞动力学研究中.首先,基于冲量动量法推导系统碰撞动力学的Euler-Lagrange方程;其次,引进群分析理论,根据不变性原则给出系统存在Noether对称性与Lie对称性的各自条件方程以及得到相应守恒量的形式,为动力学方程的解析积分理论提供了有效途径.最后以一平面开环两连杆机构的碰撞力学为例进行实际分析运用.研究表明,借助对称性和守恒量可以得到机械多体系统动力学更深层次的力学规律和运动特性,可为系统更精确的动态优化设计和先进控制奠定理论基础.     

基于模糊群子论的可燃性粉尘点着温度试验与分析

为了探讨模糊群子论模型在可燃性粉尘中粒度分布的评价作用及适用性,针对可燃性粉尘颗粒粒度分布的不确定性,依据模糊群子论特有的多层性、模糊性、最可几性和可变性,采用激光粒度仪测定了不同粒度分布范围下可燃性粉尘颗粒粒度分布,通过模糊群子论方法,分析可燃性粉尘颗粒粒度的竞争参数.实验结果表明:粉尘颗粒体系越趋向于小粒径集团为主的分布,其相对应的点着温度也就越低;当粉尘颗粒足够小时,由于受到颗粒间的力、颗粒间的碰撞以及颗粒充装的密实程度的影响,导致其点着温度上升;采用模糊群子论模型可对可燃性粉尘颗粒粒度分布进行定性及定量分析,有助于粉尘爆炸防治技术的发展.     

新世纪春天的旋律

当黄河、长江奏起新春的旋律那珠穆朗玛举起一轮新岁月的朝阳当计算机与算盘把新的宏图计算工地的塔吊扬臂开始指挥新世纪大合唱     

基于浸入边界-有限元法的流固耦合碰撞数值模拟方法

针对流固耦合碰撞问题,建立了流体中固体与固体碰撞界面解析直接模拟方法,采用清晰界面浸入边界法模拟流体中的动边界问题,避免了传统贴体网格方法在求解流体中存在固体间碰撞问题时网格出现负体积的问题,采用基于罚函数的有限元方法对固体的运动和碰撞进行求解,以分域耦合方式实现流体域和固体域的耦合求解.通过与静止流体中球形颗粒与壁面正碰撞和斜碰撞的实验数据对比,验证了建立的数值模拟方法对流体中固体与固体碰撞数值模拟的正确性,获得了流体域流场在碰撞前后随时间的变化,同时通过该文建立的数值模拟方法也获得了固体域中固体的碰撞力和应力.未来,将把该数值模拟方法应用到流体流动环境中,如固体颗粒对管道的冲蚀、流体诱导海洋立管之间的碰撞、坠物对海底管道的撞击等.     

Brown凝并中两个不同直径纳米颗粒的碰撞系数

对Brown凝并中两个不同直径纳米颗粒的碰撞系数进行了研究,通过求解碰撞方程,获得了在van der Waals力和弹性变形力作用下,直径为100 nm至750 nm的邻苯二甲酸二辛酯纳米颗粒的碰撞系数．发现碰撞系数总体上随着颗粒直径和2个颗粒半径比的增加而减小;当颗粒直径为550 nm时,碰撞系数有一个突然的增加．最后给出了具有不同直径2个纳米颗粒碰撞系数的新表达式．     

多刚体系统的外碰撞动力学方程

本文讨论了两个多刚体系统之间相互碰撞的动力学问题,给出了碰撞冲量和广义速度增量已经解耦的,且适合于计算机程式求解的外碰撞动力学模型,该模型具有实用价值。     

一类双质子弱耦合碰撞系统的对称周期解

考虑一类具有两个自由度的弱耦合对称碰撞方程的对称碰撞周期解的存在性、重性问题.在一类关于时间映射的超线性条件下证明了方程无穷多个对称碰撞调和解和对称碰撞次调和解的存在性.同时,还给出了一个适合两个自由度的对称碰撞方程的对称碰撞周期解存在的充分条件.     

双自由度非定点斜碰撞振动系统的动力学分析

对两个单摆组成的双自由度、非定点、斜碰撞振动系统的动力学行为进行了详细研究．揭示了在双自由度、非定点、斜碰撞过程中恢复系数、摩擦系数、系统参数和碰撞前后系统状态之间的关系．基于Poincaré映射方法和非定点斜碰撞关系推导出该系统单碰周期n次谐运动存在性判据．根据Floquet理论分析了该系统次谐运动周期解的稳定性问题,给出了Floquet特征乘子的计算公式．通过数值仿真证实了该方法的有效性,同时分析了非定点、斜碰撞系统碰撞点位置的概率分布情况．     

连接阻尼对弹性杆纵向碰撞响应的影响

分析了刚度和阻尼并存的一般边界条件下线弹性杆与刚体的纵向碰撞过程,得到了碰撞后第一个波动周期杆振动的位移、速度和应力的解析表达式,讨论了碰撞持续时间为2倍杆长与波速比的条件.将导出的解析表达式通过具体的算例代入计算,讨论了不同质量比、不同连接刚度条件下连接阻尼对于碰撞过程中杆中质点速度及应力响应的影响.研究表明,连接阻尼改变了受碰撞弹性杆的振动模式,连接阻尼影响着碰撞反射波速度和应力的突变幅度;连接阻尼增大,杆中速度和应力响应分布变平缓:在连接刚度较大的情况下,连接阻尼变化对于杆中质点速度和应力影响较大;碰撞持续时间与质量比、连接刚度、连接阻尼及杆长有关,与碰撞的初速度无关;在质量比较大的情况下,连接阻尼使得反射波到达杆碰撞端时,杆端的应力有显著的变化.     

自由飞行环境下的碰撞风险安全评估

针对自由飞行的安全性,对自由飞行环境下的碰撞风险进行研究.首先,通过对飞机在航迹上任意时刻的三维坐标的研究,建立了自由飞行环境下的碰撞风险安全评估模型.然后,在三维坐标系的基础上加入了时间变量,推导出纵向重叠概率计算公式.分析自动相关监视(ADS)对纵向碰撞风险影响,据此建立了自由飞行环境下基于ADS性能的纵向碰撞风险评估模型.最后,通过实例对纵向碰撞风险进行了安全评估计算,计算结果符合实际情况,评估模型是可行的.并在此基础上提出了自由飞行环境下的碰撞风险安全评估的未来研究方向.     

Resource allocation for end-to-end QoS provisioning in a hybrid wireless WCDMA and wireline IP-based DiffServ network

In the future UMTS network, the heterogeneous traffics of multimedia services demand various QoS provisioning. At the same time, the seamlessly conveying of information between mobile users and a hybrid network requires the networking from wireless to wireline domains. However, in both academia and industries, the end-to-end QoS provisioning in the integration of wireline and wireless networks remains a challenge. In this paper, a modeling of a hybrid wireless WCDMA and wireline IP-based DiffServ network is presented to investigate the resource allocation for end-to-end QoS provisioning for multimedia services. In the wireless domain, the mathematical modeling of the cross-layer model including the physical layer, the link layer and the network layer is built. The connection admission control scheme is implemented based on the cross-layer model to determine the amount of resource for different services. In the wireline domain, we define the mapping of QoS classes between UMTS and DiffServ networks according to different QoS requirements. We propose a bandwidth allocation scheme to provide satisfactory packet loss and delay guarantee in DiffServ networks. The final end-to-end admission control scheme combines the resource allocation and admission control in both wireless and wireline domains. The analytical and simulation results show that the proposed resource allocation and admission control schemes work cooperatively in the presented hybrid wireless and wireline networks to guarantee the end-to-end QoS requirements for multimedia services.     

Routing-efficient CDS construction in Disk-Containment Graphs

In wireless networks, Connected Dominating Sets (CDSs) are widely used as virtual backbones for communications. On one hand, reducing the backbone size will reduce the maintenance overhead. So how to minimize the CDS size is a critical issue. On the other hand, when evaluating the performance of a wireless network, the hop distance between two communication nodes, which reflect the energy consumption and response delay, is of great importance. Hence how to minimize the routing cost is also a key problem for constructing the network virtual backbone. In this paper, we study the problem of constructing applicable CDS in wireless networks in terms of size and routing cost. We formulate a wireless network as a Disk-Containment Graph (DCG), which is a generalization of the Unit-Disk Graph (UDG), and we develop an efficient algorithm to construct CDS in such kind of graphs. The algorithm contains two parts and is flexible to balance the performance between the two metrics. We also analyze the algorithm theoretically. It is shown that our algorithm has provable performance in minimizing the CDS size and reducing the communication distance for routing.     

Research on characterization of wireless LANs traffic

In this paper, we employ actual wireless data that draw from well known archives of network traffic traces and investigate the characterization of the wireless LANs traffic. Firstly, useful preliminary information regarding the general wireless traffic dynamics is obtained using one standard statistical technique named Fourier power spectrum. Then the estimation of the parameters, such as the correlation dimension, the largest Lyapunov exponent and the principal components analysis indicate the existence of low-dimensional deterministic chaos in wireless traffic time series. Our results also show that the parameters selection of the phase space reconstruction influence the value of the correlation dimension and the largest Lyapunov exponent, but can not influence on diagnosis of chaotic nature of wireless traffic.     

Topology design for on-demand dual-path routing in wireless networks

One way to achieve reliability with low-latency is through multi-path routing and transport protocols that build redundant delivery channels (or data paths) to reduce end-to-end packet losses and retransmissions. However, the applicability and effectiveness of such protocols are limited by the topological constraints of the underlying communication infrastructure. Multiple data delivery paths can only be constructed over networks that are capable of supporting multiple paths. In mission-critical wireless networks, the underlying network topology is directly affected by the terrain, location and environmental interferences, however the settings of the wireless radios at each node can be properly configured to compensate for these effects for multi-path support. In this work we investigate optimization models for topology designs that enable end-to-end dual-path support on a distributed wireless sensor network. We consider the case of a fixed sensor network with isotropic antennas, where the control variable for topology management is the transmission power on network nodes. For optimization modeling, the network metrics of relevance are coverage, robustness and power utilization. The optimization models proposed in this work eliminate some of the typical assumptions made in the pertinent network design literature that are too strong in this application context.     

An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network

We study the dual power management problem in wireless sensor networks. Given a wireless sensor network with two possible power levels (heigh and low) for each sensor, the problem consists in minimizing the number of sensors assigned heigh power while ensuring the connectivity of the network. We formulate the problem by a binary integer programming model to minimize the total power consumption. Since the problem is NP-complete, we provide an iterative approximation based on iterative methods in combinatorial optimization. We solve the separation subproblem as a minimum spanning tree.     

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks

Journal of Global Optimization - In this paper, we consider the wireless sensor network in which the power of each sensor is adjustable. Given a set of sensors and a set of targets, we study a...     

A Lagrangean-based heuristics for the target covering problem in wireless sensor network

We study the target coverage problem in wireless sensor networks. The problem consists in maximizing the network lifetime by grouping the sensors in disjoint set covers of the targets. A binary integer programing model is formulated to maximize the network lifetime. Since the problem is NP-complete, we provide an iterative approximation based on Lagrangean relaxation and subgradient optimization.     

Wireless network capacity management: A real options approach

This paper applies financial option valuation methods to new wireless network capacity investment decision timing. In particular, we consider the case of network capacity for cellular telephone service. Given a cluster of base stations (with a certain traffic capacity per base station), we determine when it is optimal to increase capacity for each of the base stations contained in the cluster. We express this in terms of the fraction of total cluster capacity in use, i.e. we calculate the optimal time to upgrade in terms of the ratio of observed usage to existing capacity. We study the optimal decision problem of adding new capacity in the presence of stochastic wireless demand for services. A four factor algorithm is developed, based on a real options formulation. Numerical examples are provided to illustrate various aspects of the model.     

ALOHA networks: a game-theoretic approach

In this paper we consider a wireless network consisting of various nodes, where transmissions are regulated by the slotted ALOHA protocol. Nodes using the protocol behave autonomously, and decide at random whether to transmit in a particular time slot. Simultaneous transmissions by multiple nodes cause collisions, rendering the transmissions useless. Nodes can avoid collisions by cooperating, for example by exchanging control messages to coordinate their transmissions. We measure the network performance by the long-term average fraction of time slots in which a successful transmission takes place, and we are interested in how to allocate the performance gains obtained from cooperation among the nodes. To this end we define and analyze a cooperative ALOHA game. We show that this type of game is convex and we consider three solution concepts: the core, the Shapley value, and the compromise value. Furthermore, we develop a set of weighted gain splitting (WGS) allocation rules, and show that this set coincides with the core of the game. These WGS allocation rules can be used to provide an alternative characterization of the Shapley value. Finally, we analyze the sensitivity of the cooperative solution concepts with respect to changes in the wireless network.     

A cooperative differential game model based on transmission rate in wireless networks

Network throughput and energy efficiency are paramount for network performance in an energy-constrained wireless network. However, it is difficult to achieve optimal objectives simultaneously. Therefore, it is necessary to find a rate control solution based on tradeoff between network throughput and energy efficiency. In this paper, we propose a cooperative differential game model and find an optimal rate control of each player to get the total minimal cost with tradeoff between network throughput and energy efficiency of the networks.