Search

In the present work we address a simple, rapid and quantitative analytical method for detection of different proteins present in biological samples. For this, we proposed the model of titration of double protein (TDP) and its relevant leverage theory relied on the retardation signal of chip moving reaction boundary electrophoresis (MRBE). The leverage principle showed that the product of the first protein content and its absolute retardation signal is equal to that of the second protein content and its absolute one. To manifest the model, we achieved theoretical self-evidence for the demonstration of the leverage principle at first. Then relevant experiments were conducted on the TDP-MRBE chip. The results revealed that (i) there was a leverage principle of retardation signal within the TDP of two pure proteins, and (ii) a lever also existed within these two complex protein samples, evidently demonstrating the validity of TDP model and leverage theory in MRBE chip. It was also showed that the proposed technique could provide a rapid and simple quantitative analysis of two protein samples in a mixture. Finally, we successfully applied the developed technique for the quantification of soymilk in adulterated infant formula. The TDP-MRBE opens up a new window for the detection of adulteration ratio of the poor food (milk) in blended high quality one., (Copyright © 2015 Elsevier B.V. All rights reserved.)

Semi-supervised instance segmentation algorithms are mainly divided into algorithms based on pseudo-label generation and algorithms based on transfer learning. The algorithms based on pseudo-label generation need to design a specific pseudo-label generation process, but the process is not scalable for different types of source tasks. The algorithms based on transfer learning that started late have relatively high scalability, but the algorithm research ideas are relatively simple. To expand the research on semi-supervised instance segmentation based on transfer learning, this paper proposes a feature transfer-based semi-supervised instance segmentation algorithm Feature Transfer Mask R-CNN (FT-Mask). The FT-Mask algorithm is more scalable than algorithms based on pseudo-label generation and can be used to transfer knowledge from different types of source tasks. Compared with other semi-supervised instance segmentation algorithms based on transfer learning, FT-Mask uses the feature transfer method to achieve semi-supervised instance segmentation for the first time. The experimental results show that the FT-Mask model improves the semi-supervised instance segmentation accuracy of the Mask R-CNN benchmark model through the semi-supervised learning process, and can achieve effective transfer learning. [ABSTRACT FROM AUTHOR]

Solving optimal design problems through crowdsourcing faces a dilemma: On the one hand, human beings have been shown to be more effective than algorithms at searching for good solutions of certain real-world problems with high-dimensional or discrete solution spaces; on the other hand, the cost of setting up crowdsourcing environments, the uncertainty in the crowd's domain-specific competence, and the lack of commitment of the crowd contribute to the lack of real-world application of design crowdsourcing. We are thus motivated to investigate a solution-searching mechanism where an optimization algorithm is tuned based on human demonstrations on solution searching, so that the search can be continued after human participants abandon the problem. To do so, we model the iterative search process as a Bayesian optimization (BO) algorithm and propose an inverse BO (IBO) algorithm to find the maximum likelihood estimators (MLEs) of the BO parameters based on human solutions. We show through a vehicle design and control problem that the search performance of BO can be improved by recovering its parameters based on an effective human search. Thus, IBO has the potential to improve the success rate of design crowdsourcing activities, by requiring only good search strategies instead of good solutions from the crowd. [ABSTRACT FROM AUTHOR]

We compare the performance of human players against that of the efficient global optimization (EGO) algorithm for an NP-complete powertrain design and control problem. Specifically, we cast this optimization problem as an online competition and received 2391 game plays by 124 anonymous players during the first month from launch. We found that while only a small portion of human players can outperform the algorithm in the long term, players tend to formulate good heuristics early on that can be used to constrain the solution space. Such constraining of the search enhances algorithm efficiency, even for different game settings. These findings indicate that human-assisted computational searches are promising in solving comprehensible yet computationally hard optimal design and control problems, when human players can outperform the algorithm in a short term. [ABSTRACT FROM AUTHOR]

An adaptive multi-objective optimization artificial immune algorithm (AMOAIA) is presented in this paper. An innovating sorting mechanism based on its Pareto ratio is used to sort individuals in the antibody population. The selection and cloning scheme is improved by using a neighborhood-based fitness assessment. An adaptive clone selection mechanism is introduced to preserve the diversity of the antibody. A new hybrid mutation operator using chaos random series for globally optimization solution has been proposed to maintain the diversity of the antibody population. A multi-objective optimization clustering algorithm based on the distribution of distributed Pareto frontiers is proposed. In addition, the effectiveness of the proposed algorithm is verified under many difficult conditions such as local optimality, non-uniformity, discontinuity, non-convexity, high-dimension, and constraints. The comparative study shows the effectiveness of the proposed algorithm, which produces solution sets that are highly superiority in terms of global convergence, diversity and distribution. [ABSTRACT FROM AUTHOR]