Synthesis and spectral characterization of some complexes of platinum(II) containing η-methyleugenol

Several complexes of the formula trans-[Pt(Meug)(Am)Cl₂], Meug: methyleugenol (4-allyl-1,2-dimethoxybenzene), a η²-coordinated olefin, and Am: ammine, methylamine, diethylamine, o-toluidine, m-toluidine, p-toluidine, o-anisidine, m-anisidine and p-anisidine have been prepared. UV, IR, Raman, ¹H NMR, ¹³C NMR and 2D NMR spectra of the complexes were recorded and analyzed.     

Tuning the Reactivity of a Substrate for SNAP-Tag Expands Its Application for Recognition-Driven DNA-Protein Conjugation

Recognition-driven modification has been emerging as a novel approach to modifying biomolecular targets of interest site-specifically and efficiently. To this end, protein modular adaptors (MAs) are the ideal reaction model for recognition-driven modification of DNA as they consist of both a sequence-specific DNA-binding domain (DBD) and a self-ligating protein-tag. Coupling DNA recognition by DBD and the chemoselective reaction of the protein tag could provide a highly efficient sequence-specific reaction. However, combining an MA consisting of a reactive protein-tag and its substrate, for example, SNAP-tag and benzyl guanine (BG), revealed rather nonselective reaction with DNA. Therefore new substrates of SNAP-tag have been designed to realize sequence-selective rapid crosslinking reactions of MAs with SNAP-tag. The reactions of substrates with SNAP-tag were verified by kinetic analyses to enable the sequence-selective crosslinking reaction of MA. The new substrate enables the distinctive orthogonality of SNAP-tag against CLIP-tag to achieve orthogonal DNA-protein crosslinking by six unique MAs.     

Maximal Elements Under Reference-Dependent Preferences with Applications to Behavioral Traps and Games

We study reference-dependent preference relations defined by a real-valued bivariate function and prove an existence criterion for maximal elements. Then we formulate a generalized version of the well-known Brondsted maximum principle and apply it to behavioral traps and Nash equilibrium in games with preference relations that are not necessarily partial orders.     

Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches

In this paper, we consider a task allocation model that consists of assigning a set of m unmanned aerial vehicles (UAVs) to a set of n tasks in an optimal way. The optimality is quantified by target scores. The mission is to maximize the target score while satisfying capacity constraints of both the UAVs and the tasks. This problem is known to be NP-hard. Existing algorithms are not suitable for the large scale setting. Scalability and robustness are recognized as two main issues. We deal with these issues by two optimization approaches. The first approach is the Cross-Entropy (CE) method, a generic and practical tool of stochastic optimization for solving NP-hard problem. The second one is Branch and Bound algorithm, an efficient classical tool of global deterministic optimization. The numerical results show the efficiency of our approaches, in particular the CE method for very large scale setting.     

Nontrivial periodicity in discrete delay models of population growth

In this paper, we will study the periodicity in discrete model An+1=λAn+F(An−m) of population growth, where the delay m is large enough and the nonlinearity F is unimodal function. Actually, we prove that there is a slowly oscillated periodic solution. Our method is Browder nonextremal fixed point theorem.     

A computational study of hybrid approaches of metaheuristic algorithms for the cell formation problem

In this paper we solve the 0–1 cell formation problem where the number of cells is fixed a priori and where the objective is to maximize the overall efficiency of a production system by grouping together machines providing service to similar parts into a subsystem (denoted cell). Three different methods are introduced and compared numerically. The first local search method is an implementation of simulated annealing (SA) where the definition of the neighbourhood is specific to the application and requires using a diversification and intensification strategies. The second local search method is an adaptive simulated annealing method where the neighbourhood is selected randomly at each iteration. The procedure is adaptive in the sense that the probability of selecting a neighbourhood is updated during the process. The third method is a hybrid method (HM) of a population-based method and a local search method. To improve the solution obtained with HM, we apply a SA method afterward. The best variants are very efficient to solve the 35 benchmark problems commonly used in the literature.     

Farkas-Type Results for Vector-Valued Functions with Applications

The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space defined by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including multiobjective and scalar ones), vector variational inequalities, and vector equilibrium problems.