961 resultados para 2-DIMENSIONAL PACKING
Resumo:
Pure O-methyl N-methoxycarbonyl thiocarbamate CH(3)OC(S)N(H)C(O)OCH(3) (I) and O-ethyl N-methoxycarbonyl thiocarbamate, CH(3)CH(2)OC(S)N(H)C(O)OCH(3) (II), are quantitatively prepared by the addition reaction between the CH(3)OC(O)NCS and the corresponding alcohols. The compounds are characterized by multinuclear ((1)H and (13)C) and bi-dimensional ((13)C HSQC) NMR, GC-MS and FTIR spectroscopy techniques. Structural and conformational properties are analyzed using a combined approach involving crystallographic data, vibration spectra and theoretical calculations. The low-temperature (150 K) crystal structure of II was determined by X-ray diffraction methods. The substance crystallizes in the monoclinic space group P2(1)/n with a = 4.088(1)angstrom. b = 22.346(1)angstrom, c = 8.284(1)angstrom, beta = 100.687(3)degrees and Z = 4 molecules per unit cell. The conformation adopted by the thiocarbamate group -OC(S)N(H)- is syn (C=S double bond in synperiplanar orientation with respect to the N-H single bond), while the methoxycarbonyl C=O double bond is in antiperiplanar orientation with respect to the N-H bond. The non-H atoms in II are essentially coplanar and the molecules are arranged in the crystal lattice as centro-symmetric dimeric units held by N-H center dot center dot center dot S=C hydrogen bonds Id(N center dot center dot center dot S) = 3.387(1)angstrom, <(N-H center dot center dot center dot S) = 166.4(2)degrees]. Furthermore, the effect of the it electronic resonance in the structural and vibrational properties is also discussed. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
Comparative molecular field analysis (CoMFA) studies were conducted on a series of 100 isoniazid derivatives as anti-tuberculosis agents using two receptor-independent structural data set alignment strategies: (1) rigid-body fit, and (2) pharmacophore-based. Significant cross-validated correlation coefficients were obtained (CoMFA(1), q(2) = 0,75 and CoMFA(2), q(2) = 0.74), indicating the potential of the models for untested compounds. The models were then used to predict the inhibitory potency of 20 test set compounds that were not included in the training set, and the predicted values were in good agreement with the experimental results.
Resumo:
5-HT(1A) receptor plays an important role in the delayed onset of antidepressant action of a class of selective serotonin reuptake inhibitors. Moreover, 5-HT(1A) receptor levels have been shown to be altered in patients suffering from major depression. In this work, hologram quantitative structure-activity relationship (HQSAR) studies were performed on a series of arylpiperazine compounds presenting affinity to the 5-HT(1A) receptor. The models were constructed with a training set of 70 compounds. The most significant HQSAR model (q(2) = 0.81, r(2) = 0.96) was generated using atoms, bonds, connections, chirality, and donor and acceptor as fragment distinction, with fragment size of 6-9. Predictions for an external test set containing 20 compounds are in good agreement with experimental results showing the robustness of the model. Additionally, useful information can be obtained from the 2D contribution maps.
Resumo:
The count intercept is a robust method for the numerical analysis of fabrics Launeau and Robin (1996). It counts the number of intersections between a set of parallel scan lines and a mineral phase, which must be identified on a digital image. However, the method is only sensitive to boundaries and therefore supposes the user has some knowledge about their significance. The aim of this paper is to show that a proper grey level detection of boundaries along scan lines is sufficient to calculate the two-dimensional anisotropy of grain or crystal distributions without any particular image processing. Populations of grains and crystals usually display elliptical anisotropies in rocks. When confirmed by the intercept analysis, a combination of a minimum of 3 mean length intercept roses, taken on 3 more or less perpendicular sections, allows the calculation of 3-dimensional ellipsoids and the determination of their standard deviation with direction and intensity in 3 dimensions as well. The feasibility of this quick method is attested by numerous examples on theoretical objects deformed by active and passive deformation, on BSE images of synthetic magma flow, on drawing or direct analysis of thin section pictures of sandstones and on digital images of granites directly taken and measured in the field. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
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
Resumo:
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.
Resumo:
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.
Resumo:
We present an efficient numerical methodology for the 31) computation of incompressible multi-phase flows described by conservative phase-field models We focus here on the case of density matched fluids with different viscosity (Model H) The numerical method employs adaptive mesh refinements (AMR) in concert with an efficient semi-implicit time discretization strategy and a linear, multi-level multigrid to relax high order stability constraints and to capture the flow`s disparate scales at optimal cost. Only five linear solvers are needed per time-step. Moreover, all the adaptive methodology is constructed from scratch to allow a systematic investigation of the key aspects of AMR in a conservative, phase-field setting. We validate the method and demonstrate its capabilities and efficacy with important examples of drop deformation, Kelvin-Helmholtz instability, and flow-induced drop coalescence (C) 2010 Elsevier Inc. All rights reserved
Resumo:
We investigate the structure of commutative non-associative algebras satisfying the identity x(x(xy)) = 0. Recently, Correa and Hentzel proved that every commutative algebra satisfying above identity over a field of characteristic not equal 2 is solvable. We prove that every commutative finite-dimensional algebra u over a field F of characteristic not equal 2, 3 which satisfies the identity x(x(xy)) = 0 is nilpotent. Furthermore, we obtain new identities and properties for this class of algebras.
Resumo:
Let A be a (non-necessarily associative) finite-dimensional algebra over a field of characteristic zero. A quantitative estimate of the polynomial identities satisfied by A is achieved through the study of the asymptotics of the sequence of codimensions of A. It is well known that for such an algebra this sequence is exponentially bounded. Here we capture the exponential rate of growth of the sequence of codimensions for several classes of algebras including simple algebras with a special non-degenerate form, finite-dimensional Jordan or alternative algebras and many more. In all cases such rate of growth is integer and is explicitly related to the dimension of a subalgebra of A. One of the main tools of independent interest is the construction in the free non-associative algebra of multialternating polynomials satisfying special properties. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
In this paper we give a proof of the existence of an orthogonal geodesic chord on a Riemannian manifold homeomorphic to a closed disk and with concave boundary. This kind of study is motivated by the link (proved in Giambo et al. (2005) [8]) of the multiplicity problem with the famous Seifert conjecture (formulated in Seifert (1948) [1]) about multiple brake orbits for a class of Hamiltonian systems at a fixed energy level. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
We generalize the theory of Kobayashi and Oliva (On the Birkhoff Approach to Classical Mechanics. Resenhas do Instituto de Matematica e Estatistica da Universidade de Sao Paulo, 2003) to infinite dimensional Banach manifolds with a view towards applications in partial differential equations.
Resumo:
We prove a coordinatization theorem for noncommutative Jordan superalgebras of degree n > 2, describing such algebras. It is shown that the symmetrized Jordan superalgebra for a simple finite-dimensional noncommutative Jordan superalgebra of characteristic 0 and degree n > 1 is simple. Modulo a ""nodal"" case, we classify central simple finite-dimensional noncommutative Jordan superalgebras of characteristic 0.
Resumo:
Let G = Z/a x(mu) (Z/b x TL(2)(F(p))) and X(n) be an n-dimensional CW-complex with the homotopy type of the n-sphere. We determine the automorphism group Aut(G) and then compute the number of distinct homotopy types of spherical space forms with respect to free and cellular G-actions on all CW-complexes X(2dn - 1), where 2d is a period of G. Next, the group E(X(2dn - 1)/alpha) of homotopy self-equivalences of spherical space forms X(2dn - 1)/alpha, associated with such G-actions alpha on X(2dn - 1) are studied. Similar results for the rest of finite periodic groups have been obtained recently and they are described in the introduction. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
One may construct, for any function on the integers, an irreducible module of level zero for affine sl(2) using the values of the function as structure constants. The modules constructed using exponential-polynomial functions realize the irreducible modules with finite-dimensional weight spaces in the category (O) over tilde of Chari. In this work, an expression for the formal character of such a module is derived using the highest weight theory of truncations of the loop algebra.