1,361 research outputs found

    A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem

    Full text link
    The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms are able to find solutions as good as approximation algorithms do. This paper presents a novel multi-objective optimisation genetic algorithm for solving the 0-1 knapsack problem. Experiment results show that the new algorithm outperforms its rivals, the greedy algorithm, mixed strategy genetic algorithm, and greedy algorithm + mixed strategy genetic algorithm

    Quantifying Losses in Open-Circuit Voltage in Solution-Processable Solar Cells

    Get PDF
    The maximum open-circuit voltage of a solar cell can be evaluated in terms of its ability to emit light. We herein verify the reciprocity relation between the electroluminescence spectrum and subband-gap quantum efficiency spectrum for several photovoltaic technologies at different stages of commercial development, including inorganic, organic, and a type of methyl-ammonium lead- halide CH3NH3PbI3−xClx perovskite solar cells. Based on the detailed balance theory and reciprocity relations between light emission and light absorption, voltage losses at open circuit are quantified and assigned to specific mechanisms, namely, absorption edge broadening and nonradiative recombination. The voltage loss due to nonradiative recombination is low for inorganic solar cells (0.04–0.21 V), while for organic solar cell devices it is larger but surprisingly uniform, with values of 0.34–0.44 V for a range of material combinations. We show that, in CH3NH3PbI3−xClx perovskite solar cells that exhibit hysteresis, the loss to nonradiative recombination varies substantially with voltage scan conditions. We then show that for different solar cell technologies there is a roughly linear relation between the power conversion efficiency and the voltage loss due to nonradiative recombination

    Mixed strategy may outperform pure strategy: An initial study

    Get PDF
    In pure strategy meta-heuristics, only one search strategy is applied for all time. In mixed strategy meta-heuristics, each time one search strategy is chosen from a strategy pool with a probability and then is applied. An example is classical genetic algorithms, where either a mutation or crossover operator is chosen with a probability each time. The aim of this paper is to compare the performance between mixed strategy and pure strategy meta-heuristic algorithms. First an experimental study is implemented and results demonstrate that mixed strategy evolutionary algorithms may outperform pure strategy evolutionary algorithms on the 0-1 knapsack problem in up to 77.8% instances. Then Complementary Strategy Theorem is rigorously proven for applying mixed strategy at the population level. The theorem asserts that given two meta-heuristic algorithms where one uses pure strategy 1 and another uses pure strategy 2, the condition of pure strategy 2 being complementary to pure strategy 1 is sufficient and necessary if there exists a mixed strategy meta-heuristics derived from these two pure strategies and its expected number of generations to find an optimal solution is no more than that of using pure strategy 1 for any initial population, and less than that of using pure strategy 1 for some initial population

    A novel trifunctional IgG-like bispecific antibody to inhibit HIV-1 infection and enhance lysis of HIV by targeting activation of complement

    Get PDF
    BACKGROUND: The complement system is not only a key component of innate immunity but also provides a first line of defense against invading pathogens, especially for viral pathogens. Human immunodeficiency virus (HIV), however, possesses several mechanisms to evade complement-mediated lysis (CoML) and exploit the complement system to enhance viral infectivity. Responsible for this intrinsic resistance against complement-mediated virolysis are complement regulatory membrane proteins derived from the host cell that inherently downregulates complement activation at several stages of the cascade. In addition, HIV is protected from complement-mediated lysis by binding soluble factor H (fH) through the viral envelope proteins, gp120 and gp41. Whereas inhibition of complement activity is the desired outcome in the vast majority of therapeutic approaches, there is a broader potential for complement-mediated inhibition of HIV by complement local stimulation. PRESENTATION OF THE HYPOTHESIS: Our previous studies have proven that the complement-mediated antibody-dependent enhancement of HIV infection is mediated by the association of complement receptor type 2 bound to the C3 fragment and deposited on the surface of HIV virions. Thus, we hypothesize that another new activator of complement, consisting of two dsFv (against gp120 and against C3d respectively) linked to a complement-activating human IgG1 Fc domain ((anti-gp120 × anti-C3d)-Fc), can not only target and amplify complement activation on HIV virions for enhancing the efficiency of HIV lysis, but also reduce the infectivity of HIV through blocking the gp120 and C3d on the surface of HIV. TESTING THE HYPOTHESIS: Our hypothesis was tested using cell-free HIV-1 virions cultivated in vitro and assessment of virus opsonization was performed by incubating appropriate dilutions of virus with medium containing normal human serum and purified (anti-gp120 × anti-C3d)-Fc proteins. As a control group, viruses were incubated with normal human serum under the same conditions. Virus neutralization assays were used to estimate the degree of (anti-gp120 × anti-C3d)-Fc lysis of HIV compared to untreated virus. IMPLICATIONS OF THE HYPOTHESIS: The targeted complement activator, (anti-gp120 × anti-C3d)-Fc, can be used as a novel approach to HIV therapy by abrogating the complement-enhanced HIV infection of cells

    Brzo otkrivanje uzročnika virusnog proljeva goveda u mlijeku iz spremnika pomoću kombinacije metoda umnožene rekombinazne polimeraze i test-traka za „lateral flow“ analizu

    Get PDF
    Bovine viral diarrhea virus (BVDV) is one of the most prevalent and economically important pathogens of ruminants, and leads to significant financial losses to the livestock industry worldwide. Development of rapid and accurate diagnostic methods is of great importance for the control and eradication of BVDV infection. The aim of this study was to develop a novel isothermal recombinase polymerase amplification (RPA) method combined with a lateral flow dipstick (LFD), for rapid detection of BVDV. RPA primers and a probe targeting the specific conserved 5′-UTR of BVDV genome were designed. The RPA amplification could be finished at a constant temperature of 38 0000C for 15 min, and the amplification product was easily visualized on a simple LFD within 5 min. The detection limit of this assay was 20 copies per reaction, and there was no cross-reactivity with other bovine infectious viruses, such as infectious bovine rhinotracheitis virus (IBRV), bovine enterovirus (BEV), bovine coronavirus (BcoV), bovine parainfluenza virus type 3 (BPIV-3), bovine ephemeral fever virus (BEFV) and bovine respiratory syncytial virus (BRSV). The assay performance on bulk tank milk was also evaluated, and the sensitivity and accuracy of BVDV LFD RPA was compared with real-time RT-PCR. Of 284 pool or bulk tank milk samples, 51 were found to be positive by RPA assay, whereas 52 were positive by real-time RT-PCR. The coincidence rate between LFD RPA and real-time RT-PCR was 97.54% (277/284).Uzročnik virusnog proljeva goveda (BVDV) jedan je od najčešćih i ekonomski važnih patogena preživača koji uzrokuje znatne financijske gubitke u stočarskoj industriji širom svijeta. Razvoj brzih i točnih dijagnostičkih metoda iznimno je važan za kontrolu i iskorjenjivanje zaraze BVDV-om. Cilj ovog istraživanja bio je razviti novu metodu za brzo otkrivanje BVDV-a baziranu na kombinaciji metoda umnožene rekombinazne polimeraze i test-traka za „lateral flow“ analizu. Oblikovane su početnice i probe za umnažanje rekombinazne polimeraze usmjerene na specifični konzervirani 5’-UTR u genomu BVDV-a. Umnažanje se moglo završiti pri konstantnoj temperaturi od 38 °C tijekom 15 minuta i produkt umnažanja je lako vizualiziran na jednostavnoj test-traci za „lateral flow“ analizu unutar 5 minuta. Test je ograničen na 20 kopija po reakciji, pri čemu nije bilo križne reaktivnosti s drugim goveđim zaraznim virusima kao što su infektivni rinotraheitis virusa goveda (IBRV), goveđi enterovirus (BEV), goveđi koronavirus (BcoV), virus goveđe parainfluence tipa 3 (BPIV-3), virus gljivične ephemeralne groznice (BEFV) i goveđi respiratorni sincicijski virus (BRSV). Učinkovitost kombinacije navedenih metoda istražena je i s obzirom na usporedbu osjetljivosti odnosno točnosti koja se dobiva uporabom RT-PCR metode. Od 284 skupna uzorka mlijeka iz spremnika, kombinacijom metoda umnožene rekombinazne polimeraze i test-traka za „lateral flow“ analizu utvrđen je 51 pozitivan uzorak, a RT-PCR 52 pozitivna uzorka. Stopa podudarnosti između navedenih metoda bila je 97,54 % (277/284)

    Placing Timely Refreshing Services at the Network Edge

    Full text link
    Accommodating services at the network edge is favorable for time-sensitive applications. However, maintaining service usability is resource-consuming in terms of pulling service images to the edge, synchronizing databases of service containers, and hot updates of service modules. Accordingly, it is critical to determine which service to place based on the received user requests and service refreshing (maintaining) cost, which is usually neglected in existing studies. In this work, we study how to cooperatively place timely refreshing services and offload user requests among edge servers to minimize the backhaul transmission costs. We formulate an integer non-linear programming problem and prove its NP-hardness. This problem is highly non-tractable due to the complex spatial-and-temporal coupling effect among service placement, offloading, and refreshing costs. We first decouple the problem in the temporal domain by transforming it into a Markov shortest-path problem. We then propose a light-weighted Discounted Value Approximation (DVA) method, which further decouples the problem in the spatial domain by estimating the offloading costs among edge servers. The worst performance of DVA is proved to be bounded. 5G service placement testbed experiments and real-trace simulations show that DVA reduces the total transmission cost by up to 59.1% compared with the state-of-the-art baselines
    corecore