Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Langmuir 9 (1993), S. 894-898 
    ISSN: 1520-5827
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Langmuir 10 (1994), S. 3485-3487 
    ISSN: 1520-5827
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Langmuir 9 (1993), S. 2804-2807 
    ISSN: 1520-5827
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Langmuir 11 (1995), S. 3307-3311 
    ISSN: 1520-5827
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Distributed computing 1 (1986), S. 150-166 
    ISSN: 1432-0452
    Keywords: Silicon compilation ; Path expressions ; Process synchronization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Path expressions were originally proposed by Campbell and Habermann [2] as a mechanism for process synchronization at the monitor level in software. Not surprisingly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by these potential applications we investigate how to directly translate path expressions into hardware. Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed. Nevertheless, the circuits produced by our construction have are proportional to N · log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths. Furthermore, if the structure of the path expression allows partitioning, the circuit can be laid out in a distributed fashion without additional area overhead.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 15 (1996), S. 256-286 
    ISSN: 1432-0541
    Keywords: Bridge ; Cross-cut ; Disjoint paths ; MOS circuit ; Pass transistor ; Sneak path ; Complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The “bidirectional edges problem” is to find an edge-labeling of an undirected network,G=(V, E), with a source and a sink, such that an edge [u, v] ∈E is labeled (u, v) or (v, u) (or both) depending on the existence of a (simple) path from the source to sink that visits the verticesu andv, in the orderu, v orv, u, respectively. We provide several algorithms for this problem in the current paper and the sequel. In this paper we show the relation between this problem and the classical two-vertex-disjoint-paths problem and then devise a simple algorithm with a time complexity ofO(|E|·|V|2). In the sequel we improve the time complexity toO(|E|·|V|). The main technique exploits aclever partition of the graph into a set of paths and bridges which are then analyzed recursively. The bidirectional edges problem arises naturally in the context of the simulation of an MOS transistor network, in which a transistor may operate as a unilateral or a bilateral device, depending on the voltages at its source and drain nodes. For efficient simulation, it is required to detect the set of transistors that may operate as bilateral devices. Also, sometimes it is intended to propagate information in one direction only, and propagation in the wrong direction (resulting in asneak path) can cause functional error. Our algorithms can be used to detect all the sneak paths.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 26 (2000), S. 345-363 
    ISSN: 1432-0541
    Keywords: Key words. Multifinger robot hands, Grasping, Closure grasps, Grasp metrics, Fixturing, Polytope covering, Approximate geometric algorithms.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Given an object with n points on its boundary where fingers can be placed, we give algorithms to select a ``strong'' grasp with the least number c of fingers (up to a logarithmic factor) using several measures of goodness. Along similar lines, given an integer c , we find the ``best'' κ c log c finger grasp for a small constant κ . In addition, we generalize existing measures for the case of frictionless assemblies of many objects in contact. We also give an approximation scheme which guarantees a grasp quality close to the overall optimal value where fingers are not restricted to preselected points. These problems translate into a collection of convex set covering problems where we either minimize the cover size or maximize the scaling factor of an inscribed geometric object L . We present an algorithmic framework which handles these problems in a uniform way and give approximation algorithms for specific instances of L including convex polytopes and balls. The framework generalizes an algorithm for polytope covering and approximation by Clarkson [Cla] in two different ways. Let $\gamma = 1/{\lfloor d/2 \rfloor}$ , where d is the dimension of the Euclidean space containing L . For both types of problems, when L is a polytope, we get the same expected time bounds (with a minor improvement), and for a ball, the expected running time is $O(n^{1+\delta} + (nc)^{1/(1+\gamma/(1+\delta))} + c \log(n/c) (c \log c)^{\lfloor d/2 \rfloor} )$ for fixed d , and arbitrary positive δ . We improve this bound if we allow in addition a different kind of approximation for the optimal radius. We also give bounds when d is not a constant.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 7 (1992), S. 521-554 
    ISSN: 1432-0541
    Keywords: Abiding-path ; All-bidirectional-edges problem ; Ambitus ; Bridge ; Nonseparating induced cycle
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We devise a linear-time algorithm for finding an ambitus ín an undirected graph. An ambitus is a cycle in a graph containing two distinguished vertices such that certain different groups of bridges (calledB itp-,B itQ-, andB itPQ-bridges) satisfy the property that a bridge in one group does not interlace with any bridge in the other groups. Thus, an ambitus allows the graph to be cut into pieces, where, in each piece, certain graph properties may be investigated independently and recursively, and then the pieces can be pasted together to yield information about these graph properties in the original graph. In order to achieve a good time-complexity for such an algorithm employing the divide-and-conquer paradigm, it is necessary to find an ambitus quickly. We also show that, using ambitus, linear-time algorithms can be devised for abiding-path-finding and nonseparating-induced-cycle-finding problems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    ISSN: 1432-1866
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences
    Notes: Abstract Geothermometry based on the fractionation of Mn and Cd between coexisting sphalerite and galena from concordantly banded, strata-bound ores and younger vein ores of Rajpura-Dariba, Zawar, and Bandalamottu has been attempted. Different fractionation trends for the banded and vein ores in the same deposit at Rajpura-Dariba indicate different thermal regimes of final equilibration for the two varieties of ores. In contrast, a single trend incorporating both types of ores is suggestive of isothermal conditions of final equilibration for the banded and vein ores at Zawar. Unrealistically high temperatures obtained for the vein ores of Bandalamottu suggest equilibrium in the sphalerite-galena aggregates of this deposit was not attained. Thermometric data from Mn and Cd fractionation are compared with other independent geothermometric determinations obtained from fluid inclusion homogenization studies and based on phase equilibria. It has been found that, in general, the Cd-fractionation temperature (TCd) is a more reliable geothermometer than the Mn-fractionation temperature (TMn). This presumably may be due to the susceptibility of aqueous Mn species to subtle changes in $$f_{O_2 } $$ in the ore fluid and consequent heterogeneity in Mn concentration in sphalerite, thus affecting the distribution coefficient. The investigation also suggests that TCd becomes increasingly more dependable when the ores are metamorphosed and reequilibrated at higher grades of metamorphism.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Spectrochimica Acta Part A: Molecular and Biomolecular Spectroscopy Section 25 (1969), S. 288-290 
    ISSN: 0584-8539
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...