Fibrils and nanotubes assembled from a modified amyloid-β peptide fragment differ in the packing of the same β-sheet building blocks

The peptide AAKLVFF assembles into fibrils in water and nanotubes in methanol. Solid-state NMR data are consistent with fibrils constructed from β-sheet bilayers and nanotubes bounded by a wall of offset β-sheet monolayers. Remarkably distinct morphologies are thus traced to subtle differences in the arrangement of the same fundamental building blocks.

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

Accounting information systems as institutional carriers: a case study of regulatory compliance in UK asset management houses

Previously, governments have responded to the impacts of economic failures and consequently have developed more regulations to protect employees, customers, shareholders and the economic wellbeing of the state. Our research addresses how Accounting Information Systems (AIS) may act as carriers for institutionalised practices associated with maintaining regulatory compliance within the context of UK Asset Management Houses. The AIS was found to be a strong conduit for institutionalized compliance related practices, utilising symbolic systems, relational systems, routines and artefacts to carry approaches relating to regulative, normative and cultural-cognitive strands of institutionalism. Thus, AIS are integral to the development and dissipation of best practice for the management of regulatory compliance. As institutional elements are clearly present we argue that AIS and regulatory compliance provide a rich context to further institutionalism. Since AIS may act as conduits for regulatory approaches, both systems adopters and clients may benefit from actively seeking to codify and abstract best practices into AIS. However, the application of generic institutionalized approaches, which may be applied across similar organizations, must be tempered with each firm’s business environment and associated regulatory exposure. A balance should be sought between approaches specific enough to be useful but generic enough to be universally applied.

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.

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.

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.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. 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.