基于改进的加权向量机的假币识别算法

支持向量机在处理样本类别不平衡时,对样本数量少的类别,其分类误差大,针对这一问题提出了一种多核心的加权向量机。将纸币的RGB色彩空间转换到YIQ色彩空间,使用直方图对样本进行特征的提取。在特征空间使用边界区间处理分类问题,加入最小化小样本误识率的机制,使用一种改进的加权支持向量机来识别样本。对样本的不同区域使用不同的核函数。实验表明本算法可行、可靠。     

三角形迷宫流道滴灌灌水器结构参数及水力特性研究

以滴灌灌水器三角形迷宫流道结构为研究单元,利用均匀设计方法,结合计算流体动力学软件Fluent6.2对流道内部流体的流动进行了数值模拟,通过多元回归计算,获得流道各结构参数与流量系数和流态指数的量化关系。分析这一量化关系表明,流道转角与流量成负相关,与流态指数成正相关;流道宽与流量成正相关,与流态指数成负相关;齿高与流量成负相关,与流态指数成正相关。同时分析了灌水器内部流道的水力性能和流场特性,为三角形迷宫流道滴灌灌水器的研发提供了相应的理论依据。     

基于区域水资源承载力的山西生态小水电建设

水资源承载力是衡量一个地区发展潜力的主要指标。在对水资源承载能力进行综合动态平衡研究的基础上,建立了区域水资源承载力模型,并将该模型应用于山西生态小水电建设研究。结果表明,①以2015年为规划水平年,山西的水资源能支撑区域容纳0.356亿人按照241m3/人的人均水资源量进行生产生活;②2015年山西共需水85.17亿m3,其中16.84亿m3用于满足工业需水,38.31亿m3用于满足农业需水,24.78亿m3用于满足生活需水,2.39亿m3用于满足生态环境持续与修复的需水;③各产业需水结构上,生活需水增幅最大,达1.47倍,工业需水次之,增幅为60%,生态需水较现状年增加80%;④区域生态小水电建设应以长治市和晋城市为重点,重点做好沁河及浊漳河水资源承载力条件下的生态小水电建设及区域生态水电建设的优化。     

A parametric periodic Lyapunov equation with application in semi-global stabilization of discrete-time periodic systems subject to actuator saturation

This paper is concerned with semi-global stabilization of discrete-time linear periodic systems subject to actuator saturation. Provided that the open loop characteristic multipliers are within the closed unit circle, a low gain feedback design approach is proposed to solve the problem by state feedback. Our approach is based on the solution to a parametric discrete-time periodic Lyapunov equation. The proposed approaches not only generalize the corresponding results for time-invariant systems to periodic systems, but also reveal some important intrinsic properties of this class of periodic matrix equations. A numerical example is worked out to illustrate the effectiveness of the proposed approaches.     

Reachability and stabilization of discrete-time affine systems with disturbances

This paper studies the fundamental problems: whether an affine system affected by additive disturbances is robustly transferable from a source set (simplex) to a target set (polytope) and whether it is robustly stabilizable with its state constrained in a simplex. First, a necessary and sufficient condition is derived for the existence of affine feedback control that solves the robust reachability problem. Further investigation is provided for two situations relying on whether the union of the source set and the target set is convex or non-convex. For the former one, a necessary and sufficient condition is obtained in the form of linear inequalities, while for the latter, several computationally feasible sufficient conditions are found. Second, we show that robust stabilization subject to a state constraint is equivalent to find a feasible solution to a linear equation. Once it is known that either of the problems has a solution by checking the derived conditions, design of control laws is then straightforward.     

Efficient simplex computation for fixture layout design

Fixture, to hold an object by making multiple contacts, is a fundamental tool in manufacturing. A fixture layout is an arrangement of contacts on an object’s surface. Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball centered at the origin. We present three different algorithms to compute such a simplex: a simple randomized algorithm, an interchange algorithm, and a branch-and-bound algorithm. We also present methods to combine different algorithms to improve the performance and highlight their performance on complex 3D models consisting of thousands of triangles. Our randomized algorithm computes a feasible fixture layout in linear time and is well-suited for real-time applications. The interchange algorithm computes an optimal simplex in linear time such that no single vertex can be changed to enlarge the simplex, and it provides a practical method for complex 3D objects. The branch-and-bound algorithm computes the largest simplex by using lower and upper bounds on the radius of the inscribed ball, by which the computation time is reduced by a factor of five in comparison with the brute-force search.     

An algorithm for automatic 2D finite element mesh generation with line constraints

In this study, an algorithm is designed specifically for automatic finite element (FE) mesh generation on the transverse structure of hulls reinforced by stiffeners. Stiffeners attached to the transverse structure are considered as line constraints in the geometry boundary. For the FE mesh generation used in this study, the line constraints are treated as boundaries and by that means the geometry domain attached to the line constraints is decomposed into sub-domains, constrained only by the closed boundaries. Then, the mesh can be generated directly on those sub-domains by the traditional approach. The performance of the proposed algorithm is evaluated and the quality of the generated mesh meets expectations.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

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.