Search results for "Complete"
showing 10 items of 490 documents
Speeding up of microstructure reconstruction: I. Application to labyrinth patterns
2011
Recently, entropic descriptors based the Monte Carlo hybrid reconstruction of the microstructure of a binary/greyscale pattern has been proposed (Piasecki 2011 Proc. R. Soc. A 467 806). We try to speed up this method applied in this instance to the reconstruction of a binary labyrinth target. Instead of a random configuration, we propose to start with a suitable synthetic pattern created by cellular automaton. The occurrence of the characteristic attributes of the target is the key factor for reducing the computational cost that can be measured by the total number of MC steps required. For the same set of basic parameters, we investigated the following simulation scenarios: the biased/rando…
Mirror symmetry and toric degenerations of partial flag manifolds
1998
In this paper we propose and discuss a mirror construction for complete intersections in partial flag manifolds $F(n_1, ..., n_l, n)$. This construction includes our previous mirror construction for complete intersection in Grassmannians and the mirror construction of Givental for complete flag manifolds. The key idea of our construction is a degeneration of $F(n_1, ..., n_l, n)$ to a certain Gorenstein toric Fano variety $P(n_1, ..., n_l, n)$ which has been investigated by Gonciulea and Lakshmibai. We describe a natural small crepant desingularization of $P(n_1, ..., n_l, n)$ and prove a generalized version of a conjecture of Gonciulea and Lakshmibai on the singular locus of $P(n_1, ..., n…
The Topology of the Milnor Fibration
2020
The fibration theorem for analytic maps near a critical point published by John Milnor in 1968 is a cornerstone in singularity theory. It has opened several research fields and given rise to a vast literature. We review in this work some of the foundational results about this subject, and give proofs of several basic “folklore theorems” which either are not in the literature, or are difficult to find. Examples of these are that if two holomorphic map-germs are isomorphic, then their Milnor fibrations are equivalent, or that the Milnor number of a complex isolated hypersurface or complete intersection singularity \((X, \underline {0})\) does not depend on the choice of functions that define …
Analytic gradients for Mukherjee’s multireference coupled-cluster method using two-configurational self-consistent-field orbitals
2010
Analytic gradients for the state-specific multireference coupled-cluster method suggested by Mahapatra et al. [Mol. Phys. 94, 157 (1998)] (Mk-MRCC) are reported within the singles and doubles approximation using two-configurational self-consistent field (TCSCF) orbitals. The present implementation extends our previous work on Mk-MRCC gradients [E. Prochnow et al., J. Chem. Phys. 131, 064109 (2009)] which is based on restricted Hartree-Fock orbitals and consequently the main focus of the present paper is on the treatment of orbital relaxation at the TCSCF level using coupled-perturbed TCSCF theory. Geometry optimizations on m-arynes and nitrenes are presented to illustrate the influence of t…
Prediction of water's isotropic nuclear shieldings and indirect nuclear spin–spin coupling constants (SSCCs) using correlation‐consistent and polariz…
2009
Density functional theory (DFT) was used to estimate water's isotropic nuclear shieldings and indirect nuclear spin-spin coupling constants (SSCCs) in the Kohn-Sham (KS) complete basis set (CBS) limit. Correlation-consistent cc-pVxZ and cc-pCVxZ (x = D, T, Q, 5, and 6), and their modified versions (ccJ-pVxZ, unc-ccJ-pVxZ, and aug-cc-pVTZ-J) and polarization-consistent pc-n and pcJ-n (n = 0, 1, 2, 3, and 4) basis sets were used, and the results fitted with a simple mathematical formula. The performance of over 20 studied density functionals was assessed from comparison with the experiment. The agreement between the CBS DFT-predicted isotropic shieldings, spin-spin values, and the experimenta…
The minimal free resolution of fat almost complete intersections in ℙ1 x ℙ1
2017
AbstractA current research theme is to compare symbolic powers of an ideal I with the regular powers of I. In this paper, we focus on the case where I = IX is an ideal deûning an almost complete intersection (ACI) set of points X in ℙ1 × ℙ1. In particular, we describe a minimal free bigraded resolution of a non-arithmetically Cohen-Macaulay (also non-homogeneous) set 𝒵 of fat points whose support is an ACI, generalizing an earlier result of Cooper et al. for homogeneous sets of triple points. We call 𝒵 a fat ACI.We also show that its symbolic and ordinary powers are equal, i.e, .
Sequence and analysis of chromosome 3 of the plant Arabidopsis thaliana.
2000
Arabidopsis thaliana is an important model system for plant biologists. In 1996 an international collaboration (the Arabidopsis Genome Initiative) was formed to sequence the whole genome of Arabidopsis and in 1999 the sequence of the first two chromosomes was reported. The sequence of the last three chromosomes and an analysis of the whole genome are reported in this issue. Here we present the sequence of chromosome 3, organized into four sequence segments (contigs). The two largest (13.5 and 9.2 Mb) correspond to the top (long) and the bottom (short) arms of chromosome 3, and the two small contigs are located in the genetically defined centromere. This chromosome encodes 5,220 of the rough…
Decision support for centralizing cargo at a Moroccan airport hub using stochastic multicriteria acceptability analysis
2010
The geographical location of Morocco places it at the heart of important sea, air, rail and motorway transport routes between four continents. In this study we evaluate different alternatives to centralize multimodal cargo at a Moroccan airport hub. The choice depends on different socio-economical criteria, the geographical location, and the environmental impacts. Some of the criteria can be measured quantitatively, while for others only qualitative assessment is feasible. Furthermore, significant uncertainty is present in both the criteria measurements and the preferences. We aided this decision process using Stochastic Multicriteria Acceptability Analysis (SMAA). SMAA is a method that all…
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Axiomatic Foundations Of Fixed-Basis Fuzzy Topology
1999
This paper gives the first comprehensive account on various systems of axioms of fixed-basis, L-fuzzy topological spaces and their corresponding convergence theory. In general we do not pursue the historical development, but it is our primary aim to present the state of the art of this field. We focus on the following problems: