The fundamental symmetric functions are EXk (equal to 1 if the sum of n input bits is exactly k), THk (the sum is at least k), and MODm,r (the sum is congruent to r modulo m). It is well known that all these functions and in fact any symmetric Boolean function have linear circuit size. Simple counting shows that the circuit complexity of computing n symmetric functions is Ω(n2−o(1)) for almost ...

Given a straight-line triangulation T , an edge e in T is flippable if e is adjacent to two triangles that form a convex quadrilateral. A set of edges E in T is simultaneously flippable if each edge is flippable and no two edges are adjacent to a common triangle. Intuitively, an edge is flippable if it may be replaced with the other diagonal of its quadrilateral without creating edge-edge inter...

In this paper, we develop a model for uncertain default reasoning. It has the following characteristics: 1) basic uncertainty is estimated in terms of an interval number, and so the ignorance about knowledge can be coped with; 2) it has some capability of handling commonsense knowledge in forms of default rules with uncertainty, in which Reiter's system is a special case; and 3) the propagation...

MOTIVATION Modern biomedical and epidemiological studies often measure hundreds or thousands of biomarkers, such as gene expression or metabolite levels. Although there is an extensive statistical literature on adjusting for 'multiple comparisons' when testing whether these biomarkers are directly associated with a disease, testing whether they are biological mediators between a known risk fact...

Each member of a team consisting of n person has a secret. The k out of n simultaneous threshold secret sharing requires that any group of k members should be able to recover the secret of the other n−k members, while any group of k − 1 or less members should have no information on the secret of other team members. We show that when all secrets are independent and have size s then each team mem...

In this work, we study simultaneously resettable arguments of knowledge. As our main result, we show a construction of a constantround simultaneously resettable witness-indistinguishable argument of knowledge (simresWIAoK, for short) for any NP language. We also show two applications of simresWIAoK: the first constant-round simultaneously resettable zero-knowledge argument of knowledge in the B...

This communication describes and discusses the results obtained in studying central and )eripheral arterial pressure pulses in man by means of retrograde aortic catheterization. The pressure pulse transformation and pulse transmission in the aorticobrachial system are presented and compared with comparable tracings reported in the dog. Several normal subjects and patients with hypertension, aor...

In this paper we study the concurrent cops and robber (CCCR) game. CCCR follows the same rules as the classical, turn-based game, except for the fact that the players move simultaneously. The cops' goal is to capture the robber and the concurrent cop number of a graph is defined the minimum number of cops which guarantees capture. For the variant in which it it required to capture the robber in...