The star-tree paradox refers to the conjecture that the posterior probabilities for the three unrooted trees for four species (or the three rooted trees for three species if the molecular clock is assumed) do not approach 1/3 when the data are generated using the star tree and when the amount of data approaches infinity. It reflects the more general phenomenon of high and presumably spurious po...

CISUC , Department of Informatic Engineering, University of Coimbra Portugal {lorleans, pnf}@dei.uc.pt Abstract: Many of the load-balancing algorithms used in parallel systems do not have a concern about response times: tasks (or requests) are simply dispatched to a server, which provides no guarantees about their execution times. When there is a maximum acceptable response time (i.e. deadline)...

recent droughts and indiscriminate use of ground water for agriculture, is the main problems of the especially desert country.water crisis has gripped all of country plains, and due tothe reduction of surface water resources and successive droughts, illegal exploitation of ground water resources is increasing.the knowledge of the water balance plains can be helped in the water resources managem...

Controlling bias in training datasets is vital for ensuring equal treatment, or parity, between different groups downstream applications. A naive solution to transform the data so that it statistically independent of group membership, but this may throw away too much information when a reasonable compromise fairness and accuracy desired. Another common approach limit ability particular adversar...

Since the utilization of multiuser diversity in wireless networks can increase the information theoretic capacity, much attention has been paid to schedulers exploiting multiuser diversity. It is known that there exists a tradeoff between the capacity and fairness achieved by schedulers exploiting multiuser diversity. Due to its good balance between the capacity and fairness, the one-bit feedba...

| We propose a bu®er management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the °ow with an estimated fair bandwidth share. Though V-WFQ is a hardwaree±cient...