A class of methods of apportionment called the relaxed divisor methods is introduced here. It is theoretically shown that their biases between small and large states decrease and eventually approach zero as the house size increases. Because the methods of Hill and Webster are examples of the class, they both are practically unbiased for the house size large enough. However, computer simulations...

know something about themselves, about each other, about how others view themselves and others, about how others think others view themselves and others, and so on. Taken to an extreme, the amount of knowledge an agent might possess to coordinate its interactions with others might outstrip the agent’s limited reasoning capacity (its available time, memory, and so on). Much of the work in studyi...

The COVID-19 pandemic brings the topic of citizen data management (CDAMA) into public eye. This study is one first attempts to analyze national approaches for CDAMA applied by governments different countries and continents in sectors. conducts a systematic overview representative contact tracing apps 21 four continents, collecting information aspects system. It then summarizes analyzes various ...

| We extend the classical interpolation method to generalized interpolation. This extension is done by replacing the interpolating function by a non-interpolating function that is applied to preeltered data, in order to preserve the interpolation condition. We show, both theoretically and practically, that this approach performs much better than classical methods, for the same computational cost.

In this contribution we study the calculation of effective coefficients for media with periodic heterogeneities. We use finite element methods of high order which allows to obtain high accuracy with relatively low computational effort. This is shown both theoretically and practically.

In this paper, some existing methods for estimating the shape parameter α of generalized Gaussian distribution (GGD) and their main features are summarized and compared with each other theoretically and practically. Some problems for the existing methods are put forward and some suggestions are also given for the further study on this problem.

Lewis and Charny have come under siege for suggesting remote questioning to decide appropriate medical care. While the criticisms are theoretically valid, the idea is so important practically that Lewis and Charny should be supported and their approach investigated as a way of making medical treatment at least more open and possibly more fair.

We present an algorithm, based on the explicit formula for L-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically and practically, and use it to prove that several RSA challenge numbers are not squarefull.

We consider the refinement of a static analysis method called thread-modular verification. It was an open question whether such a refinement can be done automatically. We present a counterexampleguided abstraction refinement algorithm for thread-modular verification and demonstrate its potential, both theoretically and practically.

We present empirical results on computing optimal dominating sets in networks by means of data reduction through preprocessing rules. Thus, we demonstrate the usefulness of so far only theoretically considered reduction techniques for practically solving one of the most important network problems in combinatorial optimization. keywords Graph Theory, Location, Topological Design, Network Models,...