BACKGROUND Researchers have conducted extensive studies regarding dentoalveolar factors that affect anterior dental esthetics; however, there is no consensus regarding laypeople's perspectives on these factors. METHODS The authors conducted a systematic search of electronic databases (MEDLINE, PubMed, Embase, Cochrane Library and Web of Science) until May 2010. They identified and selected ar...

We consider differentiated bandwidth allocation for short-range wireless personal communication systems: Bluetooth. Since bandwidth requirements may vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and eff icient bandwidth allocation mec...

This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send O(log n)-bit messages in each round of communication. We combine bounded inde...

Consider a communication network represented by a directed graph G = (V, E) of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose price should instead be set by a leader. This is done with the final intent of maximizing the payment she will receive for their use by a follower, whose goal is ...

In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes have the same opinion. We consider dynamic graphs in which the edges are rewired in every round (by an adversary) giving rise to the graph sequence G1, G2, ...

An integral sequence d = (d1, d2, . . . , dn) is hypergraphic if there is a simple hypergraph H with degree sequence d, and such a hypergraph H is a realization of d. A sequence d is r-uniform hypergraphic if there is a simple r-uniform hypergraph with degree sequence d. Similarly, a sequence d is r-uniformmulti-hypergraphic if there is an r-uniformhypergraph (possibly with multiple edges) with...

A k-planar graph is a graph that can be drawn in the plane such that every edge is crossed at most k times. For k ≤ 4, Pach and Tóth [19] proved a bound of (k + 3)(n− 2) on the total number of edges of a k-planar graph, which is tight for k = 1, 2. For k = 3, the bound of 6n− 12 has been improved to 11 2 n− 11 in [18] and has been shown to be optimal up to an additive constant for simple graphs...

A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit ...

There has been recent interest in combinatorial versions of classical theorems in topology. In particular, Stahl [S] and Little [3] have proved discrete versions of the Jordan Curve Theorem. The classical theorem states that a simple closed curve y separates the 2-sphere into two connected components of which y is their common boundary. The statements and proofs of the combinatorial versions in...

The performance of different ATM switch buffer queuing schemes for round-robin and weighted round-robin didn‘t have too much difference. This paper presents the discrete-event simulation provides detailed, accurate network simulation results and it observed a wide variety of network statistics. The software simulation package, OPNET, which specializes in discrete-event simulation of communicati...