The Experts below are selected from a list of 54 Experts worldwide ranked by ideXlab platform

Semyon M Meerkov - One of the best experts on this subject based on the ideXlab platform.

  • a system Theoretic Property of serial production lines improvability
    International Journal of Systems Science, 1995
    Co-Authors: David Jacobs, Semyon M Meerkov
    Abstract:

    A production system is described as improvable if the limited resources involved in its operation can be redistributed so that a performance measure is improved. In this paper the Property of improvability is analysed for the case of a particular system, the serial production line. Improvability of the production rate with respect to machine efficiency and work-in-process distribution is analysed, appropriate indicators of improvability are derived, and their utilization in the process of continuous improvement is discussed. It is shown, in particular, that in a well-designed system each buffer is on average half-full, and each intermediate machine has equal frequencies of blockages and starvations

  • a system Theoretic Property of serial production lines improvability
    Conference on Decision and Control, 1993
    Co-Authors: David Jacobs, Semyon M Meerkov
    Abstract:

    A production system is called improvable if the limited resources involved in its operation can be redistributed so that a performance measure is improved. In this paper, the Property of improvability is analyzed for the case of a particular system-the serial production line. Improvability of the production rate with respect to the workforce and work-in-process distribution is analyzed, appropriate indicators of improvability are derived, and their utilization in the process of continuous improvement is discussed. It is shown, in particular, that in a well designed system each buffer is, on the average, half full, and each intermediate machine has equal frequencies of blockages and starvations. >

David Jacobs - One of the best experts on this subject based on the ideXlab platform.

  • a system Theoretic Property of serial production lines improvability
    International Journal of Systems Science, 1995
    Co-Authors: David Jacobs, Semyon M Meerkov
    Abstract:

    A production system is described as improvable if the limited resources involved in its operation can be redistributed so that a performance measure is improved. In this paper the Property of improvability is analysed for the case of a particular system, the serial production line. Improvability of the production rate with respect to machine efficiency and work-in-process distribution is analysed, appropriate indicators of improvability are derived, and their utilization in the process of continuous improvement is discussed. It is shown, in particular, that in a well-designed system each buffer is on average half-full, and each intermediate machine has equal frequencies of blockages and starvations

  • a system Theoretic Property of serial production lines improvability
    Conference on Decision and Control, 1993
    Co-Authors: David Jacobs, Semyon M Meerkov
    Abstract:

    A production system is called improvable if the limited resources involved in its operation can be redistributed so that a performance measure is improved. In this paper, the Property of improvability is analyzed for the case of a particular system-the serial production line. Improvability of the production rate with respect to the workforce and work-in-process distribution is analyzed, appropriate indicators of improvability are derived, and their utilization in the process of continuous improvement is discussed. It is shown, in particular, that in a well designed system each buffer is, on the average, half full, and each intermediate machine has equal frequencies of blockages and starvations. >

Karim Khanaki - One of the best experts on this subject based on the ideXlab platform.

  • Stability, NIP, and NSOP; Model Theoretic Properties of Formulas via Topological Properties of Function Spaces
    arXiv: Logic, 2014
    Co-Authors: Karim Khanaki
    Abstract:

    We study and characterize stability, NIP and NSOP in terms of topological and measure Theoretical properties of classes of functions. We study a measure Theoretic Property, `Talagrand's stability', and explain the relationship between this Property and NIP in continuous logic. Using a result of Bourgain, Fremlin and Talagrand, we prove the `almost and Baire 1 definability' of types assuming NIP. We show that a formula $\phi(x,y)$ has the strict order Property if and only if there is a convergent sequence of continuous functions on the space of $\phi$-types such that its limit is not sequentially continuous. We deduce from this a theorem of Shelah and point out the correspondence between this theorem and the Eberlein-\v{S}mulian theorem.

  • Nonsensitivity, Stability, NIP, and Non-SOP; Model Theoretic Properties of Formulas in Continuous Logic
    2014
    Co-Authors: Karim Khanaki
    Abstract:

    We characterize SOP, NIP, and stability in terms of topological and measure Theoretical properties of classes of functions in continuous logic. We show that a formula φ(x, y) has the strict order Property if there are ai’s such that the sequence φ(x, ai) is pointwise convergence but its limit is not sequentially continuous. We deduce from this a theorem of Shelah: a theory is unstable iff it has the IP or the SOP. We study a measure Theoretic Property, Talagrand’s stability, and explain the relationship between it and the NIP in continuous logic. This makes clear that Talagrand’s stability is the ‘correct’ counterpart of NIP in integral logic. Then we study forking and independence in stable and NIP theories, and their connections to measure theory. We also study sensitive families of functions and chaotic maps and their connections with stability.

Michael Dinitz - One of the best experts on this subject based on the ideXlab platform.

  • Distributed algorithms for approximating wireless network capacity
    Proceedings - IEEE INFOCOM, 2010
    Co-Authors: Michael Dinitz
    Abstract:

    In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distributed algorithms with provable guarantees in the physical model, and show how they can be generalized to more complicated metrics and settings in which the physical assumptions are slightly violated. We also give the first algorithms in the protocol model that do not assume transmitters can coordinate with their neighbors in the interference graph, so every transmitter chooses whether to broadcast based purely on local events. Our techniques draw heavily from algorithmic game theory and machine learning theory, even though our goal is a distributed algorithm. Indeed, our main results allow every transmitter to run any algorithm it wants, so long as its algorithm has a learning-Theoretic Property known as no-regret in a game-Theoretic setting. ©2010 IEEE.

Daniel Gildea - One of the best experts on this subject based on the ideXlab platform.

  • Grammar Factorization by Tree Decomposition
    Computational Linguistics, 2011
    Co-Authors: Daniel Gildea
    Abstract:

    We describe the application of the graph-Theoretic Property known as treewidth to the problem of finding efficient parsing algorithms. This method, similar to the junction tree algorithm used in graphical models for machine learning, allows automatic discovery of efficient algorithms such as the O(n4) algorithm for bilexical grammars of Eisner and Satta.We examine the complexity of applying this method to parsing algorithms for general Linear Context-Free Rewriting Systems. We show that any polynomial-time algorithm for this problem would imply an improved approximation algorithm for the well-studied treewidth problem on general graphs.