Sampling of Multiple Variables Based on Partially Ordered Set Theory

Searching On Division Partially Ordered Set

Let P = {pi|i = 1, 2, . . . , n} be a set of n elements with partial order defined as follows: pi ≤ pj if and only if i divides j. Assume real numbers are assigned to all members of P in an order preserving manner, this results in a set A of n real numbers. Given an unknown x ∈ R, we want to determine whether x is belong to A or not, by comparing x with as few elements of A as possible. We pres...

Partitions of a Finite Partially Ordered Set

In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...

translation of collocations from english into persian, based on ghazalas theory

غزالا همایندها را به صورت ترکیبی از دو یا چند واژه که همواره در متون مختلف زبان ها همراه با هم می آیند تعریف می نماید. از دیدگاه او روند رو به رشد میل به ترجمه ی همایندها در مطالعات ترجمه، به دلیل اهمیت آنها در انسجام ساختار زبان است. این پایان نامه اساسا به ترجمه ی همایندها منحصر شده است. هدف آن بررسی کاربرد راهکارهای غزالا در مورد ترجمه ی همایندها از انگلیسی به فارسی است. هدف دیگر آن یافتن پر...

Finite Set Theory based on Fully Ordered Lists

We present a new finite set theory implementation for ACL2 wherein sets are implemented as fully ordered lists. This order unifies the notions of set equality and element equality by creating a unique representation for each set, which in turn enables nested sets to be trivially supported and eliminates the need for congruence rules. We demonstrate that ordered sets can be reasoned about in the...

The Imbedding Operators on a Partially Ordered Set

Order-compatible Topologies on a Partially Ordered Set