OBJECTIVES The aim of this study was to identify changes in the oral environment with clinical, salivary and bacterial risk markers after placement of fixed orthodontic appliances on permanent dentition. MATERIAL AND METHODS With ethical approval, we used different techniques to analyzed clinical, salivary and bacterial risk markers in 34 patients (mean age, 16.7+5.2 years), 14 males and 20 f...

Maximizing the lifetime of energy constrained wireless sensor networks is a very challenging issue. It has been demonstrated that the use of a mobile sink can significantly increase the network lifetime by balancing the load among nodes. However, in existing solutions, nodes either send their data through multihop towards the sink or store the data until the sink comes at the node’s vicinity, w...

Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

In this paper we consider an infinite buffer fluid model whose input is driven by independent semi-Markov processes+ The output capacity of the buffer is a constant+We derive upper and lower bounds for the limiting distribution of the stationary buffer content process+We discuss examples and applications where the results can be used to determine bounds on the loss probability in telecommunicat...

We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity B. At any time, the buffer cannot accommodate more than B packets. Packets arrive over time. Each packet is associated with a non-negative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left th...