scholarly journals Representative Skyline Queries With Total and Partial Order Domains Using US-ELM

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 10410-10420
Author(s):  
Mei Bai ◽  
Xite Wang ◽  
Guanyu Li ◽  
Bo Ning
2017 ◽  
Vol 45 (3) ◽  
pp. 121-129
Author(s):  
Kuo-Cheng Ting ◽  
Ruei-Ping Wang ◽  
Yi-Chung Chen ◽  
Don-Lin Yang ◽  
Hsi-Min Chen

Purpose Using social networks to identify users with traits similar to those of the target user has proven highly effective in the development of personalized recommendation systems. Existing methods treat all dimensions of user data as a whole, despite the fact that most of the information related to different dimensions is discrete. This has prompted researchers to adopt the skyline query for such search functions. Unfortunately, researchers have run into problems of instability in the number of users identified using this approach. Design/methodology/approach We thus propose the m-representative skyline queries to provide control over the number of similar users that are returned. We also developed an R-tree-based algorithm to implement the m-representative skyline queries. Findings By using the R-tree based algorithm, the processing speed of the m-representative skyline queries can now be accelerated. Experiment results demonstrate the efficacy of the proposed approach. Originality/value Note that with this new way of finding similar users in the social network, the performance of the personalized recommendation systems is expected to be enhanced.


2019 ◽  
Vol 7 (1) ◽  
pp. 424-430
Author(s):  
A. George Louis Raja ◽  
F. Sagayaraj Francis ◽  
P. Sugumar
Keyword(s):  

2019 ◽  
Vol 13 (5) ◽  
pp. 796-802
Author(s):  
Jiping Zheng ◽  
Shunqing Jiang ◽  
Jialiang Chen ◽  
Wei Yu

Author(s):  
Heather M Russell ◽  
Julianna Tymoczko

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.


2015 ◽  
Vol 50 (6) ◽  
pp. 250-259 ◽  
Author(s):  
Naling Zhang ◽  
Markus Kusano ◽  
Chao Wang

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Robin Hirsch ◽  
Jaš Šemrl

AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.


1993 ◽  
Vol 19 (3-4) ◽  
pp. 403-416
Author(s):  
David Murphy

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.


Sign in / Sign up

Export Citation Format

Share Document