Evolved Gas Analysis‐Mass Spectrometry to Identify the Earliest Organic Binder in Aegean Style Wall Paintings

An organic binder was identified in the painted fragments from the Canaanite palace of Tel Kabri, Israel. Recently dated to the late 18th century B.C.E. by ¹⁴C, Tel Kabri is the most ancient of the Eastern Mediterranean sites in which Aegean style paintings have been found. The application of pigments was suspected to be using an organic binding medium, particularly for the Egyptian Blue pigment. Samples of blue paint were examined using evolved gas analysis‐mass spectrometry (EGA‐MS) in order to overcome the analytical challenges imposed by highly degraded aged proteinaceous materials. Egg was identified as the binder based on the presence of hexadecanonitrile and octadecanonitrile, confirming the use of a secco painting technique. Lysozyme C from Gallus gallus was detected by proteomics analysis, confirming the presence of egg. To our knowledge, this is the earliest use of egg as a binder in Aegean style wall paintings.     

Physicochemical Investigation of HDDP Azomethine Dye as Turn-On Fluorescent Chemosensor for High Selectivity and Sensitivity of Al<Superscript>3+</Superscript> Ions

4-[(2-Hydroxy-naphthalen-1-ylmethylene)-amino]-1,5-dimethyl-2-phenyl-1,2-dihydro-pyrazol-3-one (HDDP) was synthesized by the reaction of 4-amino-1,5-dimethyl-2-phenyl-1,2-dihydro-3H-pyrazol-3-one with 2-hydroxy-l-naphthaldehyde. The structure was confirmed by the IR, ¹H-NMR, ¹³C-NMR, and EI-MS spectra and elemental analysis. Physicochemical parameters of the HDDP such as extinction coefficient, oscillator strength, transition dipole moment, Stokes shift, and fluorescence quantum yield in different solvents were studied on the basis of polarities. The interactions of various metal ions with HDDP were also studied using steady state fluorescence measurements. The emission profile reveals that it acts as off–on type fluorescent chemosensor for selective and sensitive detection of Al³⁺ ions. Complexation stoichiometry and mechanism of enhancement were determined from a Benesi–Hildebrand plot.     

Small Ubiquitin-Like Modifier Protein 3 Enhances the Solubilization of Human Bone Morphogenetic Protein 2 in <Emphasis Type="Italic">E. coli</Emphasis>

Small ubiquitin-like modifier (SUMO) fusion technology is widely used in the production of heterologous proteins from prokaryotic system to aid in protein solubilization and refolding. Due to an extensive clinical application of human bone morphogenetic protein 2 (hBMP2) in bone augmentation, total RNA was isolated from human gingival tissue and mature gene was amplified through RT-PCR, cloned (pET21a), sequence analyzed, and submitted to GenBank (Accession no. KF250425). To obtain soluble expression, SUMO3 was tagged at the N-terminus of hBMP2 gene (pET21a/SUMO3-hBMP2), transferred in BL21 codon+, and ~?40% soluble expression was obtained on induction with IPTG. The dimerized hBMP2 was confirmed with Western blot, native PAGE analysis, and purified by fast protein liquid chromatography with 0.5 M NaCl elution. The cleavage of SUMO3 tag from hBMP2 converted it to an insoluble form. Computational 3D structural analysis of the SUMO3-hBMP2 was performed and optimized by molecular dynamic simulation. Protein-protein interaction of SUMO3-hBMP2 with BMP2 receptor was carried out using HADDOCK and inferred stable interaction. The alkaline phosphatase assay of SUMO3-hBMP2 on C2C12 cells showed maximum 200-ng/ml dose-dependent activity. We conclude that SUMO3-tagged hBMP2 is more suited for generation of soluble form of the protein and addition of SUMO3 tag does not affect the functional activity of hBMP2.     

Spacer effect on triazole-linked sugar-based surfactants

A series of alkyl triazole glycoside surfactants, ATGs, differing in the length of the alkyl linker between the sugar and the triazole, was synthesized and investigated on their surfactant properties and phase behavior in water. The results indicate no significant impact of the linker on surface and interphase properties, whereas the phase behavior is affected. Higher affinity for the bicontinuous cubic phase potentially favors methylene-linked ATGs over higher homologs for drug-delivery applications. A comparison of glucose and xylose reveals a tendency for high Krafft points for propargyl xyloside based ATGs. This disfavors these surfactants with respect to both glucose analogs and higher homologs.     

On the Constant Metric Dimension of Generalized Petersen Graphs P（n, 4）

In this paper,we consider the family of generalized Petersen graphs P(n,4).We prove that the metric dimension of P(n,4) is 3 when n ≡ 0(mod 4),and is 4 when n = 4k + 3(k is even).For n ≡ 1,2(mod 4) and n = 4k + 3(k is odd),we prove that the metric dimension of P(n,4) is bounded above by 4.This shows that each graph of the family of generalized Petersen graphs P(n,4)has constant metric dimension.     

Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem

For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms.     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.     

Optimizing specimen collection for processing in clinical testing laboratories

We study the logistics of specimen collection for a clinical testing laboratory that serves sites dispersed in an urban area. The specimens that accumulate at the customer sites throughout the working day are transported to the laboratory for processing. The problem is to construct and schedule a series of tours to collect the accumulated specimens from the sites throughout the day. Two hierarchical objectives are considered: (i) maximizing the amount of specimens processed by the next morning, and (ii) minimizing the daily transportation cost. We show that the problem is NP-hard and formulate a linear Mixed Integer Programming (MIP) model to solve the bicriteria problem in two levels. We characterize properties of optimal solutions and develop a heuristic approach based on solving the MIP model with additional constraints that seeks for feasible solutions with specific characteristics. To evaluate the performance of this approach, we provide an upper bounding scheme on the daily processed amount, and develop two relaxed MIP models to generate lower bounds on the daily transportation cost. The effectiveness of the proposed solution approach is evaluated using realistic problem instances. Insights on key problem parameters and their effects on the solutions are extracted by further experiments.     

Empirical analysis of self-adaptive differential evolution

Differential evolution (DE) is generally considered as a reliable, accurate, robust and fast optimization technique. DE has been successfully applied to solve a wide range of numerical optimization problems. However, the user is required to set the values of the control parameters of DE for each problem. Such parameter tuning is a time consuming task. In this paper, a self-adaptive DE (SDE) algorithm which eliminates the need for manual tuning of control parameters is empirically analyzed. The performance of SDE is investigated and compared with other well-known approaches. The experiments conducted show that SDE generally outperform other DE algorithms in all the benchmark functions. Moreover, the performance of SDE using the ring neighborhood topology is investigated.