pinecone/core-2020-05-10-deduplication huggingface dataset:
Improving classification for brain computer interfaces using transitions and a moving window

Proceeding of: Biosignals 2009. International Conference on Bio-inspired Systems and Signal Processing, BIOSTEC 2009. Porto (Portugal), 14-17 January 2009The context of this paper is the brain-computer interface (BCI), and in particular the classiﬁcation of signals with machine learning methods. In this paper we intend to improve classiﬁcation accuracy by taking advantage of a feature of BCIs: instances run in sequences belonging to the same class. In that case, the classiffication problem can be reformulated into two subproblems: detecting class transitions and determining the class for sequences of instances between transitions. We detect a transition when the Euclidean distance between the power spectra at two different times is larger than a threshold. To tackle the second problem, instances are classiﬁed by taking into account, not just the prediction for that instance, but a moving window of predictions
for previous instances. Experimental results show that our transition detection method improves results for datasets of two out of three subjects of the BCI III competition. If the moving window is used, classiﬁcation
accuracy is further improved, depending on the window size.Publicad
QKD in Standard Optical Telecommunications Networks

To perform Quantum Key Distribution, the mastering of the extremely weak
signals carried by the quantum channel is required. Transporting these signals
without disturbance is customarily done by isolating the quantum channel from
any noise sources using a dedicated physical channel. However, to really profit
from this technology, a full integration with conventional network technologies
would be highly desirable. Trying to use single photon signals with others that
carry an average power many orders of magnitude bigger while sharing as much
infrastructure with a conventional network as possible brings obvious problems.
The purpose of the present paper is to report our efforts in researching the
limits of the integration of QKD in modern optical networks scenarios. We have
built a full metropolitan area network testbed comprising a backbone and an
access network. The emphasis is put in using as much as possible the same
industrial grade technology that is actually used in already installed
networks, in order to understand the throughput, limits and cost of deploying
QKD in a real network
The case for quantum key distribution

Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems.  We argue that QKD will be an important part of future cryptographic infrastructures.  It can provide long-term confidentiality for encrypted information without reliance on computational assumptions.  Although QKD still requires authentication to prevent man-in-the-middle attacks, it can make use of either information-theoretically secure symmetric key authentication or computationally secure public key authentication: even when using public key authentication, we argue that QKD still offers stronger security than classical key agreement
The costs of non-training in chronic wounds : estimates through practice simulation

The high prevalence and incidence rates of chronic wounds represent high financial
costs for patients, families, health services, and for society in general. Therefore, the proper
training of health professionals engaged in the diagnosis and treatment of these wounds can
have a very positive impact on the reduction of costs.
As technology advances rapidly, the knowledge acquired at school soon becomes outdated, and
only through lifelong learning can skills be constantly updated. Information and
Communication Technologies play a decisive role in this field. We have prepared a cost
estimate model of Non-Training, using a Simulator (Web Based System – e-fer) for the
diagnosis and treatment of chronic wounds.
The preliminary results show that the costs involved in the diagnosis and treatment of chronic
wounds are markedly higher in health professionals with less specialized training
CsFire: Transparent client-side mitigation of malicious cross-domain requests

Protecting users in the ubiquitous online world is becoming more and more important, as shown by web application security -- or the lack thereof -- making the mainstream news. One of the more harmful attacks is cross-site request forgery (CSRF), which allows an attacker to make requests to certain web applications while impersonating the user without their awareness. Existing client-side protection mechanisms do not fully mitigate the problem or have a degrading effect on the browsing experience of the user, especially with web 2.0 techniques such as AJAX, mashups and single sign-on. To fill this gap, this paper makes three contributions: first, a thorough traffic analysis on real-world traffic quantifies the amount of cross-domain traffic and identifies its specific properties. Second, a client-side enforcement policy has been constructed and a Firefox extension, named CsFire (CeaseFire), has been implemented to autonomously mitigate CSRF attacks as precise as possible. Evaluation was done using specific CSRF scenarios, as well as in real-life by a group of test users. Third, the granularity of the client-side policy is improved even further by incorporating server-specific policy refinements about intended cross-domain traffic.status: publishe
Bubble: a Javascript engine level countermeasure against heap-spraying attacks

Web browsers that support a safe language such as Javascript are becoming a platform of great interest for security attacks. One such attack is a heap-spraying attack: a new kind of attack that combines the notoriously hard to reliably exploit heap-based buffer overflow with the use of an in-browser scripting language for improved reliability. A typical heap-spraying attack allocates a high number of objects containing the attacker’s code on the heap, dramatically increasing the probability that the contents of one of these objects is executed. In this paper we present a lightweight approach that makes heap-spraying attacks in Javascript significantly harder. Our prototype, which is implemented in Firefox, has a negligible performance and memory overhead while effectively protecting against heap-spraying attacks.status: publishe
A posteriori error bounds for discontinuous Galerkin methods for
  quasilinear parabolic problems

We derive a posteriori error bounds for a quasilinear parabolic problem,
which is approximated by the $hp$-version interior penalty discontinuous
Galerkin method (IPDG). The error is measured in the energy norm. The theory is
developed for the semidiscrete case for simplicity, allowing to focus on the
challenges of a posteriori error control of IPDG space-discretizations of
strictly monotone quasilinear parabolic problems. The a posteriori bounds are
derived using the elliptic reconstruction framework, utilizing available a
posteriori error bounds for the corresponding steady-state elliptic problem.Comment: 8 pages, conference ENUMATH 200
Ideal hierarchical secret sharing schemes

Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme. We solve this problem by providing a natural definition for the family of the hierarchical access structures and, more importantly, by presenting a complete characterization of the ideal hierarchical access structures, that is, the ones admitting an ideal secret sharing scheme. Our characterization deals with the properties of the hierarchically minimal sets of the access structure, which are the minimal qualified sets whose participants are in the lowest possible levels in the hierarchy. By using our characterization, it can be efficiently checked whether any given hierarchical access structure that is defined by its hierarchically minimal sets is ideal. We use the well known connection between ideal secret sharing and matroids and, in particular, the fact that every ideal access structure is a matroid port. In addition, we use recent results on ideal multipartite access structures and the connection between multipartite matroids and integer polymatroids. We prove that every ideal hierarchical access structure is the port of a representable matroid and, more specifically, we prove that every ideal structure in this family admits ideal linear secret sharing schemes over fields of all characteristics. In addition, methods to construct such ideal schemes can be derived from the results in this paper and the aforementioned ones on ideal multipartite secret sharing. Finally, we use our results to find a new proof for the characterization of the ideal weighted threshold access structures that is simpler than the existing one.Peer ReviewedPostprint (author's final draft
Public-Key Encryption Schemes with Auxiliary Inputs

We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information-theoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems.
As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. ProceedingsNational Science Foundation (U.S.) (Grant CCF-0514167)National Science Foundation (U.S.) (Grant CCF-0635297)National Science Foundation (U.S.) (Grant NSF-0729011)Israel Science Foundation (700/08)Chais Family Fellows Progra
Composition of Zero-Knowledge Proofs with Efficient Provers

We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input). Our results are: 1.) When restricted to efficient provers, the original Goldwasser--Micali--Rackoff (GMR) definition of zero knowledge (STOC `85), here called plain zero knowledge, is closed under a constant number of sequential compositions (on the same input). This contrasts with the case of unbounded provers, where Goldreich and Krawczyk (ICALP `90, SICOMP `96) exhibited a protocol that is zero knowledge under the GMR definition, but for which the sequential composition of 2 copies is not zero knowledge. 2.) If we relax the GMR definition to only require that the simulation is indistinguishable from the verifier's view by uniform polynomial-time distinguishers, with no auxiliary input beyond the statement being proven, then again zero knowledge is not closed under sequential composition of 2 copies. 3.) We show that auxiliary-input zero knowledge with efficient provers is not closed under parallel composition of 2 copies under the assumption that there is a secure key agreement protocol (in which it is easy to recognize valid transcripts). Feige and Shamir (STOC `90) gave similar results under the seemingly incomparable assumptions that (a) the discrete logarithm problem is hard, or (b) \(UP \nsubseteq BPP \) and one-way functions exist.Engineering and Applied Science
Semi-bipartite graph visualization for gene ontology networks

In this paper we propose three layout algorithms for semi-bipartite graphs-bipartite graphs with edges in one partition-that emerge from microarray experiment analysis. We also introduce a method that effectively reduces visual complexity by removing less informative nodes. The drawing quality and running time are evaluated with five real-world datasets, and the results show significant reduction in crossing number and total edge length. All the proposed methods are available in visualization package GEOMI, and are well received by domain users
Experiences in the development of electronic care plans for the management of comorbidities

Recent studies have shown that care plans with comprehen- sive home interventions can be effective in the management of chronic patients. Evidence also exists about the importance of tailoring these care plans to patients, by integrating comorbidities. In this context, the de- velopment, implementation, outcome analysis, and reengineering of care plans adapted to particular patient groups earn relevance. We are con- cerned with the development and reengineering of electronic care plans dealing with comorbidities. Our hypothesis is that a library of reusable care plan components can facilitate these tasks. To confirm this hypoth- esis we have carried out an experiment consisting in developing a library of care plan components for the management of patients with COPD3 or CHF4, and next building a care plan for stable COPD&CHF patients by (re)using these components. In this paper we report on this experimen
Towards a possibility-theoretic approach to uncertainty in medical data interpretation for text generation

Many real-world applications that reason about events obtained from\ud
raw data must deal with the problem of temporal uncertainty, which arises due to error or inaccuracy in data. Uncertainty also compromises reasoning where relationships between events need to be inferred. This paper discusses an approach to dealing with uncertainty in temporal and causal relations using Possibility Theory, focusing on a family of medical decision support systems that aim to generate textual summaries from raw patient data in a Neonatal Intensive Care Unit. We describe a framework to capture temporal uncertainty and to express it in generated texts by mean of linguistic modifiers. These modifiers have been chosen based on a human experiment testing the association between subjective certainty about a proposition and the participants’ way of verbalising it.peer-reviewe
Using Event-B to Verify the Kmelia Components and Their Assemblies

International audienceBuilding reliable software systems from components requires to verify the consistency of components and the correctness of component assemblies. In this work, we design a verification method to address the problem of verifying the consistency of components states and the correctness of assembly contracts, using pre-/post-conditions. The starting point is specifications written with the Kmelia component model: a Kmelia component type declares provided and required services which are used to link components in component assemblies. We generate Event-B models from Kmelia specifications in such a way that we can check the consistency and also the correctness of assembly at the Kmelia level, using Event-B provers. An illustrative example based on a stock management system is used to support the presentation
Towards a Paradoxical Description Logic for the  Semantic Web

As a vision for the future of the Web, the Semantic Web is an open,  constantly changing and collaborative environment. Hence it is reasonable to expect  that knowledge sources in the SemanticWeb contain noise and inaccuracies.  However, as the logical foundation of Ontology Web Language in the Semantic  Web, description logics fail to tolerate inconsistent information. The study  of inconsistency handling in description logics is an important issue in the SemanticWeb.  One major approach to inconsistency handling is based on so-called  paraconsistent reasoning, in which standard semantics is refined so that inconsistencies  can be tolerated. Four-valued description logics are not satisfactory for  the Semantic Web in that its reasoning is a bit far from standard semantics. In  this paper, we present a paraconsistent description logic called paradoxical description  logic, which is based on a three-valued semantics. Compared to existing  paraconsistent description logics, our approach is more suitable for dealing with  inconsistent ontologies in that paraconsistent reasoning under our semantics provides  a better approximation to the standard reasoning. An important result in this  paper is that we propose a sound and complete tableau for paradoxical description  logics.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Notes on "quantum gravity" and non-commutative geometry

I hesitated for a long time before giving shape to these notes, originally
intended for preliminary reading by the attendees to the Summer School "New
paths towards quantum gravity" (Holbaek Bay, Denmark, May 2008). At the end, I
decide against just selling my mathematical wares, and for a survey,
necessarily very selective, but taking a global phenomenological approach to
its subject matter. After all, non-commutative geometry does not purport yet to
solve the riddle of quantum gravity; it is more of an insurance policy against
the probable failure of the other approaches. The plan is as follows: the
introduction invites students to the fruitful doubts and conundrums besetting
the application of even classical gravity. Next, the first experiments
detecting quantum gravitational states inoculate us a healthy dose of
skepticism on some of the current ideologies. In Section 3 we look at the
action for general relativity as a consequence of gauge theory for quantum
tensor fields. Section 4 briefly deals with the unimodular variants. Section 5
arrives at non-commutative geometry. I am convinced that, if this is to play a
role in quantum gravity, commutative and non-commutative manifolds must be
treated on the same footing; which justifies the place granted to the
reconstruction theorem. Together with Section 3, this part constitutes the main
body of the notes. Only very summarily at the end of this section we point to
some approaches to gravity within the non-commutative realm. The last section
delivers a last dose of skepticism. My efforts will have been rewarded if
someone from the young generation learns to mistrust current mindsets.Comment: 54 pages. Proceedings of the Summer School "New paths towards quantum
  gravity", Holbaek, Denmark; B. Booss-Bavnbek, G. Esposito and M. Lesch, eds.
  Springer, Berlin, 2010; pp. 3-5
Lectures on quantization of gauge systems

A gauge system is a classical field theory where among the fields there are
connections in a principal G-bundle over the space-time manifold and the
classical action is either invariant or transforms appropriately with respect
to the action of the gauge group. The lectures are focused on the path integral
quantization of such systems. Here two main examples of gauge systems are
Yang-Mills and Chern-Simons.Comment: 63 pages, 22 figures. Based on lectures given at the Summer School
  "New paths towards quantum gravity", Holbaek, Denmark, 200
Steps towards "Quantum Gravity" and the practice of science: will the
  merger of mathematics and physics work?

The author recalls general tendencies of the "mathematization" of the
sciences and derives challenges and tentative obstructions for a successful
merger of mathematics and physics on fancied steps towards "Quantum Gravity".
This is an edited version of the author's opening words to an international
workshop "Quantum Gravity: An Assessment", Denmark, May 17-18, 2008. It
followed immediately after the Quantum Gravity Summer School 2008, see
http://QuantumGravity.ruc.dk/Comment: To appear as part of a Springer Lecture Notes in Physics publication:
  "Quantum Gravity - New Paths towards Unification" (B. Booss-Bavnbek, G.
  Esposito, M. Lesch, Eds.
Deadlock-free channels and locks

The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That is, the execution may reach a state where each thread in a set waits for another thread in that set to release a lock or send a message.

This paper proposes a modular verification technique that prevents deadlocks in programs that use both message passing and locking. The approach prevents deadlocks by enforcing two rules: (0) a blocking receive is allowed only if another thread holds an obligation to send and (1) each thread must perform acquire and receive operations in accordance with a global order. The approach is proven sound and has been implemented in the Chalice program verifier.status: publishe
Amortised resource analysis with separation logic

Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative languages by embedding a logic of resources, based on Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the resources associated with each member of the structure. We present the logic on a small imperative language with procedures and mutable heap, based on Java bytecode. We have formalised the logic within the Coq proof assistant and extracted a certified verification condition generator. We demonstrate the logic on some examples, including proving termination of in-place list reversal on lists with cyclic tails
Using Ownership to Reason About Inherent Parallelism in Object-Oriented Programs

With the emergence of multi-cores into the mainstream, there is a growing need for systems to allow programmers and automated systems to reason about data dependencies and inherent parallelismin imperative object-oriented languages. In this paper we exploit the structure of object-oriented programs to abstract computational side-effects. We capture and validate these effects using a static type system. We use these as the basis of sufficient conditions for several different data and task parallelism patterns. We compliment our static type system with a lightweight runtime system to allow for parallelization in the presence of complex data flows. We have a functioning compiler and worked examples to demonstrate the practicality of our solution
Computing the Leakage of Information-Hiding Systems

International audienceWe address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the other based on techniques from quantitative counterexample generation. The second approach can be used either for exact or approximate computation, and provides feedback for debugging. These methods can be applied also in the case in which the input distribution is unknown. We then consider the interactive case and we point out that the definition of associated channel proposed in literature is not sound. We show however that the leakage can still be defined consistently, and that our methods extend smoothly
Toward a Compositional Theory of Leftist Grammars and Transformations

Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems
where symbols can only insert or erase to their left. We develop a theory of
leftist grammars seen as word transformers as a tool toward rigorous analyses
of their computational power. Our main contributions in this first paper are
(1) constructions proving that leftist transformations are closed under
compositions and transitive closures, and (2) a proof that bounded reachability
is NP-complete even for leftist grammars with acyclic rules.Comment: Full version of the FOSSACS 2010 pape