Self-assembled peptide hydrogels represent the realization of peptide nanotechnology into biomedical products. There is a continuous quest to identify the simplest building blocks and optimize their critical gelation concentration (CGC). Herein, a minimalistic, de novo dipeptide, Fmoc-Lys(Fmoc)-Asp, as an hydrogelator with the lowest CGC ever reported, almost fourfold lower as compared to that of a large hexadecapeptide previously described, is reported. The dipeptide self-assembles through an unusual and unprecedented two-step process as elucidated by solid-state NMR and molecular dynamics simulation. The hydrogel is cytocompatible and supports 2D/3D cell growth. Conductive composite gels composed of Fmoc-Lys(Fmoc)-Asp and a conductive polymer exhibit excellent DNA binding. Fmoc-Lys(Fmoc)-Asp exhibits the lowest CGC and highest mechanical properties when compared to a library of dipeptide analogues, thus validating the uniqueness of the molecular design which confers useful properties for various potential applications. 相似文献
In classical deterministic scheduling problems, it is assumed that all jobs have to be processed. However, in many practical cases, mostly in highly loaded make-to-order production systems, accepting all jobs may cause a delay in the completion of orders which in turn may lead to high inventory and tardiness costs. Thus, in such systems, the firm may wish to reject the processing of some jobs by either outsourcing them or rejecting them altogether. The field of scheduling with rejection provides schemes for coordinated sales and production decisions by grouping them into a single model. Since scheduling problems with rejection are very interesting both from a practical and a theoretical point of view, they have received a great deal of attention from researchers over the last decade. The purpose of this survey is to offer a unified framework for offline scheduling with rejection by presenting an up-to-date survey of the results in this field. Moreover, we highlight the close connection between scheduling with rejection and other fields of research such as scheduling with controllable processing times and scheduling with due date assignment, and include some new results which we obtained for open problems. 相似文献
Face datasets are considered a primary tool for evaluating the efficacy of face recognition methods. Here we show that in
many of the commonly used face datasets, face images can be recognized accurately at a rate significantly higher than random
even when no face, hair or clothes features appear in the image. The experiments were done by cutting a small background area
from each face image, so that each face dataset provided a new image dataset which included only seemingly blank images. Then,
an image classification method was used in order to check the classification accuracy. Experimental results show that the
classification accuracy ranged between 13.5% (color FERET) to 99% (YaleB). These results indicate that the performance of
face recognition methods measured using face image datasets may be biased. Compilable source code used for this experiment
is freely available for download via the Internet. 相似文献
The algorithm selection problem is defined as identifying the best-performing machine learning (ML) algorithm for a given combination of dataset, task, and evaluation measure. The human expertise required to evaluate the increasing number of ML algorithms available has resulted in the need to automate the algorithm selection task. Various approaches have emerged to handle the automatic algorithm selection challenge, including meta-learning. Meta-learning is a popular approach that leverages accumulated experience for future learning and typically involves dataset characterization. Existing meta-learning methods often represent a dataset using predefined features and thus cannot be generalized across different ML tasks, or alternatively, learn a dataset’s representation in a supervised manner and therefore are unable to deal with unsupervised tasks. In this study, we propose a novel learning-based task-agnostic method for producing dataset representations. Then, we introduce TRIO, a meta-learning approach, that utilizes the proposed dataset representations to accurately recommend top-performing algorithms for previously unseen datasets. TRIO first learns graphical representations for the datasets, using four tools to learn the latent interactions among dataset instances and then utilizes a graph convolutional neural network technique to extract embedding representations from the graphs obtained. We extensively evaluate the effectiveness of our approach on 337 datasets and 195 ML algorithms, demonstrating that TRIO significantly outperforms state-of-the-art methods for algorithm selection for both supervised (classification and regression) and unsupervised (clustering) tasks.
We present a new concept—Wikiometrics—the derivation of metrics and indicators from Wikipedia. Wikipedia provides an accurate representation of the real world due to its size, structure, editing policy and popularity. We demonstrate an innovative “mining” methodology, where different elements of Wikipedia – content, structure, editorial actions and reader reviews – are used to rank items in a manner which is by no means inferior to rankings produced by experts or other methods. We test our proposed method by applying it to two real-world ranking problems: top world universities and academic journals. Our proposed ranking methods were compared to leading and widely accepted benchmarks, and were found to be extremely correlative but with the advantage of the data being publically available. 相似文献
This paper reports the main results of an exploratory, multiple case study investigating customer involvement practices in system development projects in the Israeli defence industry. The study proposes and examines a theoretical contingency model regarding the effect of customer involvement modes on project success, moderated by project characteristics. It focuses specifically on the working mode of customers' representatives along the continuum between external supervision to full participation in project activities. 相似文献
Ensemble methods combine several individual pattern classifiers in order to achieve better classification. The challenge is to choose the minimal number of classifiers that achieve the best performance. An ensemble that contains too many members might incur large storage requirements and even reduce the classification performance. The goal of ensemble pruning is to identify a subset of ensemble members that performs at least as good as the original ensemble and discard any other members.In this paper, we introduce the Collective-Agreement-based Pruning (CAP) method. Rather than ranking individual members, CAP ranks subsets by considering the individual predictive ability of each member along with the degree of redundancy among them. Subsets whose members highly agree with the class while having low inter-agreement are preferred. 相似文献
Projection matrices from projective spaces
have long been used in multiple-view geometry to model the perspective projection created by the pin-hole camera. In this work we introduce higher-dimensional mappings
for the representation of various applications in which the world we view is no longer rigid. We also describe the multi-view constraints from these new projection matrices (where k > 3) and methods for extracting the (non-rigid) structure and motion for each application. 相似文献