Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

Timing Recovery Algorithms and Architectures for 2-D Magnetic Recording Systems

We investigate the problem of timing recovery for 2-D magnetic recording (TDMR) channels. We develop a timing error model for TDMR channel considering the phase and frequency offsets with noise. We propose a 2-D data-aided phase-locked loop (PLL) architecture for tracking variations in the position and movement of the read head in the down-track and cross-track directions and analyze the convergence of the algorithm under non-separable timing errors. We further develop a 2-D interpolation-based timing recovery scheme that works in conjunction with the 2-D PLL. We quantify the efficiency of our proposed algorithms by simulations over a 2-D magnetic recording channel with timing errors.

Combinatorial selection of molecular conformations and supramolecular synthons in quercetin cocrystal landscapes: a route to ternary solids

The crystallization of 28 binary and ternary cocrystals of quercetin with dibasic coformers is analyzed in terms of a combinatorial selection from a solution of preferred molecular conformations and supramolecular synthons. The crystal structures are characterized by distinctive O-H center dot center dot center dot N and O-H center dot center dot center dot O based synthons and are classified as nonporous, porous and helical. Variability in molecular conformation and synthon structure led to an increase in the energetic and structural space around the crystallization event. This space is the crystal structure landscape of the compound and is explored by fine-tuning the experimental conditions of crystallization. In the landscape context, we develop a strategy for the isolation of ternary cocrystals with the use of auxiliary template molecules to reduce the molecular and supramolecular `confusion' that is inherent in a molecule like quercetin. The absence of concomitant polymorphism in this study highlights the selectivity in conformation and synthon choice from the virtual combinatorial library in solution.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

Combinatorial crystal synthesis of ternary solids based on 2-methylresorcinol

Cocrystallization experiments of 2-methylresorcinol with several N-bases were performed to identify selective and preferred crystallization routes in relevant structural landscapes. These preferred supramolecular synthon-based crystallization routes were further enhanced by using carefully chosen coformer combinations to synthesize stoichiometric ternary solids. The exercise consists of modular selection and amplification of supramolecular synthons from single through two-to three-component molecular solids, and is equivalent to solid state combinatorial synthesis.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Rapid NMR Assignments of Proteins by Using Optimized Combinatorial Selective Unlabeling

A new approach for rapid resonance assignments in proteins based on amino acid selective unlabeling is presented. The method involves choosing a set of multiple amino acid types for selective unlabeling and identifying specific tripeptides surrounding the labeled residues from specific 2D NMR spectra in a combinatorial manner. The methodology directly yields sequence specific assignments, without requiring a contiguously stretch of amino acid residues to be linked, and is applicable to deuterated proteins. We show that a 2D N-15,H-1]HSQC spectrum with two 2D spectra can result in approximate to 50% assignments. The methodology was applied to two proteins: an intrinsically disordered protein (12kDa) and the 29kDa (268 residue) -subunit of Escherichia coli tryptophan synthase, which presents a challenging case with spectral overlaps and missing peaks. The method can augment existing approaches and will be useful for applications such as identifying active-site residues involved in ligand binding, phosphorylation, or protein-protein interactions, even prior to complete resonance assignments.

Quaternary cocrystals: combinatorial synthetic strategies based on long-range synthon Aufbau modules (LSAM)

A synthetic strategy is outlined whereby a binary cocrystal may be developed in turn into a ternary and finally into a quaternary cocrystal. The strategy hinges on the concept of the long-range synthon Aufbau module (LSAM) which is a large supramolecular synthon containing more than one type of intermolecular interaction. Modulation of these interactions may be possible with the use of additional molecular components so that higher level cocrystals are produced. We report six quaternary cocrystals here. All are obtained as nearly exclusive crystallization products when four appropriate solid compounds are taken together in solution for crystallization.