نتایج جستجو برای: strong orientation
تعداد نتایج: 470470 فیلتر نتایج به سال:
Ni 3Al, an L12 structure intermetallic crystal, is the basic composition of the y' precipitates in nickel-based superalloys and is a major strengthening mechanism contributing to the superalloys' outstanding high-temperature mechanical properties. Many L12-structure crystals present unusual macroscopic mechanical properties, including the anomalous temperature-dependence of yield strength and s...
We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a dictionary D of d patterns, where each pattern contains a special gap symbol that can match any string, so that given a text that arrives online, a character at a time, we can report all of the patterns from D that are suffixes of the text that has arrived so far, before ...
All triangulations of euclidean oriented matroids are of the same PLhomeomorphism type by a result of Anderson. That means all triangulations of euclidean acyclic oriented matroids are PL-homeomorphic to PL-balls and that all triangulations of totally cyclic oriented matroids are PL-homeomorphic to PLspheres. For non-euclidean oriented matroids this question is wide open. One key point in the p...
We study quasipolynomials enumerating proper colorings, nowherezero tensions, and nowhere-zero flows in an arbitrary CW-complex X, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may be either modular (with values in Z/kZ for some k) or integral (with values in {−k + 1, . . . , k − 1}). We obtain deletion-contraction recurrences and closed ...
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید