Simple and effective technical procedures for the packing and application of nanospray PicoFrit HPLC columns for proteomic analyses

A simple procedure was developed for packing PicoFrit HPLC columns with chromatographic stationary phase using a reservoir fabricated from standard laboratory HPLC fittings. Packed columns were mounted onto a stainless steel ultra-low volume precolumn filter assembly containing a 0.5-mu m pore size steel frit. This format provided a conduit for the application of the nanospray voltage and protected the column from obstruction by sample material. The system was characterised and operational performance assessed by analysis of a range of peptide standards (n = 9).

Effect of a methyl group on the spontaneous resolution of a square-pyramidal coordination compound: crystal packing and conglomerate formation

Reaction of [Cu(pic)2]·2H2O (where pic stands for 2-picolinato) with 2-({[2-(dimethylamino)ethyl]amino}methyl)phenol (HL1) produces the square-pyramidal complex [CuL1(pic)] (1), which crystallizes as a conglomerate (namely a mixture of optically pure crystals) in the Sohncke space group P212121. The use of the methylated ligand at the benzylic position, i.e. (±)-2-(1-{[2-(dimethylamino)ethyl]amino}ethyl)phenol (HL2), yields the analogous five-coordinate complex [CuL2(pic)] (2) that crystallizes as a true racemate (namely the crystals contain both enantiomers) in the centrosymmetric space group P21/c. Density functional theory (DFT) calculations indicate that the presence of the methyl group indeed leads to a distinct crystallization behaviour, not only by intramolecular steric effects, but also because its involvement in non-covalent C–H···π and hydrophobic intermolecular contacts appears to be an important factor contributing to the crystal-lattice (stabilizing) energy of 2

‘The Making of the Book’: Roy Fisher, the Circle Press and the poetics of book art

Between 1972 and 2001, the English late-modernist poet Roy Fisher provided the text for nine separate artist's books produced by Ron King at the Circle Press. Taken together, as Andrew Lambirth has written, the Fisher-King collaborations represent a sustained investigation of the various ways in which text and image can be integrated, breaking the mould of the codex or folio edition, and turning the book into a sculptural object. From the three-dimensional pop-up designs of Bluebeard's Castle (1973), each representing a part of the edifice (the portcullis, the armoury and so on), to ‘alphabet books’ such as The Half-Year Letters (1983), held in an ingenious french-folded concertina which can be stretched to over a metre long or compacted to a pocketbook, the project of these art books is to complicate their own bibliographic codes, and rethink what a book can be. Their folds and reduplications give a material form to the processes by which meanings are produced: from the discovery, in Top Down, Bottom Up (1990), of how to draw on both sides of the page at the same time, to the developments of The Left-Handed Punch (1987) and Anansi Company (1992), where the book becomes first a four-dimensional theatre space, in which a new version of Punch and Judy is played out by twelve articulated puppets, and then a location for characters that are self-contained and removable, in the form of thirteen hand-made wire and card rod-puppets. Finally, in Tabernacle (2001), a seven-drawer black wooden cabinet that stands foursquare like a sculpture (and sells to galleries and collectors for over three thousand pounds), the conception of the book and the material history of print are fully undone and reconstituted. This paper analyses how the King-Fisher art books work out their radically material poetics of the book; how their emphasis on collaboration, between artist and poet, image and text, and also book and reader – the construction of meaning becoming a co-implicated process – continuously challenges hierarchies and fixities in our conception of authorship; and how they re-think the status of poetic text and the construction of the book as material object.

Quantitative ventilation assessments of idealized urban canopy layers with various urban layouts and the same building packing density

This paper investigates urban canopy layers (UCL) ventilation under neutral atmospheric condition with the same building area density (λp=0.25) and frontal area density (λf=0.25) but various urban sizes, building height variations, overall urban forms and wind directions. Turbulent airflows are first predicted by CFD simulations with standard k-ε model evaluated by wind tunnel data. Then air change rates per hour (ACH) and canopy purging flow rate (PFR) are numerically analyzed to quantify the rate of air exchange and the net ventilation capacity induced by mean flows and turbulence. With a parallel approaching wind (θ=0o), the velocity ratio first decreases in the adjustment region, followed by the fully-developed region where the flow reaches a balance. Although the flow quantities macroscopically keep constant, however ACH decreases and overall UCL ventilation becomes worse if urban size rises from 390m to 5km. Theoretically if urban size is infinite, ACH may reach a minimum value depending on local roof ventilation, and it rises from 1.7 to 7.5 if the standard deviation of building height variations increases (0% to 83.3%). Overall UCL ventilation capacity (PFR) with a square overall urban form (Lx=Ly=390m) is better as θ=0o than oblique winds (θ=15o, 30o, 45o), and it exceeds that of a staggered urban form under all wind directions (θ=0o to 45o), but is less than that of a rectangular urban form (Lx=570m, Ly=270m) under most wind directions (θ=30o to 90o). Further investigations are still required to quantify the net ventilation efficiency induced by mean flows and turbulence.

Open cluster survival within the solar circle: Teutsch 145 and Teutsch 146 star

Teutsch 145 and Teutsch 146 are shown to be open clusters (OCs) orbiting well inside the solar circle, a region where several dynamical processes combine to disrupt most OCs on a time-scale of a few 108 yr. BVI photometry from the GALILEO telescope is used to investigate the nature and derive the fundamental and structural parameters of the optically faint and poorly known OCs Teutsch 145 and 146. These parameters are computed by means of field-star-decontaminated colour-magnitude diagrams and stellar radial density profiles (RDPs). Cluster mass estimates are made based on the intrinsic mass functions (MFs). We derive the ages 200+100(-50) and 400 +/- 100 Myr, and the distances from the Sun d(circle dot) = 2.7 +/- 0.3 and 3.8 +/- 0.2 kpc, respectively, for Teutsch 145 and 146. Their integrated apparent and absolute magnitudes are m(V) approximate to 12.4 and 13.3 and M(V) approximate to -5.6 and -5.3. The MFs (detected for stars with m greater than or similar to 1 M(circle dot)) have slopes similar to Salpeter`s initial mass function. Extrapolated to the H-burning limit, the MFs would produce total stellar masses of similar to 1400 M(circle dot), typical of relatively massive OCs. Both OCs are located deep into the inner Galaxy and close to the Crux-Scutum arm. Since cluster-disruption processes are important, their primordial masses must have been higher than the present-day values. The conspicuous stellar density excess observed in the innermost bin of both RDPs might reflect the dynamical effects induced by a few 108 yr of external tidal stress.

TRANSITIVE CIRCLE EXCHANGE TRANSFORMATIONS WITH FLIPS

We study the existence of transit we exchange transformations with flips defined on the unit circle S(1). We provide a complete answer to the question of whether there exists a transitive exchange transformation of S(1) defined on a subintervals and having f flips.

Orthogonal packing of identical rectangles within isotropic convex regions

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes. Journal of the Operational Research Society (2010) 61, 306-320. doi: 10.1057/jors.2008.141 Published online 4 February 2009

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Decay of geometry for Fibonacci critical covering maps of the circle

We study the growth of Df `` (f(c)) when f is a Fibonacci critical covering map of the circle with negative Schwarzian derivative, degree d >= 2 and critical point c of order l > 1. As an application we prove that f exhibits exponential decay of geometry if and only if l <= 2, and in this case it has an absolutely continuous invariant probability measure, although not satisfying the so-called Collet-Eckmann condition. (C) 2009 Elsevier Masson SAS. All rights reserved.

Maximizing measures for endomorphisms of the circle

We study a given fixed continuous function phi : S(1) -> R and an endomorphism f : S(1)-> S(1), whose f-invariant probability measures maximize integral phi d mu. We prove that the set of endomorphisms having a f maximizing invariant measure supported on a periodic orbit is C(0) dense.