Combinatorial synthesis and biological evaluation of isoxazole-based libraries as antithrombotic agents

The 3-substitutedphenyl-5-isoxazolecarboxaldehydes have been identified as activated aldehydes for the generation of isoxazole-based combinatorial libraries on solid phase through automation. Three highly functionalized isoxazole-based libraries comprising of 32, 96 and 45 compounds each have been synthesized in parallel format using Baylis Hillman reaction, Michael addition, reductive amination and alkylation reactions. With an objective of lead generation all the three libraries were evaluated for their antithrombin activity in vivo.

A Combinatorial Approach to the Variable Selection in Multiple Linear Regression: Analysis of Selwood et al Data set -A Case Study.

A combinatorial protocol (CP) is introduced here to interface it with the multiple linear regression (MLR) for variable selection. The efficiency of CP-MLR is primarily based on the restriction of entry of correlated variables to the model development stage. It has been used for the analysis of Selwood et al data set [16], and the obtained models are compared with those reported from GFA [8] and MUSEUM [9] approaches. For this data set CP-MLR could identify three highly independent models (27, 28 and 31) with Q2 value in the range of 0.632-0.518. Also, these models are divergent and unique. Even though, the present study does not share any models with GFA [8], and MUSEUM [9] results, there are several descriptors common to all these studies, including the present one. Also a simulation is carried out on the same data set to explain the model formation in CP-MLR. The results demonstrate that the proposed method should be able to offer solutions to data sets with 50 to 60 descriptors in reasonable time frame. By carefully selecting the inter-parameter correlation cutoff values in CP-MLR one can identify divergent models and handle data sets larger than the present one without involving excessive computer time.

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.

Hard Court Heroes

Bundesgerichtshof (German Federal Court of Justice) Case I ZR 60/09, Judgement of 28 October 2010 (“Hartplatzhelden”)

The pollen tube: a soft shell with a hard core

Plant cell expansion is controlled by a fine-tuned balance between intracellular turgor pressure, cell wall loosening and cell wall biosynthesis. To understand these processes, it is important to gain in-depth knowledge of cell wall mechanics. Pollen tubes are tip-growing cells that provide an ideal system to study mechanical properties at the single cell level. With the available approaches it was not easy to measure important mechanical parameters of pollen tubes, such as the elasticity of the cell wall. We used a cellular force microscope (CFM) to measure the apparent stiffness of lily pollen tubes. In combination with a mechanical model based on the finite element method (FEM), this allowed us to calculate turgor pressure and cell wall elasticity, which we found to be around 0.3 MPa and 20–90 MPa, respectively. Furthermore, and in contrast to previous reports, we showed that the difference in stiffness between the pollen tube tip and the shank can be explained solely by the geometry of the pollen tube. CFM, in combination with an FEM-based model, provides a powerful method to evaluate important mechanical parameters of single, growing cells. Our findings indicate that the cell wall of growing pollen tubes has mechanical properties similar to rubber. This suggests that a fully turgid pollen tube is a relatively stiff, yet flexible cell that can react very quickly to obstacles or attractants by adjusting the direction of growth on its way through the female transmitting tissue.

A continuous-time MILP model for short-term scheduling of make-and-pack production processes

In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. 2000. The curse of reality – why process scheduling optimization problems are diffcult in practice. Computers & Chemical Engineering, 24, 323–328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.