scholarly journals Total Order in Content-Based Publish/Subscribe Systems

2012 ◽  
Author(s):  
Kaiwen Zhang ◽  
Vinod Muthusamy ◽  
Hans-Arno Jacobsen
Keyword(s):  
Total Order

Synchronicity II

2018 ◽  
Author(s):  
Lexi Eikelboom
Keyword(s):  
Continental Philosophy ◽  
Total Order ◽  
Radical Orthodoxy ◽  
Theological Perspective ◽  
Musical Ontology

In contrast to the previous two chapters, which theologically engage rhythm in continental philosophy, this chapter examines Augustine’s explicitly theological approach to rhythm and its various receptions. The chapter uses Przywara’s scheme of intra-creaturely and theological analogies to frame Augustine’s treatment of rhythm in chapter six of De Musica. While Agamben represents an intra-creaturely perspective, Augustine represents a theological perspective. The degree to which this synchronic, theological view, which envisions rhythm as that which binds metaphysical layers of reality together allowing for communication between them, is problematic depends on the degree to which it is uncoupled from an intra-creaturely perspective like that of Agamben. Proponents of Radical Orthodoxy who propose an Augustinian musical ontology represent such an uncoupling, leading to a total order that betrays creatureliness. Erich Przywara’s interpretation, in contrast, retains the tension in Augustine between both the theological perspective on reality as harmonious and the intra-creaturely experience of interruption.

scholarly journals Encoding Two-Dimensional Range Top-k Queries

Algorithmica ◽  
2021 ◽  
Author(s):  
Seungbum Jo ◽  
Rahul Lingala ◽  
Srinivasa Rao Satti
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Total Order ◽  
Two Dimensional ◽  
Information Theoretic ◽  
Cartesian Tree ◽  
Dimensional Range

AbstractWe consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering $${\text{Top-}}{k}$$ Top- k queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be constructed efficiently. For an $$m \times n$$ m × n array, with $$m \le n$$ m ≤ n , we first propose an encoding for answering 1-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, whose query range is restricted to $$[1 \dots m][1 \dots a]$$ [ 1 ⋯ m ] [ 1 ⋯ a ] , for $$1 \le a \le n$$ 1 ≤ a ≤ n . Next, we propose an encoding for answering for the general (4-sided) $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries that takes $$(m\lg {{(k+1)n \atopwithdelims ()n}}+2nm(m-1)+o(n))$$ ( m lg ( k + 1 ) n n + 2 n m ( m - 1 ) + o ( n ) ) bits, which generalizes the joint Cartesian tree of Golin et al. [TCS 2016]. Compared with trivial $$O(nm\lg {n})$$ O ( n m lg n ) -bit encoding, our encoding takes less space when $$m = o(\lg {n})$$ m = o ( lg n ) . In addition to the upper bound results for the encodings, we also give lower bounds on encodings for answering 1 and 4-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, which show that our upper bound results are almost optimal.

Optimal Order Picking in Carousels Storage System

2012 ◽  
Vol 601 ◽  
pp. 347-353
Author(s):  
Xiong Zhi Wang ◽  
Guo Qing Wang
Keyword(s):  
Approximation Algorithm ◽  
General Problem ◽  
Storage System ◽  
Order Picking ◽  
Total Order ◽  
Experimental Results ◽  
Optimal Order ◽  
Np Hard ◽  
Special Case

We study the order picking problem in carousels system with a single picker. The objective is to find a picking scheduling to minimizing the total order picking time. After showing the problem being strongly in NP-Hard and finding two characteristics, we construct an approximation algorithm for a special case (two carousels) and a heuristics for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show its better performance.

scholarly journals Verma modules over Virasoro-like algebras

2006 ◽  
Vol 80 (2) ◽  
pp. 179-191 ◽  
Author(s):  
Xian-Dong Wang ◽  
Kaiming Zhao
Keyword(s):  
Additive Group ◽  
Total Order ◽  
Verma Modules ◽  
Direct Sum ◽  
Highest Weight ◽  
Highest Weight Modules ◽  
Weight Modules

AbstractLet K be a field of characteristic 0, G the direct sum of two copies of the additive group of integers. For a total order ≺ on G, which is compatible with the addition, and for any ċ1, ċ2 ∈ K, we define G-graded highest weight modules M(ċ1, ċ2, ≺) over the Virasoro-like algebra , indexed by G. It is natural to call them Verma modules. In the present paper, the irreducibility of M (ċ1, ċ2, ≺) is completely determined and the structure of reducible module M (ċ1, ċ2, ≺)is also described.

A comparative analysis of grey ranking approaches

2019 ◽  
Vol 9 (4) ◽  
pp. 472-487 ◽  
Author(s):  
Davood Darvishi ◽  
Jeffrey Forrest ◽  
Sifeng Liu
Keyword(s):  
Decision Making ◽  
Comparative Analysis ◽  
Partial Order ◽  
Design Methodology ◽  
Total Order ◽  
Interval Numbers ◽  
Content Type ◽  
Important Decision ◽  
Grey Number ◽  
Order Kernel

Purpose Ranking and comparing grey numbers represent a very important decision-making procedure in any given grey environment. The purpose of this paper is to study the existing approaches of ordering interval grey numbers in the context of decision making by surveying existing definitions. Design/methodology/approach Different methods developed for comparing grey numbers are presented along with their disadvantages and advantages in terms of comparison outcomes. Practical examples are employed to show the importance and necessity of using appropriate methods to compare grey numbers. Findings Most the available methods are not suitable for pointing out which number is larger when the nuclei of the grey numbers of concern are the same. Also, these available methods are also considered in terms of partial order and total order. Kernel and degree of greyness of grey numbers method is more advantageous than other methods and almost eliminates the shortcomings of other methods. Originality/value Different methods for ranking grey numbers are presented where each of them has disadvantages and advantages. By using different methods, grey interval numbers are compared and the results show that some methods cannot make grey number comparisons in some situations. The authors intend to find a method that can compare grey numbers in any situation. The findings of this research can prevent errors that may occur based on inaccurate comparisons of grey numbers in decision making. There are various research studies on the comparison of grey numbers, but there is no research on the comparison of these methods and their disadvantages, advantages or their total or partial order.

scholarly journals Verma Modules over a Block Lie Algebra

2008 ◽  
Vol 15 (02) ◽  
pp. 235-240 ◽  
Author(s):  
Qifen Jiang ◽  
Yuezhu Wu
Keyword(s):  
Lie Algebra ◽  
Verma Module ◽  
Total Order ◽  
Block Type ◽  
Verma Modules ◽  
Additive Subgroup ◽  
Highest Weight ◽  
Proper Quotient

Let [Formula: see text] be the Lie algebra with basis {Li,j, C|i, j ∈ ℤ} and relations [Li,j, Lk,l] = ((j + 1)k - i(l + 1))Li+k, j+l + iδi, -kδj+l, -2C and [C, Li,j] = 0. It is proved that an irreducible highest weight [Formula: see text]-module is quasifinite if and only if it is a proper quotient of a Verma module. An additive subgroup Γ of 𝔽 corresponds to a Lie algebra [Formula: see text] of Block type. Given a total order ≻ on Γ and a weight Λ, a Verma [Formula: see text]-module M(Λ, ≻) is defined. The irreducibility of M(Λ, ≻) is completely determined.

Sign in / Sign up

Export Citation Format

Share Document