This paper deals with quadratic stabilization of discrete-time multiple-input (MI) systems by means of quantized static feedback. We consider the minimization of quantization density, which is still an open problem for MI systems. Our first contribution in this regard is to partially derive the structure that a quantizer that minimizes density for a MI system should have. The second and main co...

Submit Manuscript | http://medcraveonline.com membrane which is in fact a biological chamber. This prevents graft resorption by inducing vascularization and provides growth factors, it is a two-step procedure. The first step includes an extensive excision of infected and non-viable tissue, it is followed by careful stabilization of the bone and placement of cement spacer in the bone defect .and...

This paper examines the remediation techniques of cadmium (Cd)-contaminated dredged river sediments after land disposal in a city East China. Three techniques, including stabilization, soil leaching, and phytoremediation, are compared by analyzing performance for Cd-contaminated remediation. The experimental results showed that stabilization technique reduced leaching rate Cd from 33.3% to 14.3...

Submit Manuscript | http://medcraveonline.com membrane which is in fact a biological chamber. This prevents graft resorption by inducing vascularization and provides growth factors, it is a two-step procedure. The first step includes an extensive excision of infected and non-viable tissue, it is followed by careful stabilization of the bone and placement of cement spacer in the bone defect .and...

conclusions the trunk stabilization exercises are more effective than conventional back care exercises in the rehabilitation of patients with chronic lbp. results the results of the study demonstrated significant improvements in abdominal muscle endurance and reduction in vas and modq score of both groups (p = 0.001). the trunk stabilization exercise group showed greater gains in abdominal musc...

We show that, contrary to common belief, Dijkstra’s K-state mutual exclusion algorithm on a ring also stabilizes when the number K of states per process is one less than the number N + 1 of processes in the ring. We formalize the algorithm and verify the proof in PVS, based on Qadeer and Shankar’s work. We show that K = N is sharp by giving a counter-example for K = N − 1. ACM CCS

Self-stabilizing algorithms are designed to guarantee convergence to some desired stable state from arbitrary initial states arising out of an arbitrarily large number of faults. However, in a well-designed system, the simultaneous occurrence of a large number of faults is rare. It is therefore desirable to design algorithms that are not only self-stabilizing, but also have the ability to recov...

The k-packing problem asks for a subset S of the nodes in a graph such that the distance between any pair of nodes in S is greater than k. This problem has applications to placing facilities in a network. In the current paper we present a self-stabilizing algorithm for computing a maximal k-packing in a general graph. Our algorithm uses a constant number of variables per node. This improves the...