Herein we describe the ability of the permissive glycosyltransferase (GT) OleD Loki to convert a diverse set of >15 histone deacetylase (HDAC) inhibitors (HDACis) into their corresponding hydroxamate glycosyl esters. Representative glycosyl esters were subsequently evaluated in assays for cancer cell line cytotoxicity, chemical and enzymatic stability, and axolotl embryo tail regeneration. Computational substrate docking models were predictive of enzyme-catalyzed turnover and suggest certain HDACis may form unproductive, potentially inhibitory, complexes with GTs. 相似文献
Behaviormetrika - Clustering of mixed-type datasets can be a particularly challenging task as it requires taking into account the associations between variables with different level of measurement,... 相似文献
The problem of optimal water distribution to a range of retention reservoirs in an urban sewer network during rainfall events is considered in this paper. The goal of the control actions is the minimization of overflows and eventually the reduction of their polluting impact on receiving waters. A multilayer control structure consisting of an adaptation, an optimization, and a direct control layer, is proposed for the solution of this complex control problem. Several approaches have been proposed with regard to the optimization layer. This paper proposes a linear multivariable feedback regulator that is developed via a systematic design procedure, including a simplified model, a quadratic minimization criterion, and subsequent application of the linear-quadratic optimization method. Inflow predictions are accommodated through feedforward terms in the control law. The control design guidelines facilitate a quick and efficient regulator design for a broad class of sewer network control problems. Simulation tests for a particular large network and various inflow scenarios indicate that significant overflow reductions are achieved by the application of the linear-quadratic regulator. 相似文献
A network worm is a specific type of malicious software that self propagates by exploiting application vulnerabilities in
network-connected systems. Worm propagation models are mathematical models that attempt to capture the propagation dynamics
of scanning worms as a means to understand their behaviour. It turns out that the emerged scalability in worm propagation
plays an important role in order to describe the propagation in a realistic way. On the other hand human-based countermeasures
also drastically affect the propagation in time and space. This work elaborates on a recent propagation model (Avlonitis et
al. in J Comput Virol 3, 87–92, 2007) that makes use of Partial Differential Equations in order to treat correctly scalability
and non-uniform behaviour (e.g., local preference worms). The aforementioned gradient model is extended in order to take into
account human-based countermeasures that influence the propagation of local-preference worms in the Internet. Certain aspects
of scalability emerged in random and local preference strategies are also discussed by means of random field considerations.
As a result the size of a critical network that needs to be studied in order to describe the global propagation of a scanning
worm is estimated. Finally, we present simulation results that validate the proposed analytical results and demonstrate the
higher propagation rate of local preference worms compared with random scanning worms. 相似文献
Automatic video segmentation plays a vital role in sports videos annotation. This paper presents a fully automatic and computationally efficient algorithm for analysis of sports videos. Various methods of automatic shot boundary detection have been proposed to perform automatic video segmentation. These investigations mainly concentrate on detecting fades and dissolves for fast processing of the entire video scene without providing any additional feedback on object relativity within the shots. The goal of the proposed method is to identify regions that perform certain activities in a scene. The model uses some low-level feature video processing algorithms to extract the shot boundaries from a video scene and to identify dominant colours within these boundaries. An object classification method is used for clustering the seed distributions of the dominant colours to homogeneous regions. Using a simple tracking method a classification of these regions to active or static is performed. The efficiency of the proposed framework is demonstrated over a standard video benchmark with numerous types of sport events and the experimental results show that our algorithm can be used with high accuracy for automatic annotation of active regions for sport videos. 相似文献
The success of mobile services adoption hinges on their ability to cover user needs and attract consumer interest. The extant
literature focuses on understanding the factors that might affect consumers’ actual adoption of such services through their
effect on behavioral intention; these studies are mostly based on behavioral intention theories, such as Technology Acceptance
Model, Diffusion of Innovation and Unified Theory of Acceptance and Use of Technology. In this work, new theoretical constructs
are combined with existing evidence in order to extend the Technology Acceptance Model (TAM) as it was initially established
by Davis and later further enriched by other researchers. The proposed model includes behavioral intention, perceived usefulness,
perceived ease of use, trust, innovativeness, relationship drivers, and functionality. Within this approach, relationship
drivers introduce a marketing perspective to the original models of technology adoption by building emotional connections
between the users and the mobile services. The hypothesized model is empirically tested using data collected from a survey
on m-commerce consumers. Structural Equation Modelling (SEM) was used to evaluate the causal model and Confirmatory Factor
Analysis (CFA) was performed to examine the reliability and validity of the measurement model. It is briefly concluded that
behavioral intention is directly affected by perceived usefulness, innovativeness and relationship drivers; the findings provide
interesting insights and useful hints to practitioners and researchers. 相似文献
Deep learning has catalysed progress in tasks such as face recognition and analysis, leading to a quick integration of technological solutions in multiple layers of our society. While such systems have proven to be accurate by standard evaluation metrics and benchmarks, a surge of work has recently exposed the demographic bias that such algorithms exhibit–highlighting that accuracy does not entail fairness. Clearly, deploying biased systems under real-world settings can have grave consequences for affected populations. Indeed, learning methods are prone to inheriting, or even amplifying the bias present in a training set, manifested by uneven representation across demographic groups. In facial datasets, this particularly relates to attributes such as skin tone, gender, and age. In this work, we address the problem of mitigating bias in facial datasets by data augmentation. We propose a multi-attribute framework that can successfully transfer complex, multi-scale facial patterns even if these belong to underrepresented groups in the training set. This is achieved by relaxing the rigid dependence on a single attribute label, and further introducing a tensor-based mixing structure that captures multiplicative interactions between attributes in a multilinear fashion. We evaluate our method with an extensive set of qualitative and quantitative experiments on several datasets, with rigorous comparisons to state-of-the-art methods. We find that the proposed framework can successfully mitigate dataset bias, as evinced by extensive evaluations on established diversity metrics, while significantly improving fairness metrics such as equality of opportunity.
Development of approximation techniques for highly detailed surfaces is one of the challenges faced today. We introduce a new mesh structure that allows dense triangular meshes of arbitrary topology to be approximated. The structure is constructed from the information gathered during a simplification process. Each vertex of the simplified model collects a neighbourhood of input vertices. Then, each neighbourhood is fitted by a set of local surfaces taking into account the sharp features detected. The simplified model plus the parameters of these local surfaces, conveniently stored in a file, is what we call Compact Model (CM). The input model can be approximated from its CM by refining each triangle of the simplified model. The main feature of our approach is that each triangle is refined by blending the local surfaces at its vertices, which can be done independently of the others. Consequently, adaptive reconstructions are possible, local shape deformations can be incorporated and the whole approximation process can be completely parallelized.相似文献