Results 1  10
of
305,812
ADMISSIBLE ORDERS OF JORDAN LOOPS
, 705
"... Abstract. A commutative loop is Jordan if it satisfies the identity x 2 (yx) = (x 2 y)x. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order n exists if and only if n ≥ 6 and n ̸ = 9. We also consider whether powers of elements in Jordan loops a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. A commutative loop is Jordan if it satisfies the identity x 2 (yx) = (x 2 y)x. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order n exists if and only if n ≥ 6 and n ̸ = 9. We also consider whether powers of elements in Jordan loops
Admissible Orderings and Bounds for Gröbner Basis Normal Form Algorithms
, 1997
"... The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbner basis algorithm. We present a constructive and elementary proof of Robbiano's characterization theorem for admissible orderings. Using this characterization, we give a bound on the complexity o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbner basis algorithm. We present a constructive and elementary proof of Robbiano's characterization theorem for admissible orderings. Using this characterization, we give a bound on the complexity
RSVP: A New Resource Reservation Protocol
, 1993
"... Whe origin of the RSVP protocol can be traced back to 1991, when a team of network researchers, including myself, started playing with a number of packet scheduling algorithms on the DARTNET (DARPA Testbed NETwork), a network testbed made of open source, workstationbased routers. Because scheduling ..."
Abstract

Cited by 997 (25 self)
 Add to MetaCart
scheduling algorithms simply shuffle packet processing orders according to some established rates or priorities for different data flows, to test a scheduling algorithm requires setting up the appropriate control state at each router along the data flow paths. I was challenged to design a setup protocol
The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order
 Discrete Math. Theor. Comput. Sci
, 1999
"... mportant special cases. Recently, the nonfiniteness of SAGBI bases for *,+ . )/  1032546 /7089 with respect to any admissible order was proven in [3]. In addition, it was shown that with respect to the number of variables, *,+ : )/  )032546 /089 is the "smallest" unique exampl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
mportant special cases. Recently, the nonfiniteness of SAGBI bases for *,+ . )/  1032546 /7089 with respect to any admissible order was proven in [3]. In addition, it was shown that with respect to the number of variables, *,+ : )/  )032546 /089 is the "smallest" unique
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Sample Text for Developing Admission Orders in Newborn Units for the Hepatitis B Vaccine Birth Dose
"... General orders for all newborns 1. Review a copy of the mother’s original lab report to ensure that the correct serologic test (HBsAg) was ordered and that it was ordered during this pregnancy. Perform a repeat HBsAg blood test on the pregnant woman (mother) if she was HBsAg negative during a prenat ..."
Abstract
 Add to MetaCart
General orders for all newborns 1. Review a copy of the mother’s original lab report to ensure that the correct serologic test (HBsAg) was ordered and that it was ordered during this pregnancy. Perform a repeat HBsAg blood test on the pregnant woman (mother) if she was HBsAg negative during a
Distributed QualityofService Routing in AdHoc Networks
 IEEE Journal on Selected Areas in Communications
, 1999
"... In an adhoc network, all communication is done over wireless media, typically by radio through air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The qualityofservice (QoS) routing in an ad ..."
Abstract

Cited by 291 (4 self)
 Add to MetaCart
the network. Our algorithms consider not only the QoS requirement but also the cost optimality of the routing path in order to improve the overall network performance. Extensive simulations show that high calladmission ratio and lowcost paths are achieved with modest routing overhead. The algorithms can
Results 1  10
of
305,812