黑龙江黑河市小麦和大豆的灌溉计划

以黑河市典型农作物大豆和小麦为研究对象,利用气象数据和相关研究成果,计算了黑河地区大豆和小麦的需水规律和需水量,并和降水分布和有效降水量进行对比。研究发现在小麦生长阶段内,小麦需水量和降水量基本同步,但是6月-7月份亏水量约72 mm。在大豆整个生育期内,各月有效降水量均不能满足大豆的需水量,6月份缺水量最大为88 mm,生育期内共缺水量182 mm。考虑到当地矮杆作物灌水技术一般采用喷灌,建议灌水定额采用40 mm,小麦需在6月份喷灌一次,大豆在整个生育期内喷灌4~5次,以实现小麦和大豆的高产稳产。     

南水北调中线小南河串流片防洪水位计算

传统的多河流串流计算主要采用水库联调的方法,把串流的各条河流概化为静态水库,库水位水平且不考虑横向流动。为解决串流区水流的横向流动及水面线并不总像库水位一样水平的问题,采用二维非恒定流数学模型计算串流区洪水演进。通过概化地形、考虑入流、糙率、边界条件和水流的横向流动等因素,计算出了整个串流区域的水面线、水深、流速、出流等水力要素,并给出洪水演进模拟图,为确定河流与总干渠交叉建筑物的规模、总干渠左岸沿线水面线和对沿线村庄、农田的防洪影响提供了可靠的依据。     

A method for stochastic multiple criteria decision making based on dominance degrees

This paper proposes a method for solving the stochastic multiple criteria decision making (SMCDM) problem, where consequences of alternatives with respect to criteria are represented by random variables with probability distributions. Firstly, definitions and related analysis of dominance degree of one probability distribution over another are given. Then, by calculating the dominance degrees, the dominance degree matrix of alternative pairwise comparisons with respect to each criterion is built. Further, using PROMETHEE II method, an overall dominance degree matrix of alternative pairwise comparisons is constructed, and a net flow of each alternative is calculated. Based on the obtained net flows, a ranking of alternatives is determined. Finally, numerical examples for the three cases are given to illustrate the use of the proposed method.     

Univariate marginal distribution algorithm dynamics for a class of parametric functions with unitation constraints

In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints.     

Application of fuzzy sets to manufacturing/distribution planning decisions in supply chains

In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments.     

Object-based analysis and change detection of major wetland cover types and their classification uncertainty during the low water period at Poyang Lake, China

Productive wetland systems at land-water interfaces that provide unique ecosystem services are challenging to study because of water dynamics, complex surface cover and constrained field access. We applied object-based image analysis and supervised classification to four 32-m Beijing-1 microsatellite images to examine broad-scale surface cover composition and its change during November 2007-March 2008 low water season at Poyang Lake, the largest freshwater lake-wetland system in China (> 4000 km²). We proposed a novel method for semi-automated selection of training objects in this heterogeneous landscape using extreme values of spectral indices (SIs) estimated from satellite data. Dynamics of the major wetland cover types (Water, Mudflat, Vegetation and Sand) were investigated both as transitions among primary classes based on maximum membership value, and as changes in memberships to all classes even under no change in a primary class. Fuzzy classification accuracy was evaluated as match frequencies between classification outcome and a) the best reference candidate class (MAX function) and b) any acceptable reference class (RIGHT function). MAX-based accuracy was relatively high for Vegetation (≥ 90%), Water (≥ 82%), Mudflat (≥ 76%) and the smallest-area Sand (≥ 75%) in all scenes; these scores improved with the RIGHT function to 87-100%. Classification uncertainty assessed as the proportion of fuzzy object area within a class at a given fuzzy threshold value was the highest for all classes in November 2007, and consistently higher for Mudflat than for other classes in all scenes. Vegetation was the dominant class in all scenes, occupying 41.2-49.3% of the study area. Object memberships to Vegetation mostly declined from November 2007 to February 2008 and increased substantially only in February-March 2008, possibly reflecting growing season conditions and grazing. Spatial extent of Water both declined and increased during the study period, reflecting precipitation and hydrological events. The “fuzziest” Mudflat class was involved in major detected transitions among classes and declined in classification accuracy by March 2008, representing a key target for finer-scale research. Future work should introduce Vegetation sub-classes reflecting differences in phenology and alternative methods to discriminate Mudflat from other classes. Results can be used to guide field sampling and top-down landscape analyses in this wetland.     

New statistical methods for investigating submarine pockmarks

We investigate the applicability of some novel spatial analysis techniques, developed for studies of astrophysical datasets, to the analysis of spatial point data in sedimentary basins. The techniques are evaluated and compared with standard methods using two test areas that contain large numbers of submarine pockmarks developed in distributed arrays. The familiar Ripley K and Voronoi tesselation techniques are used, and the results are then compared with those obtained using more novel techniques, the correlation length and minimal spanning tree. The correlation length technique is found to identify the precise distances at which clustering occurs more accurately, making a physical interpretation more clear than is possible using the Ripley K. The minimal spanning tree is found to be powerful at identifying the space-filling nature of the pockmark distribution, and has the advantage of being immune to edge effects. The use of these two novel techniques permits more information to be extracted from the datasets, and demonstrates clear statistically significant differences between them, which are not detectable using standard techniques.     

QoS-based cooperative algorithm for integral multi-commodity flow problem

This paper treats with integral multi-commodity flow through a network. To enhance the Quality of Service (QoS) for channels, it is necessary to minimize delay and congestion. Decreasing the end-to-end delay and consumption of bandwidth across channels are dependent and may be considered in very complex mathematical equations. To capture with this problem, a multi-commodity flow model is introduced whose targets are minimizing delay and congestion in one model. The flow through the network such as packets, also needs to get integral values. A model covering these concepts, is NP-hard while it is very important to find transmission strategies in real-time. For this aim, we extend a cooperative algorithm including traditional mathematical programming such as path enumeration and a meta-heuristic algorithm such as genetic algorithm. To find integral solution satisfying demands of nodes, we generalize a hybrid genetic algorithm to assign the integral commodities where they are needed. In this hybrid algorithm, we use feasible encoding and try to keep feasibility of chromosomes over iterations. By considering some random networks, we show that the proposed algorithm yields reasonable results in a few number of iterations. Also, because this algorithm can be applied in a wide range of objective functions in terms of delay and congestion, it is possible to find some routs for each commodity with high QoS. Due to these outcomes, the presented model and algorithm can be utilized in a variety of application in computer networks and transportation systems to decrease the congestion and increase the usage of channels.     

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience and storage. Further, even though conventional public key and elliptic curve cryptosystems are computationally feasible on sensor nodes, protocols based on them are not, as they require the exchange and storage of large keys and certificates, which is expensive.Using Pairing-Based Cryptography (PBC) protocols parties can agree on keys without any interaction. In this work, we (i) show how security in WSNs can be bootstrapped using an authenticated identity-based non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for 8, 16 and 32-bit processors commonly found in sensor nodes. TinyPBC is able to compute pairings, the most expensive primitive of PBC, in 1.90 s on ATmega128L, 1.27 s on MSP430 and 0.14 s on PXA27x.