滇南兰坪南厂铅锌矿矿床成因及成矿作用

南厂铅锌矿位于兰坪—思茅中生代坳陷北端，构造格局复杂，成矿条件优越。通过对矿床进行野外地质调查，对成矿地质背景、矿床地质特征、成矿机制和矿床成因进行了分析，发现南厂铅锌矿体主要呈透镜状赋存于第三系云龙组（Eyb）及下白垩统景星组（K1j1）地层中，与围岩接触部位发育微弱褪色蚀变，云龙组下段（Eya）是矿体底板有效的“屏蔽层”；区内发育原生砂岩型矿石、灰岩型矿石和氧化矿石，沉积构造特征明显，局部具有热液、变质作用改造特征；矿区地层、构造是矿床形成的重要因素，断裂构造是主要的容矿、导矿构造，高盐度热卤水沿导矿构造循环至有利层位、构造部位富集成矿，综合分析认为南厂矿床属热卤水为主的多成因层控型铅锌矿床。     

Genetic algorithm to simultaneously optimise stope sequencing and equipment dispatching in underground short-term mine planning under time uncertainty

ABSTRACT

The main issue in short-term planning optimisation for underground mining is organising the mining process with limited resources in the form of equipment and materials to satisfy production targets and stable feed grade requirements. In this paper, an integrated optimisation model is proposed based on an individual generation algorithm and an improved Genetic Algorithm to simultaneously optimise stope extraction sequencing and timing, extracted ore grade and equipment dispatching. The model objectives are to shorten the time gap between the stope mining processes and the overall working time. When the uncertainty of equipment working time is taken into account in a short-term scheduling model, the Monte Carlo simulation is applied to evaluate the risk of not meeting the production target. A modification strategy is defined to evaluate equipment failure. Consequently, any available equipment is automatically reassigned to the mining site to replace the broken-down equipment. A case study is used to validate the model in the Sanshandao gold mine of China to formulate an optimal monthly schedule. Compared with the conventional approach, the new model could reduce the variance of ore tonnage and feed grade and improve the equipment allocation efficiency. Discussions are presented to address the uncertainty.     

Model-Based Design Space Exploration for FPGA-based Image Processing Applications Employing Parameterizable Approximations

The increasing demand for low power consumption and high computational performance is outpacing available technological improvements in embedded systems. Approximate computing is a novel design paradigm trying to bridge this gap by leveraging the inherent error resilience of certain applications and trading in quality to achieve reductions in resource usage. Numerous approximation methods have emerged in this research field. While these methods are commonly demonstrated in isolation, their combination can increase the achieved benefits in complex systems. However, the propagation of errors throughout the system necessitates a global optimization of parameters, leading to an exponentially growing design space. Additionally, the parameterization of approximated components must consider potential cross-dependencies between them. This work proposes a systematic approach to integrate and optimally configure parameterizable approximate components in FPGA-based applications, focusing on low-level but high-bandwidth image processing pipelines. The design space is explored by a multi-objective genetic algorithm which takes parameter dependencies between different components into account. During the exploration, appropriate models are used to estimate the quality-resource trade-off for probed solutions without the need for time-consuming synthesis. We demonstrate and evaluate the effectiveness of our approach on two image processing applications that employ multiple approximations. The experimental results show that the proposed methods are able to produce a wide range of Pareto-optimal solutions, offering various choices regarding the desired quality-resource trade-off.     

A fast genetic algorithm for a critical protection problem in biomedical supply chain networks

In this paper, we present a new bilevel model for a biomedical supply chain network with capacity and budget constraint due to the protection and interdiction operations. The components considered in this model are biomedical devices, distribution centers (DCs), medical suppliers (MSs), and hospitals and patients as the demand points. On the other hand, two levels of decisions in the network planning is suggested: (1) the defender’s decision about protection operations of MSs and DCs, the assignment of clients to the DCs, and quantity of products shipped to DCs from MSs to minimize the demand-weighted traveling costs and transport costs and (2) the attacker’s decision about interdiction operations of MSs and DCs to maximize the capacity or service reduction and losses. Because of nondeterministic polynomial time (NP)-hardness of the problem under consideration, an efficient and fast approach based on a genetic algorithm and a fast branch and cut method (GA–FBC) was developed to solve the proposed model. Also, the efficiency via the comparison of results with the genetic algorithm based on CPLEX (GA-CPLEX) and decomposition method (DM) is investigated. In order to assess the performance of the presented GA–FBC, a set of 27 instances of the problem is used. Comprehensive analysis indicates that the proposed approach significantly solves the problem. In addition, the benefits and advantages of preference with running times and its accuracy is shown numerically. Simulation results clearly demonstrate that the defender’s objective effectively reduced and CPU time also within the large-sized instances of the problem in comparison with the GA-CPLEX and DM.     

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers.     

基于遗传萤火虫算法的含风电电力系统机组组合研究

随着风能资源的广泛应用,机组组合问题求解愈显复杂。以减少煤耗费用提高系统经济性为目标,提出一种采用遗传萤火虫算法求解含风电电力系统机组组合问题的新方法。引入遗传算法双矩阵通路判断及约束修复策略,提高了初始解生成质量及产生速度;再利用萤火虫算法求解连续负荷经济优化分配,给出自适应交叉概率,从而提高了算法的收敛速度。应用所提算法对经典10机系统优化仿真表明,与其他算法相比,该方法能合理安排机组组合,提高系统供电的经济性,具有较好的实用价值。     

Significant population genetic structuring in Rhyzopertha dominica across Turkey: Biogeographic and practical implications

Rhyzopertha dominica is a key pest of stored grain. Understanding the movement of this beetle on broad geographic scales is crucial, particularly when developing strategies to prevent the spread of phosphine resistance. We assessed population genetic structuring in this pest across Turkey, using a combination of mitochondrial (cytochrome oxidase I) and microsatellite markers. In addition, we screened samples for Wolbachia, as this endosymbiont has previously been suggested to be associated with low mitochondrial genetic diversity in this beetle. Mitochondrial genetic diversity was low, with only six haplotypes identified. The genetic diversity was, however, substantially higher than that previously found in Australia or India, suggesting that R. dominica may have originated in the Middle East. Wolbachia were detected only at a single site, indicating they are not impacting the mitochondrial genetic diversity of R. dominica across Turkey. Microsatellite markers indicated there is significant geographic genetic structuring across Turkey, even among sites less than 100 km apart, suggesting there is little movement of beetles across regions within the country. This contrasts with the significantly higher levels of gene-flow found in Australia and the United States. We suggest that the limited movement of beetles across Turkey may be due to a combination of the historically localised agricultural practices (which limits anthropogenic movement among regions), and the mountainous landscape (which limits active flight among regions). Our results demonstrate that the movement of stored product pests may differ significantly across studies conducted in different countries. As a consequence, phosphine resistance management strategies must incorporate region specific information on the extent of beetle movement.     

Electron transfer mediator PCN secreted by aerobic marine Pseudomonas aeruginosa accelerates microbiologically influenced corrosion of TC4 titanium alloy

Titanium alloys possess excellent corrosion resistance in marine environments,thus the possibility of their corrosion caused by marine microorganisms is neglected.In this work,microbiologically influenced corrosion (MIC) of TC4 titanium alloy caused by marine Pseudomonas aeruginosa was investigated through electrochemical and surface characterizations during a 14-day immersion test.Results revealed that the unstable surface caused by P.aeruginosa resulted in exposure of Ti2O3 and severe pitting corrosion with maximum pit depth of 5.7 μm after 14 days of incubation.Phenazine-1-carboxy[ate (PCN),secreted by P.aeruginosa,promoted extracellular electron transfer (EET) and accelerated corrosion.Deletion of the phzH gene,which codes for the enzyme that catalyzes PCN production,from the P.aeruginosa genome,resulted in significantly decreased rates of corrosion.These results demonstrate that TC4 titanium alloy is not immune to marine MIC,and EET contributes to the corrosion of TC4 titanium alloy caused by P.aeruginosa.     

Disassembly sequence planning using a Flatworm algorithm

Disassembly Sequence Planning (DSP) refers to a disassembly sequence based on the disassembly properties and restrictions of the product parts that meets the benefit goal. This study aims to reduce the number of changes in disassembly direction and disassembly tools so as to reduce the disassembly time. This study proposes a novel Flatworm algorithm that evolves through the regenerative properties of the flatworm. It is similar to the evolutionary concept of genetic algorithms, with evolution as the main idea, but without crossover, mutation or replication mechanisms in the evolutionary processes. Instead, it is based upon the characteristics of the growth, fracture and regeneration mechanisms of the flatworm. The Flatworm algorithm features a variety of disassembly combinations and excellent mechanisms to avoid the local optimal solution. In particular, it has the advantage of keeping a good disassembly combination from being destroyed. In this study, it is compared with two genetic algorithms and two ant colony algorithms and tested in three examples of different complexity: a ceiling fan, a printer, and 150 simulated parts. The solution searching ability and execution time are compared upon the same evaluation standard. The test results demonstrate that the novel Flatworm algorithm proposed in this study is superior to the two genetic algorithms and ant colony algorithms in solution quality.