ADS法在深层致密砂岩储层地应力计算中的应用

采用ADS法对塔里木某地区深层致密砂岩储层的地应力进行计算研究。首先在区分砂、泥岩前提下提取纵横波时差转换关系，然后采用声发射（AE）和压裂（HPF）资料标定水平主应力求得水平骨架非平衡因子μg，μg有随着深度增加而减小的趋势，最终获得水平最大和最小主应力计算模型及志留系致密砂岩储层三大主应力连续剖面，地应力满足σv＞σH＞σh的关系，为正常应力系统。最后对地应力、破裂压力、地层压力和坍塌压力对合理钻井液密度窗的影响和计算方法进行了分析，建立了三压力剖面，确定了钻井液安全密度窗。实际采用1.34～1.4 g/cm^3钻井液密度可确保井下正常，与计算的安全窗范围相一致。

利用统计控制图法对水质中铅的不确定度评定研究

目前环境监测领域采用的不确定度的评定方法基本上都是ISO/IEC GUM(JJF 1059)的方法,这种bottom-up方法比较繁琐,容易遗漏重叠分量,一致性也较差。本文使用Top-down不确定度的评定方法 -控制图法对不确定度进行评定,该方法主要是应用实验室的质控数据及能力验证、环境标准样品定值等数据,利用AD统计法和绘制移动极差控制图确保质控数据排列处于随机状态和独立性的特点,建立控制图,评定不确定度的过程。

采用Top-down技术的控制图法评定水质中铅砷的不确定度

来自《测量不确定度表述导则》(GUM95)中的模型,是国际上第一个取得一致认同的模型,也一直被作为我国环境监测实验室不确定度评定的经典方法。但是GUM方法采用的是bottom-up技术来进行不确定度评定,其步骤繁琐,容易造成遗漏或重复,且无法反映实验室长期质控状态。本文采用Top-down不确定度的评定方法一控制图法来评定本实验室质控样铅砷的不确定度,数据主要来自实验室内质控,通过AD统计法和绘制移动极差控制图,判断数据是否具有正态性和独立性,计算获得砷铅的不确定度。Top-down方法将测量不确定度评定与实验室质控工作紧密相连,对于环境监测领域不确定度的评定,它比GUM法更实用。

Detection of Selfish Behavior in Wireless Ad Hoc Networks Based on CUSUM Algorithm

The cumulative sum （CUSUM） algorithm is proposed to detect the selfish behavior of a node in a wireless ad hoc network. By tracing the statistics characteristic of the backoff time between successful transmissions, a wireless node can distinguish if there is a selfish behavior in the wireless network. The detection efficiency is validated using a Qualnet simulator. An IEEE 802.11 wireless ad hoc network with 20 senders and 20 receivers spreading out randomly in a given area is evaluated. The well-behaved senders use minimum contention window size of 32 and maximum con- tention window size of I 024, and the selfish nodes are assumed not to use the binary exponential strategy for which the contention window sizes are both fixed as 16. The transmission radius of all nodes is 250 m. Two scenarios are investigated： a single-hop network with nodes spreading out in 100 m^100 m, and all the nodes are in the range of each other; and a multi-hop network with nodes spreading out in 1 000 m~ 1 000 m. The node can monitor the backoff time from all the other nodes and run the detection algorithms over those samples. It is noted that the threshold can significantly affect the detection time and the detection accuracy. For a given threshold of 0.3 s, the false alarm rates and the missed alarm rates are less than 5%. The detection delay is less than 1.0 s. The simulation results show that the algorithm has short detection time and high detection accuracy.

Design and analysis of a network coding algorithm for ad hoc networks

Network coding is proved to have advantages in both wireline and wireless networks. Especially, appropriate network coding schemes are programmed for underlined networks. Considering the feature of strong node mobility in aviation communication networks, a hop-by-hop network coding algorithm based on ad hoc networks was proposed. Compared with COPE-like network coding algorithms, the proposed algorithm does not require overhearing from other nodes, which meets confidentiality requirements of aviation communication networks. Meanwhile, it does save resource consumption and promise less processing delay. To analyze the performance of the network coding algorithm in scalable networks with different traffic models, a typical network was built in a network simulator, through which receiving accuracy rate and receiving delay were both examined.The simulation results indicate that, by virtue of network coding, the proposed algorithm works well and improves performance significantly. More specifically, it has better performance in enhancing receiving accuracy rate and reducing receiving delay, as compared with any of the traditional networks without coding. It was applied to both symmetric and asymmetric traffic flows and, in particular, it achieves much better performance when the network scale becomes larger. Therefore, this algorithm has great potentials in large-scale multi-hop aviation communication networks.

Clustering in mobile ad hoc network based on neural network

An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

A contention-based efficient-information perception algorithm (CEiPA) for vehicular ad hoc networks

The problem of information dissemination is researched for vehicular ad-hoc networks （VANET） in this paper, and a contention-based effficient-information perception algorithm （CEiPA） is proposed. The idea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information. CEiPA consists of two phases. The first one is initialization phase, during which the count timers Tcyce and Tlocal are set to start beacon delivery while Tcycle is also used to monitor and restart beaconing. The second one is beacon delivery phase. An elaborate distance function is employed to set contention delay for beacons of each vehicle. In this way beacons will be sent in order, which decreases the collision of beacons. Simulation results show that CEiPA enables each beacon to carry more efficient information and spread them over more vehicles with lower network overhead than the periodic beacon scheme. CEiPA is also flexible and scalable because the efficient information threshold it employs is a balance among the freshness of information, network overhead and perception area of a vehicle.

Quantitative and qualitative correlation analysis of optimal route discovery for vehicular ad-hoc networks

Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.

On service differentiation in mobile Ad Hoc networks

A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

A Layered Zone Routing Algorithm in Ad Hoc Network Based on Matrix of Adjacency Connection

The hybrid routing protocol has received more attention recently than the proactive and the reactive, especially for large-scale and highly dynamic connection,in mobile ad hoc network. A crucial reason is that zone-layered is being utilized in the complex systems.A hybrid routing algorithm which is layered zone based on adjacency connection(LZBAC) is put forward under the background of a few members in network with steady position and link. The algorithm modifies storage structure of nodes and improves routing mechanism. The theoretical analysis and simulation testing testify that the algorithm costs shorter time of route finding and less delay than others.

Survivability modeling and analysis on 3D mobile ad-hoc networks

Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.

Dependent task assignment algorithm based on particle swarm optimization and simulated annealing in ad-hoc mobile cloud

In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.

Routing Protocol Based on Grover’s Searching Algorithm for Mobile Ad-hoc Networks

In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.

气浮沉积技术

气浮沉积法简称AD法,是一种新近开发的表面涂层制备方法,属于热喷涂技术范畴。AD法由低真空沉积室,喷咀,粉末雾化室,机械真空泵等组成。AD法具有沉积温度低(室温),沉积率高,涂层密度高,结合强度高等优点。AD法的一个突出的应用就是制备铁电薄膜陶瓷涂层,如PZT(Pb(Zr,Ti)O3)。AD法制备的PZT涂层成分均匀,且由于沉积中的液相烧结机理而致密化。退火处理可以很好地提高PZT涂层的铁电特性。载流气体种类对PZT涂层的结合强度没有明显影响。

行星大气中光的多次散射的计算

本文简单介绍一维平面平行大气多次散射辐射传输方程的一些解法,包括在chandrasekhar(1960)的基础上建立起来的经典的解析解,以及一些标准的数值解法和近似解法。并详细地讨论一种精确的数值解法,即adding/doubling method的一些数值问题、诸如adding/doubling方程,初始层的计算,Fourier级数展开,相函数的计算,以及非均匀大气的处理等。又给出了应用复角动量理论和doubling method求解卷云层中一些VAS红外通道的透射函数随云中光学厚度变化的特征,及其在卫星遥感中潜在的应用。

An effective connected dominating set based mobility management algorithm in MANETs

This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.

DBLAR:A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET

In location-aided routing of Mobile Ad hoc NETworks(MANET),nodes mobility and the inaccuracy of location information may result in constant flooding,which will reduce the network performance.In this paper,a Distance-Based Location-Aided Routing(DBLAR) for MANET has been proposed.By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically,the proposed routing algorithm can avoid flooding in the whole networks.Besides,Distance Update Threshold(DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes,meanwhile,the detection of relative distance vector can achieve the goal of adjusting forwarding condition.Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio,average end-to-end delay and routing-load,and the set of DUT and relative distance vector has a significant impact on this algorithm.