pinecone/core-2020-05-10-deduplication huggingface dataset:
An evaluation framework for controlled natural languages

This paper presents a general framework called ontographs that relies on a graphical notation and enables the tool-independent and reliable evaluation of human understandability of knowledge representation languages. An experiment with 64 participants is presented that applies this framework and compares a controlled natural language to a common formal language. The results show that the controlled natural language is easier to understand, needs less learning time, and is more accepted by its users.\ud
This work was funded by the research grant (Forschungskredit) programs 2006 and 2008 of the University of Zurich. I would like to thank Alain Cohn, Norbert E. Fuchs, Kaarel Kaljurand, Marc Lutz, Cerstin Mahlow, Philipp Müller and Michael Piotrowski for their suggestions and corrections. Furthermore, I would like to acknowledge the Institute for Empirical Research in Economics of the University of Zurich for organizing the recruitment of the participants for the experiment
Generic one round group key exchange in the standard model

Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplify the design of GKE protocols by using generic building blocks. In this paper we investigate the possibility of founding GKE protocols based on a primitive called multi key encapsulation mechanism (mKEM) and describe advantages and limitations of this approach. In particular, we show how to design a one-round GKE protocol which satisfies the classical requirement of authenticated key exchange (AKE) security, yet without forward secrecy. As a result, we obtain the first one-round GKE protocol secure in the standard model. We also conduct our analysis using recent formal models that take into account both outsider and insider attacks as well as the notion of key compromise impersonation resilience (KCIR). In contrast to previous models we show how to model both outsider and insider KCIR within the definition of mutual authentication. Our analysis additionally implies that the insider security compiler by Katz and Shin from ACM CCS 2005 can be used to achieve more than what is shown in the original work, namely both outsider and insider KCIR
Efficient fuzzy matching and intersection on private datasets

At Eurocrypt’04, Freedman, Nissim and Pinkas introduced a fuzzy private matching problem. The problem is defined as follows. Given two parties, each of them having a set of vectors where each vector has T integer components, the fuzzy private matching is to securely test if each vector of one set matches any vector of another set for at least t components where t < T. In the conclusion of their paper, they asked whether it was possible to design a fuzzy private matching protocol without incurring a communication complexity with the factor (T t )  . We answer their question in the affirmative by presenting a protocol based on homomorphic encryption, combined with the novel notion of a share-hiding error-correcting secret sharing scheme, which we show how to implement with efficient decoding using interleaved Reed-Solomon codes. This scheme may be of independent interest. Our protocol is provably secure against passive adversaries, and has better efficiency than previous protocols for certain parameter values
A General Framework for Multiparty Computations

<p>Multiparty computation is a computation between multiple players which want to compute a common function based on private input. It was first proposed over 20 years ago and has since matured into a well established science. The goal of this thesis has been to develop efficient protocols for different operations used in multiparty computation and to propose uses for multiparty computation in real world systems. This thesis therefore gives the reader an overview of multiparty computation from the simplest primitives to the current state of software frameworks for multiparty computation, and provides ideas for future applications.</p><p>Included in this thesis is a proposed model of multiparty computation based on a model of communication complexity. This model provides a good foundation for the included papers and for measuring the efficiency of multiparty computation protocols. In addition to this model, a more practical approach is also included, which examines different secret sharing schemes and how they are used as building blocks for basic multiparty computation operations. This thesis identifies five basic multiparty computation operations: sharing, recombining, addition, multiplication and negation, and shows how these five operations can be used to create more complex operations. In particular two operations “less-than” and “bitwise decomposition” are examined in detail in the included papers. “less-than” performs the “&lt;” operator on two secret shared values with a secret shared result and “bitwise decomposition” takes a secret shared value and transforms it into a vector of secret shared bitwise values.</p><p>The overall goal of this thesis has been to create efficient methods for multiparty computation so that it might be used for practical applications in the future.</p>PhD i telematikkPhD in Telematic
Efficient certificateless KEM in the standard model

We give a direct construction of a certificateless key encapsulation\ud
mechanism (KEM) in the standard model that is more efficient than the generic\ud
constructions proposed before by Huang and Wong\ud
\cite{DBLP:conf/acisp/HuangW07}. We use a direct construction from Kiltz and\ud
Galindo's KEM scheme \cite{DBLP:conf/acisp/KiltzG06} to obtain a certificateless\ud
KEM in the standard model; our construction is roughly twice as efficient as\ud
the generic construction. We also address the security flaw discovered by Selvi\ud
et al. \cite{cryptoeprint:2009:462}.\u
Central Bank Challenges in the Global Economy

Introductory Remarks: There are few institutions linked to the exercise of public power in the economic sphere that have stood the test of time for as long as central banks. Indeed their
origins can be traced back to the seventeenth century when in 1668 the Swedish ‘Bank of the Estates of the Realm’ the forerunner of todays Riksbank was established by the Riksdag, at the dawn of two major armed conflicts with neighbouring
Denmark. Soon thereafter, in the midst of the Nine Year War between England and France the Bank of England was established by an Act of Parliament. Other European countries such as France and the German Reich would follow suit in
due course. Asserting that the role of central banks has changed in the course of their long history is hardly original. These changes can be observed both with regard to their main tasks, as well as their ownership and (corporate) institutional structure.
A number of central bank systems have emerged from private corporations ((joint-) stock companies) that were initially set up with the aim to raise capital for the financing of wars thus acting as the quasi-banker of government, while at the same time undertaking commercial banking. Eventually these banks would
become public corporations.  ..
Percolation on self-dual polygon configurations

Recently, Scullard and Ziff noticed that a broad class of planar percolation
models are self-dual under a simple condition that, in a parametrized version
of such a model, reduces to a single equation. They state that the solution of
the resulting equation gives the critical point. However, just as in the
classical case of bond percolation on the square lattice, self-duality is
simply the starting point: the mathematical difficulty is precisely showing
that self-duality implies criticality. Here we do so for a generalization of
the models considered by Scullard and Ziff. In these models, the states of the
bonds need not be independent; furthermore, increasing events need not be
positively correlated, so new techniques are needed in the analysis. The main
new ingredients are a generalization of Harris's Lemma to products of partially
ordered sets, and a new proof of a type of Russo-Seymour-Welsh Lemma with
minimal symmetry assumptions.Comment: Expanded; 73 pages, 24 figure
Inclusion problems for patterns with a bounded number of variables

The final publication is available at Springer via https://doi.org/10.1007/978-3-642-14455-4_11We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (Information and Computation 208 (2010)) by showing that restricting the inclusion problem to significantly more restricted classes of patterns preserves undecidability, at least for comparatively large bounds. For smaller bounds, we prove the existence of classes of patterns with complicated inclusion relations, and an open inclusion problem, that are related to the Collatz Conjecture. In addition to this, we give the first proof of the undecidability of the inclusion problem for NE-pattern languages that, in contrast to previous proofs, does not rely on the inclusion problem for E-pattern languages, and proves the undecidability of the inclusion problem for NE-pattern languages over binary and ternary alphabets. © 2010 Springer-Verlag Berlin Heidelberg
Restricted ambiguity of erasing morphisms

This conference paper was subsequently published as: REIDENBACH, D. and SCHNEIDER, J.C., 2010. Restricted ambiguity of erasing morphisms. IN: Gao, Y. ... et al (eds). Proceedings of the 14th International Conference on Developments in Language Theory, DLT 2010. Lecture Notes in Computer Science, Vol. 6224, pp.387-398.A morphism h is called ambiguous for a string s if there\ud
is another morphism that maps s to the same image as h; otherwise,\ud
it is called unambiguous. In this paper, we examine some fundamental\ud
problems on the ambiguity of erasing morphisms. We provide a detailed\ud
analysis of so-called ambiguity partitions, and our main result uses this\ud
concept to characterise those strings that have a morphism of strongly\ud
restricted ambiguity. Furthermore, we demonstrate that there are strings\ud
for which the set of unambiguous morphisms, depending on the size of\ud
the target alphabet of these morphisms, is empty, finite or infinite. Finally,\ud
we show that the problem of the existence of unambiguous erasing\ud
morphisms is equivalent to some basic decision problems for nonerasing\ud
multi-pattern languages
On the optimization of bipartite secret sharing schemes

Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants\ud
is divided in two parts, and all participants in each part play an equivalent role. We focus on the search of lower bounds by using a special class of polymatroids that is introduced here, the bipartite ones. We present a method based on linear programming to compute, for every given bipartite access structure, the best lower bound that can be obtained by this combinatorial method. In addition, we obtain some general lower bounds that improve the previously known ones, and we construct optimal secret sharing schemes for a family of bipartite access structures.Postprint (author’s final draft
Synthetic vascular ultrasound imaging through coupled fluid-structure interaction and ultrasound simulations

Although ultrasonic imaging is commonly applied in cardiovascular research and clinical practice, current blood flow and vessel wall imaging methods are still hampered by several limitations. We developed a simulation environment integrating ultrasound (US) and fluid-structure interaction (FSI) simulations, allowing construction of synthetic US-images based on physiologically realistic behavior of an artery. An in-house code was developed to strongly couple the flow solver Fluent and structural solver Abaqus using an Interface Quasi-Newton technique. A distensible tube, representing the common carotid artery (length 5cm, inner diameter 6 mm, thickness 1 mm), was simulated. A mass flow inlet boundary condition, based on flow measured in a healthy subject, was applied. A downstream pressure condition, based on a non-invasively measured pressure waveform, was used. US-simulations were performed with Field II, allowing to model realistic transducers and scan sequences as used in clinical vascular imaging. To this end, scatterers were "seeded" in the fluid and structural domain and propagated during the simulated scan procedure based on flow and structural displacement fields from FSI. Simulations yielded raw ultrasound (RF) data, which were processed for arterial wall distension and shear rate imaging. Our simulations demonstrated that (i) the wall distension application is sensitive to measurement location (highest distension found when tracking the intima-lumen transition); (ii) strong reflections between tissue transitions can potentially cloud a correct measurement; (iii) maximum shear rate was underestimated during the complete cardiac cycle, with largest discrepancy during peak systole; (iv) due to difficulties measuring near-wall velocities with US, shear rate reached its maximal value at a distance from the wall (0.812 mm for anterior and 0.689 mm for posterior side). We conclude that our FSI-US simulation environment provides realistic RF-signals which can be processed into ultrasound-derived medical images and measurements
Integration of PDMS and PMMA for Batch Fabrication of Microfluidic Devices

Polydimethylsiloxane (PDMS) finds its use in a wide range of microfluidic applications due to its flexibility and low cost . Poly(methyl methacrylate) (PMMA) attracts growing interest in microfluidics research community due to its low cost, high transparency, good mechanical and chemical properties. Combining PMMA with PDMS allows a high degree of flexibility in designing microfluidic devices. Bonding of PMMA to PDMS is a critical step for this hybrid approach. We present here a novel technique for bonding PMMA to PDMS. This technique is simple, fast and reliable. A dry adhesive layer was laminated onto the PMMA substrate. A pre-cured PDMS mixture was spin coated onto the adhesive to form a PDMS membrane. The bonding quality and the strength of the PDMS/adhesive membrane was tested using a precision pressure source. The results show that the bond can hold a pressure up to 20 kPa.Full Tex
Visualizing elements of Sha[3] in genus 2 jacobians

Mazur proved that any element xi of order three in the Shafarevich-Tate group
of an elliptic curve E over a number field k can be made visible in an abelian
surface A in the sense that xi lies in the kernel of the natural homomorphism
between the cohomology groups H^1(k,E) -> H^1(k,A). However, the abelian
surface in Mazur's construction is almost never a jacobian of a genus 2 curve.
In this paper we show that any element of order three in the Shafarevich-Tate
group of an elliptic curve over a number field can be visualized in the
jacobians of a genus 2 curve. Moreover, we describe how to get explicit models
of the genus 2 curves involved.Comment: 12 page
A Subexponential Algorithm for Evaluating Large Degree Isogenies

An isogeny between elliptic curves is an algebraic morphism which is a group
homomorphism. Many applications in cryptography require evaluating large degree
isogenies between elliptic curves efficiently. For ordinary curves of the same
endomorphism ring, the previous best known algorithm has a worst case running
time which is exponential in the length of the input. In this paper we show
this problem can be solved in subexponential time under reasonable heuristics.
Our approach is based on factoring the ideal corresponding to the kernel of the
isogeny, modulo principal ideals, into a product of smaller prime ideals for
which the isogenies can be computed directly. Combined with previous work of
Bostan et al., our algorithm yields equations for large degree isogenies in
quasi-optimal time given only the starting curve and the kernel.Comment: Final version, to appear in ANTS I
Efficient pairing computation with theta functions

The original publication is available at www.springerlink.comInternational audienceIn this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's algorithm, is its generality since it extends to all abelian varieties the classical Weil and Tate pairing formulas. In the case of dimension $1$ and $2$ abelian varieties our algorithms lead to implementations which are efficient and naturally deterministic. We also introduce symmetric Weil and Tate pairings on Kummer varieties and explain how to compute them efficiently. We exhibit a nice algorithmic compatibility between some algebraic groups quotiented by the action of the automorphism $-1$, where the $\Z$-action can be computed efficiently with a Montgomery ladder type algorithm
The Role of the Sodium-Taurocholate Cotransporting Polypeptide (NTCP) and of the Bile Salt Export Pump (BSEP) in Physiology and Pathophysiology of Bile Formation

Bile formation is an important function of the liver. Bile salts are a major constituent of bile and are secreted by hepatocytes into bile and delivered into the small intestine, where they assist in fat digestion. In the small intestine, bile salts are almost quantitatively reclaimed and transported back via the portal circulation to the liver. In the liver, hepatocytes take up bile salts and secrete them again into bile for ongoing enterohepatic circulation. Uptake of bile salts into hepatocytes occurs largely in a sodium-dependent manner by the sodium taurocholate cotransporting polypeptide NTCP. The transport properties of NTCP have been extensively characterized. It is an electrogenic member of the solute carrier family of transporters (SLC10A1) and transports predominantly bile salts and sulfated compounds, but is also able to mediate transport of additional substrates, such as thyroid hormones, drugs and toxins. It is highly regulated under physiologic and pathophysiologic conditions. Regulation of NTCP copes with changes of bile salt load to hepatocytes and prevents entry of cytotoxic bile salts during liver disease. Canalicular export of bile salts is mediated by the ATP-binding cassette transporter bile salt export pump BSEP (ABCB11). BSEP constitutes the rate limiting step of hepatocellular bile salt transport and drives enterohepatic circulation of bile salts. It is extensively regulated to keep intracellular bile salt levels low under normal and pathophysiologic situations. Mutations in the BSEP gene lead to severe progressive familial intrahepatic cholestasis. The substrates of BSEP are practically restricted to bile salts and their metabolites. It is, however, subject to inhibition by endogenous metabolites or by drugs. A sustained inhibition will lead to acquired cholestasis, which can end in liver injury
On Tractable Exponential Sums

We consider the problem of evaluating certain exponential sums. These sums
take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $,
where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate
polynomial with integer coefficients. We show that the sum can be evaluated in
polynomial time in n and log N when f is a quadratic polynomial. This is true
even when the factorization of N is unknown. Previously, this was known for a
prime modulus N. On the other hand, for very specific families of polynomials
of degree \ge 3, we show the problem is #P-hard, even for any fixed prime or
prime power modulus. This leads to a complexity dichotomy theorem - a complete
classification of each problem to be either computable in polynomial time or
#P-hard - for a class of exponential sums. These sums arise in the
classifications of graph homomorphisms and some other counting CSP type
problems, and these results lead to complexity dichotomy theorems. For the
polynomial-time algorithm, Gauss sums form the basic building blocks. For the
hardness results, we prove group-theoretic necessary conditions for
tractability. These tests imply that the problem is #P-hard for even very
restricted families of simple cubic polynomials over fixed modulus N
Approximation Algorithms for the Capacitated Domination Problem

We consider the {\em Capacitated Domination} problem, which models a
service-requirement assignment scenario and is also a generalization of the
well-known {\em Dominating Set} problem. In this problem, given a graph with
three parameters defined on each vertex, namely cost, capacity, and demand, we
want to find an assignment of demands to vertices of least cost such that the
demand of each vertex is satisfied subject to the capacity constraint of each
vertex providing the service. In terms of polynomial time approximations, we
present logarithmic approximation algorithms with respect to different demand
assignment models for this problem on general graphs, which also establishes
the corresponding approximation results to the well-known approximations of the
traditional {\em Dominating Set} problem. Together with our previous work, this
closes the problem of generally approximating the optimal solution. On the
other hand, from the perspective of parameterization, we prove that this
problem is {\it W[1]}-hard when parameterized by a structure of the graph
called treewidth. Based on this hardness result, we present exact
fixed-parameter tractable algorithms when parameterized by treewidth and
maximum capacity of the vertices. This algorithm is further extended to obtain
pseudo-polynomial time approximation schemes for planar graphs
Inapproximability of maximal strip recovery

In comparative genomic, the first step of sequence analysis is usually to
decompose two or more genomes into syntenic blocks that are segments of
homologous chromosomes. For the reliable recovery of syntenic blocks, noise and
ambiguities in the genomic maps need to be removed first. Maximal Strip
Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff
for reliably recovering syntenic blocks from genomic maps in the midst of noise
and ambiguities. Given $d$ genomic maps as sequences of gene markers, the
objective of \msr{d} is to find $d$ subsequences, one subsequence of each
genomic map, such that the total length of syntenic blocks in these
subsequences is maximized. For any constant $d \ge 2$, a polynomial-time
2d-approximation for \msr{d} was previously known. In this paper, we show that
for any $d \ge 2$, \msr{d} is APX-hard, even for the most basic version of the
problem in which all gene markers are distinct and appear in positive
orientation in each genomic map. Moreover, we provide the first explicit lower
bounds on approximating \msr{d} for all $d \ge 2$. In particular, we show that
\msr{d} is NP-hard to approximate within $\Omega(d/\log d)$. From the other
direction, we show that the previous 2d-approximation for \msr{d} can be
optimized into a polynomial-time algorithm even if $d$ is not a constant but is
part of the input. We then extend our inapproximability results to several
related problems including \cmsr{d}, \gapmsr{\delta}{d}, and
\gapcmsr{\delta}{d}.Comment: A preliminary version of this paper appeared in two parts in the
  Proceedings of the 20th International Symposium on Algorithms and Computation
  (ISAAC 2009) and the Proceedings of the 4th International Frontiers of
  Algorithmics Workshop (FAW 2010