Next hop of strict partial order for NSFIB construction & aggregation

2012 ◽  
Author(s):  
Qing Li ◽  
Mingwei Xu ◽  
Meng Chen
Keyword(s):  
Partial Order ◽  
Strict Partial Order

Time and Duration in Noninterleaving Concurrency

1993 ◽  
Vol 19 (3-4) ◽  
pp. 403-416
Author(s):  
David Murphy
Keyword(s):  
Partial Order ◽  
Independent Interest ◽  
Underlying Event ◽  
Strict Partial Order ◽  
Event Structures ◽  
Concurrency Theory ◽  
Finite Structures

The purpose of this paper is to present a real-timed concurrency theory in the noninterleaving tradition. The theory is based on the occurrences of actions; each occurrence or event has a start and a finish. Causality is modelled by assigning a strict partial order to these starts and finishes, while timing is modelled by giving them reals. The theory is presented in some detail. All of the traditional notions found in concurrency theories (such as conflict, confusion, liveness, and so on) are found to be expressible. Four notions of causality arise naturally from the model, leading to notions of securing. Three of the notions give rise to underlying event structures, demonstrating that our model generalises Winskel’s. Infinite structures are then analysed: a poset of finite structures is defined and suitably completed to give one containing infinite structures. These infinite structures are characterised as just those arising as limits of finite ones. Our technique here, which relies on the structure of time, is of independent interest.

A strict partial order on payoff configurations and its some properties

2011 ◽  
Vol 218 (5) ◽  
pp. 2108-2112 ◽  
Author(s):  
Kentaro Kojima ◽  
Takehiro Inohara
Keyword(s):  
Partial Order ◽  
Strict Partial Order

scholarly journals Extensions of strict partial orders in N-Groups

1978 ◽  
Vol 25 (2) ◽  
pp. 241-249 ◽  
Author(s):  
K. B. Prabhakara Rao
Keyword(s):  
Partial Order ◽  
Sufficient Conditions ◽  
Partial Orders ◽  
Necessary And Sufficient Conditions ◽  
Full Extension ◽  
Partially Ordered ◽  
Strict Partial Order ◽  
Positive Elements ◽  
Necessary And Sufficient

AbstractAn attempt is made to extend the theory of extensions of partial orders in groups to strict partially ordered N-groups. Necessary and sufficient conditions, for a strict partial order of an N-group to have a strict full extension, and for a strict partial order of an N-group to be an intersection of strict full orders, are obtained when the partially ordered near-ring N and the N-group G satisfy the condition (− x) n = − xn for all elements x in G and positive elements n in N.

Witnessing functions in bounded arithmetic and search problems

1998 ◽  
Vol 63 (3) ◽  
pp. 1095-1115 ◽  
Author(s):  
Mario Chiari ◽  
Jan Krajíček
Keyword(s):  
Partial Order ◽  
Polynomial Time ◽  
Bounded Arithmetic ◽  
Pigeonhole Principle ◽  
Search Problems ◽  
Strict Partial Order ◽  
Conservation Result ◽  
Time Structures

AbstractWe investigate the possibility to characterize (multi)functions that are-definable with smalli(i= 1, 2, 3) in fragments of bounded arithmeticT2in terms of natural search problems defined over polynomial-time structures. We obtain the following results:(1) A reformulation of known characterizations of (multi)functions that areand-definable in the theoriesand.(2) New characterizations of (multi)functions that areand-definable in the theory.(3) A new non-conservation result: the theoryis not-conservative over the theory.To prove that the theoryis not-conservative over the theory, we present two examples of a-principle separating the two theories:(a) the weak pigeonhole principle WPHP(a2,f, g) formalizing that no functionfis a bijection betweena2andawith the inverseg,(b) the iteration principle Iter(a, R, f) formalizing that no functionfdefined on a strict partial order ({0,…, a},R) can have increasing iterates.

scholarly journals On radicals over strict partial order sets

2021 ◽  
Vol 1791 (1) ◽  
pp. 012080
Author(s):  
A Yu Nikitin ◽  
A N Shevlyakov
Keyword(s):  
Partial Order ◽  
Strict Partial Order ◽  
Order Sets

Ordering

2021 ◽  
pp. 56-94
Author(s):  
A. J. Cotnoir ◽  
Achille C. Varzi
Keyword(s):  
Partial Order ◽  
Strict Partial Order ◽  
The Way

Classical mereology is based on the idea that parthood is a reflexive, transitive, antisymmetric relation—a weak partial order. Proper parthood is irreflexive, transitive, and asymmetric—serving as the corresponding strict partial order. This chapter critically and carefully evaluates each of these conditions, and considers a range of alternate definitions for proper parthood and other basic notions.. Along the way, it discusses formal relationships between these definitions, and the logical implications of adopting them. The philosophical controversies surrounding these axioms are addressed: discussing self-parts, parthood loops, mutual parts and extensionality, and non-transitive notions such as immediate parthood, local transitivity, and more.

scholarly journals Hypernym Detection Using Strict Partial Order Networks

2020 ◽  
Vol 34 (05) ◽  
pp. 7626-7633 ◽  
Author(s):  
Sarthak Dash ◽  
Md Faisal Mahbub Chowdhury ◽  
Alfio Gliozzo ◽  
Nandana Mihindukulasooriya ◽  
Nicolas Rodolfo Fauceglia
Keyword(s):  
Neural Network ◽  
Partial Order ◽  
Network Architecture ◽  
State Of The Art ◽  
Soft Constraints ◽  
Neural Network Architecture ◽  
Strict Partial Order ◽  
Generalize Type ◽  
Extensive Evaluation ◽  
Type Information

This paper introduces Strict Partial Order Networks (SPON), a novel neural network architecture designed to enforce asymmetry and transitive properties as soft constraints. We apply it to induce hypernymy relations by training with is-a pairs. We also present an augmented variant of SPON that can generalize type information learned for in-vocabulary terms to previously unseen ones. An extensive evaluation over eleven benchmarks across different tasks shows that SPON consistently either outperforms or attains the state of the art on all but one of these benchmarks.

Scale the Internet routing table by generalized next hops of strict partial order

2017 ◽  
Vol 412-413 ◽  
pp. 101-115 ◽  
Author(s):  
Qing Li ◽  
Mingwei Xu ◽  
Qi Li ◽  
Dan Wang ◽  
Yong Jiang ◽  
...  
Keyword(s):  
Partial Order ◽  
The Internet ◽  
Internet Routing ◽  
Strict Partial Order ◽  
Routing Table
Sign in / Sign up

Export Citation Format

Share Document